• Home
  • Raw
  • Download

Lines Matching refs:pn

434 	struct fib6_node *pn = NULL;  in fib6_add_1()  local
487 pn = fn; in fib6_add_1()
518 ln->parent = pn; in fib6_add_1()
522 pn->right = ln; in fib6_add_1()
524 pn->left = ln; in fib6_add_1()
538 pn = fn->parent; in fib6_add_1()
575 in->parent = pn; in fib6_add_1()
583 pn->right = in; in fib6_add_1()
585 pn->left = in; in fib6_add_1()
616 ln->parent = pn; in fib6_add_1()
621 pn->right = ln; in fib6_add_1()
623 pn->left = ln; in fib6_add_1()
804 struct fib6_node *fn, *pn = NULL; in fib6_add() local
827 pn = fn; in fib6_add()
900 fib6_prune_clones(info->nl_net, pn, rt); in fib6_add()
910 if (pn != fn && pn->leaf == rt) { in fib6_add()
911 pn->leaf = NULL; in fib6_add()
914 if (pn != fn && !pn->leaf && !(pn->fn_flags & RTN_RTINFO)) { in fib6_add()
915 pn->leaf = fib6_find_prefix(info->nl_net, pn); in fib6_add()
917 if (!pn->leaf) { in fib6_add()
918 WARN_ON(pn->leaf == NULL); in fib6_add()
919 pn->leaf = info->nl_net->ipv6.ip6_null_entry; in fib6_add()
922 atomic_inc(&pn->leaf->rt6i_ref); in fib6_add()
1125 struct fib6_node *child, *pn; in fib6_repair_tree() local
1159 pn = fn->parent; in fib6_repair_tree()
1161 if (FIB6_SUBTREE(pn) == fn) { in fib6_repair_tree()
1163 FIB6_SUBTREE(pn) = NULL; in fib6_repair_tree()
1168 if (pn->right == fn) pn->right = child; in fib6_repair_tree()
1169 else if (pn->left == fn) pn->left = child; in fib6_repair_tree()
1175 child->parent = pn; in fib6_repair_tree()
1189 w->node = pn; in fib6_repair_tree()
1212 if (pn->fn_flags & RTN_RTINFO || FIB6_SUBTREE(pn)) in fib6_repair_tree()
1213 return pn; in fib6_repair_tree()
1215 rt6_release(pn->leaf); in fib6_repair_tree()
1216 pn->leaf = NULL; in fib6_repair_tree()
1217 fn = pn; in fib6_repair_tree()
1313 struct fib6_node *pn = fn; in fib6_del() local
1317 while (!(pn->fn_flags & RTN_ROOT)) in fib6_del()
1318 pn = pn->parent; in fib6_del()
1319 pn = pn->parent; in fib6_del()
1322 fib6_prune_clones(info->nl_net, pn, rt); in fib6_del()
1364 struct fib6_node *fn, *pn; in fib6_walk_continue() local
1420 pn = fn->parent; in fib6_walk_continue()
1421 w->node = pn; in fib6_walk_continue()
1423 if (FIB6_SUBTREE(pn) == fn) { in fib6_walk_continue()
1429 if (pn->left == fn) { in fib6_walk_continue()
1433 if (pn->right == fn) { in fib6_walk_continue()