921 	struct key_vector *pn, *n = t->kv;  in fib_find_node()  local
925 		pn = n;  in fib_find_node()
955 	*tp = pn;  in fib_find_node()
1277 	struct key_vector *n, *pn;  in fib_table_lookup()  local
1284 	pn = t->kv;  in fib_table_lookup()
1287 	n = get_child_rcu(pn, cindex);  in fib_table_lookup()
1324 			pn = n;  in fib_table_lookup()
1366 				t_key pkey = pn->key;  in fib_table_lookup()
1372 				if (IS_TRIE(pn))  in fib_table_lookup()
1378 				pn = node_parent_rcu(pn);  in fib_table_lookup()
1379 				cindex = get_index(pkey, pn);  in fib_table_lookup()
1386 			cptr = &pn->tnode[cindex];  in fib_table_lookup()
1565 	struct key_vector *pn, *n = *tn;  in leaf_walk_rcu()  local
1571 		pn = n;  in leaf_walk_rcu()
1572 		cindex = (key > pn->key) ? get_index(key, pn) : 0;  in leaf_walk_rcu()
1574 		if (cindex >> pn->bits)  in leaf_walk_rcu()
1578 		n = get_child_rcu(pn, cindex++);  in leaf_walk_rcu()
1588 	while (!IS_TRIE(pn)) {  in leaf_walk_rcu()
1590 		if (cindex >= (1ul << pn->bits)) {  in leaf_walk_rcu()
1591 			t_key pkey = pn->key;  in leaf_walk_rcu()
1593 			pn = node_parent_rcu(pn);  in leaf_walk_rcu()
1594 			cindex = get_index(pkey, pn) + 1;  in leaf_walk_rcu()
1599 		n = get_child_rcu(pn, cindex++);  in leaf_walk_rcu()
1608 		pn = n;  in leaf_walk_rcu()
1612 	*tn = pn;  in leaf_walk_rcu()
1616 	*tn = pn;  in leaf_walk_rcu()
1623 	struct key_vector *pn = t->kv;  in fib_trie_free()  local
1633 			t_key pkey = pn->key;  in fib_trie_free()
1635 			if (IS_TRIE(pn))  in fib_trie_free()
1638 			n = pn;  in fib_trie_free()
1639 			pn = node_parent(pn);  in fib_trie_free()
1642 			put_child_root(pn, n->key, NULL);  in fib_trie_free()
1645 			cindex = get_index(pkey, pn);  in fib_trie_free()
1651 		n = get_child(pn, cindex);  in fib_trie_free()
1657 			pn = n;  in fib_trie_free()
1668 		put_child_root(pn, n->key, NULL);  in fib_trie_free()
1738 	struct key_vector *pn = t->kv;  in fib_table_flush_external()  local
1749 			t_key pkey = pn->key;  in fib_table_flush_external()
1752 			if (IS_TRIE(pn))  in fib_table_flush_external()
1756 			pn = resize(t, pn);  in fib_table_flush_external()
1757 			cindex = get_index(pkey, pn);  in fib_table_flush_external()
1763 		n = get_child(pn, cindex);  in fib_table_flush_external()
1769 			pn = n;  in fib_table_flush_external()
1802 			put_child_root(pn, n->key, NULL);  in fib_table_flush_external()
1812 	struct key_vector *pn = t->kv;  in fib_table_flush()  local
1824 			t_key pkey = pn->key;  in fib_table_flush()
1827 			if (IS_TRIE(pn))  in fib_table_flush()
1831 			pn = resize(t, pn);  in fib_table_flush()
1832 			cindex = get_index(pkey, pn);  in fib_table_flush()
1838 		n = get_child(pn, cindex);  in fib_table_flush()
1844 			pn = n;  in fib_table_flush()
1871 			put_child_root(pn, n->key, NULL);  in fib_table_flush()
2032 	struct key_vector *pn = iter->tnode;  in fib_trie_get_next()  local
2038 	while (!IS_TRIE(pn)) {  in fib_trie_get_next()
2039 		while (cindex < child_length(pn)) {  in fib_trie_get_next()
2040 			struct key_vector *n = get_child_rcu(pn, cindex++);  in fib_trie_get_next()
2046 				iter->tnode = pn;  in fib_trie_get_next()
2059 		pkey = pn->key;  in fib_trie_get_next()
2060 		pn = node_parent_rcu(pn);  in fib_trie_get_next()
2061 		cindex = get_index(pkey, pn) + 1;  in fib_trie_get_next()
2066 	iter->tnode = pn;  in fib_trie_get_next()
2075 	struct key_vector *n, *pn;  in fib_trie_get_first()  local
2080 	pn = t->kv;  in fib_trie_get_first()
2081 	n = rcu_dereference(pn->tnode[0]);  in fib_trie_get_first()
2090 		iter->tnode = pn;  in fib_trie_get_first()