Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/net/ipv4/
H A Dfib_trie.c212 static inline unsigned long child_length(const struct key_vector *tn) in child_length() function
422 BUG_ON(i >= child_length(tn)); in put_child()
450 for (i = child_length(tn); i;) { in update_children()
524 for (i = child_length(tn); i;) { in replace()
556 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) { in inflate()
606 for (k = child_length(inode), j = k / 2; j;) { in inflate()
651 for (i = child_length(oldtnode); i;) { in halve()
693 for (n = NULL, i = child_length(oldtnode); !n && i;) in collapse()
724 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) { in update_suffix()
753 * child_length() an
[all...]
/kernel/linux/linux-6.6/net/ipv4/
H A Dfib_trie.c213 static inline unsigned long child_length(const struct key_vector *tn) in child_length() function
423 BUG_ON(i >= child_length(tn)); in put_child()
451 for (i = child_length(tn); i;) { in update_children()
525 for (i = child_length(tn); i;) { in replace()
557 for (i = child_length(oldtnode), m = 1u << tn->pos; i;) { in inflate()
607 for (k = child_length(inode), j = k / 2; j;) { in inflate()
652 for (i = child_length(oldtnode); i;) { in halve()
694 for (n = NULL, i = child_length(oldtnode); !n && i;) in collapse()
725 for (i = 0, stride = 0x2ul ; i < child_length(tn); i += stride) { in update_suffix()
754 * child_length() an
[all...]

Completed in 9 milliseconds