Searched refs:tree_avail (Results 1 – 2 of 2) sorted by relevance
121 int tree_avail; member2490 hf->tree_avail = 1 << (tbl_bits - HTBL_BITS + 4); in lzh_huffman_init()2491 hf->tree = malloc(hf->tree_avail * sizeof(hf->tree[0])); in lzh_huffman_init()2665 if (hf->tree_used > hf->tree_avail) in lzh_make_huffman_table()2680 if (hf->tree_used > hf->tree_avail) in lzh_make_huffman_table()2691 if (hf->tree_used > hf->tree_avail) in lzh_make_huffman_table()
124 int tree_avail; member3146 hf->tree_avail = 1 << (tbl_bits - HTBL_BITS + 4); in lzx_huffman_init()3147 hf->tree = malloc(hf->tree_avail * sizeof(hf->tree[0])); in lzx_huffman_init()3265 if (hf->tree_used > hf->tree_avail) in lzx_make_huffman_table()3280 if (hf->tree_used > hf->tree_avail) in lzx_make_huffman_table()3291 if (hf->tree_used > hf->tree_avail) in lzx_make_huffman_table()