Lines Matching refs:forward
61 struct SLEntry *forward[1]; /* variable sized array */ member
79 + (max_level + 1) * sizeof(entry->forward[0])); in SLCreateEntry()
112 for (i = 0; i <= SL_MAX_LEVEL; i++) list->head->forward[i] = NULL; in drmSLCreate()
127 next = entry->forward[0]; in drmSLDestroy()
146 while (entry->forward[i] && entry->forward[i]->key < key) in SLLocate()
147 entry = entry->forward[i]; in SLLocate()
151 return entry->forward[0]; in SLLocate()
179 entry->forward[i] = update[i]->forward[i]; in drmSLInsert()
180 update[i]->forward[i] = entry; in drmSLInsert()
202 if (update[i]->forward[i] == entry) in drmSLDelete()
203 update[i]->forward[i] = entry->forward[i]; in drmSLDelete()
209 while (list->level && !list->head->forward[list->level]) --list->level; in drmSLDelete()
247 if (update[0]->forward[0]) { in drmSLLookupNeighbors()
248 *next_key = update[0]->forward[0]->key; in drmSLLookupNeighbors()
249 *next_value = update[0]->forward[0]->value; in drmSLLookupNeighbors()
266 list->p0 = entry->forward[0]; in drmSLNext()
281 list->p0 = list->head->forward[0]; in drmSLFirst()
299 for (entry = list->head; entry; entry = entry->forward[0]) { in drmSLDump()
307 if (entry->forward[i]) { in drmSLDump()
310 entry->forward[i], in drmSLDump()
311 entry->forward[i]->key, in drmSLDump()
312 entry->forward[i]->value); in drmSLDump()
314 printf(" %2d: %p\n", i, entry->forward[i]); in drmSLDump()