Lines Matching +full:128 +full:a
24 // This software is available to you under a choice of one of two
49 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
75 .arch armv8-a
141 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
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.
194 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
196 // Subtract 128 for the 128 data bytes just consumed. Subtract another
197 // 128 to simplify the termination condition of the following loop.
200 // While >= 128 data bytes remain (not counting q0-q7), fold the 128
207 subs len, len, #128
213 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
224 // Add 128 to get the correct number of data bytes remaining in 0...127
225 // (not counting q7), following the previous extra subtraction by 128.
228 adds len, len, #(128-16)
253 // do this without needing a fold constant for each possible 'len',
254 // redivide the bytes into a first chunk of 'len' bytes and a second
291 // Reduce the 128-bit value M(x), stored in q7, to the final 16-bit CRC.
294 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
297 // x^64. This produces a 128-bit value congruent to x^64 * M(x) and
302 // Fold the high 32 bits into the low 96 bits. This produces a 96-bit
311 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]
325 // Checksumming a buffer of length 16...255 bytes
340 vld1.64 {FOLD_CONSTS}, [fold_consts_ptr, :128]!
350 .section ".rodata", "a"
356 .quad 0x0000000000006123 // x^(8*128) mod G(x)
357 .quad 0x0000000000002295 // x^(8*128+64) mod G(x)
359 .quad 0x0000000000001069 // x^(4*128) mod G(x)
360 .quad 0x000000000000dd31 // x^(4*128+64) mod G(x)
362 .quad 0x000000000000857d // x^(2*128) mod G(x)
363 .quad 0x0000000000007acc // x^(2*128+64) mod G(x)
365 .quad 0x000000000000a010 // x^(1*128) mod G(x)
366 .quad 0x0000000000001faa // x^(1*128+64) mod G(x)