Symbol: vertex
games/gomoku/bdinit.c
170
int mask, bmask, vertex, s;
games/gomoku/bdinit.c
181
sp1 = &board[vertex = cbp->c_vertex];
games/gomoku/bdinit.c
189
for (i = 0; i < s; i++, sp1 += d1, vertex += d1) {
games/gomoku/bdinit.c
204
ip[n] = vertex;
usr.sbin/ospf6d/area.c
50
struct vertex *v, *nv;
usr.sbin/ospf6d/ospf6d.h
135
struct vertex;
usr.sbin/ospf6d/ospf6d.h
137
RB_HEAD(lsa_tree, vertex);
usr.sbin/ospf6d/ospf6d.h
373
LIST_HEAD(, vertex) cand_list;
usr.sbin/ospf6d/rde.c
1204
struct vertex *v;
usr.sbin/ospf6d/rde.c
1225
struct vertex *v;
usr.sbin/ospf6d/rde.c
1254
struct vertex *v = NULL;
usr.sbin/ospf6d/rde.c
1398
orig_intra_lsa_net(struct area *area, struct iface *iface, struct vertex *old)
usr.sbin/ospf6d/rde.c
1401
struct vertex *v;
usr.sbin/ospf6d/rde.c
1480
orig_intra_lsa_rtr(struct area *area, struct vertex *old)
usr.sbin/ospf6d/rde.c
1609
struct vertex *old;
usr.sbin/ospf6d/rde.c
1687
struct vertex *v;
usr.sbin/ospf6d/rde.c
222
struct vertex *v, *nv;
usr.sbin/ospf6d/rde.c
273
struct vertex *v;
usr.sbin/ospf6d/rde.c
70
struct vertex *);
usr.sbin/ospf6d/rde.c
71
struct lsa *orig_intra_lsa_rtr(struct area *, struct vertex *);
usr.sbin/ospf6d/rde.c
913
struct vertex *v;
usr.sbin/ospf6d/rde.c
944
struct vertex *v;
usr.sbin/ospf6d/rde.h
141
int lsa_compare(struct vertex *, struct vertex *);
usr.sbin/ospf6d/rde.h
142
void vertex_free(struct vertex *);
usr.sbin/ospf6d/rde.h
143
void vertex_nexthop_clear(struct vertex *);
usr.sbin/ospf6d/rde.h
144
void vertex_nexthop_add(struct vertex *, struct vertex *,
usr.sbin/ospf6d/rde.h
148
int lsa_self(struct rde_nbr *, struct lsa *, struct vertex *);
usr.sbin/ospf6d/rde.h
151
void lsa_age(struct vertex *);
usr.sbin/ospf6d/rde.h
152
struct vertex *lsa_find(struct iface *, u_int16_t, u_int32_t, u_int32_t);
usr.sbin/ospf6d/rde.h
153
struct vertex *lsa_find_rtr(struct area *, u_int32_t);
usr.sbin/ospf6d/rde.h
154
struct vertex *lsa_find_rtr_frag(struct area *, u_int32_t, unsigned int);
usr.sbin/ospf6d/rde.h
155
struct vertex *lsa_find_tree(struct lsa_tree *, u_int16_t, u_int32_t,
usr.sbin/ospf6d/rde.h
159
u_int16_t lsa_num_links(struct vertex *);
usr.sbin/ospf6d/rde.h
162
void lsa_merge(struct rde_nbr *, struct lsa *, struct vertex *);
usr.sbin/ospf6d/rde.h
167
void rt_calc(struct vertex *, struct area *, struct ospfd_conf *);
usr.sbin/ospf6d/rde.h
168
void asext_calc(struct vertex *);
usr.sbin/ospf6d/rde.h
172
void cand_list_add(struct vertex *);
usr.sbin/ospf6d/rde.h
173
struct vertex *cand_list_pop(void);
usr.sbin/ospf6d/rde.h
174
int cand_list_present(struct vertex *);
usr.sbin/ospf6d/rde.h
190
struct lsa_rtr_link *get_rtr_link(struct vertex *, unsigned int);
usr.sbin/ospf6d/rde.h
191
struct lsa_net_link *get_net_link(struct vertex *, unsigned int);
usr.sbin/ospf6d/rde.h
193
RB_PROTOTYPE(lsa_tree, vertex, entry, lsa_compare)
usr.sbin/ospf6d/rde.h
31
struct vertex *prev;
usr.sbin/ospf6d/rde.h
39
RB_ENTRY(vertex) entry;
usr.sbin/ospf6d/rde.h
40
TAILQ_ENTRY(vertex) cand;
usr.sbin/ospf6d/rde_lsdb.c
108
vertex_nexthop_clear(struct vertex *v)
usr.sbin/ospf6d/rde_lsdb.c
119
vertex_nexthop_add(struct vertex *dst, struct vertex *parent,
usr.sbin/ospf6d/rde_lsdb.c
30
struct vertex *vertex_get(struct lsa *, struct rde_nbr *, struct lsa_tree *);
usr.sbin/ospf6d/rde_lsdb.c
36
void lsa_refresh(struct vertex *);
usr.sbin/ospf6d/rde_lsdb.c
40
RB_GENERATE(lsa_tree, vertex, entry, lsa_compare)
usr.sbin/ospf6d/rde_lsdb.c
424
lsa_self(struct rde_nbr *nbr, struct lsa *lsa, struct vertex *v)
usr.sbin/ospf6d/rde_lsdb.c
468
struct vertex *new, *old;
usr.sbin/ospf6d/rde_lsdb.c
49
lsa_compare(struct vertex *a, struct vertex *b)
usr.sbin/ospf6d/rde_lsdb.c
529
struct vertex *v;
usr.sbin/ospf6d/rde_lsdb.c
545
lsa_age(struct vertex *v)
usr.sbin/ospf6d/rde_lsdb.c
573
struct vertex *
usr.sbin/ospf6d/rde_lsdb.c
592
struct vertex *
usr.sbin/ospf6d/rde_lsdb.c
596
struct vertex key;
usr.sbin/ospf6d/rde_lsdb.c
597
struct vertex *v;
usr.sbin/ospf6d/rde_lsdb.c
615
struct vertex *
usr.sbin/ospf6d/rde_lsdb.c
621
struct vertex *
usr.sbin/ospf6d/rde_lsdb.c
624
struct vertex *v;
usr.sbin/ospf6d/rde_lsdb.c
625
struct vertex key;
usr.sbin/ospf6d/rde_lsdb.c
664
struct vertex *v;
usr.sbin/ospf6d/rde_lsdb.c
665
struct vertex key;
usr.sbin/ospf6d/rde_lsdb.c
67
struct vertex *
usr.sbin/ospf6d/rde_lsdb.c
699
lsa_num_links(struct vertex *v)
usr.sbin/ospf6d/rde_lsdb.c
70
struct vertex *v;
usr.sbin/ospf6d/rde_lsdb.c
727
struct vertex *v;
usr.sbin/ospf6d/rde_lsdb.c
73
if ((v = calloc(1, sizeof(struct vertex))) == NULL)
usr.sbin/ospf6d/rde_lsdb.c
756
struct vertex *v;
usr.sbin/ospf6d/rde_lsdb.c
809
struct vertex *v = bula;
usr.sbin/ospf6d/rde_lsdb.c
851
lsa_refresh(struct vertex *v)
usr.sbin/ospf6d/rde_lsdb.c
885
lsa_merge(struct rde_nbr *nbr, struct lsa *lsa, struct vertex *v)
usr.sbin/ospf6d/rde_lsdb.c
937
struct vertex *v, *nv;
usr.sbin/ospf6d/rde_lsdb.c
97
vertex_free(struct vertex *v)
usr.sbin/ospf6d/rde_spf.c
1095
get_rtr_link(struct vertex *v, unsigned int idx)
usr.sbin/ospf6d/rde_spf.c
1131
get_net_link(struct vertex *v, unsigned int idx)
usr.sbin/ospf6d/rde_spf.c
1156
linked(struct vertex *w, struct vertex *v)
usr.sbin/ospf6d/rde_spf.c
201
rt_calc(struct vertex *v, struct area *area, struct ospfd_conf *conf)
usr.sbin/ospf6d/rde_spf.c
203
struct vertex *w;
usr.sbin/ospf6d/rde_spf.c
33
TAILQ_HEAD(, vertex) cand_list;
usr.sbin/ospf6d/rde_spf.c
358
asext_calc(struct vertex *v)
usr.sbin/ospf6d/rde_spf.c
37
struct vertex *spf_root = NULL;
usr.sbin/ospf6d/rde_spf.c
39
struct in6_addr *calc_nexthop_lladdr(struct vertex *, struct lsa_rtr_link *,
usr.sbin/ospf6d/rde_spf.c
41
void calc_nexthop_transit_nbr(struct vertex *, struct vertex *,
usr.sbin/ospf6d/rde_spf.c
43
void calc_nexthop(struct vertex *, struct vertex *,
usr.sbin/ospf6d/rde_spf.c
451
struct vertex *v;
usr.sbin/ospf6d/rde_spf.c
460
calc_nexthop_lladdr(struct vertex *dst, struct lsa_rtr_link *rtr_link,
usr.sbin/ospf6d/rde_spf.c
464
struct vertex *link;
usr.sbin/ospf6d/rde_spf.c
494
calc_nexthop_transit_nbr(struct vertex *dst, struct vertex *parent,
usr.sbin/ospf6d/rde_spf.c
520
calc_nexthop(struct vertex *dst, struct vertex *parent,
usr.sbin/ospf6d/rde_spf.c
54
int linked(struct vertex *, struct vertex *);
usr.sbin/ospf6d/rde_spf.c
579
cand_list_add(struct vertex *v)
usr.sbin/ospf6d/rde_spf.c
581
struct vertex *c = NULL;
usr.sbin/ospf6d/rde_spf.c
59
struct vertex *v, *w;
usr.sbin/ospf6d/rde_spf.c
596
struct vertex *
usr.sbin/ospf6d/rde_spf.c
599
struct vertex *c;
usr.sbin/ospf6d/rde_spf.c
609
cand_list_present(struct vertex *v)
usr.sbin/ospf6d/rde_spf.c
611
struct vertex *c;
usr.sbin/ospf6d/rde_spf.c
624
struct vertex *c;
usr.sbin/ospf6d/rde_spf.c
635
struct vertex *v;
usr.sbin/ospfd/area.c
50
struct vertex *v, *nv;
usr.sbin/ospfd/ospfd.h
159
struct vertex;
usr.sbin/ospfd/ospfd.h
161
RB_HEAD(lsa_tree, vertex);
usr.sbin/ospfd/ospfd.h
388
LIST_HEAD(, vertex) cand_list;
usr.sbin/ospfd/rde.c
1197
struct vertex *v;
usr.sbin/ospfd/rde.c
1279
struct vertex *v;
usr.sbin/ospfd/rde.c
1387
struct vertex *v = NULL;
usr.sbin/ospfd/rde.c
208
struct vertex *v, *nv;
usr.sbin/ospfd/rde.c
261
struct vertex *v;
usr.sbin/ospfd/rde.c
850
struct vertex *v;
usr.sbin/ospfd/rde.c
885
struct vertex *v;
usr.sbin/ospfd/rde.h
131
int lsa_compare(struct vertex *, struct vertex *);
usr.sbin/ospfd/rde.h
132
void vertex_free(struct vertex *);
usr.sbin/ospfd/rde.h
133
void vertex_nexthop_clear(struct vertex *);
usr.sbin/ospfd/rde.h
134
void vertex_nexthop_add(struct vertex *, struct vertex *,
usr.sbin/ospfd/rde.h
138
int lsa_self(struct rde_nbr *, struct lsa *, struct vertex *);
usr.sbin/ospfd/rde.h
141
void lsa_age(struct vertex *);
usr.sbin/ospfd/rde.h
142
struct vertex *lsa_find(struct iface *, u_int8_t, u_int32_t, u_int32_t);
usr.sbin/ospfd/rde.h
143
struct vertex *lsa_find_area(struct area *, u_int8_t, u_int32_t, u_int32_t);
usr.sbin/ospfd/rde.h
144
struct vertex *lsa_find_net(struct area *area, u_int32_t);
usr.sbin/ospfd/rde.h
145
u_int16_t lsa_num_links(struct vertex *);
usr.sbin/ospfd/rde.h
148
void lsa_merge(struct rde_nbr *, struct lsa *, struct vertex *);
usr.sbin/ospfd/rde.h
154
void rt_calc(struct vertex *, struct area *, struct ospfd_conf *);
usr.sbin/ospfd/rde.h
155
void asext_calc(struct vertex *);
usr.sbin/ospfd/rde.h
159
void cand_list_add(struct vertex *);
usr.sbin/ospfd/rde.h
160
struct vertex *cand_list_pop(void);
usr.sbin/ospfd/rde.h
161
int cand_list_present(struct vertex *);
usr.sbin/ospfd/rde.h
178
RB_PROTOTYPE(lsa_tree, vertex, entry, lsa_compare)
usr.sbin/ospfd/rde.h
31
struct vertex *prev;
usr.sbin/ospfd/rde.h
38
RB_ENTRY(vertex) entry;
usr.sbin/ospfd/rde.h
39
TAILQ_ENTRY(vertex) cand;
usr.sbin/ospfd/rde_lsdb.c
107
vertex_nexthop_clear(struct vertex *v)
usr.sbin/ospfd/rde_lsdb.c
118
vertex_nexthop_add(struct vertex *dst, struct vertex *parent, u_int32_t nexthop)
usr.sbin/ospfd/rde_lsdb.c
30
struct vertex *vertex_get(struct lsa *, struct rde_nbr *, struct lsa_tree *);
usr.sbin/ospfd/rde_lsdb.c
33
struct vertex *lsa_find_tree(struct lsa_tree *, u_int16_t, u_int32_t,
usr.sbin/ospfd/rde_lsdb.c
331
lsa_self(struct rde_nbr *nbr, struct lsa *new, struct vertex *v)
usr.sbin/ospfd/rde_lsdb.c
36
void lsa_refresh(struct vertex *);
usr.sbin/ospfd/rde_lsdb.c
384
struct vertex *new, *old;
usr.sbin/ospfd/rde_lsdb.c
39
RB_GENERATE(lsa_tree, vertex, entry, lsa_compare)
usr.sbin/ospfd/rde_lsdb.c
443
struct vertex *v;
usr.sbin/ospfd/rde_lsdb.c
459
lsa_age(struct vertex *v)
usr.sbin/ospfd/rde_lsdb.c
48
lsa_compare(struct vertex *a, struct vertex *b)
usr.sbin/ospfd/rde_lsdb.c
487
struct vertex *
usr.sbin/ospfd/rde_lsdb.c
503
struct vertex *
usr.sbin/ospfd/rde_lsdb.c
510
struct vertex *
usr.sbin/ospfd/rde_lsdb.c
514
struct vertex key;
usr.sbin/ospfd/rde_lsdb.c
515
struct vertex *v;
usr.sbin/ospfd/rde_lsdb.c
533
struct vertex *
usr.sbin/ospfd/rde_lsdb.c
537
struct vertex *v;
usr.sbin/ospfd/rde_lsdb.c
555
lsa_num_links(struct vertex *v)
usr.sbin/ospfd/rde_lsdb.c
572
struct vertex *v;
usr.sbin/ospfd/rde_lsdb.c
609
struct vertex *v;
usr.sbin/ospfd/rde_lsdb.c
66
struct vertex *
usr.sbin/ospfd/rde_lsdb.c
660
struct vertex *v = bula;
usr.sbin/ospfd/rde_lsdb.c
69
struct vertex *v;
usr.sbin/ospfd/rde_lsdb.c
701
lsa_refresh(struct vertex *v)
usr.sbin/ospfd/rde_lsdb.c
72
if ((v = calloc(1, sizeof(struct vertex))) == NULL)
usr.sbin/ospfd/rde_lsdb.c
735
lsa_merge(struct rde_nbr *nbr, struct lsa *lsa, struct vertex *v)
usr.sbin/ospfd/rde_lsdb.c
786
struct vertex *v, *nv;
usr.sbin/ospfd/rde_lsdb.c
810
struct vertex *v;
usr.sbin/ospfd/rde_lsdb.c
96
vertex_free(struct vertex *v)
usr.sbin/ospfd/rde_spf.c
1024
linked(struct vertex *w, struct vertex *v)
usr.sbin/ospfd/rde_spf.c
175
rt_calc(struct vertex *v, struct area *area, struct ospfd_conf *conf)
usr.sbin/ospfd/rde_spf.c
177
struct vertex *w;
usr.sbin/ospfd/rde_spf.c
280
asext_calc(struct vertex *v)
usr.sbin/ospfd/rde_spf.c
33
TAILQ_HEAD(, vertex) cand_list;
usr.sbin/ospfd/rde_spf.c
362
struct vertex *v;
usr.sbin/ospfd/rde_spf.c
37
struct vertex *spf_root = NULL;
usr.sbin/ospfd/rde_spf.c
371
calc_nexthop(struct vertex *dst, struct vertex *parent,
usr.sbin/ospfd/rde_spf.c
39
void calc_nexthop(struct vertex *, struct vertex *,
usr.sbin/ospfd/rde_spf.c
459
cand_list_add(struct vertex *v)
usr.sbin/ospfd/rde_spf.c
461
struct vertex *c = NULL;
usr.sbin/ospfd/rde_spf.c
476
struct vertex *
usr.sbin/ospfd/rde_spf.c
479
struct vertex *c;
usr.sbin/ospfd/rde_spf.c
48
struct lsa_rtr_link *get_rtr_link(struct vertex *, int);
usr.sbin/ospfd/rde_spf.c
489
cand_list_present(struct vertex *v)
usr.sbin/ospfd/rde_spf.c
49
struct lsa_net_link *get_net_link(struct vertex *, int);
usr.sbin/ospfd/rde_spf.c
491
struct vertex *c;
usr.sbin/ospfd/rde_spf.c
50
int linked(struct vertex *, struct vertex *);
usr.sbin/ospfd/rde_spf.c
504
struct vertex *c;
usr.sbin/ospfd/rde_spf.c
515
struct vertex *v;
usr.sbin/ospfd/rde_spf.c
55
struct vertex *v, *w;
usr.sbin/ospfd/rde_spf.c
971
get_rtr_link(struct vertex *v, int idx)
usr.sbin/ospfd/rde_spf.c
998
get_net_link(struct vertex *v, int idx)