Lines Matching refs:curlen

718     int curlen;                /* length of current code */  local
728         curlen = nextlen; nextlen = tree[n+1].Len;
729         if (++count < max_count && curlen == nextlen) {
732             s->bl_tree[curlen].Freq += count;
733         } else if (curlen != 0) {
734             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
741         count = 0; prevlen = curlen;
744         } else if (curlen == nextlen) {
763     int curlen;                /* length of current code */  local
773         curlen = nextlen; nextlen = tree[n+1].Len;
774         if (++count < max_count && curlen == nextlen) {
777             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
779         } else if (curlen != 0) {
780             if (curlen != prevlen) {
781                 send_code(s, curlen, s->bl_tree); count--;
792         count = 0; prevlen = curlen;
795         } else if (curlen == nextlen) {