97     bool FoldReturnAndProcessPred(BasicBlock *BB,
132 static bool CheckForEscapingAllocas(BasicBlock *BB,  in CheckForEscapingAllocas()  argument
135   for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)  in CheckForEscapingAllocas()
142       if (BB != &BB->getParent()->getEntryBlock() ||  in CheckForEscapingAllocas()
168   for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {  in runOnFunction()  local
173       CheckForEscapingAllocas(BB, CannotTCETailMarkedCall);  in runOnFunction()
184   for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {  in runOnFunction()  local
185     if (ReturnInst *Ret = dyn_cast<ReturnInst>(BB->getTerminator())) {  in runOnFunction()
188       if (!Change && BB->getFirstNonPHIOrDbg() == Ret)  in runOnFunction()
189         Change = FoldReturnAndProcessPred(BB, Ret, OldEntry,  in runOnFunction()
217     for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)  in runOnFunction()  local
218       for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)  in runOnFunction()
362   BasicBlock *BB = TI->getParent();  in FindTRECandidate()  local
363   Function *F = BB->getParent();  in FindTRECandidate()
365   if (&BB->front() == TI) // Make sure there is something before the terminator.  in FindTRECandidate()
377     if (BBI == BB->begin())  in FindTRECandidate()
391   if (BB == &F->getEntryBlock() &&   in FindTRECandidate()
392       FirstNonDbg(BB->front()) == CI &&  in FindTRECandidate()
393       FirstNonDbg(llvm::next(BB->begin())) == TI &&  in FindTRECandidate()
470   BasicBlock *BB = Ret->getParent();  in EliminateRecursiveTailCall()  local
471   Function *F = BB->getParent();  in EliminateRecursiveTailCall()
521     ArgumentPHIs[i]->addIncoming(CI->getArgOperand(i), BB);  in EliminateRecursiveTailCall()
554       AccPN->addIncoming(AccRecInstr, BB);  in EliminateRecursiveTailCall()
563       AccPN->addIncoming(Ret->getReturnValue(), BB);  in EliminateRecursiveTailCall()
580   BB->getInstList().erase(Ret);  // Remove return.  in EliminateRecursiveTailCall()
581   BB->getInstList().erase(CI);   // Remove call.  in EliminateRecursiveTailCall()
586 bool TailCallElim::FoldReturnAndProcessPred(BasicBlock *BB,  in FoldReturnAndProcessPred()  argument
598   for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {  in FoldReturnAndProcessPred()
610       DEBUG(dbgs() << "FOLDING: " << *BB  in FoldReturnAndProcessPred()
612       EliminateRecursiveTailCall(CI, FoldReturnIntoUncondBranch(Ret, BB, Pred),  in FoldReturnAndProcessPred()