rose_node         109 include/net/rose.h 	struct rose_node	*next;
rose_node          38 net/rose/rose_route.c static struct rose_node  *rose_node_list;
rose_node          54 net/rose/rose_route.c 	struct rose_node  *rose_node, *rose_tmpn, *rose_tmpp;
rose_node          61 net/rose/rose_route.c 	rose_node = rose_node_list;
rose_node          62 net/rose/rose_route.c 	while (rose_node != NULL) {
rose_node          63 net/rose/rose_route.c 		if ((rose_node->mask == rose_route->mask) &&
rose_node          64 net/rose/rose_route.c 		    (rosecmpm(&rose_route->address, &rose_node->address,
rose_node          67 net/rose/rose_route.c 		rose_node = rose_node->next;
rose_node          70 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         202 net/rose/rose_route.c static void rose_remove_node(struct rose_node *rose_node)
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         295 net/rose/rose_route.c 	struct rose_node  *rose_node;
rose_node         302 net/rose/rose_route.c 	rose_node = rose_node_list;
rose_node         303 net/rose/rose_route.c 	while (rose_node != NULL) {
rose_node         304 net/rose/rose_route.c 		if ((rose_node->mask == rose_route->mask) &&
rose_node         305 net/rose/rose_route.c 		    (rosecmpm(&rose_route->address, &rose_node->address,
rose_node         308 net/rose/rose_route.c 		rose_node = rose_node->next;
rose_node         311 net/rose/rose_route.c 	if (rose_node == NULL || rose_node->loopback) {
rose_node         330 net/rose/rose_route.c 	for (i = 0; i < rose_node->count; i++) {
rose_node         331 net/rose/rose_route.c 		if (rose_node->neighbour[i] == rose_neigh) {
rose_node         337 net/rose/rose_route.c 			rose_node->count--;
rose_node         339 net/rose/rose_route.c 			if (rose_node->count == 0) {
rose_node         340 net/rose/rose_route.c 				rose_remove_node(rose_node);
rose_node         344 net/rose/rose_route.c 					rose_node->neighbour[0] =
rose_node         345 net/rose/rose_route.c 						rose_node->neighbour[1];
rose_node         348 net/rose/rose_route.c 					rose_node->neighbour[1] =
rose_node         349 net/rose/rose_route.c 						rose_node->neighbour[2];
rose_node         405 net/rose/rose_route.c 	struct rose_node *rose_node;
rose_node         410 net/rose/rose_route.c 	rose_node = rose_node_list;
rose_node         411 net/rose/rose_route.c 	while (rose_node != NULL) {
rose_node         412 net/rose/rose_route.c 		if ((rose_node->mask == 10) &&
rose_node         413 net/rose/rose_route.c 		     (rosecmpm(address, &rose_node->address, 10) == 0) &&
rose_node         414 net/rose/rose_route.c 		     rose_node->loopback)
rose_node         416 net/rose/rose_route.c 		rose_node = rose_node->next;
rose_node         419 net/rose/rose_route.c 	if (rose_node != NULL)
rose_node         422 net/rose/rose_route.c 	if ((rose_node = kmalloc(sizeof(*rose_node), GFP_ATOMIC)) == NULL) {
rose_node         427 net/rose/rose_route.c 	rose_node->address      = *address;
rose_node         428 net/rose/rose_route.c 	rose_node->mask         = 10;
rose_node         429 net/rose/rose_route.c 	rose_node->count        = 1;
rose_node         430 net/rose/rose_route.c 	rose_node->loopback     = 1;
rose_node         431 net/rose/rose_route.c 	rose_node->neighbour[0] = rose_loopback_neigh;
rose_node         434 net/rose/rose_route.c 	rose_node->next = rose_node_list;
rose_node         435 net/rose/rose_route.c 	rose_node_list  = rose_node;
rose_node         450 net/rose/rose_route.c 	struct rose_node *rose_node;
rose_node         454 net/rose/rose_route.c 	rose_node = rose_node_list;
rose_node         455 net/rose/rose_route.c 	while (rose_node != NULL) {
rose_node         456 net/rose/rose_route.c 		if ((rose_node->mask == 10) &&
rose_node         457 net/rose/rose_route.c 		    (rosecmpm(address, &rose_node->address, 10) == 0) &&
rose_node         458 net/rose/rose_route.c 		    rose_node->loopback)
rose_node         460 net/rose/rose_route.c 		rose_node = rose_node->next;
rose_node         463 net/rose/rose_route.c 	if (rose_node == NULL)
rose_node         466 net/rose/rose_route.c 	rose_remove_node(rose_node);
rose_node         480 net/rose/rose_route.c 	struct rose_node  *t, *rose_node;
rose_node         493 net/rose/rose_route.c 		rose_node = rose_node_list;
rose_node         495 net/rose/rose_route.c 		while (rose_node != NULL) {
rose_node         496 net/rose/rose_route.c 			t         = rose_node;
rose_node         497 net/rose/rose_route.c 			rose_node = rose_node->next;
rose_node         555 net/rose/rose_route.c 	struct rose_node  *t, *rose_node;
rose_node         561 net/rose/rose_route.c 	rose_node  = rose_node_list;
rose_node         563 net/rose/rose_route.c 	while (rose_node != NULL) {
rose_node         564 net/rose/rose_route.c 		t         = rose_node;
rose_node         565 net/rose/rose_route.c 		rose_node = rose_node->next;
rose_node         678 net/rose/rose_route.c 	struct rose_node *node;
rose_node        1092 net/rose/rose_route.c 	struct rose_node *rose_node;
rose_node        1099 net/rose/rose_route.c 	for (rose_node = rose_node_list; rose_node && i < *pos;
rose_node        1100 net/rose/rose_route.c 	     rose_node = rose_node->next, ++i);
rose_node        1102 net/rose/rose_route.c 	return (i == *pos) ? rose_node : NULL;
rose_node        1110 net/rose/rose_route.c 		: ((struct rose_node *)v)->next;
rose_node        1127 net/rose/rose_route.c 		const struct rose_node *rose_node = v;
rose_node        1134 net/rose/rose_route.c 				   rose2asc(rsbuf, &rose_node->address),
rose_node        1135 net/rose/rose_route.c 				   rose_node->mask,
rose_node        1136 net/rose/rose_route.c 				   rose_node->count);
rose_node        1138 net/rose/rose_route.c 			for (i = 0; i < rose_node->count; i++)
rose_node        1140 net/rose/rose_route.c 					rose_node->neighbour[i]->number);
rose_node        1305 net/rose/rose_route.c 	struct rose_node  *t, *rose_node  = rose_node_list;
rose_node        1315 net/rose/rose_route.c 	while (rose_node != NULL) {
rose_node        1316 net/rose/rose_route.c 		t         = rose_node;
rose_node        1317 net/rose/rose_route.c 		rose_node = rose_node->next;