Searched refs:existingEntry (Results 1 – 4 of 4) sorted by relevance
105 void addBefore(T* newEntry, T* existingEntry) { in addBefore() argument108 if (nullptr == existingEntry) { in addBefore()113 SkASSERT(this->isInList(existingEntry)); in addBefore()114 newEntry->fNext = existingEntry; in addBefore()115 T* prev = existingEntry->fPrev; in addBefore()116 existingEntry->fPrev = newEntry; in addBefore()119 SkASSERT(fHead == existingEntry); in addBefore()134 void addAfter(T* newEntry, T* existingEntry) { in addAfter() argument137 if (nullptr == existingEntry) { in addAfter()142 SkASSERT(this->isInList(existingEntry)); in addAfter()[all …]
123 void addBefore(T* newEntry, T* existingEntry) { in addBefore() argument126 if (nullptr == existingEntry) { in addBefore()131 SkASSERT(this->isInList(existingEntry)); in addBefore()132 newEntry->fNext = existingEntry; in addBefore()133 T* prev = existingEntry->fPrev; in addBefore()134 existingEntry->fPrev = newEntry; in addBefore()137 SkASSERT(fHead == existingEntry); in addBefore()152 void addAfter(T* newEntry, T* existingEntry) { in addAfter() argument155 if (nullptr == existingEntry) { in addAfter()160 SkASSERT(this->isInList(existingEntry)); in addAfter()[all …]
120 ResName existingEntry = resourceTable.put(resId, resName); in addResource() local121 if (existingEntry != null && !existingEntry.equals(resName)) { in addResource()122 …on("ResId " + Integer.toHexString(resId) + " mapped to both " + resName + " and " + existingEntry); in addResource()
49 - (void) addBefore:(LHMEntry *)existingEntry51 after = [existingEntry retain];52 before = [existingEntry.before retain];