/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | block.h | 17 class Block { class in namespace:leveldb 20 explicit Block(const BlockContents& contents); 22 ~Block(); 33 bool owned_; // Block owns data_[] 36 Block(const Block&); 37 void operator=(const Block&);
|
H A D | block.cc | 18 inline uint32_t Block::NumRestarts() const { 23 Block::Block(const BlockContents& contents) function in class:leveldb::Block 40 Block::~Block() { 76 class Block::Iter : public Iterator { 256 Iterator* Block::NewIterator(const Comparator* cmp) {
|
/external/llvm/tools/llvm-readobj/ |
H A D | StreamWriter.cpp | 31 ArrayRef<uint8_t> Data, bool Block) { 33 Block = true; 35 if (Block) { 30 printBinaryImpl(StringRef Label, StringRef Str, ArrayRef<uint8_t> Data, bool Block) argument
|
/external/valgrind/main/none/tests/amd64/ |
H A D | movbe.c | 13 typedef struct { UChar cs[40]; } Block; typedef in typeref:struct:__anon28671 15 void showBlock ( char* msg, Block* b ) 31 void randBlock ( Block* b ) 35 for (i = 0; i < sizeof(Block); i++) 46 Block* b = memalign(32, sizeof(Block)); \
|
H A D | avx-1.c | 16 typedef struct { YMM a1; YMM a2; YMM a3; YMM a4; ULong u64; } Block; typedef in typeref:struct:__anon28669 28 void showBlock ( char* msg, Block* block ) 45 void randBlock ( Block* b ) 49 for (i = 0; i < sizeof(Block); i++) 65 Block* b = memalign(32, sizeof(Block)); \
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | StreamBuffer.h | 41 typedef Vector<T> Block; typedef in class:WTF::StreamBuffer 63 m_buffer.append(adoptPtr(new Block)); 110 Deque<OwnPtr<Block> > m_buffer;
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | SerializedGrammar.java | 49 Block block; 50 public Rule(String name, Block block) { 59 class Block { class in class:SerializedGrammar 61 public Block(List[] alts) { method in class:SerializedGrammar.Block 127 Block b = readBlock(in); 133 protected Block readBlock(DataInputStream in) throws IOException { 142 return new Block(alts); 172 Block b = readBlock(in);
|
/external/ceres-solver/internal/ceres/ |
H A D | block_structure.h | 31 // Block structure objects are used to carry information about the 52 struct Block { struct in namespace:ceres::internal 53 Block() : size(-1), position(-1) {} function in struct:ceres::internal::Block 54 Block(int size_, int position_) : size(size_), position(position_) {} function in struct:ceres::internal::Block 75 Block block; 83 vector<Block> cols; 88 vector<Block> rows;
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkChunkAlloc.cpp | 20 struct SkChunkAlloc::Block { struct in class:SkChunkAlloc 21 Block* fNext; 30 static void FreeChain(Block* block) { 32 Block* next = block->fNext; 64 Block::FreeChain(fBlock); 72 SkChunkAlloc::Block* SkChunkAlloc::newBlock(size_t bytes, AllocFailType ftype) { 78 Block* block = (Block*)sk_malloc_flags(sizeof(Block) + size, 99 Block* bloc [all...] |
H A D | SkDeque.cpp | 12 struct SkDeque::Block { struct in class:SkDeque 13 Block* fNext; 14 Block* fPrev; 47 if (storageSize >= sizeof(Block) + elemSize) { 48 fFrontBlock = (Block*)storage; 58 Block* head = fFrontBlock; 59 Block* initialHead = (Block*)fInitialStorage; 62 Block* next = head->fNext; 78 Block* firs [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrAllocPool.cpp | 14 struct GrAllocPool::Block { struct in class:GrAllocPool 15 Block* fNext; 20 static Block* Create(size_t size, Block* next) { 23 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); 25 block->fPtr = (char*)block + sizeof(Block); 69 Block* block = fBlock; 71 Block* nex [all...] |
/external/clang/include/clang/Analysis/Analyses/ |
H A D | PostOrderCFGView.h | 50 bool insert(const CFGBlock *Block) { argument 52 // make sure that Block is non-null. Moreover, the CFGBlock iterator will 55 if (Block == 0) 57 if (VisitedBlockIDs.test(Block->getBlockID())) 59 VisitedBlockIDs.set(Block->getBlockID()); 65 /// loop. Block must not be null. 66 bool alreadySet(const CFGBlock *Block) { argument 67 return VisitedBlockIDs.test(Block->getBlockID());
|
/external/skia/src/core/ |
H A D | SkChunkAlloc.cpp | 20 struct SkChunkAlloc::Block { struct in class:SkChunkAlloc 21 Block* fNext; 30 static void FreeChain(Block* block) { 32 Block* next = block->fNext; 64 Block::FreeChain(fBlock); 72 SkChunkAlloc::Block* SkChunkAlloc::newBlock(size_t bytes, AllocFailType ftype) { 78 Block* block = (Block*)sk_malloc_flags(sizeof(Block) + size, 99 Block* bloc [all...] |
/external/skia/src/gpu/ |
H A D | GrAllocPool.cpp | 14 struct GrAllocPool::Block { struct in class:GrAllocPool 15 Block* fNext; 20 static Block* Create(size_t size, Block* next) { 23 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); 25 block->fPtr = (char*)block + sizeof(Block); 69 Block* block = fBlock; 71 Block* nex [all...] |
/external/chromium_org/base/test/ |
H A D | test_support_android.cc | 52 void Block() { function in class:__anon4004::Waitable 94 Waitable::GetInstance()->Block();
|
/external/chromium_org/gpu/command_buffer/client/ |
H A D | ring_buffer.h | 72 struct Block { struct in class:gpu::RingBuffer 73 Block(Offset _offset, unsigned int _size, State _state) function in struct:gpu::RingBuffer::Block 85 typedef std::deque<Block> Container;
|
H A D | fenced_allocator.h | 98 struct Block { struct in class:gpu::FencedAllocator 108 bool operator() (const Block &left, const Block &right) { 113 typedef std::vector<Block> Container;
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-alloc.cc | 178 class Block { class 180 Block(Address base_arg, int size_arg) function in class:Block 195 List<Block> blocks(1000); 212 blocks.Add(Block(base, static_cast<int>(allocated)));
|
/external/llvm/lib/CodeGen/ |
H A D | BranchFolding.h | 35 MachineBasicBlock *Block; member in class:llvm::BranchFolder::MergePotentialsElt 38 : Hash(h), Block(b) {} 41 MachineBasicBlock *getBlock() const { return Block; } 44 Block = MBB;
|
/external/llvm/tools/lli/ |
H A D | RecordingMemoryManager.cpp | 35 sys::MemoryBlock Block = allocateSection(Size); local 36 AllocatedCodeMem.push_back(Allocation(Block, Alignment)); 37 return (uint8_t*)Block.base(); 47 sys::MemoryBlock Block = allocateSection(Size); local 48 AllocatedDataMem.push_back(Allocation(Block, Alignment)); 49 return (uint8_t*)Block.base();
|
/external/chromium/chrome/browser/ui/webui/ |
H A D | collected_cookies_ui_delegate.cc | 205 web_ui_->RegisterMessageCallback("Block", 206 NewCallback(this, &CollectedCookiesUIDelegate::Block)); 252 void CollectedCookiesUIDelegate::Block(const ListValue* args) { function in class:CollectedCookiesUIDelegate
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkWriter32.h | 66 Block* block = fTail; 211 struct Block { struct in class:SkWriter32 212 Block* fNext; 242 static Block* Create(size_t size) { 244 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); 252 Block* initFromStorage(void* storage, size_t size) { 255 Block* block = this; 265 MIN_BLOCKSIZE = sizeof(SkWriter32::Block) [all...] |
/external/clang/lib/Analysis/ |
H A D | BodyFarm.cpp | 177 const ParmVarDecl *Block = D->getParamDecl(1); local 178 QualType Ty = Block->getType(); 195 DeclRefExpr *DR = M.makeDeclRefExpr(Block);
|
H A D | ReachableCode.cpp | 48 bool isDeadCodeRoot(const CFGBlock *Block); 50 const Stmt *findDeadCode(const CFGBlock *Block); 65 bool DeadCodeScan::isDeadCodeRoot(const clang::CFGBlock *Block) { argument 68 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), 69 E = Block->pred_end(); I != E; ++I) { 96 const Stmt *DeadCodeScan::findDeadCode(const clang::CFGBlock *Block) { argument 97 for (CFGBlock::const_iterator I = Block->begin(), E = Block->end(); I!=E; ++I) 104 if (CFGTerminator T = Block->getTerminator()) { 126 const CFGBlock *Block local [all...] |
/external/clang/lib/CodeGen/ |
H A D | CGCleanup.h | 151 llvm::BasicBlock *Block; member in struct:clang::CodeGen::EHCatchScope::Handler 182 void setCatchAllHandler(unsigned I, llvm::BasicBlock *Block) { argument 183 setHandler(I, /*catchall*/ 0, Block); 186 void setHandler(unsigned I, llvm::Value *Type, llvm::BasicBlock *Block) { argument 189 getHandlers()[I].Block = Block; 333 llvm::BasicBlock *Block) { 335 if (ExtInfo.Branches.insert(Block)) 336 ExtInfo.BranchAfters.push_back(std::make_pair(Block, Index)); 369 bool addBranchThrough(llvm::BasicBlock *Block) { [all...] |