Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 | /********************************************************************* * * Filename: discovery.c * Version: 0.1 * Description: Routines for handling discoveries at the IrLMP layer * Status: Experimental. * Author: Dag Brattli <dagb@cs.uit.no> * Created at: Tue Apr 6 15:33:50 1999 * Modified at: Sat Oct 9 17:11:31 1999 * Modified by: Dag Brattli <dagb@cs.uit.no> * Modified at: Fri May 28 3:11 CST 1999 * Modified by: Horst von Brand <vonbrand@sleipnir.valparaiso.cl> * * Copyright (c) 1999 Dag Brattli, All Rights Reserved. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License as * published by the Free Software Foundation; either version 2 of * the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, * MA 02111-1307 USA * ********************************************************************/ #include <linux/string.h> #include <linux/socket.h> #include <net/irda/irda.h> #include <net/irda/irlmp.h> #include <net/irda/discovery.h> /* * Function irlmp_add_discovery (cachelog, discovery) * * Add a new discovery to the cachelog, and remove any old discoveries * from the same device */ void irlmp_add_discovery(hashbin_t *cachelog, discovery_t *new) { discovery_t *discovery, *node; unsigned long flags; spin_lock_irqsave(&irlmp->lock, flags); /* * Remove all discoveries of devices that has previously been * discovered on the same link with the same name (info), or the * same daddr. We do this since some devices (mostly PDAs) change * their device address between every discovery. */ discovery = (discovery_t *) hashbin_get_first(cachelog); while (discovery != NULL ) { node = discovery; /* Be sure to stay one item ahead */ discovery = (discovery_t *) hashbin_get_next(cachelog); if ((node->daddr == new->daddr) || (strcmp(node->nickname, new->nickname) == 0)) { /* This discovery is a previous discovery * from the same device, so just remove it */ hashbin_remove(cachelog, node->daddr, NULL); kfree(node); } } /* Insert the new and updated version */ hashbin_insert(cachelog, (queue_t *) new, new->daddr, NULL); spin_unlock_irqrestore(&irlmp->lock, flags); } /* * Function irlmp_add_discovery_log (cachelog, log) * * Merge a disovery log into the cachlog. * */ void irlmp_add_discovery_log(hashbin_t *cachelog, hashbin_t *log) { discovery_t *discovery; IRDA_DEBUG(4, __FUNCTION__ "()\n"); /* * If log is missing this means that IrLAP was unable to perform the * discovery, so restart discovery again with just the half timeout * of the normal one. */ if (log == NULL) { /* irlmp_start_discovery_timer(irlmp, 150); */ return; } discovery = (discovery_t *) hashbin_remove_first(log); while (discovery != NULL) { irlmp_add_discovery(cachelog, discovery); discovery = (discovery_t *) hashbin_remove_first(log); } /* Delete the now empty log */ hashbin_delete(log, (FREE_FUNC) kfree); } /* * Function irlmp_expire_discoveries (log, saddr, force) * * Go through all discoveries and expire all that has stayed to long * */ void irlmp_expire_discoveries(hashbin_t *log, __u32 saddr, int force) { discovery_t *discovery, *curr; IRDA_DEBUG(4, __FUNCTION__ "()\n"); discovery = (discovery_t *) hashbin_get_first(log); while (discovery != NULL) { curr = discovery; /* Be sure to be one item ahead */ discovery = (discovery_t *) hashbin_get_next(log); /* Test if it's time to expire this discovery */ if ((curr->saddr == saddr) && (force || ((jiffies - curr->timestamp) > DISCOVERY_EXPIRE_TIMEOUT))) { curr = hashbin_remove(log, curr->daddr, NULL); if (curr) kfree(curr); } } } /* * Function irlmp_dump_discoveries (log) * * Print out all discoveries in log * */ void irlmp_dump_discoveries(hashbin_t *log) { discovery_t *discovery; ASSERT(log != NULL, return;); discovery = (discovery_t *) hashbin_get_first(log); while (discovery != NULL) { IRDA_DEBUG(0, "Discovery:\n"); IRDA_DEBUG(0, " daddr=%08x\n", discovery->daddr); IRDA_DEBUG(0, " saddr=%08x\n", discovery->saddr); IRDA_DEBUG(0, " nickname=%s\n", discovery->nickname); discovery = (discovery_t *) hashbin_get_next(log); } } /* * Function irlmp_find_device (name, saddr) * * Look through the discovery log at each of the links and try to find * the device with the given name. Return daddr and saddr. If saddr is * specified, that look at that particular link only (not impl). */ __u32 irlmp_find_device(hashbin_t *cachelog, char *name, __u32 *saddr) { unsigned long flags; discovery_t *d; spin_lock_irqsave(&irlmp->lock, flags); /* Look at all discoveries for that link */ d = (discovery_t *) hashbin_get_first(cachelog); while (d != NULL) { IRDA_DEBUG(1, "Discovery:\n"); IRDA_DEBUG(1, " daddr=%08x\n", d->daddr); IRDA_DEBUG(1, " nickname=%s\n", d->nickname); if (strcmp(name, d->nickname) == 0) { *saddr = d->saddr; spin_unlock_irqrestore(&irlmp->lock, flags); return d->daddr; } d = (discovery_t *) hashbin_get_next(cachelog); } spin_unlock_irqrestore(&irlmp->lock, flags); return 0; } /* * Function proc_discovery_read (buf, start, offset, len, unused) * * Print discovery information in /proc file system * */ int discovery_proc_read(char *buf, char **start, off_t offset, int len) { discovery_t *discovery; unsigned long flags; hashbin_t *cachelog = irlmp_get_cachelog(); if (!irlmp) return len; len = sprintf(buf, "IrLMP: Discovery log:\n\n"); save_flags(flags); cli(); discovery = (discovery_t *) hashbin_get_first(cachelog); while ( discovery != NULL) { len += sprintf(buf+len, "nickname: %s,", discovery->nickname); len += sprintf(buf+len, " hint: 0x%02x%02x", discovery->hints.byte[0], discovery->hints.byte[1]); #if 0 if ( discovery->hints.byte[0] & HINT_PNP) len += sprintf( buf+len, "PnP Compatible "); if ( discovery->hints.byte[0] & HINT_PDA) len += sprintf( buf+len, "PDA/Palmtop "); if ( discovery->hints.byte[0] & HINT_COMPUTER) len += sprintf( buf+len, "Computer "); if ( discovery->hints.byte[0] & HINT_PRINTER) len += sprintf( buf+len, "Printer "); if ( discovery->hints.byte[0] & HINT_MODEM) len += sprintf( buf+len, "Modem "); if ( discovery->hints.byte[0] & HINT_FAX) len += sprintf( buf+len, "Fax "); if ( discovery->hints.byte[0] & HINT_LAN) len += sprintf( buf+len, "LAN Access "); if ( discovery->hints.byte[1] & HINT_TELEPHONY) len += sprintf( buf+len, "Telephony "); if ( discovery->hints.byte[1] & HINT_FILE_SERVER) len += sprintf( buf+len, "File Server "); if ( discovery->hints.byte[1] & HINT_COMM) len += sprintf( buf+len, "IrCOMM "); if ( discovery->hints.byte[1] & HINT_OBEX) len += sprintf( buf+len, "IrOBEX "); #endif len += sprintf(buf+len, ", saddr: 0x%08x", discovery->saddr); len += sprintf(buf+len, ", daddr: 0x%08x\n", discovery->daddr); len += sprintf(buf+len, "\n"); discovery = (discovery_t *) hashbin_get_next(cachelog); } restore_flags(flags); return len; } |