L3:; total += a[i);movslq -20(%rbp), %rax ; move i into rax - move signed long into quad; basically, just zeroing the parts of the register; not being used (the high order 32 bits); sal is shift arithmetic left. By moving two bits; this is the same as multiplying by 4; (think sizeof int); add &a to 1-> this is the offset into a for aſi; move a[i] ..to edx; add total to edx; store total = edx; load the address of i (-20(%rbp)) into rax; increment *rax -> i++salq $2, %raxaddq -8(%rbp), %raxmovl (%rax), %edxaddl -16(%rbp), edxmovl %edx,-16(%rbp)leaq -20(%rbp), %rax(%rax)inclL2:; put; see if i 1) largestWrite 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 gccFor example,gcc -S -O largest.cwill 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.largest.c and both copies of largest.s with your comments.

Answered: ; not being used (the high order 32 ;…

; not being used (the high order 32 ; sal is shift arithmetic left. By mo ; this is the same as multiplying by ; (think sizeof int) ; add &a to -> this is the offse

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: C++ MUST MATCH OUTPUT IN PICS thank you for the help please match up In this lab, you're going to…

A: C++ program pseudocode : Function getHighestPay() - return the index of the highest gross pay…

Q: Question 1 a. What digits are used in the binary number system? b.What digits are used in the…

A: Answer 1) a) Binary number system in mathematics, positional numeral system employing 2 as the…

Q: 12. Code the given C function and test it inside the main function. int Length(char* str) { //…

A: Given: A function Length is given which takes a char pointer str and returns the length of the…

Q: Part1: Read an integer input from the user and save it to a variable 'size'. - Use the…

A: Required: Part1: Read an integer input from the user and save it to a variable 'size'. - Use…

Q: this lab, you're going to be working with partially filled arrays that are parallel with each other.…

A: C++ MUST MATCH OUTPUT IN PICS thank you for the help please match up In this lab, you're going to be…

Q: (Algebra: solve linear equations) Write a function that solves the following 2 x 2 system of linear…

Q: (Convert C to MIPS) #include int main() { int A=15; int B=10; int C=7; int D=2; int…

A: MIPS is a simple, streamlined, highly scalable RISC architecture. The MIPS architecture is one of…

Q: C++ MUST MATCH OUTPUT IN PICS thank you for the help please match up In this lab, you're going to…

A: C++ MUST MATCH OUTPUT IN PICS thank you for the help please match up In this lab, you're going to be…

Q: Compare Bitcoin, Coinjoin, Zerocoin, and Zerocash. 1) the anonymity given 2) how practicable they…

A: Introduction: Bitcoin, Coin join, Zero coin, and Zero cash. 1) the anonymity given 2) how…

Q: orrect my mistake in my C++ code please! Here is the question and my code is below as well.…

A: C ++ program to take non duplicate value of integers into 1D array and print the array Program:…

Q: Please help me on this code in Program C int getNum(); /*accepts input from the user.*/ long…

A: int getNum(); /*accepts input from the user.*/ long decBin(int n); /*returns the binary equivalent…

Q: write a c++ program named "isTheLastNumberTheMax" that accepts an array of integers and its size. It…

A: c ++ code : #include <bits/stdc++.h> using namespace std; string isTheLastNumberTheMax(int…

Q: (d) Handling sum of one or two negative numbers Method sum for two HugeIntegers where one or both…

A: Answer: Algorithm: Step1: we have taken input form positive and negative from the user Step2: with…

Q: Score Letter Grade 0- 69 F 70- 79 80 - 89 90 - 100+ A Complete the function compute_letter_grades.…

A: PROGRAM EXPLANATION Define a function with the name as given in the question. This function will…

Question

L3:
; total += a[i);
movslq -20(%rbp), %rax ; move i into rax - move signed long into quad
; basically, just zeroing the parts of the register
; not being used (the high order 32 bits)
; sal is shift arithmetic left. By moving two bits
; this is the same as multiplying by 4
; (think sizeof int)
; add &a to 1-> this is the offset into a for aſi
; move a[i] ..to edx
; add total to edx
; store total = edx
; load the address of i (-20(%rbp)) into rax
; increment *rax -> i++
salq $2, %rax
addq -8(%rbp), %rax
movl (%rax), %edx
addl -16(%rbp), edx
movl %edx,-16(%rbp)
leaq -20(%rbp), %rax
(%rax)
incl
L2:
; put
; see if i <n
movl -20(%rbp), %eax
to eax
cmpl -12(%rbp), %eax
jl
L3

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.
largest.c and both copies of largest.s with your comments.

Expert Solution

This question has been solved!

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

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Step by step

Solved in 3 steps with 1 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

C++ MUST MATCH OUTPUT IN PICS thank you for the help please match up In this lab, you're going to be working with partially filled arrays that are parallel with each other. That means that the row index in multiple arrays identifies different pieces of data for the same person. This is a simple payroll system that just calculates gross pay given a set of employees, hours worked for the week and hourly rate. Parallel Arrays First, you have to define several arrays in your main program employee names for each employee hourly pay rate for each employee total hours worked for each employee gross pay for each employee You can use a global SIZE of 50 to initialize these arrays Second, you will need a two dimension (2-D) array to record the hours worked each day for an employee. The number of rows for the 2-D array should be the same as the arrays above since each row corresponds to an employee. The number of columns represents days of the week (7 last I looked) Functions Needed In this…
(Square of Asterisks) Write a function that displays a solid square of asterisks whose side isspecified in integer parameter side. For example, if side is 4, the function displays: **** **** **** ****
Can someone please explain this C++ code that my classmate did line by line please. Also, incase you needed further explanation the prompt is as follows: Implement an empty integer array of capacity 5. a) Use a loop to input values from the console into the array. b) Use a loop to determine the smallest element in the array. c) Use a loop to determine the largest element in the array. d) Use a loop to output the array. e) Output the smallest and largest elements. Example Output (input in bold italics)[0] = 4[1] = 24[2] = 123[3] = 54[4] = 3 Array: 4 24 123 54 3 Max: 123Min: 3
Exercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array.
C++ MUST MATCH OUTPUT IN PICS thank you for the help please match up In this lab, you're going to be working with partially filled arrays that are parallel with each other. That means that the row index in multiple arrays identifies different pieces of data for the same person. This is a simple payroll system that just calculates gross pay given a set of employees, hours worked for the week and hourly rate. Parallel Arrays First, you have to define several arrays in your main program employee names for each employee hourly pay rate for each employee total hours worked for each employee gross pay for each employee You can use a global SIZE of 50 to initialize these arrays Second, you will need a two dimension (2-D) array to record the hours worked each day for an employee. The number of rows for the 2-D array should be the same as the arrays above since each row corresponds to an employee. The number of columns represents days of the week (7 last I looked) Functions Needed In this…
(True/False): A segment descriptor contains the base location of a segment.
17: recursion.cpp) Write two recursive integer functions. The first function should calculate factorials using the definition 0! = 1 and n! = (n-1)! x n. In addition, if n is too large it should be able to detect integer overflow before it happens. The next function should calculate the greatest common factor (gcf) of two numbers. If the second number is zero, then the gcf is the other number. Otherwise, the gcf of a and b is the same as the gcf of b and a mod b.