Searched refs:isInList (Results 1 – 9 of 9) sorted by relevance
38 SkASSERT(this->isInList(entry)); in remove()113 SkASSERT(this->isInList(existingEntry)); in addBefore()142 SkASSERT(this->isInList(existingEntry)); in addAfter()260 SkASSERT(this->isInList(item)); in validate()278 bool isInList(const T* entry) const { in isInList() function
303 SkASSERT(fFreeList.isInList(freeNode)); in validate()311 bool free = fFreeList.isInList(block->fNodes + i); in validate()312 bool active = fList.isInList(block->fNodes + i); in validate()325 SkASSERT(fList.isInList(activeNode)); in validate()332 bool free = fFreeList.isInList(block->fNodes + i); in validate()333 bool active = fList.isInList(block->fNodes + i); in validate()
36 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0])); in check_list()37 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1])); in check_list()38 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2])); in check_list()39 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3])); in check_list()
37 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0])); in check_list()38 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1])); in check_list()39 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2])); in check_list()40 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3])); in check_list()
186 SkASSERT(!fList.isInList(dm)); in removeFromPool()
187 SkASSERT(!fList.isInList(dm)); in removeFromPool()
103 SkASSERT(fUniquelyKeyedEntryList.isInList(entry)); in makeExistingEntryMRU()
181 SkASSERT(fLRU.isInList(entry)); in find()