259     std::vector<std::shared_ptr<ContextEdge>> CallerEdges;  member
310              (CalleeEdges.empty() && CallerEdges.empty()));  in isRemoved()
813   for (auto &Edge : CallerEdges) {  in addOrUpdateCallerEdge()
822   CallerEdges.push_back(Edge);  in addOrUpdateCallerEdge()
854   for (const auto &Edge : CallerEdges)  in findEdgeFromCaller()
875       CallerEdges, [Edge](const std::shared_ptr<ContextEdge> &CallerEdge) {  in eraseCallerEdge()
878   assert(EI != CallerEdges.end());  in eraseCallerEdge()
879   CallerEdges.erase(EI);  in eraseCallerEdge()
1023     for (const auto &Edge : Node->CallerEdges) {  in propagateDuplicateContextIds()
1058       TowardsCallee ? OrigNode->CalleeEdges : OrigNode->CallerEdges;  in connectNewNode()
1079       NewEdge->Callee->CallerEdges.push_back(NewEdge);  in connectNewNode()
1084       NewNode->CallerEdges.push_back(NewEdge);  in connectNewNode()
1094         EI = OrigNode->CallerEdges.erase(EI);  in connectNewNode()
1115   auto CallerEdges = Node->CallerEdges;  in assignStackNodesPostOrder()  local
1116   for (auto &Edge : CallerEdges) {  in assignStackNodesPostOrder()
1384         for (const auto &PE : CurNode->CallerEdges) {  in updateStackNodes()
1763     Callee->CallerEdges.push_back(NewEdge);  in calleesMatch()
2094   for (auto &Edge : CallerEdges)  in print()
2160   if (Node->CallerEdges.size()) {  in checkNode()
2161     auto EI = Node->CallerEdges.begin();  in checkNode()
2165     for (; EI != Node->CallerEdges.end(); EI++) {  in checkNode()
2196     for (auto &Edge : Node->CallerEdges)  in check()
2373     *CallerEdgeI = OldCallee->CallerEdges.erase(*CallerEdgeI);  in moveEdgeToExistingCalleeClone()
2377   NewCallee->CallerEdges.push_back(Edge);  in moveEdgeToExistingCalleeClone()
2416     NewEdge->Callee->CallerEdges.push_back(NewEdge);  in moveEdgeToExistingCalleeClone()
2472     auto CallerEdges = Node->CallerEdges;  in identifyClones()  local
2473     for (auto &Edge : CallerEdges) {  in identifyClones()
2476         assert(!llvm::count(Node->CallerEdges, Edge));  in identifyClones()
2487   if (hasSingleAllocType(Node->AllocTypes) || Node->CallerEdges.size() <= 1)  in identifyClones()
2507   std::stable_sort(Node->CallerEdges.begin(), Node->CallerEdges.end(),  in identifyClones()
2528   for (auto EI = Node->CallerEdges.begin(); EI != Node->CallerEdges.end();) {  in identifyClones()
2533     if (hasSingleAllocType(Node->AllocTypes) || Node->CallerEdges.size() <= 1)  in identifyClones()
2586     assert(EI == Node->CallerEdges.end() ||  in identifyClones()
2591         Clone->CallerEdges, [&](const std::shared_ptr<ContextEdge> &E) {  in identifyClones()
2616   assert(llvm::none_of(Node->CallerEdges,  in identifyClones()
2847                 Clone->CallerEdges, [&](const std::shared_ptr<ContextEdge> &E) {  in assignFunctions()
2856             for (auto &CE : Clone->CallerEdges) {  in assignFunctions()
2872               Clone->CallerEdges, [&](const std::shared_ptr<ContextEdge> &E) {  in assignFunctions()
2876           if (EI != Clone->CallerEdges.end()) {  in assignFunctions()
2902             for (auto &CE : Clone->CallerEdges) {  in assignFunctions()
2915           for (auto CE : Clone->CallerEdges) {  in assignFunctions()
3004         for (auto EI = Clone->CallerEdges.begin();  in assignFunctions()
3005              EI != Clone->CallerEdges.end();) {  in assignFunctions()
3067                 assert(EI == Clone->CallerEdges.end() ||  in assignFunctions()
3132         for (const auto &CE : Node->CallerEdges)  in assignFunctions()
3138           for (const auto &CE : Clone->CallerEdges)  in assignFunctions()
3155     for (auto &Edge : Node->CallerEdges)  in assignFunctions()