95  *	neighbour if it is new.
116 	 * The L2 link to a neighbour has failed in the past  in nr_add_node()
117 	 * and now a frame comes from this neighbour. We assume  in nr_add_node()
128 				if (nr_nodet->routes[i].neighbour == nr_neigh)  in nr_add_node()
201 		nr_node->routes[0].neighbour = nr_neigh;  in nr_add_node()
220 		if (nr_node->routes[i].neighbour == nr_neigh) {  in nr_add_node()
236 			nr_node->routes[0].neighbour = nr_neigh;  in nr_add_node()
245 				nr_node->routes[2].neighbour->count--;  in nr_add_node()
246 				nr_neigh_put(nr_node->routes[2].neighbour);  in nr_add_node()
248 				if (nr_node->routes[2].neighbour->count == 0 && !nr_node->routes[2].neighbour->locked)  in nr_add_node()
249 					nr_remove_neigh(nr_node->routes[2].neighbour);  in nr_add_node()
253 				nr_node->routes[2].neighbour = nr_neigh;  in nr_add_node()
275 		if (nr_node->routes[i].neighbour == nr_neigh) {  in nr_add_node()
316 static int nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev)  in nr_del_node()  argument
327 	nr_neigh = nr_neigh_get_dev(neighbour, dev);  in nr_del_node()
337 		if (nr_node->routes[i].neighbour == nr_neigh) {  in nr_del_node()
377  *	Lock a neighbour with a quality.
424  *	"Delete" a neighbour. The neighbour is only removed if the number
466 				nr_neigh = s->routes[i].neighbour;  in nr_dec_obs()
521 					if (t->routes[i].neighbour == s) {  in nr_rt_device_down()
653 				&nr_route.neighbour,  in nr_rt_ioctl()
679 				&nr_route.neighbour, dev);  in nr_rt_ioctl()
703  *	then don't use that neighbour until it is reset.
734 		    nr_node->routes[nr_node->which].neighbour == nr_neigh)  in nr_link_failed()
803 	nr_neigh = nr_node->routes[nr_node->which].neighbour;  in nr_route_frame()
886 				nr_node->routes[i].neighbour->number);  in nr_node_show()