>>236
Not all bitwise operations are bithacks. A bithack is a low-level trick which replaces something complex with a series of low-latency opcodes.
A xsum*((((xsum>=0)|0)<<1)-1) is bithack in sense it replaces a "complex" function call for Math.abs(its externally complex, but in reality is inlined to fabs(x)) with several OP codes which do not stall the pipeline.
A ternary xsum=xsum>0?xsum:-xsum introduces a branch which stalls the pipepine and if mispredicted will lose many cycles while the above codes suffers no penalty, though it takes longer then calling a specific opcode for this operation in ASM(whic fabs reduces to)