Lines Matching refs:next
79 struct wildcardinfo *next;
218 for (; namep != NULL; namep = namep->u.name.next) {
255 retp->u.name.last->u.name.next = newnp;
291 for (npref = epname; npref; npref = npref->u.name.next) {
295 np1 = np1->u.name.next, np2 = np2->u.name.next) {
324 npref = npref->u.name.next) {
352 ret->u.name.last->u.name.next = newnp;
585 cpnode->u.name.next =
601 ewlp->u.name.next = oldepname;
614 hmatch_event(infop, eventnp, oldepname->u.name.next,
622 ewlp->u.name.next = NULL;
630 * Try the next level down.
696 * expansions on to the next match.
768 epname->u.name.next, config_child(cp),
776 hmatch_event(infop, eventnp, epname->u.name.next,
786 * the other side of the prop that we'll tackle next when this recursion
889 * no wildcarding done - move on to next entry
909 cpnode->u.name.next = wcp->ewname;
923 ewlp->u.name.next = wcp->oldepname;
935 ewlp->u.name.next = NULL;
1041 * recurse on to next component. Note that
1045 vmatch_event(infop, config_child(cp), np->u.name.next,
1079 * in order to discover the next match (.../x1/y1)
1092 * however, the next recursion will not result in a
1123 * vmatch -- find the next vertical expansion match in the config database
1173 * move on to the next potential match, if any.
1239 for (wcp = wcproot; wcp; wcp = wcp->next) {
1243 np1 != NULL && np2 != NULL; np1 = np1->u.name.next,
1244 np2 = np2->u.name.next) {
1287 np1 = np1->u.name.next;
1288 np2 = np2->u.name.next;
1298 * This list entry is NULL. Move on to next item
1309 wcp->next = wcproot;
1319 wcproot = wcp->next;
1323 * This list entry is NULL. Move on to next item in the
1365 cp_reset(np->u.name.next);
1402 for (propnp = Props; propnp; propnp = propnp->u.stmt.next) {
1485 for (propnp = Props; propnp; propnp = propnp->u.stmt.next) {
1715 nextbub = bub->next;
1755 nextbub = bub->next;
1785 prev = curr, curr = curr->next) {
1803 newb->next = NULL;
1814 prev->next = newb;
1822 struct bubble *next;
1826 next = last->next;
1828 next = eventp->bubbles;
1830 if (next == NULL || next->arrows != NULL)
1831 return (next);
1834 last = next;
1858 prev->next = newal;
2023 nal = al->next;
2040 bubp->arrows = al->next;
2046 al = al->next;
2049 oal->next = al->next;
2063 nal = al->next;
2078 struct arrowlist *next;
2081 next = last->next;
2083 next = bubble->arrows;
2084 return (next);
2096 prev = curr, curr = curr->next)
2100 newc->next = NULL;
2106 prev->next = newc;
2114 struct constraintlist *next;
2117 next = last->next;
2119 next = arrowp->constraints;
2120 return (next);
2130 ncl = cl->next;