Lines Matching refs:huff
114 static int tm2_read_tree(TM2Context *ctx, uint32_t prefix, int length, TM2Huff *huff)
117 if (length > huff->max_bits) {
119 huff->max_bits);
127 if (huff->num >= huff->max_num) {
131 huff->nums[huff->num] = get_bits_long(&ctx->gb, huff->val_bits);
132 huff->bits[huff->num] = prefix;
133 huff->lens[huff->num] = length;
134 huff->num++;
137 if ((ret = tm2_read_tree(ctx, prefix << 1, length + 1, huff)) < 0)
139 if ((ret = tm2_read_tree(ctx, (prefix << 1) | 1, length + 1, huff)) < 0)
147 TM2Huff huff;
150 huff.val_bits = get_bits(&ctx->gb, 5);
151 huff.max_bits = get_bits(&ctx->gb, 5);
152 huff.min_bits = get_bits(&ctx->gb, 5);
153 huff.nodes = get_bits_long(&ctx->gb, 17);
154 huff.num = 0;
157 if ((huff.val_bits < 1) || (huff.val_bits > 32) ||
158 (huff.max_bits < 0) || (huff.max_bits > 25)) {
160 "length: %i, max code length: %i\n", huff.val_bits, huff.max_bits);
163 if ((huff.nodes <= 0) || (huff.nodes > 0x10000)) {
165 "nodes: %i\n", huff.nodes);
169 if (huff.max_bits == 0)
170 huff.max_bits = 1;
173 huff.max_num = (huff.nodes + 1) >> 1;
174 huff.nums = av_calloc(huff.max_num, sizeof(int));
175 huff.bits = av_calloc(huff.max_num, sizeof(uint32_t));
176 huff.lens = av_calloc(huff.max_num, sizeof(int));
178 if (!huff.nums || !huff.bits || !huff.lens) {
183 res = tm2_read_tree(ctx, 0, 0, &huff);
185 if (huff.num != huff.max_num) {
187 huff.num, huff.max_num);
195 res = init_vlc(&code->vlc, huff.max_bits, huff.max_num,
196 huff.lens, sizeof(int), sizeof(int),
197 huff.bits, sizeof(uint32_t), sizeof(uint32_t), 0);
201 code->bits = huff.max_bits;
202 code->length = huff.max_num;
209 code->recode[i] = huff.nums[i];
214 av_free(huff.nums);
215 av_free(huff.bits);
216 av_free(huff.lens);