1. writing assembler Write assembly code that implements the following C code fragment. This is not a func- tion, so you should ignore function setup/teardown. You should assume that a is stored at 8(%rbp), b is stored in %edx, and c is stored at -4(%rbp). if (a && b > 0) c = b+4; (Remember that a is true if it is not 0, false if it is 0.)

1. writing assembler Write assembly code that implements the following C code fragment. This is not a func- tion, so you should ignore function setup/teardown. You should assume that a is stored at 8(%rbp), b is stored in %edx, and c is stored at -4(%rbp). if (a && b > 0) c = b+4; (Remember that a is true if it is not 0, false if it is 0.)

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

IN asmly language please Pretty please with successful build screen shot and output 1.Using the AddTwo program from Section 3.2 as a reference, write a program that calculates the following expression, using registers: A = (A + B) − (C + D). Assign integer values to the EAX, EBX, ECX, and EDX registers. Note: you can hard code integer literal onto the registers, e.g. mov eax,55 ; AddTwo.asm - adds two 32-bit integers.; Chapter 3 example .386.model flat,stdcall.stack 4096ExitProcess proto,dwExitCode:dword .codemain proc mov eax,5 add eax,6 invoke ExitProcess,0main endpend main 2. Listing File for AddTwoSum Generate a listing file for AddTwoSum.asm(in 3.4.3 of the text) and write a description of the machine code bytes generated for each instruction. You can write your descriptions directly over the .lst file. You might have to guess at some of the meanings of the byte values. Submit the .lst file with your description over it.…
Code so on for_A pure full Implement c/c++ to evaluate round robin algorithm. You must use the job list given here: Job (1) arrive at CPU cycle1 Job (2) arrive at CPU cycle2 Job (3) arrive at CPU cycle36 I/O (32) CPU (54) I/O (45) CPU (20) I/O (40) CPU (48) CPU (39) CPU (48) I/O (55) Your job list must contain CPU bust and I/O bust as above. Quantum time = [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60] The evaluation of the most suitable quantum time needs to consider the followingperformance metrics, but not limited to:(i) Turnaround time of the jobs;(ii) Waiting time of the jobs; and(iii) Number of interrupts incurred The code must able to read csv file format of the job list as input file. The code must able for user to input time quantum.. .
Consider the following C function: void f(int **, int a, int b) { if (x != 0) { *x += a; } return; } Write a translation of this function into assembly following the C convention for subprograms. It's ok for this function to destroy the values of registers EAX and EBX, and the function's code can only reference registers EAX, EBX, EBP, and ESP.
A C program containing the function food has been compiled intoLC-3 assembly language. The partial translation of the function into LC-3 is:food:ADD R6, R6, #-2STR R7, R6, #0ADD R6, R6, #-1STR R5, R6, #0ADD R5, R6, #-1ADD R6, R6, #-4 Say this function has two integer parameters x and y. Generate the code to evaluate theexpression x + y.
A C program containing the function food has been compiled into LC-3 assembly language. The partial translation of the function is:food:ADD R6, R6, #2STR R7, R6, #0ADD R6, R6, #1STR R5, R6, #0 ADD R5, R6, #1ADD R6, R6, #4...How many local variables does this function have?
make sure don't copy from previous answers or I can thumbs down. also, it's mips assembly, Implement a C function in mips assembly language You remember our discussin of code from a real compiler? We all can do better, for this function (page 101), which I reproduce. Write it in MIPS. You can do it in many fewer instructions than the compiler. int fun3(int y, int x) { int a,b; a = fun1(5,7); b = fun2(8); return a + b; } Your answer
An existing timer library is to be added. The following functional prototype is given. 1 void ConfigPWMChannel (TIM_TypeDef const * const timer, const uint8_t pwmMode, const uint8_t pwmChannel); 2 3 With the following description TIM_TypeDef Structure for all registers that are assigned to a timer. pwmMode contains the specific number of the selected PWM mode. pwmChannel contains the specific number of the selected channel. a) First, only enter the commands that check whether the transferred parameter Timer corresponds to Timers 2 or 1. If this is not the case, a suitable standard value should be used. b) Now enter the required commands so that the corresponding mode is set correctly. Implement the case for Channel 4. C) Make each (a) and (b) free of syntax errors. Notice. This only applies to a complete solution of (a) and (b) respectively
Q2: Besides the while-loop in Q1, I want to implement a 2nd while-loop running in parallel with the first while: while(1) { wt(1); XX); } However, on an MCU there is no parallelism. (For ex., on Arduino I can define only one loop() function.) Write a single while that does the job of both whiles. (a) Write it in a procedural style. (b) Write it the super-loop style (state-machine with fixed heartbeat).
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…
Please change this C code to Assembly program(x86 and ARM assembly gcc) #include <stdio.h>int main() { unsigned guess; /* current guess for prime */ unsigned factor; /* possible factor of guess */ unsigned limit; /* find primes up to this value */ printf("Find primes up to: "); scanf("%u", &limit); printf("2\n"); /* treat first two primes as special case */ printf("3\n"); guess = 5; /* initial guess */ while ( guess <= limit ) { /* look for a factor of guess */ factor = 3; while ( factor*factor < guess && guess % factor != 0 ) factor += 2;if ( guess % factor != 0 ) printf("%d\n", guess); guess += 2; /* only look at odd numbers */ }printf("Recieves a number(limit) and prints its all divisors"); for(int i = 1; i <= limit; i++) { if((limit%i) == 0){ printf("\n%d", i); } } return 0; }
Analyze the code solution below and discuss any gain in performance. To gather measurement values, use any CUDA or OpenMP library API that is used to measure performance (time, speedup, etc..) or by using what is offered by the compiler (C, C++). #include <stdlib.h> //malloc and free #include <stdio.h> //printf #include <omp.h> //OpenMP // Very small values for this simple illustrative example #define ARRAY_SIZE 8 //Size of arrays whose elements will be added together. #define NUM_THREADS 4 //Number of threads to use for vector addition. /* int main (int argc, char *argv[]) { // elements of arrays a and b will be added // and placed in array c int * a; int * b; int * c; intn = ARRAY_SIZE; // number of array elements intn_per_thread; // elements per thread inttotal_threads = NUM_THREADS; // number of threads to use inti; // loop index // allocate space for the arrays a = (int *) malloc(sizeof(int)*n); b = (int *) malloc(sizeof(int)*n); c = (int *)…
Prob 7. We have learned in the class that using the barrel shifter, we can implement multiplication/division of a number for some special cases with addition, subtraction, and reversed subtraction instructions as well as shift instructions. For each of the following calculations, write a single-line assembly code to perform it using this approach assuming signed integers A and B are saved in r0 and ri respectively: (a) A = 7 * B / 8 (b) A 7 B/8 5