Lines Matching refs:pn

467 	struct fib6_node *pn = NULL;  in fib6_add_1()  local
519 pn = fn; in fib6_add_1()
550 ln->parent = pn; in fib6_add_1()
554 pn->right = ln; in fib6_add_1()
556 pn->left = ln; in fib6_add_1()
570 pn = fn->parent; in fib6_add_1()
607 in->parent = pn; in fib6_add_1()
615 pn->right = in; in fib6_add_1()
617 pn->left = in; in fib6_add_1()
648 ln->parent = pn; in fib6_add_1()
653 pn->right = ln; in fib6_add_1()
655 pn->left = ln; in fib6_add_1()
946 struct fib6_node *fn, *pn = NULL; in fib6_add() local
974 pn = fn; in fib6_add()
1047 fib6_prune_clones(info->nl_net, pn); in fib6_add()
1058 if (pn != fn && pn->leaf == rt) { in fib6_add()
1059 pn->leaf = NULL; in fib6_add()
1062 if (pn != fn && !pn->leaf && !(pn->fn_flags & RTN_RTINFO)) { in fib6_add()
1063 pn->leaf = fib6_find_prefix(info->nl_net, pn); in fib6_add()
1065 if (!pn->leaf) { in fib6_add()
1066 WARN_ON(pn->leaf == NULL); in fib6_add()
1067 pn->leaf = info->nl_net->ipv6.ip6_null_entry; in fib6_add()
1070 atomic_inc(&pn->leaf->rt6i_ref); in fib6_add()
1283 struct fib6_node *child, *pn; in fib6_repair_tree() local
1319 pn = fn->parent; in fib6_repair_tree()
1321 if (FIB6_SUBTREE(pn) == fn) { in fib6_repair_tree()
1323 FIB6_SUBTREE(pn) = NULL; in fib6_repair_tree()
1328 if (pn->right == fn) in fib6_repair_tree()
1329 pn->right = child; in fib6_repair_tree()
1330 else if (pn->left == fn) in fib6_repair_tree()
1331 pn->left = child; in fib6_repair_tree()
1337 child->parent = pn; in fib6_repair_tree()
1351 w->node = pn; in fib6_repair_tree()
1374 if (pn->fn_flags & RTN_RTINFO || FIB6_SUBTREE(pn)) in fib6_repair_tree()
1375 return pn; in fib6_repair_tree()
1377 rt6_release(pn->leaf); in fib6_repair_tree()
1378 pn->leaf = NULL; in fib6_repair_tree()
1379 fn = pn; in fib6_repair_tree()
1458 struct fib6_node *pn = fn; in fib6_del() local
1462 while (!(pn->fn_flags & RTN_ROOT)) in fib6_del()
1463 pn = pn->parent; in fib6_del()
1464 pn = pn->parent; in fib6_del()
1467 fib6_prune_clones(info->nl_net, pn); in fib6_del()
1509 struct fib6_node *fn, *pn; in fib6_walk_continue() local
1566 pn = fn->parent; in fib6_walk_continue()
1567 w->node = pn; in fib6_walk_continue()
1569 if (FIB6_SUBTREE(pn) == fn) { in fib6_walk_continue()
1575 if (pn->left == fn) { in fib6_walk_continue()
1579 if (pn->right == fn) { in fib6_walk_continue()