Consider the following assembly code: movq %rsi, %rax testq %rdi, %rdi jle .L2 imulq %rsi, %rax ret .L2: addq %rax, %rax ret The preceding code was generated by compiling C code that had the following overall form: long func (long x, long n) { long result = if ( _) { result = else result = return } Fill in the missing parts of the C code to get a program equivalent to the generated assembly code. Recall that the result of the function is returned in register %rax.

Consider the following assembly code: movq %rsi, %rax testq %rdi, %rdi jle .L2 imulq %rsi, %rax ret .L2: addq %rax, %rax ret The preceding code was generated by compiling C code that had the following overall form: long func (long x, long n) { long result = if ( _) { result = else result = return } Fill in the missing parts of the C code to get a program equivalent to the generated assembly code. Recall that the result of the function is returned in register %rax.

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

Similar questions

12.14 Zylab 3 - Single Procedure Call Given an array of at least one integer, write a program to create a new array with elements equal to the power of each element in the original array raised to the index, i.e., P[i] = A[i]^i. For this, write two functions that will be called in main function independently. ● power inputs: element (A[i]) and index (1) • task: returns the value of element raised to index (A[i]^i). } O • newElement inputs: base address of new array P (*P), current size of P (variable k) and the new element (A[i]^i) o task: add the new element at the end. o This function does not return any value (void). O Following is a sample C code to perform the required task. You may modify the code for the functions, but the task performed should not be changed. int main() { // Variable Declaration int *A, *P; int n, k; int pow; // Task of main function P[0] 1; for (int j = k = j; pow // Base addresses of A and P // Lengths of arrays A and B // Return value from power function }…
Exercise 4: Write the MIPS compiler of the following C Code: int sum (int a, int b, int c) { int tot; tot=a+b+c return tot; }
Recreate the following C program in x86-64 and aarch64 assembly manually: #include <stdio.h> typedef struct _v2d {long x;long y;} v2d_t; static long dot(v2d_t a, v2d_t b){return a.x * b.x + a.y * b.y;} static long dot_ptr(v2d_t *a, v2d_t *b){return a->x * b->x + a->y * b->y;} int main(void){v2d_t a, b; scanf("%ld %ld %ld %ld", &a.x, &a.y, &b.x, &b.y); long res1 = dot(a, b);printf("%ld\n", res1); long res2 = dot_ptr(&a, &b);printf("%ld\n", res2); return 0;}
Consider the following C code: long func (1long x, long m, long n) { long result = 0; int p = 1; int g = 10 if ((x > m) && (x < n)) { p = p + m; 9 = g + n; } else p = p n; result = return result; } • Rewrite the code and replace the if-else with 'goto' statements. • Write the assembly code that corresponds to the C goto' version. • Compile the C code to assembly using the gcc compiler and see how your code compares with the compiler version.
Convert the following into Pep/9 Assembler: #include <iostream>using namespace std;int square(int n){ int i; int sq; sq = 0; for (i = 0; i < n; i++){ sq = sq + n; } return sq;}int main (){ int num; cout << "Enter a number: "; cin >> num; cout << num << " squared = " << square(num) << endl; return 0;} Submit: Source file along with screen captures showing the program running in the Pep simulator.
Convert the following into Pep/9 Assembler: #include using namespace std; int square(int n){ int i; int sq; sq = 0; for (i = 0; i < n; i++){ sq = sq + n; } return sq; } int main (){ int num; cout << "Enter a number: "; cin >> num; cout << num << " squared = " << square(num) << endl; return 0; }
Compare categories of arrays (in terms of memory management) for a C++ array declared in a function, a C++ array using the operator new, and an array in Ruby and Python
Translate the following C program into Pep/9 assembly language:#include <stdio.h>int main () {int num1;int num2;scanf("%d", &num1);num2 = -num1;printf("num1 = %d\n", num1);printf("num2 = %d\n", num2);return 0;} please explain and provide c
Translate the following c++ code into pep/9 assembly language. #include <iostream>using namespace std;int square(int n){ int i; int sq; sq = 0; for (i = 0; i < n; i++){ sq = sq + n; } return sq;}int main (){ int num; cout << "Enter a number: "; cin >> num; cout << num << " squared = " << square(num) << endl; return 0;}
Convert the following C++ program to pep9/Assembly language BR Main format not machine language #include <iostream>using namespace std; int times(int mpr, int mcand){int prod = 0;while (mpr != 0){if (mpr % 2 == 1)prod = prod + mcand;mpr /= 2;mcand *= 2;} return prod;} int main(){ int n, m; cout << "Enter two numbers: ";cin >> n >> m; cout << "Product: " << times(n, m) << endl; return 0;}
Convert the following c++ code into pep9 assembly language. #include <iostream> using namespace std; void times(int& prod, int mpr, int mcand) { prod = 0; while (mpr != 0) { if (mpr % 2 == 1) prod = prod + mcand; mpr /= 2; mcand *= 2; } } int main(){ int product, n, m; cout << "Enter two numbers: "; cin >> n >> m; times(product, n, m); cout << "Product: " << product << endl; return 0; }
Convert the following to Pep/9 assembly: #include <iostream>using namespace std;int main(){ int number; cin >> number; if (number % 2 == 0) { cout << “Even\n”; } else { cout << “Odd\n”; } return 0;} show the screen shot to of pep/9 code working