Lines Matching defs:NODE
399 } Node;
407 #define NODE(n, l) (nodes[(n) + 1][(l) + MIN_DELTA])
427 Node nodes[17][NUM_NODES];
456 // initialize source node.
459 NODE(n, m).cost = 0;
460 NODE(n, m).error = max_error;
461 NODE(n, m).ctx = ctx0;
481 Node* const cur = &NODE(n, m);
490 if (level >= 2048 || level < 0) { // node is dead?
504 const Node* const prev = &NODE(n - 1, p);
510 if (prev->cost >= MAX_COST) { // dead node?
517 // Examine node assuming it's a non-terminal one.
530 // Now, record best terminal node (and thus best entry in the graph).
554 // Note: best-prev on terminal node is not necessarily equal to the
558 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal
562 const Node* const node = &NODE(n, best_node);
564 out[n] = node->sign ? -node->level : node->level;
565 nz |= (node->level != 0);
567 best_node = node->prev;
572 #undef NODE
