Searched refs:ipn_next (Results 1 – 12 of 12) sorted by relevance
55 if (entry.ipn_next == NULL)57 entry.ipn_next = top;67 top = node->ipn_next;
90 ipnpn = ipnp->ipn_next;91 ipnp->ipn_next = ipp.ipo_list;
41 return np->ipn_next;
66 for (a = plp->ipo_list; a != NULL; a = a->ipn_next)
219 for (c = ipo->ipo_list; c != NULL; c = c->ipn_next)476 x->ipn_next = ipo->ipo_list;479 ipo->ipo_list->ipn_pnext = &x->ipn_next;587 for (ipp = &ipo->ipo_list; (n = *ipp) != NULL; ipp = &n->ipn_next) {589 *n->ipn_pnext = n->ipn_next;590 if (n->ipn_next)591 n->ipn_next->ipn_pnext = n->ipn_pnext;706 *n->ipn_pnext = n->ipn_next;707 if (n->ipn_next)708 n->ipn_next->ipn_pnext = n->ipn_pnext;[all …]
184 void *ipn_next; member250 nsp->ipn_next = nsc.ipn_next;
1279 nat = ipns.ipn_next;1301 ipn->ipn_next = nat->nat_next;
642 for (in1 = ipnhead; in1 != NULL; in1 = in1->ipn_next)654 in->ipn_next = NULL;658 ipntail->ipn_next = in;668 for (in = ipnhead; in; in = in->ipn_next) {689 for (in1 = in->ipn_next; in1; in1 = in1->ipn_next)754 ipnp->ipn_next = next;766 ipnp->ipn_next, ipnp->ipn_dsize, ng.ng_sz);773 next = ipnp->ipn_next;
216 | range next addrlist { $1->ipn_next = $3; $$ = $1; }
2131 n->ipn_next = calloc(1, sizeof(*n));2132 if (n->ipn_next == NULL)2134 n = n->ipn_next;2144 top = n->ipn_next;
44 struct ip_pool_node *ipn_next, **ipn_pnext; member
299 void *ipn_next; member