2397 if (IS_TNODE(n)) { |
2397 if (IS_TNODE(n)) { |
2398 struct tnode *tn = (struct tnode *) n; |
2398 struct tnode *tn = (struct tnode *) n; |
2399 __be32 prf = htonl(mask_pfx(tn->key, tn->pos)); |
2399 __be32 prf = htonl(mask_pfx(tn->key, tn->pos)); |
2400 |
2400 |
2401 seq_indent(seq, iter->depth-1); |
2401 seq_indent(seq, iter->depth-1); |
2402 seq_printf(seq, " +-- " NIPQUAD_FMT "/%d %d %d %d\n", |
2402 seq_printf(seq, " +-- %pI4/%d %d %d %d\n", |
2403 NIPQUAD(prf), tn->pos, tn->bits, tn->full_children, |
2403 &prf, tn->pos, tn->bits, tn->full_children, |
2404 tn->empty_children); |
2404 tn->empty_children); |
2405 |
2405 |
2406 } else { |
2406 } else { |
2407 struct leaf *l = (struct leaf *) n; |
2407 struct leaf *l = (struct leaf *) n; |
2408 struct leaf_info *li; |
2408 struct leaf_info *li; |
2409 struct hlist_node *node; |
2409 struct hlist_node *node; |
2410 __be32 val = htonl(l->key); |
2410 __be32 val = htonl(l->key); |
2411 |
2411 |
2412 seq_indent(seq, iter->depth); |
2412 seq_indent(seq, iter->depth); |
2413 seq_printf(seq, " |-- " NIPQUAD_FMT "\n", NIPQUAD(val)); |
2413 seq_printf(seq, " |-- %pI4\n", &val); |
2414 |
2414 |
2415 hlist_for_each_entry_rcu(li, node, &l->list, hlist) { |
2415 hlist_for_each_entry_rcu(li, node, &l->list, hlist) { |
2416 struct fib_alias *fa; |
2416 struct fib_alias *fa; |
2417 |
2417 |
2418 list_for_each_entry_rcu(fa, &li->falh, fa_list) { |
2418 list_for_each_entry_rcu(fa, &li->falh, fa_list) { |