Lines Matching refs:t
19 ulong32 t; in s_pi2() local
20 t = (p[1] + k[0]) & 0xFFFFFFFFUL; in s_pi2()
21 t = (ROL(t, 1) + t - 1) & 0xFFFFFFFFUL; in s_pi2()
22 t = (ROL(t, 4) ^ t) & 0xFFFFFFFFUL; in s_pi2()
23 p[0] ^= t; in s_pi2()
28 ulong32 t; in s_pi3() local
29 t = p[0] + k[1]; in s_pi3()
30 t = (ROL(t, 2) + t + 1) & 0xFFFFFFFFUL; in s_pi3()
31 t = (ROL(t, 8) ^ t) & 0xFFFFFFFFUL; in s_pi3()
32 t = (t + k[2]) & 0xFFFFFFFFUL; in s_pi3()
33 t = (ROL(t, 1) - t) & 0xFFFFFFFFUL; in s_pi3()
34 t = ROL(t, 16) ^ (p[0] | t); in s_pi3()
35 p[1] ^= t; in s_pi3()
40 ulong32 t; in s_pi4() local
41 t = (p[1] + k[3]) & 0xFFFFFFFFUL; in s_pi4()
42 t = (ROL(t, 2) + t + 1) & 0xFFFFFFFFUL; in s_pi4()
43 p[0] ^= t; in s_pi4()
48 int n, t; in s_setup() local
53 t = 4; in s_setup()
64 s_pi2(p, k+t); in s_setup()
66 s_pi3(p, k+t); in s_setup()
68 s_pi4(p, k+t); in s_setup()
76 int n, t; in s_encrypt() local
77 for (t = n = 0; ; ) { in s_encrypt()
79 s_pi2(p, uk+t); if (++n == N) break; in s_encrypt()
80 s_pi3(p, uk+t); if (++n == N) break; in s_encrypt()
81 s_pi4(p, uk+t); if (++n == N) break; in s_encrypt()
82 t ^= 4; in s_encrypt()
88 int n, t; in s_decrypt() local
89 for (t = 4*(((N-1)>>2)&1), n = N; ; ) { in s_decrypt()
91 case 4: s_pi4(p, uk+t); --n; /* FALLTHROUGH */ in s_decrypt()
92 case 3: s_pi3(p, uk+t); --n; /* FALLTHROUGH */ in s_decrypt()
93 case 2: s_pi2(p, uk+t); --n; /* FALLTHROUGH */ in s_decrypt()
97 t ^= 4; in s_decrypt()