Lines Matching defs:node
36 /* Linear constraints imposed. For each node there there is a
257 unsigned node = bi_get_node(ins->dest[d]);
259 if (node >= node_count)
265 * offsets, but the affinity is for the whole node, we
275 l->affinity[node] &= affinity;
294 lcra_add_node_interference(l, node,
301 lcra_add_node_interference(l, node, bi_writemask(ins, 1),
310 unsigned node = bi_get_node(ins->src[s]);
312 if (node < node_count)
313 l->affinity[node] &= EVEN_BITS_MASK;
385 unsigned node = bi_get_node(ins->src[0]);
386 assert(node < node_count);
387 l->solutions[node] = 0;
390 node = bi_get_node(ins->src[4]);
391 if (node < node_count)
392 l->solutions[node] = 4;
395 node = bi_get_node(ins->dest[0]);
397 assert(node < node_count);
398 l->solutions[node] = 48;
406 unsigned node = bi_get_node(ins->dest[0]);
407 assert(node < node_count);
408 l->solutions[node] = 60;
417 unsigned node = bi_get_node(ins->src[0]);
418 assert(node < node_count);
419 l->solutions[node] = 60;
433 unsigned node = bi_get_node(I->dest[0]);
434 assert(node < node_count);
436 if (l->solutions[node] != ~0) continue;
438 uint64_t affinity = l->affinity[node];
448 l->solutions[node] = reg;
450 if (!lcra_test_linear(l, l->solutions, node))
451 l->solutions[node] = ~0;
537 /* If register allocation fails, find the best spill node */
542 /* Pick a node satisfying bi_spill_register's preconditions */
547 unsigned node = bi_get_node(ins->dest[d]);
549 if (node >= l->node_count)
562 BITSET_SET(no_spill, node);
575 /* Only spill nodes that interfere with the node failing
592 /* Only spill nodes that interfere with the node failing
659 /* Once we've chosen a spill node, spill it and returns bytes spilled */
889 unreachable("Failed to choose spill node\n");