1 /* 2 * cistpl.c -- 16-bit PCMCIA Card Information Structure parser 3 * 4 * This program is free software; you can redistribute it and/or modify 5 * it under the terms of the GNU General Public License version 2 as 6 * published by the Free Software Foundation. 7 * 8 * The initial developer of the original code is David A. Hinds 9 * <dahinds@users.sourceforge.net>. Portions created by David A. Hinds 10 * are Copyright (C) 1999 David A. Hinds. All Rights Reserved. 11 * 12 * (C) 1999 David A. Hinds 13 */ 14 15 #include <linux/config.h> 16 #include <linux/module.h> 17 #include <linux/moduleparam.h> 18 #include <linux/kernel.h> 19 #include <linux/string.h> 20 #include <linux/major.h> 21 #include <linux/errno.h> 22 #include <linux/timer.h> 23 #include <linux/slab.h> 24 #include <linux/mm.h> 25 #include <linux/sched.h> 26 #include <linux/pci.h> 27 #include <linux/ioport.h> 28 #include <asm/io.h> 29 #include <asm/byteorder.h> 30 31 #include <pcmcia/cs_types.h> 32 #include <pcmcia/ss.h> 33 #include <pcmcia/cs.h> 34 #include <pcmcia/bulkmem.h> 35 #include <pcmcia/cisreg.h> 36 #include <pcmcia/cistpl.h> 37 #include "cs_internal.h" 38 39 static const u_char mantissa[] = { 40 10, 12, 13, 15, 20, 25, 30, 35, 41 40, 45, 50, 55, 60, 70, 80, 90 42 }; 43 44 static const u_int exponent[] = { 45 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000 46 }; 47 48 /* Convert an extended speed byte to a time in nanoseconds */ 49 #define SPEED_CVT(v) \ 50 (mantissa[(((v)>>3)&15)-1] * exponent[(v)&7] / 10) 51 /* Convert a power byte to a current in 0.1 microamps */ 52 #define POWER_CVT(v) \ 53 (mantissa[((v)>>3)&15] * exponent[(v)&7] / 10) 54 #define POWER_SCALE(v) (exponent[(v)&7]) 55 56 /* Upper limit on reasonable # of tuples */ 57 #define MAX_TUPLES 200 58 59 /*====================================================================*/ 60 61 /* Parameters that can be set with 'insmod' */ 62 63 /* 16-bit CIS? */ 64 static int cis_width; 65 module_param(cis_width, int, 0444); 66 67 void release_cis_mem(struct pcmcia_socket *s) 68 { 69 if (s->cis_mem.flags & MAP_ACTIVE) { 70 s->cis_mem.flags &= ~MAP_ACTIVE; 71 s->ops->set_mem_map(s, &s->cis_mem); 72 if (s->cis_mem.res) { 73 release_resource(s->cis_mem.res); 74 kfree(s->cis_mem.res); 75 s->cis_mem.res = NULL; 76 } 77 iounmap(s->cis_virt); 78 s->cis_virt = NULL; 79 } 80 } 81 EXPORT_SYMBOL(release_cis_mem); 82 83 /* 84 * Map the card memory at "card_offset" into virtual space. 85 * If flags & MAP_ATTRIB, map the attribute space, otherwise 86 * map the memory space. 87 */ 88 static void __iomem * 89 set_cis_map(struct pcmcia_socket *s, unsigned int card_offset, unsigned int flags) 90 { 91 pccard_mem_map *mem = &s->cis_mem; 92 int ret; 93 94 if (!(s->features & SS_CAP_STATIC_MAP) && (mem->res == NULL)) { 95 mem->res = pcmcia_find_mem_region(0, s->map_size, s->map_size, 0, s); 96 if (mem->res == NULL) { 97 printk(KERN_NOTICE "cs: unable to map card memory!\n"); 98 return NULL; 99 } 100 s->cis_virt = NULL; 101 } 102 103 if (!(s->features & SS_CAP_STATIC_MAP) && (!s->cis_virt)) 104 s->cis_virt = ioremap(mem->res->start, s->map_size); 105 106 mem->card_start = card_offset; 107 mem->flags = flags; 108 109 ret = s->ops->set_mem_map(s, mem); 110 if (ret) { 111 iounmap(s->cis_virt); 112 s->cis_virt = NULL; 113 return NULL; 114 } 115 116 if (s->features & SS_CAP_STATIC_MAP) { 117 if (s->cis_virt) 118 iounmap(s->cis_virt); 119 s->cis_virt = ioremap(mem->static_start, s->map_size); 120 } 121 122 return s->cis_virt; 123 } 124 125 /*====================================================================== 126 127 Low-level functions to read and write CIS memory. I think the 128 write routine is only useful for writing one-byte registers. 129 130 ======================================================================*/ 131 132 /* Bits in attr field */ 133 #define IS_ATTR 1 134 #define IS_INDIRECT 8 135 136 int pcmcia_read_cis_mem(struct pcmcia_socket *s, int attr, u_int addr, 137 u_int len, void *ptr) 138 { 139 void __iomem *sys, *end; 140 unsigned char *buf = ptr; 141 142 cs_dbg(s, 3, "pcmcia_read_cis_mem(%d, %#x, %u)\n", attr, addr, len); 143 144 if (attr & IS_INDIRECT) { 145 /* Indirect accesses use a bunch of special registers at fixed 146 locations in common memory */ 147 u_char flags = ICTRL0_COMMON|ICTRL0_AUTOINC|ICTRL0_BYTEGRAN; 148 if (attr & IS_ATTR) { 149 addr *= 2; 150 flags = ICTRL0_AUTOINC; 151 } 152 153 sys = set_cis_map(s, 0, MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0)); 154 if (!sys) { 155 memset(ptr, 0xff, len); 156 return -1; 157 } 158 159 writeb(flags, sys+CISREG_ICTRL0); 160 writeb(addr & 0xff, sys+CISREG_IADDR0); 161 writeb((addr>>8) & 0xff, sys+CISREG_IADDR1); 162 writeb((addr>>16) & 0xff, sys+CISREG_IADDR2); 163 writeb((addr>>24) & 0xff, sys+CISREG_IADDR3); 164 for ( ; len > 0; len--, buf++) 165 *buf = readb(sys+CISREG_IDATA0); 166 } else { 167 u_int inc = 1, card_offset, flags; 168 169 flags = MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0); 170 if (attr) { 171 flags |= MAP_ATTRIB; 172 inc++; 173 addr *= 2; 174 } 175 176 card_offset = addr & ~(s->map_size-1); 177 while (len) { 178 sys = set_cis_map(s, card_offset, flags); 179 if (!sys) { 180 memset(ptr, 0xff, len); 181 return -1; 182 } 183 end = sys + s->map_size; 184 sys = sys + (addr & (s->map_size-1)); 185 for ( ; len > 0; len--, buf++, sys += inc) { 186 if (sys == end) 187 break; 188 *buf = readb(sys); 189 } 190 card_offset += s->map_size; 191 addr = 0; 192 } 193 } 194 cs_dbg(s, 3, " %#2.2x %#2.2x %#2.2x %#2.2x ...\n", 195 *(u_char *)(ptr+0), *(u_char *)(ptr+1), 196 *(u_char *)(ptr+2), *(u_char *)(ptr+3)); 197 return 0; 198 } 199 EXPORT_SYMBOL(pcmcia_read_cis_mem); 200 201 202 void pcmcia_write_cis_mem(struct pcmcia_socket *s, int attr, u_int addr, 203 u_int len, void *ptr) 204 { 205 void __iomem *sys, *end; 206 unsigned char *buf = ptr; 207 208 cs_dbg(s, 3, "pcmcia_write_cis_mem(%d, %#x, %u)\n", attr, addr, len); 209 210 if (attr & IS_INDIRECT) { 211 /* Indirect accesses use a bunch of special registers at fixed 212 locations in common memory */ 213 u_char flags = ICTRL0_COMMON|ICTRL0_AUTOINC|ICTRL0_BYTEGRAN; 214 if (attr & IS_ATTR) { 215 addr *= 2; 216 flags = ICTRL0_AUTOINC; 217 } 218 219 sys = set_cis_map(s, 0, MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0)); 220 if (!sys) 221 return; /* FIXME: Error */ 222 223 writeb(flags, sys+CISREG_ICTRL0); 224 writeb(addr & 0xff, sys+CISREG_IADDR0); 225 writeb((addr>>8) & 0xff, sys+CISREG_IADDR1); 226 writeb((addr>>16) & 0xff, sys+CISREG_IADDR2); 227 writeb((addr>>24) & 0xff, sys+CISREG_IADDR3); 228 for ( ; len > 0; len--, buf++) 229 writeb(*buf, sys+CISREG_IDATA0); 230 } else { 231 u_int inc = 1, card_offset, flags; 232 233 flags = MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0); 234 if (attr & IS_ATTR) { 235 flags |= MAP_ATTRIB; 236 inc++; 237 addr *= 2; 238 } 239 240 card_offset = addr & ~(s->map_size-1); 241 while (len) { 242 sys = set_cis_map(s, card_offset, flags); 243 if (!sys) 244 return; /* FIXME: error */ 245 246 end = sys + s->map_size; 247 sys = sys + (addr & (s->map_size-1)); 248 for ( ; len > 0; len--, buf++, sys += inc) { 249 if (sys == end) 250 break; 251 writeb(*buf, sys); 252 } 253 card_offset += s->map_size; 254 addr = 0; 255 } 256 } 257 } 258 EXPORT_SYMBOL(pcmcia_write_cis_mem); 259 260 261 /*====================================================================== 262 263 This is a wrapper around read_cis_mem, with the same interface, 264 but which caches information, for cards whose CIS may not be 265 readable all the time. 266 267 ======================================================================*/ 268 269 static void read_cis_cache(struct pcmcia_socket *s, int attr, u_int addr, 270 u_int len, void *ptr) 271 { 272 struct cis_cache_entry *cis; 273 int ret; 274 275 if (s->fake_cis) { 276 if (s->fake_cis_len > addr+len) 277 memcpy(ptr, s->fake_cis+addr, len); 278 else 279 memset(ptr, 0xff, len); 280 return; 281 } 282 283 list_for_each_entry(cis, &s->cis_cache, node) { 284 if (cis->addr == addr && cis->len == len && cis->attr == attr) { 285 memcpy(ptr, cis->cache, len); 286 return; 287 } 288 } 289 290 #ifdef CONFIG_CARDBUS 291 if (s->state & SOCKET_CARDBUS) 292 ret = read_cb_mem(s, attr, addr, len, ptr); 293 else 294 #endif 295 ret = pcmcia_read_cis_mem(s, attr, addr, len, ptr); 296 297 if (ret == 0) { 298 /* Copy data into the cache */ 299 cis = kmalloc(sizeof(struct cis_cache_entry) + len, GFP_KERNEL); 300 if (cis) { 301 cis->addr = addr; 302 cis->len = len; 303 cis->attr = attr; 304 memcpy(cis->cache, ptr, len); 305 list_add(&cis->node, &s->cis_cache); 306 } 307 } 308 } 309 310 static void 311 remove_cis_cache(struct pcmcia_socket *s, int attr, u_int addr, u_int len) 312 { 313 struct cis_cache_entry *cis; 314 315 list_for_each_entry(cis, &s->cis_cache, node) 316 if (cis->addr == addr && cis->len == len && cis->attr == attr) { 317 list_del(&cis->node); 318 kfree(cis); 319 break; 320 } 321 } 322 323 void destroy_cis_cache(struct pcmcia_socket *s) 324 { 325 struct list_head *l, *n; 326 327 list_for_each_safe(l, n, &s->cis_cache) { 328 struct cis_cache_entry *cis = list_entry(l, struct cis_cache_entry, node); 329 330 list_del(&cis->node); 331 kfree(cis); 332 } 333 334 /* 335 * If there was a fake CIS, destroy that as well. 336 */ 337 kfree(s->fake_cis); 338 s->fake_cis = NULL; 339 } 340 EXPORT_SYMBOL(destroy_cis_cache); 341 342 /*====================================================================== 343 344 This verifies if the CIS of a card matches what is in the CIS 345 cache. 346 347 ======================================================================*/ 348 349 int verify_cis_cache(struct pcmcia_socket *s) 350 { 351 struct cis_cache_entry *cis; 352 char *buf; 353 354 buf = kmalloc(256, GFP_KERNEL); 355 if (buf == NULL) 356 return -1; 357 list_for_each_entry(cis, &s->cis_cache, node) { 358 int len = cis->len; 359 360 if (len > 256) 361 len = 256; 362 #ifdef CONFIG_CARDBUS 363 if (s->state & SOCKET_CARDBUS) 364 read_cb_mem(s, cis->attr, cis->addr, len, buf); 365 else 366 #endif 367 pcmcia_read_cis_mem(s, cis->attr, cis->addr, len, buf); 368 369 if (memcmp(buf, cis->cache, len) != 0) { 370 kfree(buf); 371 return -1; 372 } 373 } 374 kfree(buf); 375 return 0; 376 } 377 378 /*====================================================================== 379 380 For really bad cards, we provide a facility for uploading a 381 replacement CIS. 382 383 ======================================================================*/ 384 385 int pcmcia_replace_cis(struct pcmcia_socket *s, cisdump_t *cis) 386 { 387 kfree(s->fake_cis); 388 s->fake_cis = NULL; 389 if (cis->Length > CISTPL_MAX_CIS_SIZE) 390 return CS_BAD_SIZE; 391 s->fake_cis = kmalloc(cis->Length, GFP_KERNEL); 392 if (s->fake_cis == NULL) 393 return CS_OUT_OF_RESOURCE; 394 s->fake_cis_len = cis->Length; 395 memcpy(s->fake_cis, cis->Data, cis->Length); 396 return CS_SUCCESS; 397 } 398 EXPORT_SYMBOL(pcmcia_replace_cis); 399 400 /*====================================================================== 401 402 The high-level CIS tuple services 403 404 ======================================================================*/ 405 406 typedef struct tuple_flags { 407 u_int link_space:4; 408 u_int has_link:1; 409 u_int mfc_fn:3; 410 u_int space:4; 411 } tuple_flags; 412 413 #define LINK_SPACE(f) (((tuple_flags *)(&(f)))->link_space) 414 #define HAS_LINK(f) (((tuple_flags *)(&(f)))->has_link) 415 #define MFC_FN(f) (((tuple_flags *)(&(f)))->mfc_fn) 416 #define SPACE(f) (((tuple_flags *)(&(f)))->space) 417 418 int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int func, tuple_t *tuple); 419 420 int pccard_get_first_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple) 421 { 422 if (!s) 423 return CS_BAD_HANDLE; 424 if (!(s->state & SOCKET_PRESENT)) 425 return CS_NO_CARD; 426 tuple->TupleLink = tuple->Flags = 0; 427 #ifdef CONFIG_CARDBUS 428 if (s->state & SOCKET_CARDBUS) { 429 struct pci_dev *dev = s->cb_dev; 430 u_int ptr; 431 pci_bus_read_config_dword(dev->subordinate, 0, PCI_CARDBUS_CIS, &ptr); 432 tuple->CISOffset = ptr & ~7; 433 SPACE(tuple->Flags) = (ptr & 7); 434 } else 435 #endif 436 { 437 /* Assume presence of a LONGLINK_C to address 0 */ 438 tuple->CISOffset = tuple->LinkOffset = 0; 439 SPACE(tuple->Flags) = HAS_LINK(tuple->Flags) = 1; 440 } 441 if (!(s->state & SOCKET_CARDBUS) && (s->functions > 1) && 442 !(tuple->Attributes & TUPLE_RETURN_COMMON)) { 443 cisdata_t req = tuple->DesiredTuple; 444 tuple->DesiredTuple = CISTPL_LONGLINK_MFC; 445 if (pccard_get_next_tuple(s, function, tuple) == CS_SUCCESS) { 446 tuple->DesiredTuple = CISTPL_LINKTARGET; 447 if (pccard_get_next_tuple(s, function, tuple) != CS_SUCCESS) 448 return CS_NO_MORE_ITEMS; 449 } else 450 tuple->CISOffset = tuple->TupleLink = 0; 451 tuple->DesiredTuple = req; 452 } 453 return pccard_get_next_tuple(s, function, tuple); 454 } 455 EXPORT_SYMBOL(pccard_get_first_tuple); 456 457 static int follow_link(struct pcmcia_socket *s, tuple_t *tuple) 458 { 459 u_char link[5]; 460 u_int ofs; 461 462 if (MFC_FN(tuple->Flags)) { 463 /* Get indirect link from the MFC tuple */ 464 read_cis_cache(s, LINK_SPACE(tuple->Flags), 465 tuple->LinkOffset, 5, link); 466 ofs = le32_to_cpu(*(__le32 *)(link+1)); 467 SPACE(tuple->Flags) = (link[0] == CISTPL_MFC_ATTR); 468 /* Move to the next indirect link */ 469 tuple->LinkOffset += 5; 470 MFC_FN(tuple->Flags)--; 471 } else if (HAS_LINK(tuple->Flags)) { 472 ofs = tuple->LinkOffset; 473 SPACE(tuple->Flags) = LINK_SPACE(tuple->Flags); 474 HAS_LINK(tuple->Flags) = 0; 475 } else { 476 return -1; 477 } 478 if (!(s->state & SOCKET_CARDBUS) && SPACE(tuple->Flags)) { 479 /* This is ugly, but a common CIS error is to code the long 480 link offset incorrectly, so we check the right spot... */ 481 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link); 482 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) && 483 (strncmp(link+2, "CIS", 3) == 0)) 484 return ofs; 485 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5); 486 /* Then, we try the wrong spot... */ 487 ofs = ofs >> 1; 488 } 489 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link); 490 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) && 491 (strncmp(link+2, "CIS", 3) == 0)) 492 return ofs; 493 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5); 494 return -1; 495 } 496 497 int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple) 498 { 499 u_char link[2], tmp; 500 int ofs, i, attr; 501 502 if (!s) 503 return CS_BAD_HANDLE; 504 if (!(s->state & SOCKET_PRESENT)) 505 return CS_NO_CARD; 506 507 link[1] = tuple->TupleLink; 508 ofs = tuple->CISOffset + tuple->TupleLink; 509 attr = SPACE(tuple->Flags); 510 511 for (i = 0; i < MAX_TUPLES; i++) { 512 if (link[1] == 0xff) { 513 link[0] = CISTPL_END; 514 } else { 515 read_cis_cache(s, attr, ofs, 2, link); 516 if (link[0] == CISTPL_NULL) { 517 ofs++; continue; 518 } 519 } 520 521 /* End of chain? Follow long link if possible */ 522 if (link[0] == CISTPL_END) { 523 if ((ofs = follow_link(s, tuple)) < 0) 524 return CS_NO_MORE_ITEMS; 525 attr = SPACE(tuple->Flags); 526 read_cis_cache(s, attr, ofs, 2, link); 527 } 528 529 /* Is this a link tuple? Make a note of it */ 530 if ((link[0] == CISTPL_LONGLINK_A) || 531 (link[0] == CISTPL_LONGLINK_C) || 532 (link[0] == CISTPL_LONGLINK_MFC) || 533 (link[0] == CISTPL_LINKTARGET) || 534 (link[0] == CISTPL_INDIRECT) || 535 (link[0] == CISTPL_NO_LINK)) { 536 switch (link[0]) { 537 case CISTPL_LONGLINK_A: 538 HAS_LINK(tuple->Flags) = 1; 539 LINK_SPACE(tuple->Flags) = attr | IS_ATTR; 540 read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset); 541 break; 542 case CISTPL_LONGLINK_C: 543 HAS_LINK(tuple->Flags) = 1; 544 LINK_SPACE(tuple->Flags) = attr & ~IS_ATTR; 545 read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset); 546 break; 547 case CISTPL_INDIRECT: 548 HAS_LINK(tuple->Flags) = 1; 549 LINK_SPACE(tuple->Flags) = IS_ATTR | IS_INDIRECT; 550 tuple->LinkOffset = 0; 551 break; 552 case CISTPL_LONGLINK_MFC: 553 tuple->LinkOffset = ofs + 3; 554 LINK_SPACE(tuple->Flags) = attr; 555 if (function == BIND_FN_ALL) { 556 /* Follow all the MFC links */ 557 read_cis_cache(s, attr, ofs+2, 1, &tmp); 558 MFC_FN(tuple->Flags) = tmp; 559 } else { 560 /* Follow exactly one of the links */ 561 MFC_FN(tuple->Flags) = 1; 562 tuple->LinkOffset += function * 5; 563 } 564 break; 565 case CISTPL_NO_LINK: 566 HAS_LINK(tuple->Flags) = 0; 567 break; 568 } 569 if ((tuple->Attributes & TUPLE_RETURN_LINK) && 570 (tuple->DesiredTuple == RETURN_FIRST_TUPLE)) 571 break; 572 } else 573 if (tuple->DesiredTuple == RETURN_FIRST_TUPLE) 574 break; 575 576 if (link[0] == tuple->DesiredTuple) 577 break; 578 ofs += link[1] + 2; 579 } 580 if (i == MAX_TUPLES) { 581 cs_dbg(s, 1, "cs: overrun in pcmcia_get_next_tuple\n"); 582 return CS_NO_MORE_ITEMS; 583 } 584 585 tuple->TupleCode = link[0]; 586 tuple->TupleLink = link[1]; 587 tuple->CISOffset = ofs + 2; 588 return CS_SUCCESS; 589 } 590 EXPORT_SYMBOL(pccard_get_next_tuple); 591 592 /*====================================================================*/ 593 594 #define _MIN(a, b) (((a) < (b)) ? (a) : (b)) 595 596 int pccard_get_tuple_data(struct pcmcia_socket *s, tuple_t *tuple) 597 { 598 u_int len; 599 600 if (!s) 601 return CS_BAD_HANDLE; 602 603 if (tuple->TupleLink < tuple->TupleOffset) 604 return CS_NO_MORE_ITEMS; 605 len = tuple->TupleLink - tuple->TupleOffset; 606 tuple->TupleDataLen = tuple->TupleLink; 607 if (len == 0) 608 return CS_SUCCESS; 609 read_cis_cache(s, SPACE(tuple->Flags), 610 tuple->CISOffset + tuple->TupleOffset, 611 _MIN(len, tuple->TupleDataMax), tuple->TupleData); 612 return CS_SUCCESS; 613 } 614 EXPORT_SYMBOL(pccard_get_tuple_data); 615 616 617 /*====================================================================== 618 619 Parsing routines for individual tuples 620 621 ======================================================================*/ 622 623 static int parse_device(tuple_t *tuple, cistpl_device_t *device) 624 { 625 int i; 626 u_char scale; 627 u_char *p, *q; 628 629 p = (u_char *)tuple->TupleData; 630 q = p + tuple->TupleDataLen; 631 632 device->ndev = 0; 633 for (i = 0; i < CISTPL_MAX_DEVICES; i++) { 634 635 if (*p == 0xff) break; 636 device->dev[i].type = (*p >> 4); 637 device->dev[i].wp = (*p & 0x08) ? 1 : 0; 638 switch (*p & 0x07) { 639 case 0: device->dev[i].speed = 0; break; 640 case 1: device->dev[i].speed = 250; break; 641 case 2: device->dev[i].speed = 200; break; 642 case 3: device->dev[i].speed = 150; break; 643 case 4: device->dev[i].speed = 100; break; 644 case 7: 645 if (++p == q) return CS_BAD_TUPLE; 646 device->dev[i].speed = SPEED_CVT(*p); 647 while (*p & 0x80) 648 if (++p == q) return CS_BAD_TUPLE; 649 break; 650 default: 651 return CS_BAD_TUPLE; 652 } 653 654 if (++p == q) return CS_BAD_TUPLE; 655 if (*p == 0xff) break; 656 scale = *p & 7; 657 if (scale == 7) return CS_BAD_TUPLE; 658 device->dev[i].size = ((*p >> 3) + 1) * (512 << (scale*2)); 659 device->ndev++; 660 if (++p == q) break; 661 } 662 663 return CS_SUCCESS; 664 } 665 666 /*====================================================================*/ 667 668 static int parse_checksum(tuple_t *tuple, cistpl_checksum_t *csum) 669 { 670 u_char *p; 671 if (tuple->TupleDataLen < 5) 672 return CS_BAD_TUPLE; 673 p = (u_char *)tuple->TupleData; 674 csum->addr = tuple->CISOffset+(short)le16_to_cpu(*(__le16 *)p)-2; 675 csum->len = le16_to_cpu(*(__le16 *)(p + 2)); 676 csum->sum = *(p+4); 677 return CS_SUCCESS; 678 } 679 680 /*====================================================================*/ 681 682 static int parse_longlink(tuple_t *tuple, cistpl_longlink_t *link) 683 { 684 if (tuple->TupleDataLen < 4) 685 return CS_BAD_TUPLE; 686 link->addr = le32_to_cpu(*(__le32 *)tuple->TupleData); 687 return CS_SUCCESS; 688 } 689 690 /*====================================================================*/ 691 692 static int parse_longlink_mfc(tuple_t *tuple, 693 cistpl_longlink_mfc_t *link) 694 { 695 u_char *p; 696 int i; 697 698 p = (u_char *)tuple->TupleData; 699 700 link->nfn = *p; p++; 701 if (tuple->TupleDataLen <= link->nfn*5) 702 return CS_BAD_TUPLE; 703 for (i = 0; i < link->nfn; i++) { 704 link->fn[i].space = *p; p++; 705 link->fn[i].addr = le32_to_cpu(*(__le32 *)p); p += 4; 706 } 707 return CS_SUCCESS; 708 } 709 710 /*====================================================================*/ 711 712 static int parse_strings(u_char *p, u_char *q, int max, 713 char *s, u_char *ofs, u_char *found) 714 { 715 int i, j, ns; 716 717 if (p == q) return CS_BAD_TUPLE; 718 ns = 0; j = 0; 719 for (i = 0; i < max; i++) { 720 if (*p == 0xff) break; 721 ofs[i] = j; 722 ns++; 723 for (;;) { 724 s[j++] = (*p == 0xff) ? '\0' : *p; 725 if ((*p == '\0') || (*p == 0xff)) break; 726 if (++p == q) return CS_BAD_TUPLE; 727 } 728 if ((*p == 0xff) || (++p == q)) break; 729 } 730 if (found) { 731 *found = ns; 732 return CS_SUCCESS; 733 } else { 734 return (ns == max) ? CS_SUCCESS : CS_BAD_TUPLE; 735 } 736 } 737 738 /*====================================================================*/ 739 740 static int parse_vers_1(tuple_t *tuple, cistpl_vers_1_t *vers_1) 741 { 742 u_char *p, *q; 743 744 p = (u_char *)tuple->TupleData; 745 q = p + tuple->TupleDataLen; 746 747 vers_1->major = *p; p++; 748 vers_1->minor = *p; p++; 749 if (p >= q) return CS_BAD_TUPLE; 750 751 return parse_strings(p, q, CISTPL_VERS_1_MAX_PROD_STRINGS, 752 vers_1->str, vers_1->ofs, &vers_1->ns); 753 } 754 755 /*====================================================================*/ 756 757 static int parse_altstr(tuple_t *tuple, cistpl_altstr_t *altstr) 758 { 759 u_char *p, *q; 760 761 p = (u_char *)tuple->TupleData; 762 q = p + tuple->TupleDataLen; 763 764 return parse_strings(p, q, CISTPL_MAX_ALTSTR_STRINGS, 765 altstr->str, altstr->ofs, &altstr->ns); 766 } 767 768 /*====================================================================*/ 769 770 static int parse_jedec(tuple_t *tuple, cistpl_jedec_t *jedec) 771 { 772 u_char *p, *q; 773 int nid; 774 775 p = (u_char *)tuple->TupleData; 776 q = p + tuple->TupleDataLen; 777 778 for (nid = 0; nid < CISTPL_MAX_DEVICES; nid++) { 779 if (p > q-2) break; 780 jedec->id[nid].mfr = p[0]; 781 jedec->id[nid].info = p[1]; 782 p += 2; 783 } 784 jedec->nid = nid; 785 return CS_SUCCESS; 786 } 787 788 /*====================================================================*/ 789 790 static int parse_manfid(tuple_t *tuple, cistpl_manfid_t *m) 791 { 792 __le16 *p; 793 if (tuple->TupleDataLen < 4) 794 return CS_BAD_TUPLE; 795 p = (__le16 *)tuple->TupleData; 796 m->manf = le16_to_cpu(p[0]); 797 m->card = le16_to_cpu(p[1]); 798 return CS_SUCCESS; 799 } 800 801 /*====================================================================*/ 802 803 static int parse_funcid(tuple_t *tuple, cistpl_funcid_t *f) 804 { 805 u_char *p; 806 if (tuple->TupleDataLen < 2) 807 return CS_BAD_TUPLE; 808 p = (u_char *)tuple->TupleData; 809 f->func = p[0]; 810 f->sysinit = p[1]; 811 return CS_SUCCESS; 812 } 813 814 /*====================================================================*/ 815 816 static int parse_funce(tuple_t *tuple, cistpl_funce_t *f) 817 { 818 u_char *p; 819 int i; 820 if (tuple->TupleDataLen < 1) 821 return CS_BAD_TUPLE; 822 p = (u_char *)tuple->TupleData; 823 f->type = p[0]; 824 for (i = 1; i < tuple->TupleDataLen; i++) 825 f->data[i-1] = p[i]; 826 return CS_SUCCESS; 827 } 828 829 /*====================================================================*/ 830 831 static int parse_config(tuple_t *tuple, cistpl_config_t *config) 832 { 833 int rasz, rmsz, i; 834 u_char *p; 835 836 p = (u_char *)tuple->TupleData; 837 rasz = *p & 0x03; 838 rmsz = (*p & 0x3c) >> 2; 839 if (tuple->TupleDataLen < rasz+rmsz+4) 840 return CS_BAD_TUPLE; 841 config->last_idx = *(++p); 842 p++; 843 config->base = 0; 844 for (i = 0; i <= rasz; i++) 845 config->base += p[i] << (8*i); 846 p += rasz+1; 847 for (i = 0; i < 4; i++) 848 config->rmask[i] = 0; 849 for (i = 0; i <= rmsz; i++) 850 config->rmask[i>>2] += p[i] << (8*(i%4)); 851 config->subtuples = tuple->TupleDataLen - (rasz+rmsz+4); 852 return CS_SUCCESS; 853 } 854 855 /*====================================================================== 856 857 The following routines are all used to parse the nightmarish 858 config table entries. 859 860 ======================================================================*/ 861 862 static u_char *parse_power(u_char *p, u_char *q, 863 cistpl_power_t *pwr) 864 { 865 int i; 866 u_int scale; 867 868 if (p == q) return NULL; 869 pwr->present = *p; 870 pwr->flags = 0; 871 p++; 872 for (i = 0; i < 7; i++) 873 if (pwr->present & (1<<i)) { 874 if (p == q) return NULL; 875 pwr->param[i] = POWER_CVT(*p); 876 scale = POWER_SCALE(*p); 877 while (*p & 0x80) { 878 if (++p == q) return NULL; 879 if ((*p & 0x7f) < 100) 880 pwr->param[i] += (*p & 0x7f) * scale / 100; 881 else if (*p == 0x7d) 882 pwr->flags |= CISTPL_POWER_HIGHZ_OK; 883 else if (*p == 0x7e) 884 pwr->param[i] = 0; 885 else if (*p == 0x7f) 886 pwr->flags |= CISTPL_POWER_HIGHZ_REQ; 887 else 888 return NULL; 889 } 890 p++; 891 } 892 return p; 893 } 894 895 /*====================================================================*/ 896 897 static u_char *parse_timing(u_char *p, u_char *q, 898 cistpl_timing_t *timing) 899 { 900 u_char scale; 901 902 if (p == q) return NULL; 903 scale = *p; 904 if ((scale & 3) != 3) { 905 if (++p == q) return NULL; 906 timing->wait = SPEED_CVT(*p); 907 timing->waitscale = exponent[scale & 3]; 908 } else 909 timing->wait = 0; 910 scale >>= 2; 911 if ((scale & 7) != 7) { 912 if (++p == q) return NULL; 913 timing->ready = SPEED_CVT(*p); 914 timing->rdyscale = exponent[scale & 7]; 915 } else 916 timing->ready = 0; 917 scale >>= 3; 918 if (scale != 7) { 919 if (++p == q) return NULL; 920 timing->reserved = SPEED_CVT(*p); 921 timing->rsvscale = exponent[scale]; 922 } else 923 timing->reserved = 0; 924 p++; 925 return p; 926 } 927 928 /*====================================================================*/ 929 930 static u_char *parse_io(u_char *p, u_char *q, cistpl_io_t *io) 931 { 932 int i, j, bsz, lsz; 933 934 if (p == q) return NULL; 935 io->flags = *p; 936 937 if (!(*p & 0x80)) { 938 io->nwin = 1; 939 io->win[0].base = 0; 940 io->win[0].len = (1 << (io->flags & CISTPL_IO_LINES_MASK)); 941 return p+1; 942 } 943 944 if (++p == q) return NULL; 945 io->nwin = (*p & 0x0f) + 1; 946 bsz = (*p & 0x30) >> 4; 947 if (bsz == 3) bsz++; 948 lsz = (*p & 0xc0) >> 6; 949 if (lsz == 3) lsz++; 950 p++; 951 952 for (i = 0; i < io->nwin; i++) { 953 io->win[i].base = 0; 954 io->win[i].len = 1; 955 for (j = 0; j < bsz; j++, p++) { 956 if (p == q) return NULL; 957 io->win[i].base += *p << (j*8); 958 } 959 for (j = 0; j < lsz; j++, p++) { 960 if (p == q) return NULL; 961 io->win[i].len += *p << (j*8); 962 } 963 } 964 return p; 965 } 966 967 /*====================================================================*/ 968 969 static u_char *parse_mem(u_char *p, u_char *q, cistpl_mem_t *mem) 970 { 971 int i, j, asz, lsz, has_ha; 972 u_int len, ca, ha; 973 974 if (p == q) return NULL; 975 976 mem->nwin = (*p & 0x07) + 1; 977 lsz = (*p & 0x18) >> 3; 978 asz = (*p & 0x60) >> 5; 979 has_ha = (*p & 0x80); 980 if (++p == q) return NULL; 981 982 for (i = 0; i < mem->nwin; i++) { 983 len = ca = ha = 0; 984 for (j = 0; j < lsz; j++, p++) { 985 if (p == q) return NULL; 986 len += *p << (j*8); 987 } 988 for (j = 0; j < asz; j++, p++) { 989 if (p == q) return NULL; 990 ca += *p << (j*8); 991 } 992 if (has_ha) 993 for (j = 0; j < asz; j++, p++) { 994 if (p == q) return NULL; 995 ha += *p << (j*8); 996 } 997 mem->win[i].len = len << 8; 998 mem->win[i].card_addr = ca << 8; 999 mem->win[i].host_addr = ha << 8; 1000 } 1001 return p; 1002 } 1003 1004 /*====================================================================*/ 1005 1006 static u_char *parse_irq(u_char *p, u_char *q, cistpl_irq_t *irq) 1007 { 1008 if (p == q) return NULL; 1009 irq->IRQInfo1 = *p; p++; 1010 if (irq->IRQInfo1 & IRQ_INFO2_VALID) { 1011 if (p+2 > q) return NULL; 1012 irq->IRQInfo2 = (p[1]<<8) + p[0]; 1013 p += 2; 1014 } 1015 return p; 1016 } 1017 1018 /*====================================================================*/ 1019 1020 static int parse_cftable_entry(tuple_t *tuple, 1021 cistpl_cftable_entry_t *entry) 1022 { 1023 u_char *p, *q, features; 1024 1025 p = tuple->TupleData; 1026 q = p + tuple->TupleDataLen; 1027 entry->index = *p & 0x3f; 1028 entry->flags = 0; 1029 if (*p & 0x40) 1030 entry->flags |= CISTPL_CFTABLE_DEFAULT; 1031 if (*p & 0x80) { 1032 if (++p == q) return CS_BAD_TUPLE; 1033 if (*p & 0x10) 1034 entry->flags |= CISTPL_CFTABLE_BVDS; 1035 if (*p & 0x20) 1036 entry->flags |= CISTPL_CFTABLE_WP; 1037 if (*p & 0x40) 1038 entry->flags |= CISTPL_CFTABLE_RDYBSY; 1039 if (*p & 0x80) 1040 entry->flags |= CISTPL_CFTABLE_MWAIT; 1041 entry->interface = *p & 0x0f; 1042 } else 1043 entry->interface = 0; 1044 1045 /* Process optional features */ 1046 if (++p == q) return CS_BAD_TUPLE; 1047 features = *p; p++; 1048 1049 /* Power options */ 1050 if ((features & 3) > 0) { 1051 p = parse_power(p, q, &entry->vcc); 1052 if (p == NULL) return CS_BAD_TUPLE; 1053 } else 1054 entry->vcc.present = 0; 1055 if ((features & 3) > 1) { 1056 p = parse_power(p, q, &entry->vpp1); 1057 if (p == NULL) return CS_BAD_TUPLE; 1058 } else 1059 entry->vpp1.present = 0; 1060 if ((features & 3) > 2) { 1061 p = parse_power(p, q, &entry->vpp2); 1062 if (p == NULL) return CS_BAD_TUPLE; 1063 } else 1064 entry->vpp2.present = 0; 1065 1066 /* Timing options */ 1067 if (features & 0x04) { 1068 p = parse_timing(p, q, &entry->timing); 1069 if (p == NULL) return CS_BAD_TUPLE; 1070 } else { 1071 entry->timing.wait = 0; 1072 entry->timing.ready = 0; 1073 entry->timing.reserved = 0; 1074 } 1075 1076 /* I/O window options */ 1077 if (features & 0x08) { 1078 p = parse_io(p, q, &entry->io); 1079 if (p == NULL) return CS_BAD_TUPLE; 1080 } else 1081 entry->io.nwin = 0; 1082 1083 /* Interrupt options */ 1084 if (features & 0x10) { 1085 p = parse_irq(p, q, &entry->irq); 1086 if (p == NULL) return CS_BAD_TUPLE; 1087 } else 1088 entry->irq.IRQInfo1 = 0; 1089 1090 switch (features & 0x60) { 1091 case 0x00: 1092 entry->mem.nwin = 0; 1093 break; 1094 case 0x20: 1095 entry->mem.nwin = 1; 1096 entry->mem.win[0].len = le16_to_cpu(*(__le16 *)p) << 8; 1097 entry->mem.win[0].card_addr = 0; 1098 entry->mem.win[0].host_addr = 0; 1099 p += 2; 1100 if (p > q) return CS_BAD_TUPLE; 1101 break; 1102 case 0x40: 1103 entry->mem.nwin = 1; 1104 entry->mem.win[0].len = le16_to_cpu(*(__le16 *)p) << 8; 1105 entry->mem.win[0].card_addr = 1106 le16_to_cpu(*(__le16 *)(p+2)) << 8; 1107 entry->mem.win[0].host_addr = 0; 1108 p += 4; 1109 if (p > q) return CS_BAD_TUPLE; 1110 break; 1111 case 0x60: 1112 p = parse_mem(p, q, &entry->mem); 1113 if (p == NULL) return CS_BAD_TUPLE; 1114 break; 1115 } 1116 1117 /* Misc features */ 1118 if (features & 0x80) { 1119 if (p == q) return CS_BAD_TUPLE; 1120 entry->flags |= (*p << 8); 1121 while (*p & 0x80) 1122 if (++p == q) return CS_BAD_TUPLE; 1123 p++; 1124 } 1125 1126 entry->subtuples = q-p; 1127 1128 return CS_SUCCESS; 1129 } 1130 1131 /*====================================================================*/ 1132 1133 #ifdef CONFIG_CARDBUS 1134 1135 static int parse_bar(tuple_t *tuple, cistpl_bar_t *bar) 1136 { 1137 u_char *p; 1138 if (tuple->TupleDataLen < 6) 1139 return CS_BAD_TUPLE; 1140 p = (u_char *)tuple->TupleData; 1141 bar->attr = *p; 1142 p += 2; 1143 bar->size = le32_to_cpu(*(__le32 *)p); 1144 return CS_SUCCESS; 1145 } 1146 1147 static int parse_config_cb(tuple_t *tuple, cistpl_config_t *config) 1148 { 1149 u_char *p; 1150 1151 p = (u_char *)tuple->TupleData; 1152 if ((*p != 3) || (tuple->TupleDataLen < 6)) 1153 return CS_BAD_TUPLE; 1154 config->last_idx = *(++p); 1155 p++; 1156 config->base = le32_to_cpu(*(__le32 *)p); 1157 config->subtuples = tuple->TupleDataLen - 6; 1158 return CS_SUCCESS; 1159 } 1160 1161 static int parse_cftable_entry_cb(tuple_t *tuple, 1162 cistpl_cftable_entry_cb_t *entry) 1163 { 1164 u_char *p, *q, features; 1165 1166 p = tuple->TupleData; 1167 q = p + tuple->TupleDataLen; 1168 entry->index = *p & 0x3f; 1169 entry->flags = 0; 1170 if (*p & 0x40) 1171 entry->flags |= CISTPL_CFTABLE_DEFAULT; 1172 1173 /* Process optional features */ 1174 if (++p == q) return CS_BAD_TUPLE; 1175 features = *p; p++; 1176 1177 /* Power options */ 1178 if ((features & 3) > 0) { 1179 p = parse_power(p, q, &entry->vcc); 1180 if (p == NULL) return CS_BAD_TUPLE; 1181 } else 1182 entry->vcc.present = 0; 1183 if ((features & 3) > 1) { 1184 p = parse_power(p, q, &entry->vpp1); 1185 if (p == NULL) return CS_BAD_TUPLE; 1186 } else 1187 entry->vpp1.present = 0; 1188 if ((features & 3) > 2) { 1189 p = parse_power(p, q, &entry->vpp2); 1190 if (p == NULL) return CS_BAD_TUPLE; 1191 } else 1192 entry->vpp2.present = 0; 1193 1194 /* I/O window options */ 1195 if (features & 0x08) { 1196 if (p == q) return CS_BAD_TUPLE; 1197 entry->io = *p; p++; 1198 } else 1199 entry->io = 0; 1200 1201 /* Interrupt options */ 1202 if (features & 0x10) { 1203 p = parse_irq(p, q, &entry->irq); 1204 if (p == NULL) return CS_BAD_TUPLE; 1205 } else 1206 entry->irq.IRQInfo1 = 0; 1207 1208 if (features & 0x20) { 1209 if (p == q) return CS_BAD_TUPLE; 1210 entry->mem = *p; p++; 1211 } else 1212 entry->mem = 0; 1213 1214 /* Misc features */ 1215 if (features & 0x80) { 1216 if (p == q) return CS_BAD_TUPLE; 1217 entry->flags |= (*p << 8); 1218 if (*p & 0x80) { 1219 if (++p == q) return CS_BAD_TUPLE; 1220 entry->flags |= (*p << 16); 1221 } 1222 while (*p & 0x80) 1223 if (++p == q) return CS_BAD_TUPLE; 1224 p++; 1225 } 1226 1227 entry->subtuples = q-p; 1228 1229 return CS_SUCCESS; 1230 } 1231 1232 #endif 1233 1234 /*====================================================================*/ 1235 1236 static int parse_device_geo(tuple_t *tuple, cistpl_device_geo_t *geo) 1237 { 1238 u_char *p, *q; 1239 int n; 1240 1241 p = (u_char *)tuple->TupleData; 1242 q = p + tuple->TupleDataLen; 1243 1244 for (n = 0; n < CISTPL_MAX_DEVICES; n++) { 1245 if (p > q-6) break; 1246 geo->geo[n].buswidth = p[0]; 1247 geo->geo[n].erase_block = 1 << (p[1]-1); 1248 geo->geo[n].read_block = 1 << (p[2]-1); 1249 geo->geo[n].write_block = 1 << (p[3]-1); 1250 geo->geo[n].partition = 1 << (p[4]-1); 1251 geo->geo[n].interleave = 1 << (p[5]-1); 1252 p += 6; 1253 } 1254 geo->ngeo = n; 1255 return CS_SUCCESS; 1256 } 1257 1258 /*====================================================================*/ 1259 1260 static int parse_vers_2(tuple_t *tuple, cistpl_vers_2_t *v2) 1261 { 1262 u_char *p, *q; 1263 1264 if (tuple->TupleDataLen < 10) 1265 return CS_BAD_TUPLE; 1266 1267 p = tuple->TupleData; 1268 q = p + tuple->TupleDataLen; 1269 1270 v2->vers = p[0]; 1271 v2->comply = p[1]; 1272 v2->dindex = le16_to_cpu(*(__le16 *)(p+2)); 1273 v2->vspec8 = p[6]; 1274 v2->vspec9 = p[7]; 1275 v2->nhdr = p[8]; 1276 p += 9; 1277 return parse_strings(p, q, 2, v2->str, &v2->vendor, NULL); 1278 } 1279 1280 /*====================================================================*/ 1281 1282 static int parse_org(tuple_t *tuple, cistpl_org_t *org) 1283 { 1284 u_char *p, *q; 1285 int i; 1286 1287 p = tuple->TupleData; 1288 q = p + tuple->TupleDataLen; 1289 if (p == q) return CS_BAD_TUPLE; 1290 org->data_org = *p; 1291 if (++p == q) return CS_BAD_TUPLE; 1292 for (i = 0; i < 30; i++) { 1293 org->desc[i] = *p; 1294 if (*p == '\0') break; 1295 if (++p == q) return CS_BAD_TUPLE; 1296 } 1297 return CS_SUCCESS; 1298 } 1299 1300 /*====================================================================*/ 1301 1302 static int parse_format(tuple_t *tuple, cistpl_format_t *fmt) 1303 { 1304 u_char *p; 1305 1306 if (tuple->TupleDataLen < 10) 1307 return CS_BAD_TUPLE; 1308 1309 p = tuple->TupleData; 1310 1311 fmt->type = p[0]; 1312 fmt->edc = p[1]; 1313 fmt->offset = le32_to_cpu(*(__le32 *)(p+2)); 1314 fmt->length = le32_to_cpu(*(__le32 *)(p+6)); 1315 1316 return CS_SUCCESS; 1317 } 1318 1319 /*====================================================================*/ 1320 1321 int pccard_parse_tuple(tuple_t *tuple, cisparse_t *parse) 1322 { 1323 int ret = CS_SUCCESS; 1324 1325 if (tuple->TupleDataLen > tuple->TupleDataMax) 1326 return CS_BAD_TUPLE; 1327 switch (tuple->TupleCode) { 1328 case CISTPL_DEVICE: 1329 case CISTPL_DEVICE_A: 1330 ret = parse_device(tuple, &parse->device); 1331 break; 1332 #ifdef CONFIG_CARDBUS 1333 case CISTPL_BAR: 1334 ret = parse_bar(tuple, &parse->bar); 1335 break; 1336 case CISTPL_CONFIG_CB: 1337 ret = parse_config_cb(tuple, &parse->config); 1338 break; 1339 case CISTPL_CFTABLE_ENTRY_CB: 1340 ret = parse_cftable_entry_cb(tuple, &parse->cftable_entry_cb); 1341 break; 1342 #endif 1343 case CISTPL_CHECKSUM: 1344 ret = parse_checksum(tuple, &parse->checksum); 1345 break; 1346 case CISTPL_LONGLINK_A: 1347 case CISTPL_LONGLINK_C: 1348 ret = parse_longlink(tuple, &parse->longlink); 1349 break; 1350 case CISTPL_LONGLINK_MFC: 1351 ret = parse_longlink_mfc(tuple, &parse->longlink_mfc); 1352 break; 1353 case CISTPL_VERS_1: 1354 ret = parse_vers_1(tuple, &parse->version_1); 1355 break; 1356 case CISTPL_ALTSTR: 1357 ret = parse_altstr(tuple, &parse->altstr); 1358 break; 1359 case CISTPL_JEDEC_A: 1360 case CISTPL_JEDEC_C: 1361 ret = parse_jedec(tuple, &parse->jedec); 1362 break; 1363 case CISTPL_MANFID: 1364 ret = parse_manfid(tuple, &parse->manfid); 1365 break; 1366 case CISTPL_FUNCID: 1367 ret = parse_funcid(tuple, &parse->funcid); 1368 break; 1369 case CISTPL_FUNCE: 1370 ret = parse_funce(tuple, &parse->funce); 1371 break; 1372 case CISTPL_CONFIG: 1373 ret = parse_config(tuple, &parse->config); 1374 break; 1375 case CISTPL_CFTABLE_ENTRY: 1376 ret = parse_cftable_entry(tuple, &parse->cftable_entry); 1377 break; 1378 case CISTPL_DEVICE_GEO: 1379 case CISTPL_DEVICE_GEO_A: 1380 ret = parse_device_geo(tuple, &parse->device_geo); 1381 break; 1382 case CISTPL_VERS_2: 1383 ret = parse_vers_2(tuple, &parse->vers_2); 1384 break; 1385 case CISTPL_ORG: 1386 ret = parse_org(tuple, &parse->org); 1387 break; 1388 case CISTPL_FORMAT: 1389 case CISTPL_FORMAT_A: 1390 ret = parse_format(tuple, &parse->format); 1391 break; 1392 case CISTPL_NO_LINK: 1393 case CISTPL_LINKTARGET: 1394 ret = CS_SUCCESS; 1395 break; 1396 default: 1397 ret = CS_UNSUPPORTED_FUNCTION; 1398 break; 1399 } 1400 return ret; 1401 } 1402 EXPORT_SYMBOL(pccard_parse_tuple); 1403 1404 /*====================================================================== 1405 1406 This is used internally by Card Services to look up CIS stuff. 1407 1408 ======================================================================*/ 1409 1410 int pccard_read_tuple(struct pcmcia_socket *s, unsigned int function, cisdata_t code, void *parse) 1411 { 1412 tuple_t tuple; 1413 cisdata_t *buf; 1414 int ret; 1415 1416 buf = kmalloc(256, GFP_KERNEL); 1417 if (buf == NULL) 1418 return CS_OUT_OF_RESOURCE; 1419 tuple.DesiredTuple = code; 1420 tuple.Attributes = TUPLE_RETURN_COMMON; 1421 ret = pccard_get_first_tuple(s, function, &tuple); 1422 if (ret != CS_SUCCESS) goto done; 1423 tuple.TupleData = buf; 1424 tuple.TupleOffset = 0; 1425 tuple.TupleDataMax = 255; 1426 ret = pccard_get_tuple_data(s, &tuple); 1427 if (ret != CS_SUCCESS) goto done; 1428 ret = pccard_parse_tuple(&tuple, parse); 1429 done: 1430 kfree(buf); 1431 return ret; 1432 } 1433 EXPORT_SYMBOL(pccard_read_tuple); 1434 1435 /*====================================================================== 1436 1437 This tries to determine if a card has a sensible CIS. It returns 1438 the number of tuples in the CIS, or 0 if the CIS looks bad. The 1439 checks include making sure several critical tuples are present and 1440 valid; seeing if the total number of tuples is reasonable; and 1441 looking for tuples that use reserved codes. 1442 1443 ======================================================================*/ 1444 1445 int pccard_validate_cis(struct pcmcia_socket *s, unsigned int function, cisinfo_t *info) 1446 { 1447 tuple_t *tuple; 1448 cisparse_t *p; 1449 int ret, reserved, dev_ok = 0, ident_ok = 0; 1450 1451 if (!s) 1452 return CS_BAD_HANDLE; 1453 1454 tuple = kmalloc(sizeof(*tuple), GFP_KERNEL); 1455 if (tuple == NULL) 1456 return CS_OUT_OF_RESOURCE; 1457 p = kmalloc(sizeof(*p), GFP_KERNEL); 1458 if (p == NULL) { 1459 kfree(tuple); 1460 return CS_OUT_OF_RESOURCE; 1461 } 1462 1463 info->Chains = reserved = 0; 1464 tuple->DesiredTuple = RETURN_FIRST_TUPLE; 1465 tuple->Attributes = TUPLE_RETURN_COMMON; 1466 ret = pccard_get_first_tuple(s, function, tuple); 1467 if (ret != CS_SUCCESS) 1468 goto done; 1469 1470 /* First tuple should be DEVICE; we should really have either that 1471 or a CFTABLE_ENTRY of some sort */ 1472 if ((tuple->TupleCode == CISTPL_DEVICE) || 1473 (pccard_read_tuple(s, function, CISTPL_CFTABLE_ENTRY, p) == CS_SUCCESS) || 1474 (pccard_read_tuple(s, function, CISTPL_CFTABLE_ENTRY_CB, p) == CS_SUCCESS)) 1475 dev_ok++; 1476 1477 /* All cards should have a MANFID tuple, and/or a VERS_1 or VERS_2 1478 tuple, for card identification. Certain old D-Link and Linksys 1479 cards have only a broken VERS_2 tuple; hence the bogus test. */ 1480 if ((pccard_read_tuple(s, function, CISTPL_MANFID, p) == CS_SUCCESS) || 1481 (pccard_read_tuple(s, function, CISTPL_VERS_1, p) == CS_SUCCESS) || 1482 (pccard_read_tuple(s, function, CISTPL_VERS_2, p) != CS_NO_MORE_ITEMS)) 1483 ident_ok++; 1484 1485 if (!dev_ok && !ident_ok) 1486 goto done; 1487 1488 for (info->Chains = 1; info->Chains < MAX_TUPLES; info->Chains++) { 1489 ret = pccard_get_next_tuple(s, function, tuple); 1490 if (ret != CS_SUCCESS) break; 1491 if (((tuple->TupleCode > 0x23) && (tuple->TupleCode < 0x40)) || 1492 ((tuple->TupleCode > 0x47) && (tuple->TupleCode < 0x80)) || 1493 ((tuple->TupleCode > 0x90) && (tuple->TupleCode < 0xff))) 1494 reserved++; 1495 } 1496 if ((info->Chains == MAX_TUPLES) || (reserved > 5) || 1497 ((!dev_ok || !ident_ok) && (info->Chains > 10))) 1498 info->Chains = 0; 1499 1500 done: 1501 kfree(tuple); 1502 kfree(p); 1503 return CS_SUCCESS; 1504 } 1505 EXPORT_SYMBOL(pccard_validate_cis); 1506