In this lab, we write function binary_search in RISC-V. The prototype of the function and an implementation in C is at the end of this page. Translate the C code at the bottom of the page to RISC-V assembly code. The skeleton code is in lab4.s. Function binary_search is located at the end of the file. It is empty in the skeleton code. There are some constraints/tips. 1. To ensure we do not use pseudoinstructions, we turn off the feature in RARS. In Settings, uncheck "Permit extended (pseudo) instructions and formats". 2. Follow the C code closely. Although binary search is simple, it is very easy to make mistakes if you have not written it many times. 3. We keep variable left in register s1. Other local variables do not have to be in a saved register. Think about why we need to keep left, but not other variables, in a saved register. 4. There should be only one exit (one return instruction) in the function. In the C code, we use goto f_exit on purpose. With one exit, we do not have multiple copies of clean up code, e.g., restoring saved registers. 5. There is an IF-ELSEIF-ELSE structure. Write the outline first, without instructions in each branch. Follow the order of branches in C code: IF branch, then the ELSEIF branch, and finally the ELSE branch. It is easier to check the code this way. 6. There is only one LW instruction, for reading a [half], between the code that saves/restores registers. 7. During the execution of the program, examine how ra and sp registers are changed and what have been saved on the stack. It helps to understand how funciton and local storage works.
In this lab, we write function binary_search in RISC-V. The prototype of the function and an implementation in C is at the end of this page. Translate the C code at the bottom of the page to RISC-V assembly code. The skeleton code is in lab4.s. Function binary_search is located at the end of the file. It is empty in the skeleton code. There are some constraints/tips. 1. To ensure we do not use pseudoinstructions, we turn off the feature in RARS. In Settings, uncheck "Permit extended (pseudo) instructions and formats". 2. Follow the C code closely. Although binary search is simple, it is very easy to make mistakes if you have not written it many times. 3. We keep variable left in register s1. Other local variables do not have to be in a saved register. Think about why we need to keep left, but not other variables, in a saved register. 4. There should be only one exit (one return instruction) in the function. In the C code, we use goto f_exit on purpose. With one exit, we do not have multiple copies of clean up code, e.g., restoring saved registers. 5. There is an IF-ELSEIF-ELSE structure. Write the outline first, without instructions in each branch. Follow the order of branches in C code: IF branch, then the ELSEIF branch, and finally the ELSE branch. It is easier to check the code this way. 6. There is only one LW instruction, for reading a [half], between the code that saves/restores registers. 7. During the execution of the program, examine how ra and sp registers are changed and what have been saved on the stack. It helps to understand how funciton and local storage works.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![In this lab, we write function binary_search in RISC-V. The prototype of the function and an implementation in C is at the end of this page.
Translate the C code at the bottom of the page to RISC-V assembly code.
The skeleton code is in lab4.s. Function binary_search is located at the end of the file. It is empty in the skeleton code.
There are some constraints/tips.
1. To ensure we do not use pseudoinstructions, we turn off the feature in RARs. In Settings, uncheck "Permit extended (pseudo)
instructions and formats".
2. Follow the C code closely. Although binary search is simple, it is very easy to make mistakes if you have not written it many times.
3. We keep variable left in register s1. Other local variables do not have to be in a saved register. Think about why we need to keep
left, but not other variables, in a saved register.
4. There should be only one exit (one return instruction) in the function. In the C code, we use goto f_exit on purpose. With one exit,
we do not have multiple copies of clean up code, e.g., restoring saved registers.
5. There is an IF-ELSEIF-ELSE structure. Write the outline first, without instructions in each branch. Follow the order of branches in C
code: IF branch, then the ELSEIF branch, and finally the ELSE branch. It is easier to check the code this way.
6. There is only one LW instruction, for reading a [half], between the code that saves/restores registers.
7. During the execution of the program, examine how ra and sp registers are changed and what have been saved on the stack. It helps
to understand how funciton and local storage works.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0479af13-017d-4811-96ca-57a27d108fb2%2Fdc73f2af-efdc-4318-8e8b-220a7a449a5f%2F0j3fzg_processed.png&w=3840&q=75)
Transcribed Image Text:In this lab, we write function binary_search in RISC-V. The prototype of the function and an implementation in C is at the end of this page.
Translate the C code at the bottom of the page to RISC-V assembly code.
The skeleton code is in lab4.s. Function binary_search is located at the end of the file. It is empty in the skeleton code.
There are some constraints/tips.
1. To ensure we do not use pseudoinstructions, we turn off the feature in RARs. In Settings, uncheck "Permit extended (pseudo)
instructions and formats".
2. Follow the C code closely. Although binary search is simple, it is very easy to make mistakes if you have not written it many times.
3. We keep variable left in register s1. Other local variables do not have to be in a saved register. Think about why we need to keep
left, but not other variables, in a saved register.
4. There should be only one exit (one return instruction) in the function. In the C code, we use goto f_exit on purpose. With one exit,
we do not have multiple copies of clean up code, e.g., restoring saved registers.
5. There is an IF-ELSEIF-ELSE structure. Write the outline first, without instructions in each branch. Follow the order of branches in C
code: IF branch, then the ELSEIF branch, and finally the ELSE branch. It is easier to check the code this way.
6. There is only one LW instruction, for reading a [half], between the code that saves/restores registers.
7. During the execution of the program, examine how ra and sp registers are changed and what have been saved on the stack. It helps
to understand how funciton and local storage works.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY