| /art/runtime/ |
| signal_set.h | 40 void Block() {
|
| /external/chromium_org/chrome/browser/android/banners/ |
| app_banner_settings_helper.cc | 79 void AppBannerSettingsHelper::Block(content::WebContents* web_contents,
|
| /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/chromium_org/third_party/skia/src/core/ |
| SkTObjectPool.h | 84 * The type for a new block of entries for the list.
86 struct Block {
88 SK_DECLARE_INTERNAL_SLIST_INTERFACE(Block);
90 SkTInternalSList<Block> fBlocks;
95 * a new block of them.
100 Block* block = SkNEW(Block); local
101 fBlocks.push(block);
103 fAvailable.push(&block->entries[index])
[all...] |
| 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/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
| Block.java | 20 public class Block
26 public Block(CodeEmitter e) {
|
| /external/skia/src/core/ |
| SkTObjectPool.h | 84 * The type for a new block of entries for the list.
86 struct Block {
88 SK_DECLARE_INTERNAL_SLIST_INTERFACE(Block);
90 SkTInternalSList<Block> fBlocks;
95 * a new block of them.
100 Block* block = SkNEW(Block); local
101 fBlocks.push(block);
103 fAvailable.push(&block->entries[index])
[all...] |
| 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...] |
| /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/valgrind/main/none/tests/x86/ |
| 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)); \
|
| /external/chromium_org/third_party/WebKit/Source/platform/heap/ |
| CallbackStack.cpp | 12 class CallbackStack::Block {
14 explicit Block(Block* next)
22 ~Block()
34 Block* next() const { return m_next; }
35 void setNext(Block* next) { m_next = next; }
112 Block* m_next;
115 CallbackStack::CallbackStack() : m_first(new Block(0)), m_last(m_first)
129 Block* next;
130 for (Block* current = m_first->next(); current; current = next)
[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
50 struct Block {
51 Block() : size(-1), position(-1) {}
52 Block(int size_, int position_) : size(size_), position(position_) {}
63 // Column or row block id as the case maybe.
73 Block block; member in struct:ceres::internal::CompressedList
81 vector<Block> cols
[all...] |
| /external/lldb/include/lldb/Symbol/ |
| Block.h | 1 //===-- Block.h -------------------------------------------------*- C++ -*-===//
24 /// @class Block Block.h "lldb/Symbol/Block.h"
25 /// @brief A class that describes a single lexical block.
28 /// Block objects. The BlockList object contains a section offset
29 /// address range, and Block objects contain one or more ranges
31 /// ranges within the BlockList adress range, and each block can
34 /// Each block has a variable list that represents local, argument, and
35 /// static variables that are scoped to the block
[all...] |
| /external/chromium_org/base/test/ |
| test_support_android.cc | 52 void Block() {
94 Waitable::GetInstance()->Block();
|
| /external/chromium_org/gpu/command_buffer/client/ |
| ring_buffer.h | 38 // Allocates a block of memory. If the buffer is out of directly available
43 // size: the size of the memory block to allocate.
46 // the pointer to the allocated memory block.
49 // Frees a block of memory, pending the passage of a token. That memory won't
53 // pointer: the pointer to the memory block to free.
57 // Gets the size of the largest free block that is available without waiting.
60 // Gets the size of the largest free block that can be allocated if the
61 // caller can wait. Allocating a block of this size will succeed, but may
62 // block.
67 // Gets a pointer to a memory block given the base memory and the offset
[all...] |
| fenced_allocator.h | 23 // block of memory (storing the book-keeping externally). Furthermore this
46 // Allocates a block of memory. If the buffer is out of directly available
51 // size: the size of the memory block to allocate.
54 // the offset of the allocated memory block, or kInvalidOffset if out of
58 // Frees a block of memory.
61 // offset: the offset of the memory block to free.
64 // Frees a block of memory, pending the passage of a token. That memory won't
68 // offset: the offset of the memory block to free.
75 // Gets the size of the largest free block that is available without waiting.
78 // Gets the size of the largest free block that can be allocated if th
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrAllocPool.cpp | 14 struct GrAllocPool::Block {
15 Block* fNext;
20 static Block* Create(size_t size, Block* next) {
23 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local
24 block->fNext = next;
25 block->fPtr = (char*)block + sizeof(Block)
69 Block* block = fBlock; local
107 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/lib/IR/ |
| GCOV.cpp | 133 errs() << "Block tag not found.\n";
139 if (!Buff.readInt(Dummy)) return false; // Block flags;
151 errs() << "Unexpected block number: " << BlockNo << " (in " << Name
173 // Read the block number this table is associated with.
176 errs() << "Unexpected block number: " << BlockNo << " (in " << Name
180 GCOVBlock &Block = *Blocks[BlockNo];
191 errs() << "Multiple sources for a single basic block: " << Filename
201 Block.addLine(Line);
262 // This for loop adds the counts for each block. A second nested loop is
265 // The last block is always reserved for exit bloc
[all...] |
| /external/skia/src/gpu/ |
| GrAllocPool.cpp | 14 struct GrAllocPool::Block {
15 Block* fNext;
20 static Block* Create(size_t size, Block* next) {
23 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local
24 block->fNext = next;
25 block->fPtr = (char*)block + sizeof(Block)
69 Block* block = fBlock; local
107 Block* block = fBlock; local
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-alloc.cc | 172 // using a pseudorandom generator to choose block sizes geometrically
186 // Plain old data class. Represents a block of allocated memory.
187 class Block {
189 Block(Address base_arg, int size_arg)
204 List< ::Block> blocks(1000);
208 // Allocate a block.
221 blocks.Add(::Block(base, static_cast<int>(allocated)));
225 // Free a block.
|
