74 	struct interface *interfaces;	/* Else, neighbor data */  member
117 	n->u.interfaces = 0;  in find_node()
133     for (ifc = node->u.interfaces; ifc; ifc = ifc->next)  in find_interface()
139     ifc->next = node->u.interfaces;  in find_interface()
140     node->u.interfaces = ifc;  in find_interface()
151     for (ifc = node->u.interfaces; ifc; ifc = ifc->next) {  in find_neighbor()
350 	    for (ifc_i = ifc_node->u.interfaces; ifc_i; ifc_i = next_ifc_i) {  in accept_neighbors()
491 	    for (ifc_i = ifc_node->u.interfaces; ifc_i; ifc_i = next_ifc_i) {  in accept_neighbors2()
621 	    || (node->tries >= 0 && node->u.interfaces)  in print_map()
624 		&& node->u.alias->u.interfaces)) {  in print_map()
631 	    else if (!node->u.interfaces)  in print_map()
640 		for (ifc = node->u.interfaces; ifc; ifc = ifc->next) {  in print_map()
705 		   node->u.interfaces ? "" : "*");  in graph_edges()
706 	    for (ifc = node->u.interfaces; ifc; ifc = ifc->next)  in graph_edges()
743 	    for (ifc = node->u.interfaces; ifc; ifc = ifc->next) {  in elide_aliases()