| /macosx-10.9.5/zlib-53/zlib/contrib/puff/ |
| H A D | Makefile | 5 puff zeros.raw
|
| /macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/ |
| H A D | sha512.c | 225 unsigned char zeros[128 + 16]; local
229 *zeros = 0x80;
230 memset (zeros + 1, 0, sizeof(zeros) - 1);
231 zeros[dstart+15] = (m->sz[0] >> 0) & 0xff;
232 zeros[dstart+14] = (m->sz[0] >> 8) & 0xff;
233 zeros[dstart+13] = (m->sz[0] >> 16) & 0xff;
234 zeros[dstart+12] = (m->sz[0] >> 24) & 0xff;
235 zeros[dstart+11] = (m->sz[0] >> 32) & 0xff;
236 zeros[dstar
[all...] |
| H A D | sha256.c | 203 unsigned char zeros[72]; local
207 *zeros = 0x80;
208 memset (zeros + 1, 0, sizeof(zeros) - 1);
209 zeros[dstart+7] = (m->sz[0] >> 0) & 0xff;
210 zeros[dstart+6] = (m->sz[0] >> 8) & 0xff;
211 zeros[dstart+5] = (m->sz[0] >> 16) & 0xff;
212 zeros[dstart+4] = (m->sz[0] >> 24) & 0xff;
213 zeros[dstart+3] = (m->sz[1] >> 0) & 0xff;
214 zeros[dstar
[all...] |
| H A D | md4.c | 211 unsigned char zeros[72]; local
215 *zeros = 0x80;
216 memset (zeros + 1, 0, sizeof(zeros) - 1);
217 zeros[dstart+0] = (m->sz[0] >> 0) & 0xff;
218 zeros[dstart+1] = (m->sz[0] >> 8) & 0xff;
219 zeros[dstart+2] = (m->sz[0] >> 16) & 0xff;
220 zeros[dstart+3] = (m->sz[0] >> 24) & 0xff;
221 zeros[dstart+4] = (m->sz[1] >> 0) & 0xff;
222 zeros[dstar
[all...] |
| H A D | sha.c | 261 unsigned char zeros[72]; local
265 *zeros = 0x80;
266 memset (zeros + 1, 0, sizeof(zeros) - 1);
267 zeros[dstart+7] = (m->sz[0] >> 0) & 0xff;
268 zeros[dstart+6] = (m->sz[0] >> 8) & 0xff;
269 zeros[dstart+5] = (m->sz[0] >> 16) & 0xff;
270 zeros[dstart+4] = (m->sz[0] >> 24) & 0xff;
271 zeros[dstart+3] = (m->sz[1] >> 0) & 0xff;
272 zeros[dstar
[all...] |
| H A D | md5.c | 235 unsigned char zeros[72]; local
239 *zeros = 0x80;
240 memset (zeros + 1, 0, sizeof(zeros) - 1);
241 zeros[dstart+0] = (m->sz[0] >> 0) & 0xff;
242 zeros[dstart+1] = (m->sz[0] >> 8) & 0xff;
243 zeros[dstart+2] = (m->sz[0] >> 16) & 0xff;
244 zeros[dstart+3] = (m->sz[0] >> 24) & 0xff;
245 zeros[dstart+4] = (m->sz[1] >> 0) & 0xff;
246 zeros[dstar
[all...] |
| /macosx-10.9.5/eap8021x-180/EAP8021X.fproj/ |
| H A D | fips186prf.c | 97 uint8_t zeros[64]; local
127 memset(zeros, 0, sizeof(zeros));
128 memcpy(zeros, xval.p, 20);
129 fr_SHA1Transform(&context, zeros);
142 memset(zeros, 0, sizeof(zeros));
143 memcpy(zeros, xval.p, 20);
144 fr_SHA1Transform(&context, zeros);
|
| /macosx-10.9.5/passwordserver_sasl-170/cyrus_sasl/mac/libdes/src/ |
| H A D | md4.c | 229 /*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska H�gskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* H�gskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
RCSID("$Id: md4.c,v 1.4 2005/01/10 19:09:06 snsimon Exp $");
#endif
#include <stdlib.h>
#include <string.h>
#include "md4.h"
#ifndef min
#define min(a,b) (((a)>(b))?(b):(a))
#endif
#define A m->counter[0]
#define B m->counter[1]
#define C m->counter[2]
#define D m->counter[3]
#define X data
void
md4_init (struct md4 *m)
{
m->offset = 0;
m->sz = 0;
D = 0x10325476;
C = 0x98badcfe;
B = 0xefcdab89;
A = 0x67452301;
}
static inline u_int32_t
cshift (u_int32_t x, unsigned int n)
{
return (x << n) | (x >> (32 - n));
}
#define F(x,y,z) ((x & y) | (~x & z))
#define G(x,y,z) ((x & y) | (x & z) | (y & z))
#define H(x,y,z) (x ^ y ^ z)
#define DOIT(a,b,c,d,k,s,i,OP) \
a = cshift(a + OP(b,c,d) + X[k] + i, s)
#define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
#define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
#define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
static inline void
calc (struct md4 *m, u_int32_t *data)
{
u_int32_t AA, BB, CC, DD;
AA = A;
BB = B;
CC = C;
DD = D;
/* Round 1 */
DO1(A,B,C,D,0,3,0);
DO1(D,A,B,C,1,7,0);
DO1(C,D,A,B,2,11,0);
DO1(B,C,D,A,3,19,0);
DO1(A,B,C,D,4,3,0);
DO1(D,A,B,C,5,7,0);
DO1(C,D,A,B,6,11,0);
DO1(B,C,D,A,7,19,0);
DO1(A,B,C,D,8,3,0);
DO1(D,A,B,C,9,7,0);
DO1(C,D,A,B,10,11,0);
DO1(B,C,D,A,11,19,0);
DO1(A,B,C,D,12,3,0);
DO1(D,A,B,C,13,7,0);
DO1(C,D,A,B,14,11,0);
DO1(B,C,D,A,15,19,0);
/* Round 2 */
DO2(A,B,C,D,0,3,0x5A827999);
DO2(D,A,B,C,4,5,0x5A827999);
DO2(C,D,A,B,8,9,0x5A827999);
DO2(B,C,D,A,12,13,0x5A827999);
DO2(A,B,C,D,1,3,0x5A827999);
DO2(D,A,B,C,5,5,0x5A827999);
DO2(C,D,A,B,9,9,0x5A827999);
DO2(B,C,D,A,13,13,0x5A827999);
DO2(A,B,C,D,2,3,0x5A827999);
DO2(D,A,B,C,6,5,0x5A827999);
DO2(C,D,A,B,10,9,0x5A827999);
DO2(B,C,D,A,14,13,0x5A827999);
DO2(A,B,C,D,3,3,0x5A827999);
DO2(D,A,B,C,7,5,0x5A827999);
DO2(C,D,A,B,11,9,0x5A827999);
DO2(B,C,D,A,15,13,0x5A827999);
/* Round 3 */
DO3(A,B,C,D,0,3,0x6ED9EBA1);
DO3(D,A,B,C,8,9,0x6ED9EBA1);
DO3(C,D,A,B,4,11,0x6ED9EBA1);
DO3(B,C,D,A,12,15,0x6ED9EBA1);
DO3(A,B,C,D,2,3,0x6ED9EBA1);
DO3(D,A,B,C,10,9,0x6ED9EBA1);
DO3(C,D,A,B,6,11,0x6ED9EBA1);
DO3(B,C,D,A,14,15,0x6ED9EBA1);
DO3(A,B,C,D,1,3,0x6ED9EBA1);
DO3(D,A,B,C,9,9,0x6ED9EBA1);
DO3(C,D,A,B,5,11,0x6ED9EBA1);
DO3(B,C,D,A,13,15,0x6ED9EBA1);
DO3(A,B,C,D,3,3,0x6ED9EBA1);
DO3(D,A,B,C,11,9,0x6ED9EBA1);
DO3(C,D,A,B,7,11,0x6ED9EBA1);
DO3(B,C,D,A,15,15,0x6ED9EBA1);
A += AA;
B += BB;
C += CC;
D += DD;
}
/*
* From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
*/
static inline u_int32_t
swap_u_int32_t (u_int32_t t)
{
#if defined(WORDS_BIGENDIAN)
#define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
u_int32_t temp1, temp2;
temp1 = ROL(t,16);
temp2 = temp1 >> 8;
temp1 &= 0x00ff00ff;
temp2 &= 0x00ff00ff;
temp1 <<= 8;
return temp1 | temp2;
#else
return t;
#endif
}
struct x32{
unsigned int a:32;
unsigned int b:32;
};
void
md4_update (struct md4 *m, const void *v, size_t len)
{
const unsigned char *p = v;
m->sz += len;
while(len > 0){
size_t l = min(len, 64 - m->offset);
memcpy(m->save + m->offset, p, l);
m->offset += l;
p += l;
len -= l;
if(m->offset == 64){
#if defined(WORDS_BIGENDIAN)
int i;
u_int32_t current[16];
struct x32 *u = (struct x32*)m->save;
for(i = 0; i < 8; i++){
current[2*i+0] = swap_u_int32_t(u[i].a);
current[2*i+1] = swap_u_int32_t(u[i].b);
}
calc(m, current);
#else
calc(m, (u_int32_t*)m->save);
#endif
m->offset = 0;
}
}
}
void
md4_finito (struct md4 *m, void *res)
{
static unsigned char zeros[72];
u_int32_t len;
unsigned int dstart = (120 - m->offset - 1) % 64 + 1;
*zeros = 0x80;
memset (zeros + 1, 0, sizeof(zeros) - 1);
len = 8 * m->sz;
zeros[dstart+0] = (len >> 0) & 0xff;
zeros[dstart+1] = (len >> 8) & 0xff;
zeros[dstart+2] = (len >> 16) & 0xff;
zeros[dstart+3] = (len >> 24) & 0xff;
md4_update (m, zeros, dstart + 8);
{
int i;
unsigned char *r = (unsigned char *)res;
for (i = 0; i (…)
1 /* local
|
| H A D | sha.c | 277 /*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska H�gskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* H�gskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
RCSID("$Id: sha.c,v 1.4 2005/01/10 19:09:08 snsimon Exp $");
#endif
#include <stdlib.h>
#include <string.h>
#include "sha.h"
#ifndef min
#define min(a,b) (((a)>(b))?(b):(a))
#endif
#define A m->counter[0]
#define B m->counter[1]
#define C m->counter[2]
#define D m->counter[3]
#define E m->counter[4]
#define X data
void
sha_init (struct sha *m)
{
m->offset = 0;
m->sz = 0;
A = 0x67452301;
B = 0xefcdab89;
C = 0x98badcfe;
D = 0x10325476;
E = 0xc3d2e1f0;
}
static inline u_int32_t
cshift (u_int32_t x, unsigned int n)
{
return (x << n) | (x >> (32 - n));
}
#define F0(x,y,z) ((x & y) | (~x & z))
#define F1(x,y,z) (x ^ y ^ z)
#define F2(x,y,z) ((x & y) | (x & z) | (y & z))
#define F3(x,y,z) F1(x,y,z)
#define K0 0x5a827999
#define K1 0x6ed9eba1
#define K2 0x8f1bbcdc
#define K3 0xca62c1d6
#define DO(t,f,k) \
do { \
u_int32_t temp; \
\
temp = cshift(AA, 5) + f(BB,CC,DD) + EE + data[t] + k; \
EE = DD; \
DD = CC; \
CC = cshift(BB, 30); \
BB = AA; \
AA = temp; \
} while(0)
static inline void
calc (struct sha *m, u_int32_t *in)
{
u_int32_t AA, BB, CC, DD, EE;
u_int32_t data[80];
int i;
AA = A;
BB = B;
CC = C;
DD = D;
EE = E;
for (i = 0; i < 16; ++i)
data[i] = in[i];
for (i = 16; i < 80; ++i)
data[i] = cshift(data[i-3] ^ data[i-8] ^ data[i-14] ^ data[i-16], 1);
/* t=[0,19] */
DO(0,F0,K0);
DO(1,F0,K0);
DO(2,F0,K0);
DO(3,F0,K0);
DO(4,F0,K0);
DO(5,F0,K0);
DO(6,F0,K0);
DO(7,F0,K0);
DO(8,F0,K0);
DO(9,F0,K0);
DO(10,F0,K0);
DO(11,F0,K0);
DO(12,F0,K0);
DO(13,F0,K0);
DO(14,F0,K0);
DO(15,F0,K0);
DO(16,F0,K0);
DO(17,F0,K0);
DO(18,F0,K0);
DO(19,F0,K0);
/* t=[20,39] */
DO(20,F1,K1);
DO(21,F1,K1);
DO(22,F1,K1);
DO(23,F1,K1);
DO(24,F1,K1);
DO(25,F1,K1);
DO(26,F1,K1);
DO(27,F1,K1);
DO(28,F1,K1);
DO(29,F1,K1);
DO(30,F1,K1);
DO(31,F1,K1);
DO(32,F1,K1);
DO(33,F1,K1);
DO(34,F1,K1);
DO(35,F1,K1);
DO(36,F1,K1);
DO(37,F1,K1);
DO(38,F1,K1);
DO(39,F1,K1);
/* t=[40,59] */
DO(40,F2,K2);
DO(41,F2,K2);
DO(42,F2,K2);
DO(43,F2,K2);
DO(44,F2,K2);
DO(45,F2,K2);
DO(46,F2,K2);
DO(47,F2,K2);
DO(48,F2,K2);
DO(49,F2,K2);
DO(50,F2,K2);
DO(51,F2,K2);
DO(52,F2,K2);
DO(53,F2,K2);
DO(54,F2,K2);
DO(55,F2,K2);
DO(56,F2,K2);
DO(57,F2,K2);
DO(58,F2,K2);
DO(59,F2,K2);
/* t=[60,79] */
DO(60,F3,K3);
DO(61,F3,K3);
DO(62,F3,K3);
DO(63,F3,K3);
DO(64,F3,K3);
DO(65,F3,K3);
DO(66,F3,K3);
DO(67,F3,K3);
DO(68,F3,K3);
DO(69,F3,K3);
DO(70,F3,K3);
DO(71,F3,K3);
DO(72,F3,K3);
DO(73,F3,K3);
DO(74,F3,K3);
DO(75,F3,K3);
DO(76,F3,K3);
DO(77,F3,K3);
DO(78,F3,K3);
DO(79,F3,K3);
A += AA;
B += BB;
C += CC;
D += DD;
E += EE;
}
/*
* From `Performance analysis of SHA' by Joseph D. Touch <touch@isi.edu>
*/
static inline u_int32_t
swap_u_int32_t (u_int32_t t)
{
#if !defined(WORDS_BIGENDIAN)
#define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
u_int32_t temp1, temp2;
temp1 = ROL(t,16);
temp2 = temp1 >> 8;
temp1 &= 0x00ff00ff;
temp2 &= 0x00ff00ff;
temp1 <<= 8;
return temp1 | temp2;
#else
return t;
#endif
}
struct x32{
unsigned int a:32;
unsigned int b:32;
};
void
sha_update (struct sha *m, const void *v, size_t len)
{
const unsigned char *p = v;
m->sz += len;
while(len > 0){
size_t l = min(len, 64 - m->offset);
memcpy(m->save + m->offset, p, l);
m->offset += l;
p += l;
len -= l;
if(m->offset == 64){
#if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
int i;
u_int32_t current[16];
struct x32 *u = (struct x32*)m->save;
for(i = 0; i < 8; i++){
current[2*i+0] = swap_u_int32_t(u[i].a);
current[2*i+1] = swap_u_int32_t(u[i].b);
}
calc(m, current);
#else
calc(m, (u_int32_t*)m->save);
#endif
m->offset = 0;
}
}
}
void
sha_finito (struct sha *m, void *res)
{
static unsigned char zeros[72];
u_int32_t len;
unsigned int dstart = (120 - m->offset - 1) % 64 + 1;
*zeros = 0x80;
memset (zeros + 1, 0, sizeof(zeros) - 1);
len = 8 * m->sz;
zeros[dstart+7] = (len >> 0) & 0xff;
zeros[dstart+6] = (len >> 8) & 0xff;
zeros[dstart+5] = (len >> 16) & 0xff;
zeros[dstart+4] = (len >> 24) & 0xff;
sha_update (m, zeros, dstart + 8);
{
int i;
unsigned char *r = (unsigned char*)res;
for (i = 0; i (…)
1 /* local
|
| H A D | md5.c | 253 /*
* Copyright (c) 1995, 1996, 1997, 1998 Kungliga Tekniska H�gskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Kungliga Tekniska
* H�gskolan and its contributors.
*
* 4. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
RCSID("$Id: md5.c,v 1.4 2005/01/10 19:09:06 snsimon Exp $");
#endif
#include <stdlib.h>
#include <string.h>
#include "md5.h"
#ifndef min
#define min(a,b) (((a)>(b))?(b):(a))
#endif
#define A m->counter[0]
#define B m->counter[1]
#define C m->counter[2]
#define D m->counter[3]
#define X data
void
md5_init (struct md5 *m)
{
m->offset = 0;
m->sz = 0;
D = 0x10325476;
C = 0x98badcfe;
B = 0xefcdab89;
A = 0x67452301;
}
static inline u_int32_t
cshift (u_int32_t x, unsigned int n)
{
return (x << n) | (x >> (32 - n));
}
#define F(x,y,z) ((x & y) | (~x & z))
#define G(x,y,z) ((x & z) | (y & ~z))
#define H(x,y,z) (x ^ y ^ z)
#define I(x,y,z) (y ^ (x | ~z))
#define DOIT(a,b,c,d,k,s,i,OP) \
a = b + cshift(a + OP(b,c,d) + X[k] + (i), s)
#define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
#define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
#define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
#define DO4(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,I)
static inline void
calc (struct md5 *m, u_int32_t *data)
{
u_int32_t AA, BB, CC, DD;
AA = A;
BB = B;
CC = C;
DD = D;
/* Round 1 */
DO1(A,B,C,D,0,7,0xd76aa478);
DO1(D,A,B,C,1,12,0xe8c7b756);
DO1(C,D,A,B,2,17,0x242070db);
DO1(B,C,D,A,3,22,0xc1bdceee);
DO1(A,B,C,D,4,7,0xf57c0faf);
DO1(D,A,B,C,5,12,0x4787c62a);
DO1(C,D,A,B,6,17,0xa8304613);
DO1(B,C,D,A,7,22,0xfd469501);
DO1(A,B,C,D,8,7,0x698098d8);
DO1(D,A,B,C,9,12,0x8b44f7af);
DO1(C,D,A,B,10,17,0xffff5bb1);
DO1(B,C,D,A,11,22,0x895cd7be);
DO1(A,B,C,D,12,7,0x6b901122);
DO1(D,A,B,C,13,12,0xfd987193);
DO1(C,D,A,B,14,17,0xa679438e);
DO1(B,C,D,A,15,22,0x49b40821);
/* Round 2 */
DO2(A,B,C,D,1,5,0xf61e2562);
DO2(D,A,B,C,6,9,0xc040b340);
DO2(C,D,A,B,11,14,0x265e5a51);
DO2(B,C,D,A,0,20,0xe9b6c7aa);
DO2(A,B,C,D,5,5,0xd62f105d);
DO2(D,A,B,C,10,9,0x2441453);
DO2(C,D,A,B,15,14,0xd8a1e681);
DO2(B,C,D,A,4,20,0xe7d3fbc8);
DO2(A,B,C,D,9,5,0x21e1cde6);
DO2(D,A,B,C,14,9,0xc33707d6);
DO2(C,D,A,B,3,14,0xf4d50d87);
DO2(B,C,D,A,8,20,0x455a14ed);
DO2(A,B,C,D,13,5,0xa9e3e905);
DO2(D,A,B,C,2,9,0xfcefa3f8);
DO2(C,D,A,B,7,14,0x676f02d9);
DO2(B,C,D,A,12,20,0x8d2a4c8a);
/* Round 3 */
DO3(A,B,C,D,5,4,0xfffa3942);
DO3(D,A,B,C,8,11,0x8771f681);
DO3(C,D,A,B,11,16,0x6d9d6122);
DO3(B,C,D,A,14,23,0xfde5380c);
DO3(A,B,C,D,1,4,0xa4beea44);
DO3(D,A,B,C,4,11,0x4bdecfa9);
DO3(C,D,A,B,7,16,0xf6bb4b60);
DO3(B,C,D,A,10,23,0xbebfbc70);
DO3(A,B,C,D,13,4,0x289b7ec6);
DO3(D,A,B,C,0,11,0xeaa127fa);
DO3(C,D,A,B,3,16,0xd4ef3085);
DO3(B,C,D,A,6,23,0x4881d05);
DO3(A,B,C,D,9,4,0xd9d4d039);
DO3(D,A,B,C,12,11,0xe6db99e5);
DO3(C,D,A,B,15,16,0x1fa27cf8);
DO3(B,C,D,A,2,23,0xc4ac5665);
/* Round 4 */
DO4(A,B,C,D,0,6,0xf4292244);
DO4(D,A,B,C,7,10,0x432aff97);
DO4(C,D,A,B,14,15,0xab9423a7);
DO4(B,C,D,A,5,21,0xfc93a039);
DO4(A,B,C,D,12,6,0x655b59c3);
DO4(D,A,B,C,3,10,0x8f0ccc92);
DO4(C,D,A,B,10,15,0xffeff47d);
DO4(B,C,D,A,1,21,0x85845dd1);
DO4(A,B,C,D,8,6,0x6fa87e4f);
DO4(D,A,B,C,15,10,0xfe2ce6e0);
DO4(C,D,A,B,6,15,0xa3014314);
DO4(B,C,D,A,13,21,0x4e0811a1);
DO4(A,B,C,D,4,6,0xf7537e82);
DO4(D,A,B,C,11,10,0xbd3af235);
DO4(C,D,A,B,2,15,0x2ad7d2bb);
DO4(B,C,D,A,9,21,0xeb86d391);
A += AA;
B += BB;
C += CC;
D += DD;
}
/*
* From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
*/
static inline u_int32_t
swap_u_int32_t (u_int32_t t)
{
#if defined(WORDS_BIGENDIAN)
#define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
u_int32_t temp1, temp2;
temp1 = ROL(t,16);
temp2 = temp1 >> 8;
temp1 &= 0x00ff00ff;
temp2 &= 0x00ff00ff;
temp1 <<= 8;
return temp1 | temp2;
#else
return t;
#endif
}
struct x32{
unsigned int a:32;
unsigned int b:32;
};
void
md5_update (struct md5 *m, const void *v, size_t len)
{
const unsigned char *p = v;
m->sz += len;
while(len > 0){
size_t l = min(len, 64 - m->offset);
memcpy(m->save + m->offset, p, l);
m->offset += l;
p += l;
len -= l;
if(m->offset == 64){
#if defined(WORDS_BIGENDIAN)
int i;
u_int32_t current[16];
struct x32 *u = (struct x32*)m->save;
for(i = 0; i < 8; i++){
current[2*i+0] = swap_u_int32_t(u[i].a);
current[2*i+1] = swap_u_int32_t(u[i].b);
}
calc(m, current);
#else
calc(m, (u_int32_t*)m->save);
#endif
m->offset = 0;
}
}
}
void
md5_finito (struct md5 *m, void *res)
{
static unsigned char zeros[72];
u_int32_t len;
unsigned int dstart = (120 - m->offset - 1) % 64 + 1;
*zeros = 0x80;
memset (zeros + 1, 0, sizeof(zeros) - 1);
len = 8 * m->sz;
zeros[dstart+0] = (len >> 0) & 0xff;
zeros[dstart+1] = (len >> 8) & 0xff;
zeros[dstart+2] = (len >> 16) & 0xff;
zeros[dstart+3] = (len >> 24) & 0xff;
md5_update (m, zeros, dstart + 8);
{
int i;
unsigned char *r = (unsigned char *)res;
for (i = 0; i (…)
1 /* local
|
| /macosx-10.9.5/Heimdal-323.92.1/lib/gssapi/mech/ |
| H A D | gss_cb.c | 139 static uint8_t zeros[16] = { 0 }; local
144 && memcmp(p, zeros, sizeof(zeros)) != 0) {
|
| /macosx-10.9.5/cxxfilt-11/cxxfilt/opcodes/ |
| H A D | or32-dis.c | 152 unsigned long ones, zeros; local
158 zeros = or32_extract ('0', encoding, insn);
162 printf ("zeros: %x \n", zeros);
172 if ((~insn & zeros) != zeros)
|
| /macosx-10.9.5/tcl-102/tcl_ext/tktable/tktable/generic/ |
| H A D | tkTableCellSort.c | 143 int diff, zeros; local
151 * strings. If one number has more leading zeros than
152 * the other, the number with more leading zeros sorts
156 zeros = 0;
159 zeros--;
163 zeros++;
166 secondaryDiff = zeros;
|
| /macosx-10.9.5/bind9-45.100/bind9/contrib/idn/idnkit-1.0-src/util/ |
| H A D | SparseMap.pm | 287 my @zeros;
289 $zeros[$maxlv] = $self->create_dmap();
291 my $r = $zeros[$lv + 1];
292 $zeros[$lv] = $self->create_imap($lv, $r);
294 _fill_default_rec($self->{MAP}, 0, $maxlv, \@zeros);
298 my ($r, $lv, $maxlv, $zeros) = @_;
303 _fill_default_rec($r->[$i], $lv + 1, $maxlv, $zeros);
305 $r->[$i] = $zeros->[$lv + 1];
|
| /macosx-10.9.5/emacs-92/emacs/src/ |
| H A D | unexconvex.c | 496 char zeros[128];
504 bzero (zeros, sizeof zeros);
519 So write zeros for it. */
521 write (new, zeros, nwrite);
494 char zeros[128]; local
|
| H A D | unexaix.c | 449 char zeros[UnexBlockSz];
461 So write zeros for it. */
464 memset (zeros, 0, nwrite);
465 write (new, zeros, nwrite);
447 char zeros[UnexBlockSz]; local
|
| /macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/math/ |
| H A D | polynomials.tcl | 320 set zeros {}
322 lappend zeros 0.0
325 set new_coeffs [lrange $zeros 1 end]
336 set term_coeffs [concat [lrange $zeros 0 [expr {$idx-1}]] \
338 [lrange $zeros [expr {$idx+1}] end]]
|
| /macosx-10.9.5/xnu-2422.115.4/bsd/dev/random/ |
| H A D | randomdev.c | 156 static char zeros[(512 - kBSize * 8) / 8]; variable
253 // add zeros to fill the internal SHA-1 buffer
254 FIPS_SHA1Update (&sha1_ctx, (const u_int8_t *)zeros, sizeof (zeros));
389 memset (zeros, 0, sizeof (zeros));
|
| /macosx-10.9.5/Heimdal-323.92.1/appl/kx/ |
| H A D | common.c | 506 u_char zeros[6] = {0, 0, 0, 0, 0, 0}; local
549 if (net_write (sock, zeros, 6) != 6)
676 u_char zeros[6] = {0, 0, 0, 0, 0, 0}; local
726 if (npad && net_write (xserver, zeros, npad) != npad) {
736 if (dpad && net_write (xserver, zeros, dpad) != dpad)
739 if(net_write(xserver, zeros, 6) != 6)
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
| H A D | PathProfileVerifier.cpp | 186 int zeros = 0; local
192 fwrite(&zeros, 1, 4-(num&3), edgeFile);
|
| /macosx-10.9.5/ncurses-42/ncurses/form/ |
| H A D | fld_def.c | 279 static const FIELD_CELL zeros = ZEROS; local
331 buffer[j] = zeros;
|
| /macosx-10.9.5/tcl-102/tcl_ext/tcllib/tcllib/examples/math/ |
| H A D | bigfloat.demo.tcl | 118 set x [fromstr $::bignum $::zeros]
122 set ::zeros 0
160 label $c.labelZero -text "append zeros"
162 set ::zeros 0
163 entry $c.zeros -textvariable ::zeros -width 4
164 pack $c.zeros -in $c -side left
|
| /macosx-10.9.5/Heimdal-323.92.1/lib/gssapi/netlogon/ |
| H A D | crypto.c | 38 static uint8_t zeros[4]; variable
199 CCHmac(kCCHmacAlgMD5, key, 16, zeros, sizeof(zeros), tmpData);
356 CCDigestUpdate(md5, zeros, sizeof(zeros));
|
| /macosx-10.9.5/IOFireWireFamily-455.4.0/IOFireWireFamily.kmodproj/ |
| H A D | IOLocalConfigDirectory.cpp | 499 UInt64 zeros = 0; local
512 // append zeros for header
513 value->appendBytes( &zeros, headerLength );
518 // append zeros to pad to nearest quadlet
519 value->appendBytes( &zeros, paddingLength );
|
| /macosx-10.9.5/tcl-102/tcl_ext/mk4tcl/metakit/src/ |
| H A D | handler.cpp | 24 static char zeros[8]; local
27 d4_assert(n <= sizeof zeros);
29 buf_ = c4_Bytes(zeros, n);
|