lib/zlib/trees.c

719     int curlen;                /* length of current code */
729         curlen = nextlen; nextlen = tree[n+1].Len;
730         if (++count < max_count && curlen == nextlen) {
733             s->bl_tree[curlen].Freq += count;
734         } else if (curlen != 0) {
735             if (curlen != prevlen) s->bl_tree[curlen].Freq++;
742         count = 0; prevlen = curlen;
745         } else if (curlen == nextlen) {
764     int curlen;                /* length of current code */
774         curlen = nextlen; nextlen = tree[n+1].Len;
775         if (++count < max_count && curlen == nextlen) {
778             do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
780         } else if (curlen != 0) {
781             if (curlen != prevlen) {
782                 send_code(s, curlen, s->bl_tree); count--;
793         count = 0; prevlen = curlen;
796         } else if (curlen == nextlen) {