diff options
| author | Rangi <remy.oukaour+rangi42@gmail.com> | 2021-07-11 18:00:54 -0400 |
|---|---|---|
| committer | Rangi <remy.oukaour+rangi42@gmail.com> | 2021-07-11 18:00:54 -0400 |
| commit | 0946b8392fbf93d80ab0b5dfeaeff9f95436d04d (patch) | |
| tree | a5a7ae081b0368363195d4df2494ca6acd0bde9e | |
| parent | bf6d6845ece468e18f649d3cb462ea3712486a13 (diff) | |
rept -> for
| -rw-r--r-- | Optimizing-assembly-code.md | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/Optimizing-assembly-code.md b/Optimizing-assembly-code.md index 9fadc1d..017085e 100644 --- a/Optimizing-assembly-code.md +++ b/Optimizing-assembly-code.md @@ -276,11 +276,9 @@ Or if you really want to optimize for speed over size, then do this: ; 256 bytes; placed in ROM0 or the same ROMX section as the bit reversal SECTION "ReversedBitTable", ROM0, ALIGN[8] ReversedBitTable:: -x = 0 -rept 256 +for x, 256 ; http://graphics.stanford.edu/~seander/bithacks.html#ReverseByteWith32Bits db LOW(((((x * $802) & $22110) | ((x * $8020) & $88440)) * $10101) >> 16) -x = x + 1 endr ``` |