150 	Neighbor *nb;  in find_neighbor()  local
152 	for (nb = ifc->neighbors; nb; nb = nb->next)  in find_neighbor()
153 	    if (nb->addr == addr)  in find_neighbor()
154 		return nb;  in find_neighbor()
386 	    Neighbor   *nb;  in accept_neighbors()  local
399 	    for (nb = old_neighbors; nb; nb = nb->next)  in accept_neighbors()
400 		if (nb->addr == neighbor) {  in accept_neighbors()
401 		    if (metric != nb->metric || threshold != nb->threshold)  in accept_neighbors()
405 			    inet_fmt(nb->addr, s1), inet_fmt(node->addr, s2));  in accept_neighbors()
409 	    nb = malloc(sizeof(Neighbor));  in accept_neighbors()
410 	    nb->next = ifc->neighbors;  in accept_neighbors()
411 	    ifc->neighbors = nb;  in accept_neighbors()
412 	    nb->addr = neighbor;  in accept_neighbors()
413 	    nb->metric = metric;  in accept_neighbors()
414 	    nb->threshold = threshold;  in accept_neighbors()
415 	    nb->flags = 0;  in accept_neighbors()
527 	    Neighbor   *nb;  in accept_neighbors2()  local
543 	    for (nb = old_neighbors; nb; nb = nb->next)  in accept_neighbors2()
544 		if (nb->addr == neighbor) {  in accept_neighbors2()
545 		    if (metric != nb->metric || threshold != nb->threshold)  in accept_neighbors2()
549 			    inet_fmt(nb->addr, s1), inet_fmt(node->addr, s2));  in accept_neighbors2()
553 	    nb = malloc(sizeof(Neighbor));  in accept_neighbors2()
554 	    nb->next = ifc->neighbors;  in accept_neighbors2()
555 	    ifc->neighbors = nb;  in accept_neighbors2()
556 	    nb->addr = neighbor;  in accept_neighbors2()
557 	    nb->metric = metric;  in accept_neighbors2()
558 	    nb->threshold = threshold;  in accept_neighbors2()
559 	    nb->flags = flags | NF_PRESENT;  in accept_neighbors2()
638 		    Neighbor *nb;  in print_map()  local
644 		    for (nb = ifc->neighbors; nb; nb = nb->next) {  in print_map()
647 			printf("  %s", inet_fmt(nb->addr, s1));  in print_map()
648 			if (show_names  &&  (name = inet_name(nb->addr)))  in print_map()
650 			printf(" [%d/%d", nb->metric, nb->threshold);  in print_map()
651 			if (nb->flags) {  in print_map()
652 			    u_short flags = nb->flags;  in print_map()
692     Neighbor *nb;  in graph_edges()  local
704 		for (nb = ifc->neighbors; nb; nb = nb->next) {  in graph_edges()
705 		    Node *nb_node = find_node(nb->addr, &routers);  in graph_edges()
715 			       nb_node->addr, nb->metric, nb->threshold);  in graph_edges()
716 			if (nb2 && (nb2->metric != nb->metric  in graph_edges()
717 				    || nb2->threshold != nb->threshold))  in graph_edges()
719 			if (nb->flags & NF_PRESENT)  in graph_edges()
721 				   nb->flags & DVMRP_NF_SRCRT ? "" :  in graph_edges()
722 				   nb->flags & DVMRP_NF_TUNNEL ? "E" : "P",  in graph_edges()
723 				   nb->flags & DVMRP_NF_DOWN ? "D" : "");  in graph_edges()
741 		Neighbor *nb;  in elide_aliases()  local
743 		for (nb = ifc->neighbors; nb; nb = nb->next) {  in elide_aliases()
744 		    Node *nb_node = find_node(nb->addr, &routers);  in elide_aliases()
747 			nb->addr = nb_node->u.alias->addr;  in elide_aliases()