Lines Matching refs:nodes
228 struct TrellisNode *nodes;
852 td->nodes[trellis_node + q].prev_node = -1;
853 td->nodes[trellis_node + q].quant = q;
920 td->nodes[trellis_node + max_quant + 1].quant = overquant;
929 bits = td->nodes[prev].bits + slice_bits[q];
934 if (td->nodes[prev].score < SCORE_LIMIT && error < SCORE_LIMIT)
935 new_score = td->nodes[prev].score + error;
938 if (td->nodes[cur].prev_node == -1 ||
939 td->nodes[cur].score >= new_score) {
941 td->nodes[cur].bits = bits;
942 td->nodes[cur].score = new_score;
943 td->nodes[cur].prev_node = prev;
948 error = td->nodes[trellis_node + min_quant].score;
951 if (td->nodes[trellis_node + q].score <= error) {
952 error = td->nodes[trellis_node + q].score;
977 ctx->slice_q[x + y * ctx->slices_width] = td->nodes[q].quant;
978 q = td->nodes[q].prev_node;
1151 av_freep(&ctx->tdata[i].nodes);
1285 ctx->tdata[j].nodes = av_malloc_array(ctx->slices_width + 1,
1287 * sizeof(*ctx->tdata->nodes));
1288 if (!ctx->tdata[j].nodes)
1291 ctx->tdata[j].nodes[i].prev_node = -1;
1292 ctx->tdata[j].nodes[i].bits = 0;
1293 ctx->tdata[j].nodes[i].score = 0;