Home
last modified time | relevance | path

Searched refs:empty_children (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-5.10/net/ipv4/
H A Dfib_trie.c134 t_key empty_children; /* KEYLENGTH bits needed */ member
338 tn_info(n)->empty_children++; in empty_child_inc()
340 if (!tn_info(n)->empty_children) in empty_child_inc()
346 if (!tn_info(n)->empty_children) in empty_child_dec()
349 tn_info(n)->empty_children--; in empty_child_dec()
394 tnode->empty_children = 1ul << bits; in tnode_new()
414 * Update the value of full_children and empty_children.
759 * - tn->empty_children is of course the number of non-null children
768 * not_to_be_doubled = child_length(tn) - tn->empty_children -
788 * 100 * (child_length(tn) - tn->empty_children
[all...]
/kernel/linux/linux-6.6/net/ipv4/
H A Dfib_trie.c135 t_key empty_children; /* KEYLENGTH bits needed */ member
339 tn_info(n)->empty_children++; in empty_child_inc()
341 if (!tn_info(n)->empty_children) in empty_child_inc()
347 if (!tn_info(n)->empty_children) in empty_child_dec()
350 tn_info(n)->empty_children--; in empty_child_dec()
395 tnode->empty_children = 1ul << bits; in tnode_new()
415 * Update the value of full_children and empty_children.
760 * - tn->empty_children is of course the number of non-null children
769 * not_to_be_doubled = child_length(tn) - tn->empty_children -
789 * 100 * (child_length(tn) - tn->empty_children
[all...]

Completed in 6 milliseconds