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 cs_dbg(s
, 3, "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 cs_dbg(s
, 3, " %#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 cs_dbg(s
, 3, "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
;
275 if (s
->fake_cis_len
>= addr
+len
)
276 memcpy(ptr
, s
->fake_cis
+addr
, len
);
278 memset(ptr
, 0xff, len
);
282 list_for_each_entry(cis
, &s
->cis_cache
, node
) {
283 if (cis
->addr
== addr
&& cis
->len
== len
&& cis
->attr
== attr
) {
284 memcpy(ptr
, cis
->cache
, len
);
289 #ifdef CONFIG_CARDBUS
290 if (s
->state
& SOCKET_CARDBUS
)
291 ret
= read_cb_mem(s
, attr
, addr
, len
, ptr
);
294 ret
= pcmcia_read_cis_mem(s
, attr
, addr
, len
, ptr
);
297 /* Copy data into the cache */
298 cis
= kmalloc(sizeof(struct cis_cache_entry
) + len
, GFP_KERNEL
);
303 memcpy(cis
->cache
, ptr
, len
);
304 list_add(&cis
->node
, &s
->cis_cache
);
310 remove_cis_cache(struct pcmcia_socket
*s
, int attr
, u_int addr
, u_int len
)
312 struct cis_cache_entry
*cis
;
314 list_for_each_entry(cis
, &s
->cis_cache
, node
)
315 if (cis
->addr
== addr
&& cis
->len
== len
&& cis
->attr
== attr
) {
316 list_del(&cis
->node
);
322 void destroy_cis_cache(struct pcmcia_socket
*s
)
324 struct list_head
*l
, *n
;
326 list_for_each_safe(l
, n
, &s
->cis_cache
) {
327 struct cis_cache_entry
*cis
= list_entry(l
, struct cis_cache_entry
, node
);
329 list_del(&cis
->node
);
334 * If there was a fake CIS, destroy that as well.
339 EXPORT_SYMBOL(destroy_cis_cache
);
341 /*======================================================================
343 This verifies if the CIS of a card matches what is in the CIS
346 ======================================================================*/
348 int verify_cis_cache(struct pcmcia_socket
*s
)
350 struct cis_cache_entry
*cis
;
353 buf
= kmalloc(256, GFP_KERNEL
);
355 dev_printk(KERN_WARNING
, &s
->dev
,
356 "no memory for verifying CIS\n");
358 list_for_each_entry(cis
, &s
->cis_cache
, node
) {
363 #ifdef CONFIG_CARDBUS
364 if (s
->state
& SOCKET_CARDBUS
)
365 read_cb_mem(s
, cis
->attr
, cis
->addr
, len
, buf
);
368 pcmcia_read_cis_mem(s
, cis
->attr
, cis
->addr
, len
, buf
);
370 if (memcmp(buf
, cis
->cache
, len
) != 0) {
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_next_tuple(struct pcmcia_socket
*s
, unsigned int func
, tuple_t
*tuple
);
425 int pccard_get_first_tuple(struct pcmcia_socket
*s
, unsigned int function
, tuple_t
*tuple
)
429 if (!(s
->state
& SOCKET_PRESENT
))
431 tuple
->TupleLink
= tuple
->Flags
= 0;
432 #ifdef CONFIG_CARDBUS
433 if (s
->state
& SOCKET_CARDBUS
) {
434 struct pci_dev
*dev
= s
->cb_dev
;
436 pci_bus_read_config_dword(dev
->subordinate
, 0, PCI_CARDBUS_CIS
, &ptr
);
437 tuple
->CISOffset
= ptr
& ~7;
438 SPACE(tuple
->Flags
) = (ptr
& 7);
442 /* Assume presence of a LONGLINK_C to address 0 */
443 tuple
->CISOffset
= tuple
->LinkOffset
= 0;
444 SPACE(tuple
->Flags
) = HAS_LINK(tuple
->Flags
) = 1;
446 if (!(s
->state
& SOCKET_CARDBUS
) && (s
->functions
> 1) &&
447 !(tuple
->Attributes
& TUPLE_RETURN_COMMON
)) {
448 cisdata_t req
= tuple
->DesiredTuple
;
449 tuple
->DesiredTuple
= CISTPL_LONGLINK_MFC
;
450 if (pccard_get_next_tuple(s
, function
, tuple
) == 0) {
451 tuple
->DesiredTuple
= CISTPL_LINKTARGET
;
452 if (pccard_get_next_tuple(s
, function
, tuple
) != 0)
455 tuple
->CISOffset
= tuple
->TupleLink
= 0;
456 tuple
->DesiredTuple
= req
;
458 return pccard_get_next_tuple(s
, function
, tuple
);
460 EXPORT_SYMBOL(pccard_get_first_tuple
);
462 static int follow_link(struct pcmcia_socket
*s
, tuple_t
*tuple
)
467 if (MFC_FN(tuple
->Flags
)) {
468 /* Get indirect link from the MFC tuple */
469 read_cis_cache(s
, LINK_SPACE(tuple
->Flags
),
470 tuple
->LinkOffset
, 5, link
);
471 ofs
= get_unaligned_le32(link
+ 1);
472 SPACE(tuple
->Flags
) = (link
[0] == CISTPL_MFC_ATTR
);
473 /* Move to the next indirect link */
474 tuple
->LinkOffset
+= 5;
475 MFC_FN(tuple
->Flags
)--;
476 } else if (HAS_LINK(tuple
->Flags
)) {
477 ofs
= tuple
->LinkOffset
;
478 SPACE(tuple
->Flags
) = LINK_SPACE(tuple
->Flags
);
479 HAS_LINK(tuple
->Flags
) = 0;
483 if (!(s
->state
& SOCKET_CARDBUS
) && SPACE(tuple
->Flags
)) {
484 /* This is ugly, but a common CIS error is to code the long
485 link offset incorrectly, so we check the right spot... */
486 read_cis_cache(s
, SPACE(tuple
->Flags
), ofs
, 5, link
);
487 if ((link
[0] == CISTPL_LINKTARGET
) && (link
[1] >= 3) &&
488 (strncmp(link
+2, "CIS", 3) == 0))
490 remove_cis_cache(s
, SPACE(tuple
->Flags
), ofs
, 5);
491 /* Then, we try the wrong spot... */
494 read_cis_cache(s
, SPACE(tuple
->Flags
), ofs
, 5, link
);
495 if ((link
[0] == CISTPL_LINKTARGET
) && (link
[1] >= 3) &&
496 (strncmp(link
+2, "CIS", 3) == 0))
498 remove_cis_cache(s
, SPACE(tuple
->Flags
), ofs
, 5);
502 int pccard_get_next_tuple(struct pcmcia_socket
*s
, unsigned int function
, tuple_t
*tuple
)
509 if (!(s
->state
& SOCKET_PRESENT
))
512 link
[1] = tuple
->TupleLink
;
513 ofs
= tuple
->CISOffset
+ tuple
->TupleLink
;
514 attr
= SPACE(tuple
->Flags
);
516 for (i
= 0; i
< MAX_TUPLES
; i
++) {
517 if (link
[1] == 0xff) {
518 link
[0] = CISTPL_END
;
520 read_cis_cache(s
, attr
, ofs
, 2, link
);
521 if (link
[0] == CISTPL_NULL
) {
526 /* End of chain? Follow long link if possible */
527 if (link
[0] == CISTPL_END
) {
528 if ((ofs
= follow_link(s
, tuple
)) < 0)
530 attr
= SPACE(tuple
->Flags
);
531 read_cis_cache(s
, attr
, ofs
, 2, link
);
534 /* Is this a link tuple? Make a note of it */
535 if ((link
[0] == CISTPL_LONGLINK_A
) ||
536 (link
[0] == CISTPL_LONGLINK_C
) ||
537 (link
[0] == CISTPL_LONGLINK_MFC
) ||
538 (link
[0] == CISTPL_LINKTARGET
) ||
539 (link
[0] == CISTPL_INDIRECT
) ||
540 (link
[0] == CISTPL_NO_LINK
)) {
542 case CISTPL_LONGLINK_A
:
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
);
547 case CISTPL_LONGLINK_C
:
548 HAS_LINK(tuple
->Flags
) = 1;
549 LINK_SPACE(tuple
->Flags
) = attr
& ~IS_ATTR
;
550 read_cis_cache(s
, attr
, ofs
+2, 4, &tuple
->LinkOffset
);
552 case CISTPL_INDIRECT
:
553 HAS_LINK(tuple
->Flags
) = 1;
554 LINK_SPACE(tuple
->Flags
) = IS_ATTR
| IS_INDIRECT
;
555 tuple
->LinkOffset
= 0;
557 case CISTPL_LONGLINK_MFC
:
558 tuple
->LinkOffset
= ofs
+ 3;
559 LINK_SPACE(tuple
->Flags
) = attr
;
560 if (function
== BIND_FN_ALL
) {
561 /* Follow all the MFC links */
562 read_cis_cache(s
, attr
, ofs
+2, 1, &tmp
);
563 MFC_FN(tuple
->Flags
) = tmp
;
565 /* Follow exactly one of the links */
566 MFC_FN(tuple
->Flags
) = 1;
567 tuple
->LinkOffset
+= function
* 5;
571 HAS_LINK(tuple
->Flags
) = 0;
574 if ((tuple
->Attributes
& TUPLE_RETURN_LINK
) &&
575 (tuple
->DesiredTuple
== RETURN_FIRST_TUPLE
))
578 if (tuple
->DesiredTuple
== RETURN_FIRST_TUPLE
)
581 if (link
[0] == tuple
->DesiredTuple
)
585 if (i
== MAX_TUPLES
) {
586 cs_dbg(s
, 1, "cs: overrun in pcmcia_get_next_tuple\n");
590 tuple
->TupleCode
= link
[0];
591 tuple
->TupleLink
= link
[1];
592 tuple
->CISOffset
= ofs
+ 2;
595 EXPORT_SYMBOL(pccard_get_next_tuple
);
597 /*====================================================================*/
599 #define _MIN(a, b) (((a) < (b)) ? (a) : (b))
601 int pccard_get_tuple_data(struct pcmcia_socket
*s
, tuple_t
*tuple
)
608 if (tuple
->TupleLink
< tuple
->TupleOffset
)
610 len
= tuple
->TupleLink
- tuple
->TupleOffset
;
611 tuple
->TupleDataLen
= tuple
->TupleLink
;
614 read_cis_cache(s
, SPACE(tuple
->Flags
),
615 tuple
->CISOffset
+ tuple
->TupleOffset
,
616 _MIN(len
, tuple
->TupleDataMax
), tuple
->TupleData
);
619 EXPORT_SYMBOL(pccard_get_tuple_data
);
622 /*======================================================================
624 Parsing routines for individual tuples
626 ======================================================================*/
628 static int parse_device(tuple_t
*tuple
, cistpl_device_t
*device
)
634 p
= (u_char
*)tuple
->TupleData
;
635 q
= p
+ tuple
->TupleDataLen
;
638 for (i
= 0; i
< CISTPL_MAX_DEVICES
; i
++) {
640 if (*p
== 0xff) break;
641 device
->dev
[i
].type
= (*p
>> 4);
642 device
->dev
[i
].wp
= (*p
& 0x08) ? 1 : 0;
644 case 0: device
->dev
[i
].speed
= 0; break;
645 case 1: device
->dev
[i
].speed
= 250; break;
646 case 2: device
->dev
[i
].speed
= 200; break;
647 case 3: device
->dev
[i
].speed
= 150; break;
648 case 4: device
->dev
[i
].speed
= 100; break;
650 if (++p
== q
) return CS_BAD_TUPLE
;
651 device
->dev
[i
].speed
= SPEED_CVT(*p
);
653 if (++p
== q
) return CS_BAD_TUPLE
;
659 if (++p
== q
) return CS_BAD_TUPLE
;
660 if (*p
== 0xff) break;
662 if (scale
== 7) return CS_BAD_TUPLE
;
663 device
->dev
[i
].size
= ((*p
>> 3) + 1) * (512 << (scale
*2));
671 /*====================================================================*/
673 static int parse_checksum(tuple_t
*tuple
, cistpl_checksum_t
*csum
)
676 if (tuple
->TupleDataLen
< 5)
678 p
= (u_char
*) tuple
->TupleData
;
679 csum
->addr
= tuple
->CISOffset
+ get_unaligned_le16(p
) - 2;
680 csum
->len
= get_unaligned_le16(p
+ 2);
681 csum
->sum
= *(p
+ 4);
685 /*====================================================================*/
687 static int parse_longlink(tuple_t
*tuple
, cistpl_longlink_t
*link
)
689 if (tuple
->TupleDataLen
< 4)
691 link
->addr
= get_unaligned_le32(tuple
->TupleData
);
695 /*====================================================================*/
697 static int parse_longlink_mfc(tuple_t
*tuple
,
698 cistpl_longlink_mfc_t
*link
)
703 p
= (u_char
*)tuple
->TupleData
;
706 if (tuple
->TupleDataLen
<= link
->nfn
*5)
708 for (i
= 0; i
< link
->nfn
; i
++) {
709 link
->fn
[i
].space
= *p
; p
++;
710 link
->fn
[i
].addr
= get_unaligned_le32(p
);
716 /*====================================================================*/
718 static int parse_strings(u_char
*p
, u_char
*q
, int max
,
719 char *s
, u_char
*ofs
, u_char
*found
)
723 if (p
== q
) return CS_BAD_TUPLE
;
725 for (i
= 0; i
< max
; i
++) {
726 if (*p
== 0xff) break;
730 s
[j
++] = (*p
== 0xff) ? '\0' : *p
;
731 if ((*p
== '\0') || (*p
== 0xff)) break;
732 if (++p
== q
) return CS_BAD_TUPLE
;
734 if ((*p
== 0xff) || (++p
== q
)) break;
740 return (ns
== max
) ? 0 : CS_BAD_TUPLE
;
744 /*====================================================================*/
746 static int parse_vers_1(tuple_t
*tuple
, cistpl_vers_1_t
*vers_1
)
750 p
= (u_char
*)tuple
->TupleData
;
751 q
= p
+ tuple
->TupleDataLen
;
753 vers_1
->major
= *p
; p
++;
754 vers_1
->minor
= *p
; p
++;
755 if (p
>= q
) return CS_BAD_TUPLE
;
757 return parse_strings(p
, q
, CISTPL_VERS_1_MAX_PROD_STRINGS
,
758 vers_1
->str
, vers_1
->ofs
, &vers_1
->ns
);
761 /*====================================================================*/
763 static int parse_altstr(tuple_t
*tuple
, cistpl_altstr_t
*altstr
)
767 p
= (u_char
*)tuple
->TupleData
;
768 q
= p
+ tuple
->TupleDataLen
;
770 return parse_strings(p
, q
, CISTPL_MAX_ALTSTR_STRINGS
,
771 altstr
->str
, altstr
->ofs
, &altstr
->ns
);
774 /*====================================================================*/
776 static int parse_jedec(tuple_t
*tuple
, cistpl_jedec_t
*jedec
)
781 p
= (u_char
*)tuple
->TupleData
;
782 q
= p
+ tuple
->TupleDataLen
;
784 for (nid
= 0; nid
< CISTPL_MAX_DEVICES
; nid
++) {
786 jedec
->id
[nid
].mfr
= p
[0];
787 jedec
->id
[nid
].info
= p
[1];
794 /*====================================================================*/
796 static int parse_manfid(tuple_t
*tuple
, cistpl_manfid_t
*m
)
798 if (tuple
->TupleDataLen
< 4)
800 m
->manf
= get_unaligned_le16(tuple
->TupleData
);
801 m
->card
= get_unaligned_le16(tuple
->TupleData
+ 2);
805 /*====================================================================*/
807 static int parse_funcid(tuple_t
*tuple
, cistpl_funcid_t
*f
)
810 if (tuple
->TupleDataLen
< 2)
812 p
= (u_char
*)tuple
->TupleData
;
818 /*====================================================================*/
820 static int parse_funce(tuple_t
*tuple
, cistpl_funce_t
*f
)
824 if (tuple
->TupleDataLen
< 1)
826 p
= (u_char
*)tuple
->TupleData
;
828 for (i
= 1; i
< tuple
->TupleDataLen
; i
++)
833 /*====================================================================*/
835 static int parse_config(tuple_t
*tuple
, cistpl_config_t
*config
)
840 p
= (u_char
*)tuple
->TupleData
;
842 rmsz
= (*p
& 0x3c) >> 2;
843 if (tuple
->TupleDataLen
< rasz
+rmsz
+4)
845 config
->last_idx
= *(++p
);
848 for (i
= 0; i
<= rasz
; i
++)
849 config
->base
+= p
[i
] << (8*i
);
851 for (i
= 0; i
< 4; i
++)
852 config
->rmask
[i
] = 0;
853 for (i
= 0; i
<= rmsz
; i
++)
854 config
->rmask
[i
>>2] += p
[i
] << (8*(i
%4));
855 config
->subtuples
= tuple
->TupleDataLen
- (rasz
+rmsz
+4);
859 /*======================================================================
861 The following routines are all used to parse the nightmarish
862 config table entries.
864 ======================================================================*/
866 static u_char
*parse_power(u_char
*p
, u_char
*q
,
872 if (p
== q
) return NULL
;
876 for (i
= 0; i
< 7; i
++)
877 if (pwr
->present
& (1<<i
)) {
878 if (p
== q
) return NULL
;
879 pwr
->param
[i
] = POWER_CVT(*p
);
880 scale
= POWER_SCALE(*p
);
882 if (++p
== q
) return NULL
;
883 if ((*p
& 0x7f) < 100)
884 pwr
->param
[i
] += (*p
& 0x7f) * scale
/ 100;
886 pwr
->flags
|= CISTPL_POWER_HIGHZ_OK
;
890 pwr
->flags
|= CISTPL_POWER_HIGHZ_REQ
;
899 /*====================================================================*/
901 static u_char
*parse_timing(u_char
*p
, u_char
*q
,
902 cistpl_timing_t
*timing
)
906 if (p
== q
) return NULL
;
908 if ((scale
& 3) != 3) {
909 if (++p
== q
) return NULL
;
910 timing
->wait
= SPEED_CVT(*p
);
911 timing
->waitscale
= exponent
[scale
& 3];
915 if ((scale
& 7) != 7) {
916 if (++p
== q
) return NULL
;
917 timing
->ready
= SPEED_CVT(*p
);
918 timing
->rdyscale
= exponent
[scale
& 7];
923 if (++p
== q
) return NULL
;
924 timing
->reserved
= SPEED_CVT(*p
);
925 timing
->rsvscale
= exponent
[scale
];
927 timing
->reserved
= 0;
932 /*====================================================================*/
934 static u_char
*parse_io(u_char
*p
, u_char
*q
, cistpl_io_t
*io
)
938 if (p
== q
) return NULL
;
944 io
->win
[0].len
= (1 << (io
->flags
& CISTPL_IO_LINES_MASK
));
948 if (++p
== q
) return NULL
;
949 io
->nwin
= (*p
& 0x0f) + 1;
950 bsz
= (*p
& 0x30) >> 4;
952 lsz
= (*p
& 0xc0) >> 6;
956 for (i
= 0; i
< io
->nwin
; i
++) {
959 for (j
= 0; j
< bsz
; j
++, p
++) {
960 if (p
== q
) return NULL
;
961 io
->win
[i
].base
+= *p
<< (j
*8);
963 for (j
= 0; j
< lsz
; j
++, p
++) {
964 if (p
== q
) return NULL
;
965 io
->win
[i
].len
+= *p
<< (j
*8);
971 /*====================================================================*/
973 static u_char
*parse_mem(u_char
*p
, u_char
*q
, cistpl_mem_t
*mem
)
975 int i
, j
, asz
, lsz
, has_ha
;
978 if (p
== q
) return NULL
;
980 mem
->nwin
= (*p
& 0x07) + 1;
981 lsz
= (*p
& 0x18) >> 3;
982 asz
= (*p
& 0x60) >> 5;
983 has_ha
= (*p
& 0x80);
984 if (++p
== q
) return NULL
;
986 for (i
= 0; i
< mem
->nwin
; i
++) {
988 for (j
= 0; j
< lsz
; j
++, p
++) {
989 if (p
== q
) return NULL
;
992 for (j
= 0; j
< asz
; j
++, p
++) {
993 if (p
== q
) return NULL
;
997 for (j
= 0; j
< asz
; j
++, p
++) {
998 if (p
== q
) return NULL
;
1001 mem
->win
[i
].len
= len
<< 8;
1002 mem
->win
[i
].card_addr
= ca
<< 8;
1003 mem
->win
[i
].host_addr
= ha
<< 8;
1008 /*====================================================================*/
1010 static u_char
*parse_irq(u_char
*p
, u_char
*q
, cistpl_irq_t
*irq
)
1012 if (p
== q
) return NULL
;
1013 irq
->IRQInfo1
= *p
; p
++;
1014 if (irq
->IRQInfo1
& IRQ_INFO2_VALID
) {
1015 if (p
+2 > q
) return NULL
;
1016 irq
->IRQInfo2
= (p
[1]<<8) + p
[0];
1022 /*====================================================================*/
1024 static int parse_cftable_entry(tuple_t
*tuple
,
1025 cistpl_cftable_entry_t
*entry
)
1027 u_char
*p
, *q
, features
;
1029 p
= tuple
->TupleData
;
1030 q
= p
+ tuple
->TupleDataLen
;
1031 entry
->index
= *p
& 0x3f;
1034 entry
->flags
|= CISTPL_CFTABLE_DEFAULT
;
1036 if (++p
== q
) return CS_BAD_TUPLE
;
1038 entry
->flags
|= CISTPL_CFTABLE_BVDS
;
1040 entry
->flags
|= CISTPL_CFTABLE_WP
;
1042 entry
->flags
|= CISTPL_CFTABLE_RDYBSY
;
1044 entry
->flags
|= CISTPL_CFTABLE_MWAIT
;
1045 entry
->interface
= *p
& 0x0f;
1047 entry
->interface
= 0;
1049 /* Process optional features */
1050 if (++p
== q
) return CS_BAD_TUPLE
;
1054 if ((features
& 3) > 0) {
1055 p
= parse_power(p
, q
, &entry
->vcc
);
1056 if (p
== NULL
) return CS_BAD_TUPLE
;
1058 entry
->vcc
.present
= 0;
1059 if ((features
& 3) > 1) {
1060 p
= parse_power(p
, q
, &entry
->vpp1
);
1061 if (p
== NULL
) return CS_BAD_TUPLE
;
1063 entry
->vpp1
.present
= 0;
1064 if ((features
& 3) > 2) {
1065 p
= parse_power(p
, q
, &entry
->vpp2
);
1066 if (p
== NULL
) return CS_BAD_TUPLE
;
1068 entry
->vpp2
.present
= 0;
1070 /* Timing options */
1071 if (features
& 0x04) {
1072 p
= parse_timing(p
, q
, &entry
->timing
);
1073 if (p
== NULL
) return CS_BAD_TUPLE
;
1075 entry
->timing
.wait
= 0;
1076 entry
->timing
.ready
= 0;
1077 entry
->timing
.reserved
= 0;
1080 /* I/O window options */
1081 if (features
& 0x08) {
1082 p
= parse_io(p
, q
, &entry
->io
);
1083 if (p
== NULL
) return CS_BAD_TUPLE
;
1087 /* Interrupt options */
1088 if (features
& 0x10) {
1089 p
= parse_irq(p
, q
, &entry
->irq
);
1090 if (p
== NULL
) return CS_BAD_TUPLE
;
1092 entry
->irq
.IRQInfo1
= 0;
1094 switch (features
& 0x60) {
1096 entry
->mem
.nwin
= 0;
1099 entry
->mem
.nwin
= 1;
1100 entry
->mem
.win
[0].len
= get_unaligned_le16(p
) << 8;
1101 entry
->mem
.win
[0].card_addr
= 0;
1102 entry
->mem
.win
[0].host_addr
= 0;
1104 if (p
> q
) return CS_BAD_TUPLE
;
1107 entry
->mem
.nwin
= 1;
1108 entry
->mem
.win
[0].len
= get_unaligned_le16(p
) << 8;
1109 entry
->mem
.win
[0].card_addr
= get_unaligned_le16(p
+ 2) << 8;
1110 entry
->mem
.win
[0].host_addr
= 0;
1112 if (p
> q
) return CS_BAD_TUPLE
;
1115 p
= parse_mem(p
, q
, &entry
->mem
);
1116 if (p
== NULL
) return CS_BAD_TUPLE
;
1121 if (features
& 0x80) {
1122 if (p
== q
) return CS_BAD_TUPLE
;
1123 entry
->flags
|= (*p
<< 8);
1125 if (++p
== q
) return CS_BAD_TUPLE
;
1129 entry
->subtuples
= q
-p
;
1134 /*====================================================================*/
1136 #ifdef CONFIG_CARDBUS
1138 static int parse_bar(tuple_t
*tuple
, cistpl_bar_t
*bar
)
1141 if (tuple
->TupleDataLen
< 6)
1142 return CS_BAD_TUPLE
;
1143 p
= (u_char
*)tuple
->TupleData
;
1146 bar
->size
= get_unaligned_le32(p
);
1150 static int parse_config_cb(tuple_t
*tuple
, cistpl_config_t
*config
)
1154 p
= (u_char
*)tuple
->TupleData
;
1155 if ((*p
!= 3) || (tuple
->TupleDataLen
< 6))
1156 return CS_BAD_TUPLE
;
1157 config
->last_idx
= *(++p
);
1159 config
->base
= get_unaligned_le32(p
);
1160 config
->subtuples
= tuple
->TupleDataLen
- 6;
1164 static int parse_cftable_entry_cb(tuple_t
*tuple
,
1165 cistpl_cftable_entry_cb_t
*entry
)
1167 u_char
*p
, *q
, features
;
1169 p
= tuple
->TupleData
;
1170 q
= p
+ tuple
->TupleDataLen
;
1171 entry
->index
= *p
& 0x3f;
1174 entry
->flags
|= CISTPL_CFTABLE_DEFAULT
;
1176 /* Process optional features */
1177 if (++p
== q
) return CS_BAD_TUPLE
;
1181 if ((features
& 3) > 0) {
1182 p
= parse_power(p
, q
, &entry
->vcc
);
1183 if (p
== NULL
) return CS_BAD_TUPLE
;
1185 entry
->vcc
.present
= 0;
1186 if ((features
& 3) > 1) {
1187 p
= parse_power(p
, q
, &entry
->vpp1
);
1188 if (p
== NULL
) return CS_BAD_TUPLE
;
1190 entry
->vpp1
.present
= 0;
1191 if ((features
& 3) > 2) {
1192 p
= parse_power(p
, q
, &entry
->vpp2
);
1193 if (p
== NULL
) return CS_BAD_TUPLE
;
1195 entry
->vpp2
.present
= 0;
1197 /* I/O window options */
1198 if (features
& 0x08) {
1199 if (p
== q
) return CS_BAD_TUPLE
;
1200 entry
->io
= *p
; p
++;
1204 /* Interrupt options */
1205 if (features
& 0x10) {
1206 p
= parse_irq(p
, q
, &entry
->irq
);
1207 if (p
== NULL
) return CS_BAD_TUPLE
;
1209 entry
->irq
.IRQInfo1
= 0;
1211 if (features
& 0x20) {
1212 if (p
== q
) return CS_BAD_TUPLE
;
1213 entry
->mem
= *p
; p
++;
1218 if (features
& 0x80) {
1219 if (p
== q
) return CS_BAD_TUPLE
;
1220 entry
->flags
|= (*p
<< 8);
1222 if (++p
== q
) return CS_BAD_TUPLE
;
1223 entry
->flags
|= (*p
<< 16);
1226 if (++p
== q
) return CS_BAD_TUPLE
;
1230 entry
->subtuples
= q
-p
;
1237 /*====================================================================*/
1239 static int parse_device_geo(tuple_t
*tuple
, cistpl_device_geo_t
*geo
)
1244 p
= (u_char
*)tuple
->TupleData
;
1245 q
= p
+ tuple
->TupleDataLen
;
1247 for (n
= 0; n
< CISTPL_MAX_DEVICES
; n
++) {
1249 geo
->geo
[n
].buswidth
= p
[0];
1250 geo
->geo
[n
].erase_block
= 1 << (p
[1]-1);
1251 geo
->geo
[n
].read_block
= 1 << (p
[2]-1);
1252 geo
->geo
[n
].write_block
= 1 << (p
[3]-1);
1253 geo
->geo
[n
].partition
= 1 << (p
[4]-1);
1254 geo
->geo
[n
].interleave
= 1 << (p
[5]-1);
1261 /*====================================================================*/
1263 static int parse_vers_2(tuple_t
*tuple
, cistpl_vers_2_t
*v2
)
1267 if (tuple
->TupleDataLen
< 10)
1268 return CS_BAD_TUPLE
;
1270 p
= tuple
->TupleData
;
1271 q
= p
+ tuple
->TupleDataLen
;
1275 v2
->dindex
= get_unaligned_le16(p
+2 );
1280 return parse_strings(p
, q
, 2, v2
->str
, &v2
->vendor
, NULL
);
1283 /*====================================================================*/
1285 static int parse_org(tuple_t
*tuple
, cistpl_org_t
*org
)
1290 p
= tuple
->TupleData
;
1291 q
= p
+ tuple
->TupleDataLen
;
1292 if (p
== q
) return CS_BAD_TUPLE
;
1294 if (++p
== q
) return CS_BAD_TUPLE
;
1295 for (i
= 0; i
< 30; i
++) {
1297 if (*p
== '\0') break;
1298 if (++p
== q
) return CS_BAD_TUPLE
;
1303 /*====================================================================*/
1305 static int parse_format(tuple_t
*tuple
, cistpl_format_t
*fmt
)
1309 if (tuple
->TupleDataLen
< 10)
1310 return CS_BAD_TUPLE
;
1312 p
= tuple
->TupleData
;
1316 fmt
->offset
= get_unaligned_le32(p
+ 2);
1317 fmt
->length
= get_unaligned_le32(p
+ 6);
1322 /*====================================================================*/
1324 int pccard_parse_tuple(tuple_t
*tuple
, cisparse_t
*parse
)
1328 if (tuple
->TupleDataLen
> tuple
->TupleDataMax
)
1329 return CS_BAD_TUPLE
;
1330 switch (tuple
->TupleCode
) {
1332 case CISTPL_DEVICE_A
:
1333 ret
= parse_device(tuple
, &parse
->device
);
1335 #ifdef CONFIG_CARDBUS
1337 ret
= parse_bar(tuple
, &parse
->bar
);
1339 case CISTPL_CONFIG_CB
:
1340 ret
= parse_config_cb(tuple
, &parse
->config
);
1342 case CISTPL_CFTABLE_ENTRY_CB
:
1343 ret
= parse_cftable_entry_cb(tuple
, &parse
->cftable_entry_cb
);
1346 case CISTPL_CHECKSUM
:
1347 ret
= parse_checksum(tuple
, &parse
->checksum
);
1349 case CISTPL_LONGLINK_A
:
1350 case CISTPL_LONGLINK_C
:
1351 ret
= parse_longlink(tuple
, &parse
->longlink
);
1353 case CISTPL_LONGLINK_MFC
:
1354 ret
= parse_longlink_mfc(tuple
, &parse
->longlink_mfc
);
1357 ret
= parse_vers_1(tuple
, &parse
->version_1
);
1360 ret
= parse_altstr(tuple
, &parse
->altstr
);
1362 case CISTPL_JEDEC_A
:
1363 case CISTPL_JEDEC_C
:
1364 ret
= parse_jedec(tuple
, &parse
->jedec
);
1367 ret
= parse_manfid(tuple
, &parse
->manfid
);
1370 ret
= parse_funcid(tuple
, &parse
->funcid
);
1373 ret
= parse_funce(tuple
, &parse
->funce
);
1376 ret
= parse_config(tuple
, &parse
->config
);
1378 case CISTPL_CFTABLE_ENTRY
:
1379 ret
= parse_cftable_entry(tuple
, &parse
->cftable_entry
);
1381 case CISTPL_DEVICE_GEO
:
1382 case CISTPL_DEVICE_GEO_A
:
1383 ret
= parse_device_geo(tuple
, &parse
->device_geo
);
1386 ret
= parse_vers_2(tuple
, &parse
->vers_2
);
1389 ret
= parse_org(tuple
, &parse
->org
);
1392 case CISTPL_FORMAT_A
:
1393 ret
= parse_format(tuple
, &parse
->format
);
1395 case CISTPL_NO_LINK
:
1396 case CISTPL_LINKTARGET
:
1405 EXPORT_SYMBOL(pccard_parse_tuple
);
1407 /*======================================================================
1409 This is used internally by Card Services to look up CIS stuff.
1411 ======================================================================*/
1413 int pccard_read_tuple(struct pcmcia_socket
*s
, unsigned int function
, cisdata_t code
, void *parse
)
1419 buf
= kmalloc(256, GFP_KERNEL
);
1421 dev_printk(KERN_WARNING
, &s
->dev
, "no memory to read tuple\n");
1424 tuple
.DesiredTuple
= code
;
1425 tuple
.Attributes
= TUPLE_RETURN_COMMON
;
1426 ret
= pccard_get_first_tuple(s
, function
, &tuple
);
1429 tuple
.TupleData
= buf
;
1430 tuple
.TupleOffset
= 0;
1431 tuple
.TupleDataMax
= 255;
1432 ret
= pccard_get_tuple_data(s
, &tuple
);
1435 ret
= pccard_parse_tuple(&tuple
, parse
);
1440 EXPORT_SYMBOL(pccard_read_tuple
);
1442 /*======================================================================
1444 This tries to determine if a card has a sensible CIS. It returns
1445 the number of tuples in the CIS, or 0 if the CIS looks bad. The
1446 checks include making sure several critical tuples are present and
1447 valid; seeing if the total number of tuples is reasonable; and
1448 looking for tuples that use reserved codes.
1450 ======================================================================*/
1452 int pccard_validate_cis(struct pcmcia_socket
*s
, unsigned int function
, unsigned int *info
)
1456 unsigned int count
= 0;
1457 int ret
, reserved
, dev_ok
= 0, ident_ok
= 0;
1462 tuple
= kmalloc(sizeof(*tuple
), GFP_KERNEL
);
1463 if (tuple
== NULL
) {
1464 dev_printk(KERN_WARNING
, &s
->dev
, "no memory to validate CIS\n");
1467 p
= kmalloc(sizeof(*p
), GFP_KERNEL
);
1470 dev_printk(KERN_WARNING
, &s
->dev
, "no memory to validate CIS\n");
1474 count
= reserved
= 0;
1475 tuple
->DesiredTuple
= RETURN_FIRST_TUPLE
;
1476 tuple
->Attributes
= TUPLE_RETURN_COMMON
;
1477 ret
= pccard_get_first_tuple(s
, function
, tuple
);
1481 /* First tuple should be DEVICE; we should really have either that
1482 or a CFTABLE_ENTRY of some sort */
1483 if ((tuple
->TupleCode
== CISTPL_DEVICE
) ||
1484 (pccard_read_tuple(s
, function
, CISTPL_CFTABLE_ENTRY
, p
) == 0) ||
1485 (pccard_read_tuple(s
, function
, CISTPL_CFTABLE_ENTRY_CB
, p
) == 0))
1488 /* All cards should have a MANFID tuple, and/or a VERS_1 or VERS_2
1489 tuple, for card identification. Certain old D-Link and Linksys
1490 cards have only a broken VERS_2 tuple; hence the bogus test. */
1491 if ((pccard_read_tuple(s
, function
, CISTPL_MANFID
, p
) == 0) ||
1492 (pccard_read_tuple(s
, function
, CISTPL_VERS_1
, p
) == 0) ||
1493 (pccard_read_tuple(s
, function
, CISTPL_VERS_2
, p
) != -ENOSPC
))
1496 if (!dev_ok
&& !ident_ok
)
1499 for (count
= 1; count
< MAX_TUPLES
; count
++) {
1500 ret
= pccard_get_next_tuple(s
, function
, tuple
);
1503 if (((tuple
->TupleCode
> 0x23) && (tuple
->TupleCode
< 0x40)) ||
1504 ((tuple
->TupleCode
> 0x47) && (tuple
->TupleCode
< 0x80)) ||
1505 ((tuple
->TupleCode
> 0x90) && (tuple
->TupleCode
< 0xff)))
1508 if ((count
== MAX_TUPLES
) || (reserved
> 5) ||
1509 ((!dev_ok
|| !ident_ok
) && (count
> 10)))
1519 EXPORT_SYMBOL(pccard_validate_cis
);