Lines Matching refs:curlen
2905 int curlen; /* length of current code */ local
2915 curlen = nextlen; nextlen = tree[n+1].Len;
2916 if (++count < max_count && curlen == nextlen) {
2919 s->bl_tree[curlen].Freq += count;
2920 } else if (curlen != 0) {
2921 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2928 count = 0; prevlen = curlen;
2931 } else if (curlen == nextlen) {
2952 int curlen; /* length of current code */ local
2962 curlen = nextlen; nextlen = tree[n+1].Len;
2963 if (++count < max_count && curlen == nextlen) {
2966 do { send_code(s, curlen, s->bl_tree); }
2969 } else if (curlen != 0) {
2970 if (curlen != prevlen) {
2971 send_code(s, curlen, s->bl_tree); count--;
2985 count = 0; prevlen = curlen;
2988 } else if (curlen == nextlen) {