That's a neat optimisation, but it gets its gains by pushing some of the required processing out of the benchmark.
What I mean by that is that the sets of 32 numbers are manipulated in pairs (of sets).
So, using uicb() I would have to expand one set to the buffer; copy them somewhere else; then expand the second set; before I could then do the manipulations. Ie, the copying would still need to be done, but it is no longer being measured.
In reply to Re^6: unpacking 6-bit values
by BrowserUk
in thread unpacking 6-bit values
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |