raw_add_bits8 A0..A7, B0..B7, S0..S7, carry = 25 cells
raw_inc_bits8 a0..a7, s0..s7, carry = 17 cells
Both follow the same protocol as the four bit version: no rotation, every cell
holds a single bit, one slice per bit, and the final carry is dropped because
the caller promises the result fits.
The increment slices down to 3 cells -- a, carry (in -> out), s -- and %synth
finds cost 25 in 4 blocks for it: s = a^Ci, carry = a&Ci. Its table was written
as 8 entries because a 3 parameter stat line wants 2^3 values, and the s bit in
the index does not matter, so the four entry pattern repeats.
One mistake worth recording: set_1 takes no arguments and acts on the current
cell, so 'set_1 %17' silently did nothing and the carry started at 0 instead of
1 -- which made 1+1 give 1 instead of 2 while 42+1 and 200+1 looked fine, since
only the low bit was affected. The driver now does '.tp %17' then 'set_1'.
Verified on the built in machine:
raw_add_bits8 9 sums (100+50, 128+127, 200+55, 254+1, ...) 9/9
raw_inc_bits8 9 values (0, 1, 5, 15, 127, 200, 253, 254, ...) 9/9
Tapes: 2550 and 1514 characters.