Skip to content
Snippets Groups Projects
Commit 22dce7b0 authored by tommy's avatar tommy Committed by Tommy Andersson
Browse files

fixed 1 again

parent 69ed60a5
No related branches found
No related tags found
No related merge requests found
...@@ -155,14 +155,15 @@ End of assembler dump. ...@@ -155,14 +155,15 @@ End of assembler dump.
// //
// Answer in your own words, why you believe the generated code differs? // Answer in your own words, why you believe the generated code differs?
// //
<<<<<<< HEAD
/* /*
To save space the compiler makes some optimizations in the code. To save space the compiler makes some optimizations in the code.
So wait is now compiled as a function and takes an argument in r0 instead of So wait is now compiled as a function and takes an argument in r0 instead of
just setting a value before it runs. just setting a value before it runs.
*/ */
======= /*
// It starts the wait function where it just loops nops. It starts the wait function where it just loops nops for a certain number of times that fits the wait value. Each time it will remove 1 from r0 and check if it resulted in a negative number or not. If it results in a negative number it will not branch and the wait is over. So if you insert 100 it will probably divide 100 on 8 and then insert the nearest hole number of that in to r0.
>>>>>>> a08f880 (bare1-3 done) */
// //
// Commit your answers (bare2_3) // Commit your answers (bare2_3)
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment