Lines Matching defs:CallerEdges

294     std::vector<std::shared_ptr<ContextEdge>> CallerEdges;
304       if (!CallerEdges.empty()) {
308         return &CallerEdges;
1043   for (auto &Edge : CallerEdges) {
1052   CallerEdges.push_back(Edge);
1080     *EI = Callee->CallerEdges.erase(*EI);
1100   for (auto EI = Node->CallerEdges.begin(); EI != Node->CallerEdges.end();) {
1105       EI = Node->CallerEdges.erase(EI);
1125   for (const auto &Edge : CallerEdges)
1146       CallerEdges, [Edge](const std::shared_ptr<ContextEdge> &CallerEdge) {
1149   assert(EI != CallerEdges.end());
1150   CallerEdges.erase(EI);
1310     for (const auto &Edge : Node->CallerEdges) {
1339       TowardsCallee ? OrigNode->CalleeEdges : OrigNode->CallerEdges;
1360       NewEdge->Callee->CallerEdges.push_back(NewEdge);
1365       NewNode->CallerEdges.push_back(NewEdge);
1397   if (Node->CallerEdges.size()) {
1399         Node->CallerEdges.front()->ContextIds);
1400     for (const auto &Edge : llvm::drop_begin(Node->CallerEdges)) {
1450   auto CallerEdges = Node->CallerEdges;
1451   for (auto &Edge : CallerEdges) {
1454       assert(!is_contained(Node->CallerEdges, Edge));
1795         for (const auto &PE : LastNode->CallerEdges) {
2425     Callee->CallerEdges.push_back(NewEdge);
2803   for (auto &Edge : CallerEdges)
2892     for (auto &Edge : Node->CallerEdges)
3097       NewCallee->CallerEdges.push_back(Edge);
3118       NewCallee->CallerEdges.push_back(NewEdge);
3155     NewEdge->Callee->CallerEdges.push_back(NewEdge);
3211   bool IsNewNode = NewCaller->CallerEdges.empty();
3213   for (auto &OldCallerEdge : OldCaller->CallerEdges) {
3237     NewCaller->CallerEdges.push_back(NewEdge);
3249     for (const auto &OldCallerEdge : OldCaller->CallerEdges)
3252     for (const auto &NewCallerEdge : NewCaller->CallerEdges)
3273   auto CallerEdges = Node->CallerEdges;
3274   for (auto &Edge : CallerEdges) {
3277       assert(!is_contained(Node->CallerEdges, Edge));
3329   // CallerEdges vector. Make a copy and iterate on that, simpler than passing
3334     auto CallerEdges = Node->CallerEdges;
3335     for (auto &Edge : CallerEdges) {
3338         assert(!is_contained(Node->CallerEdges, Edge));
3349   if (hasSingleAllocType(Node->AllocTypes) || Node->CallerEdges.size() <= 1)
3357   // CallerEdges of the Node we will clone by alloc type.
3369   std::stable_sort(Node->CallerEdges.begin(), Node->CallerEdges.end(),
3398     for (auto &CE : Node->CallerEdges) {
3414   auto CallerEdges = Node->CallerEdges;
3415   for (auto &CallerEdge : CallerEdges) {
3418     if (hasSingleAllocType(Node->AllocTypes) || Node->CallerEdges.size() <= 1)
3758                 Clone->CallerEdges, [&](const std::shared_ptr<ContextEdge> &E) {
3767             for (auto &CE : Clone->CallerEdges) {
3783               Clone->CallerEdges, [&](const std::shared_ptr<ContextEdge> &E) {
3787           if (EI != Clone->CallerEdges.end()) {
3813             for (auto &CE : Clone->CallerEdges) {
3829           auto CallerEdges = Clone->CallerEdges;
3830           for (auto CE : CallerEdges) {
3833               assert(!is_contained(Clone->CallerEdges, CE));
3940         auto CloneCallerEdges = Clone->CallerEdges;
4060         for (const auto &CE : Node->CallerEdges)
4066           for (const auto &CE : Clone->CallerEdges)
4086     for (auto &Edge : Node->CallerEdges)