| /external/skia/include/core/ |
| SkChunkAlloc.h | 50 success, the number of bytes freed is returned, or 0 if the block could
60 struct Block;
61 Block* fBlock;
63 Block* fPool;
66 Block* newBlock(size_t bytes, AllocFailType ftype);
|
| SkWriter32.h | 74 // if we could query how much is avail in the current block, we might
76 // in the current block
105 struct Block;
106 Block* fHead;
107 Block* fTail;
109 Block* newBlock(size_t bytes);
|
| SkStream.h | 293 struct Block;
294 Block* fHead;
295 Block* fTail;
|
| /external/skia/src/core/ |
| SkChunkAlloc.cpp | 20 struct SkChunkAlloc::Block {
21 Block* fNext;
31 Block* block = this; local
32 while (block) {
33 Block* next = block->fNext;
34 sk_free(block);
35 block = next;
39 Block* tail()
40 Block* block = this; local
81 Block* block = fPool; local
106 Block* block = fBlock; local
127 Block* block = fBlock; local
[all...] |
| SkWriter32.cpp | 3 struct SkWriter32::Block {
4 Block* fNext;
29 static Block* Create(size_t size)
32 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local
33 block->fNext = NULL;
34 block->fSize = size;
35 block->fAllocated = 0
49 Block* block = fHead; local
64 Block* block = fTail; local
88 Block* block = fHead; local
102 const Block* block = fHead; local
152 const Block* block = fHead; local
[all...] |
| SkStream.cpp | 33 // override in subclass if you represent a memory block
555 struct SkDynamicMemoryWStream::Block {
556 Block* fNext;
600 Block* block = fHead; local
602 while (block != NULL) {
603 Block* next = block->fNext;
604 sk_free(block);
605 block = next
634 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local
691 Block* block = fHead; local
[all...] |
| /external/stlport/test/eh/ |
| nc_alloc.cpp | 118 if (s <= sizeof(Block)) {
131 Block* b = (Block*)p;
139 struct Block;
140 friend struct Block;
151 struct Block {
153 Block *next;
159 static Block* mBlocks;
160 static Block *mFree;
164 FastAllocator::Block *FastAllocator::mBlocks
[all...] |
| /frameworks/base/media/libstagefright/matroska/ |
| mkvparser.hpp | 58 class Block
60 Block(const Block&);
61 Block& operator=(const Block&);
67 Block(long long start, long long size, IMkvReader*);
99 virtual const Block* GetBlock() const = 0;
119 const Block* GetBlock() const;
125 Block m_block;
142 const Block* GetBlock() const
[all...] |
| mkvparser.cpp | [all...] |
| MatroskaExtractor.cpp | 133 const mkvparser::Block *block() const;
249 while (!eos() && block()->GetTrackNumber() != mTrackNum) {
258 while (!eos() && block()->GetTrackNumber() != mTrackNum) {
267 const mkvparser::Block *BlockIterator::block() const { function in class:android::BlockIterator
293 const mkvparser::Block *block = mBlockIter.block(); local
294 size_t size = block->GetSize()
[all...] |
| /external/blktrace/ |
| btrace.spec | 20 Summary: Block IO tracer
25 btrace can show detailed info about what is happening on a block
27 performance or application problems relating to block layer io.
|
| /external/v8/test/cctest/ |
| test-alloc.cc | 158 // using a pseudorandom generator to choose block sizes geometrically
172 // Plain old data class. Represents a block of allocated memory.
173 class Block {
175 Block(void* base_arg, int size_arg)
188 List<Block> blocks(1000);
192 // Allocate a block.
198 blocks.Add(Block(base, static_cast<int>(allocated)));
202 // Free a block.
|
| /external/chromium/net/proxy/ |
| single_threaded_proxy_resolver_unittest.cc | 94 // A mock synchronous ProxyResolver which can be set to block upon reaching
104 void Block() {
230 // Block the proxy resolver, so no request can complete.
231 mock->Block();
299 // Block the proxy resolver, so no request can complete.
300 mock->Block();
354 // Block the proxy resolver, so no request can complete.
355 mock->Block();
|
| /sdk/traceview/src/com/android/traceview/ |
| Call.java | 21 class Call implements TimeLineView.Block {
|
| TimeLineView.java | 112 public static interface Block {
129 Block block; field in class:TimeLineView.Record
131 public Record(Row row, Block block) {
133 this.block = block;
359 System.out.printf("row '%s' block '%s' [%d, %d]\n", r.row // $NON-NLS-1$
360 .getName(), r.block.getName(), r.block.getStartTime()
402 Block block = rec.block; local
1255 Block block = segment.mBlock; local
[all...] |
| /external/v8/src/ |
| ast.h | 56 V(Block) \
284 class Block: public BreakableStatement {
286 Block(ZoneStringList* labels, int capacity, bool is_initializer_block)
655 explicit TryStatement(Block* try_block)
662 Block* try_block() const { return try_block_; }
666 Block* try_block_;
673 TryCatchStatement(Block* try_block,
675 Block* catch_block)
684 Block* catch_block() const { return catch_block_; }
688 Block* catch_block_
[all...] |
| parser.cc | 119 // be treated as an initialization block. Benchmarks show that
166 Block* ParseBlock(ZoneStringList* labels, bool* ok);
167 Block* ParseVariableStatement(bool* ok);
168 Block* ParseVariableDeclarations(bool accept_IN, Expression** var, bool* ok);
175 Block* WithHelper(Expression* obj,
2069 Block* block = NEW(Block(NULL, 1, true)); local
[all...] |
| data-flow.cc | 54 void AstLabeler::VisitBlock(Block* stmt) {
346 void LivenessAnalyzer::VisitBlock(Block* stmt) {
|
| /external/dbus/test/ |
| decode-gcov.c | 294 printf ("End of block\n");
386 printf (" Block has %ld arcs\n", n_arcs_in_block);
404 printf (" Arc has destination block %ld flags 0x%lx\n",
607 typedef struct Block Block;
625 struct Block
642 Block *block_graph;
806 func->block_graph = dbus_new0 (Block, n_blocks_in_func);
1119 Block *block_graph;
1129 /* For every block in the file
1384 int block; local
[all...] |
| /external/emma/core/java12/com/vladium/emma/instr/ |
| InstrVisitor.java | 365 // create block count map: TODO: is the extra slot really needed?
451 if ($assert.ENABLED) $assert.ASSERT (m_classBlockCounts [m_methodID] > 0, "invalid block count for method " + m_methodID + ": " + m_classBlockCounts [m_methodID]);
452 if ($assert.ENABLED) $assert.ASSERT (m_methodBlockSizes != null && m_methodBlockSizes.length == m_classBlockCounts [m_methodID], "invalid block sizes map for method " + m_methodID);
556 final int instrMethodCount = m_classInstrMethodCount; // actual number of methods to instrument may be less than the size of the block map
559 "invalid block count map");
675 if ($assert.ENABLED) $assert.ASSERT (m_classBlockCounts [m_methodID] > 0, "invalid block count for method " + m_methodID + " (" + IClassDefConstants.CLINIT_NAME + "): " + m_classBlockCounts [m_methodID]);
676 if ($assert.ENABLED) $assert.ASSERT (m_methodBlockSizes != null && m_methodBlockSizes.length == m_classBlockCounts [m_methodID], "invalid block sizes map for method " + m_methodID);
735 // determine block leaders [an O(code length) loop]:
978 final Block block = new Block (); local
1038 final Block block = _blocks [l]; local
1087 final Block block = _blocks [l]; local
1137 final Block block = _blocks [l]; local
[all...] |
| /external/libvpx/vp8/common/arm/armv6/ |
| copymem8x4_v6.asm | 17 AREA Block, CODE, READONLY ; name this block of code
|
| copymem8x8_v6.asm | 17 AREA Block, CODE, READONLY ; name this block of code
|
| copymem16x16_v6.asm | 17 AREA Block, CODE, READONLY ; name this block of code
|
| /external/zlib/contrib/delphi/ |
| ZLib.pas | 20 TFree = procedure (AppData, Block: Pointer); cdecl;
112 compressed data is exhausted and the next block is read from the input stream.
223 procedure _free(Block: Pointer); cdecl;
225 FreeMem(Block);
260 procedure zlibFreeMem(AppData, Block: Pointer); cdecl;
262 FreeMem(Block);
|
| /external/v8/src/mips/ |
| codegen-mips.cc | 94 void CodeGenerator::VisitBlock(Block* node) {
|
