Lines Matching defs:NODE
518 // Trellis node
520 int8_t prev; // best previous node
523 } Node;
537 #define NODE(n, l) (nodes[(n)][(l) + MIN_DELTA])
558 Node nodes[16][NUM_NODES];
589 // initialize source node.
618 Node* const cur = &NODE(n, m);
628 if (level > MAX_LEVEL || level < 0) { // node is dead?
654 // Examine node assuming it's a non-terminal one.
662 // Store best finding in current node.
668 // Now, record best terminal node (and thus best entry in the graph).
674 best_path[1] = m; // best node index
690 // Note: best-prev on terminal node is not necessarily equal to the
695 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
698 const Node* const node = &NODE(n, best_node);
700 out[n] = node->sign ? -node->level : node->level;
701 nz |= node->level;
703 best_node = node->prev;
709 #undef NODE
