55   for (SizeT i = 0; i < InEdges.size(); ++i) {  in replaceInEdge()
56     if (InEdges[i] == Old) {  in replaceInEdge()
57       InEdges[i] = New;  in replaceInEdge()
97     Succ->InEdges.push_back(this);  in computePredecessors()
102   InEdges.clear();  in computeSuccessors()
304       NewNode->InEdges.push_back(Pred);  in splitIncomingEdge()
313   for (CfgNode *&I : InEdges) {  in splitIncomingEdge()
475   for (CfgNode *Pred : InEdges) {  in advancedPhiLowering()
901   if (InEdges.empty())  in contractIfEmpty()
930     for (CfgNode *Pred : InEdges) {  in contractIfEmpty()
934           Successor->InEdges.push_back(Pred);  in contractIfEmpty()
947     Successor->InEdges.erase(  in contractIfEmpty()
948         std::find(Successor->InEdges.begin(), Successor->InEdges.end(), this));  in contractIfEmpty()
950   InEdges.clear();  in contractIfEmpty()
1397   if (Func->isVerbose(IceV_Preds) && !InEdges.empty()) {  in dump()
1400     for (CfgNode *I : InEdges) {  in dump()
1495   InEdges.erase(std::find(InEdges.begin(), InEdges.end(), In));  in removeInEdge()