for(int i = ((a > b) ? x : y); i < c; i++){...}
How will this be compiled? Will it hurt performance due to lack of unrolling or something?
Name:
Anonymous2013-01-14 10:30
>>10 smaller IS faster
I haven't tried it yet, but does this mean there's no way I can beat instructions like FSIN or FPATAN in speed (while keeping precision) even if I use a lookup table that fills the entire RAM? Are the lookup tables that the FPU uses optimal in size?