rose_node 102 include/net/rose.h struct rose_node *next;
rose_node 41 net/rose/rose_route.c static struct rose_node *rose_node_list;
rose_node 57 net/rose/rose_route.c struct rose_node *rose_node, *rose_tmpn, *rose_tmpp;
rose_node 64 net/rose/rose_route.c rose_node = rose_node_list;
rose_node 65 net/rose/rose_route.c while (rose_node != NULL) {
rose_node 66 net/rose/rose_route.c if ((rose_node->mask == rose_route->mask) &&
rose_node 67 net/rose/rose_route.c (rosecmpm(&rose_route->address, &rose_node->address,
rose_node 70 net/rose/rose_route.c rose_node = rose_node->next;
rose_node 73 net/rose/rose_route.c if (rose_node != NULL && rose_node->loopback) {
rose_node 137 net/rose/rose_route.c if (rose_node == NULL) {
rose_node 151 net/rose/rose_route.c rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC);
rose_node 152 net/rose/rose_route.c if (rose_node == NULL) {
rose_node 157 net/rose/rose_route.c rose_node->address = rose_route->address;
rose_node 158 net/rose/rose_route.c rose_node->mask = rose_route->mask;
rose_node 159 net/rose/rose_route.c rose_node->count = 1;
rose_node 160 net/rose/rose_route.c rose_node->loopback = 0;
rose_node 161 net/rose/rose_route.c rose_node->neighbour[0] = rose_neigh;
rose_node 165 net/rose/rose_route.c rose_node_list = rose_node;
rose_node 166 net/rose/rose_route.c rose_node->next = NULL;
rose_node 168 net/rose/rose_route.c rose_tmpp->next = rose_node;
rose_node 169 net/rose/rose_route.c rose_node->next = NULL;
rose_node 173 net/rose/rose_route.c rose_node->next = rose_node_list;
rose_node 174 net/rose/rose_route.c rose_node_list = rose_node;
rose_node 176 net/rose/rose_route.c rose_tmpp->next = rose_node;
rose_node 177 net/rose/rose_route.c rose_node->next = rose_tmpn;
rose_node 186 net/rose/rose_route.c if (rose_node->count < 3) {
rose_node 187 net/rose/rose_route.c rose_node->neighbour[rose_node->count] = rose_neigh;
rose_node 188 net/rose/rose_route.c rose_node->count++;
rose_node 204 net/rose/rose_route.c struct rose_node *s;
rose_node 206 net/rose/rose_route.c if ((s = rose_node_list) == rose_node) {
rose_node 207 net/rose/rose_route.c rose_node_list = rose_node->next;
rose_node 208 net/rose/rose_route.c kfree(rose_node);
rose_node 213 net/rose/rose_route.c if (s->next == rose_node) {
rose_node 214 net/rose/rose_route.c s->next = rose_node->next;
rose_node 215 net/rose/rose_route.c kfree(rose_node);
rose_node 291 net/rose/rose_route.c struct rose_node *rose_node;
rose_node 298 net/rose/rose_route.c rose_node = rose_node_list;
rose_node 299 net/rose/rose_route.c while (rose_node != NULL) {
rose_node 300 net/rose/rose_route.c if ((rose_node->mask == rose_route->mask) &&
rose_node 301 net/rose/rose_route.c (rosecmpm(&rose_route->address, &rose_node->address,
rose_node 304 net/rose/rose_route.c rose_node = rose_node->next;
rose_node 307 net/rose/rose_route.c if (rose_node == NULL || rose_node->loopback) {
rose_node 325 net/rose/rose_route.c for (i = 0; i < rose_node->count; i++) {
rose_node 326 net/rose/rose_route.c if (rose_node->neighbour[i] == rose_neigh) {
rose_node 332 net/rose/rose_route.c rose_node->count--;
rose_node 334 net/rose/rose_route.c if (rose_node->count == 0) {
rose_node 335 net/rose/rose_route.c rose_remove_node(rose_node);
rose_node 339 net/rose/rose_route.c rose_node->neighbour[0] =
rose_node 340 net/rose/rose_route.c rose_node->neighbour[1];
rose_node 342 net/rose/rose_route.c rose_node->neighbour[1] =
rose_node 343 net/rose/rose_route.c rose_node->neighbour[2];
rose_node 399 net/rose/rose_route.c struct rose_node *rose_node;
rose_node 404 net/rose/rose_route.c rose_node = rose_node_list;
rose_node 405 net/rose/rose_route.c while (rose_node != NULL) {
rose_node 406 net/rose/rose_route.c if ((rose_node->mask == 10) &&
rose_node 407 net/rose/rose_route.c (rosecmpm(address, &rose_node->address, 10) == 0) &&
rose_node 408 net/rose/rose_route.c rose_node->loopback)
rose_node 410 net/rose/rose_route.c rose_node = rose_node->next;
rose_node 413 net/rose/rose_route.c if (rose_node != NULL)
rose_node 416 net/rose/rose_route.c if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) {
rose_node 421 net/rose/rose_route.c rose_node->address = *address;
rose_node 422 net/rose/rose_route.c rose_node->mask = 10;
rose_node 423 net/rose/rose_route.c rose_node->count = 1;
rose_node 424 net/rose/rose_route.c rose_node->loopback = 1;
rose_node 425 net/rose/rose_route.c rose_node->neighbour[0] = rose_loopback_neigh;
rose_node 428 net/rose/rose_route.c rose_node->next = rose_node_list;
rose_node 429 net/rose/rose_route.c rose_node_list = rose_node;
rose_node 444 net/rose/rose_route.c struct rose_node *rose_node;
rose_node 448 net/rose/rose_route.c rose_node = rose_node_list;
rose_node 449 net/rose/rose_route.c while (rose_node != NULL) {
rose_node 450 net/rose/rose_route.c if ((rose_node->mask == 10) &&
rose_node 451 net/rose/rose_route.c (rosecmpm(address, &rose_node->address, 10) == 0) &&
rose_node 452 net/rose/rose_route.c rose_node->loopback)
rose_node 454 net/rose/rose_route.c rose_node = rose_node->next;
rose_node 457 net/rose/rose_route.c if (rose_node == NULL)
rose_node 460 net/rose/rose_route.c rose_remove_node(rose_node);
rose_node 474 net/rose/rose_route.c struct rose_node *t, *rose_node;
rose_node 487 net/rose/rose_route.c rose_node = rose_node_list;
rose_node 489 net/rose/rose_route.c while (rose_node != NULL) {
rose_node 490 net/rose/rose_route.c t = rose_node;
rose_node 491 net/rose/rose_route.c rose_node = rose_node->next;
rose_node 548 net/rose/rose_route.c struct rose_node *t, *rose_node;
rose_node 554 net/rose/rose_route.c rose_node = rose_node_list;
rose_node 556 net/rose/rose_route.c while (rose_node != NULL) {
rose_node 557 net/rose/rose_route.c t = rose_node;
rose_node 558 net/rose/rose_route.c rose_node = rose_node->next;
rose_node 671 net/rose/rose_route.c struct rose_node *node;
rose_node 1078 net/rose/rose_route.c struct rose_node *rose_node;
rose_node 1085 net/rose/rose_route.c for (rose_node = rose_node_list; rose_node && i < *pos;
rose_node 1086 net/rose/rose_route.c rose_node = rose_node->next, ++i);
rose_node 1088 net/rose/rose_route.c return (i == *pos) ? rose_node : NULL;
rose_node 1096 net/rose/rose_route.c : ((struct rose_node *)v)->next;
rose_node 1112 net/rose/rose_route.c const struct rose_node *rose_node = v;
rose_node 1119 net/rose/rose_route.c rose2asc(&rose_node->address),
rose_node 1120 net/rose/rose_route.c rose_node->mask,
rose_node 1121 net/rose/rose_route.c rose_node->count);
rose_node 1123 net/rose/rose_route.c for (i = 0; i < rose_node->count; i++)
rose_node 1125 net/rose/rose_route.c rose_node->neighbour[i]->number);
rose_node 1331 net/rose/rose_route.c struct rose_node *t, *rose_node = rose_node_list;
rose_node 1341 net/rose/rose_route.c while (rose_node != NULL) {
rose_node 1342 net/rose/rose_route.c t = rose_node;
rose_node 1343 net/rose/rose_route.c rose_node = rose_node->next;