3. Consider the following C code and corresponding assembly program below. // C code int s...

 

Transcribed Image Text:

3. Consider the following C code and corresponding assembly program below. // C code int s = 0; for (int i = 0; i < 1024; i++) { } x[i] = s * x[i]; s +=x[i]; ;; assembly LOOP1: LD MUL ST F4, 0 (R1) ADD F2, F2, F4 ADDI R1, R1, 8 SEQ R3, R1, R2 BEQZ R3, LOOP1 NOP FO, 0 (R1) F4, FO, F2 a) Convert the assembly code above to a DFG where the nodes of the graph represent the instructions. b) Using the DFG above, convert the assembly program above to SSA form, meaning each register only gets a single assignment and each register uses the alpha notation as we did in class. 3. Consider the following C code and corresponding assembly program below. // C code int s = 0; for (int i = 0; i < 1024; i++) { } x[i] = s * x[i]; s +=x[i]; ;; assembly LOOP1: LD MUL ST F4, 0 (R1) ADD F2, F2, F4 ADDI R1, R1, 8 SEQ R3, R1, R2 BEQZ R3, LOOP1 NOP FO, 0 (R1) F4, FO, F2 a) Convert the assembly code above to a DFG where the nodes of the graph represent the instructions. b) Using the DFG above, convert the assembly program above to SSA form, meaning each register only gets a single assignment and each register uses the alpha notation as we did in class.

Answer rating: 100% (QA)

The image youve provided contains a C code snippet along with its equivalent assembly code The request is to convert the assembly code into a Data Flow Graph DFG and then further convert the assembly ... View the full answer