2 * cistpl.c -- 16-bit PCMCIA Card Information Structure parser
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.
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.
12 * (C) 1999 David A. Hinds
15 #include <linux/module.h>
16 #include <linux/moduleparam.h>
17 #include <linux/kernel.h>
18 #include <linux/string.h>
19 #include <linux/major.h>
20 #include <linux/errno.h>
21 #include <linux/timer.h>
22 #include <linux/slab.h>
24 #include <linux/pci.h>
25 #include <linux/ioport.h>
27 #include <asm/byteorder.h>
28 #include <asm/unaligned.h>
30 #include <pcmcia/cs_types.h>
31 #include <pcmcia/ss.h>
32 #include <pcmcia/cs.h>
33 #include <pcmcia/cisreg.h>
34 #include <pcmcia/cistpl.h>
35 #include "cs_internal.h"
37 static const u_char mantissa[] = {
38 10, 12, 13, 15, 20, 25, 30, 35,
39 40, 45, 50, 55, 60, 70, 80, 90
42 static const u_int exponent[] = {
43 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000
46 /* Convert an extended speed byte to a time in nanoseconds */
47 #define SPEED_CVT(v) \
48 (mantissa[(((v)>>3)&15)-1] * exponent[(v)&7] / 10)
49 /* Convert a power byte to a current in 0.1 microamps */
50 #define POWER_CVT(v) \
51 (mantissa[((v)>>3)&15] * exponent[(v)&7] / 10)
52 #define POWER_SCALE(v) (exponent[(v)&7])
54 /* Upper limit on reasonable # of tuples */
55 #define MAX_TUPLES 200
57 /*====================================================================*/
59 /* Parameters that can be set with 'insmod' */
63 module_param(cis_width, int, 0444);
65 void release_cis_mem(struct pcmcia_socket *s)
67 if (s->cis_mem.flags & MAP_ACTIVE) {
68 s->cis_mem.flags &= ~MAP_ACTIVE;
69 s->ops->set_mem_map(s, &s->cis_mem);
71 release_resource(s->cis_mem.res);
72 kfree(s->cis_mem.res);
73 s->cis_mem.res = NULL;
79 EXPORT_SYMBOL(release_cis_mem);
82 * Map the card memory at "card_offset" into virtual space.
83 * If flags & MAP_ATTRIB, map the attribute space, otherwise
84 * map the memory space.
87 set_cis_map(struct pcmcia_socket *s, unsigned int card_offset, unsigned int flags)
89 pccard_mem_map *mem = &s->cis_mem;
92 if (!(s->features & SS_CAP_STATIC_MAP) && (mem->res == NULL)) {
93 mem->res = pcmcia_find_mem_region(0, s->map_size, s->map_size, 0, s);
94 if (mem->res == NULL) {
95 dev_printk(KERN_NOTICE, &s->dev,
96 "cs: unable to map card memory!\n");
102 if (!(s->features & SS_CAP_STATIC_MAP) && (!s->cis_virt))
103 s->cis_virt = ioremap(mem->res->start, s->map_size);
105 mem->card_start = card_offset;
108 ret = s->ops->set_mem_map(s, mem);
110 iounmap(s->cis_virt);
115 if (s->features & SS_CAP_STATIC_MAP) {
117 iounmap(s->cis_virt);
118 s->cis_virt = ioremap(mem->static_start, s->map_size);
124 /*======================================================================
126 Low-level functions to read and write CIS memory. I think the
127 write routine is only useful for writing one-byte registers.
129 ======================================================================*/
131 /* Bits in attr field */
133 #define IS_INDIRECT 8
135 int pcmcia_read_cis_mem(struct pcmcia_socket *s, int attr, u_int addr,
136 u_int len, void *ptr)
138 void __iomem *sys, *end;
139 unsigned char *buf = ptr;
141 dev_dbg(&s->dev, "pcmcia_read_cis_mem(%d, %#x, %u)\n", attr, addr, len);
143 if (attr & IS_INDIRECT) {
144 /* Indirect accesses use a bunch of special registers at fixed
145 locations in common memory */
146 u_char flags = ICTRL0_COMMON|ICTRL0_AUTOINC|ICTRL0_BYTEGRAN;
147 if (attr & IS_ATTR) {
149 flags = ICTRL0_AUTOINC;
152 sys = set_cis_map(s, 0, MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0));
154 memset(ptr, 0xff, len);
158 writeb(flags, sys+CISREG_ICTRL0);
159 writeb(addr & 0xff, sys+CISREG_IADDR0);
160 writeb((addr>>8) & 0xff, sys+CISREG_IADDR1);
161 writeb((addr>>16) & 0xff, sys+CISREG_IADDR2);
162 writeb((addr>>24) & 0xff, sys+CISREG_IADDR3);
163 for ( ; len > 0; len--, buf++)
164 *buf = readb(sys+CISREG_IDATA0);
166 u_int inc = 1, card_offset, flags;
168 flags = MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0);
175 card_offset = addr & ~(s->map_size-1);
177 sys = set_cis_map(s, card_offset, flags);
179 memset(ptr, 0xff, len);
182 end = sys + s->map_size;
183 sys = sys + (addr & (s->map_size-1));
184 for ( ; len > 0; len--, buf++, sys += inc) {
189 card_offset += s->map_size;
193 dev_dbg(&s->dev, " %#2.2x %#2.2x %#2.2x %#2.2x ...\n",
194 *(u_char *)(ptr+0), *(u_char *)(ptr+1),
195 *(u_char *)(ptr+2), *(u_char *)(ptr+3));
198 EXPORT_SYMBOL(pcmcia_read_cis_mem);
201 void pcmcia_write_cis_mem(struct pcmcia_socket *s, int attr, u_int addr,
202 u_int len, void *ptr)
204 void __iomem *sys, *end;
205 unsigned char *buf = ptr;
207 dev_dbg(&s->dev, "pcmcia_write_cis_mem(%d, %#x, %u)\n", attr, addr, len);
209 if (attr & IS_INDIRECT) {
210 /* Indirect accesses use a bunch of special registers at fixed
211 locations in common memory */
212 u_char flags = ICTRL0_COMMON|ICTRL0_AUTOINC|ICTRL0_BYTEGRAN;
213 if (attr & IS_ATTR) {
215 flags = ICTRL0_AUTOINC;
218 sys = set_cis_map(s, 0, MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0));
220 return; /* FIXME: Error */
222 writeb(flags, sys+CISREG_ICTRL0);
223 writeb(addr & 0xff, sys+CISREG_IADDR0);
224 writeb((addr>>8) & 0xff, sys+CISREG_IADDR1);
225 writeb((addr>>16) & 0xff, sys+CISREG_IADDR2);
226 writeb((addr>>24) & 0xff, sys+CISREG_IADDR3);
227 for ( ; len > 0; len--, buf++)
228 writeb(*buf, sys+CISREG_IDATA0);
230 u_int inc = 1, card_offset, flags;
232 flags = MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0);
233 if (attr & IS_ATTR) {
239 card_offset = addr & ~(s->map_size-1);
241 sys = set_cis_map(s, card_offset, flags);
243 return; /* FIXME: error */
245 end = sys + s->map_size;
246 sys = sys + (addr & (s->map_size-1));
247 for ( ; len > 0; len--, buf++, sys += inc) {
252 card_offset += s->map_size;
257 EXPORT_SYMBOL(pcmcia_write_cis_mem);
260 /*======================================================================
262 This is a wrapper around read_cis_mem, with the same interface,
263 but which caches information, for cards whose CIS may not be
264 readable all the time.
266 ======================================================================*/
268 static void read_cis_cache(struct pcmcia_socket *s, int attr, u_int addr,
269 size_t len, void *ptr)
271 struct cis_cache_entry *cis;
274 if (s->state & SOCKET_CARDBUS)
278 if (s->fake_cis_len >= addr+len)
279 memcpy(ptr, s->fake_cis+addr, len);
281 memset(ptr, 0xff, len);
285 list_for_each_entry(cis, &s->cis_cache, node) {
286 if (cis->addr == addr && cis->len == len && cis->attr == attr) {
287 memcpy(ptr, cis->cache, len);
292 ret = pcmcia_read_cis_mem(s, attr, addr, len, ptr);
295 /* Copy data into the cache */
296 cis = kmalloc(sizeof(struct cis_cache_entry) + len, GFP_KERNEL);
301 memcpy(cis->cache, ptr, len);
302 list_add(&cis->node, &s->cis_cache);
308 remove_cis_cache(struct pcmcia_socket *s, int attr, u_int addr, u_int len)
310 struct cis_cache_entry *cis;
312 list_for_each_entry(cis, &s->cis_cache, node)
313 if (cis->addr == addr && cis->len == len && cis->attr == attr) {
314 list_del(&cis->node);
321 * destroy_cis_cache() - destroy the CIS cache
322 * @s: pcmcia_socket for which CIS cache shall be destroyed
324 * This destroys the CIS cache but keeps any fake CIS alive.
327 void destroy_cis_cache(struct pcmcia_socket *s)
329 struct list_head *l, *n;
330 struct cis_cache_entry *cis;
332 list_for_each_safe(l, n, &s->cis_cache) {
333 cis = list_entry(l, struct cis_cache_entry, node);
334 list_del(&cis->node);
338 EXPORT_SYMBOL(destroy_cis_cache);
340 /*======================================================================
342 This verifies if the CIS of a card matches what is in the CIS
345 ======================================================================*/
347 int verify_cis_cache(struct pcmcia_socket *s)
349 struct cis_cache_entry *cis;
352 if (s->state & SOCKET_CARDBUS)
355 buf = kmalloc(256, GFP_KERNEL);
357 dev_printk(KERN_WARNING, &s->dev,
358 "no memory for verifying CIS\n");
361 list_for_each_entry(cis, &s->cis_cache, node) {
367 pcmcia_read_cis_mem(s, cis->attr, cis->addr, len, buf);
369 if (memcmp(buf, cis->cache, len) != 0) {
377 EXPORT_SYMBOL(verify_cis_cache);
379 /*======================================================================
381 For really bad cards, we provide a facility for uploading a
384 ======================================================================*/
386 int pcmcia_replace_cis(struct pcmcia_socket *s,
387 const u8 *data, const size_t len)
389 if (len > CISTPL_MAX_CIS_SIZE) {
390 dev_printk(KERN_WARNING, &s->dev, "replacement CIS too big\n");
394 s->fake_cis = kmalloc(len, GFP_KERNEL);
395 if (s->fake_cis == NULL) {
396 dev_printk(KERN_WARNING, &s->dev, "no memory to replace CIS\n");
399 s->fake_cis_len = len;
400 memcpy(s->fake_cis, data, len);
403 EXPORT_SYMBOL(pcmcia_replace_cis);
405 /*======================================================================
407 The high-level CIS tuple services
409 ======================================================================*/
411 typedef struct tuple_flags {
418 #define LINK_SPACE(f) (((tuple_flags *)(&(f)))->link_space)
419 #define HAS_LINK(f) (((tuple_flags *)(&(f)))->has_link)
420 #define MFC_FN(f) (((tuple_flags *)(&(f)))->mfc_fn)
421 #define SPACE(f) (((tuple_flags *)(&(f)))->space)
423 int pccard_get_first_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
428 if (!(s->state & SOCKET_PRESENT) || (s->state & SOCKET_CARDBUS))
430 tuple->TupleLink = tuple->Flags = 0;
432 /* Assume presence of a LONGLINK_C to address 0 */
433 tuple->CISOffset = tuple->LinkOffset = 0;
434 SPACE(tuple->Flags) = HAS_LINK(tuple->Flags) = 1;
436 if ((s->functions > 1) && !(tuple->Attributes & TUPLE_RETURN_COMMON)) {
437 cisdata_t req = tuple->DesiredTuple;
438 tuple->DesiredTuple = CISTPL_LONGLINK_MFC;
439 if (pccard_get_next_tuple(s, function, tuple) == 0) {
440 tuple->DesiredTuple = CISTPL_LINKTARGET;
441 if (pccard_get_next_tuple(s, function, tuple) != 0)
444 tuple->CISOffset = tuple->TupleLink = 0;
445 tuple->DesiredTuple = req;
447 return pccard_get_next_tuple(s, function, tuple);
449 EXPORT_SYMBOL(pccard_get_first_tuple);
451 static int follow_link(struct pcmcia_socket *s, tuple_t *tuple)
456 if (MFC_FN(tuple->Flags)) {
457 /* Get indirect link from the MFC tuple */
458 read_cis_cache(s, LINK_SPACE(tuple->Flags),
459 tuple->LinkOffset, 5, link);
460 ofs = get_unaligned_le32(link + 1);
461 SPACE(tuple->Flags) = (link[0] == CISTPL_MFC_ATTR);
462 /* Move to the next indirect link */
463 tuple->LinkOffset += 5;
464 MFC_FN(tuple->Flags)--;
465 } else if (HAS_LINK(tuple->Flags)) {
466 ofs = tuple->LinkOffset;
467 SPACE(tuple->Flags) = LINK_SPACE(tuple->Flags);
468 HAS_LINK(tuple->Flags) = 0;
472 if (SPACE(tuple->Flags)) {
473 /* This is ugly, but a common CIS error is to code the long
474 link offset incorrectly, so we check the right spot... */
475 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
476 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
477 (strncmp(link+2, "CIS", 3) == 0))
479 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
480 /* Then, we try the wrong spot... */
483 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
484 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
485 (strncmp(link+2, "CIS", 3) == 0))
487 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
491 int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
498 if (!(s->state & SOCKET_PRESENT) || (s->state & SOCKET_CARDBUS))
501 link[1] = tuple->TupleLink;
502 ofs = tuple->CISOffset + tuple->TupleLink;
503 attr = SPACE(tuple->Flags);
505 for (i = 0; i < MAX_TUPLES; i++) {
506 if (link[1] == 0xff) {
507 link[0] = CISTPL_END;
509 read_cis_cache(s, attr, ofs, 2, link);
510 if (link[0] == CISTPL_NULL) {
515 /* End of chain? Follow long link if possible */
516 if (link[0] == CISTPL_END) {
517 ofs = follow_link(s, tuple);
520 attr = SPACE(tuple->Flags);
521 read_cis_cache(s, attr, ofs, 2, link);
524 /* Is this a link tuple? Make a note of it */
525 if ((link[0] == CISTPL_LONGLINK_A) ||
526 (link[0] == CISTPL_LONGLINK_C) ||
527 (link[0] == CISTPL_LONGLINK_MFC) ||
528 (link[0] == CISTPL_LINKTARGET) ||
529 (link[0] == CISTPL_INDIRECT) ||
530 (link[0] == CISTPL_NO_LINK)) {
532 case CISTPL_LONGLINK_A:
533 HAS_LINK(tuple->Flags) = 1;
534 LINK_SPACE(tuple->Flags) = attr | IS_ATTR;
535 read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset);
537 case CISTPL_LONGLINK_C:
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);
542 case CISTPL_INDIRECT:
543 HAS_LINK(tuple->Flags) = 1;
544 LINK_SPACE(tuple->Flags) = IS_ATTR | IS_INDIRECT;
545 tuple->LinkOffset = 0;
547 case CISTPL_LONGLINK_MFC:
548 tuple->LinkOffset = ofs + 3;
549 LINK_SPACE(tuple->Flags) = attr;
550 if (function == BIND_FN_ALL) {
551 /* Follow all the MFC links */
552 read_cis_cache(s, attr, ofs+2, 1, &tmp);
553 MFC_FN(tuple->Flags) = tmp;
555 /* Follow exactly one of the links */
556 MFC_FN(tuple->Flags) = 1;
557 tuple->LinkOffset += function * 5;
561 HAS_LINK(tuple->Flags) = 0;
564 if ((tuple->Attributes & TUPLE_RETURN_LINK) &&
565 (tuple->DesiredTuple == RETURN_FIRST_TUPLE))
568 if (tuple->DesiredTuple == RETURN_FIRST_TUPLE)
571 if (link[0] == tuple->DesiredTuple)
575 if (i == MAX_TUPLES) {
576 dev_dbg(&s->dev, "cs: overrun in pcmcia_get_next_tuple\n");
580 tuple->TupleCode = link[0];
581 tuple->TupleLink = link[1];
582 tuple->CISOffset = ofs + 2;
585 EXPORT_SYMBOL(pccard_get_next_tuple);
587 /*====================================================================*/
589 #define _MIN(a, b) (((a) < (b)) ? (a) : (b))
591 int pccard_get_tuple_data(struct pcmcia_socket *s, tuple_t *tuple)
598 if (tuple->TupleLink < tuple->TupleOffset)
600 len = tuple->TupleLink - tuple->TupleOffset;
601 tuple->TupleDataLen = tuple->TupleLink;
604 read_cis_cache(s, SPACE(tuple->Flags),
605 tuple->CISOffset + tuple->TupleOffset,
606 _MIN(len, tuple->TupleDataMax), tuple->TupleData);
609 EXPORT_SYMBOL(pccard_get_tuple_data);
612 /*======================================================================
614 Parsing routines for individual tuples
616 ======================================================================*/
618 static int parse_device(tuple_t *tuple, cistpl_device_t *device)
624 p = (u_char *)tuple->TupleData;
625 q = p + tuple->TupleDataLen;
628 for (i = 0; i < CISTPL_MAX_DEVICES; i++) {
632 device->dev[i].type = (*p >> 4);
633 device->dev[i].wp = (*p & 0x08) ? 1 : 0;
636 device->dev[i].speed = 0;
639 device->dev[i].speed = 250;
642 device->dev[i].speed = 200;
645 device->dev[i].speed = 150;
648 device->dev[i].speed = 100;
653 device->dev[i].speed = SPEED_CVT(*p);
669 device->dev[i].size = ((*p >> 3) + 1) * (512 << (scale*2));
678 /*====================================================================*/
680 static int parse_checksum(tuple_t *tuple, cistpl_checksum_t *csum)
683 if (tuple->TupleDataLen < 5)
685 p = (u_char *) tuple->TupleData;
686 csum->addr = tuple->CISOffset + get_unaligned_le16(p) - 2;
687 csum->len = get_unaligned_le16(p + 2);
688 csum->sum = *(p + 4);
692 /*====================================================================*/
694 static int parse_longlink(tuple_t *tuple, cistpl_longlink_t *link)
696 if (tuple->TupleDataLen < 4)
698 link->addr = get_unaligned_le32(tuple->TupleData);
702 /*====================================================================*/
704 static int parse_longlink_mfc(tuple_t *tuple,
705 cistpl_longlink_mfc_t *link)
710 p = (u_char *)tuple->TupleData;
713 if (tuple->TupleDataLen <= link->nfn*5)
715 for (i = 0; i < link->nfn; i++) {
716 link->fn[i].space = *p; p++;
717 link->fn[i].addr = get_unaligned_le32(p);
723 /*====================================================================*/
725 static int parse_strings(u_char *p, u_char *q, int max,
726 char *s, u_char *ofs, u_char *found)
733 for (i = 0; i < max; i++) {
739 s[j++] = (*p == 0xff) ? '\0' : *p;
740 if ((*p == '\0') || (*p == 0xff))
745 if ((*p == 0xff) || (++p == q))
752 return (ns == max) ? 0 : -EINVAL;
756 /*====================================================================*/
758 static int parse_vers_1(tuple_t *tuple, cistpl_vers_1_t *vers_1)
762 p = (u_char *)tuple->TupleData;
763 q = p + tuple->TupleDataLen;
765 vers_1->major = *p; p++;
766 vers_1->minor = *p; p++;
770 return parse_strings(p, q, CISTPL_VERS_1_MAX_PROD_STRINGS,
771 vers_1->str, vers_1->ofs, &vers_1->ns);
774 /*====================================================================*/
776 static int parse_altstr(tuple_t *tuple, cistpl_altstr_t *altstr)
780 p = (u_char *)tuple->TupleData;
781 q = p + tuple->TupleDataLen;
783 return parse_strings(p, q, CISTPL_MAX_ALTSTR_STRINGS,
784 altstr->str, altstr->ofs, &altstr->ns);
787 /*====================================================================*/
789 static int parse_jedec(tuple_t *tuple, cistpl_jedec_t *jedec)
794 p = (u_char *)tuple->TupleData;
795 q = p + tuple->TupleDataLen;
797 for (nid = 0; nid < CISTPL_MAX_DEVICES; nid++) {
800 jedec->id[nid].mfr = p[0];
801 jedec->id[nid].info = p[1];
808 /*====================================================================*/
810 static int parse_manfid(tuple_t *tuple, cistpl_manfid_t *m)
812 if (tuple->TupleDataLen < 4)
814 m->manf = get_unaligned_le16(tuple->TupleData);
815 m->card = get_unaligned_le16(tuple->TupleData + 2);
819 /*====================================================================*/
821 static int parse_funcid(tuple_t *tuple, cistpl_funcid_t *f)
824 if (tuple->TupleDataLen < 2)
826 p = (u_char *)tuple->TupleData;
832 /*====================================================================*/
834 static int parse_funce(tuple_t *tuple, cistpl_funce_t *f)
838 if (tuple->TupleDataLen < 1)
840 p = (u_char *)tuple->TupleData;
842 for (i = 1; i < tuple->TupleDataLen; i++)
847 /*====================================================================*/
849 static int parse_config(tuple_t *tuple, cistpl_config_t *config)
854 p = (u_char *)tuple->TupleData;
856 rmsz = (*p & 0x3c) >> 2;
857 if (tuple->TupleDataLen < rasz+rmsz+4)
859 config->last_idx = *(++p);
862 for (i = 0; i <= rasz; i++)
863 config->base += p[i] << (8*i);
865 for (i = 0; i < 4; i++)
866 config->rmask[i] = 0;
867 for (i = 0; i <= rmsz; i++)
868 config->rmask[i>>2] += p[i] << (8*(i%4));
869 config->subtuples = tuple->TupleDataLen - (rasz+rmsz+4);
873 /*======================================================================
875 The following routines are all used to parse the nightmarish
876 config table entries.
878 ======================================================================*/
880 static u_char *parse_power(u_char *p, u_char *q,
891 for (i = 0; i < 7; i++)
892 if (pwr->present & (1<<i)) {
895 pwr->param[i] = POWER_CVT(*p);
896 scale = POWER_SCALE(*p);
900 if ((*p & 0x7f) < 100)
901 pwr->param[i] += (*p & 0x7f) * scale / 100;
903 pwr->flags |= CISTPL_POWER_HIGHZ_OK;
907 pwr->flags |= CISTPL_POWER_HIGHZ_REQ;
916 /*====================================================================*/
918 static u_char *parse_timing(u_char *p, u_char *q,
919 cistpl_timing_t *timing)
926 if ((scale & 3) != 3) {
929 timing->wait = SPEED_CVT(*p);
930 timing->waitscale = exponent[scale & 3];
934 if ((scale & 7) != 7) {
937 timing->ready = SPEED_CVT(*p);
938 timing->rdyscale = exponent[scale & 7];
945 timing->reserved = SPEED_CVT(*p);
946 timing->rsvscale = exponent[scale];
948 timing->reserved = 0;
953 /*====================================================================*/
955 static u_char *parse_io(u_char *p, u_char *q, cistpl_io_t *io)
966 io->win[0].len = (1 << (io->flags & CISTPL_IO_LINES_MASK));
972 io->nwin = (*p & 0x0f) + 1;
973 bsz = (*p & 0x30) >> 4;
976 lsz = (*p & 0xc0) >> 6;
981 for (i = 0; i < io->nwin; i++) {
984 for (j = 0; j < bsz; j++, p++) {
987 io->win[i].base += *p << (j*8);
989 for (j = 0; j < lsz; j++, p++) {
992 io->win[i].len += *p << (j*8);
998 /*====================================================================*/
1000 static u_char *parse_mem(u_char *p, u_char *q, cistpl_mem_t *mem)
1002 int i, j, asz, lsz, has_ha;
1008 mem->nwin = (*p & 0x07) + 1;
1009 lsz = (*p & 0x18) >> 3;
1010 asz = (*p & 0x60) >> 5;
1011 has_ha = (*p & 0x80);
1015 for (i = 0; i < mem->nwin; i++) {
1017 for (j = 0; j < lsz; j++, p++) {
1022 for (j = 0; j < asz; j++, p++) {
1028 for (j = 0; j < asz; j++, p++) {
1033 mem->win[i].len = len << 8;
1034 mem->win[i].card_addr = ca << 8;
1035 mem->win[i].host_addr = ha << 8;
1040 /*====================================================================*/
1042 static u_char *parse_irq(u_char *p, u_char *q, cistpl_irq_t *irq)
1046 irq->IRQInfo1 = *p; p++;
1047 if (irq->IRQInfo1 & IRQ_INFO2_VALID) {
1050 irq->IRQInfo2 = (p[1]<<8) + p[0];
1056 /*====================================================================*/
1058 static int parse_cftable_entry(tuple_t *tuple,
1059 cistpl_cftable_entry_t *entry)
1061 u_char *p, *q, features;
1063 p = tuple->TupleData;
1064 q = p + tuple->TupleDataLen;
1065 entry->index = *p & 0x3f;
1068 entry->flags |= CISTPL_CFTABLE_DEFAULT;
1073 entry->flags |= CISTPL_CFTABLE_BVDS;
1075 entry->flags |= CISTPL_CFTABLE_WP;
1077 entry->flags |= CISTPL_CFTABLE_RDYBSY;
1079 entry->flags |= CISTPL_CFTABLE_MWAIT;
1080 entry->interface = *p & 0x0f;
1082 entry->interface = 0;
1084 /* Process optional features */
1090 if ((features & 3) > 0) {
1091 p = parse_power(p, q, &entry->vcc);
1095 entry->vcc.present = 0;
1096 if ((features & 3) > 1) {
1097 p = parse_power(p, q, &entry->vpp1);
1101 entry->vpp1.present = 0;
1102 if ((features & 3) > 2) {
1103 p = parse_power(p, q, &entry->vpp2);
1107 entry->vpp2.present = 0;
1109 /* Timing options */
1110 if (features & 0x04) {
1111 p = parse_timing(p, q, &entry->timing);
1115 entry->timing.wait = 0;
1116 entry->timing.ready = 0;
1117 entry->timing.reserved = 0;
1120 /* I/O window options */
1121 if (features & 0x08) {
1122 p = parse_io(p, q, &entry->io);
1128 /* Interrupt options */
1129 if (features & 0x10) {
1130 p = parse_irq(p, q, &entry->irq);
1134 entry->irq.IRQInfo1 = 0;
1136 switch (features & 0x60) {
1138 entry->mem.nwin = 0;
1141 entry->mem.nwin = 1;
1142 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
1143 entry->mem.win[0].card_addr = 0;
1144 entry->mem.win[0].host_addr = 0;
1150 entry->mem.nwin = 1;
1151 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
1152 entry->mem.win[0].card_addr = get_unaligned_le16(p + 2) << 8;
1153 entry->mem.win[0].host_addr = 0;
1159 p = parse_mem(p, q, &entry->mem);
1166 if (features & 0x80) {
1169 entry->flags |= (*p << 8);
1176 entry->subtuples = q-p;
1181 /*====================================================================*/
1183 static int parse_device_geo(tuple_t *tuple, cistpl_device_geo_t *geo)
1188 p = (u_char *)tuple->TupleData;
1189 q = p + tuple->TupleDataLen;
1191 for (n = 0; n < CISTPL_MAX_DEVICES; n++) {
1194 geo->geo[n].buswidth = p[0];
1195 geo->geo[n].erase_block = 1 << (p[1]-1);
1196 geo->geo[n].read_block = 1 << (p[2]-1);
1197 geo->geo[n].write_block = 1 << (p[3]-1);
1198 geo->geo[n].partition = 1 << (p[4]-1);
1199 geo->geo[n].interleave = 1 << (p[5]-1);
1206 /*====================================================================*/
1208 static int parse_vers_2(tuple_t *tuple, cistpl_vers_2_t *v2)
1212 if (tuple->TupleDataLen < 10)
1215 p = tuple->TupleData;
1216 q = p + tuple->TupleDataLen;
1220 v2->dindex = get_unaligned_le16(p + 2);
1225 return parse_strings(p, q, 2, v2->str, &v2->vendor, NULL);
1228 /*====================================================================*/
1230 static int parse_org(tuple_t *tuple, cistpl_org_t *org)
1235 p = tuple->TupleData;
1236 q = p + tuple->TupleDataLen;
1242 for (i = 0; i < 30; i++) {
1252 /*====================================================================*/
1254 static int parse_format(tuple_t *tuple, cistpl_format_t *fmt)
1258 if (tuple->TupleDataLen < 10)
1261 p = tuple->TupleData;
1265 fmt->offset = get_unaligned_le32(p + 2);
1266 fmt->length = get_unaligned_le32(p + 6);
1271 /*====================================================================*/
1273 int pcmcia_parse_tuple(tuple_t *tuple, cisparse_t *parse)
1277 if (tuple->TupleDataLen > tuple->TupleDataMax)
1279 switch (tuple->TupleCode) {
1281 case CISTPL_DEVICE_A:
1282 ret = parse_device(tuple, &parse->device);
1284 case CISTPL_CHECKSUM:
1285 ret = parse_checksum(tuple, &parse->checksum);
1287 case CISTPL_LONGLINK_A:
1288 case CISTPL_LONGLINK_C:
1289 ret = parse_longlink(tuple, &parse->longlink);
1291 case CISTPL_LONGLINK_MFC:
1292 ret = parse_longlink_mfc(tuple, &parse->longlink_mfc);
1295 ret = parse_vers_1(tuple, &parse->version_1);
1298 ret = parse_altstr(tuple, &parse->altstr);
1300 case CISTPL_JEDEC_A:
1301 case CISTPL_JEDEC_C:
1302 ret = parse_jedec(tuple, &parse->jedec);
1305 ret = parse_manfid(tuple, &parse->manfid);
1308 ret = parse_funcid(tuple, &parse->funcid);
1311 ret = parse_funce(tuple, &parse->funce);
1314 ret = parse_config(tuple, &parse->config);
1316 case CISTPL_CFTABLE_ENTRY:
1317 ret = parse_cftable_entry(tuple, &parse->cftable_entry);
1319 case CISTPL_DEVICE_GEO:
1320 case CISTPL_DEVICE_GEO_A:
1321 ret = parse_device_geo(tuple, &parse->device_geo);
1324 ret = parse_vers_2(tuple, &parse->vers_2);
1327 ret = parse_org(tuple, &parse->org);
1330 case CISTPL_FORMAT_A:
1331 ret = parse_format(tuple, &parse->format);
1333 case CISTPL_NO_LINK:
1334 case CISTPL_LINKTARGET:
1342 pr_debug("parse_tuple failed %d\n", ret);
1345 EXPORT_SYMBOL(pcmcia_parse_tuple);
1347 /*======================================================================
1349 This is used internally by Card Services to look up CIS stuff.
1351 ======================================================================*/
1353 int pccard_read_tuple(struct pcmcia_socket *s, unsigned int function, cisdata_t code, void *parse)
1359 buf = kmalloc(256, GFP_KERNEL);
1361 dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
1364 tuple.DesiredTuple = code;
1365 tuple.Attributes = 0;
1366 if (function == BIND_FN_ALL)
1367 tuple.Attributes = TUPLE_RETURN_COMMON;
1368 ret = pccard_get_first_tuple(s, function, &tuple);
1371 tuple.TupleData = buf;
1372 tuple.TupleOffset = 0;
1373 tuple.TupleDataMax = 255;
1374 ret = pccard_get_tuple_data(s, &tuple);
1377 ret = pcmcia_parse_tuple(&tuple, parse);
1382 EXPORT_SYMBOL(pccard_read_tuple);
1386 * pccard_loop_tuple() - loop over tuples in the CIS
1387 * @s: the struct pcmcia_socket where the card is inserted
1388 * @function: the device function we loop for
1389 * @code: which CIS code shall we look for?
1390 * @parse: buffer where the tuple shall be parsed (or NULL, if no parse)
1391 * @priv_data: private data to be passed to the loop_tuple function.
1392 * @loop_tuple: function to call for each CIS entry of type @function. IT
1393 * gets passed the raw tuple, the paresed tuple (if @parse is
1394 * set) and @priv_data.
1396 * pccard_loop_tuple() loops over all CIS entries of type @function, and
1397 * calls the @loop_tuple function for each entry. If the call to @loop_tuple
1398 * returns 0, the loop exits. Returns 0 on success or errorcode otherwise.
1400 int pccard_loop_tuple(struct pcmcia_socket *s, unsigned int function,
1401 cisdata_t code, cisparse_t *parse, void *priv_data,
1402 int (*loop_tuple) (tuple_t *tuple,
1410 buf = kzalloc(256, GFP_KERNEL);
1412 dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
1416 tuple.TupleData = buf;
1417 tuple.TupleDataMax = 255;
1418 tuple.TupleOffset = 0;
1419 tuple.DesiredTuple = code;
1420 tuple.Attributes = 0;
1422 ret = pccard_get_first_tuple(s, function, &tuple);
1424 if (pccard_get_tuple_data(s, &tuple))
1428 if (pcmcia_parse_tuple(&tuple, parse))
1431 ret = loop_tuple(&tuple, parse, priv_data);
1436 ret = pccard_get_next_tuple(s, function, &tuple);
1442 EXPORT_SYMBOL(pccard_loop_tuple);
1446 * pccard_validate_cis() - check whether card has a sensible CIS
1447 * @s: the struct pcmcia_socket we are to check
1448 * @info: returns the number of tuples in the (valid) CIS, or 0
1450 * This tries to determine if a card has a sensible CIS. In @info, it
1451 * returns the number of tuples in the CIS, or 0 if the CIS looks bad. The
1452 * checks include making sure several critical tuples are present and
1453 * valid; seeing if the total number of tuples is reasonable; and
1454 * looking for tuples that use reserved codes.
1456 * The function returns 0 on success.
1458 int pccard_validate_cis(struct pcmcia_socket *s, unsigned int *info)
1462 unsigned int count = 0;
1463 int ret, reserved, dev_ok = 0, ident_ok = 0;
1468 /* We do not want to validate the CIS cache... */
1469 destroy_cis_cache(s);
1471 tuple = kmalloc(sizeof(*tuple), GFP_KERNEL);
1472 if (tuple == NULL) {
1473 dev_warn(&s->dev, "no memory to validate CIS\n");
1476 p = kmalloc(sizeof(*p), GFP_KERNEL);
1479 dev_warn(&s->dev, "no memory to validate CIS\n");
1483 count = reserved = 0;
1484 tuple->DesiredTuple = RETURN_FIRST_TUPLE;
1485 tuple->Attributes = TUPLE_RETURN_COMMON;
1486 ret = pccard_get_first_tuple(s, BIND_FN_ALL, tuple);
1490 /* First tuple should be DEVICE; we should really have either that
1491 or a CFTABLE_ENTRY of some sort */
1492 if ((tuple->TupleCode == CISTPL_DEVICE) ||
1493 (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY, p)) ||
1494 (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY_CB, p)))
1497 /* All cards should have a MANFID tuple, and/or a VERS_1 or VERS_2
1498 tuple, for card identification. Certain old D-Link and Linksys
1499 cards have only a broken VERS_2 tuple; hence the bogus test. */
1500 if ((pccard_read_tuple(s, BIND_FN_ALL, CISTPL_MANFID, p) == 0) ||
1501 (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_1, p) == 0) ||
1502 (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_2, p) != -ENOSPC))
1505 if (!dev_ok && !ident_ok)
1508 for (count = 1; count < MAX_TUPLES; count++) {
1509 ret = pccard_get_next_tuple(s, BIND_FN_ALL, tuple);
1512 if (((tuple->TupleCode > 0x23) && (tuple->TupleCode < 0x40)) ||
1513 ((tuple->TupleCode > 0x47) && (tuple->TupleCode < 0x80)) ||
1514 ((tuple->TupleCode > 0x90) && (tuple->TupleCode < 0xff)))
1517 if ((count == MAX_TUPLES) || (reserved > 5) ||
1518 ((!dev_ok || !ident_ok) && (count > 10)))
1524 /* invalidate CIS cache on failure */
1525 if (!dev_ok || !ident_ok || !count) {
1526 destroy_cis_cache(s);
1536 EXPORT_SYMBOL(pccard_validate_cis);