HomeSort by relevance Sort by last modified time
    Searched refs:newBlock (Results 1 - 25 of 40) sorted by null

1 2

  /frameworks/base/libs/hwui/font/
CacheTexture.cpp 37 CacheBlock* CacheBlock::insertBlock(CacheBlock* head, CacheBlock* newBlock) {
40 newBlock, newBlock->mX, newBlock->mY,
41 newBlock->mWidth, newBlock->mHeight);
48 if (newBlock->mWidth < currBlock->mWidth) {
49 newBlock->mNext = currBlock;
50 newBlock->mPrev = prevBlock;
51 currBlock->mPrev = newBlock;
    [all...]
CacheTexture.h 61 static CacheBlock* insertBlock(CacheBlock* head, CacheBlock* newBlock);
  /external/chromium_org/third_party/skia/include/core/
SkChunkAlloc.h 65 Block* newBlock(size_t bytes, AllocFailType ftype);
  /external/skia/include/core/
SkChunkAlloc.h 65 Block* newBlock(size_t bytes, AllocFailType ftype);
  /external/chromium_org/third_party/icu/source/tools/makeconv/
genmbcs.c 566 uint32_t blockSize, newTop, i, nextOffset, newBlock, min;
591 newBlock=mbcsData->stage2Top;
593 min=newBlock-nextOffset; /* minimum block start with overlap */
594 while(min<newBlock && mbcsData->stage2Single[newBlock-1]==0) {
595 --newBlock;
598 newTop=newBlock+MBCS_STAGE_2_BLOCK_SIZE;
609 mbcsData->stage1[idx]=(uint16_t)newBlock;
625 newBlock=mbcsData->stage3Top;
627 min=newBlock-nextOffset; /* minimum block start with overlap *
    [all...]
gencnvex.c 821 int32_t i1, i2, i3, i3b, nextOffset, min, newBlock;
841 newBlock=extData->stage2Top;
842 min=newBlock-nextOffset; /* minimum block start with overlap */
843 while(min<newBlock && extData->stage2[newBlock-1]==0) {
844 --newBlock;
847 extData->stage1[i1]=(uint16_t)newBlock;
848 extData->stage2Top=newBlock+MBCS_STAGE_2_BLOCK_SIZE;
860 newBlock=extData->stage3Top;
861 min=newBlock-nextOffset; /* minimum block start with overlap *
    [all...]
  /external/icu4c/tools/makeconv/
genmbcs.cpp 566 uint32_t blockSize, newTop, i, nextOffset, newBlock, min;
591 newBlock=mbcsData->stage2Top;
593 min=newBlock-nextOffset; /* minimum block start with overlap */
594 while(min<newBlock && mbcsData->stage2Single[newBlock-1]==0) {
595 --newBlock;
598 newTop=newBlock+MBCS_STAGE_2_BLOCK_SIZE;
609 mbcsData->stage1[idx]=(uint16_t)newBlock;
625 newBlock=mbcsData->stage3Top;
627 min=newBlock-nextOffset; /* minimum block start with overlap *
    [all...]
gencnvex.c 824 int32_t i1, i2, i3, i3b, nextOffset, min, newBlock;
844 newBlock=extData->stage2Top;
845 min=newBlock-nextOffset; /* minimum block start with overlap */
846 while(min<newBlock && extData->stage2[newBlock-1]==0) {
847 --newBlock;
850 extData->stage1[i1]=(uint16_t)newBlock;
851 extData->stage2Top=newBlock+MBCS_STAGE_2_BLOCK_SIZE;
863 newBlock=extData->stage3Top;
864 min=newBlock-nextOffset; /* minimum block start with overlap *
    [all...]
  /dalvik/vm/analysis/
VfyBasicBlock.cpp 74 VfyBasicBlock* newBlock = (VfyBasicBlock*) calloc(1, sizeof(VfyBasicBlock));
75 if (newBlock == NULL)
86 newBlock->predecessors = dvmPointerSetAlloc(32);
87 if (newBlock->predecessors == NULL) {
88 free(newBlock);
92 newBlock->firstAddr = (u4) -1; // DEBUG
94 newBlock->liveRegs = dvmAllocBitVector(vdata->insnRegCount, false);
95 if (newBlock->liveRegs == NULL) {
96 dvmPointerSetFree(newBlock->predecessors);
97 free(newBlock);
    [all...]
  /external/chromium_org/third_party/skia/src/core/
SkChunkAlloc.cpp 72 SkChunkAlloc::Block* SkChunkAlloc::newBlock(size_t bytes, AllocFailType ftype) {
102 block = this->newBlock(bytes, ftype);
SkDeque.cpp 230 Block* newBlock = (Block*)sk_malloc_throw(sizeof(Block) + allocCount * fElemSize);
231 newBlock->init(sizeof(Block) + allocCount * fElemSize);
232 return newBlock;
  /external/skia/src/core/
SkChunkAlloc.cpp 72 SkChunkAlloc::Block* SkChunkAlloc::newBlock(size_t bytes, AllocFailType ftype) {
102 block = this->newBlock(bytes, ftype);
SkDeque.cpp 230 Block* newBlock = (Block*)sk_malloc_throw(sizeof(Block) + allocCount * fElemSize);
231 newBlock->init(sizeof(Block) + allocCount * fElemSize);
232 return newBlock;
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/
pycodegen.py 241 self.newBlock = self.graph.newBlock
414 end = self.newBlock()
423 nextTest = self.newBlock()
436 loop = self.newBlock()
437 else_ = self.newBlock()
439 after = self.newBlock()
461 start = self.newBlock()
462 anchor = self.newBlock()
463 after = self.newBlock()
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/
pycodegen.py 241 self.newBlock = self.graph.newBlock
414 end = self.newBlock()
423 nextTest = self.newBlock()
436 loop = self.newBlock()
437 else_ = self.newBlock()
439 after = self.newBlock()
461 start = self.newBlock()
462 anchor = self.newBlock()
463 after = self.newBlock()
    [all...]
  /external/chromium_org/third_party/icu/source/common/
utrie2_builder.c 475 int32_t newBlock, newTop;
477 newBlock=trie->index2Length;
478 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH;
488 uprv_memcpy(trie->index2+newBlock, trie->index2+trie->index2NullOffset, UTRIE2_INDEX_2_BLOCK_LENGTH*4);
489 return newBlock;
514 int32_t newBlock, newTop;
518 newBlock=trie->firstFreeBlock;
519 trie->firstFreeBlock=-trie->map[newBlock>>UTRIE2_SHIFT_2];
522 newBlock=trie->dataLength;
523 newTop=newBlock+UTRIE2_DATA_BLOCK_LENGTH
    [all...]
utrie.c 175 int32_t newBlock, newTop;
177 newBlock=trie->dataLength;
178 newTop=newBlock+UTRIE_DATA_BLOCK_LENGTH;
184 return newBlock;
195 int32_t indexValue, newBlock;
204 newBlock=utrie_allocDataBlock(trie);
205 if(newBlock<0) {
209 trie->index[c]=newBlock;
212 uprv_memcpy(trie->data+newBlock, trie->data-indexValue, 4*UTRIE_DATA_BLOCK_LENGTH);
213 return newBlock;
    [all...]
  /external/icu4c/common/
utrie2_builder.cpp 475 int32_t newBlock, newTop;
477 newBlock=trie->index2Length;
478 newTop=newBlock+UTRIE2_INDEX_2_BLOCK_LENGTH;
488 uprv_memcpy(trie->index2+newBlock, trie->index2+trie->index2NullOffset, UTRIE2_INDEX_2_BLOCK_LENGTH*4);
489 return newBlock;
514 int32_t newBlock, newTop;
518 newBlock=trie->firstFreeBlock;
519 trie->firstFreeBlock=-trie->map[newBlock>>UTRIE2_SHIFT_2];
522 newBlock=trie->dataLength;
523 newTop=newBlock+UTRIE2_DATA_BLOCK_LENGTH
    [all...]
utrie.cpp 175 int32_t newBlock, newTop;
177 newBlock=trie->dataLength;
178 newTop=newBlock+UTRIE_DATA_BLOCK_LENGTH;
184 return newBlock;
195 int32_t indexValue, newBlock;
204 newBlock=utrie_allocDataBlock(trie);
205 if(newBlock<0) {
209 trie->index[c]=newBlock;
212 uprv_memcpy(trie->data+newBlock, trie->data-indexValue, 4*UTRIE_DATA_BLOCK_LENGTH);
213 return newBlock;
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderRuby.cpp 88 RenderBlockFlow* newBlock = RenderBlockFlow::createAnonymous(&ruby->document());
89 newBlock->setStyle(newStyle.release());
90 return newBlock;
  /frameworks/base/core/jni/
android_util_AssetManager.cpp     [all...]
  /external/chromium_org/third_party/WebKit/Source/core/editing/
CompositeEditCommand.cpp     [all...]
  /dalvik/dx/src/com/android/dx/ssa/
SsaMethod.java 239 SsaBasicBlock newBlock = new SsaBasicBlock(newIndex, maxLabel++, this);
241 newBlock.getInsns().add(getGoto(newBlock));
242 blocks.add(newBlock);
244 return newBlock;
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
SsaMethod.java 240 SsaBasicBlock newBlock = new SsaBasicBlock(newIndex, maxLabel++, this);
242 newBlock.getInsns().add(getGoto(newBlock));
243 blocks.add(newBlock);
245 return newBlock;
  /frameworks/native/cmds/installd/
utils.c 407 int8_t* newBlock = malloc(CACHE_BLOCK_SIZE);
408 if (newBlock == NULL) {
411 CACHE_NOISY(ALOGI("Allocated new cache mem block: %p", newBlock));
412 *(void**)newBlock = cache->memBlocks;
413 cache->memBlocks = newBlock;
414 res = cache->curMemBlockAvail = newBlock + sizeof(void*);
415 cache->curMemBlockEnd = newBlock + CACHE_BLOCK_SIZE;

Completed in 6900 milliseconds

1 2