Lines Matching refs:next
157 newtab->next = NULL;
193 nextone = current->next; // remember next
226 next_np = np->next;
228 np->next = *hp;
243 for (np = bucket; np != NULL; np = np->next) {
261 for (np = bucket; np != NULL; np = np->next) {
286 for (dp = np = bucket; np != NULL; np = np->next) {
299 *head = np->next; // deleting head of bucket
301 dp->next = np->next; // deleting interior link
325 for (prev = curr = bucket; curr != NULL; curr = curr->next) {
339 td->next = curr;
349 for (np = head; np != NULL; np = np->next) {
380 /* Returns the next size to use for the hash table */
390 newsize = hashsizes[n]; /* get next size */
400 * Grow the current hashtable upto the next size.
543 * db_table_desc.next field will be altered
545 * This means that if next points to a list of
624 * data dictionary entry with the ->next pointer set, you will get a
628 * entries with the ->next pointer set. You might either get duplicate
630 * and add it to a new dictionary, loop through the db_table_desc->next list
706 clone = clone->next;
729 clone = clone->next;
879 next_np = np->next;
964 next_td = clone->next;
965 clone->next = NULL;
1071 tbl_ent.next = NULL;
1326 vers * newv = db_update_version.nextmajor(); // get next version
1728 // it. The next time we add a table with the same name to the dictionary,
2027 } /* else it's EBUSY; skip to the next one */
2135 n = t->next;
2190 db_table_desc_p n, savenext = t->next;
2191 t->next = NULL;
2194 tbl->next = n;
2203 t->next = savenext;
2240 db_table_desc *clone, *savenext = tbl->next;
2245 tbl->next = NULL;
2248 tbl->next = savenext;