Lines Matching refs:to
9 * - uses cmpbge to compare 8 bytes in parallel
10 * - does binary search to find 0 byte in last
11 * quadword (HAKMEM needed 12 instructions to
28 * Try not to change the actual algorithm if possible for consistency.
41 # Hack -- if someone passes in (size_t)-1, hoping to just
45 # the length is the easiest way to avoid trouble.
64 ldq_u $6, -1($5) # L : L U U L : eight or less bytes to search Latency=3
71 # Deal with the case where at most 8 bytes remain to be searched
89 * Since we are guaranteed to have set one of the bits, we don't
90 * have to worry about coming back with a 0x40 out of cttz...
122 # Deal with the case where $18 > 8 bytes remain to be
133 # At least one byte left to process.
138 # Make $18 point to last quad to be accessed (the
144 # At least two quads remain to be accessed.
146 subq $18, $0, $4 # E : $4 <- nr quads to be processed
149 # At least three quads remain to be accessed
150 mov $1, $4 # E : L U L U : move prefetched value to correct reg
180 $final: subq $5, $0, $18 # E : $18 <- number of bytes left to do