Lines Matching defs:node
32 * The basic idea of graph coloring is to make a node in a graph for
37 * During the "simplify" process, any any node with fewer edges than
39 * register regardless of what its neighbors choose, so that node is
50 * limitations, like registers that need to be allocated to a node in
59 * the base registers. Each node has a register class it needs to be
63 * basic graph coloring test of "fewer edges from this node than there
64 * are registers" with "For this node of class B, the sum of q(B,C)
65 * for each neighbor node of class C is less than pB".
69 * coloring a node is constant with the number of registers. We do
555 struct ra_node* node = g->nodes + i;
556 util_dynarray_init(&node->adjacency_list, g);
557 node->q_total = 0;
558 node->forced_reg = NO_REG;
559 node->reg = NO_REG;
668 * to ensure that we always choose the node with the highest node index.
712 * we optimistically choose a node and push it on the stack. We heuristically
713 * push the node with the lowest total q value, since it has the fewest
838 /* If our adjacent node is in the stack, it's not allocated yet. */
860 /* Populate with the set of regs that are in the node's class. */
914 * ra_get_best_spill_node() considers this node later.
960 * optimistically colorable node. The likelihood that we will succeed
995 * Forces a node to a specific register. This can be used to avoid
996 * creating a register class containing one node when handling data
1035 * Returns a node number to be spilled according to the cost/benefit using
1045 /* Consider any nodes that we colored successfully or the node we failed to
1046 * color for spilling. When we failed to color a node in ra_select(), we