Lines Matching refs:curlen
858 int curlen; /* length of current code */
868 curlen = nextlen; nextlen = tree[n+1].Len;
869 if (++count < max_count && curlen == nextlen) {
872 bl_tree[curlen].Freq += (ush)count;
873 } else if (curlen != 0) {
874 if (curlen != prevlen) bl_tree[curlen].Freq++;
881 count = 0; prevlen = curlen;
884 } else if (curlen == nextlen) {
902 int curlen; /* length of current code */
912 curlen = nextlen; nextlen = tree[n+1].Len;
913 if (++count < max_count && curlen == nextlen) {
916 do { send_code(curlen, bl_tree); } while (--count != 0);
918 } else if (curlen != 0) {
919 if (curlen != prevlen) {
920 send_code(curlen, bl_tree); count--;
931 count = 0; prevlen = curlen;
934 } else if (curlen == nextlen) {