blob: a8323cb2e34d5292233633173afc0eb3d837a6ac [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>
Dominik Brodowski9fea84f2009-12-07 22:11:45 +010026#include <linux/io.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070027#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.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100128
Linus Torvalds1da177e2005-04-16 15:20:36 -0700129======================================================================*/
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;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100140
Dominik Brodowskid50dbec2009-10-23 12:51:28 +0200141 dev_dbg(&s->dev, "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 }
Dominik Brodowskid50dbec2009-10-23 12:51:28 +0200193 dev_dbg(&s->dev, " %#2.2x %#2.2x %#2.2x %#2.2x ...\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194 *(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;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100206
Dominik Brodowskid50dbec2009-10-23 12:51:28 +0200207 dev_dbg(&s->dev, "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.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100265
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266======================================================================*/
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
Dominik Brodowski904e3772010-01-02 12:28:04 +0100322/**
323 * destroy_cis_cache() - destroy the CIS cache
324 * @s: pcmcia_socket for which CIS cache shall be destroyed
325 *
326 * This destroys the CIS cache but keeps any fake CIS alive.
327 */
328
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329void destroy_cis_cache(struct pcmcia_socket *s)
330{
331 struct list_head *l, *n;
Dominik Brodowski904e3772010-01-02 12:28:04 +0100332 struct cis_cache_entry *cis;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333
334 list_for_each_safe(l, n, &s->cis_cache) {
Dominik Brodowski904e3772010-01-02 12:28:04 +0100335 cis = list_entry(l, struct cis_cache_entry, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336 list_del(&cis->node);
337 kfree(cis);
338 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339}
340EXPORT_SYMBOL(destroy_cis_cache);
341
342/*======================================================================
343
344 This verifies if the CIS of a card matches what is in the CIS
345 cache.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100346
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347======================================================================*/
348
349int verify_cis_cache(struct pcmcia_socket *s)
350{
351 struct cis_cache_entry *cis;
352 char *buf;
353
354 buf = kmalloc(256, GFP_KERNEL);
Dominik Brodowskie6895972008-11-02 19:55:45 +0100355 if (buf == NULL) {
Dominik Brodowski11683862008-08-03 10:22:47 +0200356 dev_printk(KERN_WARNING, &s->dev,
357 "no memory for verifying CIS\n");
358 return -ENOMEM;
Dominik Brodowskie6895972008-11-02 19:55:45 +0100359 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360 list_for_each_entry(cis, &s->cis_cache, node) {
361 int len = cis->len;
362
363 if (len > 256)
364 len = 256;
365#ifdef CONFIG_CARDBUS
366 if (s->state & SOCKET_CARDBUS)
367 read_cb_mem(s, cis->attr, cis->addr, len, buf);
368 else
369#endif
Dominik Brodowskie6ea0b92005-06-27 16:28:52 -0700370 pcmcia_read_cis_mem(s, cis->attr, cis->addr, len, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371
372 if (memcmp(buf, cis->cache, len) != 0) {
373 kfree(buf);
374 return -1;
375 }
376 }
377 kfree(buf);
378 return 0;
379}
Dominik Brodowski88b060d2010-01-02 14:14:23 +0100380EXPORT_SYMBOL(verify_cis_cache);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381
382/*======================================================================
383
384 For really bad cards, we provide a facility for uploading a
385 replacement CIS.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100386
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387======================================================================*/
388
Dominik Brodowski53efec92008-07-28 19:44:05 +0200389int pcmcia_replace_cis(struct pcmcia_socket *s,
390 const u8 *data, const size_t len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391{
Dominik Brodowski11683862008-08-03 10:22:47 +0200392 if (len > CISTPL_MAX_CIS_SIZE) {
393 dev_printk(KERN_WARNING, &s->dev, "replacement CIS too big\n");
394 return -EINVAL;
395 }
396 kfree(s->fake_cis);
397 s->fake_cis = kmalloc(len, GFP_KERNEL);
398 if (s->fake_cis == NULL) {
399 dev_printk(KERN_WARNING, &s->dev, "no memory to replace CIS\n");
400 return -ENOMEM;
401 }
402 s->fake_cis_len = len;
403 memcpy(s->fake_cis, data, len);
404 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405}
Dominik Brodowski33519dd2005-06-27 16:28:53 -0700406EXPORT_SYMBOL(pcmcia_replace_cis);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407
408/*======================================================================
409
410 The high-level CIS tuple services
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100411
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412======================================================================*/
413
414typedef struct tuple_flags {
415 u_int link_space:4;
416 u_int has_link:1;
417 u_int mfc_fn:3;
418 u_int space:4;
419} tuple_flags;
420
421#define LINK_SPACE(f) (((tuple_flags *)(&(f)))->link_space)
422#define HAS_LINK(f) (((tuple_flags *)(&(f)))->has_link)
423#define MFC_FN(f) (((tuple_flags *)(&(f)))->mfc_fn)
424#define SPACE(f) (((tuple_flags *)(&(f)))->space)
425
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426int pccard_get_first_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
427{
428 if (!s)
Dominik Brodowskiffb8da22008-08-03 11:18:00 +0200429 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700430 if (!(s->state & SOCKET_PRESENT))
Dominik Brodowski3939c1ef2008-08-03 11:10:56 +0200431 return -ENODEV;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700432 tuple->TupleLink = tuple->Flags = 0;
433#ifdef CONFIG_CARDBUS
434 if (s->state & SOCKET_CARDBUS) {
435 struct pci_dev *dev = s->cb_dev;
436 u_int ptr;
437 pci_bus_read_config_dword(dev->subordinate, 0, PCI_CARDBUS_CIS, &ptr);
438 tuple->CISOffset = ptr & ~7;
439 SPACE(tuple->Flags) = (ptr & 7);
440 } else
441#endif
442 {
443 /* Assume presence of a LONGLINK_C to address 0 */
444 tuple->CISOffset = tuple->LinkOffset = 0;
445 SPACE(tuple->Flags) = HAS_LINK(tuple->Flags) = 1;
446 }
447 if (!(s->state & SOCKET_CARDBUS) && (s->functions > 1) &&
448 !(tuple->Attributes & TUPLE_RETURN_COMMON)) {
449 cisdata_t req = tuple->DesiredTuple;
450 tuple->DesiredTuple = CISTPL_LONGLINK_MFC;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200451 if (pccard_get_next_tuple(s, function, tuple) == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700452 tuple->DesiredTuple = CISTPL_LINKTARGET;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200453 if (pccard_get_next_tuple(s, function, tuple) != 0)
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200454 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455 } else
456 tuple->CISOffset = tuple->TupleLink = 0;
457 tuple->DesiredTuple = req;
458 }
459 return pccard_get_next_tuple(s, function, tuple);
460}
461EXPORT_SYMBOL(pccard_get_first_tuple);
462
463static int follow_link(struct pcmcia_socket *s, tuple_t *tuple)
464{
465 u_char link[5];
466 u_int ofs;
467
468 if (MFC_FN(tuple->Flags)) {
469 /* Get indirect link from the MFC tuple */
470 read_cis_cache(s, LINK_SPACE(tuple->Flags),
471 tuple->LinkOffset, 5, link);
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700472 ofs = get_unaligned_le32(link + 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473 SPACE(tuple->Flags) = (link[0] == CISTPL_MFC_ATTR);
474 /* Move to the next indirect link */
475 tuple->LinkOffset += 5;
476 MFC_FN(tuple->Flags)--;
477 } else if (HAS_LINK(tuple->Flags)) {
478 ofs = tuple->LinkOffset;
479 SPACE(tuple->Flags) = LINK_SPACE(tuple->Flags);
480 HAS_LINK(tuple->Flags) = 0;
481 } else {
482 return -1;
483 }
484 if (!(s->state & SOCKET_CARDBUS) && SPACE(tuple->Flags)) {
485 /* This is ugly, but a common CIS error is to code the long
486 link offset incorrectly, so we check the right spot... */
487 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
488 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
489 (strncmp(link+2, "CIS", 3) == 0))
490 return ofs;
491 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
492 /* Then, we try the wrong spot... */
493 ofs = ofs >> 1;
494 }
495 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
496 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
497 (strncmp(link+2, "CIS", 3) == 0))
498 return ofs;
499 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
500 return -1;
501}
502
503int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
504{
505 u_char link[2], tmp;
506 int ofs, i, attr;
507
508 if (!s)
Dominik Brodowskiffb8da22008-08-03 11:18:00 +0200509 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510 if (!(s->state & SOCKET_PRESENT))
Dominik Brodowski3939c1ef2008-08-03 11:10:56 +0200511 return -ENODEV;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512
513 link[1] = tuple->TupleLink;
514 ofs = tuple->CISOffset + tuple->TupleLink;
515 attr = SPACE(tuple->Flags);
516
517 for (i = 0; i < MAX_TUPLES; i++) {
518 if (link[1] == 0xff) {
519 link[0] = CISTPL_END;
520 } else {
521 read_cis_cache(s, attr, ofs, 2, link);
522 if (link[0] == CISTPL_NULL) {
523 ofs++; continue;
524 }
525 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100526
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527 /* End of chain? Follow long link if possible */
528 if (link[0] == CISTPL_END) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100529 ofs = follow_link(s, tuple);
530 if (ofs < 0)
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200531 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532 attr = SPACE(tuple->Flags);
533 read_cis_cache(s, attr, ofs, 2, link);
534 }
535
536 /* Is this a link tuple? Make a note of it */
537 if ((link[0] == CISTPL_LONGLINK_A) ||
538 (link[0] == CISTPL_LONGLINK_C) ||
539 (link[0] == CISTPL_LONGLINK_MFC) ||
540 (link[0] == CISTPL_LINKTARGET) ||
541 (link[0] == CISTPL_INDIRECT) ||
542 (link[0] == CISTPL_NO_LINK)) {
543 switch (link[0]) {
544 case CISTPL_LONGLINK_A:
545 HAS_LINK(tuple->Flags) = 1;
546 LINK_SPACE(tuple->Flags) = attr | IS_ATTR;
547 read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset);
548 break;
549 case CISTPL_LONGLINK_C:
550 HAS_LINK(tuple->Flags) = 1;
551 LINK_SPACE(tuple->Flags) = attr & ~IS_ATTR;
552 read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset);
553 break;
554 case CISTPL_INDIRECT:
555 HAS_LINK(tuple->Flags) = 1;
556 LINK_SPACE(tuple->Flags) = IS_ATTR | IS_INDIRECT;
557 tuple->LinkOffset = 0;
558 break;
559 case CISTPL_LONGLINK_MFC:
560 tuple->LinkOffset = ofs + 3;
561 LINK_SPACE(tuple->Flags) = attr;
562 if (function == BIND_FN_ALL) {
563 /* Follow all the MFC links */
564 read_cis_cache(s, attr, ofs+2, 1, &tmp);
565 MFC_FN(tuple->Flags) = tmp;
566 } else {
567 /* Follow exactly one of the links */
568 MFC_FN(tuple->Flags) = 1;
569 tuple->LinkOffset += function * 5;
570 }
571 break;
572 case CISTPL_NO_LINK:
573 HAS_LINK(tuple->Flags) = 0;
574 break;
575 }
576 if ((tuple->Attributes & TUPLE_RETURN_LINK) &&
577 (tuple->DesiredTuple == RETURN_FIRST_TUPLE))
578 break;
579 } else
580 if (tuple->DesiredTuple == RETURN_FIRST_TUPLE)
581 break;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100582
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583 if (link[0] == tuple->DesiredTuple)
584 break;
585 ofs += link[1] + 2;
586 }
587 if (i == MAX_TUPLES) {
Dominik Brodowskid50dbec2009-10-23 12:51:28 +0200588 dev_dbg(&s->dev, "cs: overrun in pcmcia_get_next_tuple\n");
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200589 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700590 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100591
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592 tuple->TupleCode = link[0];
593 tuple->TupleLink = link[1];
594 tuple->CISOffset = ofs + 2;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200595 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700596}
597EXPORT_SYMBOL(pccard_get_next_tuple);
598
599/*====================================================================*/
600
601#define _MIN(a, b) (((a) < (b)) ? (a) : (b))
602
603int pccard_get_tuple_data(struct pcmcia_socket *s, tuple_t *tuple)
604{
605 u_int len;
606
607 if (!s)
Dominik Brodowskiffb8da22008-08-03 11:18:00 +0200608 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609
610 if (tuple->TupleLink < tuple->TupleOffset)
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200611 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612 len = tuple->TupleLink - tuple->TupleOffset;
613 tuple->TupleDataLen = tuple->TupleLink;
614 if (len == 0)
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200615 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616 read_cis_cache(s, SPACE(tuple->Flags),
617 tuple->CISOffset + tuple->TupleOffset,
618 _MIN(len, tuple->TupleDataMax), tuple->TupleData);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200619 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700620}
621EXPORT_SYMBOL(pccard_get_tuple_data);
622
623
624/*======================================================================
625
626 Parsing routines for individual tuples
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100627
Linus Torvalds1da177e2005-04-16 15:20:36 -0700628======================================================================*/
629
630static int parse_device(tuple_t *tuple, cistpl_device_t *device)
631{
632 int i;
633 u_char scale;
634 u_char *p, *q;
635
636 p = (u_char *)tuple->TupleData;
637 q = p + tuple->TupleDataLen;
638
639 device->ndev = 0;
640 for (i = 0; i < CISTPL_MAX_DEVICES; i++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100641
642 if (*p == 0xff)
643 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700644 device->dev[i].type = (*p >> 4);
645 device->dev[i].wp = (*p & 0x08) ? 1 : 0;
646 switch (*p & 0x07) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100647 case 0:
648 device->dev[i].speed = 0;
649 break;
650 case 1:
651 device->dev[i].speed = 250;
652 break;
653 case 2:
654 device->dev[i].speed = 200;
655 break;
656 case 3:
657 device->dev[i].speed = 150;
658 break;
659 case 4:
660 device->dev[i].speed = 100;
661 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700662 case 7:
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200663 if (++p == q)
664 return -EINVAL;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100665 device->dev[i].speed = SPEED_CVT(*p);
666 while (*p & 0x80)
667 if (++p == q)
668 return -EINVAL;
669 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670 default:
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100671 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700672 }
673
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200674 if (++p == q)
675 return -EINVAL;
676 if (*p == 0xff)
677 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700678 scale = *p & 7;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200679 if (scale == 7)
680 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700681 device->dev[i].size = ((*p >> 3) + 1) * (512 << (scale*2));
682 device->ndev++;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200683 if (++p == q)
684 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100686
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200687 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700688}
689
690/*====================================================================*/
691
692static int parse_checksum(tuple_t *tuple, cistpl_checksum_t *csum)
693{
694 u_char *p;
695 if (tuple->TupleDataLen < 5)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200696 return -EINVAL;
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700697 p = (u_char *) tuple->TupleData;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700698 csum->addr = tuple->CISOffset + get_unaligned_le16(p) - 2;
699 csum->len = get_unaligned_le16(p + 2);
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700700 csum->sum = *(p + 4);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200701 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700702}
703
704/*====================================================================*/
705
706static int parse_longlink(tuple_t *tuple, cistpl_longlink_t *link)
707{
708 if (tuple->TupleDataLen < 4)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200709 return -EINVAL;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700710 link->addr = get_unaligned_le32(tuple->TupleData);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200711 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712}
713
714/*====================================================================*/
715
716static int parse_longlink_mfc(tuple_t *tuple,
717 cistpl_longlink_mfc_t *link)
718{
719 u_char *p;
720 int i;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100721
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 p = (u_char *)tuple->TupleData;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100723
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724 link->nfn = *p; p++;
725 if (tuple->TupleDataLen <= link->nfn*5)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200726 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700727 for (i = 0; i < link->nfn; i++) {
728 link->fn[i].space = *p; p++;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700729 link->fn[i].addr = get_unaligned_le32(p);
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700730 p += 4;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731 }
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200732 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733}
734
735/*====================================================================*/
736
737static int parse_strings(u_char *p, u_char *q, int max,
738 char *s, u_char *ofs, u_char *found)
739{
740 int i, j, ns;
741
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200742 if (p == q)
743 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744 ns = 0; j = 0;
745 for (i = 0; i < max; i++) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200746 if (*p == 0xff)
747 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700748 ofs[i] = j;
749 ns++;
750 for (;;) {
751 s[j++] = (*p == 0xff) ? '\0' : *p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100752 if ((*p == '\0') || (*p == 0xff))
753 break;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200754 if (++p == q)
755 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100757 if ((*p == 0xff) || (++p == q))
758 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700759 }
760 if (found) {
761 *found = ns;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200762 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700763 } else {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200764 return (ns == max) ? 0 : -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700765 }
766}
767
768/*====================================================================*/
769
770static int parse_vers_1(tuple_t *tuple, cistpl_vers_1_t *vers_1)
771{
772 u_char *p, *q;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100773
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774 p = (u_char *)tuple->TupleData;
775 q = p + tuple->TupleDataLen;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100776
Linus Torvalds1da177e2005-04-16 15:20:36 -0700777 vers_1->major = *p; p++;
778 vers_1->minor = *p; p++;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200779 if (p >= q)
780 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700781
782 return parse_strings(p, q, CISTPL_VERS_1_MAX_PROD_STRINGS,
783 vers_1->str, vers_1->ofs, &vers_1->ns);
784}
785
786/*====================================================================*/
787
788static int parse_altstr(tuple_t *tuple, cistpl_altstr_t *altstr)
789{
790 u_char *p, *q;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100791
Linus Torvalds1da177e2005-04-16 15:20:36 -0700792 p = (u_char *)tuple->TupleData;
793 q = p + tuple->TupleDataLen;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100794
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795 return parse_strings(p, q, CISTPL_MAX_ALTSTR_STRINGS,
796 altstr->str, altstr->ofs, &altstr->ns);
797}
798
799/*====================================================================*/
800
801static int parse_jedec(tuple_t *tuple, cistpl_jedec_t *jedec)
802{
803 u_char *p, *q;
804 int nid;
805
806 p = (u_char *)tuple->TupleData;
807 q = p + tuple->TupleDataLen;
808
809 for (nid = 0; nid < CISTPL_MAX_DEVICES; nid++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100810 if (p > q-2)
811 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700812 jedec->id[nid].mfr = p[0];
813 jedec->id[nid].info = p[1];
814 p += 2;
815 }
816 jedec->nid = nid;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200817 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700818}
819
820/*====================================================================*/
821
822static int parse_manfid(tuple_t *tuple, cistpl_manfid_t *m)
823{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700824 if (tuple->TupleDataLen < 4)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200825 return -EINVAL;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700826 m->manf = get_unaligned_le16(tuple->TupleData);
827 m->card = get_unaligned_le16(tuple->TupleData + 2);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200828 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700829}
830
831/*====================================================================*/
832
833static int parse_funcid(tuple_t *tuple, cistpl_funcid_t *f)
834{
835 u_char *p;
836 if (tuple->TupleDataLen < 2)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200837 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700838 p = (u_char *)tuple->TupleData;
839 f->func = p[0];
840 f->sysinit = p[1];
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200841 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700842}
843
844/*====================================================================*/
845
846static int parse_funce(tuple_t *tuple, cistpl_funce_t *f)
847{
848 u_char *p;
849 int i;
850 if (tuple->TupleDataLen < 1)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200851 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700852 p = (u_char *)tuple->TupleData;
853 f->type = p[0];
854 for (i = 1; i < tuple->TupleDataLen; i++)
855 f->data[i-1] = p[i];
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200856 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700857}
858
859/*====================================================================*/
860
861static int parse_config(tuple_t *tuple, cistpl_config_t *config)
862{
863 int rasz, rmsz, i;
864 u_char *p;
865
866 p = (u_char *)tuple->TupleData;
867 rasz = *p & 0x03;
868 rmsz = (*p & 0x3c) >> 2;
869 if (tuple->TupleDataLen < rasz+rmsz+4)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200870 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700871 config->last_idx = *(++p);
872 p++;
873 config->base = 0;
874 for (i = 0; i <= rasz; i++)
875 config->base += p[i] << (8*i);
876 p += rasz+1;
877 for (i = 0; i < 4; i++)
878 config->rmask[i] = 0;
879 for (i = 0; i <= rmsz; i++)
880 config->rmask[i>>2] += p[i] << (8*(i%4));
881 config->subtuples = tuple->TupleDataLen - (rasz+rmsz+4);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200882 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883}
884
885/*======================================================================
886
887 The following routines are all used to parse the nightmarish
888 config table entries.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100889
Linus Torvalds1da177e2005-04-16 15:20:36 -0700890======================================================================*/
891
892static u_char *parse_power(u_char *p, u_char *q,
893 cistpl_power_t *pwr)
894{
895 int i;
896 u_int scale;
897
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100898 if (p == q)
899 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700900 pwr->present = *p;
901 pwr->flags = 0;
902 p++;
903 for (i = 0; i < 7; i++)
904 if (pwr->present & (1<<i)) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100905 if (p == q)
906 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700907 pwr->param[i] = POWER_CVT(*p);
908 scale = POWER_SCALE(*p);
909 while (*p & 0x80) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100910 if (++p == q)
911 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700912 if ((*p & 0x7f) < 100)
913 pwr->param[i] += (*p & 0x7f) * scale / 100;
914 else if (*p == 0x7d)
915 pwr->flags |= CISTPL_POWER_HIGHZ_OK;
916 else if (*p == 0x7e)
917 pwr->param[i] = 0;
918 else if (*p == 0x7f)
919 pwr->flags |= CISTPL_POWER_HIGHZ_REQ;
920 else
921 return NULL;
922 }
923 p++;
924 }
925 return p;
926}
927
928/*====================================================================*/
929
930static u_char *parse_timing(u_char *p, u_char *q,
931 cistpl_timing_t *timing)
932{
933 u_char scale;
934
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100935 if (p == q)
936 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700937 scale = *p;
938 if ((scale & 3) != 3) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100939 if (++p == q)
940 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700941 timing->wait = SPEED_CVT(*p);
942 timing->waitscale = exponent[scale & 3];
943 } else
944 timing->wait = 0;
945 scale >>= 2;
946 if ((scale & 7) != 7) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100947 if (++p == q)
948 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700949 timing->ready = SPEED_CVT(*p);
950 timing->rdyscale = exponent[scale & 7];
951 } else
952 timing->ready = 0;
953 scale >>= 3;
954 if (scale != 7) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100955 if (++p == q)
956 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700957 timing->reserved = SPEED_CVT(*p);
958 timing->rsvscale = exponent[scale];
959 } else
960 timing->reserved = 0;
961 p++;
962 return p;
963}
964
965/*====================================================================*/
966
967static u_char *parse_io(u_char *p, u_char *q, cistpl_io_t *io)
968{
969 int i, j, bsz, lsz;
970
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100971 if (p == q)
972 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700973 io->flags = *p;
974
975 if (!(*p & 0x80)) {
976 io->nwin = 1;
977 io->win[0].base = 0;
978 io->win[0].len = (1 << (io->flags & CISTPL_IO_LINES_MASK));
979 return p+1;
980 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100981
982 if (++p == q)
983 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700984 io->nwin = (*p & 0x0f) + 1;
985 bsz = (*p & 0x30) >> 4;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100986 if (bsz == 3)
987 bsz++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700988 lsz = (*p & 0xc0) >> 6;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100989 if (lsz == 3)
990 lsz++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700991 p++;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100992
Linus Torvalds1da177e2005-04-16 15:20:36 -0700993 for (i = 0; i < io->nwin; i++) {
994 io->win[i].base = 0;
995 io->win[i].len = 1;
996 for (j = 0; j < bsz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100997 if (p == q)
998 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700999 io->win[i].base += *p << (j*8);
1000 }
1001 for (j = 0; j < lsz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001002 if (p == q)
1003 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001004 io->win[i].len += *p << (j*8);
1005 }
1006 }
1007 return p;
1008}
1009
1010/*====================================================================*/
1011
1012static u_char *parse_mem(u_char *p, u_char *q, cistpl_mem_t *mem)
1013{
1014 int i, j, asz, lsz, has_ha;
1015 u_int len, ca, ha;
1016
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001017 if (p == q)
1018 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001019
1020 mem->nwin = (*p & 0x07) + 1;
1021 lsz = (*p & 0x18) >> 3;
1022 asz = (*p & 0x60) >> 5;
1023 has_ha = (*p & 0x80);
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001024 if (++p == q)
1025 return NULL;
1026
Linus Torvalds1da177e2005-04-16 15:20:36 -07001027 for (i = 0; i < mem->nwin; i++) {
1028 len = ca = ha = 0;
1029 for (j = 0; j < lsz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001030 if (p == q)
1031 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001032 len += *p << (j*8);
1033 }
1034 for (j = 0; j < asz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001035 if (p == q)
1036 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001037 ca += *p << (j*8);
1038 }
1039 if (has_ha)
1040 for (j = 0; j < asz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001041 if (p == q)
1042 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001043 ha += *p << (j*8);
1044 }
1045 mem->win[i].len = len << 8;
1046 mem->win[i].card_addr = ca << 8;
1047 mem->win[i].host_addr = ha << 8;
1048 }
1049 return p;
1050}
1051
1052/*====================================================================*/
1053
1054static u_char *parse_irq(u_char *p, u_char *q, cistpl_irq_t *irq)
1055{
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001056 if (p == q)
1057 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001058 irq->IRQInfo1 = *p; p++;
1059 if (irq->IRQInfo1 & IRQ_INFO2_VALID) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001060 if (p+2 > q)
1061 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001062 irq->IRQInfo2 = (p[1]<<8) + p[0];
1063 p += 2;
1064 }
1065 return p;
1066}
1067
1068/*====================================================================*/
1069
1070static int parse_cftable_entry(tuple_t *tuple,
1071 cistpl_cftable_entry_t *entry)
1072{
1073 u_char *p, *q, features;
1074
1075 p = tuple->TupleData;
1076 q = p + tuple->TupleDataLen;
1077 entry->index = *p & 0x3f;
1078 entry->flags = 0;
1079 if (*p & 0x40)
1080 entry->flags |= CISTPL_CFTABLE_DEFAULT;
1081 if (*p & 0x80) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001082 if (++p == q)
1083 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001084 if (*p & 0x10)
1085 entry->flags |= CISTPL_CFTABLE_BVDS;
1086 if (*p & 0x20)
1087 entry->flags |= CISTPL_CFTABLE_WP;
1088 if (*p & 0x40)
1089 entry->flags |= CISTPL_CFTABLE_RDYBSY;
1090 if (*p & 0x80)
1091 entry->flags |= CISTPL_CFTABLE_MWAIT;
1092 entry->interface = *p & 0x0f;
1093 } else
1094 entry->interface = 0;
1095
1096 /* Process optional features */
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001097 if (++p == q)
1098 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001099 features = *p; p++;
1100
1101 /* Power options */
1102 if ((features & 3) > 0) {
1103 p = parse_power(p, q, &entry->vcc);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001104 if (p == NULL)
1105 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001106 } else
1107 entry->vcc.present = 0;
1108 if ((features & 3) > 1) {
1109 p = parse_power(p, q, &entry->vpp1);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001110 if (p == NULL)
1111 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001112 } else
1113 entry->vpp1.present = 0;
1114 if ((features & 3) > 2) {
1115 p = parse_power(p, q, &entry->vpp2);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001116 if (p == NULL)
1117 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001118 } else
1119 entry->vpp2.present = 0;
1120
1121 /* Timing options */
1122 if (features & 0x04) {
1123 p = parse_timing(p, q, &entry->timing);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001124 if (p == NULL)
1125 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001126 } else {
1127 entry->timing.wait = 0;
1128 entry->timing.ready = 0;
1129 entry->timing.reserved = 0;
1130 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001131
Linus Torvalds1da177e2005-04-16 15:20:36 -07001132 /* I/O window options */
1133 if (features & 0x08) {
1134 p = parse_io(p, q, &entry->io);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001135 if (p == NULL)
1136 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001137 } else
1138 entry->io.nwin = 0;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001139
Linus Torvalds1da177e2005-04-16 15:20:36 -07001140 /* Interrupt options */
1141 if (features & 0x10) {
1142 p = parse_irq(p, q, &entry->irq);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001143 if (p == NULL)
1144 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001145 } else
1146 entry->irq.IRQInfo1 = 0;
1147
1148 switch (features & 0x60) {
1149 case 0x00:
1150 entry->mem.nwin = 0;
1151 break;
1152 case 0x20:
1153 entry->mem.nwin = 1;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001154 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001155 entry->mem.win[0].card_addr = 0;
1156 entry->mem.win[0].host_addr = 0;
1157 p += 2;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001158 if (p > q)
1159 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001160 break;
1161 case 0x40:
1162 entry->mem.nwin = 1;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001163 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
1164 entry->mem.win[0].card_addr = get_unaligned_le16(p + 2) << 8;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001165 entry->mem.win[0].host_addr = 0;
1166 p += 4;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001167 if (p > q)
1168 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001169 break;
1170 case 0x60:
1171 p = parse_mem(p, q, &entry->mem);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001172 if (p == NULL)
1173 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001174 break;
1175 }
1176
1177 /* Misc features */
1178 if (features & 0x80) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001179 if (p == q)
1180 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001181 entry->flags |= (*p << 8);
1182 while (*p & 0x80)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001183 if (++p == q)
1184 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001185 p++;
1186 }
1187
1188 entry->subtuples = q-p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001189
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001190 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001191}
1192
1193/*====================================================================*/
1194
1195#ifdef CONFIG_CARDBUS
1196
1197static int parse_bar(tuple_t *tuple, cistpl_bar_t *bar)
1198{
1199 u_char *p;
1200 if (tuple->TupleDataLen < 6)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001201 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001202 p = (u_char *)tuple->TupleData;
1203 bar->attr = *p;
1204 p += 2;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001205 bar->size = get_unaligned_le32(p);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001206 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001207}
1208
1209static int parse_config_cb(tuple_t *tuple, cistpl_config_t *config)
1210{
1211 u_char *p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001212
Linus Torvalds1da177e2005-04-16 15:20:36 -07001213 p = (u_char *)tuple->TupleData;
1214 if ((*p != 3) || (tuple->TupleDataLen < 6))
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001215 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001216 config->last_idx = *(++p);
1217 p++;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001218 config->base = get_unaligned_le32(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001219 config->subtuples = tuple->TupleDataLen - 6;
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001220 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001221}
1222
1223static int parse_cftable_entry_cb(tuple_t *tuple,
1224 cistpl_cftable_entry_cb_t *entry)
1225{
1226 u_char *p, *q, features;
1227
1228 p = tuple->TupleData;
1229 q = p + tuple->TupleDataLen;
1230 entry->index = *p & 0x3f;
1231 entry->flags = 0;
1232 if (*p & 0x40)
1233 entry->flags |= CISTPL_CFTABLE_DEFAULT;
1234
1235 /* Process optional features */
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001236 if (++p == q)
1237 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001238 features = *p; p++;
1239
1240 /* Power options */
1241 if ((features & 3) > 0) {
1242 p = parse_power(p, q, &entry->vcc);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001243 if (p == NULL)
1244 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001245 } else
1246 entry->vcc.present = 0;
1247 if ((features & 3) > 1) {
1248 p = parse_power(p, q, &entry->vpp1);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001249 if (p == NULL)
1250 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001251 } else
1252 entry->vpp1.present = 0;
1253 if ((features & 3) > 2) {
1254 p = parse_power(p, q, &entry->vpp2);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001255 if (p == NULL)
1256 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001257 } else
1258 entry->vpp2.present = 0;
1259
1260 /* I/O window options */
1261 if (features & 0x08) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001262 if (p == q)
1263 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001264 entry->io = *p; p++;
1265 } else
1266 entry->io = 0;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001267
Linus Torvalds1da177e2005-04-16 15:20:36 -07001268 /* Interrupt options */
1269 if (features & 0x10) {
1270 p = parse_irq(p, q, &entry->irq);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001271 if (p == NULL)
1272 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001273 } else
1274 entry->irq.IRQInfo1 = 0;
1275
1276 if (features & 0x20) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001277 if (p == q)
1278 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001279 entry->mem = *p; p++;
1280 } else
1281 entry->mem = 0;
1282
1283 /* Misc features */
1284 if (features & 0x80) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001285 if (p == q)
1286 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001287 entry->flags |= (*p << 8);
1288 if (*p & 0x80) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001289 if (++p == q)
1290 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001291 entry->flags |= (*p << 16);
1292 }
1293 while (*p & 0x80)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001294 if (++p == q)
1295 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001296 p++;
1297 }
1298
1299 entry->subtuples = q-p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001300
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001301 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001302}
1303
1304#endif
1305
1306/*====================================================================*/
1307
1308static int parse_device_geo(tuple_t *tuple, cistpl_device_geo_t *geo)
1309{
1310 u_char *p, *q;
1311 int n;
1312
1313 p = (u_char *)tuple->TupleData;
1314 q = p + tuple->TupleDataLen;
1315
1316 for (n = 0; n < CISTPL_MAX_DEVICES; n++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001317 if (p > q-6)
1318 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001319 geo->geo[n].buswidth = p[0];
1320 geo->geo[n].erase_block = 1 << (p[1]-1);
1321 geo->geo[n].read_block = 1 << (p[2]-1);
1322 geo->geo[n].write_block = 1 << (p[3]-1);
1323 geo->geo[n].partition = 1 << (p[4]-1);
1324 geo->geo[n].interleave = 1 << (p[5]-1);
1325 p += 6;
1326 }
1327 geo->ngeo = n;
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001328 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001329}
1330
1331/*====================================================================*/
1332
1333static int parse_vers_2(tuple_t *tuple, cistpl_vers_2_t *v2)
1334{
1335 u_char *p, *q;
1336
1337 if (tuple->TupleDataLen < 10)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001338 return -EINVAL;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001339
Linus Torvalds1da177e2005-04-16 15:20:36 -07001340 p = tuple->TupleData;
1341 q = p + tuple->TupleDataLen;
1342
1343 v2->vers = p[0];
1344 v2->comply = p[1];
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001345 v2->dindex = get_unaligned_le16(p + 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001346 v2->vspec8 = p[6];
1347 v2->vspec9 = p[7];
1348 v2->nhdr = p[8];
1349 p += 9;
1350 return parse_strings(p, q, 2, v2->str, &v2->vendor, NULL);
1351}
1352
1353/*====================================================================*/
1354
1355static int parse_org(tuple_t *tuple, cistpl_org_t *org)
1356{
1357 u_char *p, *q;
1358 int i;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001359
Linus Torvalds1da177e2005-04-16 15:20:36 -07001360 p = tuple->TupleData;
1361 q = p + tuple->TupleDataLen;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001362 if (p == q)
1363 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001364 org->data_org = *p;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001365 if (++p == q)
1366 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001367 for (i = 0; i < 30; i++) {
1368 org->desc[i] = *p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001369 if (*p == '\0')
1370 break;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001371 if (++p == q)
1372 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001373 }
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001374 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001375}
1376
1377/*====================================================================*/
1378
1379static int parse_format(tuple_t *tuple, cistpl_format_t *fmt)
1380{
1381 u_char *p;
1382
1383 if (tuple->TupleDataLen < 10)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001384 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001385
1386 p = tuple->TupleData;
1387
1388 fmt->type = p[0];
1389 fmt->edc = p[1];
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001390 fmt->offset = get_unaligned_le32(p + 2);
1391 fmt->length = get_unaligned_le32(p + 6);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001392
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001393 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001394}
1395
1396/*====================================================================*/
1397
Dominik Brodowski2f3061e2008-08-31 15:50:33 +02001398int pcmcia_parse_tuple(tuple_t *tuple, cisparse_t *parse)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001399{
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001400 int ret = 0;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001401
Linus Torvalds1da177e2005-04-16 15:20:36 -07001402 if (tuple->TupleDataLen > tuple->TupleDataMax)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001403 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001404 switch (tuple->TupleCode) {
1405 case CISTPL_DEVICE:
1406 case CISTPL_DEVICE_A:
1407 ret = parse_device(tuple, &parse->device);
1408 break;
1409#ifdef CONFIG_CARDBUS
1410 case CISTPL_BAR:
1411 ret = parse_bar(tuple, &parse->bar);
1412 break;
1413 case CISTPL_CONFIG_CB:
1414 ret = parse_config_cb(tuple, &parse->config);
1415 break;
1416 case CISTPL_CFTABLE_ENTRY_CB:
1417 ret = parse_cftable_entry_cb(tuple, &parse->cftable_entry_cb);
1418 break;
1419#endif
1420 case CISTPL_CHECKSUM:
1421 ret = parse_checksum(tuple, &parse->checksum);
1422 break;
1423 case CISTPL_LONGLINK_A:
1424 case CISTPL_LONGLINK_C:
1425 ret = parse_longlink(tuple, &parse->longlink);
1426 break;
1427 case CISTPL_LONGLINK_MFC:
1428 ret = parse_longlink_mfc(tuple, &parse->longlink_mfc);
1429 break;
1430 case CISTPL_VERS_1:
1431 ret = parse_vers_1(tuple, &parse->version_1);
1432 break;
1433 case CISTPL_ALTSTR:
1434 ret = parse_altstr(tuple, &parse->altstr);
1435 break;
1436 case CISTPL_JEDEC_A:
1437 case CISTPL_JEDEC_C:
1438 ret = parse_jedec(tuple, &parse->jedec);
1439 break;
1440 case CISTPL_MANFID:
1441 ret = parse_manfid(tuple, &parse->manfid);
1442 break;
1443 case CISTPL_FUNCID:
1444 ret = parse_funcid(tuple, &parse->funcid);
1445 break;
1446 case CISTPL_FUNCE:
1447 ret = parse_funce(tuple, &parse->funce);
1448 break;
1449 case CISTPL_CONFIG:
1450 ret = parse_config(tuple, &parse->config);
1451 break;
1452 case CISTPL_CFTABLE_ENTRY:
1453 ret = parse_cftable_entry(tuple, &parse->cftable_entry);
1454 break;
1455 case CISTPL_DEVICE_GEO:
1456 case CISTPL_DEVICE_GEO_A:
1457 ret = parse_device_geo(tuple, &parse->device_geo);
1458 break;
1459 case CISTPL_VERS_2:
1460 ret = parse_vers_2(tuple, &parse->vers_2);
1461 break;
1462 case CISTPL_ORG:
1463 ret = parse_org(tuple, &parse->org);
1464 break;
1465 case CISTPL_FORMAT:
1466 case CISTPL_FORMAT_A:
1467 ret = parse_format(tuple, &parse->format);
1468 break;
1469 case CISTPL_NO_LINK:
1470 case CISTPL_LINKTARGET:
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001471 ret = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001472 break;
1473 default:
Dominik Brodowskide6405e2008-08-03 10:47:59 +02001474 ret = -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001475 break;
1476 }
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001477 if (ret)
Dominik Brodowskid50dbec2009-10-23 12:51:28 +02001478 pr_debug("parse_tuple failed %d\n", ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001479 return ret;
1480}
Dominik Brodowski2f3061e2008-08-31 15:50:33 +02001481EXPORT_SYMBOL(pcmcia_parse_tuple);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001482
1483/*======================================================================
1484
1485 This is used internally by Card Services to look up CIS stuff.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001486
Linus Torvalds1da177e2005-04-16 15:20:36 -07001487======================================================================*/
1488
1489int pccard_read_tuple(struct pcmcia_socket *s, unsigned int function, cisdata_t code, void *parse)
1490{
1491 tuple_t tuple;
1492 cisdata_t *buf;
1493 int ret;
1494
1495 buf = kmalloc(256, GFP_KERNEL);
Dominik Brodowski11683862008-08-03 10:22:47 +02001496 if (buf == NULL) {
1497 dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
1498 return -ENOMEM;
1499 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001500 tuple.DesiredTuple = code;
Dominik Brodowski84897fc2009-10-18 23:51:09 +02001501 tuple.Attributes = 0;
1502 if (function == BIND_FN_ALL)
1503 tuple.Attributes = TUPLE_RETURN_COMMON;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001504 ret = pccard_get_first_tuple(s, function, &tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001505 if (ret != 0)
1506 goto done;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001507 tuple.TupleData = buf;
1508 tuple.TupleOffset = 0;
1509 tuple.TupleDataMax = 255;
1510 ret = pccard_get_tuple_data(s, &tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001511 if (ret != 0)
1512 goto done;
Dominik Brodowski2f3061e2008-08-31 15:50:33 +02001513 ret = pcmcia_parse_tuple(&tuple, parse);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001514done:
1515 kfree(buf);
1516 return ret;
1517}
1518EXPORT_SYMBOL(pccard_read_tuple);
1519
Dominik Brodowski91284222009-10-18 23:32:33 +02001520
1521/**
1522 * pccard_loop_tuple() - loop over tuples in the CIS
1523 * @s: the struct pcmcia_socket where the card is inserted
1524 * @function: the device function we loop for
1525 * @code: which CIS code shall we look for?
1526 * @parse: buffer where the tuple shall be parsed (or NULL, if no parse)
1527 * @priv_data: private data to be passed to the loop_tuple function.
1528 * @loop_tuple: function to call for each CIS entry of type @function. IT
1529 * gets passed the raw tuple, the paresed tuple (if @parse is
1530 * set) and @priv_data.
1531 *
1532 * pccard_loop_tuple() loops over all CIS entries of type @function, and
1533 * calls the @loop_tuple function for each entry. If the call to @loop_tuple
1534 * returns 0, the loop exits. Returns 0 on success or errorcode otherwise.
1535 */
1536int pccard_loop_tuple(struct pcmcia_socket *s, unsigned int function,
1537 cisdata_t code, cisparse_t *parse, void *priv_data,
1538 int (*loop_tuple) (tuple_t *tuple,
1539 cisparse_t *parse,
1540 void *priv_data))
1541{
1542 tuple_t tuple;
1543 cisdata_t *buf;
1544 int ret;
1545
1546 buf = kzalloc(256, GFP_KERNEL);
1547 if (buf == NULL) {
1548 dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
1549 return -ENOMEM;
1550 }
1551
1552 tuple.TupleData = buf;
1553 tuple.TupleDataMax = 255;
1554 tuple.TupleOffset = 0;
1555 tuple.DesiredTuple = code;
1556 tuple.Attributes = 0;
1557
1558 ret = pccard_get_first_tuple(s, function, &tuple);
1559 while (!ret) {
1560 if (pccard_get_tuple_data(s, &tuple))
1561 goto next_entry;
1562
1563 if (parse)
1564 if (pcmcia_parse_tuple(&tuple, parse))
1565 goto next_entry;
1566
1567 ret = loop_tuple(&tuple, parse, priv_data);
1568 if (!ret)
1569 break;
1570
1571next_entry:
1572 ret = pccard_get_next_tuple(s, function, &tuple);
1573 }
1574
1575 kfree(buf);
1576 return ret;
1577}
1578EXPORT_SYMBOL(pccard_loop_tuple);
1579
1580
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001581/**
1582 * pccard_validate_cis() - check whether card has a sensible CIS
1583 * @s: the struct pcmcia_socket we are to check
1584 * @info: returns the number of tuples in the (valid) CIS, or 0
1585 *
1586 * This tries to determine if a card has a sensible CIS. In @info, it
1587 * returns the number of tuples in the CIS, or 0 if the CIS looks bad. The
1588 * checks include making sure several critical tuples are present and
1589 * valid; seeing if the total number of tuples is reasonable; and
1590 * looking for tuples that use reserved codes.
1591 *
1592 * The function returns 0 on success.
1593 */
Dominik Brodowski84897fc2009-10-18 23:51:09 +02001594int pccard_validate_cis(struct pcmcia_socket *s, unsigned int *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001595{
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001596 tuple_t *tuple;
1597 cisparse_t *p;
1598 unsigned int count = 0;
1599 int ret, reserved, dev_ok = 0, ident_ok = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001600
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001601 if (!s)
1602 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001603
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001604 /* We do not want to validate the CIS cache... */
1605 destroy_cis_cache(s);
Dominik Brodowski904e3772010-01-02 12:28:04 +01001606
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001607 tuple = kmalloc(sizeof(*tuple), GFP_KERNEL);
1608 if (tuple == NULL) {
1609 dev_warn(&s->dev, "no memory to validate CIS\n");
1610 return -ENOMEM;
1611 }
1612 p = kmalloc(sizeof(*p), GFP_KERNEL);
1613 if (p == NULL) {
1614 kfree(tuple);
1615 dev_warn(&s->dev, "no memory to validate CIS\n");
1616 return -ENOMEM;
1617 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001618
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001619 count = reserved = 0;
1620 tuple->DesiredTuple = RETURN_FIRST_TUPLE;
1621 tuple->Attributes = TUPLE_RETURN_COMMON;
1622 ret = pccard_get_first_tuple(s, BIND_FN_ALL, tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001623 if (ret != 0)
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001624 goto done;
1625
1626 /* First tuple should be DEVICE; we should really have either that
1627 or a CFTABLE_ENTRY of some sort */
1628 if ((tuple->TupleCode == CISTPL_DEVICE) ||
1629 (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY, p)) ||
1630 (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY_CB, p)))
1631 dev_ok++;
1632
1633 /* All cards should have a MANFID tuple, and/or a VERS_1 or VERS_2
1634 tuple, for card identification. Certain old D-Link and Linksys
1635 cards have only a broken VERS_2 tuple; hence the bogus test. */
1636 if ((pccard_read_tuple(s, BIND_FN_ALL, CISTPL_MANFID, p) == 0) ||
1637 (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_1, p) == 0) ||
1638 (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_2, p) != -ENOSPC))
1639 ident_ok++;
1640
1641 if (!dev_ok && !ident_ok)
1642 goto done;
1643
1644 for (count = 1; count < MAX_TUPLES; count++) {
1645 ret = pccard_get_next_tuple(s, BIND_FN_ALL, tuple);
1646 if (ret != 0)
1647 break;
1648 if (((tuple->TupleCode > 0x23) && (tuple->TupleCode < 0x40)) ||
1649 ((tuple->TupleCode > 0x47) && (tuple->TupleCode < 0x80)) ||
1650 ((tuple->TupleCode > 0x90) && (tuple->TupleCode < 0xff)))
1651 reserved++;
1652 }
1653 if ((count == MAX_TUPLES) || (reserved > 5) ||
1654 ((!dev_ok || !ident_ok) && (count > 10)))
1655 count = 0;
1656
1657 ret = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001658
1659done:
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001660 /* invalidate CIS cache on failure */
1661 if (!dev_ok || !ident_ok || !count) {
1662 destroy_cis_cache(s);
1663 ret = -EIO;
1664 }
Dominik Brodowski904e3772010-01-02 12:28:04 +01001665
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001666 if (info)
1667 *info = count;
1668 kfree(tuple);
1669 kfree(p);
1670 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001671}
1672EXPORT_SYMBOL(pccard_validate_cis);