Lines Matching refs:curlen

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
767         curlen = nextlen; nextlen = tree[n+1].Len;
768         if (++count < max_count && curlen == nextlen) {
771             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
773         } else if (curlen != 0) {
774             if (curlen != prevlen) {
775                 send_code(s, curlen, s->bl_tree); count--;
786         count = 0; prevlen = curlen;
789         } else if (curlen == nextlen) {