Lines Matching refs:next
107 struct di_mem *next; /* link to next chunk */
201 struct i_link *src_link_next; /* next src i_link /w same i_lnode */
202 struct i_link *tgt_link_next; /* next tgt i_link /w same i_lnode */
711 dcp = dcp->next;
894 while (dcp->next != NULL) {
895 dcp = dcp->next;
898 dcp->next = mem;
919 for (dcp = st->memlist; dcp; dcp = dcp->next) {
952 dcp = dcp->next;
999 ASSERT(st->memlist->next == NULL);
1163 dcp = dcp->next;
1326 di_alias->next = all->aliases;
1617 ASSERT(me->next == 0 || me->next == -1);
1622 if (me->next != -1)
1626 off_p = &me->next;
1896 * If the dip is BOUND, set the next pointer of the
1901 me->next = -1;
1903 me->next = 0;
2439 * lnode. Also update the node_next next pointer. this pointer
2567 me->next = off;
2568 mnode = mnode->next;
2571 me->next = 0;
3151 pp->next = 0; /* assume tail for now */
3152 *off_pp = &pp->next; /* return pointer to our next */
3257 for (mn = dip->devi_minor; mn; mn = mn->next) {
3278 for (mn = dip->devi_minor; mn; mn = mn->next) {
3358 * Move to next driver name, skipping a white space
3432 * next, find the repeat count (array dimension)
3456 * next, get the size of the object to be copied
3609 * Set link to next in the chain of di_hp_t nodes,
3612 if (hp_hdl->next != NULL) {
3614 me->next = off;
3616 me->next = 0;
3619 /* Update pointer to next in the chain */
3620 hp_hdl = hp_hdl->next;