Searched refs:next_ptr (Results 1 – 6 of 6) sorted by relevance
150 LHASH_ITEM **next_ptr; in lh_retrieve() local152 next_ptr = get_next_ptr_and_hash(lh, NULL, data); in lh_retrieve()154 if (*next_ptr == NULL) { in lh_retrieve()158 return (*next_ptr)->data; in lh_retrieve()226 LHASH_ITEM **next_ptr, *item; in lh_insert() local229 next_ptr = get_next_ptr_and_hash(lh, &hash, data); in lh_insert()232 if (*next_ptr != NULL) { in lh_insert()235 *old_data = (*next_ptr)->data; in lh_insert()236 (*next_ptr)->data = data; in lh_insert()249 *next_ptr = item; in lh_insert()[all …]
88 struct dummy_lhash_node *cur, **next_ptr; in dummy_lh_delete() local91 next_ptr = &lh->head; in dummy_lh_delete()95 *next_ptr = cur->next; in dummy_lh_delete()99 next_ptr = &cur->next; in dummy_lh_delete()
68 local int next_ptr = 0; variable97 if (buf == NULL || next_ptr >= MAX_PTR) return NULL; in zcalloc()98 table[next_ptr].org_ptr = buf; in zcalloc()103 table[next_ptr++].new_ptr = buf; in zcalloc()115 for (n = 0; n < next_ptr; n++) { in zcfree()119 while (++n < next_ptr) { in zcfree()122 next_ptr--; in zcfree()
207 local int next_ptr = 0;236 if (buf == NULL || next_ptr >= MAX_PTR) return NULL;237 table[next_ptr].org_ptr = buf;242 table[next_ptr++].new_ptr = buf;254 for (n = 0; n < next_ptr; n++) {258 while (++n < next_ptr) {261 next_ptr--;
205 local int next_ptr = 0; variable234 if (buf == NULL || next_ptr >= MAX_PTR) return NULL; in zcalloc()235 table[next_ptr].org_ptr = buf; in zcalloc()240 table[next_ptr++].new_ptr = buf; in zcalloc()252 for (n = 0; n < next_ptr; n++) { in zcfree()256 while (++n < next_ptr) { in zcfree()259 next_ptr--; in zcfree()
376 long next_ptr = _objNext(hdfptr);377 if ( next_ptr == 0 ) {380 return newHdf(next_ptr, this);