Lines Matching refs:neighbour
88 * neighbour if it is new.
110 * The L2 link to a neighbour has failed in the past
111 * and now a frame comes from this neighbour. We assume
123 if (nr_nodet->routes[i].neighbour == nr_neigh)
196 nr_node->routes[0].neighbour = nr_neigh;
214 if (nr_node->routes[i].neighbour == nr_neigh) {
230 nr_node->routes[0].neighbour = nr_neigh;
239 nr_node->routes[2].neighbour->count--;
240 nr_neigh_put(nr_node->routes[2].neighbour);
242 if (nr_node->routes[2].neighbour->count == 0 && !nr_node->routes[2].neighbour->locked)
243 nr_remove_neigh(nr_node->routes[2].neighbour);
247 nr_node->routes[2].neighbour = nr_neigh;
303 if (nr_node->routes[i].neighbour == nr_neigh) {
352 static int nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev)
363 nr_neigh = nr_neigh_get_dev(neighbour, dev);
372 if (nr_node->routes[i].neighbour == nr_neigh) {
408 * Lock a neighbour with a quality.
455 * "Delete" a neighbour. The neighbour is only removed if the number
497 nr_neigh = s->routes[i].neighbour;
550 if (t->routes[i].neighbour == s) {
678 &nr_route.neighbour,
704 &nr_route.neighbour, dev);
728 * then don't use that neighbour until it is reset.
760 nr_node->routes[nr_node->which].neighbour == nr_neigh)
823 nr_neigh = nr_node->routes[nr_node->which].neighbour;
904 nr_node->routes[i].neighbour->number);