Draw the stack frame just before the RET instruction in the swap function is executed in the code shown below: BRmain.EQUATE 2.EQUATE O;local variable #2d;local variable #2dа:b:;******* void swap(int *r, int *s). EQUATE 6. EQUATΕ 4.EQUATE 0¡formal parameter #2h;formal parameter #2h;local variable #2d;push #temp;temp = *rr:s:temp:swap:SUBSP2,ir,sftemp,ss,sfr,sftemp,ss,sf2,iLDWASTWALDWA;*r := *sSTWALDWA;*s = tempSTWAADDSP¡pop #tempRET;******* void order(int *x, int *y).EQUATE 4.EQUATE 2х, sfy,sfendIf;formal parameter #2h;formal parameter #2h;if (*x > *y)х:y:order:LDWACPWABRLELDWAX,S;move xSTWA-2,sLDWAy,s-4,s4,i;move ySTWA¡push #r #s; swap(x, y)¡ pop #s #rSUBSPCALLswap4,iADDSPendIf:RET

Stack frame It is activation record. It is the area of stack set for a procedure's return address,…

BR main .EQUATE 2 .EQUATE O ;local variable #2d ;local variable #2d а: b: ;******* void swap(int *r, int *s) .EQUATE 6 .EQUATE 4 . EQUATΕ 0 2,i r,sf temp,s s,sf r,sf temp,s s,sf 2,i ¡formal parameter #2h ¡formal parameter #2h ;local variable #2d ¡push #temp ;temp = *r r: s: temp: swap: SUBSP LDWA STWA LDWA ;*r = *s STWA LDWA ;*s temp STWA ADDSP ¡pop #temp RET ;******* void order(int *x, int *y) .EQUATE 4 .EQUATE 2 х, sf y, sf endIf ;formal parameter #2h ;formal parameter #2h ;if (*x > *y) x: y: order: LDWA CPWA BRLE LDWA x,S -2,s ;move x STWA LDWA y,s -4,s 4,i ;move y STWA ;push #r #s ; swap(x, y) ¡pop #s #r SUBSP CALL swap 4,i ADDSP endIf: RET

BR main .EQUATE 2 .EQUATE O ;local variable #2d ;local variable #2d а: b: ;******* void swap(int r, int s) .EQUATE 6 .EQUATE 4 . EQUATΕ 0 2,i r,sf temp,s s,sf r,sf temp,s s,sf 2,i ¡formal parameter #2h ¡formal parameter #2h ;local variable #2d ¡push #temp ;temp = r r: s: temp: swap: SUBSP LDWA STWA LDWA ;r = s STWA LDWA ;s temp STWA ADDSP ¡pop #temp RET ;******* void order(int x, int y) .EQUATE 4 .EQUATE 2 х, sf y, sf endIf ;formal parameter #2h ;formal parameter #2h ;if (x > y) x: y: order: LDWA CPWA BRLE LDWA x,S -2,s ;move x STWA LDWA y,s -4,s 4,i ;move y STWA ;push #r #s ; swap(x, y) ¡pop #s #r SUBSP CALL swap 4,i ADDSP endIf: RET

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Add #45, when this instruction is executed the following happen/s A. The value 45 gets added to the…

A: - We need to choose what happens in case the instruction Add #45 is called. - The options :- The…

Q: 3. Find the contents of the stack and stack pointer after the execution of the CALL instruction…

A: IP = 673D will be stored in the stack at 1295 and 1294, therefore SS:1295 = 67 and SS:1294 = 3D.And…

Q: What occurs when a RET instruction is executed? a procedure is invoked pops top of stack into EIP a…

A: Offset of next instruction pushed on the stack

Q: x Suppose in the year 2102 that evaluating 0.72 for an input parameter x becomes an important…

A: Following is the algorithm of the code :=To represent the f_p72 instruction, define the function…

Q: create a c program to convert infix expression to postfix expression using stack and print its…

A: create a c program to convert infix expression to postfix expression using stack and print its…

Q: The STACK is a dynamic data structure. The 80x86 computer controls its stack via stack pointer ESP.…

A: POP operation deletes the data item from the top of the stack and the ESP pointer will get increased…

Q: 61. If the current values in the stack segment register and stack pointer are C00016 and FF0016,…

A: The question is answered in step2

Q: PROGRAM 4: Double Table Using the ROL instruction to perform multiplication, write a program to…

A: THE ALGORITHM IS GIVEN BELOW:- 1. start2. Set the const int MAX_ROWS = 33. Set the const int…

Q: Q2. Refer to datapath design on slide no. 26 with added blocks for jump instructions as shown in…

A: In a datapath design with control and jumps, the datapath includes additional logic to handle branch…

Q: Based on the diagram below, what is the carry flag result "CF" after executing the mnemonic…

A: The carry flag is a status flag used in computer processors to indicate whether an arithmetic…

Q: ASSEMBLY with irvine32.inc Write a procedure called add3, which takes it three parameters from the…

A: Take three parameters in the stack. Add these numbers. Return the sum. print Success in the end.

Q: Copy the top 2 words from the stack into registers AX and CX respectively. Do this without changing…

A: Below i have answered:

Concept explainers

Computer Fundamentals

The computer is termed computation. For calculating or computing something the device that has been used is known as the computer. Or we can say that for performing a fast arithmetic operation the device that has been used is a computer. Storing, processing, and retrieving are the main features of a computer. 

Question

Draw the stack frame just before the RET instruction in the swap function is executed in the code shown below:

BR
main
.EQUATE 2
.EQUATE O
;local variable #2d
;local variable #2d
а:
b:
;******* void swap(int *r, int *s)
. EQUATE 6
. EQUATΕ 4
.EQUATE 0
¡formal parameter #2h
;formal parameter #2h
;local variable #2d
;push #temp
;temp = *r
r:
s:
temp:
swap:
SUBSP
2,i
r,sf
temp,s
s,sf
r,sf
temp,s
s,sf
2,i
LDWA
STWA
LDWA
;*r :
= *s
STWA
LDWA
;*s = temp
STWA
ADDSP
¡pop #temp
RET
;******* void order(int *x, int *y)
.EQUATE 4
.EQUATE 2
х, sf
y,sf
endIf
;formal parameter #2h
;formal parameter #2h
;if (*x > *y)
х:
y:
order:
LDWA
CPWA
BRLE
LDWA
X,S
;move x
STWA
-2,s
LDWA
y,s
-4,s
4,i
;move y
STWA
¡push #r #s
; swap(x, y)
¡ pop #s #r
SUBSP
CALL
swap
4,i
ADDSP
endIf:
RET

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Can you finish the code pleaseaccording to the instruction For the stack, perform the following operations in order - Push seven (7) objects starting from the array index 13 onwards to the stack. Peek the top of the stack - print the result. Perform three (3) pops in succession. Print the contents of the stack. Push five (5) more objects from the start of the objects array to the stack. Pop twice in succession. Print the contents of the stack. For the queue, perform the following operations in order - Enqueue the seven (7) objects at odd indexes starting from index 5 in the array. Peek the front and end of the queue - print the results. Perform two (2) dequeues in succession. Print the contents of the queue. Enqueue five (5) more objects from the index 10 in the array. Dequeue three times in succession. Print the contents of the queue. End the program with a leaving message of your choice. Remember to clean up before the program ends. Restrict all your input / output…
Q2. Refer to datapath design on slide no. 26 with added blocks for jump instructions as shown in slide 33 in Chapter 4 (part 1). Let's assume a program has 500 instructions. These instructions are distributed as follows: R-Type 25% Immediate arithmetic (addi) 5% Load 20% Store 20% Branch 10% Jump 20% Answer the following questions (show calculations): a) How many instructions will use instruction memory? b) How many instructions will use data memory? c) How many instructions will use the sign extend block? d) In the clock cycles, where the sign extend block is not required, does it remain idle? If yes, how? If not, what happens to the output of the block in that cycle?
do { flag[i] = true; turn = i; while (flag[j] && turn == j); Critical section flag[i] = FALSE; Remainder section } Three processes P1, P2, and P3 are sharing a resource R1 in a mutually exclusive manner. Using compare_and_swap instruction, show code for P1, P2, and P3 that shows the entry section and exit section (similar to the code shown in Question 1). Using this code, show a scenario if all three processes want to enter their critical sections.
translate the following MIPS code to C. Assume that the variables i, j, and k areassigned to the registers $s0, $s1, and $s2, respectively. Assume that the baseaddress of the array A is in registers $s6.Loop: blt $s0, $s1, Exitbge $s1, $s2, Exitaddi $s1, $s1, 5j LoopExit:addi $t0, $zero, 4ble $s0, $t0, Donesll $t1, $s0, 2add $t2, $s6, $t1sw $zero, 0($t2)Done:
Register Name Register Contents Memory Address Memory Contents EAX 13 12A2h EBX 11 38 ECX 21 184 B004h EDX 95 8004h seeah ESP
37. PSW is saved in stack when there is a a. interrupt recognised b. execution of RST instruction c. execution of CALL instruction d. All of these
In a few words, describe the stack pointer register and its function.
In assembly 68k write the: Initialize the supervisor stack pointer to $8000 Initialize the program counter to $1000 Reserve locations at $2000 to hold your first name only (Joshua) as text and call it NAM Reserve locations at $3000 to store 9 longwords, call it MEM, and write your family name (Kimmich) as a comment Reserve locations at $12400 to store 32-bit unsigned integer variable called RES (to be computed)
Assume that you are writing an ARM assembly program, and this program will call my_fun (int x, int *x) function. Before calling the function, you need to push the parameters onto the stack. You are only allowed to use r0 as a working register to save any temporary value in it during the pushing operation if needed. You are not allowed to use LDM or STM instructions in this question. If you write any constant inside the instructions, you need to use decimal numbers only without any leading (insignificant) zeros. The parameter x that you will use is located at address FP - 8. The stack in this program is an Empty Descending stack, its space is appropriately allocated, and the SP is appropriately initialized. Write 2 ARM assembly instructions to push x onto the stack. The 1st instruction is: The 2nd instruction is: Write 2 ARM assembly instructions to push *x onto the stack. The 1st instruction is: The 2nd instruction is:
E In the following code block(Reference:Q11), you will a set of assembly instructions with corresponding line numbers (line numbers are for informational purpose only and they are not part of the source code). 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 mov edx, 5 dec ecx jmp LABEL1 mov eax, 1 LABEL1: mul edx jmp ecx mov edx, 0678h sub edx, eax jmp DWORD PTR [edx] neg ebx add ecx, ebx mov eax, 0 For each of the conditions/scenario listed below, indicate the corresponding line number (that cause or is associated with the condition/scenario). Enter 0 (Zero) if the condition is not caused by the block of code. 1) Memory indirect jump: type your answer... type your answer... type your answer... type your answer... 2) Register indirect jump: 3) Relative short jump: type your answer... 5) Two's complement type your answer... 4) Relative near jump: 6) Unreachable code
SPIM: 1.Create a program (SPIM) that can find the values of a function f(a,b) =a+b using stack and the jump and link instruction. (i.e. a=2, b=3)
The inclusion of a "backup" instruction in a design for an instruction set is what is meant by the term "orthogonality." This "backup" instruction may be substituted for any other instruction that accomplishes the same goal. Could you kindly tell me whether or not it is accurate?