915 	struct key_vector *pn, *n = t->kv;  in fib_find_node()  local
919 		pn = n;  in fib_find_node()
949 	*tp = pn;  in fib_find_node()
1268 	struct key_vector *n, *pn;  in fib_table_lookup()  local
1273 	pn = t->kv;  in fib_table_lookup()
1276 	n = get_child_rcu(pn, cindex);  in fib_table_lookup()
1313 			pn = n;  in fib_table_lookup()
1355 				t_key pkey = pn->key;  in fib_table_lookup()
1361 				if (IS_TRIE(pn))  in fib_table_lookup()
1367 				pn = node_parent_rcu(pn);  in fib_table_lookup()
1368 				cindex = get_index(pkey, pn);  in fib_table_lookup()
1375 			cptr = &pn->tnode[cindex];  in fib_table_lookup()
1543 	struct key_vector *pn, *n = *tn;  in leaf_walk_rcu()  local
1549 		pn = n;  in leaf_walk_rcu()
1550 		cindex = (key > pn->key) ? get_index(key, pn) : 0;  in leaf_walk_rcu()
1552 		if (cindex >> pn->bits)  in leaf_walk_rcu()
1556 		n = get_child_rcu(pn, cindex++);  in leaf_walk_rcu()
1566 	while (!IS_TRIE(pn)) {  in leaf_walk_rcu()
1568 		if (cindex >= (1ul << pn->bits)) {  in leaf_walk_rcu()
1569 			t_key pkey = pn->key;  in leaf_walk_rcu()
1571 			pn = node_parent_rcu(pn);  in leaf_walk_rcu()
1572 			cindex = get_index(pkey, pn) + 1;  in leaf_walk_rcu()
1577 		n = get_child_rcu(pn, cindex++);  in leaf_walk_rcu()
1586 		pn = n;  in leaf_walk_rcu()
1590 	*tn = pn;  in leaf_walk_rcu()
1594 	*tn = pn;  in leaf_walk_rcu()
1601 	struct key_vector *pn = t->kv;  in fib_trie_free()  local
1611 			t_key pkey = pn->key;  in fib_trie_free()
1613 			if (IS_TRIE(pn))  in fib_trie_free()
1616 			n = pn;  in fib_trie_free()
1617 			pn = node_parent(pn);  in fib_trie_free()
1620 			put_child_root(pn, n->key, NULL);  in fib_trie_free()
1623 			cindex = get_index(pkey, pn);  in fib_trie_free()
1629 		n = get_child(pn, cindex);  in fib_trie_free()
1635 			pn = n;  in fib_trie_free()
1646 		put_child_root(pn, n->key, NULL);  in fib_trie_free()
1716 	struct key_vector *pn = t->kv;  in fib_table_flush_external()  local
1727 			t_key pkey = pn->key;  in fib_table_flush_external()
1730 			if (IS_TRIE(pn))  in fib_table_flush_external()
1734 			pn = resize(t, pn);  in fib_table_flush_external()
1735 			cindex = get_index(pkey, pn);  in fib_table_flush_external()
1741 		n = get_child(pn, cindex);  in fib_table_flush_external()
1747 			pn = n;  in fib_table_flush_external()
1781 			put_child_root(pn, n->key, NULL);  in fib_table_flush_external()
1791 	struct key_vector *pn = t->kv;  in fib_table_flush()  local
1803 			t_key pkey = pn->key;  in fib_table_flush()
1806 			if (IS_TRIE(pn))  in fib_table_flush()
1810 			pn = resize(t, pn);  in fib_table_flush()
1811 			cindex = get_index(pkey, pn);  in fib_table_flush()
1817 		n = get_child(pn, cindex);  in fib_table_flush()
1823 			pn = n;  in fib_table_flush()
1851 			put_child_root(pn, n->key, NULL);  in fib_table_flush()
2013 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()  local
2019 	while (!IS_TRIE(pn)) {  in fib_trie_get_next()
2020 		while (cindex < child_length(pn)) {  in fib_trie_get_next()
2021 			struct key_vector *n = get_child_rcu(pn, cindex++);  in fib_trie_get_next()
2027 				iter->tnode = pn;  in fib_trie_get_next()
2040 		pkey = pn->key;  in fib_trie_get_next()
2041 		pn = node_parent_rcu(pn);  in fib_trie_get_next()
2042 		cindex = get_index(pkey, pn) + 1;  in fib_trie_get_next()
2047 	iter->tnode = pn;  in fib_trie_get_next()
2056 	struct key_vector *n, *pn = t->kv;  in fib_trie_get_first()  local
2061 	n = rcu_dereference(pn->tnode[0]);  in fib_trie_get_first()
2070 		iter->tnode = pn;  in fib_trie_get_first()