Lines Matching refs:link
67 struct HASH_ENTRY *link;
73 /* get a free link and insert at top of hash list */
74 link = cache->free_hash;
75 if (link) {
76 cache->free_hash = link->next;
79 link->next = first;
81 link->next = NULL;
82 link->entry = current;
83 cache->first_hash[h] = link;
106 struct HASH_ENTRY *link;
111 /* find the link and unlink */
112 link = cache->first_hash[hash];
114 while (link && (link->entry != current)) {
115 previous = link;
116 link = link->next;
118 if (link) {
120 previous->next = link->next;
122 cache->first_hash[hash] = link->next;
123 link->next = cache->free_hash;
124 cache->free_hash = link;
152 struct HASH_ENTRY *link;
163 link = cache->first_hash[h];
164 while (link && compare(link->entry, wanted))
165 link = link->next;
166 if (link)
167 current = link->entry;
218 struct HASH_ENTRY *link;
229 link = cache->first_hash[h];
230 while (link && compare(link->entry, item))
231 link = link->next;
232 if (link) {
233 current = link->entry;
380 struct HASH_ENTRY *link;
393 link = cache->first_hash[h];
394 while (link) {
395 if (compare(link->entry, item))
396 link = link->next;
398 current = link->entry;
399 link = link->next;