Question

Explain steps also please. Thanks. - We want to implement "if (m != n) m--;" in...

Explain steps also please. Thanks.

- We want to implement "if (m != n) m--;" in LEGv8.

Suppose m and n are in X20 and X21, respectively. What should we use in the blank in the following code segment?

SUB X9,X20,X21

_____ EXIT

SUBI X20,#1

EXIT:

- Suppose X20 contain the decimal value 5 and X21 contains the decimal value -5. Which condition codes are set to 1 after the following instruction is executed?

ADDS X9,X20,X21

- We want to implement "if (m != n) m--;" in LEGv8.

Suppose m and n are in X20 and X21, respectively. What should we use in the blank in the following code segment?

SUB X9,X20,X21

_____ EXIT

SUBI X20,#1

EXIT:

Homework Answers

Answer #1

Part 1:

SUB X9,X20,X21

CBZ X9 EXIT

SUBI X20,#1

EXIT:

Knowledge behind above:

CBZ register, L1    if (register == 0) branch to instruction labeled L1;

CBNZ register, L1 if (register != 0) branch to instruction labeled L1;

Here, we will exit only when m==n otherwise we will do m--. So, we used here CBZ command.

Part 2:

The Z flag is set if the result of the flag-setting instruction is zero.

Here,

ADDS X9,X20,X21 result in X9 as 0

So, Z flag set to 1.

Knowledge behind above:

Condition codes, set from arithmetic instruction

negative (N): result had 1 in MSB

zero (Z): result was 0

overlow (V): result overflowed

carry (C): result had carryout from MSB

Part 3:

It is same as part 1. So, same answer as in part 1 can be used.

Hope it helps.

Thank you!

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the C program (twoupdate) to demonstrate race condition. In this assignment, we will implement Peterson's...
Consider the C program (twoupdate) to demonstrate race condition. In this assignment, we will implement Peterson's algorithm to ensure mutual exclusion in the respective critical sections of the two processes, and thereby eliminate the race condition. In order to implement Peterson's Algorithm, the two processes should share a boolean array calledflagwith two components and an integer variable called turn, all initialized suitably. We will create and access these shared variables using UNIX system calls relating to shared memory – shmget,...
#Linked Lists and Classes #C++ Hi, please use singly linked list method to do this question....
#Linked Lists and Classes #C++ Hi, please use singly linked list method to do this question. Thank you! Here’s the contents of a file called example.cpp: // example.cpp #include "LinkedList.h" #include <iostream> #include <string> using namespace std; int main() { cout << "Please enter some words (ctrl-d to stop):\n"; LinkedList lst; int count = 0; string s; while (cin >> s) { count++; lst.add(remove_non_letters(s)); } // while cout << "\n" << count << " total words read in\n"; cout <<...
please can you make it simple. For example using scanner or hard coding when it is...
please can you make it simple. For example using scanner or hard coding when it is a good idea instead of arrays and that stuff.Please just make one program (or class) and explain step by step. Also it was given to me a txt.htm 1.- Write a client program and a server program to implement the following simplified HTTP protocol based on TCP service. Please make sure your program supports multiple clients. The webpage file CS3700.htm is provided. You may...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT