Searched refs:fNodes (Results 1 - 14 of 14) sorted by relevance
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTLList.h | 62 block->fNodes[i].~Node(); 239 Node fNodes[1]; member in struct:SkTLList::Block 251 node = &block->fNodes[0]; 256 SkNEW_PLACEMENT(block->fNodes + i, Node); 257 fFreeList.addToHead(block->fNodes + i); 258 block->fNodes[i].fBlock = block; 272 if (block->fNodes + i != node) { 273 fFreeList.remove(block->fNodes + i); 275 block->fNodes[i].~Node(); 302 bool free = fFreeList.isInList(block->fNodes [all...] |
H A D | SkPictureStateTree.cpp | 157 if (fNodes.count() == 0) { 182 fNodes.push(ancestor); 203 uint32_t offset = fNodes.top()->fOffset; 204 fCurrentNode = fNodes.top(); 206 fNodes.pop();
|
H A D | SkPictureStateTree.h | 106 SkTDArray<Node*> fNodes; member in class:SkPictureStateTree::Iterator
|
H A D | SkRTree.h | 191 SkChunkAlloc fNodes; member in class:SkRTree
|
H A D | SkRTree.cpp | 34 , fNodes(fNodeSize * 256) 125 fNodes.reset(); 132 Node* out = static_cast<Node*>(fNodes.allocThrow(fNodeSize)); 420 SkASSERT(fNodes.contains(static_cast<void*>(root)));
|
/external/skia/src/core/ |
H A D | SkTLList.h | 62 block->fNodes[i].~Node(); 239 Node fNodes[1]; member in struct:SkTLList::Block 251 node = &block->fNodes[0]; 256 SkNEW_PLACEMENT(block->fNodes + i, Node); 257 fFreeList.addToHead(block->fNodes + i); 258 block->fNodes[i].fBlock = block; 272 if (block->fNodes + i != node) { 273 fFreeList.remove(block->fNodes + i); 275 block->fNodes[i].~Node(); 302 bool free = fFreeList.isInList(block->fNodes [all...] |
H A D | SkPictureStateTree.cpp | 155 if (fNodes.count() == 0) { 180 fNodes.push(ancestor); 201 uint32_t offset = fNodes.top()->fOffset; 202 fCurrentNode = fNodes.top(); 204 fNodes.pop();
|
H A D | SkPictureStateTree.h | 104 SkTDArray<Node*> fNodes; member in class:SkPictureStateTree::Iterator
|
H A D | SkRTree.h | 191 SkChunkAlloc fNodes; member in class:SkRTree
|
H A D | SkRTree.cpp | 34 , fNodes(fNodeSize * 256) 118 fNodes.reset(); 125 Node* out = static_cast<Node*>(fNodes.allocThrow(fNodeSize)); 413 SkASSERT(fNodes.contains(static_cast<void*>(root)));
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | tznames_impl.cpp | 116 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0), 123 fNodes[index].deleteValues(fValueDeleter); 125 uprv_free(fNodes); 138 // Trie is built, while fNodes and fLazyContents change with the lazy init 177 if (fNodes == NULL) { 179 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode)); 180 fNodes[0].clear(); // Init root node. 197 CharacterNode *node = fNodes; 218 uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode)); 219 uprv_free(fNodes); [all...] |
H A D | tznames_impl.h | 141 CharacterNode *fNodes; member in class:TextTrieMap
|
/external/icu/icu4c/source/i18n/ |
H A D | tznames_impl.cpp | 116 : fIgnoreCase(ignoreCase), fNodes(NULL), fNodesCapacity(0), fNodesCount(0), 123 fNodes[index].deleteValues(fValueDeleter); 125 uprv_free(fNodes); 138 // Trie is built, while fNodes and fLazyContents change with the lazy init 177 if (fNodes == NULL) { 179 fNodes = (CharacterNode *)uprv_malloc(fNodesCapacity * sizeof(CharacterNode)); 180 fNodes[0].clear(); // Init root node. 197 CharacterNode *node = fNodes; 218 uprv_memcpy(newNodes, fNodes, fNodesCount * sizeof(CharacterNode)); 219 uprv_free(fNodes); [all...] |
H A D | tznames_impl.h | 141 CharacterNode *fNodes; member in class:TextTrieMap
|
Completed in 1666 milliseconds