blob: 71231e8c7edd56b290291fff056183024906d923 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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
Linus Torvalds1da177e2005-04-16 15:20:36 -070015#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>
23#include <linux/mm.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <linux/pci.h>
25#include <linux/ioport.h>
26#include <asm/io.h>
27#include <asm/byteorder.h>
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -070028#include <asm/unaligned.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
30#include <pcmcia/cs_types.h>
31#include <pcmcia/ss.h>
32#include <pcmcia/cs.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070033#include <pcmcia/cisreg.h>
34#include <pcmcia/cistpl.h>
35#include "cs_internal.h"
36
37static const u_char mantissa[] = {
38 10, 12, 13, 15, 20, 25, 30, 35,
39 40, 45, 50, 55, 60, 70, 80, 90
40};
41
42static const u_int exponent[] = {
43 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000
44};
45
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])
53
54/* Upper limit on reasonable # of tuples */
55#define MAX_TUPLES 200
56
57/*====================================================================*/
58
59/* Parameters that can be set with 'insmod' */
60
Pavel Machek37f77952005-09-07 16:00:26 -070061/* 16-bit CIS? */
62static int cis_width;
63module_param(cis_width, int, 0444);
Linus Torvalds1da177e2005-04-16 15:20:36 -070064
65void release_cis_mem(struct pcmcia_socket *s)
66{
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);
70 if (s->cis_mem.res) {
71 release_resource(s->cis_mem.res);
72 kfree(s->cis_mem.res);
73 s->cis_mem.res = NULL;
74 }
75 iounmap(s->cis_virt);
76 s->cis_virt = NULL;
77 }
78}
79EXPORT_SYMBOL(release_cis_mem);
80
81/*
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.
85 */
86static void __iomem *
87set_cis_map(struct pcmcia_socket *s, unsigned int card_offset, unsigned int flags)
88{
Dominik Brodowski2e5a3e72005-07-28 01:07:23 -070089 pccard_mem_map *mem = &s->cis_mem;
90 int ret;
Dominik Brodowski2ad0a0a2005-06-27 16:28:58 -070091
Dominik Brodowski2e5a3e72005-07-28 01:07:23 -070092 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) {
Dominik Brodowski2e55bf62008-08-02 18:08:38 +020095 dev_printk(KERN_NOTICE, &s->dev,
96 "cs: unable to map card memory!\n");
Dominik Brodowski2e5a3e72005-07-28 01:07:23 -070097 return NULL;
98 }
99 s->cis_virt = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100 }
Dominik Brodowski2ad0a0a2005-06-27 16:28:58 -0700101
Dominik Brodowski2e5a3e72005-07-28 01:07:23 -0700102 if (!(s->features & SS_CAP_STATIC_MAP) && (!s->cis_virt))
103 s->cis_virt = ioremap(mem->res->start, s->map_size);
104
105 mem->card_start = card_offset;
106 mem->flags = flags;
107
108 ret = s->ops->set_mem_map(s, mem);
109 if (ret) {
110 iounmap(s->cis_virt);
111 s->cis_virt = NULL;
112 return NULL;
113 }
114
115 if (s->features & SS_CAP_STATIC_MAP) {
116 if (s->cis_virt)
117 iounmap(s->cis_virt);
118 s->cis_virt = ioremap(mem->static_start, s->map_size);
119 }
120
121 return s->cis_virt;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122}
123
124/*======================================================================
125
126 Low-level functions to read and write CIS memory. I think the
127 write routine is only useful for writing one-byte registers.
128
129======================================================================*/
130
131/* Bits in attr field */
132#define IS_ATTR 1
133#define IS_INDIRECT 8
134
Dominik Brodowskie6ea0b92005-06-27 16:28:52 -0700135int pcmcia_read_cis_mem(struct pcmcia_socket *s, int attr, u_int addr,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 u_int len, void *ptr)
137{
138 void __iomem *sys, *end;
139 unsigned char *buf = ptr;
140
Dominik Brodowskie6ea0b92005-06-27 16:28:52 -0700141 cs_dbg(s, 3, "pcmcia_read_cis_mem(%d, %#x, %u)\n", attr, addr, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142
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) {
148 addr *= 2;
149 flags = ICTRL0_AUTOINC;
150 }
151
152 sys = set_cis_map(s, 0, MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0));
153 if (!sys) {
154 memset(ptr, 0xff, len);
155 return -1;
156 }
157
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);
165 } else {
166 u_int inc = 1, card_offset, flags;
167
168 flags = MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0);
169 if (attr) {
170 flags |= MAP_ATTRIB;
171 inc++;
172 addr *= 2;
173 }
174
175 card_offset = addr & ~(s->map_size-1);
176 while (len) {
177 sys = set_cis_map(s, card_offset, flags);
178 if (!sys) {
179 memset(ptr, 0xff, len);
180 return -1;
181 }
182 end = sys + s->map_size;
183 sys = sys + (addr & (s->map_size-1));
184 for ( ; len > 0; len--, buf++, sys += inc) {
185 if (sys == end)
186 break;
187 *buf = readb(sys);
188 }
189 card_offset += s->map_size;
190 addr = 0;
191 }
192 }
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));
196 return 0;
197}
Dominik Brodowski1a8d4662005-06-27 16:28:53 -0700198EXPORT_SYMBOL(pcmcia_read_cis_mem);
199
Linus Torvalds1da177e2005-04-16 15:20:36 -0700200
Dominik Brodowskie6ea0b92005-06-27 16:28:52 -0700201void pcmcia_write_cis_mem(struct pcmcia_socket *s, int attr, u_int addr,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 u_int len, void *ptr)
203{
204 void __iomem *sys, *end;
205 unsigned char *buf = ptr;
206
Dominik Brodowskie6ea0b92005-06-27 16:28:52 -0700207 cs_dbg(s, 3, "pcmcia_write_cis_mem(%d, %#x, %u)\n", attr, addr, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208
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) {
214 addr *= 2;
215 flags = ICTRL0_AUTOINC;
216 }
217
218 sys = set_cis_map(s, 0, MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0));
219 if (!sys)
220 return; /* FIXME: Error */
221
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);
229 } else {
230 u_int inc = 1, card_offset, flags;
231
232 flags = MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0);
233 if (attr & IS_ATTR) {
234 flags |= MAP_ATTRIB;
235 inc++;
236 addr *= 2;
237 }
238
239 card_offset = addr & ~(s->map_size-1);
240 while (len) {
241 sys = set_cis_map(s, card_offset, flags);
242 if (!sys)
243 return; /* FIXME: error */
244
245 end = sys + s->map_size;
246 sys = sys + (addr & (s->map_size-1));
247 for ( ; len > 0; len--, buf++, sys += inc) {
248 if (sys == end)
249 break;
250 writeb(*buf, sys);
251 }
252 card_offset += s->map_size;
253 addr = 0;
254 }
255 }
256}
Dominik Brodowski1a8d4662005-06-27 16:28:53 -0700257EXPORT_SYMBOL(pcmcia_write_cis_mem);
258
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259
260/*======================================================================
261
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.
265
266======================================================================*/
267
268static void read_cis_cache(struct pcmcia_socket *s, int attr, u_int addr,
Dominik Brodowski53efec92008-07-28 19:44:05 +0200269 size_t len, void *ptr)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270{
271 struct cis_cache_entry *cis;
272 int ret;
273
274 if (s->fake_cis) {
Dominik Brodowski53efec92008-07-28 19:44:05 +0200275 if (s->fake_cis_len >= addr+len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276 memcpy(ptr, s->fake_cis+addr, len);
277 else
278 memset(ptr, 0xff, len);
279 return;
280 }
281
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);
285 return;
286 }
287 }
288
289#ifdef CONFIG_CARDBUS
290 if (s->state & SOCKET_CARDBUS)
291 ret = read_cb_mem(s, attr, addr, len, ptr);
292 else
293#endif
Dominik Brodowskie6ea0b92005-06-27 16:28:52 -0700294 ret = pcmcia_read_cis_mem(s, attr, addr, len, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295
296 if (ret == 0) {
297 /* Copy data into the cache */
298 cis = kmalloc(sizeof(struct cis_cache_entry) + len, GFP_KERNEL);
299 if (cis) {
300 cis->addr = addr;
301 cis->len = len;
302 cis->attr = attr;
303 memcpy(cis->cache, ptr, len);
304 list_add(&cis->node, &s->cis_cache);
305 }
306 }
307}
308
309static void
310remove_cis_cache(struct pcmcia_socket *s, int attr, u_int addr, u_int len)
311{
312 struct cis_cache_entry *cis;
313
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);
317 kfree(cis);
318 break;
319 }
320}
321
322void destroy_cis_cache(struct pcmcia_socket *s)
323{
324 struct list_head *l, *n;
325
326 list_for_each_safe(l, n, &s->cis_cache) {
327 struct cis_cache_entry *cis = list_entry(l, struct cis_cache_entry, node);
328
329 list_del(&cis->node);
330 kfree(cis);
331 }
332
333 /*
334 * If there was a fake CIS, destroy that as well.
335 */
Jesper Juhl6044ec82005-11-07 01:01:32 -0800336 kfree(s->fake_cis);
337 s->fake_cis = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338}
339EXPORT_SYMBOL(destroy_cis_cache);
340
341/*======================================================================
342
343 This verifies if the CIS of a card matches what is in the CIS
344 cache.
345
346======================================================================*/
347
348int verify_cis_cache(struct pcmcia_socket *s)
349{
350 struct cis_cache_entry *cis;
351 char *buf;
352
353 buf = kmalloc(256, GFP_KERNEL);
354 if (buf == NULL)
Dominik Brodowski11683862008-08-03 10:22:47 +0200355 dev_printk(KERN_WARNING, &s->dev,
356 "no memory for verifying CIS\n");
357 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358 list_for_each_entry(cis, &s->cis_cache, node) {
359 int len = cis->len;
360
361 if (len > 256)
362 len = 256;
363#ifdef CONFIG_CARDBUS
364 if (s->state & SOCKET_CARDBUS)
365 read_cb_mem(s, cis->attr, cis->addr, len, buf);
366 else
367#endif
Dominik Brodowskie6ea0b92005-06-27 16:28:52 -0700368 pcmcia_read_cis_mem(s, cis->attr, cis->addr, len, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700369
370 if (memcmp(buf, cis->cache, len) != 0) {
371 kfree(buf);
372 return -1;
373 }
374 }
375 kfree(buf);
376 return 0;
377}
378
379/*======================================================================
380
381 For really bad cards, we provide a facility for uploading a
382 replacement CIS.
383
384======================================================================*/
385
Dominik Brodowski53efec92008-07-28 19:44:05 +0200386int pcmcia_replace_cis(struct pcmcia_socket *s,
387 const u8 *data, const size_t len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388{
Dominik Brodowski11683862008-08-03 10:22:47 +0200389 if (len > CISTPL_MAX_CIS_SIZE) {
390 dev_printk(KERN_WARNING, &s->dev, "replacement CIS too big\n");
391 return -EINVAL;
392 }
393 kfree(s->fake_cis);
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");
397 return -ENOMEM;
398 }
399 s->fake_cis_len = len;
400 memcpy(s->fake_cis, data, len);
401 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402}
Dominik Brodowski33519dd2005-06-27 16:28:53 -0700403EXPORT_SYMBOL(pcmcia_replace_cis);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404
405/*======================================================================
406
407 The high-level CIS tuple services
408
409======================================================================*/
410
411typedef struct tuple_flags {
412 u_int link_space:4;
413 u_int has_link:1;
414 u_int mfc_fn:3;
415 u_int space:4;
416} tuple_flags;
417
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)
422
423int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int func, tuple_t *tuple);
424
425int pccard_get_first_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
426{
427 if (!s)
428 return CS_BAD_HANDLE;
429 if (!(s->state & SOCKET_PRESENT))
430 return CS_NO_CARD;
431 tuple->TupleLink = tuple->Flags = 0;
432#ifdef CONFIG_CARDBUS
433 if (s->state & SOCKET_CARDBUS) {
434 struct pci_dev *dev = s->cb_dev;
435 u_int ptr;
436 pci_bus_read_config_dword(dev->subordinate, 0, PCI_CARDBUS_CIS, &ptr);
437 tuple->CISOffset = ptr & ~7;
438 SPACE(tuple->Flags) = (ptr & 7);
439 } else
440#endif
441 {
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;
445 }
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;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200450 if (pccard_get_next_tuple(s, function, tuple) == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700451 tuple->DesiredTuple = CISTPL_LINKTARGET;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200452 if (pccard_get_next_tuple(s, function, tuple) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453 return CS_NO_MORE_ITEMS;
454 } else
455 tuple->CISOffset = tuple->TupleLink = 0;
456 tuple->DesiredTuple = req;
457 }
458 return pccard_get_next_tuple(s, function, tuple);
459}
460EXPORT_SYMBOL(pccard_get_first_tuple);
461
462static int follow_link(struct pcmcia_socket *s, tuple_t *tuple)
463{
464 u_char link[5];
465 u_int ofs;
466
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);
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700471 ofs = get_unaligned_le32(link + 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700472 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;
480 } else {
481 return -1;
482 }
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))
489 return ofs;
490 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
491 /* Then, we try the wrong spot... */
492 ofs = ofs >> 1;
493 }
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))
497 return ofs;
498 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
499 return -1;
500}
501
502int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
503{
504 u_char link[2], tmp;
505 int ofs, i, attr;
506
507 if (!s)
508 return CS_BAD_HANDLE;
509 if (!(s->state & SOCKET_PRESENT))
510 return CS_NO_CARD;
511
512 link[1] = tuple->TupleLink;
513 ofs = tuple->CISOffset + tuple->TupleLink;
514 attr = SPACE(tuple->Flags);
515
516 for (i = 0; i < MAX_TUPLES; i++) {
517 if (link[1] == 0xff) {
518 link[0] = CISTPL_END;
519 } else {
520 read_cis_cache(s, attr, ofs, 2, link);
521 if (link[0] == CISTPL_NULL) {
522 ofs++; continue;
523 }
524 }
525
526 /* End of chain? Follow long link if possible */
527 if (link[0] == CISTPL_END) {
528 if ((ofs = follow_link(s, tuple)) < 0)
529 return CS_NO_MORE_ITEMS;
530 attr = SPACE(tuple->Flags);
531 read_cis_cache(s, attr, ofs, 2, link);
532 }
533
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)) {
541 switch (link[0]) {
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);
546 break;
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);
551 break;
552 case CISTPL_INDIRECT:
553 HAS_LINK(tuple->Flags) = 1;
554 LINK_SPACE(tuple->Flags) = IS_ATTR | IS_INDIRECT;
555 tuple->LinkOffset = 0;
556 break;
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;
564 } else {
565 /* Follow exactly one of the links */
566 MFC_FN(tuple->Flags) = 1;
567 tuple->LinkOffset += function * 5;
568 }
569 break;
570 case CISTPL_NO_LINK:
571 HAS_LINK(tuple->Flags) = 0;
572 break;
573 }
574 if ((tuple->Attributes & TUPLE_RETURN_LINK) &&
575 (tuple->DesiredTuple == RETURN_FIRST_TUPLE))
576 break;
577 } else
578 if (tuple->DesiredTuple == RETURN_FIRST_TUPLE)
579 break;
580
581 if (link[0] == tuple->DesiredTuple)
582 break;
583 ofs += link[1] + 2;
584 }
585 if (i == MAX_TUPLES) {
586 cs_dbg(s, 1, "cs: overrun in pcmcia_get_next_tuple\n");
587 return CS_NO_MORE_ITEMS;
588 }
589
590 tuple->TupleCode = link[0];
591 tuple->TupleLink = link[1];
592 tuple->CISOffset = ofs + 2;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200593 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700594}
595EXPORT_SYMBOL(pccard_get_next_tuple);
596
597/*====================================================================*/
598
599#define _MIN(a, b) (((a) < (b)) ? (a) : (b))
600
601int pccard_get_tuple_data(struct pcmcia_socket *s, tuple_t *tuple)
602{
603 u_int len;
604
605 if (!s)
606 return CS_BAD_HANDLE;
607
608 if (tuple->TupleLink < tuple->TupleOffset)
609 return CS_NO_MORE_ITEMS;
610 len = tuple->TupleLink - tuple->TupleOffset;
611 tuple->TupleDataLen = tuple->TupleLink;
612 if (len == 0)
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200613 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700614 read_cis_cache(s, SPACE(tuple->Flags),
615 tuple->CISOffset + tuple->TupleOffset,
616 _MIN(len, tuple->TupleDataMax), tuple->TupleData);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200617 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700618}
619EXPORT_SYMBOL(pccard_get_tuple_data);
620
621
622/*======================================================================
623
624 Parsing routines for individual tuples
625
626======================================================================*/
627
628static int parse_device(tuple_t *tuple, cistpl_device_t *device)
629{
630 int i;
631 u_char scale;
632 u_char *p, *q;
633
634 p = (u_char *)tuple->TupleData;
635 q = p + tuple->TupleDataLen;
636
637 device->ndev = 0;
638 for (i = 0; i < CISTPL_MAX_DEVICES; i++) {
639
640 if (*p == 0xff) break;
641 device->dev[i].type = (*p >> 4);
642 device->dev[i].wp = (*p & 0x08) ? 1 : 0;
643 switch (*p & 0x07) {
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;
649 case 7:
650 if (++p == q) return CS_BAD_TUPLE;
651 device->dev[i].speed = SPEED_CVT(*p);
652 while (*p & 0x80)
653 if (++p == q) return CS_BAD_TUPLE;
654 break;
655 default:
656 return CS_BAD_TUPLE;
657 }
658
659 if (++p == q) return CS_BAD_TUPLE;
660 if (*p == 0xff) break;
661 scale = *p & 7;
662 if (scale == 7) return CS_BAD_TUPLE;
663 device->dev[i].size = ((*p >> 3) + 1) * (512 << (scale*2));
664 device->ndev++;
665 if (++p == q) break;
666 }
667
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200668 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700669}
670
671/*====================================================================*/
672
673static int parse_checksum(tuple_t *tuple, cistpl_checksum_t *csum)
674{
675 u_char *p;
676 if (tuple->TupleDataLen < 5)
677 return CS_BAD_TUPLE;
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700678 p = (u_char *) tuple->TupleData;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700679 csum->addr = tuple->CISOffset + get_unaligned_le16(p) - 2;
680 csum->len = get_unaligned_le16(p + 2);
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700681 csum->sum = *(p + 4);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200682 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700683}
684
685/*====================================================================*/
686
687static int parse_longlink(tuple_t *tuple, cistpl_longlink_t *link)
688{
689 if (tuple->TupleDataLen < 4)
690 return CS_BAD_TUPLE;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700691 link->addr = get_unaligned_le32(tuple->TupleData);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200692 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700693}
694
695/*====================================================================*/
696
697static int parse_longlink_mfc(tuple_t *tuple,
698 cistpl_longlink_mfc_t *link)
699{
700 u_char *p;
701 int i;
702
703 p = (u_char *)tuple->TupleData;
704
705 link->nfn = *p; p++;
706 if (tuple->TupleDataLen <= link->nfn*5)
707 return CS_BAD_TUPLE;
708 for (i = 0; i < link->nfn; i++) {
709 link->fn[i].space = *p; p++;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700710 link->fn[i].addr = get_unaligned_le32(p);
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700711 p += 4;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712 }
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200713 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700714}
715
716/*====================================================================*/
717
718static int parse_strings(u_char *p, u_char *q, int max,
719 char *s, u_char *ofs, u_char *found)
720{
721 int i, j, ns;
722
723 if (p == q) return CS_BAD_TUPLE;
724 ns = 0; j = 0;
725 for (i = 0; i < max; i++) {
726 if (*p == 0xff) break;
727 ofs[i] = j;
728 ns++;
729 for (;;) {
730 s[j++] = (*p == 0xff) ? '\0' : *p;
731 if ((*p == '\0') || (*p == 0xff)) break;
732 if (++p == q) return CS_BAD_TUPLE;
733 }
734 if ((*p == 0xff) || (++p == q)) break;
735 }
736 if (found) {
737 *found = ns;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200738 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700739 } else {
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200740 return (ns == max) ? 0 : CS_BAD_TUPLE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700741 }
742}
743
744/*====================================================================*/
745
746static int parse_vers_1(tuple_t *tuple, cistpl_vers_1_t *vers_1)
747{
748 u_char *p, *q;
749
750 p = (u_char *)tuple->TupleData;
751 q = p + tuple->TupleDataLen;
752
753 vers_1->major = *p; p++;
754 vers_1->minor = *p; p++;
755 if (p >= q) return CS_BAD_TUPLE;
756
757 return parse_strings(p, q, CISTPL_VERS_1_MAX_PROD_STRINGS,
758 vers_1->str, vers_1->ofs, &vers_1->ns);
759}
760
761/*====================================================================*/
762
763static int parse_altstr(tuple_t *tuple, cistpl_altstr_t *altstr)
764{
765 u_char *p, *q;
766
767 p = (u_char *)tuple->TupleData;
768 q = p + tuple->TupleDataLen;
769
770 return parse_strings(p, q, CISTPL_MAX_ALTSTR_STRINGS,
771 altstr->str, altstr->ofs, &altstr->ns);
772}
773
774/*====================================================================*/
775
776static int parse_jedec(tuple_t *tuple, cistpl_jedec_t *jedec)
777{
778 u_char *p, *q;
779 int nid;
780
781 p = (u_char *)tuple->TupleData;
782 q = p + tuple->TupleDataLen;
783
784 for (nid = 0; nid < CISTPL_MAX_DEVICES; nid++) {
785 if (p > q-2) break;
786 jedec->id[nid].mfr = p[0];
787 jedec->id[nid].info = p[1];
788 p += 2;
789 }
790 jedec->nid = nid;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200791 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700792}
793
794/*====================================================================*/
795
796static int parse_manfid(tuple_t *tuple, cistpl_manfid_t *m)
797{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700798 if (tuple->TupleDataLen < 4)
799 return CS_BAD_TUPLE;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700800 m->manf = get_unaligned_le16(tuple->TupleData);
801 m->card = get_unaligned_le16(tuple->TupleData + 2);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200802 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700803}
804
805/*====================================================================*/
806
807static int parse_funcid(tuple_t *tuple, cistpl_funcid_t *f)
808{
809 u_char *p;
810 if (tuple->TupleDataLen < 2)
811 return CS_BAD_TUPLE;
812 p = (u_char *)tuple->TupleData;
813 f->func = p[0];
814 f->sysinit = p[1];
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200815 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700816}
817
818/*====================================================================*/
819
820static int parse_funce(tuple_t *tuple, cistpl_funce_t *f)
821{
822 u_char *p;
823 int i;
824 if (tuple->TupleDataLen < 1)
825 return CS_BAD_TUPLE;
826 p = (u_char *)tuple->TupleData;
827 f->type = p[0];
828 for (i = 1; i < tuple->TupleDataLen; i++)
829 f->data[i-1] = p[i];
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200830 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700831}
832
833/*====================================================================*/
834
835static int parse_config(tuple_t *tuple, cistpl_config_t *config)
836{
837 int rasz, rmsz, i;
838 u_char *p;
839
840 p = (u_char *)tuple->TupleData;
841 rasz = *p & 0x03;
842 rmsz = (*p & 0x3c) >> 2;
843 if (tuple->TupleDataLen < rasz+rmsz+4)
844 return CS_BAD_TUPLE;
845 config->last_idx = *(++p);
846 p++;
847 config->base = 0;
848 for (i = 0; i <= rasz; i++)
849 config->base += p[i] << (8*i);
850 p += rasz+1;
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);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200856 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700857}
858
859/*======================================================================
860
861 The following routines are all used to parse the nightmarish
862 config table entries.
863
864======================================================================*/
865
866static u_char *parse_power(u_char *p, u_char *q,
867 cistpl_power_t *pwr)
868{
869 int i;
870 u_int scale;
871
872 if (p == q) return NULL;
873 pwr->present = *p;
874 pwr->flags = 0;
875 p++;
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);
881 while (*p & 0x80) {
882 if (++p == q) return NULL;
883 if ((*p & 0x7f) < 100)
884 pwr->param[i] += (*p & 0x7f) * scale / 100;
885 else if (*p == 0x7d)
886 pwr->flags |= CISTPL_POWER_HIGHZ_OK;
887 else if (*p == 0x7e)
888 pwr->param[i] = 0;
889 else if (*p == 0x7f)
890 pwr->flags |= CISTPL_POWER_HIGHZ_REQ;
891 else
892 return NULL;
893 }
894 p++;
895 }
896 return p;
897}
898
899/*====================================================================*/
900
901static u_char *parse_timing(u_char *p, u_char *q,
902 cistpl_timing_t *timing)
903{
904 u_char scale;
905
906 if (p == q) return NULL;
907 scale = *p;
908 if ((scale & 3) != 3) {
909 if (++p == q) return NULL;
910 timing->wait = SPEED_CVT(*p);
911 timing->waitscale = exponent[scale & 3];
912 } else
913 timing->wait = 0;
914 scale >>= 2;
915 if ((scale & 7) != 7) {
916 if (++p == q) return NULL;
917 timing->ready = SPEED_CVT(*p);
918 timing->rdyscale = exponent[scale & 7];
919 } else
920 timing->ready = 0;
921 scale >>= 3;
922 if (scale != 7) {
923 if (++p == q) return NULL;
924 timing->reserved = SPEED_CVT(*p);
925 timing->rsvscale = exponent[scale];
926 } else
927 timing->reserved = 0;
928 p++;
929 return p;
930}
931
932/*====================================================================*/
933
934static u_char *parse_io(u_char *p, u_char *q, cistpl_io_t *io)
935{
936 int i, j, bsz, lsz;
937
938 if (p == q) return NULL;
939 io->flags = *p;
940
941 if (!(*p & 0x80)) {
942 io->nwin = 1;
943 io->win[0].base = 0;
944 io->win[0].len = (1 << (io->flags & CISTPL_IO_LINES_MASK));
945 return p+1;
946 }
947
948 if (++p == q) return NULL;
949 io->nwin = (*p & 0x0f) + 1;
950 bsz = (*p & 0x30) >> 4;
951 if (bsz == 3) bsz++;
952 lsz = (*p & 0xc0) >> 6;
953 if (lsz == 3) lsz++;
954 p++;
955
956 for (i = 0; i < io->nwin; i++) {
957 io->win[i].base = 0;
958 io->win[i].len = 1;
959 for (j = 0; j < bsz; j++, p++) {
960 if (p == q) return NULL;
961 io->win[i].base += *p << (j*8);
962 }
963 for (j = 0; j < lsz; j++, p++) {
964 if (p == q) return NULL;
965 io->win[i].len += *p << (j*8);
966 }
967 }
968 return p;
969}
970
971/*====================================================================*/
972
973static u_char *parse_mem(u_char *p, u_char *q, cistpl_mem_t *mem)
974{
975 int i, j, asz, lsz, has_ha;
976 u_int len, ca, ha;
977
978 if (p == q) return NULL;
979
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;
985
986 for (i = 0; i < mem->nwin; i++) {
987 len = ca = ha = 0;
988 for (j = 0; j < lsz; j++, p++) {
989 if (p == q) return NULL;
990 len += *p << (j*8);
991 }
992 for (j = 0; j < asz; j++, p++) {
993 if (p == q) return NULL;
994 ca += *p << (j*8);
995 }
996 if (has_ha)
997 for (j = 0; j < asz; j++, p++) {
998 if (p == q) return NULL;
999 ha += *p << (j*8);
1000 }
1001 mem->win[i].len = len << 8;
1002 mem->win[i].card_addr = ca << 8;
1003 mem->win[i].host_addr = ha << 8;
1004 }
1005 return p;
1006}
1007
1008/*====================================================================*/
1009
1010static u_char *parse_irq(u_char *p, u_char *q, cistpl_irq_t *irq)
1011{
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];
1017 p += 2;
1018 }
1019 return p;
1020}
1021
1022/*====================================================================*/
1023
1024static int parse_cftable_entry(tuple_t *tuple,
1025 cistpl_cftable_entry_t *entry)
1026{
1027 u_char *p, *q, features;
1028
1029 p = tuple->TupleData;
1030 q = p + tuple->TupleDataLen;
1031 entry->index = *p & 0x3f;
1032 entry->flags = 0;
1033 if (*p & 0x40)
1034 entry->flags |= CISTPL_CFTABLE_DEFAULT;
1035 if (*p & 0x80) {
1036 if (++p == q) return CS_BAD_TUPLE;
1037 if (*p & 0x10)
1038 entry->flags |= CISTPL_CFTABLE_BVDS;
1039 if (*p & 0x20)
1040 entry->flags |= CISTPL_CFTABLE_WP;
1041 if (*p & 0x40)
1042 entry->flags |= CISTPL_CFTABLE_RDYBSY;
1043 if (*p & 0x80)
1044 entry->flags |= CISTPL_CFTABLE_MWAIT;
1045 entry->interface = *p & 0x0f;
1046 } else
1047 entry->interface = 0;
1048
1049 /* Process optional features */
1050 if (++p == q) return CS_BAD_TUPLE;
1051 features = *p; p++;
1052
1053 /* Power options */
1054 if ((features & 3) > 0) {
1055 p = parse_power(p, q, &entry->vcc);
1056 if (p == NULL) return CS_BAD_TUPLE;
1057 } else
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;
1062 } else
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;
1067 } else
1068 entry->vpp2.present = 0;
1069
1070 /* Timing options */
1071 if (features & 0x04) {
1072 p = parse_timing(p, q, &entry->timing);
1073 if (p == NULL) return CS_BAD_TUPLE;
1074 } else {
1075 entry->timing.wait = 0;
1076 entry->timing.ready = 0;
1077 entry->timing.reserved = 0;
1078 }
1079
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;
1084 } else
1085 entry->io.nwin = 0;
1086
1087 /* Interrupt options */
1088 if (features & 0x10) {
1089 p = parse_irq(p, q, &entry->irq);
1090 if (p == NULL) return CS_BAD_TUPLE;
1091 } else
1092 entry->irq.IRQInfo1 = 0;
1093
1094 switch (features & 0x60) {
1095 case 0x00:
1096 entry->mem.nwin = 0;
1097 break;
1098 case 0x20:
1099 entry->mem.nwin = 1;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001100 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001101 entry->mem.win[0].card_addr = 0;
1102 entry->mem.win[0].host_addr = 0;
1103 p += 2;
1104 if (p > q) return CS_BAD_TUPLE;
1105 break;
1106 case 0x40:
1107 entry->mem.nwin = 1;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001108 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
1109 entry->mem.win[0].card_addr = get_unaligned_le16(p + 2) << 8;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001110 entry->mem.win[0].host_addr = 0;
1111 p += 4;
1112 if (p > q) return CS_BAD_TUPLE;
1113 break;
1114 case 0x60:
1115 p = parse_mem(p, q, &entry->mem);
1116 if (p == NULL) return CS_BAD_TUPLE;
1117 break;
1118 }
1119
1120 /* Misc features */
1121 if (features & 0x80) {
1122 if (p == q) return CS_BAD_TUPLE;
1123 entry->flags |= (*p << 8);
1124 while (*p & 0x80)
1125 if (++p == q) return CS_BAD_TUPLE;
1126 p++;
1127 }
1128
1129 entry->subtuples = q-p;
1130
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001131 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001132}
1133
1134/*====================================================================*/
1135
1136#ifdef CONFIG_CARDBUS
1137
1138static int parse_bar(tuple_t *tuple, cistpl_bar_t *bar)
1139{
1140 u_char *p;
1141 if (tuple->TupleDataLen < 6)
1142 return CS_BAD_TUPLE;
1143 p = (u_char *)tuple->TupleData;
1144 bar->attr = *p;
1145 p += 2;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001146 bar->size = get_unaligned_le32(p);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001147 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001148}
1149
1150static int parse_config_cb(tuple_t *tuple, cistpl_config_t *config)
1151{
1152 u_char *p;
1153
1154 p = (u_char *)tuple->TupleData;
1155 if ((*p != 3) || (tuple->TupleDataLen < 6))
1156 return CS_BAD_TUPLE;
1157 config->last_idx = *(++p);
1158 p++;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001159 config->base = get_unaligned_le32(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001160 config->subtuples = tuple->TupleDataLen - 6;
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001161 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001162}
1163
1164static int parse_cftable_entry_cb(tuple_t *tuple,
1165 cistpl_cftable_entry_cb_t *entry)
1166{
1167 u_char *p, *q, features;
1168
1169 p = tuple->TupleData;
1170 q = p + tuple->TupleDataLen;
1171 entry->index = *p & 0x3f;
1172 entry->flags = 0;
1173 if (*p & 0x40)
1174 entry->flags |= CISTPL_CFTABLE_DEFAULT;
1175
1176 /* Process optional features */
1177 if (++p == q) return CS_BAD_TUPLE;
1178 features = *p; p++;
1179
1180 /* Power options */
1181 if ((features & 3) > 0) {
1182 p = parse_power(p, q, &entry->vcc);
1183 if (p == NULL) return CS_BAD_TUPLE;
1184 } else
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;
1189 } else
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;
1194 } else
1195 entry->vpp2.present = 0;
1196
1197 /* I/O window options */
1198 if (features & 0x08) {
1199 if (p == q) return CS_BAD_TUPLE;
1200 entry->io = *p; p++;
1201 } else
1202 entry->io = 0;
1203
1204 /* Interrupt options */
1205 if (features & 0x10) {
1206 p = parse_irq(p, q, &entry->irq);
1207 if (p == NULL) return CS_BAD_TUPLE;
1208 } else
1209 entry->irq.IRQInfo1 = 0;
1210
1211 if (features & 0x20) {
1212 if (p == q) return CS_BAD_TUPLE;
1213 entry->mem = *p; p++;
1214 } else
1215 entry->mem = 0;
1216
1217 /* Misc features */
1218 if (features & 0x80) {
1219 if (p == q) return CS_BAD_TUPLE;
1220 entry->flags |= (*p << 8);
1221 if (*p & 0x80) {
1222 if (++p == q) return CS_BAD_TUPLE;
1223 entry->flags |= (*p << 16);
1224 }
1225 while (*p & 0x80)
1226 if (++p == q) return CS_BAD_TUPLE;
1227 p++;
1228 }
1229
1230 entry->subtuples = q-p;
1231
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001232 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001233}
1234
1235#endif
1236
1237/*====================================================================*/
1238
1239static int parse_device_geo(tuple_t *tuple, cistpl_device_geo_t *geo)
1240{
1241 u_char *p, *q;
1242 int n;
1243
1244 p = (u_char *)tuple->TupleData;
1245 q = p + tuple->TupleDataLen;
1246
1247 for (n = 0; n < CISTPL_MAX_DEVICES; n++) {
1248 if (p > q-6) break;
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);
1255 p += 6;
1256 }
1257 geo->ngeo = n;
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001258 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001259}
1260
1261/*====================================================================*/
1262
1263static int parse_vers_2(tuple_t *tuple, cistpl_vers_2_t *v2)
1264{
1265 u_char *p, *q;
1266
1267 if (tuple->TupleDataLen < 10)
1268 return CS_BAD_TUPLE;
1269
1270 p = tuple->TupleData;
1271 q = p + tuple->TupleDataLen;
1272
1273 v2->vers = p[0];
1274 v2->comply = p[1];
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001275 v2->dindex = get_unaligned_le16(p +2 );
Linus Torvalds1da177e2005-04-16 15:20:36 -07001276 v2->vspec8 = p[6];
1277 v2->vspec9 = p[7];
1278 v2->nhdr = p[8];
1279 p += 9;
1280 return parse_strings(p, q, 2, v2->str, &v2->vendor, NULL);
1281}
1282
1283/*====================================================================*/
1284
1285static int parse_org(tuple_t *tuple, cistpl_org_t *org)
1286{
1287 u_char *p, *q;
1288 int i;
1289
1290 p = tuple->TupleData;
1291 q = p + tuple->TupleDataLen;
1292 if (p == q) return CS_BAD_TUPLE;
1293 org->data_org = *p;
1294 if (++p == q) return CS_BAD_TUPLE;
1295 for (i = 0; i < 30; i++) {
1296 org->desc[i] = *p;
1297 if (*p == '\0') break;
1298 if (++p == q) return CS_BAD_TUPLE;
1299 }
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001300 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001301}
1302
1303/*====================================================================*/
1304
1305static int parse_format(tuple_t *tuple, cistpl_format_t *fmt)
1306{
1307 u_char *p;
1308
1309 if (tuple->TupleDataLen < 10)
1310 return CS_BAD_TUPLE;
1311
1312 p = tuple->TupleData;
1313
1314 fmt->type = p[0];
1315 fmt->edc = p[1];
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001316 fmt->offset = get_unaligned_le32(p + 2);
1317 fmt->length = get_unaligned_le32(p + 6);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001318
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001319 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001320}
1321
1322/*====================================================================*/
1323
1324int pccard_parse_tuple(tuple_t *tuple, cisparse_t *parse)
1325{
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001326 int ret = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001327
1328 if (tuple->TupleDataLen > tuple->TupleDataMax)
1329 return CS_BAD_TUPLE;
1330 switch (tuple->TupleCode) {
1331 case CISTPL_DEVICE:
1332 case CISTPL_DEVICE_A:
1333 ret = parse_device(tuple, &parse->device);
1334 break;
1335#ifdef CONFIG_CARDBUS
1336 case CISTPL_BAR:
1337 ret = parse_bar(tuple, &parse->bar);
1338 break;
1339 case CISTPL_CONFIG_CB:
1340 ret = parse_config_cb(tuple, &parse->config);
1341 break;
1342 case CISTPL_CFTABLE_ENTRY_CB:
1343 ret = parse_cftable_entry_cb(tuple, &parse->cftable_entry_cb);
1344 break;
1345#endif
1346 case CISTPL_CHECKSUM:
1347 ret = parse_checksum(tuple, &parse->checksum);
1348 break;
1349 case CISTPL_LONGLINK_A:
1350 case CISTPL_LONGLINK_C:
1351 ret = parse_longlink(tuple, &parse->longlink);
1352 break;
1353 case CISTPL_LONGLINK_MFC:
1354 ret = parse_longlink_mfc(tuple, &parse->longlink_mfc);
1355 break;
1356 case CISTPL_VERS_1:
1357 ret = parse_vers_1(tuple, &parse->version_1);
1358 break;
1359 case CISTPL_ALTSTR:
1360 ret = parse_altstr(tuple, &parse->altstr);
1361 break;
1362 case CISTPL_JEDEC_A:
1363 case CISTPL_JEDEC_C:
1364 ret = parse_jedec(tuple, &parse->jedec);
1365 break;
1366 case CISTPL_MANFID:
1367 ret = parse_manfid(tuple, &parse->manfid);
1368 break;
1369 case CISTPL_FUNCID:
1370 ret = parse_funcid(tuple, &parse->funcid);
1371 break;
1372 case CISTPL_FUNCE:
1373 ret = parse_funce(tuple, &parse->funce);
1374 break;
1375 case CISTPL_CONFIG:
1376 ret = parse_config(tuple, &parse->config);
1377 break;
1378 case CISTPL_CFTABLE_ENTRY:
1379 ret = parse_cftable_entry(tuple, &parse->cftable_entry);
1380 break;
1381 case CISTPL_DEVICE_GEO:
1382 case CISTPL_DEVICE_GEO_A:
1383 ret = parse_device_geo(tuple, &parse->device_geo);
1384 break;
1385 case CISTPL_VERS_2:
1386 ret = parse_vers_2(tuple, &parse->vers_2);
1387 break;
1388 case CISTPL_ORG:
1389 ret = parse_org(tuple, &parse->org);
1390 break;
1391 case CISTPL_FORMAT:
1392 case CISTPL_FORMAT_A:
1393 ret = parse_format(tuple, &parse->format);
1394 break;
1395 case CISTPL_NO_LINK:
1396 case CISTPL_LINKTARGET:
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001397 ret = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001398 break;
1399 default:
Dominik Brodowskide6405e2008-08-03 10:47:59 +02001400 ret = -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001401 break;
1402 }
1403 return ret;
1404}
1405EXPORT_SYMBOL(pccard_parse_tuple);
1406
1407/*======================================================================
1408
1409 This is used internally by Card Services to look up CIS stuff.
1410
1411======================================================================*/
1412
1413int pccard_read_tuple(struct pcmcia_socket *s, unsigned int function, cisdata_t code, void *parse)
1414{
1415 tuple_t tuple;
1416 cisdata_t *buf;
1417 int ret;
1418
1419 buf = kmalloc(256, GFP_KERNEL);
Dominik Brodowski11683862008-08-03 10:22:47 +02001420 if (buf == NULL) {
1421 dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
1422 return -ENOMEM;
1423 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001424 tuple.DesiredTuple = code;
1425 tuple.Attributes = TUPLE_RETURN_COMMON;
1426 ret = pccard_get_first_tuple(s, function, &tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001427 if (ret != 0)
1428 goto done;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001429 tuple.TupleData = buf;
1430 tuple.TupleOffset = 0;
1431 tuple.TupleDataMax = 255;
1432 ret = pccard_get_tuple_data(s, &tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001433 if (ret != 0)
1434 goto done;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001435 ret = pccard_parse_tuple(&tuple, parse);
1436done:
1437 kfree(buf);
1438 return ret;
1439}
1440EXPORT_SYMBOL(pccard_read_tuple);
1441
1442/*======================================================================
1443
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.
1449
1450======================================================================*/
1451
Dominik Brodowskic5081d52008-06-19 20:12:34 +02001452int pccard_validate_cis(struct pcmcia_socket *s, unsigned int function, unsigned int *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001453{
1454 tuple_t *tuple;
1455 cisparse_t *p;
Dominik Brodowskic5081d52008-06-19 20:12:34 +02001456 unsigned int count = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001457 int ret, reserved, dev_ok = 0, ident_ok = 0;
1458
1459 if (!s)
1460 return CS_BAD_HANDLE;
1461
1462 tuple = kmalloc(sizeof(*tuple), GFP_KERNEL);
Dominik Brodowski11683862008-08-03 10:22:47 +02001463 if (tuple == NULL) {
1464 dev_printk(KERN_WARNING, &s->dev, "no memory to validate CIS\n");
1465 return -ENOMEM;
1466 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001467 p = kmalloc(sizeof(*p), GFP_KERNEL);
1468 if (p == NULL) {
Dominik Brodowski11683862008-08-03 10:22:47 +02001469 kfree(tuple);
1470 dev_printk(KERN_WARNING, &s->dev, "no memory to validate CIS\n");
1471 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001472 }
1473
Dominik Brodowskic5081d52008-06-19 20:12:34 +02001474 count = reserved = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001475 tuple->DesiredTuple = RETURN_FIRST_TUPLE;
1476 tuple->Attributes = TUPLE_RETURN_COMMON;
1477 ret = pccard_get_first_tuple(s, function, tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001478 if (ret != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001479 goto done;
1480
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) ||
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001484 (pccard_read_tuple(s, function, CISTPL_CFTABLE_ENTRY, p) == 0) ||
1485 (pccard_read_tuple(s, function, CISTPL_CFTABLE_ENTRY_CB, p) == 0))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001486 dev_ok++;
1487
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. */
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001491 if ((pccard_read_tuple(s, function, CISTPL_MANFID, p) == 0) ||
1492 (pccard_read_tuple(s, function, CISTPL_VERS_1, p) == 0) ||
Linus Torvalds1da177e2005-04-16 15:20:36 -07001493 (pccard_read_tuple(s, function, CISTPL_VERS_2, p) != CS_NO_MORE_ITEMS))
1494 ident_ok++;
1495
1496 if (!dev_ok && !ident_ok)
1497 goto done;
1498
Dominik Brodowskic5081d52008-06-19 20:12:34 +02001499 for (count = 1; count < MAX_TUPLES; count++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001500 ret = pccard_get_next_tuple(s, function, tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001501 if (ret != 0)
1502 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001503 if (((tuple->TupleCode > 0x23) && (tuple->TupleCode < 0x40)) ||
1504 ((tuple->TupleCode > 0x47) && (tuple->TupleCode < 0x80)) ||
1505 ((tuple->TupleCode > 0x90) && (tuple->TupleCode < 0xff)))
1506 reserved++;
1507 }
Marc Zyngier002b90a2008-07-15 15:26:15 +02001508 if ((count == MAX_TUPLES) || (reserved > 5) ||
Dominik Brodowskic5081d52008-06-19 20:12:34 +02001509 ((!dev_ok || !ident_ok) && (count > 10)))
1510 count = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001511
1512done:
Dominik Brodowskic5081d52008-06-19 20:12:34 +02001513 if (info)
1514 *info = count;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001515 kfree(tuple);
1516 kfree(p);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001517 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001518}
1519EXPORT_SYMBOL(pccard_validate_cis);