Searched defs:Blocks (Results 1 - 25 of 33) 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.h96 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; local
98 if (TotalIDs > Blocks.size()) {
99 Blocks.resize(TotalIDs);
102 Blocks.set(ID);
97 assert(ID < TotalIDs); if (TotalIDs > Blocks.size()) argument
/external/llvm/include/llvm/MC/
H A DMCFunction.h84 BasicBlockListTy Blocks; member in class:llvm::MCFunction
108 const_iterator begin() const { return Blocks.begin(); }
109 iterator begin() { return Blocks.begin(); }
110 const_iterator end() const { return Blocks.end(); }
111 iterator end() { return Blocks.end(); }
113 const MCBasicBlock* front() const { return Blocks.front(); }
114 MCBasicBlock* front() { return Blocks.front(); }
115 const MCBasicBlock* back() const { return Blocks.back(); }
116 MCBasicBlock* back() { return Blocks.back(); }
/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 std::copy(po_begin(BB), po_end(BB), std::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.cpp253 void SpillPlacement::addPrefSpill(ArrayRef<unsigned> Blocks, bool Strong) { argument
254 for (ArrayRef<unsigned>::iterator I = Blocks.begin(), E = Blocks.end();
H A DMachineBlockPlacement.cpp84 SmallVector<MachineBasicBlock *, 4> Blocks; member in class:__anon22087::BlockChain
101 : Blocks(1, BB), BlockToChain(BlockToChain), LoopPredecessors(0) {
110 iterator begin() { return Blocks.begin(); }
113 iterator end() { return Blocks.end(); }
123 assert(!Blocks.empty());
128 Blocks.push_back(BB);
140 Blocks.push_back(*BI);
H A DRegAllocGreedy.cpp814 /// live-through blocks in Blocks.
816 ArrayRef<unsigned> Blocks) {
822 for (unsigned i = 0; i != Blocks.size(); ++i) {
823 unsigned Number = Blocks[i];
878 ArrayRef<unsigned> Blocks = Bundles->getBlocks(Bundle);
879 for (ArrayRef<unsigned>::iterator I = Blocks.begin(), E = Blocks.end();
1093 ArrayRef<unsigned> Blocks = GlobalCand[UsedCands[c]].ActiveBlocks;
1094 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
1095 unsigned Number = Blocks[
815 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.cpp276 SmallPtrSet<BasicBlock*, 8> Blocks; local
278 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
281 unsigned NumPrint = Blocks.size();
285 if (NumPrint < Blocks.size())
286 outs() << "... <" << Blocks.size() << " total>";
292 if (!Blocks.count(BB) && BB->getTerminator()->getNumSuccessors()) {
315 for (SmallPtrSet<BasicBlock*, 8>::iterator I = Blocks.begin(),
316 E = Blocks.end(); I != E; ++I)
514 std::vector<const BasicBlock*> Blocks; local
518 Blocks
[all...]
/external/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp452 std::set<BasicBlock*> &Blocks) {
457 if (Blocks.insert(BB).second && BB != StopBlock)
451 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:__anon22694::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.cpp743 SmallVector<BlockContentComment *, 8> Blocks; local
745 Blocks.push_back(parseBlockContent());
751 return S.actOnFullComment(S.copyArray(llvm::makeArrayRef(Blocks)));
H A DCommentSema.cpp553 ArrayRef<BlockContentComment *> Blocks) {
554 FullComment *FC = new (Allocator) FullComment(Blocks, ThisDeclInfo);
552 actOnFullComment( ArrayRef<BlockContentComment *> Blocks) argument
/external/llvm/include/llvm/Analysis/
H A DLoopInfo.h69 // Blocks - The list of blocks in this loop. First entry is the header node.
70 std::vector<BlockT*> Blocks; member in class:llvm::LoopBase
93 BlockT *getHeader() const { return Blocks.front(); }
136 const std::vector<BlockT*> &getBlocks() const { return Blocks; }
137 std::vector<BlockT*> &getBlocksVector() { return Blocks; }
139 block_iterator block_begin() const { return Blocks.begin(); }
140 block_iterator block_end() const { return Blocks.end(); }
144 return Blocks.size();
273 Blocks.push_back(BB);
280 if (Blocks[
[all...]
/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/chromium_org/net/tools/balsa/
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;
983 char* GetPtr(BalsaBuffer::Blocks
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp312 Blocks[BB] = new GCOVBlock(i++, os);
332 DeleteContainerSeconds(Blocks);
337 return *Blocks[BB];
347 write(Blocks.size() + 1);
348 for (int i = 0, e = Blocks.size() + 1; i != e; ++i) {
351 DEBUG(dbgs() << Blocks.size() << " blocks.\n");
354 if (Blocks.empty()) return;
355 Function *F = Blocks.begin()->first->getParent();
357 GCOVBlock &Block = *Blocks[I];
373 Blocks[
378 DenseMap<BasicBlock *, GCOVBlock *> Blocks; member in class:__anon22545::GCOVFunction
[all...]

Completed in 777 milliseconds

12