Lines Matching refs:up
144 /* don't use tolower and friends here - they may be messed up by LOCALE */
161 struct crec **up = hash_bucket(cache_get_name(crecp));
165 while (*up && ((*up)->flags & F_REVERSE))
166 up = &((*up)->hash_next);
169 while (*up && !((*up)->flags & F_IMMORTAL))
170 up = &((*up)->hash_next);
172 crecp->hash_next = *up;
173 *up = crecp;
272 struct crec *crecp, **up;
276 for (up = hash_bucket(name), crecp = *up; crecp; crecp = crecp->hash_next)
279 *up = crecp->hash_next;
292 *up = crecp->hash_next;
297 up = &crecp->hash_next;
308 for (crecp = hash_table[i], up = &hash_table[i];
313 *up = crecp->hash_next;
325 *up = crecp->hash_next;
330 up = &crecp->hash_next;
342 in which can the next cache_start_insert cleans things up. */
372 /* if previous insertion failed give up now. */
424 If that fails, give up now. */
505 struct crec *next, **up, **insert = NULL, **chainp = &ans;
508 for (up = hash_bucket(name), crecp = *up; crecp; crecp = next)
529 /* Move all but the first entry up the hash chain
536 *up = crecp->hash_next;
545 insert = up;
548 up = &crecp->hash_next;
553 up = &crecp->hash_next;
558 *up = crecp->hash_next;
595 start of the hash chain, so we can give up when we find the first
598 struct crec **up, **chainp = &ans;
601 for (crecp = hash_table[i], up = &hash_table[i];
620 up = &crecp->hash_next;
624 *up = crecp->hash_next;
870 struct crec *cache, **up, *tmp;
877 for (cache = hash_table[i], up = &hash_table[i]; cache; cache = tmp)
882 *up = cache->hash_next;
887 *up = cache->hash_next;
896 up = &cache->hash_next;
1020 struct crec *cache, **up;
1024 for (cache = hash_table[i], up = &hash_table[i]; cache; cache = cache->hash_next)
1027 *up = cache->hash_next;
1032 up = &cache->hash_next;
