HomeSort by relevance Sort by last modified time
    Searched refs:curlen (Results 1 - 25 of 34) sorted by null

1 2

  /external/wpa_supplicant_8/src/crypto/
sha256-internal.c 126 md->curlen = 0;
150 if (md->curlen >= sizeof(md->buf))
154 if (md->curlen == 0 && inlen >= SHA256_BLOCK_SIZE) {
161 n = MIN(inlen, (SHA256_BLOCK_SIZE - md->curlen));
162 os_memcpy(md->buf + md->curlen, in, n);
163 md->curlen += n;
166 if (md->curlen == SHA256_BLOCK_SIZE) {
170 md->curlen = 0;
189 if (md->curlen >= sizeof(md->buf))
193 md->length += md->curlen * 8
    [all...]
sha256_i.h 16 u32 state[8], curlen; member in struct:sha256_state
  /external/dropbear/libtomcrypt/src/hashes/helper/
hash_memory_multi.c 35 unsigned long curlen; local
61 curlen = inlen;
64 if ((err = hash_descriptor[hash].process(md, curptr, curlen)) != CRYPT_OK) {
72 curlen = va_arg(args, unsigned long);
  /external/dropbear/libtomcrypt/src/mac/f9/
f9_memory_multi.c 42 unsigned long curlen; local
61 curlen = inlen;
64 if ((err = f9_process(f9, curptr, curlen)) != CRYPT_OK) {
72 curlen = va_arg(args, unsigned long);
  /external/dropbear/libtomcrypt/src/mac/hmac/
hmac_memory_multi.c 43 unsigned long curlen; local
62 curlen = inlen;
65 if ((err = hmac_process(hmac, curptr, curlen)) != CRYPT_OK) {
73 curlen = va_arg(args, unsigned long);
  /external/dropbear/libtomcrypt/src/mac/omac/
omac_memory_multi.c 42 unsigned long curlen; local
61 curlen = inlen;
64 if ((err = omac_process(omac, curptr, curlen)) != CRYPT_OK) {
72 curlen = va_arg(args, unsigned long);
  /external/dropbear/libtomcrypt/src/mac/pmac/
pmac_memory_multi.c 42 unsigned long curlen; local
60 curlen = inlen;
63 if ((err = pmac_process(pmac, curptr, curlen)) != CRYPT_OK) {
71 curlen = va_arg(args, unsigned long);
  /external/dropbear/libtomcrypt/src/mac/xcbc/
xcbc_memory_multi.c 42 unsigned long curlen; local
61 curlen = inlen;
64 if ((err = xcbc_process(xcbc, curptr, curlen)) != CRYPT_OK) {
72 curlen = va_arg(args, unsigned long);
  /external/dropbear/libtomcrypt/src/headers/
tomcrypt_hash.h 5 unsigned long curlen; member in struct:sha512_state
13 ulong32 state[8], curlen; member in struct:sha256_state
21 ulong32 state[5], curlen; member in struct:sha1_state
29 ulong32 state[4], curlen; member in struct:md5_state
37 ulong32 state[4], curlen; member in struct:md4_state
45 unsigned long curlen; member in struct:tiger_state
53 unsigned long curlen; member in struct:md2_state
61 ulong32 curlen, state[4]; member in struct:rmd128_state
69 ulong32 curlen, state[5]; member in struct:rmd160_state
77 ulong32 curlen, state[8] member in struct:rmd256_state
85 ulong32 curlen, state[10]; member in struct:rmd320_state
93 ulong32 curlen; member in struct:whirlpool_state
101 ulong32 curlen; member in struct:chc_state
    [all...]
  /external/dropbear/libtomcrypt/src/hashes/chc/
chc.c 120 md->chc.curlen = 0;
208 if (md->chc.curlen >= sizeof(md->chc.buf)) {
213 md->chc.length += md->chc.curlen * 8;
216 md->chc.buf[md->chc.curlen++] = (unsigned char)0x80;
222 if (md->chc.curlen > (unsigned long)(cipher_blocksize - 8)) {
223 while (md->chc.curlen < (unsigned long)cipher_blocksize) {
224 md->chc.buf[md->chc.curlen++] = (unsigned char)0;
227 md->chc.curlen = 0;
231 while (md->chc.curlen < (unsigned long)(cipher_blocksize - 8)) {
232 md->chc.buf[md->chc.curlen++] = (unsigned char)0
    [all...]
  /external/dropbear/libtomcrypt/src/hashes/
md2.c 109 md->md2.curlen = 0;
125 if (md-> md2 .curlen > sizeof(md-> md2 .buf)) {
129 n = MIN(inlen, (16 - md->md2.curlen));
130 XMEMCPY(md->md2.buf + md->md2.curlen, in, (size_t)n);
131 md->md2.curlen += n;
136 if (md->md2.curlen == 16) {
139 md->md2.curlen = 0;
158 if (md->md2.curlen >= sizeof(md->md2.buf)) {
164 k = 16 - md->md2.curlen;
165 for (i = md->md2.curlen; i < 16; i++)
    [all...]
md4.c 182 md->md4.curlen = 0;
208 if (md->md4.curlen >= sizeof(md->md4.buf)) {
213 md->md4.length += md->md4.curlen * 8;
216 md->md4.buf[md->md4.curlen++] = (unsigned char)0x80;
222 if (md->md4.curlen > 56) {
223 while (md->md4.curlen < 64) {
224 md->md4.buf[md->md4.curlen++] = (unsigned char)0;
227 md->md4.curlen = 0;
231 while (md->md4.curlen < 56) {
232 md->md4.buf[md->md4.curlen++] = (unsigned char)0
    [all...]
sha1.c 173 md->sha1.curlen = 0;
200 if (md->sha1.curlen >= sizeof(md->sha1.buf)) {
205 md->sha1.length += md->sha1.curlen * 8;
208 md->sha1.buf[md->sha1.curlen++] = (unsigned char)0x80;
214 if (md->sha1.curlen > 56) {
215 while (md->sha1.curlen < 64) {
216 md->sha1.buf[md->sha1.curlen++] = (unsigned char)0;
219 md->sha1.curlen = 0;
223 while (md->sha1.curlen < 56) {
224 md->sha1.buf[md->sha1.curlen++] = (unsigned char)0
    [all...]
md5.c 240 md->md5.curlen = 0;
267 if (md->md5.curlen >= sizeof(md->md5.buf)) {
273 md->md5.length += md->md5.curlen * 8;
276 md->md5.buf[md->md5.curlen++] = (unsigned char)0x80;
282 if (md->md5.curlen > 56) {
283 while (md->md5.curlen < 64) {
284 md->md5.buf[md->md5.curlen++] = (unsigned char)0;
287 md->md5.curlen = 0;
291 while (md->md5.curlen < 56) {
292 md->md5.buf[md->md5.curlen++] = (unsigned char)0
    [all...]
rmd128.c 279 md->rmd128.curlen = 0;
306 if (md->rmd128.curlen >= sizeof(md->rmd128.buf)) {
312 md->rmd128.length += md->rmd128.curlen * 8;
315 md->rmd128.buf[md->rmd128.curlen++] = (unsigned char)0x80;
321 if (md->rmd128.curlen > 56) {
322 while (md->rmd128.curlen < 64) {
323 md->rmd128.buf[md->rmd128.curlen++] = (unsigned char)0;
326 md->rmd128.curlen = 0;
330 while (md->rmd128.curlen < 56) {
331 md->rmd128.buf[md->rmd128.curlen++] = (unsigned char)0
    [all...]
rmd160.c 338 md->rmd160.curlen = 0;
365 if (md->rmd160.curlen >= sizeof(md->rmd160.buf)) {
371 md->rmd160.length += md->rmd160.curlen * 8;
374 md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0x80;
380 if (md->rmd160.curlen > 56) {
381 while (md->rmd160.curlen < 64) {
382 md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0;
385 md->rmd160.curlen = 0;
389 while (md->rmd160.curlen < 56) {
390 md->rmd160.buf[md->rmd160.curlen++] = (unsigned char)0
    [all...]
rmd256.c 292 md->rmd256.curlen = 0;
319 if (md->rmd256.curlen >= sizeof(md->rmd256.buf)) {
325 md->rmd256.length += md->rmd256.curlen * 8;
328 md->rmd256.buf[md->rmd256.curlen++] = (unsigned char)0x80;
334 if (md->rmd256.curlen > 56) {
335 while (md->rmd256.curlen < 64) {
336 md->rmd256.buf[md->rmd256.curlen++] = (unsigned char)0;
339 md->rmd256.curlen = 0;
343 while (md->rmd256.curlen < 56) {
344 md->rmd256.buf[md->rmd256.curlen++] = (unsigned char)0
    [all...]
  /external/dropbear/libtomcrypt/src/hashes/sha2/
sha512.c 178 md->sha512.curlen = 0;
213 if (md->sha512.curlen >= sizeof(md->sha512.buf)) {
218 md->sha512.length += md->sha512.curlen * CONST64(8);
221 md->sha512.buf[md->sha512.curlen++] = (unsigned char)0x80;
227 if (md->sha512.curlen > 112) {
228 while (md->sha512.curlen < 128) {
229 md->sha512.buf[md->sha512.curlen++] = (unsigned char)0;
232 md->sha512.curlen = 0;
239 while (md->sha512.curlen < 120) {
240 md->sha512.buf[md->sha512.curlen++] = (unsigned char)0
    [all...]
sha384.c 43 md->sha512.curlen = 0;
69 if (md->sha512.curlen >= sizeof(md->sha512.buf)) {
sha256.c 210 md->sha256.curlen = 0;
245 if (md->sha256.curlen >= sizeof(md->sha256.buf)) {
251 md->sha256.length += md->sha256.curlen * 8;
254 md->sha256.buf[md->sha256.curlen++] = (unsigned char)0x80;
260 if (md->sha256.curlen > 56) {
261 while (md->sha256.curlen < 64) {
262 md->sha256.buf[md->sha256.curlen++] = (unsigned char)0;
265 md->sha256.curlen = 0;
269 while (md->sha256.curlen < 56) {
270 md->sha256.buf[md->sha256.curlen++] = (unsigned char)0
    [all...]
  /external/dropbear/libtomcrypt/src/hashes/whirl/
whirl.c 157 if (md->whirlpool.curlen >= sizeof(md->whirlpool.buf)) {
162 md->whirlpool.length += md->whirlpool.curlen * 8;
165 md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0x80;
171 if (md->whirlpool.curlen > 32) {
172 while (md->whirlpool.curlen < 64) {
173 md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0;
176 md->whirlpool.curlen = 0;
180 while (md->whirlpool.curlen < 56) {
181 md->whirlpool.buf[md->whirlpool.curlen++] = (unsigned char)0;
  /external/elfutils/src/
strings.c 329 size_t curlen = *unprinted == NULL ? 0 : strlen (*unprinted); local
353 ++curlen;
357 if (curlen >= min_len)
385 curlen = 0;
394 if (curlen != 0)
395 *unprinted = xstrndup ((const char *) start, curlen);
411 size_t curlen = *unprinted == NULL ? 0 : strlen (*unprinted); local
418 ++curlen;
422 if (curlen >= min_len)
445 curlen = 0
    [all...]
  /external/qemu/distrib/zlib-1.2.3/
trees.c 714 int curlen; /* length of current code */ local
724 curlen = nextlen; nextlen = tree[n+1].Len;
725 if (++count < max_count && curlen == nextlen) {
728 s->bl_tree[curlen].Freq += count;
729 } else if (curlen != 0) {
730 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
737 count = 0; prevlen = curlen;
740 } else if (curlen == nextlen) {
759 int curlen; /* length of current code * local
    [all...]
  /external/zlib/src/
trees.c 712 int curlen; /* length of current code */ local
722 curlen = nextlen; nextlen = tree[n+1].Len;
723 if (++count < max_count && curlen == nextlen) {
726 s->bl_tree[curlen].Freq += count;
727 } else if (curlen != 0) {
728 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
735 count = 0; prevlen = curlen;
738 } else if (curlen == nextlen) {
757 int curlen; /* length of current code * local
    [all...]
  /external/chromium_org/third_party/zlib/
trees.c 718 int curlen; /* length of current code */ local
728 curlen = nextlen; nextlen = tree[n+1].Len;
729 if (++count < max_count && curlen == nextlen) {
732 s->bl_tree[curlen].Freq += count;
733 } else if (curlen != 0) {
734 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
741 count = 0; prevlen = curlen;
744 } else if (curlen == nextlen) {
763 int curlen; /* length of current code * local
    [all...]

Completed in 264 milliseconds

1 2