| /art/runtime/ |
| signal_set.h | 40 void Block() {
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| block.h | 17 class Block {
19 // Initialize the block with the specified contents.
20 explicit Block(const BlockContents& contents);
22 ~Block();
33 bool owned_; // Block owns data_[]
36 Block(const Block&);
37 void operator=(const Block&);
|
| block.cc | 7 #include "table/block.h"
18 inline uint32_t Block::NumRestarts() const {
23 Block::Block(const BlockContents& contents)
40 Block::~Block() {
46 // Helper routine: decode the next block entry starting at "p",
76 class Block::Iter : public Iterator {
79 const char* const data_; // underlying block contents
85 uint32_t restart_index_; // Index of restart block in which current_ fall
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| StreamBuffer.h | 41 typedef Vector<T> Block;
63 m_buffer.append(adoptPtr(new Block));
71 // This function consume data in the fist block.
110 Deque<OwnPtr<Block> > m_buffer;
|
| /external/valgrind/main/none/tests/amd64/ |
| movbe.c | 13 typedef struct { UChar cs[40]; } Block;
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)); \
|
| avx-1.c | 16 typedef struct { YMM a1; YMM a2; YMM a3; YMM a4; ULong u64; } Block;
28 void showBlock ( char* msg, Block* block )
31 printf(" "); showYMM(&block->a1); printf("\n");
32 printf(" "); showYMM(&block->a2); printf("\n");
33 printf(" "); showYMM(&block->a3); printf("\n");
34 printf(" "); showYMM(&block->a4); printf("\n");
35 printf(" %016llx\n", block->u64);
45 void randBlock ( Block* b )
49 for (i = 0; i < sizeof(Block); i++
[all...] |
| /external/ceres-solver/internal/ceres/ |
| block_structure.h | 31 // Block structure objects are used to carry information about the
32 // dense block structure of sparse matrices. The BlockSparseMatrix
35 // friendly block oriented linear algebra operations on the matrix
52 struct Block {
53 Block() : size(-1), position(-1) {}
54 Block(int size_, int position_) : size(size_), position(position_) {}
65 // Column or row block id as the case maybe.
75 Block block; member in struct:ceres::internal::CompressedList
83 vector<Block> cols
[all...] |
| /external/chromium_org/base/test/ |
| test_support_android.cc | 52 void Block() {
94 Waitable::GetInstance()->Block();
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkChunkAlloc.cpp | 20 struct SkChunkAlloc::Block {
21 Block* fNext;
30 static void FreeChain(Block* block) {
31 while (block) {
32 Block* next = block->fNext;
33 sk_free(block);
34 block = next;
64 Block::FreeChain(fBlock)
78 Block* block = (Block*)sk_malloc_flags(sizeof(Block) + size, local
99 Block* block = fBlock; local
120 Block* block = fBlock; local
134 const Block* block = fBlock; local
[all...] |
| SkDeque.cpp | 12 struct SkDeque::Block {
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* first = fFrontBlock
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrAllocPool.cpp | 15 struct GrAllocPool::Block {
16 Block* fNext;
21 static Block* Create(size_t size, Block* next) {
24 Block* block = (Block*)GrMalloc(sizeof(Block) + size); local
25 block->fNext = next;
26 block->fPtr = (char*)block + sizeof(Block)
70 Block* block = fBlock; local
109 Block* block = fBlock; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.h | 35 MachineBasicBlock *Block;
38 : Hash(h), Block(b) {}
41 MachineBasicBlock *getBlock() const { return Block; }
44 Block = MBB;
|
| /external/llvm/tools/lli/ |
| RecordingMemoryManager.cpp | 35 sys::MemoryBlock Block = allocateSection(Size);
36 AllocatedCodeMem.push_back(Allocation(Block, Alignment));
37 return (uint8_t*)Block.base();
47 sys::MemoryBlock Block = allocateSection(Size);
48 AllocatedDataMem.push_back(Allocation(Block, Alignment));
49 return (uint8_t*)Block.base();
|
| /external/skia/src/core/ |
| SkChunkAlloc.cpp | 20 struct SkChunkAlloc::Block {
21 Block* fNext;
30 static void FreeChain(Block* block) {
31 while (block) {
32 Block* next = block->fNext;
33 sk_free(block);
34 block = next;
64 Block::FreeChain(fBlock)
78 Block* block = (Block*)sk_malloc_flags(sizeof(Block) + size, local
99 Block* block = fBlock; local
120 Block* block = fBlock; local
134 const Block* block = fBlock; local
[all...] |
| SkDeque.cpp | 12 struct SkDeque::Block {
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* first = fFrontBlock
[all...] |
| /external/skia/src/gpu/ |
| GrAllocPool.cpp | 15 struct GrAllocPool::Block {
16 Block* fNext;
21 static Block* Create(size_t size, Block* next) {
24 Block* block = (Block*)GrMalloc(sizeof(Block) + size); local
25 block->fNext = next;
26 block->fPtr = (char*)block + sizeof(Block)
70 Block* block = fBlock; local
109 Block* block = fBlock; local
[all...] |
| /external/chromium/chrome/browser/ui/webui/ |
| collected_cookies_ui_delegate.cc | 205 web_ui_->RegisterMessageCallback("Block",
206 NewCallback(this, &CollectedCookiesUIDelegate::Block));
252 void CollectedCookiesUIDelegate::Block(const ListValue* args) {
|
| /external/chromium_org/gpu/command_buffer/client/ |
| fenced_allocator.h | 20 // block of memory (storing the book-keeping externally). Furthermore this
42 // Allocates a block of memory. If the buffer is out of directly available
47 // size: the size of the memory block to allocate.
50 // the offset of the allocated memory block, or kInvalidOffset if out of
54 // Frees a block of memory.
57 // offset: the offset of the memory block to free.
60 // Frees a block of memory, pending the passage of a token. That memory won't
64 // offset: the offset of the memory block to free.
71 // Gets the size of the largest free block that is available without waiting.
74 // Gets the size of the largest free block that can be allocated if th
[all...] |
| ring_buffer.h | 36 // Allocates a block of memory. If the buffer is out of directly available
41 // size: the size of the memory block to allocate.
44 // the offset of the allocated memory block.
47 // Frees a block of memory, pending the passage of a token. That memory won't
51 // offset: the offset of the memory block to free.
55 // Gets the size of the largest free block that is available without waiting.
58 // Gets the size of the largest free block that can be allocated if the
59 // caller can wait. Allocating a block of this size will succeed, but may
60 // block.
71 // Book-keeping sturcture that describes a block of memory
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-alloc.cc | 162 // using a pseudorandom generator to choose block sizes geometrically
176 // Plain old data class. Represents a block of allocated memory.
177 class Block {
179 Block(Address base_arg, int size_arg)
195 List<Block> blocks(1000);
199 // Allocate a block.
212 blocks.Add(Block(base, static_cast<int>(allocated)));
216 // Free a block.
|
| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 44 void enqueue(const CFGBlock *block);
48 bool isDeadCodeRoot(const CFGBlock *Block);
50 const Stmt *findDeadCode(const CFGBlock *Block);
57 void DeadCodeScan::enqueue(const CFGBlock *block) {
58 unsigned blockID = block->getBlockID();
62 WorkList.push_back(block);
65 bool DeadCodeScan::isDeadCodeRoot(const clang::CFGBlock *Block) {
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) {
170 const CFGBlock *block = I->first; local
318 const CFGBlock *block = *I; local
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.h | 110 void setCachedLandingPad(llvm::BasicBlock *block) {
111 CachedLandingPad = block;
118 void setCachedEHDispatchBlock(llvm::BasicBlock *block) {
119 CachedEHDispatchBlock = block;
123 if (llvm::BasicBlock *block = getCachedEHDispatchBlock())
124 return !block->use_empty();
151 llvm::BasicBlock *Block;
182 void setCatchAllHandler(unsigned I, llvm::BasicBlock *Block) {
183 setHandler(I, /*catchall*/ 0, Block);
186 void setHandler(unsigned I, llvm::Value *Type, llvm::BasicBlock *Block) {
[all...] |
| /external/v8/test/cctest/ |
| test-alloc.cc | 179 // using a pseudorandom generator to choose block sizes geometrically
193 // Plain old data class. Represents a block of allocated memory.
194 class Block {
196 Block(Address base_arg, int size_arg)
212 List<Block> blocks(1000);
216 // Allocate a block.
227 blocks.Add(Block(base, static_cast<int>(allocated)));
231 // Free a block.
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| SerializedGrammar.java | 49 Block block; field in class:SerializedGrammar.Rule
50 public Rule(String name, Block block) {
52 this.block = block;
55 return name+":"+block;
59 class Block {
61 public Block(List[] alts) {
127 Block b = readBlock(in)
[all...] |
| /external/chromium_org/chrome/browser/policy/ |
| url_blacklist_manager.cc | 65 scoped_ptr<URLBlacklist> BuildBlacklist(scoped_ptr<base::ListValue> block,
70 blacklist->Block(block.get());
122 void URLBlacklist::Block(const base::ListValue* filters) {
339 scoped_ptr<base::ListValue> block(
350 base::Passed(&block),
354 void URLBlacklistManager::UpdateOnIO(scoped_ptr<base::ListValue> block,
362 base::Passed(&block),
|
