From e5541d131edde9df94e66cab6e8be210635134a3 Mon Sep 17 00:00:00 2001 From: Jonas Jacobsson <jonjac-6@student.ltu.se> Date: Mon, 8 Mar 2021 14:55:28 +0000 Subject: [PATCH] Update rtic_bare2.rs --- examples/rtic_bare2.rs | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/examples/rtic_bare2.rs b/examples/rtic_bare2.rs index ff4a91f..366791c 100644 --- a/examples/rtic_bare2.rs +++ b/examples/rtic_bare2.rs @@ -155,6 +155,8 @@ End of assembler dump. // // Answer in your own words, why you believe the generated code differs? // -// 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. +*/ // // Commit your answers (bare2_3) -- GitLab