Lines Matching +refs:Tree +refs:insert
256 DenseMap<ValuePair, size_t> &Tree,
266 DenseMap<ValuePair, size_t> &Tree, ValuePair J);
585 AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(),
587 AllChosenPairs.insert(ChosenPairs.begin(), ChosenPairs.end());
825 Users.insert(J);
880 CandidatePairs.insert(ValuePair(I, J));
950 ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J)));
954 ConnectedPairs.insert(VPPair(P, ValuePair(*J, *I)));
966 ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J)));
989 ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J)));
1027 IsInPair.insert(C->first);
1028 IsInPair.insert(C->second);
1045 PairableInstUsers.insert(ValuePair(I, *U));
1072 PairableInstUserMap->insert(VPPair(Q, P));
1077 PairableInstUserMap->insert(VPPair(P, Q));
1100 Visited.insert(QTop);
1131 DenseMap<ValuePair, size_t> &Tree, ValuePair J) {
1132 // Each of these pairs is viewed as the root node of a Tree. The Tree
1134 // the pairs that compose the Tree and the maximum depth of the Tree.
1160 DenseMap<ValuePair, size_t>::iterator C = Tree.find(k->second);
1161 if (C == Tree.end()) {
1172 // Record the current pair as part of the Tree:
1173 Tree.insert(ValuePairWithDepth(QTop.first, MaxChildDepth));
1188 DenseMap<ValuePair, size_t> &Tree,
1196 PrunedTree.insert(QTop.first);
1203 DenseMap<ValuePair, size_t>::iterator C = Tree.find(K->second);
1204 if (C == Tree.end()) continue;
1206 // This child is in the Tree, now we need to make sure it is the
1220 // make sure that a child pair added to the Tree is not
1245 CurrentPairs.insert(C2->first);
1251 // selected for the Tree. If that is the case, ignore this child.
1264 CurrentPairs.insert(*T);
1281 CurrentPairs.insert(C2->first);
1296 CurrentPairs.insert(*C2);
1328 BestChildren.insert(ValuePairWithDepth(C->first, C->second));
1357 // near the Tree pruning for more details).
1368 ChosenPairSet.insert(*C);
1376 DenseMap<ValuePair, size_t> Tree;
1378 PairableInstUsers, ChosenPairs, Tree, *J);
1381 // depth is still the same in the unpruned Tree.
1382 size_t MaxDepth = Tree.lookup(*J);
1384 DEBUG(if (DebugPairSelection) dbgs() << "BBV: found Tree for pair {"
1386 MaxDepth << " and size " << Tree.size() << "\n");
1388 // At this point the Tree has been constructed, but, may contain
1397 PairableInstUsers, PairableInstUserMap, ChosenPairs, Tree,
1406 dbgs() << "BBV: found pruned Tree for pair {"
1456 ChosenPairs.insert(ValuePair(S->first, S->second));
1518 /* insert before */ FlipMemInputs ? J : I);
1878 // chain, now insert the scalar and we're done.
2158 LoadMoveSet.insert(ValuePair(L, I));
2210 LowPtrInsts.insert(LowPI);
2260 ChosenPairs.insert(*P);
2378 LoadMoveSet.insert(*A);