net/netrom/nr_route.c

95  *	neighbour if it is new.
116 	 * The L2 link to a neighbour has failed in the past
117 	 * and now a frame comes from this neighbour. We assume
128 				if (nr_nodet->routes[i].neighbour == nr_neigh)
201 		nr_node->routes[0].neighbour = nr_neigh;
220 		if (nr_node->routes[i].neighbour == nr_neigh) {
236 			nr_node->routes[0].neighbour = nr_neigh;
245 				nr_node->routes[2].neighbour->count--;
246 				nr_neigh_put(nr_node->routes[2].neighbour);
248 				if (nr_node->routes[2].neighbour->count == 0 && !nr_node->routes[2].neighbour->locked)
249 					nr_remove_neigh(nr_node->routes[2].neighbour);
253 				nr_node->routes[2].neighbour = nr_neigh;
275 		if (nr_node->routes[i].neighbour == nr_neigh) {
316 static int nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev)
327 	nr_neigh = nr_neigh_get_dev(neighbour, dev);
337 		if (nr_node->routes[i].neighbour == nr_neigh) {
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;
521 					if (t->routes[i].neighbour == s) {
653 				&nr_route.neighbour,
679 				&nr_route.neighbour, dev);
703  *	then don't use that neighbour until it is reset.
734 		    nr_node->routes[nr_node->which].neighbour == nr_neigh)
797 	nr_neigh = nr_node->routes[nr_node->which].neighbour;
880 				nr_node->routes[i].neighbour->number);