Lines Matching defs:neighbour
87 * neighbour if it is new.
109 * The L2 link to a neighbour has failed in the past
110 * and now a frame comes from this neighbour. We assume
122 if (nr_nodet->routes[i].neighbour == nr_neigh)
195 nr_node->routes[0].neighbour = nr_neigh;
213 if (nr_node->routes[i].neighbour == nr_neigh) {
229 nr_node->routes[0].neighbour = nr_neigh;
238 nr_node->routes[2].neighbour->count--;
239 nr_neigh_put(nr_node->routes[2].neighbour);
241 if (nr_node->routes[2].neighbour->count == 0 && !nr_node->routes[2].neighbour->locked)
242 nr_remove_neigh(nr_node->routes[2].neighbour);
246 nr_node->routes[2].neighbour = nr_neigh;
302 if (nr_node->routes[i].neighbour == nr_neigh) {
351 static int nr_del_node(ax25_address *callsign, ax25_address *neighbour, struct net_device *dev)
362 nr_neigh = nr_neigh_get_dev(neighbour, dev);
371 if (nr_node->routes[i].neighbour == nr_neigh) {
407 * Lock a neighbour with a quality.
454 * "Delete" a neighbour. The neighbour is only removed if the number
496 nr_neigh = s->routes[i].neighbour;
549 if (t->routes[i].neighbour == s) {
675 &nr_route.neighbour,
699 &nr_route.neighbour, dev);
723 * then don't use that neighbour until it is reset.
755 nr_node->routes[nr_node->which].neighbour == nr_neigh)
818 nr_neigh = nr_node->routes[nr_node->which].neighbour;
916 nr_node->routes[i].neighbour->number);