| /src/crypto/external/apache2/openssl/dist/crypto/des/ |
| ofb_enc.c | 28 register DES_LONG d0, d1, vv0, vv1, v0, v1, n = (numbits + 7) / 8; local
61 vv1 = ti[1];
65 d1 = (d1 ^ vv1) & mask1;
74 v1 = vv1;
77 v1 = ((vv0 >> (num - 32)) | (vv1 << (64 - num))) & 0xffffffffL;
87 v0 = v1 = d0 = d1 = ti[0] = ti[1] = vv0 = vv1 = 0;
|
| /src/crypto/external/apache2/openssl/lib/libdes/ |
| oofb_enc.c | 70 register DES_LONG d0,d1,vv0,vv1,v0,v1,n=(numbits+7)/8; local
106 vv1=ti[1];
110 d1=(d1^vv1)&mask1;
117 { v0=vv0; v1=vv1; }
121 v1=((vv0>>(num-32))|(vv1<<(64-num)))&0xffffffffL;
132 v0=v1=d0=d1=ti[0]=ti[1]=vv0=vv1=0;
|
| /src/crypto/external/bsd/openssl/dist/crypto/des/ |
| ofb_enc.c | 28 register DES_LONG d0, d1, vv0, vv1, v0, v1, n = (numbits + 7) / 8; local
61 vv1 = ti[1];
65 d1 = (d1 ^ vv1) & mask1;
74 v1 = vv1;
77 v1 = ((vv0 >> (num - 32)) | (vv1 << (64 - num))) & 0xffffffffL;
87 v0 = v1 = d0 = d1 = ti[0] = ti[1] = vv0 = vv1 = 0;
|
| /src/crypto/external/bsd/openssl/lib/libdes/ |
| oofb_enc.c | 70 register DES_LONG d0,d1,vv0,vv1,v0,v1,n=(numbits+7)/8; local
106 vv1=ti[1];
110 d1=(d1^vv1)&mask1;
117 { v0=vv0; v1=vv1; }
121 v1=((vv0>>(num-32))|(vv1<<(64-num)))&0xffffffffL;
132 v0=v1=d0=d1=ti[0]=ti[1]=vv0=vv1=0;
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/des/ |
| ofb_enc.c | 22 register DES_LONG d0, d1, vv0, vv1, v0, v1, n = (numbits + 7) / 8; local
55 vv1 = ti[1];
59 d1 = (d1 ^ vv1) & mask1;
68 v1 = vv1;
71 v1 = ((vv0 >> (num - 32)) | (vv1 << (64 - num))) & 0xffffffffL;
81 v0 = v1 = d0 = d1 = ti[0] = ti[1] = vv0 = vv1 = 0;
|
| /src/crypto/external/bsd/openssl.old/lib/libdes/ |
| oofb_enc.c | 70 register DES_LONG d0,d1,vv0,vv1,v0,v1,n=(numbits+7)/8; local
106 vv1=ti[1];
110 d1=(d1^vv1)&mask1;
117 { v0=vv0; v1=vv1; }
121 v1=((vv0>>(num-32))|(vv1<<(64-num)))&0xffffffffL;
132 v0=v1=d0=d1=ti[0]=ti[1]=vv0=vv1=0;
|
| /src/external/gpl3/gcc/dist/libgcc/ |
| libgcc2.c | 1909 UWtype vv1 = v2[BITINT_END (0, vn - 1)];
1918 if (uv1 >= vv1)
1923 Fortunately, the algorithm guarantees that uv1 <= vv1,
1924 because if uv1 > vv1, then even if v would have all
1925 bits in all words below vv1 set, the previous iteration
1927 v. With uv1 == vv1 and uv0 >= vv1 the double-word
1932 vv1 0x8000000000000000ULL
1936 > 0x8000000000000000ULL in uv1 and vv1 and uv0 >= uv1.
1940 rhat by vv1 once or twice because of that. Now, i
1880 UWtype vv1 = v2[BITINT_END (0, vn - 1)]; local
[all...] |
