Lines Matching defs:length
68 uint8_t length;
81 int current, length;
112 static int smacker_decode_tree(GetBitContext *gb, HuffContext *hc, int length)
114 if (length > SMKTREE_DECODE_MAX_RECURSION || length > 3 * SMKTREE_BITS) {
126 hc->entries[hc->current++] = (HuffEntry){ get_bits(gb, 8), length };
130 length++;
131 r = smacker_decode_tree(gb, hc, length);
134 return smacker_decode_tree(gb, hc, length);
143 static int smacker_decode_bigtree(GetBitContext *gb, DBCtx *ctx, int length)
145 // Larger length can cause segmentation faults due to too deep recursion.
146 if (length > SMKTREE_DECODE_BIG_MAX_RECURSION) {
151 if (ctx->current >= ctx->length) {
181 r = smacker_decode_bigtree(gb, ctx, length + 1);
186 r_new = smacker_decode_bigtree(gb, ctx, length + 1);
226 &h.entries[0].length, sizeof(*h.entries),
249 ctx.length = (size + 3) >> 2;
251 ctx.values = av_malloc_array(ctx.length + 3, sizeof(ctx.values[0]));
659 &h.entries[0].length, sizeof(*h.entries),