|
Arithmetic coerce to negative one, and the like
See below, this was a simple late night mistake.
Just an interesting asm question, since we know that:
mul [val], -1
is inefficient in terms of clock cycles, is there a pure Boolean algebra (and/or/xor/not/neg) way of doing this without doing expensive multiplication?
Last edited by chants; 01-19-2017 at 08:48.
|