| /external/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.h | 27 class BasicBlock;
65 mutable DenseMap<const BasicBlock*, unsigned> GlobalBasicBlockIDs;
73 std::vector<const BasicBlock*> BasicBlocks;
132 const std::vector<const BasicBlock*> &getBasicBlocks() const {
145 unsigned getGlobalBasicBlockID(const BasicBlock *BB) const;
|
| /external/llvm/lib/CodeGen/ |
| MachineModuleInfo.cpp | 42 void setPtr(BasicBlock *BB) {
59 Function *Fn; // The containing function of the BasicBlock.
60 unsigned Index; // The index in BBCallbacks for the BasicBlock.
63 DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry> AddrLabelSymbols;
65 /// BBCallbacks - Callbacks for the BasicBlock's that we have entries for. We
70 /// whose corresponding BasicBlock got deleted. These symbols need to be
83 for (DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry>::iterator
89 MCSymbol *getAddrLabelSymbol(BasicBlock *BB);
90 std::vector<MCSymbol*> getAddrLabelSymbolToEmit(BasicBlock *BB);
95 void UpdateForDeletedBlock(BasicBlock *BB)
[all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| ValueEnumerator.h | 27 class BasicBlock;
69 mutable llvm::DenseMap<const llvm::BasicBlock*, unsigned> GlobalBasicBlockIDs;
77 std::vector<const llvm::BasicBlock*> BasicBlocks;
136 const std::vector<const llvm::BasicBlock*> &getBasicBlocks() const {
149 unsigned getGlobalBasicBlockID(const llvm::BasicBlock *BB) const;
|
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| ValueEnumerator.h | 27 class BasicBlock;
69 mutable llvm::DenseMap<const llvm::BasicBlock*, unsigned> GlobalBasicBlockIDs;
77 std::vector<const llvm::BasicBlock*> BasicBlocks;
136 const std::vector<const llvm::BasicBlock*> &getBasicBlocks() const {
149 unsigned getGlobalBasicBlockID(const llvm::BasicBlock *BB) const;
|
| /frameworks/compile/slang/BitWriter_3_2/ |
| ValueEnumerator.h | 27 class BasicBlock;
69 mutable llvm::DenseMap<const llvm::BasicBlock*, unsigned> GlobalBasicBlockIDs;
77 std::vector<const llvm::BasicBlock*> BasicBlocks;
136 const std::vector<const llvm::BasicBlock*> &getBasicBlocks() const {
149 unsigned getGlobalBasicBlockID(const llvm::BasicBlock *BB) const;
|
| /external/llvm/lib/Transforms/Utils/ |
| InlineFunction.cpp | 46 BasicBlock *OuterResumeDest; ///< Destination of the invoke's unwind.
47 BasicBlock *InnerResumeDest; ///< Destination for the callee's resume.
59 llvm::BasicBlock *InvokeBB = II->getParent();
60 BasicBlock::iterator I = OuterResumeDest->begin();
72 BasicBlock *getOuterResumeDest() const {
76 BasicBlock *getInnerResumeDest();
91 void addIncomingPHIValuesFor(BasicBlock *BB) const {
95 void addIncomingPHIValuesForInto(BasicBlock *src, BasicBlock *dest) const {
96 BasicBlock::iterator I = dest->begin()
[all...] |
| LowerInvoke.cpp | 225 BasicBlock::iterator NI = II->getNormalDest()->getFirstInsertionPt();
255 static void MarkBlocksLiveIn(BasicBlock *BB, std::set<BasicBlock*> &LiveBBs) {
284 BasicBlock::iterator AfterAllocaInsertPt = F->begin()->begin();
321 for (BasicBlock::iterator II = BB->begin(), E = BB->end(); II != E; ++II) {
352 std::set<BasicBlock*> LiveBBs;
373 BasicBlock *UnwindBlock = Invokes[i]->getUnwindDest();
425 BasicBlock *EntryBB = F.begin();
451 BasicBlock *CatchBB =
452 BasicBlock::Create(F.getContext(), "setjmp.catch", &F)
[all...] |
| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 90 void SparseSolver::MarkBlockExecutable(BasicBlock *BB) {
98 void SparseSolver::markEdgeExecutable(BasicBlock *Source, BasicBlock *Dest) {
109 for (BasicBlock::iterator I = Dest->begin(); isa<PHINode>(I); ++I)
204 bool SparseSolver::isEdgeFeasible(BasicBlock *From, BasicBlock *To,
221 BasicBlock *BB = TI.getParent();
316 BasicBlock *BB = BBWorkList.back();
323 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
339 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
[all...] |
| PathProfileVerifier.cpp | 72 typedef std::map<BasicBlock*,DuplicateToIndexMap> BlockToDuplicateMap;
73 typedef std::map<BasicBlock*,BlockToDuplicateMap> NestedBlockToIndexMap;
87 arrayMap[(BasicBlock*)0][F->begin()][0] = i++;
93 BasicBlock* prev = 0;
128 edgeArray[arrayMap[(BasicBlock*)0][currentPath->getFirstBlockInPath()][0]]
136 BasicBlock* source = nextEdge->getSource();
137 BasicBlock* target = nextEdge->getTarget();
|
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 72 BasicBlock *BB = I->getParent();
89 BasicBlock::iterator BBI = I, BBE = BB->end();
115 static bool markAliveBlocks(BasicBlock *BB,
116 SmallPtrSet<BasicBlock*, 128> &Reachable) {
118 SmallVector<BasicBlock*, 128> Worklist;
128 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){
193 SmallPtrSet<BasicBlock*, 128> Reachable;
229 BasicBlock *RetBlock = 0;
233 BasicBlock &BB = *BBI++;
243 BasicBlock::iterator I = Ret
[all...] |
| LoopIdiomRecognize.cpp | 75 static bool isAlmostEmpty(BasicBlock *);
77 static BranchInst *getBranch(BasicBlock *BB) {
82 static Value *getBrCondtion(BasicBlock *);
86 static BasicBlock *getPrecondBb(BasicBlock *PreHead);
97 BasicBlock *PreCondBB;
116 Value *matchCondition (BranchInst *Br, BasicBlock *NonZeroTarget) const;
147 bool runOnLoopBlock(BasicBlock *BB, const SCEV *BECount,
148 SmallVectorImpl<BasicBlock*> &ExitBlocks);
282 bool LIRUtil::isAlmostEmpty(BasicBlock *BB)
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.cpp | 280 llvm::BasicBlock *CleanupEntry) {
281 llvm::SmallPtrSet<llvm::BasicBlock*, 4> CasesAdded;
316 llvm::BasicBlock *Block) {
335 void CodeGenFunction::ResolveBranchFixups(llvm::BasicBlock *Block) {
342 llvm::SmallPtrSet<llvm::BasicBlock*, 4> ModifiedOptimisticBlocks;
355 llvm::BasicBlock *BranchBB = Fixup.OptimisticBranchBlock;
417 static llvm::BasicBlock *CreateNormalEntry(CodeGenFunction &CGF,
420 llvm::BasicBlock *Entry = Scope.getNormalBlock();
433 static llvm::BasicBlock *SimplifyCleanupEntry(CodeGenFunction &CGF,
434 llvm::BasicBlock *Entry)
[all...] |
| /art/compiler/dex/ |
| mir_graph.cc | 131 BasicBlock* MIRGraph::SplitBlock(unsigned int code_offset,
132 BasicBlock* orig_block, BasicBlock** immed_pred_block_p) {
141 BasicBlock *bottom_block = NewMemBB(kDalvikByteCode, num_blocks_++);
180 BasicBlock *bb = successor_block_info->block;
209 BasicBlock* MIRGraph::FindBlock(unsigned int code_offset, bool split, bool create,
210 BasicBlock** immed_pred_block_p) {
211 BasicBlock* bb;
213 SafeMap<unsigned int, BasicBlock*>::iterator it;
229 BasicBlock *new_bb = SplitBlock(code_offset, bb, bb == *immed_pred_block_p
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolution.h | 278 AssertingVH<BasicBlock> ExitingBlock;
316 SmallVectorImpl< std::pair<BasicBlock *, const SCEV *> > &ExitCounts,
336 const SCEV *getExact(BasicBlock *ExitingBlock, ScalarEvolution *SE) const;
375 std::map<const BasicBlock *, BlockDisposition> > BlockDispositions;
378 BlockDisposition computeBlockDisposition(const SCEV *S, const BasicBlock *BB);
448 ExitLimit ComputeExitLimit(const Loop *L, BasicBlock *ExitingBlock);
455 BasicBlock *TBB,
456 BasicBlock *FBB,
464 BasicBlock *TBB,
465 BasicBlock *FBB
[all...] |
| /art/compiler/sea_ir/code_gen/ |
| code_gen.h | 34 // Returns the llvm::BasicBlock* corresponding to the sea_ir::Region with id @region_id.
35 llvm::BasicBlock* GetBlock(int region_id) {
36 std::map<int, llvm::BasicBlock*>::iterator block_it = blocks_.find(region_id);
40 // Returns the llvm::BasicBlock* corresponding top the sea_ir::Region @region.
41 llvm::BasicBlock* GetBlock(Region* region) {
45 void AddBlock(int region_id, llvm::BasicBlock* block) {
46 blocks_.insert(std::pair<int, llvm::BasicBlock*>(region_id, block));
49 void AddBlock(Region* region, llvm::BasicBlock* block) {
80 std::map<int, llvm::BasicBlock*> blocks_;
|
| /dalvik/vm/compiler/ |
| Compiler.h | 187 struct BasicBlock;
222 struct BasicBlock *bb);
224 struct BasicBlock *bb);
226 struct BasicBlock *bb);
228 struct BasicBlock *bb);
231 struct BasicBlock *bb);
239 bool (*func)(struct CompilationUnit *, struct BasicBlock *),
|
| Loop.cpp | 95 static BasicBlock *findPredecessorBlock(const CompilationUnit *cUnit,
96 const BasicBlock *bb)
104 return (BasicBlock *) dvmGrowableListGetElement(&cUnit->blockList,
112 return (BasicBlock *) dvmGrowableListGetElement(&cUnit->blockList,
173 BasicBlock *loopBackBlock = cUnit->entryBlock->fallThrough;
345 BasicBlock *loopBody = cUnit->entryBlock->fallThrough;
432 BasicBlock *entry = cUnit->entryBlock;
514 void resetBlockEdges(BasicBlock *bb)
522 struct BasicBlock *bb)
530 BasicBlock *firstBB = cUnit->entryBlock->fallThrough
[all...] |
| /external/llvm/include/llvm/IR/ |
| Instruction.h | 35 BasicBlock *Parent;
52 inline const BasicBlock *getParent() const { return Parent; }
53 inline BasicBlock *getParent() { return Parent; }
369 bool isUsedOutsideOfBlock(const BasicBlock *BB) const;
429 friend class SymbolTableListTraits<Instruction, BasicBlock>;
430 void setParent(BasicBlock *P);
448 BasicBlock *InsertAtEnd);
|
| Value.h | 28 class BasicBlock;
173 bool isUsedInBasicBlock(const BasicBlock *BB) const;
190 BasicBlockVal, // This is an instance of BasicBlock
307 Value *DoPHITranslation(const BasicBlock *CurBB, const BasicBlock *PredBB);
309 const Value *DoPHITranslation(const BasicBlock *CurBB,
310 const BasicBlock *PredBB) const{
372 template <> struct isa_impl<BasicBlock, Value> {
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| BoundsChecking.cpp | 61 BasicBlock *TrapBB;
63 BasicBlock *getTrapBB();
78 BasicBlock *BoundsChecking::getTrapBB() {
83 BasicBlock::iterator PrevInsertPoint = Builder->GetInsertPoint();
84 TrapBB = BasicBlock::Create(Fn->getContext(), "trap", Fn);
114 BasicBlock *OldBB = Inst->getParent();
115 BasicBlock *Cont = OldBB->splitBasicBlock(Inst);
|
| PathProfiling.cpp | 82 // Creates a new BLInstrumentationNode from a BasicBlock.
83 BLInstrumentationNode(BasicBlock* BB);
192 void splitUpdate(BLInstrumentationEdge* formerEdge, BasicBlock* newBlock);
222 virtual BallLarusNode* createNode(BasicBlock* BB);
291 BasicBlock::iterator getInsertionPoint(
292 BasicBlock* block, Value* pathNumber);
314 BasicBlock::iterator insertPoint,
403 // Creates a new BLInstrumentationNode from a BasicBlock.
404 BLInstrumentationNode::BLInstrumentationNode(BasicBlock* BB) :
485 BasicBlock* source = sourceNode->getBlock()
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_inlines.h | 362 bool BasicBlock::reachableBy(const BasicBlock *by, const BasicBlock *term)
367 BasicBlock *BasicBlock::get(Iterator &iter)
369 return reinterpret_cast<BasicBlock *>(iter.get());
372 BasicBlock *BasicBlock::get(Graph::Node *node)
375 return reinterpret_cast<BasicBlock *>(node->data);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_inlines.h | 362 bool BasicBlock::reachableBy(const BasicBlock *by, const BasicBlock *term)
367 BasicBlock *BasicBlock::get(Iterator &iter)
369 return reinterpret_cast<BasicBlock *>(iter.get());
372 BasicBlock *BasicBlock::get(Graph::Node *node)
375 return reinterpret_cast<BasicBlock *>(node->data);
|
| /external/llvm/include/llvm/CodeGen/ |
| FunctionLoweringInfo.h | 33 class BasicBlock;
67 DenseMap<const BasicBlock*, MachineBasicBlock *> MBBMap;
110 SmallPtrSet<const BasicBlock*, 4> VisitedBBs;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 649 /// \brief Per-BasicBlock state.
671 SmallVector<BasicBlock *, 2> Preds;
674 SmallVector<BasicBlock *, 2> Succs;
758 typedef SmallVectorImpl<BasicBlock *>::const_iterator edge_iterator;
764 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
765 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); }
[all...] |
