Lines Matching full:bytes

115 	// Fold reg1, reg2 into the next 32 data bytes, storing the result back
159 	// For sizes less than 256 bytes, we can't fold 128 bytes at a time.
165 	// Load the first 128 data bytes.  Byte swapping is necessary to make
193 	// Load the constants for folding across 128 bytes.
196 	// Subtract 128 for the 128 data bytes just consumed.  Subtract another
200 	// While >= 128 data bytes remain (not counting q0-q7), fold the 128
201 	// bytes q0-q7 into them, storing the result back into q0-q7.
210 	// Now fold the 112 bytes in q0-q6 into the 16 bytes in q7.
212 	// Fold across 64 bytes.
218 	// Fold across 32 bytes.
221 	// Fold across 16 bytes.
224 	// Add 128 to get the correct number of data bytes remaining in 0...127
230 	// While >= 16 data bytes remain (not counting q7), fold the 16 bytes q7
245 	// Add 16 to get the correct number of data bytes remaining in 0...15
251 	// Reduce the last '16 + len' bytes where 1 <= len <= 15 and the first
252 	// 16 bytes are in q7 and the rest are the remaining data in 'buf'.  To
254 	// redivide the bytes into a first chunk of 'len' bytes and a second
255 	// chunk of 16 bytes, then fold the first chunk into the second.
257 	// q0 = last 16 original data bytes
264 	// q1 = high order part of second chunk: q7 left-shifted by 'len' bytes.
271 	// q3 = first chunk: q7 right-shifted by '16-len' bytes.
277 	// Convert to 8-bit masks: 'len' 0x00 bytes, then '16-len' 0xff bytes.
280 	// q2 = second chunk: 'len' bytes from q0 (low-order bytes),
281 	// then '16-len' bytes from q1 (high-order bytes).
325 	// Checksumming a buffer of length 16...255 bytes
329 	// Load the first 16 data bytes.
339 	// Load the fold-across-16-bytes constants.
375 // len] is the index vector to shift left by 'len' bytes, and is also {0x80,
376 // ..., 0x80} XOR the index vector to shift right by '16 - len' bytes.