Lines Matching defs:nodes
411 // BB invalidates all the PHI nodes since their sources are implicitly ordered
414 // TODO: Make it so that that is not the case, and PHI nodes store pointers to
438 // nodes after the graph has been modified.
801 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; }
832 RIG_Node *nodes;
877 if (!nodes[i].colors)
881 nodes[i].f,nodes[i].reg,nodes[i].colors,
882 nodes[i].weight,
883 nodes[i].degree, nodes[i].degreeLimit);
885 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next())
887 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next())
985 RIG_Node *nRep = &nodes[rep->id];
986 RIG_Node *nVal = &nodes[val->id];
1220 nodes(NULL),
1232 if (nodes)
1233 delete[] nodes;
1309 RIG_Node *const n = &nodes[i];
1310 if (!nodes[i].colors || nodes[i].livei.isEmpty())
1312 if (nodes[i].reg >= 0) {
1317 LValue *val = nodes[i].getValue();
1324 nodes[i].weight =
1325 (float)rc * (float)rc / (float)nodes[i].livei.extent();
1328 if (nodes[i].degree < nodes[i].degreeLimit) {
1332 DLLIST_ADDHEAD(&lo[l], &nodes[i]);
1334 DLLIST_ADDHEAD(&hi, &nodes[i]);
1474 RIG_Node *node = &nodes[stack.top()];
1519 LValue *lval = nodes[i].getValue();
1520 if (nodes[i].reg >= 0 && nodes[i].colors > 0)
1522 regs.unitsToId(nodes[i].f, nodes[i].reg, lval->reg.size);
1536 nodes = new RIG_Node[nodeCount];
1537 if (!nodes)
1542 nodes[i].init(regs, lval);
1543 RIG.insert(&nodes[i]);
1574 nodes[i].addRegPreference(getNode(insn->getSrc(2)->asLValue()));
1639 delete[] nodes;
1640 nodes = NULL;