Searched refs:curlen (Results 1 – 1 of 1) sorted by relevance
590 curlen = nextlen; nextlen = tree[n+1].Len; in scan_tree()594 s->bl_tree[curlen].Freq += count; in scan_tree()595 } else if (curlen != 0) { in scan_tree()596 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()603 count = 0; prevlen = curlen; in scan_tree()606 } else if (curlen == nextlen) { in scan_tree()636 curlen = nextlen; nextlen = tree[n+1].Len; in send_tree()642 } else if (curlen != 0) { in send_tree()643 if (curlen != prevlen) { in send_tree()655 count = 0; prevlen = curlen; in send_tree()[all …]
Completed in 5 milliseconds