944 	struct key_vector *pn, *n = t->kv;  in fib_find_node()  local
948 		pn = n;  in fib_find_node()
978 	*tp = pn;  in fib_find_node()
1324 	struct key_vector *n, *pn;  in fib_table_lookup()  local
1329 	pn = t->kv;  in fib_table_lookup()
1332 	n = get_child_rcu(pn, cindex);  in fib_table_lookup()
1371 			pn = n;  in fib_table_lookup()
1413 				t_key pkey = pn->key;  in fib_table_lookup()
1419 				if (IS_TRIE(pn)) {  in fib_table_lookup()
1428 				pn = node_parent_rcu(pn);  in fib_table_lookup()
1429 				cindex = get_index(pkey, pn);  in fib_table_lookup()
1436 			cptr = &pn->tnode[cindex];  in fib_table_lookup()
1618 	struct key_vector *pn, *n = *tn;  in leaf_walk_rcu()  local
1624 		pn = n;  in leaf_walk_rcu()
1625 		cindex = (key > pn->key) ? get_index(key, pn) : 0;  in leaf_walk_rcu()
1627 		if (cindex >> pn->bits)  in leaf_walk_rcu()
1631 		n = get_child_rcu(pn, cindex++);  in leaf_walk_rcu()
1641 	while (!IS_TRIE(pn)) {  in leaf_walk_rcu()
1643 		if (cindex >= (1ul << pn->bits)) {  in leaf_walk_rcu()
1644 			t_key pkey = pn->key;  in leaf_walk_rcu()
1646 			pn = node_parent_rcu(pn);  in leaf_walk_rcu()
1647 			cindex = get_index(pkey, pn) + 1;  in leaf_walk_rcu()
1652 		n = get_child_rcu(pn, cindex++);  in leaf_walk_rcu()
1661 		pn = n;  in leaf_walk_rcu()
1665 	*tn = pn;  in leaf_walk_rcu()
1669 	*tn = pn;  in leaf_walk_rcu()
1676 	struct key_vector *pn = t->kv;  in fib_trie_free()  local
1686 			t_key pkey = pn->key;  in fib_trie_free()
1688 			if (IS_TRIE(pn))  in fib_trie_free()
1691 			n = pn;  in fib_trie_free()
1692 			pn = node_parent(pn);  in fib_trie_free()
1695 			put_child_root(pn, n->key, NULL);  in fib_trie_free()
1698 			cindex = get_index(pkey, pn);  in fib_trie_free()
1704 		n = get_child(pn, cindex);  in fib_trie_free()
1710 			pn = n;  in fib_trie_free()
1721 		put_child_root(pn, n->key, NULL);  in fib_trie_free()
1793 	struct key_vector *pn = t->kv;  in fib_table_flush_external()  local
1804 			t_key pkey = pn->key;  in fib_table_flush_external()
1807 			if (IS_TRIE(pn))  in fib_table_flush_external()
1811 			if (pn->slen > pn->pos)  in fib_table_flush_external()
1812 				update_suffix(pn);  in fib_table_flush_external()
1815 			pn = resize(t, pn);  in fib_table_flush_external()
1816 			cindex = get_index(pkey, pn);  in fib_table_flush_external()
1822 		n = get_child(pn, cindex);  in fib_table_flush_external()
1828 			pn = n;  in fib_table_flush_external()
1852 			put_child_root(pn, n->key, NULL);  in fib_table_flush_external()
1862 	struct key_vector *pn = t->kv;  in fib_table_flush()  local
1874 			t_key pkey = pn->key;  in fib_table_flush()
1877 			if (IS_TRIE(pn))  in fib_table_flush()
1881 			if (pn->slen > pn->pos)  in fib_table_flush()
1882 				update_suffix(pn);  in fib_table_flush()
1885 			pn = resize(t, pn);  in fib_table_flush()
1886 			cindex = get_index(pkey, pn);  in fib_table_flush()
1892 		n = get_child(pn, cindex);  in fib_table_flush()
1898 			pn = n;  in fib_table_flush()
1927 			put_child_root(pn, n->key, NULL);  in fib_table_flush()
2142 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()  local
2148 	while (!IS_TRIE(pn)) {  in fib_trie_get_next()
2149 		while (cindex < child_length(pn)) {  in fib_trie_get_next()
2150 			struct key_vector *n = get_child_rcu(pn, cindex++);  in fib_trie_get_next()
2156 				iter->tnode = pn;  in fib_trie_get_next()
2169 		pkey = pn->key;  in fib_trie_get_next()
2170 		pn = node_parent_rcu(pn);  in fib_trie_get_next()
2171 		cindex = get_index(pkey, pn) + 1;  in fib_trie_get_next()
2176 	iter->tnode = pn;  in fib_trie_get_next()
2185 	struct key_vector *n, *pn;  in fib_trie_get_first()  local
2190 	pn = t->kv;  in fib_trie_get_first()
2191 	n = rcu_dereference(pn->tnode[0]);  in fib_trie_get_first()
2200 		iter->tnode = pn;  in fib_trie_get_first()