Native selection of canonical signed keys #
All arithmetic is unsigned. The sign bit and magnitude are decoded explicitly, the label is formed by addition or subtraction, and its two digits are computed with native shifts and remainders. The repeated-value case doubles the key and subtracts its original sign bit.
Main definitions #
Select.program: concrete selection and transformation instructions.
Magnitude bound, followed by two bit positions, selected digit and scan mode.
Instances For
Magnitude bound, followed by two bit positions, selected digit and scan mode.
Instances For
Magnitude bound, followed by two bit positions, selected digit and scan mode.
Instances For
Magnitude bound, followed by two bit positions, selected digit and scan mode.
Instances For
Magnitude bound, followed by two bit positions, selected digit and scan mode.
Instances For
Input key; replaced by its selected output value.
Instances For
Full input multiplicity, read without truncation.
Instances For
Small constants installed by the scan.
Instances For
Small constants installed by the scan.
Instances For
Small constants installed by the scan.
Instances For
Small constants installed by the scan.
Instances For
Small constants installed by the scan.
Instances For
Small constants installed by the scan.
Instances For
Scratch registers for decoding and label digits.
Instances For
Scratch registers for decoding and label digits.
Instances For
Scratch registers for decoding and label digits.
Instances For
Scratch registers for decoding and label digits.
Instances For
Selection flag, either zero or one.
Instances For
Magnitude temporary.
Instances For
Explicit native sign/magnitude decoding, shifted label and binary digit computation.
Instances For
A no-op used by unsuccessful selections.
Instances For
Select one of the six finite scan modes and perform the repeated-value transformation.
Instances For
Every decoding, arithmetic, branch and selection instruction is part of this code.
Instances For
This scalar program never reads the physical word width.
Registers below the decoding scratch are preserved by label calculation.
Decoding and both binary digits cost at most eleven native instructions.
Selection from already computed digits, with the full repeated-value count.
Complete native scalar selection. Its cost includes decoding, both label bits and doubling.