Problem 0. Below is the C code for 3 functions, foo, bar, and bazz; foo calls bar, which callsbazz. Each has some local variables.long bazz (long *p1, long q) {if (q < 3L)return *p1 + 1;elsereturn bazz (p1,q-1)+1;}long bar (long *m, long *n) {long x = *n;*m += bazz (m, 3L);return x + *m;}long foo (long x, long *y) {long a= x + *y;return *y+ bar (y, &a);}Here is the assembly code generated for each:bazz:.L2:cmpq $2, %rsijg .L2movq (%rdi), %raxaddq $1, %raxretsubq $8, %rspsubq $1, %rsicall bazzaddq $1, %raxaddq $8, %rspret bar:foo:pushq %rbppushq %rbxsubq $8, %rspmovq %rdi, rbxmovq (rsi), %rbpmovl $3, %esicall bazzaddq (%rbx), raxmovq rax, (%rbx)addq %rbp, %raxaddq $8, %rsppopq rbxpopq %rbpretpushq rbxsubq $16, %rspmovq %rdi, %raxmovq %rsi, %rdixorl %edx, %edxmovq (%rsi), %rbxaddq rbx, raxmovq %rax, (%/rsp)movq %rsp, %rsicall baraddq rbx, raxjne .L12addq $16, %rsppopq rbxretSuppose foo (10,&y) is called from main, where long y contains the value 0. Assume register %rbxcontains a value a, %rbp contains 3., and %rsp contains y at the time foo is invoked.a. Draw a diagram of the stack immediately after the second invocation of bazz Treat the stackas an array of 8-byte quantities. The stack frame of main will be at the top of the diagram.(You will only know the contents of y in the frame of main) The top of the stack (i.e., theframe of the recursive invocation of bazz) at the bottom. Show the contents of each long onthe stack. If it is unknown, leave it blank.b. What value does foo (10,&y) return?

let's provide an introduction to the problem and the code you've presented.In this problem, we are…

Problem 0. Below is the C code for 3 functions, foo, bar, and bazz; foo calls bar, which calls bazz. Each has some local variables. long bazz (long *p1, long q) { if (q < 3L) return *p1 + 1; else return bazz (p1,q−1)+1; } long bar (long *m, long *n) { long x = *n; *m += bazz (m, 3L); return x + *m; } long foo(long x, long *y) { long a = x + *y; return *y+bar (y, &a); } Here is the assembly code generated for each: bazz: .L2: cmpq $2, %rsi jg .L2 movq (%rdi), %rax addq $1, %rax ret subq $8, %rsp subq $1, %rsi call bazz addq $1, %rax addq $8, %rsp ret

Problem 0. Below is the C code for 3 functions, foo, bar, and bazz; foo calls bar, which calls bazz. Each has some local variables. long bazz (long p1, long q) { if (q < 3L) return p1 + 1; else return bazz (p1,q−1)+1; } long bar (long m, long n) { long x = n; m += bazz (m, 3L); return x + m; } long foo(long x, long y) { long a = x + y; return y+bar (y, &a); } Here is the assembly code generated for each: bazz: .L2: cmpq $2, %rsi jg .L2 movq (%rdi), %rax addq $1, %rax ret subq $8, %rsp subq $1, %rsi call bazz addq $1, %rax addq $8, %rsp ret

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Write a function named binToDec () that accepts an integer parameter whose digits are meant to…

A: ANSWER:-A function named binToDec() that accepts an integer parameter whose digits are meant to…

Q: The greatest common divisor (GCD) for a pair of numbers is the largest positive integer that divides…

A: Here is your solution step by step -

Q: Consider the function definition below. Assume x = 5, y = void findout (int &x, int y, int &j) { }…

A: Let us see the answer below.

Q: Consider the provided C++ code in the main.cpp file: The function func2 has three parameters of…

A: Program: #include <iostream> #include <cmath> #include <iomanip> using namespace…

Q: Incomplete Checks for isVowel declaration and when you expand it you see: Searched your code for…

A: the code is an given below :

Q: Given the function definition below, select the return values for the following function calls.

A: #include <iostream> using namespace std; // returns true if m is an odd numberbool odd(int m){…

Q: Write a function: int calculate(int x); In c++, the function returns value of 3*x^3 + 3*x^2- 2.

A: Write a function: int calculate(int x); The function returns value of 3*x3 + 3*x2 - 2.

Q: Exercise 1: Write function headers for the following functions (and indicate whether the function…

A: NOTE:“Since you have posted a question with multiple sub-parts, we will solve first three subparts…

Q: a. Suppose that the caller has variables int mylnt and float myFloat whose values are 20 and 4.8,…

A: Step 1:- Given the code of the function:- void Demo(int intVal,float &floatVal) {…

Q: Euclides algorithm to calculate the greatest common divisor of two non-zero integers can be written…

A: The Euclidean algorithm can be defined in such a way that it is an iterative algorithm for locating…

Q: Write a function checkeven which receives 3 integer variables and prints YES if all three numbers…

A: Note: Here you didn't mention any programming language so we are solving this problem using the C++…

Q: Write the verilog code that represents the function in problem 4.2 using a case statement.

A: The required Verilog code that represents the function in problem 4.2 is given in the next step.

Q: Convert -52 (base 10) to binary 8-bit one's complement (write exactly the Binary code as it should…

A: To convert decimal to binary 8-bit one's complement.

Q: Please solve the following problem in C++ and do not use vectors or while(true) make sure there is a…

A: In this question we have to write a code in C++ to find the average nights per reservation and…

Q: 5.8 LAB: Flip a coin efine a function named CoinFlip that returns "Heads" or "Tails" according to a…

A: Total answers posted by the expert is: 77519 import java.util.Scanner;import java.util.Random;public…

Q: What will the following C function print? Be exact! void foo (int a) { int * p1 = &a; int **p2 spl;…

A: int* is the pointer variable which stores the address of an integer variable and int** is the…

Question

Problem 0. Below is the C code for 3 functions, foo, bar, and bazz; foo calls bar, which calls
bazz. Each has some local variables.
long bazz (long *p1, long q) {
if (q < 3L)
return *p1 + 1;
else
return bazz (p1,q-1)+1;
}
long bar (long *m, long *n) {
long x = *n;
*m += bazz (m, 3L);
return x + *m;
}
long foo (long x, long *y) {
long a= x + *y;
return *y+ bar (y, &a);
}
Here is the assembly code generated for each:
bazz:
.L2:
cmpq $2, %rsi
jg .L2
movq (%rdi), %rax
addq $1, %rax
ret
subq $8, %rsp
subq $1, %rsi
call bazz
addq $1, %rax
addq $8, %rsp
ret

bar:
foo:
pushq %rbp
pushq %rbx
subq $8, %rsp
movq %rdi, rbx
movq (rsi), %rbp
movl $3, %esi
call bazz
addq (%rbx), rax
movq rax, (%rbx)
addq %rbp, %rax
addq $8, %rsp
popq rbx
popq %rbp
ret
pushq rbx
subq $16, %rsp
movq %rdi, %rax
movq %rsi, %rdi
xorl %edx, %edx
movq (%rsi), %rbx
addq rbx, rax
movq %rax, (%/rsp)
movq %rsp, %rsi
call bar
addq rbx, rax
jne .L12
addq $16, %rsp
popq rbx
ret
Suppose foo (10,&y) is called from main, where long y contains the value 0. Assume register %rbx
contains a value a, %rbp contains 3., and %rsp contains y at the time foo is invoked.
a. Draw a diagram of the stack immediately after the second invocation of bazz Treat the stack
as an array of 8-byte quantities. The stack frame of main will be at the top of the diagram.
(You will only know the contents of y in the frame of main) The top of the stack (i.e., the
frame of the recursive invocation of bazz) at the bottom. Show the contents of each long on
the stack. If it is unknown, leave it blank.
b. What value does foo (10,&y) return?

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: Determine the code

VIEW

Step 2: bazz function

VIEW

Step 3: bar Function:

VIEW

Step 4: foo Function:

VIEW

Step 5: Stack Diagram:

VIEW

Step 6: b. What value does foo(10, &y) return?

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 7 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

Given the code: void e(int x, int y) { if(y<2) { cout << x << " "; return; } cout << x << " "; e(x+1, y-1); } 1. Trace the function when x and y are 4.
Refactor the following code using the concept of functions. a = 2 b = 3 C= 4 d = 5 a = 2 b = 3 C= 4 d = 5
Plans Resources More - Overview Question 3 Consider the following function: int func(int x){ if (x == 0) %3D return 2, else if (x == 1) return 3; else return (func(x - 1) + func(xF 2)); What is the output of func(4)? Your answer: O13
Write a function call to ConvertVolume() to store the number of quarts, pints, and ounces within the integer variables numQuarts, numPints, and numOunces, respectively. Ex: If the input is 157, then the output is: Quarts: 4 Pints: 1 Ounces: 13 1 #include 3 void ConvertVolume (int totalOunces, int* numQuarts, int* numPints, int* numOunces) { totalOunces / 32; N3589 2 4 *numQuarts 6 7 totalOunces = totalOunces % 32; 10 11} 12 13 int main (void) { 16 17 *numPints = totalOunces / 16; totalOunces = totalOunces % 16; *numOunces = INN totalOunces; 14 int totalOunces; 15 int numQuarts; int numPints; int numOunces; 18 19 20 21 22 23 printf("Quarts: %d\n", numQuarts); 24 printf("Pints: %d\n", numPints); 25 printf("Ounces : %d\n", numOunces); 26 27 return 0; 28 } scanf("%d", &totalOunces); /* Your code goes here */
Consider the function definition below. Assume x = 5, y = 3 and j = 8 as the function starts. Which variables will change after the function finishes? void findout (int &x, int y, int &j) { for (int i = 1; i 5) { x = 2*x - 3*y; y = 4 + 3 x; } else { Oi y = 2*x - 3; x = 4 + 3% y; } } // end of for loop x and y y All three since the first and last are references. x and j
Question 21 Consider the following functions' definitions and answer the question below int Funab (int a, int b) { b++; return a*b; int Funx (int x) { int w = x + Funab(x-2, x); return w; What is the output of the following statement? cout<
2. Modular arithmetic Write a function that returns the result of any integer modulo of n (i.e., reduce theinteger modulo n). Note that the C++ operator % can be used, but it returns a negativevalue, for example, -1 % 3 yields -1, so we need to do something adjustment (recallthat -1 mod 3 = 2 because -1= (-1)×3+2). Therefore, we will use the mod() functionfrom this step to implement the later encode() and decode() functions. /* precondition: n is greater than 1,a can be negativepostcondition: return a mod n (as defined in class)a mod n = r if and only if a = nk+r, 0 =< r < n (note thatr needs to be non-negative).*/int mod (int a, int n); -Please write in c++