Lines Matching refs:routes
100 if ((odev=nr_dev_get(nr)) != NULL) { /* Can't add routes to ourself */
113 * routes now (and not wait for a node broadcast).
123 if (nr_nodet->routes[i].neighbour == nr_neigh)
194 nr_node->routes[0].quality = quality;
195 nr_node->routes[0].obs_count = obs_count;
196 nr_node->routes[0].neighbour = nr_neigh;
214 if (nr_node->routes[i].neighbour == nr_neigh) {
215 nr_node->routes[i].quality = quality;
216 nr_node->routes[i].obs_count = obs_count;
225 nr_node->routes[2] = nr_node->routes[1];
226 nr_node->routes[1] = nr_node->routes[0];
228 nr_node->routes[0].quality = quality;
229 nr_node->routes[0].obs_count = obs_count;
230 nr_node->routes[0].neighbour = nr_neigh;
238 if (quality > nr_node->routes[2].quality) {
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);
245 nr_node->routes[2].quality = quality;
246 nr_node->routes[2].obs_count = obs_count;
247 nr_node->routes[2].neighbour = nr_neigh;
255 /* Now re-sort the routes in quality order */
258 if (nr_node->routes[1].quality > nr_node->routes[0].quality) {
264 nr_route = nr_node->routes[0];
265 nr_node->routes[0] = nr_node->routes[1];
266 nr_node->routes[1] = nr_route;
268 if (nr_node->routes[2].quality > nr_node->routes[1].quality) {
279 nr_route = nr_node->routes[1];
280 nr_node->routes[1] = nr_node->routes[2];
281 nr_node->routes[2] = nr_route;
284 if (nr_node->routes[1].quality > nr_node->routes[0].quality) {
294 nr_route = nr_node->routes[0];
295 nr_node->routes[0] = nr_node->routes[1];
296 nr_node->routes[1] = nr_route;
303 if (nr_node->routes[i].neighbour == nr_neigh) {
350 * is only deleted if no routes are left to it.
372 if (nr_node->routes[i].neighbour == nr_neigh) {
387 nr_node->routes[0] = nr_node->routes[1];
389 nr_node->routes[1] = nr_node->routes[2];
492 switch (s->routes[i].obs_count) {
497 nr_neigh = s->routes[i].neighbour;
509 s->routes[0] = s->routes[1];
511 s->routes[1] = s->routes[2];
518 s->routes[i].obs_count--;
534 * A device has been removed. Remove its routes and neighbours.
550 if (t->routes[i].neighbour == s) {
555 t->routes[0] = t->routes[1];
557 t->routes[1] = t->routes[2];
760 nr_node->routes[nr_node->which].neighbour == nr_neigh)
823 nr_neigh = nr_node->routes[nr_node->which].neighbour;
902 nr_node->routes[i].quality,
903 nr_node->routes[i].obs_count,
904 nr_node->routes[i].neighbour->number);
1003 * Free all memory associated with the nodes and routes lists.