Home
last modified time | relevance | path

Searched refs:best_path (Results 1 – 1 of 1) sorted by relevance

/external/webp/src/enc/
Dquant.c428 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous in TrellisQuantizeBlock() local
537 best_path[0] = n; // best eob position in TrellisQuantizeBlock()
538 best_path[1] = m; // best level in TrellisQuantizeBlock()
539 best_path[2] = p; // best predecessor in TrellisQuantizeBlock()
549 if (best_path[0] == -1) { in TrellisQuantizeBlock()
556 n = best_path[0]; in TrellisQuantizeBlock()
557 best_node = best_path[1]; in TrellisQuantizeBlock()
558 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal in TrellisQuantizeBlock()