/external/skia/src/core/ |
H A D | SkTLList.h | 21 the list creates the objects and they are deleted upon removal. This class block-allocates 37 Block* fBlock; // owning block. 58 Block* block = node->fBlock; local 60 if (0 == --block->fNodesInUse) { 62 block->fNodes[i].~Node(); 64 sk_free(block); 250 Block* block = reinterpret_cast<Block*>(sk_malloc_flags(this->blockSize(), 0)); local 251 node = &block->fNodes[0]; 253 node->fBlock = block; 254 block 270 Block* block = node->fBlock; local 296 Block* block = freeNode->fBlock; local 317 Block* block = activeNode->fBlock; local [all...] |
H A D | SkTObjectPool.h | 84 * The type for a new block of entries for the list. 95 * a new block of them. 100 Block* block = SkNEW(Block); local 101 fBlocks.push(block); 103 fAvailable.push(&block->entries[index]);
|
/external/skia/src/gpu/ |
H A D | GrAllocPool.cpp | 23 Block* block = (Block*)sk_malloc_throw(sizeof(Block) + size); local 24 block->fNext = next; 25 block->fPtr = (char*)block + sizeof(Block); 26 block->fBytesFree = size; 27 block->fBytesTotal = size; 28 return block; 69 Block* block = fBlock; local 70 while (block) { 71 Block* next = block 107 Block* block = fBlock; local [all...] |
H A D | GrBufferAllocPool.cpp | 108 BufferBlock& block = fBlocks.back(); local 109 if (block.fBuffer->isMapped()) { 110 block.fBuffer->unmap(); 112 size_t flushSize = block.fBuffer->gpuMemorySize() - block.fBytesFree; 233 BufferBlock& block = fBlocks.back(); local 234 size_t bytesUsed = block.fBuffer->gpuMemorySize() - block.fBytesFree; 240 if (block.fBuffer->isMapped()) { 241 block 266 BufferBlock& block = fBlocks.push_back(); local 330 BufferBlock& block = fBlocks.back(); local [all...] |
H A D | GrMemoryPool.cpp | 46 BlockHeader* block = CreateBlock(blockSize); local 48 block->fPrev = fTail; 49 block->fNext = NULL; 51 fTail->fNext = block; 52 fTail = block; 56 // We stash a pointer to the block header, just before the allocated space, 72 BlockHeader* block = *reinterpret_cast<BlockHeader**>(ptr); local 73 if (1 == block->fLiveCount) { 74 // the head block is special, it is reset rather than deleted 75 if (fHead == block) { 106 BlockHeader* block = local 117 DeleteBlock(BlockHeader* block) argument 123 BlockHeader* block = fHead; local [all...] |
H A D | GrMemoryPool.h | 51 static void DeleteBlock(BlockHeader* block); 59 ///< block. 62 size_t fFreeSize; ///< amount of free space left in the block.
|
/external/skia/src/gpu/effects/ |
H A D | GrTextureDomain.cpp | 79 // Add a block since we're going to declare variables. 80 GrGLShaderBuilder::FSBlock block(builder); 86 // may require a gradient calculation inside a conditional block
|
/external/skia/src/pipe/ |
H A D | SkGPipeWrite.cpp | 441 fBlockSize = 0; // need first block from controller 484 void* block = fController->requestBlock(needed, &fBlockSize); local 485 if (NULL == block) { 491 fWriter.reset(block, fBlockSize); 1030 // force a new block to be requested for the next recorded command
|
/external/skia/src/pipe/utils/ |
H A D | SamplePipeControllers.h | 75 PipeBlock(void* block, size_t bytes) { fBlock = block, fBytes = bytes; } argument
|
/external/skia/src/utils/ |
H A D | SkDeferredCanvas.cpp | 76 PipeBlock(void* block, size_t size) { fBlock = block, fSize = size; } argument 103 // Save the previous block for later
|
H A D | SkMD5.cpp | 15 /** MD5 basic transformation. Transforms state based on block. */ 16 static void transform(uint32_t state[4], const uint8_t block[64]); 120 static void transform(uint32_t state[4], const uint8_t block[64]) { argument 124 const uint32_t* X = decode(storage, block);
|
H A D | SkSHA1.cpp | 15 /** SHA1 basic transformation. Transforms state based on block. */ 16 static void transform(uint32_t state[5], const uint8_t block[64]); 123 static void transform(uint32_t state[5], const uint8_t block[64]) { argument 139 W[i] = (((uint32_t)block[j ]) << 24) | 140 (((uint32_t)block[j+1]) << 16) | 141 (((uint32_t)block[j+2]) << 8) | 142 (((uint32_t)block[j+3]) );
|
H A D | SkTextureCompressor.cpp | 78 // Compress a block by using the bounding box of the pixels. It is assumed that 79 // there are no extremal pixels in this block otherwise we would have used 120 // Compress a block by using the bounding box of the pixels without taking into 177 // Compress LATC block. Each 4x4 block of pixels is decompressed by LATC from two 207 // easy again: place the pixels in the block header, and assign the indices 258 uint8_t block[16]; local 262 // Load block 265 memcpy(block + k*kBS, src + k*rowBytes + (kBS * x), kBS); 269 *encPtr = compress_block(block); [all...] |
/external/skia/third_party/etc1/ |
H A D | etc1.cpp | 29 The number of bits that represent a 4x4 texel block is 64 bits if 32 The data for a block is a number of bytes, 37 the highest. The 64 bits specifying the block is then represented 528 etc1_byte block[ETC1_DECODED_BLOCK_SIZE]; local 547 etc1_byte* q = block + (cy * 4) * 3; 561 etc1_encode_block(block, mask, encoded); 582 etc1_byte block[ETC1_DECODED_BLOCK_SIZE]; local 597 etc1_decode_block(pIn, block); 600 const etc1_byte* q = block + (cy * 4) * 3;
|
/external/skia/tools/copyright/ |
H A D | fileparser.py | 32 """Given a list of comment block strings, return the one that seems 33 like the most likely copyright block. 36 a comment block that contains copyright info.""" 39 for block in comment_blocks: 40 if self._copyright_pattern.search(block): 41 return block 44 """Given a comment block, return a tuple of attributes: (year, holder). 82 """Returns a copyright block suitable for this language, with the
|
/external/sepolicy/ |
H A D | file_contexts | 42 /dev/block(/.*)? u:object_r:block_device:s0 43 /dev/block/loop[0-9]* u:object_r:loop_device:s0 44 /dev/block/ram[0-9]* u:object_r:ram_device:s0
|
/external/skia/experimental/FileReaderApp/ |
H A D | ReaderView.cpp | 51 void* block = sk_malloc_throw(toBeRead); local 52 fread(block, 1, toBeRead, f); 55 SkGPipeReader::Status fStatus = reader.playback(block, toBeRead, &bytesRead); 67 sk_free(block);
|
/external/skia/experimental/webtry/res/css/cm/ |
H A D | codemirror.css | 60 .cm-tab { display: inline-block; } 174 display: inline-block;
|
/external/skia/gm/rebaseline_server/static/ |
H A D | view.css | 14 display: inline-block; 41 display: inline-block;
|
/external/skia/include/core/ |
H A D | SkDeque.h | 19 * beginning/end of the list as necessary while each block tracks the used 22 * empty block from the beginning/end of the list (Presumably so push/pop pairs 23 * on the block boundaries don't cause thrashing). This can result in the first/ 24 * last element not residing in the first/last block. 30 * allocCount specifies how many elements are to be allocated as a block 126 int fAllocCount; // number of elements to allocate per block 129 void freeBlock(Block* block);
|
/external/regex-re2/util/ |
H A D | arena.cc | 50 // We do not know for sure whether or not the first block is aligned, 72 AllocatedBlock *block; local 73 // Find the next block. 76 block = &first_blocks_[blocks_alloced_++]; 79 // Adds another block to the vector. 81 // block points to the last block of the vector. 82 block = &overflow_blocks_->back(); 85 block->mem = reinterpret_cast<char*>(malloc(block_size)); 86 block 129 AllocatedBlock *block = AllocNewBlock(block_size_); local [all...] |
/external/robolectric/lib/main/ |
H A D | android.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/internal/ com/android/internal/util/ ... |
H A D | h2-1.2.147.jar | META-INF/MANIFEST.MF META-INF/services/java.sql.Driver org/h2/api/AggregateFunction ... |
H A D | javassist-3.14.0-GA.jar | META-INF/ META-INF/MANIFEST.MF javassist/ javassist/bytecode/ javassist/bytecode/analysis/ javassist/bytecode/annotation/ javassist/ ... |
/external/robolectric/lib/test/ |
H A D | mockito-core-1.8.5.jar | META-INF/ META-INF/MANIFEST.MF org/ org/mockito/ org/mockito/asm/ org/mockito/asm/signature/ ... |