43 	struct fib6_walker w;  member
63 static int fib6_walk(struct net *net, struct fib6_walker *w);
64 static int fib6_walk_continue(struct fib6_walker *w);
75 #define FOR_WALKERS(net, w) \  argument
76 	list_for_each_entry(w, &(net)->ipv6.fib6_walkers, lh)
78 static void fib6_walker_link(struct net *net, struct fib6_walker *w)  in fib6_walker_link()  argument
81 	list_add(&w->lh, &net->ipv6.fib6_walkers);  in fib6_walker_link()
85 static void fib6_walker_unlink(struct net *net, struct fib6_walker *w)  in fib6_walker_unlink()  argument
88 	list_del(&w->lh);  in fib6_walker_unlink()
460 static int fib6_node_dump(struct fib6_walker *w)  in fib6_node_dump()  argument
464 	err = fib6_rt_dump(w->leaf, w->args);  in fib6_node_dump()
465 	w->leaf = NULL;  in fib6_node_dump()
470 			   struct fib6_walker *w)  in fib6_table_dump()  argument
474 	w->root = &tb->tb6_root;  in fib6_table_dump()
476 	err = fib6_walk(net, w);  in fib6_table_dump()
486 	struct fib6_walker *w;  in fib6_tables_dump()  local
490 	w = kzalloc(sizeof(*w), GFP_ATOMIC);  in fib6_tables_dump()
491 	if (!w)  in fib6_tables_dump()
494 	w->func = fib6_node_dump;  in fib6_tables_dump()
498 	w->args = &arg;  in fib6_tables_dump()
505 			err = fib6_table_dump(net, tb, w);  in fib6_tables_dump()
512 	kfree(w);  in fib6_tables_dump()
518 static int fib6_dump_node(struct fib6_walker *w)  in fib6_dump_node()  argument
523 	for_each_fib6_walker_rt(w) {  in fib6_dump_node()
524 		res = rt6_dump_route(rt, w->args, w->skip_in_node);  in fib6_dump_node()
527 			w->leaf = rt;  in fib6_dump_node()
532 			w->skip_in_node += res;  in fib6_dump_node()
536 		w->skip_in_node = 0;  in fib6_dump_node()
548 	w->leaf = NULL;  in fib6_dump_node()
555 	struct fib6_walker *w = (void *)cb->args[2];  in fib6_dump_end()  local
557 	if (w) {  in fib6_dump_end()
560 			fib6_walker_unlink(net, w);  in fib6_dump_end()
563 		kfree(w);  in fib6_dump_end()
579 	struct fib6_walker *w;  in fib6_dump_table()  local
582 	w = (void *)cb->args[2];  in fib6_dump_table()
583 	w->root = &table->tb6_root;  in fib6_dump_table()
586 		w->count = 0;  in fib6_dump_table()
587 		w->skip = 0;  in fib6_dump_table()
588 		w->skip_in_node = 0;  in fib6_dump_table()
591 		res = fib6_walk(net, w);  in fib6_dump_table()
595 			cb->args[5] = READ_ONCE(w->root->fn_sernum);  in fib6_dump_table()
598 		int sernum = READ_ONCE(w->root->fn_sernum);  in fib6_dump_table()
602 			w->state = FWS_INIT;  in fib6_dump_table()
603 			w->node = w->root;  in fib6_dump_table()
604 			w->skip = w->count;  in fib6_dump_table()
605 			w->skip_in_node = 0;  in fib6_dump_table()
607 			w->skip = 0;  in fib6_dump_table()
610 		res = fib6_walk_continue(w);  in fib6_dump_table()
613 			fib6_walker_unlink(net, w);  in fib6_dump_table()
629 	struct fib6_walker *w;  in inet6_dump_fib()  local
647 	w = (void *)cb->args[2];  in inet6_dump_fib()
648 	if (!w) {  in inet6_dump_fib()
659 		w = kzalloc(sizeof(*w), GFP_ATOMIC);  in inet6_dump_fib()
660 		if (!w)  in inet6_dump_fib()
662 		w->func = fib6_dump_node;  in inet6_dump_fib()
663 		cb->args[2] = (long)w;  in inet6_dump_fib()
669 	w->args = &arg;  in inet6_dump_fib()
1794 	struct fib6_walker *w;  in fib6_repair_tree()  local
1880 		FOR_WALKERS(net, w) {  in fib6_repair_tree()
1882 				if (w->node == fn) {  in fib6_repair_tree()
1883 					RT6_TRACE("W %p adjusted by delnode 1, s=%d/%d\n", w, w->state, nstate);  in fib6_repair_tree()
1884 					w->node = pn;  in fib6_repair_tree()
1885 					w->state = nstate;  in fib6_repair_tree()
1888 				if (w->node == fn) {  in fib6_repair_tree()
1889 					w->node = child;  in fib6_repair_tree()
1891 						RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);  in fib6_repair_tree()
1892 						w->state = w->state >= FWS_R ? FWS_U : FWS_INIT;  in fib6_repair_tree()
1894 						RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);  in fib6_repair_tree()
1895 						w->state = w->state >= FWS_C ? FWS_U : FWS_INIT;  in fib6_repair_tree()
1916 	struct fib6_walker *w;  in fib6_del_route()  local
1970 	FOR_WALKERS(net, w) {  in fib6_del_route()
1971 		if (w->state == FWS_C && w->leaf == rt) {  in fib6_del_route()
1972 			RT6_TRACE("walker %p adjusted by delroute\n", w);  in fib6_del_route()
1973 			w->leaf = rcu_dereference_protected(rt->fib6_next,  in fib6_del_route()
1975 			if (!w->leaf)  in fib6_del_route()
1976 				w->state = FWS_U;  in fib6_del_route()
2072 static int fib6_walk_continue(struct fib6_walker *w)  in fib6_walk_continue()  argument
2077 	WARN_ON_ONCE(!(w->root->fn_flags & RTN_TL_ROOT));  in fib6_walk_continue()
2080 		fn = w->node;  in fib6_walk_continue()
2084 		switch (w->state) {  in fib6_walk_continue()
2088 				w->node = FIB6_SUBTREE(fn);  in fib6_walk_continue()
2091 			w->state = FWS_L;  in fib6_walk_continue()
2097 				w->node = left;  in fib6_walk_continue()
2098 				w->state = FWS_INIT;  in fib6_walk_continue()
2101 			w->state = FWS_R;  in fib6_walk_continue()
2106 				w->node = right;  in fib6_walk_continue()
2107 				w->state = FWS_INIT;  in fib6_walk_continue()
2110 			w->state = FWS_C;  in fib6_walk_continue()
2111 			w->leaf = rcu_dereference_protected(fn->leaf, 1);  in fib6_walk_continue()
2114 			if (w->leaf && fn->fn_flags & RTN_RTINFO) {  in fib6_walk_continue()
2117 				if (w->skip) {  in fib6_walk_continue()
2118 					w->skip--;  in fib6_walk_continue()
2122 				err = w->func(w);  in fib6_walk_continue()
2126 				w->count++;  in fib6_walk_continue()
2130 			w->state = FWS_U;  in fib6_walk_continue()
2133 			if (fn == w->root)  in fib6_walk_continue()
2138 			w->node = pn;  in fib6_walk_continue()
2142 				w->state = FWS_L;  in fib6_walk_continue()
2147 				w->state = FWS_R;  in fib6_walk_continue()
2151 				w->state = FWS_C;  in fib6_walk_continue()
2152 				w->leaf = rcu_dereference_protected(w->node->leaf, 1);  in fib6_walk_continue()
2162 static int fib6_walk(struct net *net, struct fib6_walker *w)  in fib6_walk()  argument
2166 	w->state = FWS_INIT;  in fib6_walk()
2167 	w->node = w->root;  in fib6_walk()
2169 	fib6_walker_link(net, w);  in fib6_walk()
2170 	res = fib6_walk_continue(w);  in fib6_walk()
2172 		fib6_walker_unlink(net, w);  in fib6_walk()
2176 static int fib6_clean_node(struct fib6_walker *w)  in fib6_clean_node()  argument
2180 	struct fib6_cleaner *c = container_of(w, struct fib6_cleaner, w);  in fib6_clean_node()
2187 	    READ_ONCE(w->node->fn_sernum) != c->sernum)  in fib6_clean_node()
2188 		WRITE_ONCE(w->node->fn_sernum, c->sernum);  in fib6_clean_node()
2192 		w->leaf = NULL;  in fib6_clean_node()
2196 	for_each_fib6_walker_rt(w) {  in fib6_clean_node()
2199 			w->leaf = rt;  in fib6_clean_node()
2220 	w->leaf = rt;  in fib6_clean_node()
2239 	c.w.root = root;  in fib6_clean_tree()
2240 	c.w.func = fib6_clean_node;  in fib6_clean_tree()
2241 	c.w.count = 0;  in fib6_clean_tree()
2242 	c.w.skip = 0;  in fib6_clean_tree()
2243 	c.w.skip_in_node = 0;  in fib6_clean_tree()
2250 	fib6_walk(net, &c.w);  in fib6_clean_tree()
2557 	iter->w.leaf = NULL;  in ipv6_route_native_seq_show()
2561 static int ipv6_route_yield(struct fib6_walker *w)  in ipv6_route_yield()  argument
2563 	struct ipv6_route_iter *iter = w->args;  in ipv6_route_yield()
2569 		iter->w.leaf = rcu_dereference_protected(  in ipv6_route_yield()
2570 				iter->w.leaf->fib6_next,  in ipv6_route_yield()
2573 		if (!iter->skip && iter->w.leaf)  in ipv6_route_yield()
2575 	} while (iter->w.leaf);  in ipv6_route_yield()
2583 	memset(&iter->w, 0, sizeof(iter->w));  in ipv6_route_seq_setup_walk()
2584 	iter->w.func = ipv6_route_yield;  in ipv6_route_seq_setup_walk()
2585 	iter->w.root = &iter->tbl->tb6_root;  in ipv6_route_seq_setup_walk()
2586 	iter->w.state = FWS_INIT;  in ipv6_route_seq_setup_walk()
2587 	iter->w.node = iter->w.root;  in ipv6_route_seq_setup_walk()
2588 	iter->w.args = iter;  in ipv6_route_seq_setup_walk()
2589 	iter->sernum = READ_ONCE(iter->w.root->fn_sernum);  in ipv6_route_seq_setup_walk()
2590 	INIT_LIST_HEAD(&iter->w.lh);  in ipv6_route_seq_setup_walk()
2591 	fib6_walker_link(net, &iter->w);  in ipv6_route_seq_setup_walk()
2617 	int sernum = READ_ONCE(iter->w.root->fn_sernum);  in ipv6_route_check_sernum()
2621 		iter->w.state = FWS_INIT;  in ipv6_route_check_sernum()
2622 		iter->w.node = iter->w.root;  in ipv6_route_check_sernum()
2623 		WARN_ON(iter->w.skip);  in ipv6_route_check_sernum()
2624 		iter->w.skip = iter->w.count;  in ipv6_route_check_sernum()
2646 	r = fib6_walk_continue(&iter->w);  in ipv6_route_seq_next()
2649 		return iter->w.leaf;  in ipv6_route_seq_next()
2651 		fib6_walker_unlink(net, &iter->w);  in ipv6_route_seq_next()
2654 	fib6_walker_unlink(net, &iter->w);  in ipv6_route_seq_next()
2686 	struct fib6_walker *w = &iter->w;  in ipv6_route_iter_active()  local
2687 	return w->node && !(w->state == FWS_U && w->node == w->root);  in ipv6_route_iter_active()
2697 		fib6_walker_unlink(net, &iter->w);  in ipv6_route_native_seq_stop()
2727 	iter->w.leaf = NULL;  in ipv6_route_seq_show()