Lines Matching full:128

165 	vld1.64		{q12}, [r4, :128]
218 	vld1.64		{FOLD_CONSTS}, [fold_consts_ptr, :128]!
224 	// For sizes less than 256 bytes, we can't fold 128 bytes at a time.
230 	// Load the first 128 data bytes.  Byte swapping is necessary to make
258 	// Load the constants for folding across 128 bytes.
259 	vld1.64		{FOLD_CONSTS}, [fold_consts_ptr, :128]!
261 	// Subtract 128 for the 128 data bytes just consumed.  Subtract another
262 	// 128 to simplify the termination condition of the following loop.
265 	// While >= 128 data bytes remain (not counting q0-q7), fold the 128
272 	subs		len, len, #128
278 	vld1.64		{FOLD_CONSTS}, [fold_consts_ptr, :128]!
289 	// Add 128 to get the correct number of data bytes remaining in 0...127
290 	// (not counting q7), following the previous extra subtraction by 128.
293 	adds		len, len, #(128-16)
368 	vld1.64		{FOLD_CONSTS}, [fold_consts_ptr, :128]!
388 	// Reduce the 128-bit value M(x), stored in q7, to the final 16-bit CRC.
391 	vld1.64		{FOLD_CONSTS}, [fold_consts_ptr, :128]!
394 	// x^64.  This produces a 128-bit value congruent to x^64 * M(x) and
408 	vld1.64		{FOLD_CONSTS}, [fold_consts_ptr, :128]
430 	vst1.64		{q7}, [r3, :128]
440 	.quad		0x0000000000006123	// x^(8*128)	mod G(x)
441 	.quad		0x0000000000002295	// x^(8*128+64)	mod G(x)
443 	.quad		0x0000000000001069	// x^(4*128)	mod G(x)
444 	.quad		0x000000000000dd31	// x^(4*128+64)	mod G(x)
446 	.quad		0x000000000000857d	// x^(2*128)	mod G(x)
447 	.quad		0x0000000000007acc	// x^(2*128+64)	mod G(x)
449 	.quad		0x000000000000a010	// x^(1*128)	mod G(x)
450 	.quad		0x0000000000001faa	// x^(1*128+64)	mod G(x)