From 0b4d55f0e31ed1e94e690fdd0c9de56cdf809c9f Mon Sep 17 00:00:00 2001 From: pkivolowitz Date: Wed, 8 Jun 2022 04:16:49 -0500 Subject: [PATCH] Update ldr.md --- section_1/regs/ldr.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/section_1/regs/ldr.md b/section_1/regs/ldr.md index 9995145..4d8aa03 100644 --- a/section_1/regs/ldr.md +++ b/section_1/regs/ldr.md @@ -163,7 +163,7 @@ is implemented as: add x1, x0, x1, lsl 3 ``` -We are performing address arithmetic on `longs`. Each `long` is 8 bytes wide. `x1, lsl 3` means "before adding the value of `x1` to `x0`, multiple `x1` by 8." Eight is 2 raised to the power of 3. `lsl 3` means shift left by 3 bits ... shifting is a fast way of integer multiplication (and division) by powers of 2. +We are performing address arithmetic on `longs`. Each `long` is 8 bytes wide. `x1, lsl 3` means "before adding the value of `x1` to `x0`, multiply `x1` by 8." Eight is 2 raised to the power of 3. `lsl 3` means shift left by 3 bits ... shifting is a fast way of integer multiplication (and division) by powers of 2. `Line 13` is the branch to the *bottom* of the loop where the decision code is written. We saw how this can save an instruction [here](../for/README.md).