Searched refs:fFreeList (Results 1 – 2 of 2) sorted by relevance
230 fFreeList.addToHead(fFirstBlock.fNodes + i); in delayedInit()241 Node* node = fFreeList.head(); in createNode()243 fFreeList.remove(node); in createNode()256 fFreeList.addToHead(block->fNodes + i); in createNode()273 fFreeList.remove(block->fNodes + i); in removeNode()279 fFreeList.addToHead(node); in removeNode()290 SkASSERT(fFreeList.isEmpty()); in validate()294 SkASSERT(fFreeList.countEntries() == N); in validate()299 fFreeList.validate(); in validate()301 Node* freeNode = iter.init(fFreeList, Iter::kHead_IterStart); in validate()[all …]