/external/llvm/lib/Transforms/Utils/ |
FlattenCFG.cpp | 30 bool FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder, Pass *P = 0); 31 /// \brief If \param BB is the merge block of an if-region, attempt to merge 34 bool MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder, Pass *P = 0); 45 bool run(BasicBlock *BB); 49 /// If \param [in] BB has more than one predecessor that is a conditional 86 /// Case 1: \param BB is on the else-path. 94 /// \ | / BB4 corresponds to \param BB which is also the merge. 95 /// BB => BB4 103 /// Case 2: \param BB BB is on the then-path [all...] |
BasicBlockUtils.cpp | 36 void llvm::DeleteDeadBlock(BasicBlock *BB) { 37 assert((pred_begin(BB) == pred_end(BB) || 39 BB->getSinglePredecessor() == BB) && "Block is not dead!"); 40 TerminatorInst *BBTerm = BB->getTerminator(); 45 BBTerm->getSuccessor(i)->removePredecessor(BB); 48 while (!BB->empty()) { 49 Instruction &I = BB->back(); 57 BB->getInstList().pop_back() [all...] |
MetaRenamer.cpp | 124 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { 125 BB->setName("bb"); 127 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
|
CloneFunction.cpp | 37 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB, 41 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F); 42 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix); 47 for (BasicBlock::const_iterator II = BB->begin(), IE = BB->end(); 68 BB != &BB->getParent()->getEntryBlock(); 118 const BasicBlock &BB = *BI; 121 BasicBlock *CBB = CloneBasicBlock(&BB, VMap, NameSuffix, NewFunc, CodeInfo) [all...] |
SimplifyCFG.cpp | 113 bool run(BasicBlock *BB); 239 /// If AggressiveInsts is non-null, and if V does not dominate BB, we check to 241 /// that do not dominate BB have a combined cost lower than CostRemaining and 251 static bool DominatesMergePoint(Value *V, BasicBlock *BB, 267 if (PBB == BB) return false; 270 // branch to BB, then it must be in the 'conditional' part of the "if 273 if (BI == 0 || BI->isConditional() || BI->getSuccessor(0) != BB) 299 if (!DominatesMergePoint(*i, BB, AggressiveInsts, CostRemaining)) 508 /// EliminateBlockCases - Given a vector of bb/value pairs, remove any entries 510 static void EliminateBlockCases(BasicBlock *BB, [all...] |
/external/llvm/tools/llvm-stress/ |
llvm-stress.cpp | 128 BB(Block),PT(PT),Ran(R),Context(BB->getContext()) {} 279 BasicBlock *BB; 289 LoadModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} 293 Value *V = new LoadInst(Ptr, "L", BB->getTerminator()); 299 StoreModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) {} 312 new StoreInst(Val, Ptr, BB->getTerminator()); 317 BinModifier(BasicBlock *BB, PieceTable *PT, Random *R):Modifier(BB, PT, R) { [all...] |
/external/llvm/lib/Transforms/Scalar/ |
TailRecursionElimination.cpp | 104 bool FoldReturnAndProcessPred(BasicBlock *BB, 143 BasicBlock *BB = AI->getParent(); 144 return BB == &BB->getParent()->getEntryBlock() && 192 for (Function::iterator BB = F.begin(), EE = F.end(); BB != EE; ++BB) { 193 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) { 211 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
SSAUpdaterImpl.h | 45 BlkT *BB; // Back-pointer to the corresponding block. 55 : BB(ThisBB), AvailableVal(V), DefBB(V ? this : 0), BlkNum(0), IDom(0), 75 /// BB and if so, return it. If not, construct SSA form by first 78 ValT GetValue(BlkT *BB) { 80 BBInfo *PseudoEntry = BuildBlockList(BB, &BlockList); 82 // Special case: bail out if BB is unreachable. 84 ValT V = Traits::GetUndefVal(BB, Updater); 85 (*AvailableVals)[BB] = V; 93 return BBMap[BB]->DefBB->AvailableVal; 100 BBInfo *BuildBlockList(BlkT *BB, BlockListTy *BlockList) [all...] |
/external/llvm/lib/Analysis/ |
LazyValueInfo.cpp | 348 BasicBlock *BB; 353 : Parent(P), Val(V), BB(B), BBLV(LV) { } 357 Parent->OverDefinedCache.insert(std::make_pair(BB, Val)); 364 LVILatticeVal getBlockValue(Value *Val, BasicBlock *BB); 367 bool hasBlockValue(Value *Val, BasicBlock *BB); 372 bool solveBlockValue(Value *Val, BasicBlock *BB); 374 Value *Val, BasicBlock *BB); 376 PHINode *PN, BasicBlock *BB); 378 Instruction *BBI, BasicBlock *BB); 389 LVILatticeVal getValueInBlock(Value *V, BasicBlock *BB); [all...] |
SparsePropagation.cpp | 90 void SparseSolver::MarkBlockExecutable(BasicBlock *BB) { 91 DEBUG(dbgs() << "Marking Block Executable: " << BB->getName() << "\n"); 92 BBExecutable.insert(BB); // Basic block is executable! 93 BBWorkList.push_back(BB); // Add the block to the work list! 96 /// markEdgeExecutable - Mark a basic block as executable, adding it to the BB 221 BasicBlock *BB = TI.getParent(); 226 markEdgeExecutable(BB, TI.getSuccessor(i)); 316 BasicBlock *BB = BBWorkList.back(); 319 DEBUG(dbgs() << "\nPopped off BBWL: " << *BB); 323 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I [all...] |
/dalvik/vm/mterp/x86/ |
OP_CMP_LONG.S | 11 movzbl 2(rPC),%ecx # ecx<- BB 14 GET_VREG_WORD %eax %ecx,1 # eax<- v[BB+1] 15 GET_VREG_WORD %ecx %ecx 0 # ecx<- v[BB+0]
|
OP_ADD_DOUBLE.S | 5 movzbl 2(rPC),%eax # eax<- BB
|
OP_MUL_DOUBLE.S | 5 movzbl 2(rPC),%eax # eax<- BB
|
OP_MUL_INT.S | 6 movzbl 2(rPC),%eax # eax<- BB
|
OP_MUL_INT_LIT8.S | 3 movzbl 2(rPC),%eax # eax<- BB
|
OP_SUB_DOUBLE.S | 5 movzbl 2(rPC),%eax # eax<- BB
|
binflop.S | 8 movzbl 3(rPC),%ecx # ecx<- BB
|
binop.S | 12 movzbl 2(rPC),%eax # eax<- BB
|
binop1.S | 7 movzbl 2(rPC),%eax # eax<- BB
|
/external/llvm/lib/Transforms/IPO/ |
LoopExtractor.cpp | 230 BasicBlock *BB = *PI; 231 if (BB->isLandingPad() && BB != Parent && 248 BasicBlock *BB = BlocksToNotExtract[i]; 249 Function *F = BB->getParent(); 257 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); 262 // There's no way to find BBs by name without looking at every BB inside 274 BasicBlock &BB = *BI; 275 if (BB.getName() != BlockName) continue; 289 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
R600ISelLowering.h | 28 MachineBasicBlock * BB) const; 41 void lowerImplicitParameter(MachineInstr *MI, MachineBasicBlock &BB,
|
/external/clang/test/Analysis/ |
dynamic-cast.cpp | 16 class BB: public B{}; 51 BB bb; local 52 B *pb = &bb; 66 BB bb; local 67 A *pbb = &bb; 69 BB *s = dynamic_cast<BB*>(b); 81 BB bb local [all...] |
/external/clang/test/SemaCXX/ |
conversion-delete-expr.cpp | 96 struct BB { 100 struct DD : BB {
|
/external/llvm/include/llvm/Analysis/ |
IntervalPartition.h | 78 inline Interval *getBlockInterval(BasicBlock *BB) { 79 IntervalMapTy::iterator I = IntervalMap.find(BB);
|
LazyValueInfo.h | 58 Constant *getConstant(Value *V, BasicBlock *BB); 69 void eraseBlock(BasicBlock *BB);
|