Lines Matching refs:curlen
2907 int curlen; /* length of current code */
2917 curlen = nextlen; nextlen = tree[n+1].Len;
2918 if (++count < max_count && curlen == nextlen) {
2921 s->bl_tree[curlen].Freq += count;
2922 } else if (curlen != 0) {
2923 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2930 count = 0; prevlen = curlen;
2933 } else if (curlen == nextlen) {
2954 int curlen; /* length of current code */
2964 curlen = nextlen; nextlen = tree[n+1].Len;
2965 if (++count < max_count && curlen == nextlen) {
2968 do { send_code(s, curlen, s->bl_tree); }
2971 } else if (curlen != 0) {
2972 if (curlen != prevlen) {
2973 send_code(s, curlen, s->bl_tree); count--;
2987 count = 0; prevlen = curlen;
2990 } else if (curlen == nextlen) {