Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3, Problem 3.72HW
A.
Explanation of Solution
Given Assembly code:
# long aframe(long n, long idx, long *q)
# n in %rdi, idx in %rsi, q in %rdx
aframe:
pushq %rbp
movq %rsp, %rbp
subq $16, %rsp
leaq 30(,%rdi,8), %rax
andq $-16, %rax
subq %rax, %rsp
leaq 15(%rsp), %r8
andq $-16, %r8
Explanation:
- The instruction “pushq %rbp” creates a stack element and pushes stack pointer.
- The instruction “movq %rsp, %rbp” stores stack pointer into “%rbp”.
- The instruction “subq $16, %rsp” allocates space for “i”.
- It sets “s1” in “%rsp”.
- The instruction “leaq 30(,%rdi,8), %rax” loads value at offset “
- The instruction “andq $-16, %rax” performs “AND” operation between given immediate value and value in register “%rax”.
- The instruction “subq %rax, %rsp” allocates space for array “p”.
- It sets “s2” in “%rsp”.
- The instruction “leaq 15(%rsp), %r8” loads value at offset “
B.
Explanation of Solution
Logic in computation of p:
- The expression for “p” is shown below:
C.
Explanation of Solution
Values of n and s1:
- The details of values are shown below:
| which | e1 | n | s1 |
| Minimum | 1 | even | n%16==1 |
| Maximum | 24 | odd | n%16==0 |
- The details of minimum case are shown below:
- The “e1” cannot be 0, if “e1” equals 0, “p” should be equal to “s2”.
- When “n” is even, “
- Hence, “
D.
Explanation of Solution
Alignment properties:
- The value “p” is been aligned by 16.
- The value “s2” denotes least multiple of 16...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Draw the stack frame just before the RET instruction in the swap function is executed in the code shown below:
Programming Language Pragmatics, 4th Edition
In this problem we want to modify the single cycle datapath shown below (also in in slide #1 of
"chapter3_single_cycle_datapaths.pptx") so that it supports execution of a new instruction called jump
register (jr).
PC
Add
Read
address
Instruction
[31:0)
Instruction [25:21)
Instruction [20:16]
Instruction Instruction [15:11]
memory
(DMUXT
RegDst
Instruction [15:0]
RegWrite
Read
register 1
Read
register 2
Read
data 1
Write
Read
register data 2
Write
data Registers
16
Sign-
extend
Instruction [5:0]
32
Shift
left 2/
ALUSrc
(OMUXI)
ALU
Addresult
Zero
ALU ALU
result
ALU
control
ALUOP
#copy contents of "rs" register to PC (PC = $rs)
PCSrc
( E3X
MemWrite
Read
data
Address
Data
Write memory
data
MemRead
MemtoReg
(-MUXO)
jr $rs
You are allowed to add new control signal(s), wire(s), muxe(s) to support this instruction. First briefly
explain the required modifications. Then indicate the value of each control signal (RegDst, RegWrite,
ALUSrc, ALUOP, MemRead, Mem Write, MemToReg). You must use "X"…
Chapter 3 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Ch. 3.4 - Prob. 3.1PPCh. 3.4 - Prob. 3.2PPCh. 3.4 - Prob. 3.3PPCh. 3.4 - Prob. 3.4PPCh. 3.4 - Prob. 3.5PPCh. 3.5 - Prob. 3.6PPCh. 3.5 - Prob. 3.7PPCh. 3.5 - Prob. 3.8PPCh. 3.5 - Prob. 3.9PPCh. 3.5 - Prob. 3.10PP
Ch. 3.5 - Prob. 3.11PPCh. 3.5 - Prob. 3.12PPCh. 3.6 - Prob. 3.13PPCh. 3.6 - Prob. 3.14PPCh. 3.6 - Prob. 3.15PPCh. 3.6 - Prob. 3.16PPCh. 3.6 - Practice Problem 3.17 (solution page 331) An...Ch. 3.6 - Practice Problem 3.18 (solution page 332) Starting...Ch. 3.6 - Prob. 3.19PPCh. 3.6 - Prob. 3.20PPCh. 3.6 - Prob. 3.21PPCh. 3.6 - Prob. 3.22PPCh. 3.6 - Prob. 3.23PPCh. 3.6 - Practice Problem 3.24 (solution page 335) For C...Ch. 3.6 - Prob. 3.25PPCh. 3.6 - Prob. 3.26PPCh. 3.6 - Practice Problem 3.27 (solution page 336) Write...Ch. 3.6 - Prob. 3.28PPCh. 3.6 - Prob. 3.29PPCh. 3.6 - Practice Problem 3.30 (solution page 338) In the C...Ch. 3.6 - Prob. 3.31PPCh. 3.7 - Prob. 3.32PPCh. 3.7 - Prob. 3.33PPCh. 3.7 - Prob. 3.34PPCh. 3.7 - Prob. 3.35PPCh. 3.8 - Prob. 3.36PPCh. 3.8 - Prob. 3.37PPCh. 3.8 - Prob. 3.38PPCh. 3.8 - Prob. 3.39PPCh. 3.8 - Prob. 3.40PPCh. 3.9 - Prob. 3.41PPCh. 3.9 - Prob. 3.42PPCh. 3.9 - Practice Problem 3.43 (solution page 344) Suppose...Ch. 3.9 - Prob. 3.44PPCh. 3.9 - Prob. 3.45PPCh. 3.10 - Prob. 3.46PPCh. 3.10 - Prob. 3.47PPCh. 3.10 - Prob. 3.48PPCh. 3.10 - Prob. 3.49PPCh. 3.11 - Practice Problem 3.50 (solution page 347) For the...Ch. 3.11 - Prob. 3.51PPCh. 3.11 - Prob. 3.52PPCh. 3.11 - Practice Problem 3.52 (solution page 348) For the...Ch. 3.11 - Practice Problem 3.54 (solution page 349) Function...Ch. 3.11 - Prob. 3.55PPCh. 3.11 - Prob. 3.56PPCh. 3.11 - Practice Problem 3.57 (solution page 350) Function...Ch. 3 - For a function with prototype long decoda2(long x,...Ch. 3 - The following code computes the 128-bit product of...Ch. 3 - Prob. 3.60HWCh. 3 - In Section 3.6.6, we examined the following code...Ch. 3 - The code that follows shows an example of...Ch. 3 - This problem will give you a chance to reverb...Ch. 3 - Consider the following source code, where R, S,...Ch. 3 - The following code transposes the elements of an M...Ch. 3 - Prob. 3.66HWCh. 3 - For this exercise, we will examine the code...Ch. 3 - Prob. 3.68HWCh. 3 - Prob. 3.69HWCh. 3 - Consider the following union declaration: This...Ch. 3 - Prob. 3.71HWCh. 3 - Prob. 3.72HWCh. 3 - Prob. 3.73HWCh. 3 - Prob. 3.74HWCh. 3 - Prob. 3.75HW
Knowledge Booster
Similar questions
- 4.8 For the design entity described below: library ieee; use ieee.std_logic_1164.all; entity myckt is port (a, b, c in std_logic; w, y: out std_logic); end myckt; architecture dataflow of myckt is begin W <= not a or (b and c) ; y <= ((a and b) or c) or (not a and not b); end dataflow; (a) Draw a block diagram of the system with inputs and outputs labeled. (b) Directly translate the architecture to a gate level logic diagram of the circuit (without minimization).arrow_forwardWe have the following C function compiled to RISC-V RV321. The following assembly sequence is equivalent to the C code snippet, but an assembly instruction is missing. what should be XXXX to have an equivalent code? int fun(char a) { fcall(); return a ^ 0x50; } fun: sp, sp,-16 ra,12(sp) s2,8(sp) s2, a0 addi SW SW mv call XXX fcall ra,12(sp) 52,8(sp) lw lw addi sp,sp, 16 jr ra O xori x10,s2,51 xori a0,s2,51 O Another instruction xori a0,s0,80 xori x10,s2,80arrow_forwardQ: One way to handle parameter conversion in RPC systems is to have each machine send parameters in its native representation, with the other one doing the translation, if need be. The native system could be indicated by a code in the first byte. However, since locating the first byte in the first word is pre- cisely the problem, can this actually work?arrow_forward
- Translate the following C code into RISC-V assembly code. You can only use RV64I and RV64M instructions and cannot use pseudoinstuctions. Note that according to RISC-V spec, “In the standard RISC-V calling convention, the stack grows downward and the stack pointer is always kept 16-byte aligned.”.long long int func(int n) { if (n == 0 or n == 1 or n == 2)return n; else return n*n + func(n - 1) + 8*func(n - 2) + func(n - 3);}arrow_forwardARM ASSEMBLY code.arrow_forward7arrow_forward
- Giving assembly code for function int myfunction(int b, int c, int d); int z; _asm{ mov ebx, b mov edx, d mov ecx, c add ebx, ecx sal ebx, 2 add edx, ebx mov eax, edx mul ecx mov z, ecx } return z; write the c code of this functionarrow_forwardWrite code to implement the expression: A = (B + C) * (D + E) on 3-, 2-, 1- and 0-addressmachines. In accordance with programming language practice, computing theexpression should not change the values of its operands.arrow_forwardQuiz 5: In this problem we want to set the control signals of the datapath shown below (also in in slide # 1 of "chapter3_single_cycle_datapaths.pptx") so that it supports execution of a new instruction called swi. Single Cycle Datapath: PC Read Instru- address ction [31-0] Instruction memory Sns Add Ins 1 [25-21] 1 [20-16] [15-11]. 1[10-0] RegWrite Read register 1 Read register 2 Write register Write data Read data 1 Read data 2 Read Ins Write 3ns Sign extend 2ns MemWrite Read Read address data Write address Read Gns Write data Write 10ns ins ALUSTO1 MemRead ALU Result 2ns ALUOP1 -XEWO) ins ALUSrc2 ALUSrc3 x=3 ins ALU Result 2ns ALUOP2 swi rd, rs, rt, imm # Memory [R[rs]]= R[rt], R[rd] =R [rs]+R [rt]+Imm #this instruction copies contents of "rt" register into the main memory addressed by the "rs" register. In the same cycle it add "rs" and "rt" register contents along with the "imm" field of the instruction and writes the final result into the "rd" register. You are NOT allowed to…arrow_forward
- Computer sciencearrow_forwardEvaluate the C code statements in MIPS assembly codefor(i = 0; i < a; i++) for(j = 0; j < b; j++) D[4*j] = i + j; Assume that i is assigned to $s0, j is assigned to $s1, a is assigned to register $s2, b is assigned to $s3, and the base address of the array D is assigned to $s4arrow_forwardQuiz-1: Refer to Lecture-3 Module 1 swap (int* V, int k) { temp = V[k]; /* temp in $t0 */ V[k] = V[k+1]; V[k+1] = temp; } Write the swap() function using special registers required for accessing parameters passed to this function. Use “t” registers for any needed temporary registers.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning