/external/llvm/lib/Transforms/Scalar/ |
H A D | Reg2Mem.cpp | 50 const BasicBlock *BB = Inst->getParent(); local 53 if (UI->getParent() != BB || isa<PHINode>(UI))
|
H A D | LoopIdiomRecognize.cpp | 79 static BranchInst *getBranch(BasicBlock *BB) { argument 80 return dyn_cast<BranchInst>(BB->getTerminator()); 146 bool runOnLoopBlock(BasicBlock *BB, const SCEV *BECount, 286 bool LIRUtil::isAlmostEmpty(BasicBlock *BB) { argument 287 if (BranchInst *Br = getBranch(BB)) { 288 return Br->isUnconditional() && BB->size() == 1; 294 if (BasicBlock *BB = PreHead->getSinglePredecessor()) { 295 BranchInst *Br = getBranch(BB); 296 return Br && Br->isConditional() ? BB : nullptr; 728 bool LoopIdiomRecognize::runOnLoopBlock(BasicBlock *BB, cons argument [all...] |
H A D | Scalarizer.cpp | 49 // insert them before BBI in BB. If Cache is nonnull, use it to cache 61 BasicBlock *BB; member in class:__anon26337::Scatterer 183 : BB(bb), BBI(bbi), V(v), CachePtr(cachePtr) { 203 IRBuilder<> Builder(BB, BBI); 247 BasicBlock *BB = BBI; local 248 for (BasicBlock::iterator II = BB->begin(), IE = BB->end(); II != IE;) { 266 BasicBlock *BB = &F->getEntryBlock(); local 267 return Scatterer(BB, BB 272 BasicBlock *BB = VOp->getParent(); local 643 BasicBlock *BB = Op->getParent(); local [all...] |
/external/llvm/lib/CodeGen/ |
H A D | PostRASchedulerList.cpp | 127 /// The index in BB of RegionEnd. 145 void startBlock(MachineBasicBlock *BB) override; 147 // Set the index of RegionEnd within the current BB. 300 << ":BB#" << MBB->getNumber() << " ***\n"; 353 void SchedulePostRATDList::startBlock(MachineBasicBlock *BB) { argument 355 ScheduleDAGInstrs::startBlock(BB); 360 AntiDepBreak->StartBlock(BB); 641 BB->splice(RegionEnd, BB, FirstDbgValue); 646 BB [all...] |
H A D | CriticalAntiDepBreaker.h | 75 void StartBlock(MachineBasicBlock *BB) override;
|
H A D | TailDuplication.cpp | 89 MachineBasicBlock *BB); 109 bool canCompletelyDuplicateBB(MachineBasicBlock &BB); 182 dbgs() << "Malformed PHI in BB#" << MBB->getNumber() << ": " << *MI; 183 dbgs() << " missing input from predecessor BB#" 192 dbgs() << "Warning: malformed PHI in BB#" << MBB->getNumber() 194 dbgs() << " extra input from predecessor BB#" 199 dbgs() << "Malformed PHI in BB#" << MBB->getNumber() << ": " << *MI; 200 dbgs() << " non-existing BB#" << PHIBB->getNumber() << '\n'; 343 static bool isDefLiveOut(unsigned Reg, MachineBasicBlock *BB, argument 348 if (UseMI.getParent() != BB) 365 getRegsUsedByPHIs(const MachineBasicBlock &BB, DenseSet<unsigned> *UsedByPhi) argument 379 AddSSAUpdateEntry(unsigned OrigReg, unsigned NewReg, MachineBasicBlock *BB) argument 641 MachineBasicBlock *BB = *SI; local 650 canCompletelyDuplicateBB(MachineBasicBlock &BB) argument [all...] |
H A D | LocalStackSlotAllocation.cpp | 286 for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 287 for (MachineBasicBlock::iterator I = BB->begin(); I != BB->end(); ++I) {
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 898 static void GenerateARCBBEntranceAnnotation(const char *Name, BasicBlock *BB, argument 906 Module *M = BB->getParent()->getParent(); 916 IRBuilder<> Builder(BB, BB->getFirstInsertionPt()); 941 static void GenerateARCBBTerminatorAnnotation(const char *Name, BasicBlock *BB, argument 949 Module *M = BB->getParent()->getParent(); 959 IRBuilder<> Builder(BB, std::prev(BB->end())); 1109 void CheckForCFGHazards(const BasicBlock *BB, 1113 BasicBlock *BB, 1623 CheckForCFGHazards(const BasicBlock *BB, DenseMap<const BasicBlock *, BBState> &BBStates, BBState &MyStates) const argument 1716 VisitInstructionBottomUp(Instruction *Inst, BasicBlock *BB, MapVector<Value *, RRInfo> &Retains, BBState &MyStates) argument 1911 VisitBottomUp(BasicBlock *BB, DenseMap<const BasicBlock *, BBState> &BBStates, MapVector<Value *, RRInfo> &Retains) argument 2123 VisitTopDown(BasicBlock *BB, DenseMap<const BasicBlock *, BBState> &BBStates, DenseMap<Value *, RRInfo> &Releases) argument 2242 BasicBlock *BB = *PredStack.back().second++; local 2880 FindPredecessorRetainWithSafePath(const Value *Arg, BasicBlock *BB, Instruction *Autorelease, SmallPtrSet<Instruction *, 4> &DepInsts, SmallPtrSet<const BasicBlock *, 4> &Visited, ProvenanceAnalysis &PA) argument 2907 FindPredecessorAutoreleaseWithSafePath(const Value *Arg, BasicBlock *BB, ReturnInst *Ret, SmallPtrSet<Instruction *, 4> &DepInsts, SmallPtrSet<const BasicBlock *, 4> &V, ProvenanceAnalysis &PA) argument 2947 BasicBlock *BB = FI; local [all...] |
H A D | ObjCARCContract.cpp | 215 BasicBlock *BB = Release->getParent(); 216 if (Load->getParent() != BB) return; 219 BasicBlock::iterator I = Load, End = BB->end(); 258 BasicBlock::iterator Begin = BB->begin(); 469 BasicBlock *BB = PHI->getIncomingBlock(ValNo); local 472 &BB->back()); 477 if (PHI->getIncomingBlock(i) == BB) {
|
/external/valgrind/main/callgrind/ |
H A D | global.h | 214 typedef struct _BB BB; typedef in typeref:struct:_BB 246 * Each BB has at most one CALL instruction. The list of JCC from 290 * Info for a side exit in a BB 294 UInt instr; /* instruction index for BB.instr array */ 295 ClgJumpKind jmpkind; /* jump kind when leaving BB at this side exit */ 300 * An instrumented basic block (BB). 303 * BB is to be retranslated but cost info is already available. 304 * The key for a BB is a (object, offset) tupel making it independent 307 * At the beginning of each instrumented BB, 309 * according BB structur [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGSDNodes.cpp | 50 : ScheduleDAG(mf), BB(nullptr), DAG(nullptr), 56 BB = bb; 640 !BB->succ_empty()) { 709 MachineBasicBlock *BB = Emitter.getBlock(); 720 BB->insert(InsertPos, DbgMI); 743 MachineBasicBlock *BB = Emitter.getBlock(); 744 if (Emitter.getInsertPos() == BB->begin() || BB->back().isPHI() || 746 // BB->back().isPHI() test will not fire when we want it to. 777 BuildMI(*BB, InsertPo [all...] |
H A D | SelectionDAGBuilder.h | 135 MachineBasicBlock* BB; member in struct:llvm::SelectionDAGBuilder::Case 138 Case() : Low(nullptr), High(nullptr), BB(nullptr), ExtraWeight(0) { } 140 uint32_t extraweight) : Low(low), High(high), BB(bb), 152 MachineBasicBlock* BB; member in struct:llvm::SelectionDAGBuilder::CaseBits 158 Mask(mask), BB(bb), Bits(bits), ExtraWeight(Weight) { } 359 /// protector check code at the end of the BB. 371 /// protector is required/which BB we insert the stack protector check 374 /// intrinsic called llvm.stackprotectorcheck right before the BB's 378 /// b. Then when a BB with said intrinsic is processed, we codegen the BB 411 initialize(const BasicBlock *BB, MachineBasicBlock *MBB, const CallInst &StackProtCheckCall) argument [all...] |
/external/lldb/include/lldb/Expression/ |
H A D | IRDynamicChecks.h | 154 /// @param[in] BB 161 llvm::BasicBlock &BB);
|
/external/llvm/include/llvm/Target/ |
H A D | TargetJITInfo.h | 75 virtual uintptr_t getPICJumpTableEntry(uintptr_t BB, uintptr_t JTBase) { argument
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | CodeExtractor.h | 61 CodeExtractor(BasicBlock *BB, bool AggregateArgs = false);
|
/external/llvm/lib/Analysis/ |
H A D | InstCount.cpp | 42 void visitBasicBlock(BasicBlock &BB) { ++TotalBlocks; } argument
|
H A D | AliasAnalysis.cpp | 399 BasicBlock *BB = I->getParent(); variable 402 if (BeforeHere != I && !DT->isReachableFromEntry(BB)) 415 BasicBlock *BB = I->getParent(); variable 417 if (BeforeHere != I && !DT->isReachableFromEntry(BB)) 519 bool AliasAnalysis::canBasicBlockModify(const BasicBlock &BB, argument 521 return canInstructionRangeModify(BB.front(), BB.back(), Loc);
|
/external/llvm/lib/Target/R600/ |
H A D | R600ClauseMergePass.cpp | 171 for (MachineFunction::iterator BB = MF.begin(), BB_E = MF.end(); 172 BB != BB_E; ++BB) { 173 MachineBasicBlock &MBB = *BB;
|
H A D | R600EmitClauseMarkers.cpp | 302 for (MachineFunction::iterator BB = MF.begin(), BB_E = MF.end(); 303 BB != BB_E; ++BB) { 304 MachineBasicBlock &MBB = *BB; 307 continue; // BB was already parsed
|
/external/llvm/lib/Transforms/IPO/ |
H A D | IPConstantPropagation.cpp | 179 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) 180 if (ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator())) {
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 89 // block that neighbors a BB actually in the loop. 198 BasicBlock *BB = Worklist.pop_back_val(); local 199 if (Blocks.insert(BB).second && BB != StopBlock) 200 // If BB is not already processed and it is not a stop block then 202 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 337 BasicBlock *BB = L->getBlocks()[i]; local 338 if (!BlocksInL.count(BB)) { 340 L->removeBlockFromLoop(BB); [all...] |
/external/llvm/test/MC/Mips/ |
H A D | elf-N64.s | 32 # BB#0: # %entry
|
H A D | elf-gprel-32-64.s | 37 # BB#0: # %entry
|
H A D | xgot.s | 34 # BB#0: # %entry
|
/external/llvm/lib/MC/MCAnalysis/ |
H A D | MCModuleYAML.cpp | 151 static void mapping(IO &IO, MCModuleYAML::BasicBlock &BB); 200 MCModuleYAML::BasicBlock &BB) { 201 IO.mapRequired("Address", BB.Address); 202 IO.mapRequired("Preds", BB.Preds); 203 IO.mapRequired("Succs", BB.Succs); 342 MCModuleYAML::BasicBlock &BB = F.BasicBlocks.back(); local 343 BB.Address = MCBB.getInsts()->getBeginAddr(); 347 BB.Preds.push_back((*PI)->getInsts()->getBeginAddr()); 351 BB.Succs.push_back((*SI)->getInsts()->getBeginAddr()); 199 mapping(IO &IO, MCModuleYAML::BasicBlock &BB) argument
|