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()
458 static int fib6_node_dump(struct fib6_walker *w)  in fib6_node_dump()  argument
462 	err = fib6_rt_dump(w->leaf, w->args);  in fib6_node_dump()
463 	w->leaf = NULL;  in fib6_node_dump()
468 			   struct fib6_walker *w)  in fib6_table_dump()  argument
472 	w->root = &tb->tb6_root;  in fib6_table_dump()
474 	err = fib6_walk(net, w);  in fib6_table_dump()
484 	struct fib6_walker *w;  in fib6_tables_dump()  local
488 	w = kzalloc(sizeof(*w), GFP_ATOMIC);  in fib6_tables_dump()
489 	if (!w)  in fib6_tables_dump()
492 	w->func = fib6_node_dump;  in fib6_tables_dump()
496 	w->args = &arg;  in fib6_tables_dump()
503 			err = fib6_table_dump(net, tb, w);  in fib6_tables_dump()
510 	kfree(w);  in fib6_tables_dump()
516 static int fib6_dump_node(struct fib6_walker *w)  in fib6_dump_node()  argument
521 	for_each_fib6_walker_rt(w) {  in fib6_dump_node()
522 		res = rt6_dump_route(rt, w->args, w->skip_in_node);  in fib6_dump_node()
525 			w->leaf = rt;  in fib6_dump_node()
530 			w->skip_in_node += res;  in fib6_dump_node()
534 		w->skip_in_node = 0;  in fib6_dump_node()
546 	w->leaf = NULL;  in fib6_dump_node()
553 	struct fib6_walker *w = (void *)cb->args[2];  in fib6_dump_end()  local
555 	if (w) {  in fib6_dump_end()
558 			fib6_walker_unlink(net, w);  in fib6_dump_end()
561 		kfree(w);  in fib6_dump_end()
577 	struct fib6_walker *w;  in fib6_dump_table()  local
580 	w = (void *)cb->args[2];  in fib6_dump_table()
581 	w->root = &table->tb6_root;  in fib6_dump_table()
584 		w->count = 0;  in fib6_dump_table()
585 		w->skip = 0;  in fib6_dump_table()
586 		w->skip_in_node = 0;  in fib6_dump_table()
589 		res = fib6_walk(net, w);  in fib6_dump_table()
593 			cb->args[5] = READ_ONCE(w->root->fn_sernum);  in fib6_dump_table()
596 		int sernum = READ_ONCE(w->root->fn_sernum);  in fib6_dump_table()
600 			w->state = FWS_INIT;  in fib6_dump_table()
601 			w->node = w->root;  in fib6_dump_table()
602 			w->skip = w->count;  in fib6_dump_table()
603 			w->skip_in_node = 0;  in fib6_dump_table()
605 			w->skip = 0;  in fib6_dump_table()
608 		res = fib6_walk_continue(w);  in fib6_dump_table()
611 			fib6_walker_unlink(net, w);  in fib6_dump_table()
627 	struct fib6_walker *w;  in inet6_dump_fib()  local
645 	w = (void *)cb->args[2];  in inet6_dump_fib()
646 	if (!w) {  in inet6_dump_fib()
657 		w = kzalloc(sizeof(*w), GFP_ATOMIC);  in inet6_dump_fib()
658 		if (!w)  in inet6_dump_fib()
660 		w->func = fib6_dump_node;  in inet6_dump_fib()
661 		cb->args[2] = (long)w;  in inet6_dump_fib()
667 	w->args = &arg;  in inet6_dump_fib()
1785 	struct fib6_walker *w;  in fib6_repair_tree()  local
1871 		FOR_WALKERS(net, w) {  in fib6_repair_tree()
1873 				if (w->node == fn) {  in fib6_repair_tree()
1874 					RT6_TRACE("W %p adjusted by delnode 1, s=%d/%d\n", w, w->state, nstate);  in fib6_repair_tree()
1875 					w->node = pn;  in fib6_repair_tree()
1876 					w->state = nstate;  in fib6_repair_tree()
1879 				if (w->node == fn) {  in fib6_repair_tree()
1880 					w->node = child;  in fib6_repair_tree()
1882 						RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);  in fib6_repair_tree()
1883 						w->state = w->state >= FWS_R ? FWS_U : FWS_INIT;  in fib6_repair_tree()
1885 						RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);  in fib6_repair_tree()
1886 						w->state = w->state >= FWS_C ? FWS_U : FWS_INIT;  in fib6_repair_tree()
1907 	struct fib6_walker *w;  in fib6_del_route()  local
1961 	FOR_WALKERS(net, w) {  in fib6_del_route()
1962 		if (w->state == FWS_C && w->leaf == rt) {  in fib6_del_route()
1963 			RT6_TRACE("walker %p adjusted by delroute\n", w);  in fib6_del_route()
1964 			w->leaf = rcu_dereference_protected(rt->fib6_next,  in fib6_del_route()
1966 			if (!w->leaf)  in fib6_del_route()
1967 				w->state = FWS_U;  in fib6_del_route()
2063 static int fib6_walk_continue(struct fib6_walker *w)  in fib6_walk_continue()  argument
2068 	WARN_ON_ONCE(!(w->root->fn_flags & RTN_TL_ROOT));  in fib6_walk_continue()
2071 		fn = w->node;  in fib6_walk_continue()
2075 		switch (w->state) {  in fib6_walk_continue()
2079 				w->node = FIB6_SUBTREE(fn);  in fib6_walk_continue()
2082 			w->state = FWS_L;  in fib6_walk_continue()
2088 				w->node = left;  in fib6_walk_continue()
2089 				w->state = FWS_INIT;  in fib6_walk_continue()
2092 			w->state = FWS_R;  in fib6_walk_continue()
2097 				w->node = right;  in fib6_walk_continue()
2098 				w->state = FWS_INIT;  in fib6_walk_continue()
2101 			w->state = FWS_C;  in fib6_walk_continue()
2102 			w->leaf = rcu_dereference_protected(fn->leaf, 1);  in fib6_walk_continue()
2105 			if (w->leaf && fn->fn_flags & RTN_RTINFO) {  in fib6_walk_continue()
2108 				if (w->skip) {  in fib6_walk_continue()
2109 					w->skip--;  in fib6_walk_continue()
2113 				err = w->func(w);  in fib6_walk_continue()
2117 				w->count++;  in fib6_walk_continue()
2121 			w->state = FWS_U;  in fib6_walk_continue()
2124 			if (fn == w->root)  in fib6_walk_continue()
2129 			w->node = pn;  in fib6_walk_continue()
2133 				w->state = FWS_L;  in fib6_walk_continue()
2138 				w->state = FWS_R;  in fib6_walk_continue()
2142 				w->state = FWS_C;  in fib6_walk_continue()
2143 				w->leaf = rcu_dereference_protected(w->node->leaf, 1);  in fib6_walk_continue()
2153 static int fib6_walk(struct net *net, struct fib6_walker *w)  in fib6_walk()  argument
2157 	w->state = FWS_INIT;  in fib6_walk()
2158 	w->node = w->root;  in fib6_walk()
2160 	fib6_walker_link(net, w);  in fib6_walk()
2161 	res = fib6_walk_continue(w);  in fib6_walk()
2163 		fib6_walker_unlink(net, w);  in fib6_walk()
2167 static int fib6_clean_node(struct fib6_walker *w)  in fib6_clean_node()  argument
2171 	struct fib6_cleaner *c = container_of(w, struct fib6_cleaner, w);  in fib6_clean_node()
2178 	    READ_ONCE(w->node->fn_sernum) != c->sernum)  in fib6_clean_node()
2179 		WRITE_ONCE(w->node->fn_sernum, c->sernum);  in fib6_clean_node()
2183 		w->leaf = NULL;  in fib6_clean_node()
2187 	for_each_fib6_walker_rt(w) {  in fib6_clean_node()
2190 			w->leaf = rt;  in fib6_clean_node()
2211 	w->leaf = rt;  in fib6_clean_node()
2230 	c.w.root = root;  in fib6_clean_tree()
2231 	c.w.func = fib6_clean_node;  in fib6_clean_tree()
2232 	c.w.count = 0;  in fib6_clean_tree()
2233 	c.w.skip = 0;  in fib6_clean_tree()
2234 	c.w.skip_in_node = 0;  in fib6_clean_tree()
2241 	fib6_walk(net, &c.w);  in fib6_clean_tree()
2515 	iter->w.leaf = NULL;  in ipv6_route_native_seq_show()
2519 static int ipv6_route_yield(struct fib6_walker *w)  in ipv6_route_yield()  argument
2521 	struct ipv6_route_iter *iter = w->args;  in ipv6_route_yield()
2527 		iter->w.leaf = rcu_dereference_protected(  in ipv6_route_yield()
2528 				iter->w.leaf->fib6_next,  in ipv6_route_yield()
2531 		if (!iter->skip && iter->w.leaf)  in ipv6_route_yield()
2533 	} while (iter->w.leaf);  in ipv6_route_yield()
2541 	memset(&iter->w, 0, sizeof(iter->w));  in ipv6_route_seq_setup_walk()
2542 	iter->w.func = ipv6_route_yield;  in ipv6_route_seq_setup_walk()
2543 	iter->w.root = &iter->tbl->tb6_root;  in ipv6_route_seq_setup_walk()
2544 	iter->w.state = FWS_INIT;  in ipv6_route_seq_setup_walk()
2545 	iter->w.node = iter->w.root;  in ipv6_route_seq_setup_walk()
2546 	iter->w.args = iter;  in ipv6_route_seq_setup_walk()
2547 	iter->sernum = READ_ONCE(iter->w.root->fn_sernum);  in ipv6_route_seq_setup_walk()
2548 	INIT_LIST_HEAD(&iter->w.lh);  in ipv6_route_seq_setup_walk()
2549 	fib6_walker_link(net, &iter->w);  in ipv6_route_seq_setup_walk()
2575 	int sernum = READ_ONCE(iter->w.root->fn_sernum);  in ipv6_route_check_sernum()
2579 		iter->w.state = FWS_INIT;  in ipv6_route_check_sernum()
2580 		iter->w.node = iter->w.root;  in ipv6_route_check_sernum()
2581 		WARN_ON(iter->w.skip);  in ipv6_route_check_sernum()
2582 		iter->w.skip = iter->w.count;  in ipv6_route_check_sernum()
2604 	r = fib6_walk_continue(&iter->w);  in ipv6_route_seq_next()
2607 		return iter->w.leaf;  in ipv6_route_seq_next()
2609 		fib6_walker_unlink(net, &iter->w);  in ipv6_route_seq_next()
2612 	fib6_walker_unlink(net, &iter->w);  in ipv6_route_seq_next()
2644 	struct fib6_walker *w = &iter->w;  in ipv6_route_iter_active()  local
2645 	return w->node && !(w->state == FWS_U && w->node == w->root);  in ipv6_route_iter_active()
2655 		fib6_walker_unlink(net, &iter->w);  in ipv6_route_native_seq_stop()
2685 	iter->w.leaf = NULL;  in ipv6_route_seq_show()