Recreate the following C program in x86-64 and aarch64 assembly manually: #include 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; }

Recreate the following C program in x86-64 and aarch64 assembly manually: #include 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; }

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter8: Advanced Method Concepts

Section: Chapter Questions

Problem 7RQ

See similar textbooks

Similar questions

1. Put the following code into a complete C program: int i = 0; void func(char *str1, char *str2) { char *ptr = malloc(sizeof(int)); char buf[1024]; int j; static int y; } 2. Compile the program using gcc in Linux. 3. Use gdb to debug and print the addresses of variables in the code. 4. Draw the stack frame of func() and point out the addresses of related variables. 5. Document your steps for each question
1.Put the code into a complete C program int i = 0; void func(char *str1, char *str2) { char *ptr = malloc(sizeof(int)); char buf[1024]; int j; static int y; } 2. Compile the program using gcc in Linux. 3. Use gdb to debug and print the addresses of variables in the code. 4. Draw the stack frame of func() and point out the addresses of related variables.
Write in C Language Description F(x) = x + 1 G(x, y) = x + y Please write a program to calculate the value of composite of F and G Input Input will be the composite of F and G. The parameter of F and G are integer only. Output An integer represent the value of function. Sample Input 1 F(G(1,F(3))) Sample Output 1 6
EXPLAIN THIS C++ PROGRAM STEP BY STEP DETAIL WITH LOGIC #include<iostream> using namespace std; class Circle{int x,y;int r;static int number_of_circles;public:Circle(int a , int b, int rad){x = a;y = b;r = rad;++number_of_circles;}Circle(const Circle &c1){x = c1.x;y = c1.y;r = c1.r;number_of_circles = ++c1.number_of_circles; }void display(){cout<<"Co-ordinates : ("<<x<<" , "<<y<<" ) \n";cout<<"Radius : "<<r<<"\n";}friend void update(Circle &c);static int update_number_of_circles(){return number_of_circles;}};void update(Circle &c){int a,b,rad;cout<<"Enter the coordinates of the centre : ";cin>>a>>b;cout<<"Enter the radius of th circle : ";cin>>rad;c.x = a;c.y = b;c.r = rad;}int Circle::number_of_circles = 0; int main(){Circle c(1,2,5);Circle c1(c);Circle c2(c1);c1.display();update(c1);c1.display();cout<<c2.update_number_of_circles(); } #include<iostream> using namespace std;…
Write a C++ program that uses stacks to evaluate an arithmetic expression in infix notation without converting it into postfix notation. The program takes as input a numeric expression in infix notation, such as 3+4*2, and outputs the result. 1) Operators are +, -, *, / 2) Assume that the expression is formed correctly so that each operation has two arguments. 3) The expression can have parenthesis, for example: 3*(4-2)+6. 4) The expression can have spaces in it, for example: 3 * (4-2) +6 . Here are some useful functions that you may need: char cin.peek(); -- returns the next character of the cin input stream ( without reading it) bool isdigit(char c); -- returns true if c is one of the digits ‘0’ through ‘9’, false otherwise cin.ignore(); -- reads and discards the next character from the cin input stream cin.get(char &c); -- reads a character in c ( could be a space or the new line )
Write a C++ program that uses stacks to evaluate an arithmetic expression in infix notation without converting it into postfix notation. The program takes as input a numeric expression in infix notation, such as 3+4*2, and outputs the result. 1) Operators are +, -, *, / 2) Assume that the expression is formed correctly so that each operation has two arguments. 3) The expression can have parenthesis, for example: 3*(4-2)+6. 4) The expression can have spaces in it, for example: 3 * (4-2) +6 . Here are some useful functions that you may need: char cin.peek(); -- returns the next character of the cin input stream ( without reading it) bool isdigit(char c); -- returns true if c is one of the digits ‘0’ through ‘9’, false otherwise cin.ignore(); -- reads and discards the next character from the cin input stream cin.get(char &c); -- reads a character in c ( could be a space or the new line ) Please identify the…
can someone help me understand what does those two haskell function do myFun1::[a] -> (b -> a -> b) -> b -> [b] myFun1 [] f b = [b] myFun1 (x:xs) f b = (b):myFun3 xs f (f b x) myFun2::[a] -> [b] -> (a -> c) -> (b -> c) -> [(c,c)] myFun2 [] _ f g = [] myFun2 _ [] f g = [] myFun2 (x:xs) (y:ys) f g = (f x, g y):myFun2 xs ys f g
Write a c program of the recursive function that computes and returns X^y. In main ask the user to enter X and Y. Function main() will also display the result on screen
Convert the following C++ program into an x86 assembly language program.Comment the start of each "code block" that performs one of the listed mathematical calculations.Comments go to the right of the actual code, all starting on the same column.Post ONLY your ASM file here to Blackboard when complete. // Global variablesint a = 5;int b = 6;int c = 7;int d = 8;int e = 2;int f = 3;int g = 1;int h = 4;// Codeint main(){ --g; b = f + h; e = d + 22 - c - a; f = -g; ++a; g = f + e - 5; a = d + 19 - b; h = c + a + (-f); // Move a into the eax register // Move b into the ebx register // Move c into the ecx register // Move d into the edx register // Call the DumpRegs function // Move e into the eax register // Move f into the ebx register // Move g into the ecx register // Move h into the edx register // Call the DumpRegs function g = g + 6; f = 16; --h; d = 5 - e; b = -b; e = -g + 11 - a; f = d + c - a; c…
Write a C program that creates a security access code from a social security number entered by a user as follows: Using a recursive function it adds all of the digits of the social security number and then using a regular function gets the square number of the sum and displays it. The access code displayed should be initialized as an integer number but using type casting is displayed as a floating number.
With c programming and without pointer and function We already have learned different Patterns, Now it’s your turn to practice this pattern problem by writing a C program that will take an integer number and creates this Xoss pattern for the corresponding inputs. For example, If N=4, the xoss pattern look like this, If N=7, the xoss pattern look like this, Input Format You will be given a positive integer N as input. Constraints 1 <= N <= 9 Output Format Output the pattern Sample Input 0 4 Sample Output 0 1234 2 4 3 4 4444
Write a program in C that initializes one each of the basic C data types and then print them out. Don't forget pointer. Also print the size of each.