Lines Matching defs:up
285 struct nd6_prproxy_prelist *up, *down, *ndprl_tmp;
291 SLIST_FOREACH_SAFE(up, up_head, ndprl_le, ndprl_tmp) {
295 SLIST_REMOVE(up_head, up, nd6_prproxy_prelist, ndprl_le);
296 pr = up->ndprl_pr;
297 VERIFY(up->ndprl_up == NULL);
332 nd6_ndprl_free(up);
388 struct nd6_prproxy_prelist *up, *down;
447 up = nd6_ndprl_alloc(M_WAITOK);
448 if (up == NULL) {
453 up->ndprl_pr = pr; /* keep reference from above */
454 SLIST_INSERT_HEAD(&up_head, up, ndprl_le);
462 SLIST_FOREACH(up, &up_head, ndprl_le) {
467 pr = up->ndprl_pr;
583 struct nd6_prproxy_prelist *up, *down;
643 up = nd6_ndprl_alloc(M_WAITOK);
644 if (up == NULL) {
650 up->ndprl_pr = pr_up;
651 SLIST_INSERT_HEAD(&up_head, up, ndprl_le);
875 * Give up if we fail to save the NS info.
921 * Without a neighbor cache entry, we'd end up with an endless
1003 * the soliciting node's address. Give up if we can't find it.