313   for (unsigned i = 0, e = Edges.size(); i != e; ++i)  in FindLoopHeaders()  local
398     for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {  in ComputeValueKnownInPredecessors()  local
441       for (unsigned i = 0, e = LHSVals.size(); i != e; ++i)  in ComputeValueKnownInPredecessors()  local
448       for (unsigned i = 0, e = RHSVals.size(); i != e; ++i)  in ComputeValueKnownInPredecessors()  local
472       for (unsigned i = 0, e = Result.size(); i != e; ++i)  in ComputeValueKnownInPredecessors()  local
488       for (unsigned i = 0, e = LHSVals.size(); i != e; ++i) {  in ComputeValueKnownInPredecessors()  local
508       for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {  in ComputeValueKnownInPredecessors()  local
565         for (unsigned i = 0, e = LHSVals.size(); i != e; ++i) {  in ComputeValueKnownInPredecessors()  local
587       for (unsigned i = 0, e = Conds.size(); i != e; ++i) {  in ComputeValueKnownInPredecessors()  local
636   for (unsigned i = 1, e = BBTerm->getNumSuccessors(); i != e; ++i) {  in GetBestDestForJumpOnUndef()  local
726     for (unsigned i = 0, e = BBTerm->getNumSuccessors(); i != e; ++i) {  in ProcessBlock()  local
978     for (unsigned i = 0, e = AvailablePreds.size(); i != e; ++i)  in SimplifyPartiallyRedundantLoad()  local
1070   for (unsigned i = 0, e = PredToDestList.size(); i != e; ++i)  in FindMostPopularDest()  local
1103     for (unsigned i = 0; ; ++i) {  in FindMostPopularDest()  local
1151   for (unsigned i = 0, e = PredValues.size(); i != e; ++i) {  in ProcessThreadableEdges()  local
1201   for (unsigned i = 0, e = PredToDestList.size(); i != e; ++i)  in ProcessThreadableEdges()  local
1209       for (unsigned i = 0, e = PredTI->getNumSuccessors(); i != e; ++i)  in ProcessThreadableEdges()  local
1240   for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {  in ProcessBranchOnPHI()  local
1307   for (unsigned i = 0, e = XorOpValues.size(); i != e; ++i) {  in ProcessBranchOnXOR()  local
1327   for (unsigned i = 0, e = XorOpValues.size(); i != e; ++i) {  in ProcessBranchOnXOR()  local
1454     for (unsigned i = 0, e = New->getNumOperands(); i != e; ++i)  in ThreadEdge()  local
1514   for (unsigned i = 0, e = PredTerm->getNumSuccessors(); i != e; ++i)  in ThreadEdge()  local
1594     for (unsigned i = 0, e = New->getNumOperands(); i != e; ++i)  in DuplicateCondBranchOnPHIIntoPred()  local