Searched defs:Blocks (Results 1 - 25 of 31) sorted by relevance

12

/external/llvm/include/llvm/CodeGen/
H A DEdgeBundles.h34 /// Blocks - Map each bundle to a list of basic block numbers.
35 SmallVector<SmallVector<unsigned, 8>, 4> Blocks; member in class:llvm::EdgeBundles
49 ArrayRef<unsigned> getBlocks(unsigned Bundle) const { return Blocks[Bundle]; }
/external/llvm/include/llvm/Transforms/Utils/
H A DCodeExtractor.h52 SetVector<BasicBlock *> Blocks; member in class:llvm::CodeExtractor
95 bool isEligible() const { return !Blocks.empty(); }
/external/llvm/lib/Transforms/Scalar/
H A DBasicBlockPlacement.cpp113 Function::BasicBlockListType &Blocks = BB->getParent()->getBasicBlockList(); local
114 Blocks.splice(InsertPos, Blocks, BB);
H A DDeadStoreElimination.cpp641 static void FindUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, argument
651 Blocks.push_back(Pred);
661 SmallVector<BasicBlock *, 16> Blocks; local
662 Blocks.push_back(F->getParent());
664 while (!Blocks.empty()) {
665 BasicBlock *BB = Blocks.pop_back_val();
698 FindUnconditionalPreds(Blocks, BB, DT);
/external/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h73 std::vector<const CFGBlock*> Blocks; member in class:clang::PostOrderCFGView
83 iterator begin() { return Blocks.rbegin(); }
84 iterator end() { return Blocks.rend(); }
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DFunctionSummary.h80 llvm::BitVector &Blocks = I->second->VisitedBasicBlocks; local
82 if (TotalIDs > Blocks.size()) {
83 Blocks.resize(TotalIDs);
86 Blocks[ID] = true;
81 assert(ID < TotalIDs); if (TotalIDs > Blocks.size()) argument
/external/llvm/tools/llvm-objdump/
H A DMCFunction.h75 MapTy Blocks; member in class:llvm::MCFunction
87 iterator begin() const { return Blocks.begin(); }
88 iterator end() const { return Blocks.end(); }
93 Blocks.push_back(std::make_pair(Address, BB));
94 return Blocks.back().second;
/external/clang/test/SemaCXX/
H A Dnested-name-spec-locations.cpp158 void bar(std::vector<int*> &Blocks) { argument
159 foo(Blocks); // expected-note{{in instantiation of}}
/external/llvm/include/llvm/ADT/
H A DPostOrderIterator.h261 std::vector<NodeType*> Blocks; // Block list in normal PO order member in class:llvm::ReversePostOrderTraversal
263 copy(po_begin(BB), po_end(BB), back_inserter(Blocks));
273 inline rpo_iterator begin() { return Blocks.rbegin(); }
274 inline rpo_iterator end() { return Blocks.rend(); }
/external/llvm/include/llvm/Support/
H A DGCOV.h183 SmallVector<GCOVBlock *, 16> Blocks; member in class:llvm::GCOVFunction
/external/llvm/lib/CodeGen/
H A DInterferenceCache.h89 /// Blocks - Interference for each block in the function.
90 SmallVector<BlockInterference, 8> Blocks; member in class:llvm::InterferenceCache::Entry
92 /// update - Recompute Blocks[MBBNum]
125 if (Blocks[MBBNum].Tag != Tag)
127 return &Blocks[MBBNum];
H A DSpillPlacement.cpp255 void SpillPlacement::addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong) { argument
256 for (ArrayRef<unsigned>::iterator I = Blocks.begin(), E = Blocks.end();
H A DMachineBlockPlacement.cpp78 SmallVector<MachineBasicBlock *, 4> Blocks; member in class:__anon9470::BlockChain
95 : Blocks(1, BB), BlockToChain(BlockToChain), LoopPredecessors(0) {
104 iterator begin() { return Blocks.begin(); }
107 iterator end() { return Blocks.end(); }
117 assert(!Blocks.empty());
122 Blocks.push_back(BB);
134 Blocks.push_back(*BI);
H A DRegAllocGreedy.cpp758 /// live-through blocks in Blocks.
760 ArrayRef<unsigned> Blocks) {
766 for (unsigned i = 0; i != Blocks.size(); ++i) {
767 unsigned Number = Blocks[i];
822 ArrayRef<unsigned> Blocks = Bundles->getBlocks(Bundle);
823 for (ArrayRef<unsigned>::iterator I = Blocks.begin(), E = Blocks.end();
1035 ArrayRef<unsigned> Blocks = GlobalCand[UsedCands[c]].ActiveBlocks;
1036 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
1037 unsigned Number = Blocks[
759 addThroughConstraints(InterferenceCache::Cursor Intf, ArrayRef<unsigned> Blocks) argument
[all...]
H A DMachineLICM.cpp505 const std::vector<MachineBasicBlock*> Blocks = CurLoop->getBlocks(); local
506 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
507 MachineBasicBlock *BB = Blocks[i];
587 const std::vector<MachineBasicBlock*> Blocks = CurLoop->getBlocks(); local
588 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
589 MachineBasicBlock *BB = Blocks[i];
/external/llvm/tools/bugpoint/
H A DCrashDebugger.cpp278 SmallPtrSet<BasicBlock*, 8> Blocks; local
280 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
283 unsigned NumPrint = Blocks.size();
287 if (NumPrint < Blocks.size())
288 outs() << "... <" << Blocks.size() << " total>";
294 if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) {
317 for (SmallPtrSet<BasicBlock*, 8>::iterator I = Blocks.begin(),
318 E = Blocks.end(); I != E; ++I)
516 std::vector<const BasicBlock*> Blocks; local
520 Blocks
[all...]
/external/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp451 std::set<BasicBlock*> &Blocks) {
456 if (Blocks.insert(BB).second && BB != StopBlock)
450 AddBlockAndPredsToSet(BasicBlock *InputBB, BasicBlock *StopBlock, std::set<BasicBlock*> &Blocks) argument
H A DCodeExtractor.cpp122 Blocks(buildExtractionBlockSet(BB)), NumExitBlocks(~0U) {}
127 Blocks(buildExtractionBlockSet(BBs)), NumExitBlocks(~0U) {}
131 Blocks(buildExtractionBlockSet(L.getBlocks())), NumExitBlocks(~0U) {}
136 Blocks(buildExtractionBlockSet(RN)), NumExitBlocks(~0U) {}
140 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { argument
142 if (Blocks.count(I->getParent()))
150 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { argument
153 if (!Blocks.count(I->getParent()))
160 for (SetVector<BasicBlock *>::const_iterator I = Blocks.begin(),
161 E = Blocks
[all...]
/external/llvm/tools/llvm-diff/
H A DDifferenceEngine.cpp122 DenseMap<BasicBlock*, BasicBlock*> Blocks; member in class:__anon10022::FunctionDifferenceEngine
129 if (!Blocks.count(*I)) Count++;
157 BasicBlock *&Ref = Blocks[L];
392 return Blocks[cast<BlockAddress>(L)->getBasicBlock()]
448 return Blocks[cast<BasicBlock>(L)] != R;
/external/clang/lib/AST/
H A DCommentParser.cpp748 SmallVector<BlockContentComment *, 8> Blocks; local
750 Blocks.push_back(parseBlockContent());
756 return S.actOnFullComment(S.copyArray(llvm::makeArrayRef(Blocks)));
H A DCommentSema.cpp543 ArrayRef<BlockContentComment *> Blocks) {
544 FullComment *FC = new (Allocator) FullComment(Blocks, ThisDeclInfo);
542 actOnFullComment( ArrayRef<BlockContentComment *> Blocks) argument
/external/llvm/include/llvm/Analysis/
H A DLoopInfo.h68 // Blocks - The list of blocks in this loop. First entry is the header node.
69 std::vector<BlockT*> Blocks; member in class:llvm::LoopBase
92 BlockT *getHeader() const { return Blocks.front(); }
135 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
136 std::vector<BlockT*> &getBlocksVector() { return Blocks; }
138 block_iterator block_begin() const { return Blocks.begin(); }
139 block_iterator block_end() const { return Blocks.end(); }
143 return Blocks.size();
272 Blocks.push_back(BB);
279 if (Blocks[
[all...]
/external/llvm/lib/Target/PowerPC/
H A DPPCCTRLoops.cpp493 const std::vector<MachineBasicBlock*> Blocks = L->getBlocks(); local
494 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
495 MachineBasicBlock *MBB = Blocks[i];
740 const std::vector<MachineBasicBlock*> Blocks = L->getBlocks(); local
741 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
742 MachineBasicBlock *MBB = Blocks[i];
/external/chromium/net/tools/flip_server/
H A Dbalsa_headers.h97 typedef std::vector<BufferBlock> Blocks; typedef in class:net::BalsaBuffer
104 const char* GetPtr(Blocks::size_type block_idx) const {
110 char* GetPtr(Blocks::size_type block_idx) {
150 Blocks::size_type* block_buffer_idx);
157 char* Reserve(size_t size, Blocks::size_type* block_buffer_idx);
177 Blocks::size_type num_blocks() const { return blocks_.size(); }
195 void CleanupBlocksStartingFrom(Blocks::size_type start_idx);
198 Blocks blocks_;
270 BalsaBuffer::Blocks::size_type buffer_base_idx;
991 char* GetPtr(BalsaBuffer::Blocks
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp288 Blocks[BB] = new GCOVBlock(i++, os);
308 DeleteContainerSeconds(Blocks);
313 return *Blocks[BB];
323 write(Blocks.size() + 1);
324 for (int i = 0, e = Blocks.size() + 1; i != e; ++i) {
327 DEBUG(dbgs() << Blocks.size() << " blocks.\n");
330 for (DenseMap<BasicBlock *, GCOVBlock *>::iterator I = Blocks.begin(),
331 E = Blocks.end(); I != E; ++I) {
347 for (DenseMap<BasicBlock *, GCOVBlock *>::iterator I = Blocks.begin(),
348 E = Blocks
354 DenseMap<BasicBlock *, GCOVBlock *> Blocks; member in class:__anon9888::GCOVFunction
[all...]

Completed in 449 milliseconds

12