Lines Matching refs:tmp
66 hash_entry *tmp, *new;
69 tmp = tbl->table[bucket = hash_string(key, tbl->size)];
71 tmp = tbl->table[bucket = labs((long)key) % tbl->size];
75 while (tmp != NULL) {
76 if (strcmp(tmp->key, key) == 0) {
77 return (&tmp->data);
79 tmp = tmp->next_entry;
82 while (tmp != NULL) {
83 if (tmp->key == key) {
84 return (&tmp->data);
86 tmp = tmp->next_entry;
116 hash_entry *tmp;
119 tmp = tbl->table[hash_string(key, tbl->size)];
120 for (; tmp != NULL; tmp = tmp->next_entry) {
121 if (strcmp(tmp->key, key) == 0) {
122 return (&tmp->data);
126 tmp = tbl->table[labs((long)key) % tbl->size];
127 for (; tmp != NULL; tmp = tmp->next_entry) {
128 if (tmp->key == key) {
129 return (&tmp->data);
140 hash_entry * tmp, * prev = NULL;
148 if ((tmp = tbl->table[bucket]) == NULL) {
152 while (tmp != NULL) {
153 if (strcmp(tmp->key, key) == 0) {
156 prev = tmp;
157 tmp = tmp->next_entry;
160 while (tmp != NULL) {
161 if (tmp->key == key) {
164 prev = tmp;
165 tmp = tmp->next_entry;
168 if (tmp == NULL) {
174 * tmp now points to entry marked for deletion, prev to
175 * item preceding in bucket chain or NULL if tmp is first.
179 free(tmp->key);
182 prev->next_entry = tmp->next_entry;
184 tbl->table[bucket] = tmp->next_entry;
190 if (tmp->right_entry != NULL) { /* not first in chain.... */
191 tmp->right_entry->left_entry = (tmp->left_entry ?
192 tmp->left_entry->right_entry: NULL);
194 tbl->start = (tmp->left_entry ?tmp->left_entry->right_entry:
197 return (tmp->data);
203 hash_entry *tmp = tbl->start;
206 while (tmp) {
207 (*ptr)(tmp->data, usr_arg, tmp->key);
208 tmp = tmp->left_entry;
217 hash_entry *tmp = tbl->start;
220 while (tmp) {
221 (*ptr)(&(tmp->data), usr_arg, tmp->key);
222 tmp = tmp->left_entry;
231 hash_entry * tmp = tbl->start, * prev;
233 while (tmp) {
235 (void) (*ptr)(tmp->data, usr_arg, tmp->key);
239 free(tmp->key);
241 prev = tmp;
242 tmp = tmp->left_entry;