Lines Matching refs:next
160 newtab->next = NULL;
196 nextone = current->next; // remember next
229 next_np = np->next;
231 np->next = *hp;
246 for (np = bucket; np != NULL; np = np->next) {
264 for (np = bucket; np != NULL; np = np->next) {
289 for (dp = np = bucket; np != NULL; np = np->next) {
302 *head = np->next; // deleting head of bucket
304 dp->next = np->next; // deleting interior link
328 for (prev = curr = bucket; curr != NULL; curr = curr->next) {
342 td->next = curr;
352 for (np = head; np != NULL; np = np->next) {
383 /* Returns the next size to use for the hash table */
393 newsize = hashsizes[n]; /* get next size */
403 * Grow the current hashtable upto the next size.
546 * db_table_desc.next field will be altered
548 * This means that if next points to a list of
627 * data dictionary entry with the ->next pointer set, you will get a
631 * entries with the ->next pointer set. You might either get duplicate
633 * and add it to a new dictionary, loop through the db_table_desc->next list
709 clone = clone->next;
732 clone = clone->next;
882 next_np = np->next;
967 next_td = clone->next;
968 clone->next = NULL;
1074 tbl_ent.next = NULL;
1329 vers * newv = db_update_version.nextmajor(); // get next version
1731 // it. The next time we add a table with the same name to the dictionary,
2030 } /* else it's EBUSY; skip to the next one */
2138 n = t->next;
2193 db_table_desc_p n, savenext = t->next;
2194 t->next = NULL;
2197 tbl->next = n;
2206 t->next = savenext;
2243 db_table_desc *clone, *savenext = tbl->next;
2248 tbl->next = NULL;
2251 tbl->next = savenext;