curlen            714 lib/zlib/trees.c     int curlen;                /* length of current code */
curlen            724 lib/zlib/trees.c         curlen = nextlen; nextlen = tree[n+1].Len;
curlen            725 lib/zlib/trees.c         if (++count < max_count && curlen == nextlen) {
curlen            728 lib/zlib/trees.c             s->bl_tree[curlen].Freq += count;
curlen            729 lib/zlib/trees.c         } else if (curlen != 0) {
curlen            730 lib/zlib/trees.c             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
curlen            737 lib/zlib/trees.c         count = 0; prevlen = curlen;
curlen            740 lib/zlib/trees.c         } else if (curlen == nextlen) {
curlen            759 lib/zlib/trees.c     int curlen;                /* length of current code */
curlen            769 lib/zlib/trees.c         curlen = nextlen; nextlen = tree[n+1].Len;
curlen            770 lib/zlib/trees.c         if (++count < max_count && curlen == nextlen) {
curlen            773 lib/zlib/trees.c             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
curlen            775 lib/zlib/trees.c         } else if (curlen != 0) {
curlen            776 lib/zlib/trees.c             if (curlen != prevlen) {
curlen            777 lib/zlib/trees.c                 send_code(s, curlen, s->bl_tree); count--;
curlen            788 lib/zlib/trees.c         count = 0; prevlen = curlen;
curlen            791 lib/zlib/trees.c         } else if (curlen == nextlen) {