Lines Matching defs:End
222 for (Function::iterator I = F.begin(); I != F.end(); I++)
247 for (Function::iterator I = F.begin(); I != F.end(); ) {
270 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
285 II = Successors.begin(), IE = Successors.end(); II != IE; ++II)
317 for (Function::iterator I = std::next(F.begin()), E = F.end(); I != E;) {
353 for (Function::iterator I = std::next(F.begin()), E = F.end(); I != E;) {
356 // If this block doesn't end with an uncond branch, ignore it.
549 if (MaybeBase == RelocateIdxMap.end())
1887 EndIt = OriginalUses.end();
2028 for (CommitPt It = Actions.begin(), EndIt = Actions.end(); It != EndIt;
2375 if (It != PromotedInsts.end() && It->second.IsSExt == IsSExt)
3110 if (std::find(MatchedAddrModeInsts.begin(), MatchedAddrModeInsts.end(),
3111 I) == MatchedAddrModeInsts.end())
3120 } // end anonymous namespace
3316 // we'd end up sinking both muls.
3389 // we'd end up sinking both muls.
3746 // Be conservative. We don't want this xform to end up introducing
3841 BasicBlock *NextBlock = StartBlock->splitBasicBlock(SplitPt, "select.end");
3864 CurInstIterator = StartBlock->end();
3967 /// \brief The instruction that represents the current end of the transition.
3968 /// Since we are faking the promotion until we reach the end of the chain
3969 /// of computation, we need a way to get the current end of the transition.
4081 unsigned End = getTransitionType()->getVectorNumElements();
4083 return ConstantVector::getSplat(End, Val);
4087 for (unsigned Idx = 0; Idx != End; ++Idx) {
4198 } // End of anonymous namespace.
4405 while (CurInstIterator != BB.end()) {
4422 for (BasicBlock::iterator BI = BB.begin(), BE = BB.end(); BI != BE;) {
4463 for (Function::iterator I = F.begin(), E = F.end(); I != E; ) {
4466 // Does this BB end with the following?
4577 // Does this BB end with the following?
