Lines Matching refs:cur_code
121 unsigned short cur_code; in build_huffman_tree() local
304 cur_code = 0; in build_huffman_tree()
307 assert(!(cur_code & 1)); in build_huffman_tree()
308 cur_code >>= 1; in build_huffman_tree()
311 leaves[i].code = cur_code; in build_huffman_tree()
312 cur_code++; in build_huffman_tree()
319 cur_code = 0; in build_huffman_tree()
322 cur_code <<= 1; in build_huffman_tree()
325 leaves[i].code = cur_code; in build_huffman_tree()
326 cur_code++; in build_huffman_tree()
335 cur_code = leaves[i].code; in build_huffman_tree()
338 if (cur_code & 1) code[j] = '1'; in build_huffman_tree()
340 cur_code >>= 1; in build_huffman_tree()
945 int cur_code; in lzx_write_compressed_tree() local
1025 cur_code = *codep++; in lzx_write_compressed_tree()
1026 lzx_write_bits(lzxd, pretree[cur_code].codelength, pretree[cur_code].code); in lzx_write_compressed_tree()
1027 if (cur_code == 17) { in lzx_write_compressed_tree()
1031 else if (cur_code == 18) { in lzx_write_compressed_tree()
1035 else if (cur_code == 19) { in lzx_write_compressed_tree()
1038 cur_code = *codep++; in lzx_write_compressed_tree()
1039 lzx_write_bits(lzxd, pretree[cur_code].codelength, pretree[cur_code].code); in lzx_write_compressed_tree()