**Task: Compile the assembly code for the following C code**Here is the C code that needs to be compiled into assembly:```cint func1(int n) { return func2(n * 2);}```- The code defines a function `func1` that takes an integer `n` as a parameter.- Inside the function, `n` is multiplied by 2, and the result is passed to another function `func2`.- The `func2` function's return value is then returned by `func1`. This C code snippet is an example of how function calls and parameter manipulation might be compiled into assembly language in a computer architecture course. Further steps would involve actually translating this logic into assembly.

Answer. Given:- int func1 (int n) return func2(n*2); MIPS of the above code:- func1:daddiu…

Answered: Compile the assembly code for the…

Engineering

Computer Engineering

Compile the assembly code for the following C code: int funcl (int n) return func2(n*2);

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

Similar questions

Consider the following C code: 1: int main() { 2: 3: 4: 5: } int y = 5; // Return y times 4 return y* 4; What is removed during the preprocessing step of compilation? A. Line 1 B. Line 3 C. Line 5 D. Lines 3 and 5 E. Everything, since it will be assembly after the preprocessing step
Using the following C code and assembly code answer the following; C: long int nothingGreater(long int num) { if (num > 240) { return 240 - num; } else { return num; } } Assembly: 0x00000000004004ed <+0>: push %rbp 0x00000000004004ee <+1>: mov %rsp,%rbp 0x00000000004004f1 <+4>: mov %rdi,-0x8(%rbp) 0x00000000004004f5 <+8>: cmpq $0xf0,-0x8(%rbp) 0x00000000004004fd <+16>: jle 0x40050a <nothingGreater+29> 0x00000000004004ff <+18>: mov $0xf0,%eax 0x0000000000400504 <+23>: sub -0x8(%rbp),%rax 0x0000000000400508 <+27>: jmp 0x40050e <nothingGreater+33> 0x000000000040050a <+29>: mov -0x8(%rbp),%rax 0x000000000040050e <+33>: pop %rbp 0x000000000040050f <+34>: retq a. What's the starting address of nothingGreater in memory (specify in hex starting with 0x; you may omit leading zeroes)? b. What register is the argument stored in when the function starts (give the 3-letter abbreviation with a % beforehand)?
Example: The Problem Input File Using C programming language write a program that simulates a variant of the Tiny Machine Architecture. In this implementation memory (RAM) is split into Instruction Memory (IM) and Data Memory (DM). Your code must implement the basic instruction set architecture (ISA) of the Tiny Machine Architecture: //IN 5 //OUT 7 //STORE O //IN 5 //OUT 7 //STORE 1 //LOAD O //SUB 1 55 67 30 55 67 1 LOAD 2- ADD 3> STORE 4> SUB 5> IN 6> OUT 7> END 8> JMP 9> SKIPZ 31 10 41 30 //STORE O 67 //OUT 7 11 /LOAD 1 //OUT 7 //END 67 70 Output Specifications Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Memory Address Registers, Instruction Memory, Data Memory, Memory Data Registers, and Accumulator). Data Memory will be represented by an integer array. Your Program Counter will begin pointing to the first instruction of the program. Your simulator should provide output according to the input file. Along with…
How do I present a complete and syntactically correct example of C/C++ code that prevents wrap around when adding, subtracting, OR multiplying either unsigned char, unsigned short, OR unsigned long data types (select one operation and one data type).
Please read these instructions very carefully and follow them exactly how they are meant to be done the code is done and C code not C++ by the way 1) largest Write a function int largest(int a[],int n) that will find the largest int in the n ints in a. This should be the only function in the file. Generate assembly language for this code using -S. Identify the variables in this code, defining a table in comments in the code. Comment each line of code, indicating what it is doing in terms of the original C code. 2) Before you move on, make a copy of your .s file. 3) Generate optimized code for the same C code. You do this with the -O (-Os if you are on MacOS) switch to gcc For example, gcc -S -O largest.c will generate largest.s (clobbering your first version if you did not save it elsewhere!) Build the same variable table and code comments for this version. Submit largest.c and both copies of largest.s with your comments.
Using the following C code and assembly code answer the following; C: long int nothingGreater(long int num) { if (num > 240) { return 240 - num; } else { return num; } } Assembly: 0x00000000004004ed <+0>: push %rbp 0x00000000004004ee <+1>: mov %rsp,%rbp 0x00000000004004f1 <+4>: mov %rdi,-0x8(%rbp) 0x00000000004004f5 <+8>: cmpq $0xf0,-0x8(%rbp) 0x00000000004004fd <+16>: jle 0x40050a <nothingGreater+29> 0x00000000004004ff <+18>: mov $0xf0,%eax 0x0000000000400504 <+23>: sub -0x8(%rbp),%rax 0x0000000000400508 <+27>: jmp 0x40050e <nothingGreater+33> 0x000000000040050a <+29>: mov -0x8(%rbp),%rax 0x000000000040050e <+33>: pop %rbp 0x000000000040050f <+34>: retq What are the memory addresses of the three statements that implement the if statement (provide hex addresses with 0x prefix and without leading zeroes)? The first two statements that work together: The third statement that skips the else code if the if…
Convert the following C++ program into Pep/9 Assembly. #include <iostream>using namespace std;void SetEqualGreater (int &num1, int &num2){ if (num1 < num2) num1 = num2; else num2 = num1;}int main() { int x, y; // Using Local Variables cin >> x >> y; SetEqualGreater(x, y); cout << "x = y = " << x << endl; return 0;} Submit: Source file along with screen captures showing the program running in the Pep/8 simulator.
c++
15. Translate the following C program to Pep/9 assembly language. #include int main() { int numitms, j, data, sum; scanf("%d", &numItms); sum = 0; for (j = 1; j <= numitms; j++) { scanf("%d", &data); sum += data; } printf ("Sum: %d\n", sum); return 0; } Sample Input 48-376 Sample Output Sum: 18