Lines Matching defs:neighbour
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;
274 if (nr_node->routes[i].neighbour == nr_neigh) {
323 static int nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev)
334 nr_neigh = nr_neigh_get_dev(neighbour, dev);
343 if (nr_node->routes[i].neighbour == nr_neigh) {
380 * Lock a neighbour with a quality.
427 * "Delete" a neighbour. The neighbour is only removed if the number
469 nr_neigh = s->routes[i].neighbour;
523 if (t->routes[i].neighbour == s) {
655 &nr_route.neighbour,
681 &nr_route.neighbour, dev);
705 * then don't use that neighbour until it is reset.
736 nr_node->routes[nr_node->which].neighbour == nr_neigh)
799 nr_neigh = nr_node->routes[nr_node->which].neighbour;
882 nr_node->routes[i].neighbour->number);