Lines Matching refs:next
55 struct HashEntry *Next; /**< pointer to next entry */
106 struct HashEntry *next = entry->Next;
112 entry = next;
141 entry = entry->Next;
193 for (entry = table->Table[pos]; entry; entry = entry->Next) {
212 entry->Next = table->Table[pos];
255 prev->Next = entry->Next;
258 table->Table[pos] = entry->Next;
265 entry = entry->Next;
293 struct HashEntry *entry, *next;
294 for (entry = table->Table[pos]; entry; entry = next) {
296 next = entry->Next;
330 struct HashEntry *entry, *next;
331 for (entry = table->Table[pos]; entry; entry = next) {
332 /* save 'next' pointer now in case the callback deletes the entry */
333 next = entry->Next;
367 * Given a hash table key, return the next key. This is used to walk
370 * \return next hash key or 0 if end of table.
383 for (entry = table->Table[pos]; entry ; entry = entry->Next) {
390 /* the given key was not found, so we can't find the next entry */
394 if (entry->Next) {
395 /* return next in linked list */
396 return entry->Next->Key;
399 /* look for next non-empty table slot */
426 entry = entry->Next;
493 for (entry = table->Table[pos]; entry; entry = entry->Next) {
