Lines Matching defs:curlen

713     int curlen;                /* length of current code */
723         curlen = nextlen; nextlen = tree[n + 1].Len;
724         if (++count < max_count && curlen == nextlen) {
727             s->bl_tree[curlen].Freq += (ush)count;
728         } else if (curlen != 0) {
729             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
736         count = 0; prevlen = curlen;
739         } else if (curlen == nextlen) {
754     int curlen;                /* length of current code */
764         curlen = nextlen; nextlen = tree[n + 1].Len;
765         if (++count < max_count && curlen == nextlen) {
768             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
770         } else if (curlen != 0) {
771             if (curlen != prevlen) {
772                 send_code(s, curlen, s->bl_tree); count--;
783         count = 0; prevlen = curlen;
786         } else if (curlen == nextlen) {