HomeSort by relevance Sort by last modified time
    Searched refs:nextlen (Results 1 - 4 of 4) sorted by null

  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_trees.c 713 int nextlen = tree[0].Len; /* length of next code */ local
718 if (nextlen == 0) max_count = 138, min_count = 3;
722 curlen = nextlen; nextlen = tree[n+1].Len;
723 if (++count < max_count && curlen == nextlen) {
736 if (nextlen == 0) {
738 } else if (curlen == nextlen) {
758 int nextlen = tree[0].Len; /* length of next code */ local
764 if (nextlen == 0) max_count = 138, min_count = 3;
767 curlen = nextlen; nextlen = tree[n+1].Len
    [all...]
  /external/qemu/distrib/zlib-1.2.8/
trees.c 713 int nextlen = tree[0].Len; /* length of next code */ local
718 if (nextlen == 0) max_count = 138, min_count = 3;
722 curlen = nextlen; nextlen = tree[n+1].Len;
723 if (++count < max_count && curlen == nextlen) {
736 if (nextlen == 0) {
738 } else if (curlen == nextlen) {
758 int nextlen = tree[0].Len; /* length of next code */ local
764 if (nextlen == 0) max_count = 138, min_count = 3;
767 curlen = nextlen; nextlen = tree[n+1].Len
    [all...]
  /external/zlib/src/
trees.c 713 int nextlen = tree[0].Len; /* length of next code */ local
718 if (nextlen == 0) max_count = 138, min_count = 3;
722 curlen = nextlen; nextlen = tree[n+1].Len;
723 if (++count < max_count && curlen == nextlen) {
736 if (nextlen == 0) {
738 } else if (curlen == nextlen) {
758 int nextlen = tree[0].Len; /* length of next code */ local
764 if (nextlen == 0) max_count = 138, min_count = 3;
767 curlen = nextlen; nextlen = tree[n+1].Len
    [all...]
  /external/chromium_org/third_party/zlib/
trees.c 719 int nextlen = tree[0].Len; /* length of next code */ local
724 if (nextlen == 0) max_count = 138, min_count = 3;
728 curlen = nextlen; nextlen = tree[n+1].Len;
729 if (++count < max_count && curlen == nextlen) {
742 if (nextlen == 0) {
744 } else if (curlen == nextlen) {
764 int nextlen = tree[0].Len; /* length of next code */ local
770 if (nextlen == 0) max_count = 138, min_count = 3;
773 curlen = nextlen; nextlen = tree[n+1].Len
    [all...]

Completed in 441 milliseconds