Lines Matching +full:8 +full:l
10 * - uses cmpbge to compare 8 bytes in parallel
28 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1
49 ldq_u $1, 0($16) # L : load first quadword Latency=3
50 and $17, 0xff, $17 # E : L L U U : 00000000000000ch
55 lda $3, -1($31) # E : U L L U
60 sll $17, 32, $2 # U : U L L U : chchchch00000000
65 ldq_u $6, -1($5) # L : L U U L : eight or less bytes to search Latency=3
70 or $7, $6, $1 # E : L U L U $1 = quadword starting at $16
72 # Deal with the case where at most 8 bytes remain to be searched
80 cmpbge $31, $1, $2 # E : L U L U
85 beq $2, $not_found # U : U L U L
96 ret # L0 : L U L U
110 addq $0, 2, $3 # E : U L U L : 2 cycle stall on $0
115 addq $0, 1, $3 # E : U L U L : 2 cycle stall on $0
120 ret # L0 : L U L U
123 # Deal with the case where $18 > 8 bytes remain to be
130 or $1, $2, $1 # E : U L U L $1 = ====ffffffffffff
135 ldq $1, 8($0) # L :
136 subq $5, 1, $18 # E : U L U L
138 addq $0, 8, $0 # E :
143 beq $2, $final # U : U L U L
148 and $4, 8, $4 # E : odd number of quads?
151 mov $1, $4 # E : L U L U : move prefetched value to correct reg
155 ldq $1, 8($0) # L : prefetch $1
158 bne $2, $found_it # U : U L U L
160 addq $0, 8, $0 # E :
167 ldq $4, 8($0) # L : prefetch $4
169 addq $0, 8, $6 # E :
173 addq $0, 8, $0 # E :