Lines Matching full:128
102 # For sizes less than 256 bytes, we can't fold 128 bytes at a time.
106 # Load the first 128 data bytes. Byte swapping is necessary to make the
116 add $128, buf
133 # Subtract 128 for the 128 data bytes just consumed. Subtract another
134 # 128 to simplify the termination condition of the following loop.
137 # While >= 128 data bytes remain (not counting xmm0-7), fold the 128
144 add $128, buf
145 sub $128, len
164 # Add 128 to get the correct number of data bytes remaining in 0...127
165 # (not counting xmm7), following the previous extra subtraction by 128.
168 add $128-16, len
226 # Reduce the 128-bit value M(x), stored in xmm7, to the final 16-bit CRC
232 # x^64. This produces a 128-bit value congruent to x^64 * M(x) and
291 .quad 0x0000000000006123 # x^(8*128) mod G(x)
292 .quad 0x0000000000002295 # x^(8*128+64) mod G(x)
294 .quad 0x0000000000001069 # x^(4*128) mod G(x)
295 .quad 0x000000000000dd31 # x^(4*128+64) mod G(x)
297 .quad 0x000000000000857d # x^(2*128) mod G(x)
298 .quad 0x0000000000007acc # x^(2*128+64) mod G(x)
300 .quad 0x000000000000a010 # x^(1*128) mod G(x)
301 .quad 0x0000000000001faa # x^(1*128+64) mod G(x)