Searched refs:child_lle (Results 1 – 3 of 3) sorted by relevance
441 struct llentry *child_lle; in llentry_lookup_family() local446 CK_SLIST_FOREACH(child_lle, &lle->lle_children, lle_child_next) { in llentry_lookup_family()447 if (child_lle->r_family == family) in llentry_lookup_family()448 return (child_lle); in llentry_lookup_family()526 struct llentry *child_lle; in llentry_request_feedback() local532 CK_SLIST_FOREACH(child_lle, &lle->lle_children, lle_child_next) { in llentry_request_feedback()533 LLE_REQ_LOCK(child_lle); in llentry_request_feedback()534 child_lle->r_skip_req = 1; in llentry_request_feedback()535 LLE_REQ_UNLOCK(child_lle); in llentry_request_feedback()575 struct llentry *child_lle; in llentry_get_hittime() local[all …]
258 void lltable_link_child_entry(struct llentry *parent_lle, struct llentry *child_lle);259 void lltable_unlink_child_entry(struct llentry *child_lle);
1363 struct llentry *child_lle; in nd6_free_children() local 1368 while ((child_lle = CK_SLIST_FIRST(&lle->lle_children)) != NULL) { in nd6_free_children() 1369 LLE_WLOCK(child_lle); in nd6_free_children() 1370 lltable_unlink_child_entry(child_lle); in nd6_free_children() 1371 llentry_free(child_lle); in nd6_free_children() 1395 struct llentry *child_lle; in nd6_try_set_entry_addr_locked() local 1396 CK_SLIST_FOREACH(child_lle, &lle->lle_children, lle_child_next) { in nd6_try_set_entry_addr_locked() 1397 LLE_WLOCK(child_lle); in nd6_try_set_entry_addr_locked() 1398 fam = child_lle->r_family; in nd6_try_set_entry_addr_locked() 1402 lltable_set_entry_addr(ifp, child_lle, bu in nd6_try_set_entry_addr_locked() 2316 struct llentry *child_lle = NULL; nd6_get_llentry() local 2549 struct llentry *child_lle; nd6_flush_children_holdchain() local [all...]