Multiply by negative one

[chants]

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?