Lines Matching refs:w
50 struct fib6_walker w; member
68 static int fib6_walk(struct fib6_walker *w);
69 static int fib6_walk_continue(struct fib6_walker *w);
81 #define FOR_WALKERS(w) list_for_each_entry(w, &fib6_walkers, lh) argument
83 static void fib6_walker_link(struct fib6_walker *w) in fib6_walker_link() argument
86 list_add(&w->lh, &fib6_walkers); in fib6_walker_link()
90 static void fib6_walker_unlink(struct fib6_walker *w) in fib6_walker_unlink() argument
93 list_del(&w->lh); in fib6_walker_unlink()
268 static int fib6_dump_node(struct fib6_walker *w) in fib6_dump_node() argument
273 for (rt = w->leaf; rt; rt = rt->dst.rt6_next) { in fib6_dump_node()
274 res = rt6_dump_route(rt, w->args); in fib6_dump_node()
277 w->leaf = rt; in fib6_dump_node()
281 w->leaf = NULL; in fib6_dump_node()
287 struct fib6_walker *w = (void *)cb->args[2]; in fib6_dump_end() local
289 if (w) { in fib6_dump_end()
292 fib6_walker_unlink(w); in fib6_dump_end()
295 kfree(w); in fib6_dump_end()
310 struct fib6_walker *w; in fib6_dump_table() local
313 w = (void *)cb->args[2]; in fib6_dump_table()
314 w->root = &table->tb6_root; in fib6_dump_table()
317 w->count = 0; in fib6_dump_table()
318 w->skip = 0; in fib6_dump_table()
321 res = fib6_walk(w); in fib6_dump_table()
325 cb->args[5] = w->root->fn_sernum; in fib6_dump_table()
328 if (cb->args[5] != w->root->fn_sernum) { in fib6_dump_table()
330 cb->args[5] = w->root->fn_sernum; in fib6_dump_table()
331 w->state = FWS_INIT; in fib6_dump_table()
332 w->node = w->root; in fib6_dump_table()
333 w->skip = w->count; in fib6_dump_table()
335 w->skip = 0; in fib6_dump_table()
338 res = fib6_walk_continue(w); in fib6_dump_table()
341 fib6_walker_unlink(w); in fib6_dump_table()
355 struct fib6_walker *w; in inet6_dump_fib() local
363 w = (void *)cb->args[2]; in inet6_dump_fib()
364 if (!w) { in inet6_dump_fib()
375 w = kzalloc(sizeof(*w), GFP_ATOMIC); in inet6_dump_fib()
376 if (!w) in inet6_dump_fib()
378 w->func = fib6_dump_node; in inet6_dump_fib()
379 cb->args[2] = (long)w; in inet6_dump_fib()
385 w->args = &arg; in inet6_dump_fib()
1235 struct fib6_walker *w; in fib6_repair_tree() local
1295 FOR_WALKERS(w) { in fib6_repair_tree()
1297 if (w->root == fn) { in fib6_repair_tree()
1298 w->root = w->node = NULL; in fib6_repair_tree()
1299 RT6_TRACE("W %p adjusted by delroot 1\n", w); in fib6_repair_tree()
1300 } else if (w->node == fn) { in fib6_repair_tree()
1301 RT6_TRACE("W %p adjusted by delnode 1, s=%d/%d\n", w, w->state, nstate); in fib6_repair_tree()
1302 w->node = pn; in fib6_repair_tree()
1303 w->state = nstate; in fib6_repair_tree()
1306 if (w->root == fn) { in fib6_repair_tree()
1307 w->root = child; in fib6_repair_tree()
1308 RT6_TRACE("W %p adjusted by delroot 2\n", w); in fib6_repair_tree()
1310 if (w->node == fn) { in fib6_repair_tree()
1311 w->node = child; in fib6_repair_tree()
1313 RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state); in fib6_repair_tree()
1314 w->state = w->state >= FWS_R ? FWS_U : FWS_INIT; in fib6_repair_tree()
1316 RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state); in fib6_repair_tree()
1317 w->state = w->state >= FWS_C ? FWS_U : FWS_INIT; in fib6_repair_tree()
1337 struct fib6_walker *w; in fib6_del_route() local
1366 FOR_WALKERS(w) { in fib6_del_route()
1367 if (w->state == FWS_C && w->leaf == rt) { in fib6_del_route()
1368 RT6_TRACE("walker %p adjusted by delroute\n", w); in fib6_del_route()
1369 w->leaf = rt->dst.rt6_next; in fib6_del_route()
1370 if (!w->leaf) in fib6_del_route()
1371 w->state = FWS_U; in fib6_del_route()
1458 static int fib6_walk_continue(struct fib6_walker *w) in fib6_walk_continue() argument
1463 fn = w->node; in fib6_walk_continue()
1467 if (w->prune && fn != w->root && in fib6_walk_continue()
1468 fn->fn_flags & RTN_RTINFO && w->state < FWS_C) { in fib6_walk_continue()
1469 w->state = FWS_C; in fib6_walk_continue()
1470 w->leaf = fn->leaf; in fib6_walk_continue()
1472 switch (w->state) { in fib6_walk_continue()
1476 w->node = FIB6_SUBTREE(fn); in fib6_walk_continue()
1479 w->state = FWS_L; in fib6_walk_continue()
1483 w->node = fn->left; in fib6_walk_continue()
1484 w->state = FWS_INIT; in fib6_walk_continue()
1487 w->state = FWS_R; in fib6_walk_continue()
1490 w->node = fn->right; in fib6_walk_continue()
1491 w->state = FWS_INIT; in fib6_walk_continue()
1494 w->state = FWS_C; in fib6_walk_continue()
1495 w->leaf = fn->leaf; in fib6_walk_continue()
1497 if (w->leaf && fn->fn_flags & RTN_RTINFO) { in fib6_walk_continue()
1500 if (w->skip) { in fib6_walk_continue()
1501 w->skip--; in fib6_walk_continue()
1505 err = w->func(w); in fib6_walk_continue()
1509 w->count++; in fib6_walk_continue()
1513 w->state = FWS_U; in fib6_walk_continue()
1515 if (fn == w->root) in fib6_walk_continue()
1518 w->node = pn; in fib6_walk_continue()
1522 w->state = FWS_L; in fib6_walk_continue()
1527 w->state = FWS_R; in fib6_walk_continue()
1531 w->state = FWS_C; in fib6_walk_continue()
1532 w->leaf = w->node->leaf; in fib6_walk_continue()
1542 static int fib6_walk(struct fib6_walker *w) in fib6_walk() argument
1546 w->state = FWS_INIT; in fib6_walk()
1547 w->node = w->root; in fib6_walk()
1549 fib6_walker_link(w); in fib6_walk()
1550 res = fib6_walk_continue(w); in fib6_walk()
1552 fib6_walker_unlink(w); in fib6_walk()
1556 static int fib6_clean_node(struct fib6_walker *w) in fib6_clean_node() argument
1560 struct fib6_cleaner *c = container_of(w, struct fib6_cleaner, w); in fib6_clean_node()
1566 w->node->fn_sernum != c->sernum) in fib6_clean_node()
1567 w->node->fn_sernum = c->sernum; in fib6_clean_node()
1571 w->leaf = NULL; in fib6_clean_node()
1575 for (rt = w->leaf; rt; rt = rt->dst.rt6_next) { in fib6_clean_node()
1578 w->leaf = rt; in fib6_clean_node()
1591 w->leaf = rt; in fib6_clean_node()
1612 c.w.root = root; in fib6_clean_tree()
1613 c.w.func = fib6_clean_node; in fib6_clean_tree()
1614 c.w.prune = prune; in fib6_clean_tree()
1615 c.w.count = 0; in fib6_clean_tree()
1616 c.w.skip = 0; in fib6_clean_tree()
1622 fib6_walk(&c.w); in fib6_clean_tree()
1880 struct fib6_walker w; member
1907 iter->w.leaf = NULL; in ipv6_route_seq_show()
1911 static int ipv6_route_yield(struct fib6_walker *w) in ipv6_route_yield() argument
1913 struct ipv6_route_iter *iter = w->args; in ipv6_route_yield()
1919 iter->w.leaf = iter->w.leaf->dst.rt6_next; in ipv6_route_yield()
1921 if (!iter->skip && iter->w.leaf) in ipv6_route_yield()
1923 } while (iter->w.leaf); in ipv6_route_yield()
1930 memset(&iter->w, 0, sizeof(iter->w)); in ipv6_route_seq_setup_walk()
1931 iter->w.func = ipv6_route_yield; in ipv6_route_seq_setup_walk()
1932 iter->w.root = &iter->tbl->tb6_root; in ipv6_route_seq_setup_walk()
1933 iter->w.state = FWS_INIT; in ipv6_route_seq_setup_walk()
1934 iter->w.node = iter->w.root; in ipv6_route_seq_setup_walk()
1935 iter->w.args = iter; in ipv6_route_seq_setup_walk()
1936 iter->sernum = iter->w.root->fn_sernum; in ipv6_route_seq_setup_walk()
1937 INIT_LIST_HEAD(&iter->w.lh); in ipv6_route_seq_setup_walk()
1938 fib6_walker_link(&iter->w); in ipv6_route_seq_setup_walk()
1964 if (iter->sernum != iter->w.root->fn_sernum) { in ipv6_route_check_sernum()
1965 iter->sernum = iter->w.root->fn_sernum; in ipv6_route_check_sernum()
1966 iter->w.state = FWS_INIT; in ipv6_route_check_sernum()
1967 iter->w.node = iter->w.root; in ipv6_route_check_sernum()
1968 WARN_ON(iter->w.skip); in ipv6_route_check_sernum()
1969 iter->w.skip = iter->w.count; in ipv6_route_check_sernum()
1992 r = fib6_walk_continue(&iter->w); in ipv6_route_seq_next()
1997 return iter->w.leaf; in ipv6_route_seq_next()
1999 fib6_walker_unlink(&iter->w); in ipv6_route_seq_next()
2002 fib6_walker_unlink(&iter->w); in ipv6_route_seq_next()
2032 struct fib6_walker *w = &iter->w; in ipv6_route_iter_active() local
2033 return w->node && !(w->state == FWS_U && w->node == w->root); in ipv6_route_iter_active()
2042 fib6_walker_unlink(&iter->w); in ipv6_route_seq_stop()