Lines Matching refs:up
64 /* don't use tolower and friends here - they may be messed up by LOCALE */
150 struct crec *crecp, **up;
155 for (up = hash_bucket(name), crecp = *up; crecp; crecp = crecp->hash_next)
159 *up = crecp->hash_next;
167 up = &crecp->hash_next;
178 for (crecp = hash_table[i], up = &hash_table[i]; crecp; crecp = crecp->hash_next)
182 *up = crecp->hash_next;
190 up = &crecp->hash_next;
200 in which can the next cache_start_insert cleans things up. */
238 /* if previous insertion failed give up now. */
274 If that fails, give up now. */
342 struct crec *next, **up, **insert = NULL, **chainp = &ans;
344 for (up = hash_bucket(name), crecp = *up; crecp; crecp = next)
365 /* move all but the first entry up the hash chain
369 insert = up;
370 up = &crecp->hash_next;
374 *up = crecp->hash_next;
382 up = &crecp->hash_next;
387 *up = crecp->hash_next;
425 struct crec **up, **chainp = &ans;
428 for (crecp = hash_table[i], up = &hash_table[i]; crecp; crecp = crecp->hash_next)
446 up = &crecp->hash_next;
450 *up = crecp->hash_next;
577 struct crec *cache, **up, *tmp;
581 for (cache = hash_table[i], up = &hash_table[i]; cache; cache = tmp)
586 *up = cache->hash_next;
591 *up = cache->hash_next;
600 up = &cache->hash_next;
623 struct crec *tmp, *cache, **up;
627 for (cache = hash_table[i], up = &hash_table[i]; cache; cache = cache->hash_next)
629 *up = cache->hash_next;
631 up = &cache->hash_next;