rose_neigh         85 include/net/rose.h 	struct rose_neigh	*next;
rose_neigh        107 include/net/rose.h 	struct rose_neigh	*neighbour[3];
rose_neigh        115 include/net/rose.h 	struct rose_neigh 	*neigh1, *neigh2;
rose_neigh        126 include/net/rose.h 	struct rose_neigh	*neighbour;
rose_neigh        191 include/net/rose.h extern struct rose_neigh *rose_loopback_neigh;
rose_neigh        204 include/net/rose.h extern struct rose_neigh *rose_get_neigh(rose_address *, unsigned char *, unsigned char *, int);
rose_neigh         87 net/rose/rose_link.c 	struct rose_neigh *neigh = (struct rose_neigh *)param;
rose_neigh         43 net/rose/rose_route.c static struct rose_neigh *rose_neigh_list;
rose_neigh         48 net/rose/rose_route.c struct rose_neigh *rose_loopback_neigh;
rose_neigh         58 net/rose/rose_route.c 	struct rose_neigh *rose_neigh;
rose_neigh         78 net/rose/rose_route.c 	rose_neigh = rose_neigh_list;
rose_neigh         79 net/rose/rose_route.c 	while (rose_neigh != NULL) {
rose_neigh         80 net/rose/rose_route.c 		if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
rose_neigh         81 net/rose/rose_route.c 		    && rose_neigh->dev == dev)
rose_neigh         83 net/rose/rose_route.c 		rose_neigh = rose_neigh->next;
rose_neigh         86 net/rose/rose_route.c 	if (rose_neigh == NULL) {
rose_neigh         87 net/rose/rose_route.c 		rose_neigh = kmalloc(sizeof(*rose_neigh), GFP_ATOMIC);
rose_neigh         88 net/rose/rose_route.c 		if (rose_neigh == NULL) {
rose_neigh         93 net/rose/rose_route.c 		rose_neigh->callsign  = rose_route->neighbour;
rose_neigh         94 net/rose/rose_route.c 		rose_neigh->digipeat  = NULL;
rose_neigh         95 net/rose/rose_route.c 		rose_neigh->ax25      = NULL;
rose_neigh         96 net/rose/rose_route.c 		rose_neigh->dev       = dev;
rose_neigh         97 net/rose/rose_route.c 		rose_neigh->count     = 0;
rose_neigh         98 net/rose/rose_route.c 		rose_neigh->use       = 0;
rose_neigh         99 net/rose/rose_route.c 		rose_neigh->dce_mode  = 0;
rose_neigh        100 net/rose/rose_route.c 		rose_neigh->loopback  = 0;
rose_neigh        101 net/rose/rose_route.c 		rose_neigh->number    = rose_neigh_no++;
rose_neigh        102 net/rose/rose_route.c 		rose_neigh->restarted = 0;
rose_neigh        104 net/rose/rose_route.c 		skb_queue_head_init(&rose_neigh->queue);
rose_neigh        106 net/rose/rose_route.c 		init_timer(&rose_neigh->ftimer);
rose_neigh        107 net/rose/rose_route.c 		init_timer(&rose_neigh->t0timer);
rose_neigh        110 net/rose/rose_route.c 			if ((rose_neigh->digipeat = kmalloc(sizeof(ax25_digi), GFP_KERNEL)) == NULL) {
rose_neigh        111 net/rose/rose_route.c 				kfree(rose_neigh);
rose_neigh        116 net/rose/rose_route.c 			rose_neigh->digipeat->ndigi      = rose_route->ndigis;
rose_neigh        117 net/rose/rose_route.c 			rose_neigh->digipeat->lastrepeat = -1;
rose_neigh        120 net/rose/rose_route.c 				rose_neigh->digipeat->calls[i]    =
rose_neigh        122 net/rose/rose_route.c 				rose_neigh->digipeat->repeated[i] = 0;
rose_neigh        126 net/rose/rose_route.c 		rose_neigh->next = rose_neigh_list;
rose_neigh        127 net/rose/rose_route.c 		rose_neigh_list  = rose_neigh;
rose_neigh        161 net/rose/rose_route.c 		rose_node->neighbour[0] = rose_neigh;
rose_neigh        180 net/rose/rose_route.c 		rose_neigh->count++;
rose_neigh        187 net/rose/rose_route.c 		rose_node->neighbour[rose_node->count] = rose_neigh;
rose_neigh        189 net/rose/rose_route.c 		rose_neigh->count++;
rose_neigh        228 net/rose/rose_route.c 	struct rose_neigh *s;
rose_neigh        230 net/rose/rose_route.c 	rose_stop_ftimer(rose_neigh);
rose_neigh        231 net/rose/rose_route.c 	rose_stop_t0timer(rose_neigh);
rose_neigh        233 net/rose/rose_route.c 	skb_queue_purge(&rose_neigh->queue);
rose_neigh        235 net/rose/rose_route.c 	if ((s = rose_neigh_list) == rose_neigh) {
rose_neigh        236 net/rose/rose_route.c 		rose_neigh_list = rose_neigh->next;
rose_neigh        237 net/rose/rose_route.c 		kfree(rose_neigh->digipeat);
rose_neigh        238 net/rose/rose_route.c 		kfree(rose_neigh);
rose_neigh        243 net/rose/rose_route.c 		if (s->next == rose_neigh) {
rose_neigh        244 net/rose/rose_route.c 			s->next = rose_neigh->next;
rose_neigh        245 net/rose/rose_route.c 			kfree(rose_neigh->digipeat);
rose_neigh        246 net/rose/rose_route.c 			kfree(rose_neigh);
rose_neigh        292 net/rose/rose_route.c 	struct rose_neigh *rose_neigh;
rose_neigh        312 net/rose/rose_route.c 	rose_neigh = rose_neigh_list;
rose_neigh        313 net/rose/rose_route.c 	while (rose_neigh != NULL) {
rose_neigh        314 net/rose/rose_route.c 		if (ax25cmp(&rose_route->neighbour, &rose_neigh->callsign) == 0
rose_neigh        315 net/rose/rose_route.c 		    && rose_neigh->dev == dev)
rose_neigh        317 net/rose/rose_route.c 		rose_neigh = rose_neigh->next;
rose_neigh        320 net/rose/rose_route.c 	if (rose_neigh == NULL) {
rose_neigh        326 net/rose/rose_route.c 		if (rose_node->neighbour[i] == rose_neigh) {
rose_neigh        327 net/rose/rose_route.c 			rose_neigh->count--;
rose_neigh        329 net/rose/rose_route.c 			if (rose_neigh->count == 0 && rose_neigh->use == 0)
rose_neigh        330 net/rose/rose_route.c 				rose_remove_neigh(rose_neigh);
rose_neigh        365 net/rose/rose_route.c 	struct rose_neigh *sn;
rose_neigh        367 net/rose/rose_route.c 	rose_loopback_neigh = kmalloc(sizeof(struct rose_neigh), GFP_KERNEL);
rose_neigh        473 net/rose/rose_route.c 	struct rose_neigh *s, *rose_neigh;
rose_neigh        479 net/rose/rose_route.c 	rose_neigh = rose_neigh_list;
rose_neigh        480 net/rose/rose_route.c 	while (rose_neigh != NULL) {
rose_neigh        481 net/rose/rose_route.c 		s          = rose_neigh;
rose_neigh        482 net/rose/rose_route.c 		rose_neigh = rose_neigh->next;
rose_neigh        547 net/rose/rose_route.c 	struct rose_neigh *s, *rose_neigh;
rose_neigh        553 net/rose/rose_route.c 	rose_neigh = rose_neigh_list;
rose_neigh        563 net/rose/rose_route.c 	while (rose_neigh != NULL) {
rose_neigh        564 net/rose/rose_route.c 		s          = rose_neigh;
rose_neigh        565 net/rose/rose_route.c 		rose_neigh = rose_neigh->next;
rose_neigh        667 net/rose/rose_route.c struct rose_neigh *rose_get_neigh(rose_address *addr, unsigned char *cause,
rose_neigh        670 net/rose/rose_route.c 	struct rose_neigh *res = NULL;
rose_neigh        760 net/rose/rose_route.c 	rose_neigh->restarted = 0;
rose_neigh        762 net/rose/rose_route.c 	rose_stop_t0timer(rose_neigh);
rose_neigh        763 net/rose/rose_route.c 	rose_start_ftimer(rose_neigh);
rose_neigh        765 net/rose/rose_route.c 	skb_queue_purge(&rose_neigh->queue);
rose_neigh        772 net/rose/rose_route.c 		if ((rose_route->neigh1 == rose_neigh && rose_route->neigh2 == rose_neigh) ||
rose_neigh        773 net/rose/rose_route.c 		    (rose_route->neigh1 == rose_neigh && rose_route->neigh2 == NULL)       ||
rose_neigh        774 net/rose/rose_route.c 		    (rose_route->neigh2 == rose_neigh && rose_route->neigh1 == NULL)) {
rose_neigh        781 net/rose/rose_route.c 		if (rose_route->neigh1 == rose_neigh) {
rose_neigh        787 net/rose/rose_route.c 		if (rose_route->neigh2 == rose_neigh) {
rose_neigh        805 net/rose/rose_route.c 	struct rose_neigh *rose_neigh;
rose_neigh        808 net/rose/rose_route.c 	rose_neigh = rose_neigh_list;
rose_neigh        809 net/rose/rose_route.c 	while (rose_neigh != NULL) {
rose_neigh        810 net/rose/rose_route.c 		if (rose_neigh->ax25 == ax25)
rose_neigh        812 net/rose/rose_route.c 		rose_neigh = rose_neigh->next;
rose_neigh        815 net/rose/rose_route.c 	if (rose_neigh != NULL) {
rose_neigh        816 net/rose/rose_route.c 		rose_neigh->ax25 = NULL;
rose_neigh        818 net/rose/rose_route.c 		rose_del_route_by_neigh(rose_neigh);
rose_neigh        819 net/rose/rose_route.c 		rose_kill_by_neigh(rose_neigh);
rose_neigh        830 net/rose/rose_route.c 	struct rose_neigh *rose_neigh;
rose_neigh        832 net/rose/rose_route.c 	for (rose_neigh = rose_neigh_list; rose_neigh != NULL; rose_neigh = rose_neigh->next) {
rose_neigh        833 net/rose/rose_route.c 		if (rose_neigh->dev == dev) {
rose_neigh        834 net/rose/rose_route.c 			rose_del_route_by_neigh(rose_neigh);
rose_neigh        835 net/rose/rose_route.c 			rose_kill_by_neigh(rose_neigh);
rose_neigh        845 net/rose/rose_route.c 	struct rose_neigh *rose_neigh, *new_neigh;
rose_neigh        870 net/rose/rose_route.c 	rose_neigh = rose_neigh_list;
rose_neigh        871 net/rose/rose_route.c 	while (rose_neigh != NULL) {
rose_neigh        872 net/rose/rose_route.c 		if (ax25cmp(&ax25->dest_addr, &rose_neigh->callsign) == 0 &&
rose_neigh        873 net/rose/rose_route.c 		    ax25->ax25_dev->dev == rose_neigh->dev)
rose_neigh        875 net/rose/rose_route.c 		rose_neigh = rose_neigh->next;
rose_neigh        878 net/rose/rose_route.c 	if (rose_neigh == NULL) {
rose_neigh        887 net/rose/rose_route.c 	rose_stop_ftimer(rose_neigh);
rose_neigh        894 net/rose/rose_route.c 		rose_link_rx_restart(skb, rose_neigh, frametype);
rose_neigh        901 net/rose/rose_route.c 	if ((sk = rose_find_socket(lci, rose_neigh)) != NULL) {
rose_neigh        933 net/rose/rose_route.c 			res = rose_rx_call_request(skb, dev, rose_neigh, lci);
rose_neigh        939 net/rose/rose_route.c 		rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 0);
rose_neigh        949 net/rose/rose_route.c 		    rose_route->neigh1 == rose_neigh) {
rose_neigh        970 net/rose/rose_route.c 		    rose_route->neigh2 == rose_neigh) {
rose_neigh       1009 net/rose/rose_route.c 		rose_transmit_clear_request(rose_neigh, lci, ROSE_INVALID_FACILITY, 76);
rose_neigh       1022 net/rose/rose_route.c 			rose_transmit_clear_request(rose_neigh, lci, ROSE_NOT_OBTAINABLE, 120);
rose_neigh       1029 net/rose/rose_route.c 		rose_transmit_clear_request(rose_neigh, lci, cause, diagnostic);
rose_neigh       1034 net/rose/rose_route.c 		rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 71);
rose_neigh       1039 net/rose/rose_route.c 		rose_transmit_clear_request(rose_neigh, lci, ROSE_NETWORK_CONGESTION, 120);
rose_neigh       1049 net/rose/rose_route.c 	rose_route->neigh1    = rose_neigh;
rose_neigh       1156 net/rose/rose_route.c 	struct rose_neigh *rose_neigh;
rose_neigh       1163 net/rose/rose_route.c 	for (rose_neigh = rose_neigh_list; rose_neigh && i < *pos;
rose_neigh       1164 net/rose/rose_route.c 	     rose_neigh = rose_neigh->next, ++i);
rose_neigh       1166 net/rose/rose_route.c 	return (i == *pos) ? rose_neigh : NULL;
rose_neigh       1174 net/rose/rose_route.c 		: ((struct rose_neigh *)v)->next;
rose_neigh       1192 net/rose/rose_route.c 		struct rose_neigh *rose_neigh = v;
rose_neigh       1196 net/rose/rose_route.c 			   rose_neigh->number,
rose_neigh       1197 net/rose/rose_route.c 			   (rose_neigh->loopback) ? "RSLOOP-0" : ax2asc(buf, &rose_neigh->callsign),
rose_neigh       1198 net/rose/rose_route.c 			   rose_neigh->dev ? rose_neigh->dev->name : "???",
rose_neigh       1199 net/rose/rose_route.c 			   rose_neigh->count,
rose_neigh       1200 net/rose/rose_route.c 			   rose_neigh->use,
rose_neigh       1201 net/rose/rose_route.c 			   (rose_neigh->dce_mode) ? "DCE" : "DTE",
rose_neigh       1202 net/rose/rose_route.c 			   (rose_neigh->restarted) ? "yes" : "no",
rose_neigh       1203 net/rose/rose_route.c 			   ax25_display_timer(&rose_neigh->t0timer) / HZ,
rose_neigh       1204 net/rose/rose_route.c 			   ax25_display_timer(&rose_neigh->ftimer)  / HZ);
rose_neigh       1206 net/rose/rose_route.c 		if (rose_neigh->digipeat != NULL) {
rose_neigh       1207 net/rose/rose_route.c 			for (i = 0; i < rose_neigh->digipeat->ndigi; i++)
rose_neigh       1208 net/rose/rose_route.c 				seq_printf(seq, " %s", ax2asc(buf, &rose_neigh->digipeat->calls[i]));
rose_neigh       1330 net/rose/rose_route.c 	struct rose_neigh *s, *rose_neigh = rose_neigh_list;
rose_neigh       1334 net/rose/rose_route.c 	while (rose_neigh != NULL) {
rose_neigh       1335 net/rose/rose_route.c 		s          = rose_neigh;
rose_neigh       1336 net/rose/rose_route.c 		rose_neigh = rose_neigh->next;