/external/llvm/include/llvm/CodeGen/ |
MachineDominators.h | 118 inline MachineDomTreeNode *operator[](MachineBasicBlock *BB) const { 119 return DT->getNode(BB); 125 inline MachineDomTreeNode *getNode(MachineBasicBlock *BB) const { 126 return DT->getNode(BB); 132 inline MachineDomTreeNode *addNewBlock(MachineBasicBlock *BB, 134 return DT->addNewBlock(BB, DomBB); 152 /// children list. Deletes dominator node associated with basic block BB. 153 inline void eraseNode(MachineBasicBlock *BB) { 154 DT->eraseNode(BB); 157 /// splitBlock - BB is split and now it has one successor. Update dominato [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
Local.h | 57 bool ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions = false, 89 bool SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD = 0, 97 /// method is called when we're about to delete Pred as a predecessor of BB. If 98 /// BB contains any PHI nodes, this drops the entries in the PHI nodes for Pred. 107 void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred, 111 /// MergeBasicBlockIntoOnlyPred - BB is a block with one predecessor and its 112 /// predecessor is known to have one successor (BB!). Eliminate the edge 113 /// between them, moving the instructions in the predecessor into BB. This 116 void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, Pass *P = 0); 119 /// TryToSimplifyUncondBranchFromEmptyBlock - BB is known to contain a [all...] |
/external/llvm/lib/Analysis/ |
BlockFrequencyInfo.cpp | 56 BlockFrequency BlockFrequencyInfo::getBlockFreq(const BasicBlock *BB) const { 57 return BFI->getBlockFreq(BB);
|
/external/llvm/lib/Target/X86/ |
X86VZeroUpper.cpp | 180 // Each BB state depends on all predecessors, loop over until everything 203 MachineBasicBlock &BB) { 205 unsigned BBNum = BB.getNumber(); 213 for (MachineBasicBlock::const_pred_iterator PI = BB.pred_begin(), 214 PE = BB.pred_end(); PI != PE; ++PI) { 223 if (&BB == MF.begin()) { 233 for (MachineBasicBlock::iterator I = BB.begin(); I != BB.end(); ++I) { 269 BuildMI(BB, I, dl, TII->get(X86::VZEROUPPER)); 275 // the end of the BB [all...] |
/external/mesa3d/src/gallium/drivers/radeon/ |
R600ISelLowering.h | 28 MachineBasicBlock * BB) const; 41 void lowerImplicitParameter(MachineInstr *MI, MachineBasicBlock &BB,
|
/external/llvm/include/llvm/Analysis/ |
BlockFrequencyInfo.h | 50 BlockFrequency getBlockFreq(const BasicBlock *BB) const;
|
CFG.h | 40 /// Search for the specified successor of basic block BB and return its position 43 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
|
PostDominators.h | 49 inline DomTreeNode *operator[](BasicBlock *BB) const { 50 return DT->getNode(BB); 53 inline DomTreeNode *getNode(BasicBlock *BB) const { 54 return DT->getNode(BB);
|
ProfileInfo.h | 46 raw_ostream& operator<<(raw_ostream &O, const BasicBlock *BB); 106 double getExecutionCount(const BType *BB); 108 void setExecutionCount(const BType *BB, double w); 110 void addExecutionCount(const BType *BB, double w); 139 void removeBlock(const BType *BB); 162 void splitBlock(const BType *BB, const BType* NewBB, 215 const BType *BB = &(*BI); 216 dbgs() << BB << "@" << format("%p", BB) << ": " << format("%.20g",getExecutionCount(BB)) << "\n" [all...] |
MemoryDependenceAnalysis.h | 189 /// each BasicBlock (the BB entry) it keeps a MemDepResult. 191 BasicBlock *BB; 194 NonLocalDepEntry(BasicBlock *bb, MemDepResult result) 195 : BB(bb), Result(result) {} 198 NonLocalDepEntry(BasicBlock *bb) : BB(bb) {} 200 // BB is the sort key, it can't be changed. 201 BasicBlock *getBB() const { return BB; } [all...] |
DominanceFrontier.h | 33 typedef std::set<BasicBlock*> DomSetType; // Dom set for a bb 66 iterator addBasicBlock(BasicBlock *BB, const DomSetType &frontier) { 67 assert(find(BB) == end() && "Block already in DominanceFrontier!"); 68 return Frontiers.insert(std::make_pair(BB, frontier)).first; 71 /// removeBlock - Remove basic block BB's frontier. 72 void removeBlock(BasicBlock *BB) { 73 assert(find(BB) != end() && "Block is not in DominanceFrontier!"); 75 I->second.erase(BB); 76 Frontiers.erase(BB); 80 assert(I != end() && "BB is not in DominanceFrontier!") [all...] |
/external/llvm/lib/CodeGen/ |
StackProtector.cpp | 231 BasicBlock *BB = I; 234 II = BB->begin(), IE = BB->end(); II != IE; ++II) { 321 BasicBlock *BB = I++; 322 ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator()); 354 BasicBlock *NewBB = BB->splitBasicBlock(RI, "SP_return"); 356 if (DT && DT->isReachableFromEntry(BB)) { 357 DT->addNewBlock(NewBB, BB); 358 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB; [all...] |
MachineBlockPlacement.cpp | 100 BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB) 101 : Blocks(1, BB), BlockToChain(BlockToChain), LoopPredecessors(0) { 102 assert(BB && "Cannot create a chain with a null basic block"); 103 BlockToChain[BB] = this; 121 void merge(MachineBasicBlock *BB, BlockChain *Chain) { 122 assert(BB); 127 assert(!BlockToChain[BB]); 128 Blocks.push_back(BB); 129 BlockToChain[BB] = this; 133 assert(BB == *Chain->begin()) [all...] |
SjLjEHPrepare.cpp | 142 /// MarkBlocksLiveIn - Insert BB and all of its predescessors into LiveBBs until 144 static void MarkBlocksLiveIn(BasicBlock *BB, 146 if (!LiveBBs.insert(BB)) return; // already been here. 148 for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) 290 BB = F.begin(), BBE = F.end(); BB != BBE; ++BB) { 292 II = BB->begin(), IIE = BB->end(); II != IIE; ++II) [all...] |
/external/llvm/test/MC/COFF/ |
basic-coff-64.s | 14 # BB#0: # %entry
|
basic-coff.s | 14 # BB#0: # %entry
|
/frameworks/compile/slang/BitWriter_2_9/ |
BitcodeWriterPass.cpp | 52 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { 53 SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator());
|
/frameworks/compile/slang/BitWriter_2_9_func/ |
BitcodeWriterPass.cpp | 52 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { 53 SwitchInst *SI = dyn_cast<SwitchInst>(BB->getTerminator());
|
/external/llvm/lib/Transforms/Utils/ |
Mem2Reg.cpp | 62 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function 74 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
|
PromoteMemoryToRegister.cpp | 211 RenamePassData() : BB(NULL), Pred(NULL), Values() {} 213 : BB(B), Pred(P), Values(V) {} 214 BasicBlock *BB; 219 std::swap(BB, RHS.BB); 225 /// \brief This assigns and keeps a per-bb relative ordering of load/store 259 const BasicBlock *BB = I->getParent(); 261 for (BasicBlock::const_iterator BBI = BB->begin(), E = BB->end(); BBI != E; 340 unsigned getNumPreds(const BasicBlock *BB) { [all...] |
/external/llvm/unittests/Bitcode/ |
BitReaderTest.cpp | 36 BasicBlock* BB = BasicBlock::Create(Mod->getContext(), "bb", Func); 37 new UnreachableInst(Mod->getContext(), BB); 42 BlockAddress::get(BB), "table");
|
/external/llvm/lib/Transforms/Scalar/ |
CodeGenPrepare.cpp | 121 bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const; 122 void EliminateMostlyEmptyBlock(BasicBlock *BB); 123 bool OptimizeBlock(BasicBlock &BB); 131 bool DupRetToEnableTailCallOpts(BasicBlock *BB); 180 BasicBlock *BB = I++; 181 MadeChange |= OptimizeBlock(*BB); 191 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { 192 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB)) [all...] |
StructurizeCFG.cpp | 70 /// \brief Add BB to the resulting dominator 71 void addBlock(BasicBlock *BB, bool Remember = true) { 72 DomTreeNode *Node = DT->getNode(BB); 78 Result = BB; 96 ExplicitMentioned = Remember && (Result == BB); 204 void killTerminator(BasicBlock *BB); 215 void setPrevNode(BasicBlock *BB); 217 bool dominatesPredicates(BasicBlock *BB, RegionNode *Node); 296 BasicBlock *BB = N->getNodeAs<BasicBlock>(); 297 BranchInst *Term = cast<BranchInst>(BB->getTerminator()) [all...] |
/external/valgrind/main/callgrind/ |
bb.c | 3 /*--- bb.c ---*/ 32 /*--- Basic block (BB) operations ---*/ 35 /* BB hash, resizable */ 44 bbs.table = (BB**) CLG_MALLOC("cl.bb.ibh.1", 45 bbs.size * sizeof(BB*)); 57 * - BB base as object file offset 65 /* double size of bb table */ 70 BB **new_table, *curr, *next; 74 new_table = (BB**) CLG_MALLOC("cl.bb.rbt.1" 124 BB* bb; local 181 BB* bb; local 244 BB* bb; local 291 BB *bb, *bp; local [all...] |
/external/llvm/lib/Target/Mips/ |
MipsOptimizeMathLibCalls.cpp | 50 Function::iterator &BB); 80 for (Function::iterator BB = F.begin(), BE = F.end(); BB != BE;) { 81 CurrBB = BB++; 109 if (optimizeSQRT(Call, CalledFunc, *CurrBB, BB)) 127 Function::iterator &BB) { 173 BB = JoinBB;
|