Lines Matching refs:curlen

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
769         curlen = nextlen; nextlen = tree[n+1].Len;
770         if (++count < max_count && curlen == nextlen) {
773             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
775         } else if (curlen != 0) {
776             if (curlen != prevlen) {
777                 send_code(s, curlen, s->bl_tree); count--;
788         count = 0; prevlen = curlen;
791         } else if (curlen == nextlen) {