Searched refs:ipn_next (Results 1 – 11 of 11) sorted by relevance
53 if (entry.ipn_next == NULL)59 node->ipn_next = top;68 top = node->ipn_next;
41 ipnpn = ipnp->ipn_next;42 ipnp->ipn_next = ipp.ipo_list;
32 return np->ipn_next;
61 for (a = plp->ipo_list; a != NULL; a = a->ipn_next)
647 for (in1 = ipnhead; in1 != NULL; in1 = in1->ipn_next)659 in->ipn_next = NULL;663 ipntail->ipn_next = in;694 for (in1 = in->ipn_next; in1; in1 = in1->ipn_next)699 ipnhead = in->ipn_next;707 ipnhead = in->ipn_next;771 ipnp->ipn_next = next;783 ipnp->ipn_next, ipnp->ipn_dsize, ng.ng_sz);790 next = ipnp->ipn_next;
216 | range next addrlist { $1->ipn_next = $3; $$ = $1; }513 pbot->ipn_next = p;
2008 n->ipn_next = calloc(1, sizeof(*n));2009 n = n->ipn_next;2019 top = n->ipn_next;
230 for (c = ipo->ipo_list; c != NULL; c = c->ipn_next)497 x->ipn_next = ipo->ipo_list;500 ipo->ipo_list->ipn_pnext = &x->ipn_next;617 *ipe->ipn_pnext = ipe->ipn_next;618 if (ipe->ipn_next != NULL)619 ipe->ipn_next->ipn_pnext = ipe->ipn_pnext;756 *n->ipn_pnext = n->ipn_next;757 if (n->ipn_next)758 n->ipn_next->ipn_pnext = n->ipn_pnext;869 nextnode = node->ipn_next;
41 struct ip_pool_node *ipn_next, **ipn_pnext; member
290 void *ipn_next; member
1302 nat = ipns.ipn_next;1324 ipn->ipn_next = nat->nat_next;