Lines Matching defs:CallerEdges

267     std::vector<std::shared_ptr<ContextEdge>> CallerEdges;
277       if (!CallerEdges.empty()) {
281         return &CallerEdges;
883   for (auto &Edge : CallerEdges) {
892   CallerEdges.push_back(Edge);
924   for (const auto &Edge : CallerEdges)
945       CallerEdges, [Edge](const std::shared_ptr<ContextEdge> &CallerEdge) {
948   assert(EI != CallerEdges.end());
949   CallerEdges.erase(EI);
1113     for (const auto &Edge : Node->CallerEdges) {
1142       TowardsCallee ? OrigNode->CalleeEdges : OrigNode->CallerEdges;
1163       NewEdge->Callee->CallerEdges.push_back(NewEdge);
1168       NewNode->CallerEdges.push_back(NewEdge);
1178         EI = OrigNode->CallerEdges.erase(EI);
1206   if (Node->CallerEdges.size()) {
1208         Node->CallerEdges.front()->ContextIds);
1209     for (const auto &Edge : llvm::drop_begin(Node->CallerEdges)) {
1244   auto CallerEdges = Node->CallerEdges;
1245   for (auto &Edge : CallerEdges) {
1526         for (const auto &PE : LastNode->CallerEdges) {
1911     Callee->CallerEdges.push_back(NewEdge);
2241   for (auto &Edge : CallerEdges)
2320     for (auto &Edge : Node->CallerEdges)
2514       *CallerEdgeI = OldCallee->CallerEdges.erase(*CallerEdgeI);
2530       NewCallee->CallerEdges.push_back(Edge);
2553       NewCallee->CallerEdges.push_back(NewEdge);
2590     NewEdge->Callee->CallerEdges.push_back(NewEdge);
2625   auto CallerEdges = Node->CallerEdges;
2626   for (auto &Edge : CallerEdges) {
2629       assert(!is_contained(Node->CallerEdges, Edge));
2681   // CallerEdges vector. Make a copy and iterate on that, simpler than passing
2686     auto CallerEdges = Node->CallerEdges;
2687     for (auto &Edge : CallerEdges) {
2690         assert(!llvm::count(Node->CallerEdges, Edge));
2701   if (hasSingleAllocType(Node->AllocTypes) || Node->CallerEdges.size() <= 1)
2709   // CallerEdges of the Node we will clone by alloc type.
2721   std::stable_sort(Node->CallerEdges.begin(), Node->CallerEdges.end(),
2748   // We need to be able to remove Edge from CallerEdges, so need to adjust
2750   for (auto EI = Node->CallerEdges.begin(); EI != Node->CallerEdges.end();) {
2755     if (hasSingleAllocType(Node->AllocTypes) || Node->CallerEdges.size() <= 1)
2820     assert(EI == Node->CallerEdges.end() ||
3058                 Clone->CallerEdges, [&](const std::shared_ptr<ContextEdge> &E) {
3067             for (auto &CE : Clone->CallerEdges) {
3083               Clone->CallerEdges, [&](const std::shared_ptr<ContextEdge> &E) {
3087           if (EI != Clone->CallerEdges.end()) {
3113             for (auto &CE : Clone->CallerEdges) {
3126           for (auto CE : Clone->CallerEdges) {
3213         // We need to be able to remove Edge from CallerEdges, so need to adjust
3215         for (auto EI = Clone->CallerEdges.begin();
3216              EI != Clone->CallerEdges.end();) {
3278                 assert(EI == Clone->CallerEdges.end() ||
3343         for (const auto &CE : Node->CallerEdges)
3349           for (const auto &CE : Clone->CallerEdges)
3366     for (auto &Edge : Node->CallerEdges)