Lines Matching refs:vertex
51 vertex_nexthop_new (struct vertex *parent)
82 struct vertex *
85 struct vertex *new;
87 new = XMALLOC (MTYPE_OSPF_VERTEX, sizeof (struct vertex));
88 memset (new, 0, sizeof (struct vertex));
102 ospf_vertex_free (struct vertex *v)
118 ospf_vertex_add_parent (struct vertex *v)
137 struct vertex *v;
177 struct vertex *v;
181 v = (struct vertex *) getdata (node);
304 ospf_get_next_link (struct vertex *v, struct vertex *w,
345 /* Calculate nexthop from root to vertex W. */
348 struct vertex *v, struct vertex *w)
440 ospf_install_candidate (list candidate, struct vertex *w)
443 struct vertex *cw;
451 /* Install vertex with sorting by distance. */
454 cw = (struct vertex *) getdata (node);
470 ospf_spf_next (struct vertex *v, struct ospf_area *area,
475 struct vertex *w, *cw;
511 /* (b) Otherwise, W is a transit vertex (router or transit
512 network). Look up the vertex W's LSA (router-LSA or
555 /* Lookup the vertex W's LSA. */
560 to MaxAge, or it does not have a link back to vertex V,
575 /* (c) If vertex W is already on the shortest-path tree, examine
585 from the root to vertex W. D is equal to the sum of the link
587 vertex V and the advertised cost of the link between vertices
590 /* prepare vertex W. */
599 /* Is there already vertex W in candidate list? */
610 cw = (struct vertex *) getdata (node);
633 /* Remove old vertex from candidate list. */
644 /* Add vertex V to SPF tree. */
646 ospf_spf_register (struct vertex *v, struct route_table *rv,
668 struct vertex *v;
685 ospf_spf_dump (struct vertex *v, int i)
722 ospf_spf_process_stubs (struct ospf_area *area, struct vertex * v,
726 struct vertex *child;
878 struct vertex *v;
930 /* Otherwise, choose the vertex belonging to the candidate list