HomeSort by relevance Sort by last modified time
    Searched defs:curlen (Results 1 - 9 of 9) sorted by null

  /external/wpa_supplicant_8/src/crypto/
sha256_i.h 16 u32 state[8], curlen; member in struct:sha256_state
  /external/elfutils/0.153/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/linux-tools-perf/perf-3.12.0/arch/ia64/lib/
memcpy_mck.S 271 #define curlen r24 define
296 and curlen=15,in2 // copy length after iteration
318 cmp.le p6,p7=8,curlen; // have at least 8 byte remaining?
393 (p6) add curlen=-8,curlen // update length
398 mov in2=curlen // remaining length
  /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...]
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_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/qemu/distrib/zlib-1.2.8/
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/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/icu/source/common/
uloc_tag.c 482 int32_t len, curlen; local
485 curlen = (int32_t)uprv_strlen(cur->key);
487 if (len == 1 && curlen == 1) {
499 } else if (curlen == 1) {
    [all...]
  /external/icu/icu4c/source/common/
uloc_tag.c 545 int32_t len, curlen; local
548 curlen = (int32_t)uprv_strlen(cur->key);
550 if (len == 1 && curlen == 1) {
562 } else if (curlen == 1) {
    [all...]

Completed in 199 milliseconds