Home
last modified time | relevance | path

Searched refs:radix_node (Results 1 – 25 of 25) sorted by relevance

/freebsd-11-stable/sbin/routed/
HDradix.h44 struct radix_node { struct
46 struct radix_node *rn_p; /* parent */ argument
57 struct radix_node *rn_Dupedkey; argument
61 struct radix_node *rn_L;/* progeny */
62 struct radix_node *rn_R;/* progeny */
67 struct radix_node *rn_twin; argument
68 struct radix_node *rn_ybro; argument
90 struct radix_node *rmu_leaf; /* for normal routes */
108 struct radix_node *rnh_treetop;
111 struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
[all …]
HDradix.c65 static int rn_satisfies_leaf(char *, struct radix_node *, int);
66 static struct radix_node *rn_addmask(void *n_arg, int search, int skip);
67 static struct radix_node *rn_addroute(void *v_arg, void *n_arg,
68 struct radix_node_head *head, struct radix_node treenodes[2]);
69 static struct radix_node *rn_match(void *v_arg, struct radix_node_head *head);
105 static struct radix_node *
107 struct radix_node *head) in rn_search()
109 struct radix_node *x; in rn_search()
121 static struct radix_node *
123 struct radix_node *head, in rn_search_m()
[all …]
HDdefs.h187 struct radix_node rt_nodes[2]; /* radix tree glue */
625 int walk_bad(struct radix_node *, struct walkarg *);
HDtable.c1406 walk_kern(struct radix_node *rn, in walk_kern()
1976 walk_bad(struct radix_node *rn, in walk_bad()
2019 walk_age(struct radix_node *rn, in walk_age()
HDoutput.c441 walk_supply(struct radix_node *rn, in walk_supply()
HDtrace.c837 walk_trace(struct radix_node *rn, in walk_trace()
/freebsd-11-stable/sys/net/
HDradix.h50 struct radix_node { struct
52 struct radix_node *rn_parent; /* parent */ argument
63 struct radix_node *rn_Dupedkey; argument
67 struct radix_node *rn_L;/* progeny */
68 struct radix_node *rn_R;/* progeny */
73 struct radix_node *rn_twin; argument
74 struct radix_node *rn_ybro; argument
96 struct radix_node *rmu_leaf; /* for normal routes */
106 typedef int walktree_f_t(struct radix_node *, void *);
107 typedef struct radix_node *rn_matchaddr_f_t(void *v,
[all …]
HDradix.c59 static struct radix_node
61 struct radix_node [2]),
62 *rn_newpair(void *, int, struct radix_node[2]),
63 *rn_search(void *, struct radix_node *),
64 *rn_search_m(void *, struct radix_node *, void *);
65 static struct radix_node *rn_addmask(void *, struct radix_mask_head *, int,int);
82 rn_new_radix_mask(struct radix_node *tt,
84 static int rn_satisfies_leaf(char *trial, struct radix_node *leaf,
147 static struct radix_node *
148 rn_search(void *v_arg, struct radix_node *head) in rn_search()
[all …]
HDradix_mpath.c74 struct radix_node *
75 rn_mpath_next(struct radix_node *rn) in rn_mpath_next()
77 struct radix_node *next; in rn_mpath_next()
89 rn_mpath_count(struct radix_node *rn) in rn_mpath_count()
105 struct radix_node *rn; in rt_mpath_matchgate()
111 rn = (struct radix_node *)rt; in rt_mpath_matchgate()
145 struct radix_node *t, *tt; in rt_mpath_deldup()
149 t = (struct radix_node *)headrt; in rt_mpath_deldup()
152 if (tt == (struct radix_node *)rt) { in rt_mpath_deldup()
160 tt = rn_mpath_next((struct radix_node *)t); in rt_mpath_deldup()
[all …]
HDradix_mpath.h50 struct radix_node *rn_mpath_next(struct radix_node *);
51 u_int32_t rn_mpath_count(struct radix_node *);
HDroute.c148 static struct radix_node *rt_mpath_unlink(struct rib_head *rnh,
160 static int if_updatemtu_cb(struct radix_node *, void *);
369 rt_freeentry(struct radix_node *rn, void *arg) in rt_freeentry()
372 struct radix_node *x; in rt_freeentry()
374 x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh); in rt_freeentry()
443 struct radix_node *rn; in rtalloc1_fib()
529 rnh->rnh_close((struct radix_node *)rt, &rnh->head); in rtfree()
927 struct radix_node *rn; in rib_lookup_info()
1021 rt_checkdelroute(struct radix_node *rn, void *arg) in rt_checkdelroute()
1178 struct radix_node *rn; in rt_unlinkrte()
[all …]
HDroute_var.h46 struct radix_node rnh_nodes[3]; /* empty tree for common case */
HDroute.h140 struct radix_node rt_nodes[2]; /* tree glue, and other values */
HDrtsock.c168 static int sysctl_dumpentry(struct radix_node *rn, void *vw);
1543 sysctl_dumpentry(struct radix_node *rn, void *vw) in sysctl_dumpentry()
HDpfvar.h1047 struct radix_node pfrke_node[2];
/freebsd-11-stable/sys/netinet/
HDin_rmx.c60 static struct radix_node *
62 struct radix_node *treenodes) in in_addroute()
HDin_fib.c138 struct radix_node *rn; in fib4_lookup_nh_basic()
186 struct radix_node *rn; in fib4_lookup_nh_ext()
/freebsd-11-stable/sys/netinet6/
HDin6_rmx.c105 static struct radix_node *
107 struct radix_node *treenodes) in in6_addroute()
HDin6_fib.c175 struct radix_node *rn; in fib6_lookup_nh_basic()
224 struct radix_node *rn; in fib6_lookup_nh_ext()
/freebsd-11-stable/sys/kern/
HDvfs_export.c70 static int vfs_free_netcred(struct radix_node *rn, void *w);
80 struct radix_node netc_rnodes[2];
107 struct radix_node *rn; in vfs_hang_addrlist()
237 vfs_free_netcred(struct radix_node *rn, void *w) in vfs_free_netcred()
/freebsd-11-stable/tools/debugscripts/
HDnetstat-anr.gdb99 set $rn = (struct radix_node *)$arg0
117 set $rn_$arg0 = (struct radix_node *)$arg1
/freebsd-11-stable/sys/netpfil/pf/
HDpf_table.c90 ((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
164 static int pfr_walktree(struct radix_node *, void *);
996 struct radix_node *rn; in pfr_route_kentry()
1020 struct radix_node *rn; in pfr_unroute_kentry()
1084 pfr_walktree(struct radix_node *rn, void *arg) in pfr_walktree()
HDpf.c5331 struct radix_node *rn; in pf_routable_oldmpath()
5395 rn = (struct radix_node *)ro.ro_rt; in pf_routable_oldmpath()
/freebsd-11-stable/sys/netpfil/ipfw/
HDip_fw_table_algo.c328 struct radix_node rn[2];
342 struct radix_node rn[2];
376 static int flush_radix_entry(struct radix_node *rn, void *arg);
459 flush_radix_entry(struct radix_node *rn, void *arg) in flush_radix_entry()
711 struct radix_node *rn; in ta_add_radix()
812 struct radix_node *rn; in ta_del_radix()
/freebsd-11-stable/sys/nfs/
HDbootp_subr.c267 void bootpboot_p_tree(struct radix_node *rn);
357 bootpboot_p_tree(struct radix_node *rn) in bootpboot_p_tree()