Write the RISC-V assembly code to implement the following C code as an atomic “set max” operation using the lr.d/sc.d instructions. Here, the argument shvar contains the address of a shared variable which should be replaced by x if x is greater than the value it points to: void setmax(int* shvar, int x) { // Begin critical section if (x > *shvar) *shvar = x; // End critical section } }

Write the RISC-V assembly code to implement the following C code as an atomic “set max” operation using the lr.d/sc.d instructions. Here, the argument shvar contains the address of a shared variable which should be replaced by x if x is greater than the value it points to: void setmax(int* shvar, int x) { // Begin critical section if (x > shvar) shvar = x; // End critical section } }

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

Part 1: Preliminary Summarize the difference between binary machine language, assembly language, and high-level source files like C. Contrast the difference between a compiler, assembler, and linker What is the difference between the data segment and the text segment of in an assembly language program? What register is used as the stack pointer? What is a ebreak instruction in the sample program? How would you define a constant named 'BLUE' and assign it to the value OX00F in assembly language? Describe how to implement the psuedo-instruction li t1, e using a native instruction.
For the following C statement, write the correspondingRISC-V assembly code. Assume that the variables f, g, h, i, and j are assigned toregisters x5, x6, x7, x28, and x29, respectively. Assume that the base address ofthe arrays A and B are in registers x10 and x11, respectively. B[8] = A[i−j];
Quiz-1: Refer to Lecture-3 Module 1 swap (int* V, int k) { temp = V[k]; /* temp in $t0 */ V[k] = V[k+1]; V[k+1] = temp; } Write the swap() function using special registers required for accessing parameters passed to this function. Use “t” registers for any needed temporary registers.
Systems Programming Purpose: The purpose of this assignment is to practice loop instructions and array iterations in M6800 assembly language programming. Write an assembly language program which implements the following C code that is a find minimum problem solution implementation: int A[10] = {8, 14, 6, 16, 5, 5, 10, 9, 4, 11}; int i = 0; int min = 255; // This is the largest number 8-bit accumulators can hold. while (i < 10) { if (A[i] < min) min = A[i]; } Your solution should be able to handle all possible array elements and orderings for any value an accumulator can hold. You should treat variable į as XR in assembler (index register) and store variable min in the address 60H. 0010: 00 00 00 00 00 00 00 00 0O 00 00 00 00 00 00 00 8628: 00 060 00 00 00 600 00 00 00 08 08 00 6 00 00 00 0030: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 0040: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 0050: 00 G0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 006 0: 00 00 00 00 00 00 00 00 00 08 00…
Evaluate the C code statements in MIPS assembly codefor(i = 0; i < a; i++) for(j = 0; j < b; j++) D[4*j] = i + j; Assume that i is assigned to $s0, j is assigned to $s1, a is assigned to register $s2, b is assigned to $s3, and the base address of the array D is assigned to $s4
Question 4 Convert the following C code into ARM assembly code. // pointer to v in X1, n in X2, return prod in X0 double arraytimes(double *v, int n) { int i; double prod for(i=0; i
In assembly 68k write the: Initialize the supervisor stack pointer to $8000 Initialize the program counter to $1000 Reserve locations at $2000 to hold your first name only (Joshua) as text and call it NAM Reserve locations at $3000 to store 9 longwords, call it MEM, and write your family name (Kimmich) as a comment Reserve locations at $12400 to store 32-bit unsigned integer variable called RES (to be computed)
Write three address code and quadruple for the expression a[i] = -b * (a[k--] – y[ k--] /2)
3. The table below represents a stack stored in a contiguous block of memory cells (as discussed in the text). If the base of the stack is at address 0x10 and the stack pointer contains the value 0x12, what value is retrieved by a pop instruction? What value is in the stack pointer after the pop operation? Address 0x10 0x11 0x12 0x13 0x14 Contents 'F' 'C' 'A' 'B' 'E'
The 32-bit RISC-V base integer instruction set (rv32i) does not support multiplication and division operations. To deal with this, a compiler may call a function when a multiplication is needed. For example, gcc expects that a function - mulsi3(unsigned int a, unsigned int b) is provided to multiply two integers. A multiplication can be carried out by repeated additions and shifts: unsigned int -_mulsi3 (unsigned int a, unsigned int b) { unsigned int r = 0; while (a) { if (a & 1) { r += b; } a >>= 1; b <<= 1; } return r; } a) Translate the above C code into equivalent RISC-V rv32i assembler code. Comment the as- sembler code to explain how the calculation proceeds. Note that the arguments are passed via the registers a0 (x10) and a1 (x11) and that the result is returned in a0 (x10). b) Does the function need function call prolog and epilog? Explain why or why not. You are invited to use emulsiV to develop and test your assembler code.
Write the LEGv8 assembly program for following c program. Assume array1, array2 and array3 are stored in memory with base addresses at 1000, 2000 and 3000 respectively. int absoluteDifference(int x, int y) {int r;if (x > y)r = x - y;elser = y - x; return r;} int main() {for (int i=0; i < 10; i++) {int a = array1[i];int b = array2[i];int c = absoluteDifference(a, b);array3[i] = c;}}
Create a program in C++ which simulates a direct cache. The memory array that contains the data to becached is byte addressable and can contain 256 single byte entries or lines. The cache has only 8 entriesor lines. The Data field in each line of the cache is 8 bits. Since the data stored in each line of the cache isonly 8 bits, there is no need for a line field. Only a tag field is needed which is log2(256) = 8 bits.The memory array can be filled with any values of your choice. The program should work by taking userinput of a memory address (index). This input represents the memory data that should be cached.Check the cache to see if the item is already cached. If it is not, your program should counta cache miss, and then replace the item currently in the cache with the data from the inputted address.Allow the user to input addresses (in a loop), until they so choose to end the program. The program should output the number of cache misses upon ending.