Lines Matching refs:rose_node
42 static struct rose_node *rose_node_list;
58 struct rose_node *rose_node, *rose_tmpn, *rose_tmpp;
65 rose_node = rose_node_list;
66 while (rose_node != NULL) {
67 if ((rose_node->mask == rose_route->mask) &&
68 (rosecmpm(&rose_route->address, &rose_node->address,
71 rose_node = rose_node->next;
74 if (rose_node != NULL && rose_node->loopback) {
141 if (rose_node == NULL) {
155 rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC);
156 if (rose_node == NULL) {
161 rose_node->address = rose_route->address;
162 rose_node->mask = rose_route->mask;
163 rose_node->count = 1;
164 rose_node->loopback = 0;
165 rose_node->neighbour[0] = rose_neigh;
169 rose_node_list = rose_node;
170 rose_node->next = NULL;
172 rose_tmpp->next = rose_node;
173 rose_node->next = NULL;
177 rose_node->next = rose_node_list;
178 rose_node_list = rose_node;
180 rose_tmpp->next = rose_node;
181 rose_node->next = rose_tmpn;
190 if (rose_node->count < 3) {
191 rose_node->neighbour[rose_node->count] = rose_neigh;
192 rose_node->count++;
206 static void rose_remove_node(struct rose_node *rose_node)
208 struct rose_node *s;
210 if ((s = rose_node_list) == rose_node) {
211 rose_node_list = rose_node->next;
212 kfree(rose_node);
217 if (s->next == rose_node) {
218 s->next = rose_node->next;
219 kfree(rose_node);
299 struct rose_node *rose_node;
306 rose_node = rose_node_list;
307 while (rose_node != NULL) {
308 if ((rose_node->mask == rose_route->mask) &&
309 (rosecmpm(&rose_route->address, &rose_node->address,
312 rose_node = rose_node->next;
315 if (rose_node == NULL || rose_node->loopback) {
334 for (i = 0; i < rose_node->count; i++) {
335 if (rose_node->neighbour[i] == rose_neigh) {
341 rose_node->count--;
343 if (rose_node->count == 0) {
344 rose_remove_node(rose_node);
348 rose_node->neighbour[0] =
349 rose_node->neighbour[1];
351 rose_node->neighbour[1] =
352 rose_node->neighbour[2];
408 struct rose_node *rose_node;
413 rose_node = rose_node_list;
414 while (rose_node != NULL) {
415 if ((rose_node->mask == 10) &&
416 (rosecmpm(address, &rose_node->address, 10) == 0) &&
417 rose_node->loopback)
419 rose_node = rose_node->next;
422 if (rose_node != NULL)
425 if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) {
430 rose_node->address = *address;
431 rose_node->mask = 10;
432 rose_node->count = 1;
433 rose_node->loopback = 1;
434 rose_node->neighbour[0] = rose_loopback_neigh;
437 rose_node->next = rose_node_list;
438 rose_node_list = rose_node;
453 struct rose_node *rose_node;
457 rose_node = rose_node_list;
458 while (rose_node != NULL) {
459 if ((rose_node->mask == 10) &&
460 (rosecmpm(address, &rose_node->address, 10) == 0) &&
461 rose_node->loopback)
463 rose_node = rose_node->next;
466 if (rose_node == NULL)
469 rose_remove_node(rose_node);
483 struct rose_node *t, *rose_node;
496 rose_node = rose_node_list;
498 while (rose_node != NULL) {
499 t = rose_node;
500 rose_node = rose_node->next;
537 struct rose_node *t, *rose_node;
543 rose_node = rose_node_list;
545 while (rose_node != NULL) {
546 t = rose_node;
547 rose_node = rose_node->next;
660 struct rose_node *node;
1060 struct rose_node *rose_node;
1067 for (rose_node = rose_node_list; rose_node && i < *pos;
1068 rose_node = rose_node->next, ++i);
1070 return (i == *pos) ? rose_node : NULL;
1078 : ((struct rose_node *)v)->next;
1095 const struct rose_node *rose_node = v;
1096 /* if (rose_node->loopback) {
1098 rose2asc(rsbuf, &rose_node->address),
1099 rose_node->mask);
1102 rose2asc(rsbuf, &rose_node->address),
1103 rose_node->mask,
1104 rose_node->count);
1106 for (i = 0; i < rose_node->count; i++)
1108 rose_node->neighbour[i]->number);
1314 struct rose_node *t, *rose_node = rose_node_list;
1324 while (rose_node != NULL) {
1325 t = rose_node;
1326 rose_node = rose_node->next;