Lines Matching refs:Nodes

290         Nodes(1, Node) {}
292   size_t numBlocks() const { return Nodes.size(); }
296   bool isEntry() const { return Nodes[0]->Index == 0; }
299     for (NodeT *Node : Nodes) {
330     Nodes = std::move(MergedBlocks);
334     Id = Nodes[0]->Index;
336     for (size_t Idx = 0; Idx < Nodes.size(); Idx++) {
337       Nodes[Idx]->CurChain = this;
338       Nodes[Idx]->CurIndex = Idx;
345     Nodes.clear();
346     Nodes.shrink_to_fit();
360   // Nodes of the chain.
361   std::vector<NodeT *> Nodes;
816             SrcChain->Nodes.back()->Index == SrcBB &&
817             DstChain->Nodes.front()->Index == DstBB &&
826   double extTSPScore(const MergedNodesT &Nodes,
829     Nodes.forEach([&](const NodeT *Node) {
869       if (Offset == 0 || Offset == ChainPred->Nodes.size())
872       NodeT *Node = ChainPred->Nodes[Offset - 1];
888     for (JumpT *Jump : ChainSucc->Nodes.front()->InJumps) {
897     for (JumpT *Jump : ChainSucc->Nodes.back()->OutJumps) {
906     if (ChainPred->Nodes.size() <= ChainSplitThreshold) {
907       for (size_t Offset = 1; Offset < ChainPred->Nodes.size(); Offset++) {
911         const NodeT *BB = ChainPred->Nodes[Offset - 1];
912         const NodeT *BB2 = ChainPred->Nodes[Offset];
935         mergeNodes(ChainPred->Nodes, ChainSucc->Nodes, MergeOffset, MergeType);
956         mergeNodes(Into->Nodes, From->Nodes, MergeOffset, MergeType);
966       MergedNodes = MergedNodesT(Into->Nodes.begin(), Into->Nodes.end());
984       if (!Chain.Nodes.empty())
1004       for (NodeT *Node : Chain->Nodes)
1259         mergeNodes(ChainPred->Nodes, ChainSucc->Nodes, MergeOffset, MergeType);
1302   double distBasedLocalityGain(const MergedNodesT &Nodes,
1305     Nodes.forEach([&](const NodeT *Node) {
1329         mergeNodes(Into->Nodes, From->Nodes, MergeOffset, MergeType);
1343       if (!Chain.Nodes.empty()) {
1348         for (NodeT *Node : Chain.Nodes) {
1371       for (NodeT *Node : Chain->Nodes)