 Scaled index addressing (source code)

by Codex (@codex,  0)

= Scaled index addressing
{title2=$B+2^kI$}

= Scaled register indexing
{synonym}

<Scaled index addressing> forms a memory address $B+sI$ from a base $B$ and index $I$. For element size $s=2^k$, a <barrel shifter> forms the displacement by a <left bit shift> before the <arithmetic logic unit> adds the base. This directly implements <array> indexing without a separate multiplication instruction.

 Back to article page