I need help with this please 7. Add the missing lines of assembly code to make the assembly code implement the c-code that is commentedout.int attribute ((noinline)) takeThree (int a, int b, int c) (int result;//result = a + b + c;asm volatile ("mov 8A0, 8A1 \n\t"mov 8B0, 8B1 \n\t"add 8A0, 8A2 \n\t"adc 8B0, 8B2 \n\t//move low byte of a to//add the low bytes//add the high bytes//move low byte of a to low byte of resultlow byte of result);: "d" (result) //output list: "d" (a), "d" (b), "d (c) //input list//clobber listreturn result;

In this corrected assembly code: I fixed the syntax errors in the assembly instructions.Used the…

Answered: 7. Add the missing lines of assembly…

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

Write a program in HACK assembly, without using symbols, that sums the consecutive set of memory locations starting from the memory address stored in RAM[1]up to, but not including, the memory address RAM[1] + RAM[2]. The result of thecomputation should be stored in RAM[0]. Note, you need not consider the case ofan overflow.You can think of RAM[1] as being a pointer to an array of numbers, and RAM[2] asbeing the length of the array you are summing over.
implement a function for finding the nth Fibonacci number using the MIPS assembly language. Following gives the definition of the Fibonacci Sequence.Let F be the Fibonacci function:F(0) = 0F(1) = 1For n > 1 F(n) = F(n-1) + F(n-2)Example Output of Execution:Enter the sequence number: 6F(6) = 8 A - Loop ImplementationIn a file named FiboLoop.asm, implement the above function using a loop. B - Recursive ImplementationIn a file named FiboRec.asm, implement the above function using a loop.
write a procedure that returns the sum of all array elements falling within the range (j-k, example 0-5) (inclusive). Then write a test program to calls the procedure twice, passing a pointer to a signed doubleword array, the size of the array, and the values of j and k. Return the sum in the EAX register, and preserve all other register values between calls to the procedure.
Write a C program that does a large number of references to elements of two-dimensioned arrays, using only subscripting. Write a second program that does the same operations but uses pointers and pointer arithmetic for the storage-mapping function to do the array references. Compare the time efficiency of the two programs. Which of the two programs is likely to be more reliable? Why?
a. Translate with a three-address statement, the following expression: n = f((x+2), y) – 5; b. If A is an array of integers with width = 4; Translate with three-address statement, the following expression: x = a[i] + 2;
. What will be the output of the following code, consider the memory address of variable x is 0x0044c and pointer variable ptr is 0x0066f, and consider int data type take 2 byte in the memory void main() { int x[5] = { 1,2,3,4,5 }; int *ptr = x; ptr = ptr + 1; cout << ptr << endl; cout << *ptr << endl; cout << &ptr << endl; cout << &x[0] << endl; cout << *x << endl; x += 2; cout << x << endl; }
Soon soon please please Write a MIPS assembly program-snippet (i.e., minimal code that accomplishes the requirements) that generates an initialized static integer array (A) of 10 integers, where A[i]=i and a second initialized static integer array (B), where B[i]=9-i. Additionally, the program generates a dynamic arrays (C) of 10 integers and sets the value of C[i] to be: C[i] = A[i] XOR B[i]. Your snippet does not have to include user interface or input output.
// the language is c++, please code with common for better understanding, and after your code finished take a screenshot of the execution. Write a C++ program to simulate a stack using an array. You should create an index (the stack pointer) to point into the stack. Initialize it to 0. The stack should grow to location [1], [2], [3], etc. Write a "push (int)" function to push an int onto the top of the stack. Also, write an "int pop" instruction to pop the data that is stored on the top of the stack. The pop instruction must return the popped data. The push and pop instructions should increment and decrement the stack pointer appropriately. Your source should contain calls to your functions demonstrating that it works. Note, that you should do several pushes and several pops to show that data is correctly stored on the stack. You can do this by showing sample runs. Cut and paste the results of the runs into a separate document
(THIS IS FOR MINDTAP ON CENGAGE, PLEASE USE THAT. ALTERNATIVE IS DEVC++5.11 BUT HIGHLY RECOMMENDED THAT YOU USE MINDTAP) Instructions Write a C++ program that declares an array alpha of 50 components of type double. Initialize the array so that the first 25 components are equal to the square of the index variable (the position that element will occupy), and the last 25 components are equal to three times the index variable. Output the array so that 10 elements per line are printed. (For the number at index 5, the value would be 25, which is 5 squared. The 25th index would hold a value of 75, which is 3 * 25.) An example of the program output is shown below:
Compile the following C code snippet with optimization level O1 using armv7-a clang 11.0.1. a)Which register(s) are saved before entering the recursive call? Explain why. (Hint: the registers have their special purposes). b)Next modify line 2 from (n == 1) to (n == 0), Explain what has been changed? int foo2(int n) { if (n == 1) { return 1; } else { return n + foo2(n - 1); } }
Write a c++ program to Declare an array of 10 elements dynamically and initialize each element (from user). Make another variable dynamically and take input from the user . Now, tell user whether that number is present in array or not.
Write a small library in the C programming language to do Minifloat (Links to an external site.) (8-bit binary floating-point numbers) operations. Notes You have to come up with a sensible representation and stay consistent throughout a library. The internal representation (e.g. a struct) does not have to match the external representation (e.g. just a binary pattern, or a pointer to an abstract data type). Be careful of memory leaks. For example, do not return a pointer to a local static variables in a function. Instead, allocate on the heap with malloc and then return the pointer to that. Minimum requirements Meeting these requirements will collect the regular points. add - Add two Minifloat numbers and return the result. mult - Multiply two Minifloat numbers and return the result.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS