Home
last modified time | relevance | path

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

12

/openbsd/usr.sbin/ospf6d/
H A Drde.h31 struct vertex *prev;
38 struct vertex { struct
39 RB_ENTRY(vertex) entry;
40 TAILQ_ENTRY(vertex) cand;
141 int lsa_compare(struct vertex *, struct vertex *);
142 void vertex_free(struct vertex *);
144 void vertex_nexthop_add(struct vertex *, struct vertex *,
151 void lsa_age(struct vertex *);
168 void asext_calc(struct vertex *);
172 void cand_list_add(struct vertex *);
[all …]
H A Drde_lsdb.c49 lsa_compare(struct vertex *a, struct vertex *b) in lsa_compare()
67 struct vertex *
70 struct vertex *v; in vertex_get()
119 vertex_nexthop_add(struct vertex *dst, struct vertex *parent, in vertex_nexthop_add()
529 struct vertex *v; in lsa_del()
573 struct vertex *
592 struct vertex *
597 struct vertex *v; in lsa_find_tree()
615 struct vertex *
621 struct vertex *
[all …]
H A Drde_spf.c41 void calc_nexthop_transit_nbr(struct vertex *, struct vertex *,
43 void calc_nexthop(struct vertex *, struct vertex *,
54 int linked(struct vertex *, struct vertex *);
203 struct vertex *w; in rt_calc()
451 struct vertex *v; in spf_tree_clr()
520 calc_nexthop(struct vertex *dst, struct vertex *parent, in calc_nexthop()
596 struct vertex *
599 struct vertex *c; in cand_list_pop()
611 struct vertex *c; in cand_list_present()
624 struct vertex *c; in cand_list_clr()
[all …]
H A Drde.c70 struct vertex *);
222 struct vertex *v, *nv; in rde_shutdown()
273 struct vertex *v; in rde_dispatch_imsg()
913 struct vertex *v; in rde_send_summary()
944 struct vertex *v; in rde_send_summary_area()
1204 struct vertex *v; in rde_asext_get()
1225 struct vertex *v; in rde_asext_put()
1254 struct vertex *v = NULL; in rde_summary_update()
1401 struct vertex *v; in RB_GENERATE()
1609 struct vertex *old; in orig_intra_area_prefix_lsas()
[all …]
H A Dospf6d.h135 struct vertex;
137 RB_HEAD(lsa_tree, vertex);
373 LIST_HEAD(, vertex) cand_list;
H A Darea.c50 struct vertex *v, *nv; in area_del()
/openbsd/usr.sbin/ospfd/
H A Drde.h31 struct vertex *prev;
37 struct vertex { struct
38 RB_ENTRY(vertex) entry;
39 TAILQ_ENTRY(vertex) cand;
131 int lsa_compare(struct vertex *, struct vertex *);
132 void vertex_free(struct vertex *);
134 void vertex_nexthop_add(struct vertex *, struct vertex *,
141 void lsa_age(struct vertex *);
155 void asext_calc(struct vertex *);
159 void cand_list_add(struct vertex *);
[all …]
H A Drde_lsdb.c48 lsa_compare(struct vertex *a, struct vertex *b) in lsa_compare()
66 struct vertex *
69 struct vertex *v; in vertex_get()
443 struct vertex *v; in lsa_del()
487 struct vertex *
503 struct vertex *
510 struct vertex *
515 struct vertex *v; in lsa_find_tree()
533 struct vertex *
537 struct vertex *v; in lsa_find_net()
[all …]
H A Drde_spf.c39 void calc_nexthop(struct vertex *, struct vertex *,
50 int linked(struct vertex *, struct vertex *);
177 struct vertex *w; in rt_calc()
362 struct vertex *v; in spf_tree_clr()
371 calc_nexthop(struct vertex *dst, struct vertex *parent, in calc_nexthop()
476 struct vertex *
479 struct vertex *c; in cand_list_pop()
491 struct vertex *c; in cand_list_present()
504 struct vertex *c; in cand_list_clr()
515 struct vertex *v; in spf_timer()
[all …]
H A Dospfd.h159 struct vertex;
161 RB_HEAD(lsa_tree, vertex);
388 LIST_HEAD(, vertex) cand_list;
H A Drde.c208 struct vertex *v, *nv; in rde_shutdown()
261 struct vertex *v; in rde_dispatch_imsg()
850 struct vertex *v; in rde_send_summary()
885 struct vertex *v; in rde_send_summary_area()
1197 struct vertex *v; in rde_asext_get()
1279 struct vertex *v; in rde_asext_put()
1387 struct vertex *v = NULL; in rde_summary_update()
H A Darea.c50 struct vertex *v, *nv; in area_del()
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.mike/
H A Dp1989.C333 struct vertex { struct
335 List_DL<vertex<T> *> fanout; argument
373 List_DLS<vertex<T> > vertices;
405 vertex<T> *tov = lookup_new(to); in add()
413 vertex<T> *fromv = lookup(from); in contains()
426 vertex<T> *
437 vertex<T> *
440 vertex<T> *v = lookup(from); in lookup_new()
452 vertex<T> *v = (vertex<T> *) vx; in firstV1()
460 vertex<T> *v = (vertex<T> *) vx; in nextV1()
[all …]
/openbsd/gnu/llvm/llvm/docs/AMDGPU/
H A Dgfx7_tgt.rst18 pos{0..3} Copy vertex position 0..3.
19 param{0..31} Copy vertex parameter 0..31.
H A Dgfx9_tgt.rst18 pos{0..3} Copy vertex position 0..3.
19 param{0..31} Copy vertex parameter 0..31.
H A Dgfx8_tgt.rst18 pos{0..3} Copy vertex position 0..3.
19 param{0..31} Copy vertex parameter 0..31.
H A Dgfx10_tgt.rst18 pos{0..4} Copy vertex position 0..4.
19 param{0..31} Copy vertex parameter 0..31.
H A Dgfx1030_tgt.rst18 pos{0..4} Copy vertex position 0..4.
19 param{0..31} Copy vertex parameter 0..31.
H A Dgfx11_tgt.rst18 pos{0..4} Copy vertex position 0..4.
/openbsd/games/gomoku/
H A Dbdinit.c170 int mask, bmask, vertex, s; in init_overlap() local
181 sp1 = &board[vertex = cbp->c_vertex]; in init_overlap()
189 for (i = 0; i < s; i++, sp1 += d1, vertex += d1) { in init_overlap()
204 ip[n] = vertex; in init_overlap()
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.robertl/
H A Deb109.C26 typedef std::pair<VertexType, Successor> vertex; typedef
27 typedef std::vector<vertex> GraphType;
/openbsd/gnu/gcc/gcc/
H A Dcfgloopanal.c65 struct vertex struct
79 struct vertex *vertices; argument
119 g->vertices = XCNEWVEC (struct vertex, n_vertices); in new_graph()
/openbsd/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DR600Processors.td28 "Specify use of dedicated vertex cache"
H A DCaymanInstructions.td99 // to store vertex addresses in any channel, not just X.
/openbsd/gnu/llvm/llvm/docs/
H A DDirectXUsage.rst52 ``vertex`` Vertex shader

12