Lines Matching +full:2 +full:v5
19 * We then use fixed point Barrett reduction to compute a mod n over GF(2)
85 subi r7,r1,56+2*16
131 bgt 2f
133 2: subf r6,r7,r6
162 vxor v5,v5,v5
173 beq 2f
197 2: bdz .Lfirst_warm_up_done
287 vxor v5,v5,v13
333 vxor v5,v5,v13
352 vxor v5,v5,v13
368 vsldoi v5,v5,zeroes,4
398 vxor v21,v5,v13
427 lvx v5,off80,r3
437 VPMSUMW(v5,v21,v5)
496 vxor v4,v4,v5
525 * doing the computation 2x bits higher (ie 64 bits) and shifting the
526 * result back down 2x bits, we round down to the nearest multiple.
529 vsldoi v1,zeroes,v1,8 /* q = floor(ma/(2^64)) */
531 vxor v0,v0,v1 /* a - qn, subtraction is xor in GF(2) */
535 * V0 [ 0 1 2 X ]
536 * V0 [ 0 X 2 3 ]
545 * the algorithm because we don't carry in mod 2 arithmetic.
551 vxor v0,v0,v1 /* a - qn, subtraction is xor in GF(2) */
557 * V0 [ 0 X 2 3 ]
567 subi r7,r1,56+2*16
653 lvx v5,off80,r4
655 VPERM(v5,v5,v17,byteswap)
656 VPMSUMW(v5,v5,v17)
731 .Lv5: vxor v19,v19,v5