11   unsigned int j;  in add()  local
14   for (j = 0;j < 31;++j) { u += a[j] + b[j]; out[j] = u & 255; u >>= 8; }  in add()
20   unsigned int j;  in sub()  local
23   for (j = 0;j < 31;++j) {  in sub()
24     u += a[j] + 65280 - b[j];  in sub()
25     out[j] = u & 255;  in sub()
34   unsigned int j;  in squeeze()  local
37   for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; }  in squeeze()
40   for (j = 0;j < 31;++j) { u += a[j]; a[j] = u & 255; u >>= 8; }  in squeeze()
51   unsigned int j;  in freeze()  local
54   for (j = 0;j < 32;++j) aorig[j] = a[j];  in freeze()
57   for (j = 0;j < 32;++j) a[j] ^= negative & (aorig[j] ^ a[j]);  in freeze()
65     unsigned int j;  in mult()  local
68     for (j = 0;j <= i;++j) u += a[j] * b[i - j];  in mult()
69     for (j = i + 1;j < 32;++j) u += 38 * a[j] * b[i + 32 - j];  in mult()
77   unsigned int j;  in mult121665()  local
81   for (j = 0;j < 31;++j) { u += 121665 * a[j]; out[j] = u & 255; u >>= 8; }  in mult121665()
84   for (j = 0;j < 31;++j) { u += out[j]; out[j] = u & 255; u >>= 8; }  in mult121665()
85   u += out[j]; out[j] = u;  in mult121665()
91   unsigned int j;  in square()  local
96     for (j = 0;j < i - j;++j) u += a[j] * a[i - j];  in square()
97     for (j = i + 1;j < i + 32 - j;++j)  in square()
98 	    if (i + 32 - j < 32 && j < 32)  in square()
99 		    u += 38 * a[j] * a[i + 32 - j];  in square()
112   unsigned int j;  in smc_select()  local
117   for (j = 0;j < 64;++j) {  in smc_select()
118     t = bminus1 & (r[j] ^ s[j]);  in smc_select()
119     p[j] = s[j] ^ t;  in smc_select()
120     q[j] = r[j] ^ t;  in smc_select()
141   unsigned int j;  in mainloop()  local
145   for (j = 0;j < 32;++j) xzm1[j] = work[j];  in mainloop()
147   for (j = 33;j < 64;++j) xzm1[j] = 0;  in mainloop()
150   for (j = 1;j < 64;++j) xzm[j] = 0;  in mainloop()
177   for (j = 0;j < 64;++j) work[j] = xzm[j];  in mainloop()