blob: 368367ced62bbbdc26b35845acde878d05689ca2 [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 Brodowskie6ea0b9e2005-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 Brodowskie6ea0b9e2005-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{
Dominik Brodowski57197b92010-01-02 17:27:33 +0100271 struct cis_cache_entry *cis;
272 int ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273
Dominik Brodowski57197b92010-01-02 17:27:33 +0100274 if (s->state & SOCKET_CARDBUS)
275 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276
Dominik Brodowski57197b92010-01-02 17:27:33 +0100277 if (s->fake_cis) {
278 if (s->fake_cis_len >= addr+len)
279 memcpy(ptr, s->fake_cis+addr, len);
280 else
281 memset(ptr, 0xff, len);
282 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700284
Dominik Brodowski57197b92010-01-02 17:27:33 +0100285 list_for_each_entry(cis, &s->cis_cache, node) {
286 if (cis->addr == addr && cis->len == len && cis->attr == attr) {
287 memcpy(ptr, cis->cache, len);
288 return;
289 }
290 }
291
Dominik Brodowskie6ea0b9e2005-06-27 16:28:52 -0700292 ret = pcmcia_read_cis_mem(s, attr, addr, len, ptr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293
294 if (ret == 0) {
295 /* Copy data into the cache */
296 cis = kmalloc(sizeof(struct cis_cache_entry) + len, GFP_KERNEL);
297 if (cis) {
298 cis->addr = addr;
299 cis->len = len;
300 cis->attr = attr;
301 memcpy(cis->cache, ptr, len);
302 list_add(&cis->node, &s->cis_cache);
303 }
304 }
305}
306
307static void
308remove_cis_cache(struct pcmcia_socket *s, int attr, u_int addr, u_int len)
309{
310 struct cis_cache_entry *cis;
311
312 list_for_each_entry(cis, &s->cis_cache, node)
313 if (cis->addr == addr && cis->len == len && cis->attr == attr) {
314 list_del(&cis->node);
315 kfree(cis);
316 break;
317 }
318}
319
Dominik Brodowski904e3772010-01-02 12:28:04 +0100320/**
321 * destroy_cis_cache() - destroy the CIS cache
322 * @s: pcmcia_socket for which CIS cache shall be destroyed
323 *
324 * This destroys the CIS cache but keeps any fake CIS alive.
325 */
326
Linus Torvalds1da177e2005-04-16 15:20:36 -0700327void destroy_cis_cache(struct pcmcia_socket *s)
328{
329 struct list_head *l, *n;
Dominik Brodowski904e3772010-01-02 12:28:04 +0100330 struct cis_cache_entry *cis;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700331
332 list_for_each_safe(l, n, &s->cis_cache) {
Dominik Brodowski904e3772010-01-02 12:28:04 +0100333 cis = list_entry(l, struct cis_cache_entry, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700334 list_del(&cis->node);
335 kfree(cis);
336 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337}
338EXPORT_SYMBOL(destroy_cis_cache);
339
340/*======================================================================
341
342 This verifies if the CIS of a card matches what is in the CIS
343 cache.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100344
Linus Torvalds1da177e2005-04-16 15:20:36 -0700345======================================================================*/
346
347int verify_cis_cache(struct pcmcia_socket *s)
348{
349 struct cis_cache_entry *cis;
350 char *buf;
351
Dominik Brodowski57197b92010-01-02 17:27:33 +0100352 if (s->state & SOCKET_CARDBUS)
353 return -EINVAL;
354
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355 buf = kmalloc(256, GFP_KERNEL);
Dominik Brodowskie6895972008-11-02 19:55:45 +0100356 if (buf == NULL) {
Dominik Brodowski11683862008-08-03 10:22:47 +0200357 dev_printk(KERN_WARNING, &s->dev,
358 "no memory for verifying CIS\n");
359 return -ENOMEM;
Dominik Brodowskie6895972008-11-02 19:55:45 +0100360 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361 list_for_each_entry(cis, &s->cis_cache, node) {
362 int len = cis->len;
363
364 if (len > 256)
365 len = 256;
Dominik Brodowski57197b92010-01-02 17:27:33 +0100366
367 pcmcia_read_cis_mem(s, cis->attr, cis->addr, len, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700368
369 if (memcmp(buf, cis->cache, len) != 0) {
370 kfree(buf);
371 return -1;
372 }
373 }
374 kfree(buf);
375 return 0;
376}
Dominik Brodowski88b060d2010-01-02 14:14:23 +0100377EXPORT_SYMBOL(verify_cis_cache);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378
379/*======================================================================
380
381 For really bad cards, we provide a facility for uploading a
382 replacement CIS.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100383
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384======================================================================*/
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
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100408
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409======================================================================*/
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
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423int pccard_get_first_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
424{
425 if (!s)
Dominik Brodowskiffb8da22008-08-03 11:18:00 +0200426 return -EINVAL;
Dominik Brodowski57197b92010-01-02 17:27:33 +0100427
428 if (!(s->state & SOCKET_PRESENT) || (s->state & SOCKET_CARDBUS))
Dominik Brodowski3939c1ef2008-08-03 11:10:56 +0200429 return -ENODEV;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700430 tuple->TupleLink = tuple->Flags = 0;
Dominik Brodowski57197b92010-01-02 17:27:33 +0100431
432 /* Assume presence of a LONGLINK_C to address 0 */
433 tuple->CISOffset = tuple->LinkOffset = 0;
434 SPACE(tuple->Flags) = HAS_LINK(tuple->Flags) = 1;
435
436 if ((s->functions > 1) && !(tuple->Attributes & TUPLE_RETURN_COMMON)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437 cisdata_t req = tuple->DesiredTuple;
438 tuple->DesiredTuple = CISTPL_LONGLINK_MFC;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200439 if (pccard_get_next_tuple(s, function, tuple) == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440 tuple->DesiredTuple = CISTPL_LINKTARGET;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200441 if (pccard_get_next_tuple(s, function, tuple) != 0)
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200442 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 } else
444 tuple->CISOffset = tuple->TupleLink = 0;
445 tuple->DesiredTuple = req;
446 }
447 return pccard_get_next_tuple(s, function, tuple);
448}
449EXPORT_SYMBOL(pccard_get_first_tuple);
450
451static int follow_link(struct pcmcia_socket *s, tuple_t *tuple)
452{
453 u_char link[5];
454 u_int ofs;
455
456 if (MFC_FN(tuple->Flags)) {
457 /* Get indirect link from the MFC tuple */
458 read_cis_cache(s, LINK_SPACE(tuple->Flags),
459 tuple->LinkOffset, 5, link);
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700460 ofs = get_unaligned_le32(link + 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700461 SPACE(tuple->Flags) = (link[0] == CISTPL_MFC_ATTR);
462 /* Move to the next indirect link */
463 tuple->LinkOffset += 5;
464 MFC_FN(tuple->Flags)--;
465 } else if (HAS_LINK(tuple->Flags)) {
466 ofs = tuple->LinkOffset;
467 SPACE(tuple->Flags) = LINK_SPACE(tuple->Flags);
468 HAS_LINK(tuple->Flags) = 0;
469 } else {
470 return -1;
471 }
Dominik Brodowski57197b92010-01-02 17:27:33 +0100472 if (SPACE(tuple->Flags)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700473 /* This is ugly, but a common CIS error is to code the long
474 link offset incorrectly, so we check the right spot... */
475 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
476 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
477 (strncmp(link+2, "CIS", 3) == 0))
478 return ofs;
479 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
480 /* Then, we try the wrong spot... */
481 ofs = ofs >> 1;
482 }
483 read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
484 if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
485 (strncmp(link+2, "CIS", 3) == 0))
486 return ofs;
487 remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
488 return -1;
489}
490
491int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
492{
493 u_char link[2], tmp;
494 int ofs, i, attr;
495
496 if (!s)
Dominik Brodowskiffb8da22008-08-03 11:18:00 +0200497 return -EINVAL;
Dominik Brodowski57197b92010-01-02 17:27:33 +0100498 if (!(s->state & SOCKET_PRESENT) || (s->state & SOCKET_CARDBUS))
Dominik Brodowski3939c1ef2008-08-03 11:10:56 +0200499 return -ENODEV;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500
501 link[1] = tuple->TupleLink;
502 ofs = tuple->CISOffset + tuple->TupleLink;
503 attr = SPACE(tuple->Flags);
504
505 for (i = 0; i < MAX_TUPLES; i++) {
506 if (link[1] == 0xff) {
507 link[0] = CISTPL_END;
508 } else {
509 read_cis_cache(s, attr, ofs, 2, link);
510 if (link[0] == CISTPL_NULL) {
511 ofs++; continue;
512 }
513 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100514
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515 /* End of chain? Follow long link if possible */
516 if (link[0] == CISTPL_END) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100517 ofs = follow_link(s, tuple);
518 if (ofs < 0)
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200519 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 attr = SPACE(tuple->Flags);
521 read_cis_cache(s, attr, ofs, 2, link);
522 }
523
524 /* Is this a link tuple? Make a note of it */
525 if ((link[0] == CISTPL_LONGLINK_A) ||
526 (link[0] == CISTPL_LONGLINK_C) ||
527 (link[0] == CISTPL_LONGLINK_MFC) ||
528 (link[0] == CISTPL_LINKTARGET) ||
529 (link[0] == CISTPL_INDIRECT) ||
530 (link[0] == CISTPL_NO_LINK)) {
531 switch (link[0]) {
532 case CISTPL_LONGLINK_A:
533 HAS_LINK(tuple->Flags) = 1;
534 LINK_SPACE(tuple->Flags) = attr | IS_ATTR;
535 read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset);
536 break;
537 case CISTPL_LONGLINK_C:
538 HAS_LINK(tuple->Flags) = 1;
539 LINK_SPACE(tuple->Flags) = attr & ~IS_ATTR;
540 read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset);
541 break;
542 case CISTPL_INDIRECT:
543 HAS_LINK(tuple->Flags) = 1;
544 LINK_SPACE(tuple->Flags) = IS_ATTR | IS_INDIRECT;
545 tuple->LinkOffset = 0;
546 break;
547 case CISTPL_LONGLINK_MFC:
548 tuple->LinkOffset = ofs + 3;
549 LINK_SPACE(tuple->Flags) = attr;
550 if (function == BIND_FN_ALL) {
551 /* Follow all the MFC links */
552 read_cis_cache(s, attr, ofs+2, 1, &tmp);
553 MFC_FN(tuple->Flags) = tmp;
554 } else {
555 /* Follow exactly one of the links */
556 MFC_FN(tuple->Flags) = 1;
557 tuple->LinkOffset += function * 5;
558 }
559 break;
560 case CISTPL_NO_LINK:
561 HAS_LINK(tuple->Flags) = 0;
562 break;
563 }
564 if ((tuple->Attributes & TUPLE_RETURN_LINK) &&
565 (tuple->DesiredTuple == RETURN_FIRST_TUPLE))
566 break;
567 } else
568 if (tuple->DesiredTuple == RETURN_FIRST_TUPLE)
569 break;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100570
Linus Torvalds1da177e2005-04-16 15:20:36 -0700571 if (link[0] == tuple->DesiredTuple)
572 break;
573 ofs += link[1] + 2;
574 }
575 if (i == MAX_TUPLES) {
Dominik Brodowskid50dbec2009-10-23 12:51:28 +0200576 dev_dbg(&s->dev, "cs: overrun in pcmcia_get_next_tuple\n");
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200577 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700578 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100579
Linus Torvalds1da177e2005-04-16 15:20:36 -0700580 tuple->TupleCode = link[0];
581 tuple->TupleLink = link[1];
582 tuple->CISOffset = ofs + 2;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200583 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584}
585EXPORT_SYMBOL(pccard_get_next_tuple);
586
587/*====================================================================*/
588
589#define _MIN(a, b) (((a) < (b)) ? (a) : (b))
590
591int pccard_get_tuple_data(struct pcmcia_socket *s, tuple_t *tuple)
592{
593 u_int len;
594
595 if (!s)
Dominik Brodowskiffb8da22008-08-03 11:18:00 +0200596 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700597
598 if (tuple->TupleLink < tuple->TupleOffset)
Dominik Brodowski635d19b2008-08-03 11:47:29 +0200599 return -ENOSPC;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 len = tuple->TupleLink - tuple->TupleOffset;
601 tuple->TupleDataLen = tuple->TupleLink;
602 if (len == 0)
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200603 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604 read_cis_cache(s, SPACE(tuple->Flags),
605 tuple->CISOffset + tuple->TupleOffset,
606 _MIN(len, tuple->TupleDataMax), tuple->TupleData);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200607 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608}
609EXPORT_SYMBOL(pccard_get_tuple_data);
610
611
612/*======================================================================
613
614 Parsing routines for individual tuples
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100615
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616======================================================================*/
617
618static int parse_device(tuple_t *tuple, cistpl_device_t *device)
619{
620 int i;
621 u_char scale;
622 u_char *p, *q;
623
624 p = (u_char *)tuple->TupleData;
625 q = p + tuple->TupleDataLen;
626
627 device->ndev = 0;
628 for (i = 0; i < CISTPL_MAX_DEVICES; i++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100629
630 if (*p == 0xff)
631 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632 device->dev[i].type = (*p >> 4);
633 device->dev[i].wp = (*p & 0x08) ? 1 : 0;
634 switch (*p & 0x07) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100635 case 0:
636 device->dev[i].speed = 0;
637 break;
638 case 1:
639 device->dev[i].speed = 250;
640 break;
641 case 2:
642 device->dev[i].speed = 200;
643 break;
644 case 3:
645 device->dev[i].speed = 150;
646 break;
647 case 4:
648 device->dev[i].speed = 100;
649 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700650 case 7:
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200651 if (++p == q)
652 return -EINVAL;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100653 device->dev[i].speed = SPEED_CVT(*p);
654 while (*p & 0x80)
655 if (++p == q)
656 return -EINVAL;
657 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700658 default:
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100659 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700660 }
661
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200662 if (++p == q)
663 return -EINVAL;
664 if (*p == 0xff)
665 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700666 scale = *p & 7;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200667 if (scale == 7)
668 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700669 device->dev[i].size = ((*p >> 3) + 1) * (512 << (scale*2));
670 device->ndev++;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200671 if (++p == q)
672 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100674
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200675 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700676}
677
678/*====================================================================*/
679
680static int parse_checksum(tuple_t *tuple, cistpl_checksum_t *csum)
681{
682 u_char *p;
683 if (tuple->TupleDataLen < 5)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200684 return -EINVAL;
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700685 p = (u_char *) tuple->TupleData;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700686 csum->addr = tuple->CISOffset + get_unaligned_le16(p) - 2;
687 csum->len = get_unaligned_le16(p + 2);
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700688 csum->sum = *(p + 4);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200689 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700690}
691
692/*====================================================================*/
693
694static int parse_longlink(tuple_t *tuple, cistpl_longlink_t *link)
695{
696 if (tuple->TupleDataLen < 4)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200697 return -EINVAL;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700698 link->addr = get_unaligned_le32(tuple->TupleData);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200699 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700}
701
702/*====================================================================*/
703
704static int parse_longlink_mfc(tuple_t *tuple,
705 cistpl_longlink_mfc_t *link)
706{
707 u_char *p;
708 int i;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100709
Linus Torvalds1da177e2005-04-16 15:20:36 -0700710 p = (u_char *)tuple->TupleData;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100711
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712 link->nfn = *p; p++;
713 if (tuple->TupleDataLen <= link->nfn*5)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200714 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715 for (i = 0; i < link->nfn; i++) {
716 link->fn[i].space = *p; p++;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700717 link->fn[i].addr = get_unaligned_le32(p);
Daniel Ritzdc0cf6a2007-10-16 01:23:52 -0700718 p += 4;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700719 }
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200720 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700721}
722
723/*====================================================================*/
724
725static int parse_strings(u_char *p, u_char *q, int max,
726 char *s, u_char *ofs, u_char *found)
727{
728 int i, j, ns;
729
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200730 if (p == q)
731 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732 ns = 0; j = 0;
733 for (i = 0; i < max; i++) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200734 if (*p == 0xff)
735 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736 ofs[i] = j;
737 ns++;
738 for (;;) {
739 s[j++] = (*p == 0xff) ? '\0' : *p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100740 if ((*p == '\0') || (*p == 0xff))
741 break;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200742 if (++p == q)
743 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100745 if ((*p == 0xff) || (++p == q))
746 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747 }
748 if (found) {
749 *found = ns;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200750 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700751 } else {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200752 return (ns == max) ? 0 : -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700753 }
754}
755
756/*====================================================================*/
757
758static int parse_vers_1(tuple_t *tuple, cistpl_vers_1_t *vers_1)
759{
760 u_char *p, *q;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100761
Linus Torvalds1da177e2005-04-16 15:20:36 -0700762 p = (u_char *)tuple->TupleData;
763 q = p + tuple->TupleDataLen;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100764
Linus Torvalds1da177e2005-04-16 15:20:36 -0700765 vers_1->major = *p; p++;
766 vers_1->minor = *p; p++;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200767 if (p >= q)
768 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700769
770 return parse_strings(p, q, CISTPL_VERS_1_MAX_PROD_STRINGS,
771 vers_1->str, vers_1->ofs, &vers_1->ns);
772}
773
774/*====================================================================*/
775
776static int parse_altstr(tuple_t *tuple, cistpl_altstr_t *altstr)
777{
778 u_char *p, *q;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100779
Linus Torvalds1da177e2005-04-16 15:20:36 -0700780 p = (u_char *)tuple->TupleData;
781 q = p + tuple->TupleDataLen;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100782
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783 return parse_strings(p, q, CISTPL_MAX_ALTSTR_STRINGS,
784 altstr->str, altstr->ofs, &altstr->ns);
785}
786
787/*====================================================================*/
788
789static int parse_jedec(tuple_t *tuple, cistpl_jedec_t *jedec)
790{
791 u_char *p, *q;
792 int nid;
793
794 p = (u_char *)tuple->TupleData;
795 q = p + tuple->TupleDataLen;
796
797 for (nid = 0; nid < CISTPL_MAX_DEVICES; nid++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100798 if (p > q-2)
799 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700800 jedec->id[nid].mfr = p[0];
801 jedec->id[nid].info = p[1];
802 p += 2;
803 }
804 jedec->nid = nid;
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200805 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700806}
807
808/*====================================================================*/
809
810static int parse_manfid(tuple_t *tuple, cistpl_manfid_t *m)
811{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700812 if (tuple->TupleDataLen < 4)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200813 return -EINVAL;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -0700814 m->manf = get_unaligned_le16(tuple->TupleData);
815 m->card = get_unaligned_le16(tuple->TupleData + 2);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200816 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700817}
818
819/*====================================================================*/
820
821static int parse_funcid(tuple_t *tuple, cistpl_funcid_t *f)
822{
823 u_char *p;
824 if (tuple->TupleDataLen < 2)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200825 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700826 p = (u_char *)tuple->TupleData;
827 f->func = p[0];
828 f->sysinit = p[1];
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200829 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700830}
831
832/*====================================================================*/
833
834static int parse_funce(tuple_t *tuple, cistpl_funce_t *f)
835{
836 u_char *p;
837 int i;
838 if (tuple->TupleDataLen < 1)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200839 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700840 p = (u_char *)tuple->TupleData;
841 f->type = p[0];
842 for (i = 1; i < tuple->TupleDataLen; i++)
843 f->data[i-1] = p[i];
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200844 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700845}
846
847/*====================================================================*/
848
849static int parse_config(tuple_t *tuple, cistpl_config_t *config)
850{
851 int rasz, rmsz, i;
852 u_char *p;
853
854 p = (u_char *)tuple->TupleData;
855 rasz = *p & 0x03;
856 rmsz = (*p & 0x3c) >> 2;
857 if (tuple->TupleDataLen < rasz+rmsz+4)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +0200858 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700859 config->last_idx = *(++p);
860 p++;
861 config->base = 0;
862 for (i = 0; i <= rasz; i++)
863 config->base += p[i] << (8*i);
864 p += rasz+1;
865 for (i = 0; i < 4; i++)
866 config->rmask[i] = 0;
867 for (i = 0; i <= rmsz; i++)
868 config->rmask[i>>2] += p[i] << (8*(i%4));
869 config->subtuples = tuple->TupleDataLen - (rasz+rmsz+4);
Dominik Brodowski4c89e882008-08-03 10:07:45 +0200870 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700871}
872
873/*======================================================================
874
875 The following routines are all used to parse the nightmarish
876 config table entries.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100877
Linus Torvalds1da177e2005-04-16 15:20:36 -0700878======================================================================*/
879
880static u_char *parse_power(u_char *p, u_char *q,
881 cistpl_power_t *pwr)
882{
883 int i;
884 u_int scale;
885
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100886 if (p == q)
887 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700888 pwr->present = *p;
889 pwr->flags = 0;
890 p++;
891 for (i = 0; i < 7; i++)
892 if (pwr->present & (1<<i)) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100893 if (p == q)
894 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700895 pwr->param[i] = POWER_CVT(*p);
896 scale = POWER_SCALE(*p);
897 while (*p & 0x80) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100898 if (++p == q)
899 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700900 if ((*p & 0x7f) < 100)
901 pwr->param[i] += (*p & 0x7f) * scale / 100;
902 else if (*p == 0x7d)
903 pwr->flags |= CISTPL_POWER_HIGHZ_OK;
904 else if (*p == 0x7e)
905 pwr->param[i] = 0;
906 else if (*p == 0x7f)
907 pwr->flags |= CISTPL_POWER_HIGHZ_REQ;
908 else
909 return NULL;
910 }
911 p++;
912 }
913 return p;
914}
915
916/*====================================================================*/
917
918static u_char *parse_timing(u_char *p, u_char *q,
919 cistpl_timing_t *timing)
920{
921 u_char scale;
922
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100923 if (p == q)
924 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700925 scale = *p;
926 if ((scale & 3) != 3) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100927 if (++p == q)
928 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700929 timing->wait = SPEED_CVT(*p);
930 timing->waitscale = exponent[scale & 3];
931 } else
932 timing->wait = 0;
933 scale >>= 2;
934 if ((scale & 7) != 7) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100935 if (++p == q)
936 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700937 timing->ready = SPEED_CVT(*p);
938 timing->rdyscale = exponent[scale & 7];
939 } else
940 timing->ready = 0;
941 scale >>= 3;
942 if (scale != 7) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100943 if (++p == q)
944 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700945 timing->reserved = SPEED_CVT(*p);
946 timing->rsvscale = exponent[scale];
947 } else
948 timing->reserved = 0;
949 p++;
950 return p;
951}
952
953/*====================================================================*/
954
955static u_char *parse_io(u_char *p, u_char *q, cistpl_io_t *io)
956{
957 int i, j, bsz, lsz;
958
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100959 if (p == q)
960 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700961 io->flags = *p;
962
963 if (!(*p & 0x80)) {
964 io->nwin = 1;
965 io->win[0].base = 0;
966 io->win[0].len = (1 << (io->flags & CISTPL_IO_LINES_MASK));
967 return p+1;
968 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100969
970 if (++p == q)
971 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700972 io->nwin = (*p & 0x0f) + 1;
973 bsz = (*p & 0x30) >> 4;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100974 if (bsz == 3)
975 bsz++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700976 lsz = (*p & 0xc0) >> 6;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100977 if (lsz == 3)
978 lsz++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700979 p++;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100980
Linus Torvalds1da177e2005-04-16 15:20:36 -0700981 for (i = 0; i < io->nwin; i++) {
982 io->win[i].base = 0;
983 io->win[i].len = 1;
984 for (j = 0; j < bsz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100985 if (p == q)
986 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700987 io->win[i].base += *p << (j*8);
988 }
989 for (j = 0; j < lsz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +0100990 if (p == q)
991 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992 io->win[i].len += *p << (j*8);
993 }
994 }
995 return p;
996}
997
998/*====================================================================*/
999
1000static u_char *parse_mem(u_char *p, u_char *q, cistpl_mem_t *mem)
1001{
1002 int i, j, asz, lsz, has_ha;
1003 u_int len, ca, ha;
1004
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001005 if (p == q)
1006 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001007
1008 mem->nwin = (*p & 0x07) + 1;
1009 lsz = (*p & 0x18) >> 3;
1010 asz = (*p & 0x60) >> 5;
1011 has_ha = (*p & 0x80);
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001012 if (++p == q)
1013 return NULL;
1014
Linus Torvalds1da177e2005-04-16 15:20:36 -07001015 for (i = 0; i < mem->nwin; i++) {
1016 len = ca = ha = 0;
1017 for (j = 0; j < lsz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001018 if (p == q)
1019 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001020 len += *p << (j*8);
1021 }
1022 for (j = 0; j < asz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001023 if (p == q)
1024 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001025 ca += *p << (j*8);
1026 }
1027 if (has_ha)
1028 for (j = 0; j < asz; j++, p++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001029 if (p == q)
1030 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001031 ha += *p << (j*8);
1032 }
1033 mem->win[i].len = len << 8;
1034 mem->win[i].card_addr = ca << 8;
1035 mem->win[i].host_addr = ha << 8;
1036 }
1037 return p;
1038}
1039
1040/*====================================================================*/
1041
1042static u_char *parse_irq(u_char *p, u_char *q, cistpl_irq_t *irq)
1043{
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001044 if (p == q)
1045 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046 irq->IRQInfo1 = *p; p++;
1047 if (irq->IRQInfo1 & IRQ_INFO2_VALID) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001048 if (p+2 > q)
1049 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001050 irq->IRQInfo2 = (p[1]<<8) + p[0];
1051 p += 2;
1052 }
1053 return p;
1054}
1055
1056/*====================================================================*/
1057
1058static int parse_cftable_entry(tuple_t *tuple,
1059 cistpl_cftable_entry_t *entry)
1060{
1061 u_char *p, *q, features;
1062
1063 p = tuple->TupleData;
1064 q = p + tuple->TupleDataLen;
1065 entry->index = *p & 0x3f;
1066 entry->flags = 0;
1067 if (*p & 0x40)
1068 entry->flags |= CISTPL_CFTABLE_DEFAULT;
1069 if (*p & 0x80) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001070 if (++p == q)
1071 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001072 if (*p & 0x10)
1073 entry->flags |= CISTPL_CFTABLE_BVDS;
1074 if (*p & 0x20)
1075 entry->flags |= CISTPL_CFTABLE_WP;
1076 if (*p & 0x40)
1077 entry->flags |= CISTPL_CFTABLE_RDYBSY;
1078 if (*p & 0x80)
1079 entry->flags |= CISTPL_CFTABLE_MWAIT;
1080 entry->interface = *p & 0x0f;
1081 } else
1082 entry->interface = 0;
1083
1084 /* Process optional features */
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001085 if (++p == q)
1086 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001087 features = *p; p++;
1088
1089 /* Power options */
1090 if ((features & 3) > 0) {
1091 p = parse_power(p, q, &entry->vcc);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001092 if (p == NULL)
1093 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001094 } else
1095 entry->vcc.present = 0;
1096 if ((features & 3) > 1) {
1097 p = parse_power(p, q, &entry->vpp1);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001098 if (p == NULL)
1099 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001100 } else
1101 entry->vpp1.present = 0;
1102 if ((features & 3) > 2) {
1103 p = parse_power(p, q, &entry->vpp2);
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->vpp2.present = 0;
1108
1109 /* Timing options */
1110 if (features & 0x04) {
1111 p = parse_timing(p, q, &entry->timing);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001112 if (p == NULL)
1113 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001114 } else {
1115 entry->timing.wait = 0;
1116 entry->timing.ready = 0;
1117 entry->timing.reserved = 0;
1118 }
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001119
Linus Torvalds1da177e2005-04-16 15:20:36 -07001120 /* I/O window options */
1121 if (features & 0x08) {
1122 p = parse_io(p, q, &entry->io);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001123 if (p == NULL)
1124 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001125 } else
1126 entry->io.nwin = 0;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001127
Linus Torvalds1da177e2005-04-16 15:20:36 -07001128 /* Interrupt options */
1129 if (features & 0x10) {
1130 p = parse_irq(p, q, &entry->irq);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001131 if (p == NULL)
1132 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001133 } else
1134 entry->irq.IRQInfo1 = 0;
1135
1136 switch (features & 0x60) {
1137 case 0x00:
1138 entry->mem.nwin = 0;
1139 break;
1140 case 0x20:
1141 entry->mem.nwin = 1;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001142 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001143 entry->mem.win[0].card_addr = 0;
1144 entry->mem.win[0].host_addr = 0;
1145 p += 2;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001146 if (p > q)
1147 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001148 break;
1149 case 0x40:
1150 entry->mem.nwin = 1;
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001151 entry->mem.win[0].len = get_unaligned_le16(p) << 8;
1152 entry->mem.win[0].card_addr = get_unaligned_le16(p + 2) << 8;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001153 entry->mem.win[0].host_addr = 0;
1154 p += 4;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001155 if (p > q)
1156 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001157 break;
1158 case 0x60:
1159 p = parse_mem(p, q, &entry->mem);
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001160 if (p == NULL)
1161 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001162 break;
1163 }
1164
1165 /* Misc features */
1166 if (features & 0x80) {
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001167 if (p == q)
1168 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001169 entry->flags |= (*p << 8);
1170 while (*p & 0x80)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001171 if (++p == q)
1172 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001173 p++;
1174 }
1175
1176 entry->subtuples = q-p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001177
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001178 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001179}
1180
1181/*====================================================================*/
1182
Linus Torvalds1da177e2005-04-16 15:20:36 -07001183static int parse_device_geo(tuple_t *tuple, cistpl_device_geo_t *geo)
1184{
1185 u_char *p, *q;
1186 int n;
1187
1188 p = (u_char *)tuple->TupleData;
1189 q = p + tuple->TupleDataLen;
1190
1191 for (n = 0; n < CISTPL_MAX_DEVICES; n++) {
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001192 if (p > q-6)
1193 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001194 geo->geo[n].buswidth = p[0];
1195 geo->geo[n].erase_block = 1 << (p[1]-1);
1196 geo->geo[n].read_block = 1 << (p[2]-1);
1197 geo->geo[n].write_block = 1 << (p[3]-1);
1198 geo->geo[n].partition = 1 << (p[4]-1);
1199 geo->geo[n].interleave = 1 << (p[5]-1);
1200 p += 6;
1201 }
1202 geo->ngeo = n;
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001203 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001204}
1205
1206/*====================================================================*/
1207
1208static int parse_vers_2(tuple_t *tuple, cistpl_vers_2_t *v2)
1209{
1210 u_char *p, *q;
1211
1212 if (tuple->TupleDataLen < 10)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001213 return -EINVAL;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001214
Linus Torvalds1da177e2005-04-16 15:20:36 -07001215 p = tuple->TupleData;
1216 q = p + tuple->TupleDataLen;
1217
1218 v2->vers = p[0];
1219 v2->comply = p[1];
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001220 v2->dindex = get_unaligned_le16(p + 2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001221 v2->vspec8 = p[6];
1222 v2->vspec9 = p[7];
1223 v2->nhdr = p[8];
1224 p += 9;
1225 return parse_strings(p, q, 2, v2->str, &v2->vendor, NULL);
1226}
1227
1228/*====================================================================*/
1229
1230static int parse_org(tuple_t *tuple, cistpl_org_t *org)
1231{
1232 u_char *p, *q;
1233 int i;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001234
Linus Torvalds1da177e2005-04-16 15:20:36 -07001235 p = tuple->TupleData;
1236 q = p + tuple->TupleDataLen;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001237 if (p == q)
1238 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001239 org->data_org = *p;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001240 if (++p == q)
1241 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001242 for (i = 0; i < 30; i++) {
1243 org->desc[i] = *p;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001244 if (*p == '\0')
1245 break;
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001246 if (++p == q)
1247 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001248 }
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001249 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001250}
1251
1252/*====================================================================*/
1253
1254static int parse_format(tuple_t *tuple, cistpl_format_t *fmt)
1255{
1256 u_char *p;
1257
1258 if (tuple->TupleDataLen < 10)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001259 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001260
1261 p = tuple->TupleData;
1262
1263 fmt->type = p[0];
1264 fmt->edc = p[1];
Harvey Harrison6b1e6f62008-04-29 01:03:39 -07001265 fmt->offset = get_unaligned_le32(p + 2);
1266 fmt->length = get_unaligned_le32(p + 6);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001267
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001268 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001269}
1270
1271/*====================================================================*/
1272
Dominik Brodowski2f3061e2008-08-31 15:50:33 +02001273int pcmcia_parse_tuple(tuple_t *tuple, cisparse_t *parse)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001274{
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001275 int ret = 0;
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001276
Linus Torvalds1da177e2005-04-16 15:20:36 -07001277 if (tuple->TupleDataLen > tuple->TupleDataMax)
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001278 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001279 switch (tuple->TupleCode) {
1280 case CISTPL_DEVICE:
1281 case CISTPL_DEVICE_A:
1282 ret = parse_device(tuple, &parse->device);
1283 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001284 case CISTPL_CHECKSUM:
1285 ret = parse_checksum(tuple, &parse->checksum);
1286 break;
1287 case CISTPL_LONGLINK_A:
1288 case CISTPL_LONGLINK_C:
1289 ret = parse_longlink(tuple, &parse->longlink);
1290 break;
1291 case CISTPL_LONGLINK_MFC:
1292 ret = parse_longlink_mfc(tuple, &parse->longlink_mfc);
1293 break;
1294 case CISTPL_VERS_1:
1295 ret = parse_vers_1(tuple, &parse->version_1);
1296 break;
1297 case CISTPL_ALTSTR:
1298 ret = parse_altstr(tuple, &parse->altstr);
1299 break;
1300 case CISTPL_JEDEC_A:
1301 case CISTPL_JEDEC_C:
1302 ret = parse_jedec(tuple, &parse->jedec);
1303 break;
1304 case CISTPL_MANFID:
1305 ret = parse_manfid(tuple, &parse->manfid);
1306 break;
1307 case CISTPL_FUNCID:
1308 ret = parse_funcid(tuple, &parse->funcid);
1309 break;
1310 case CISTPL_FUNCE:
1311 ret = parse_funce(tuple, &parse->funce);
1312 break;
1313 case CISTPL_CONFIG:
1314 ret = parse_config(tuple, &parse->config);
1315 break;
1316 case CISTPL_CFTABLE_ENTRY:
1317 ret = parse_cftable_entry(tuple, &parse->cftable_entry);
1318 break;
1319 case CISTPL_DEVICE_GEO:
1320 case CISTPL_DEVICE_GEO_A:
1321 ret = parse_device_geo(tuple, &parse->device_geo);
1322 break;
1323 case CISTPL_VERS_2:
1324 ret = parse_vers_2(tuple, &parse->vers_2);
1325 break;
1326 case CISTPL_ORG:
1327 ret = parse_org(tuple, &parse->org);
1328 break;
1329 case CISTPL_FORMAT:
1330 case CISTPL_FORMAT_A:
1331 ret = parse_format(tuple, &parse->format);
1332 break;
1333 case CISTPL_NO_LINK:
1334 case CISTPL_LINKTARGET:
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001335 ret = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001336 break;
1337 default:
Dominik Brodowskide6405e2008-08-03 10:47:59 +02001338 ret = -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001339 break;
1340 }
Dominik Brodowski3f9c5f42008-08-03 12:22:40 +02001341 if (ret)
Dominik Brodowskid50dbec2009-10-23 12:51:28 +02001342 pr_debug("parse_tuple failed %d\n", ret);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001343 return ret;
1344}
Dominik Brodowski2f3061e2008-08-31 15:50:33 +02001345EXPORT_SYMBOL(pcmcia_parse_tuple);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001346
1347/*======================================================================
1348
1349 This is used internally by Card Services to look up CIS stuff.
Dominik Brodowski9fea84f2009-12-07 22:11:45 +01001350
Linus Torvalds1da177e2005-04-16 15:20:36 -07001351======================================================================*/
1352
1353int pccard_read_tuple(struct pcmcia_socket *s, unsigned int function, cisdata_t code, void *parse)
1354{
1355 tuple_t tuple;
1356 cisdata_t *buf;
1357 int ret;
1358
1359 buf = kmalloc(256, GFP_KERNEL);
Dominik Brodowski11683862008-08-03 10:22:47 +02001360 if (buf == NULL) {
1361 dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
1362 return -ENOMEM;
1363 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001364 tuple.DesiredTuple = code;
Dominik Brodowski84897fc2009-10-18 23:51:09 +02001365 tuple.Attributes = 0;
1366 if (function == BIND_FN_ALL)
1367 tuple.Attributes = TUPLE_RETURN_COMMON;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001368 ret = pccard_get_first_tuple(s, function, &tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001369 if (ret != 0)
1370 goto done;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001371 tuple.TupleData = buf;
1372 tuple.TupleOffset = 0;
1373 tuple.TupleDataMax = 255;
1374 ret = pccard_get_tuple_data(s, &tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001375 if (ret != 0)
1376 goto done;
Dominik Brodowski2f3061e2008-08-31 15:50:33 +02001377 ret = pcmcia_parse_tuple(&tuple, parse);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001378done:
1379 kfree(buf);
1380 return ret;
1381}
1382EXPORT_SYMBOL(pccard_read_tuple);
1383
Dominik Brodowski91284222009-10-18 23:32:33 +02001384
1385/**
1386 * pccard_loop_tuple() - loop over tuples in the CIS
1387 * @s: the struct pcmcia_socket where the card is inserted
1388 * @function: the device function we loop for
1389 * @code: which CIS code shall we look for?
1390 * @parse: buffer where the tuple shall be parsed (or NULL, if no parse)
1391 * @priv_data: private data to be passed to the loop_tuple function.
1392 * @loop_tuple: function to call for each CIS entry of type @function. IT
1393 * gets passed the raw tuple, the paresed tuple (if @parse is
1394 * set) and @priv_data.
1395 *
1396 * pccard_loop_tuple() loops over all CIS entries of type @function, and
1397 * calls the @loop_tuple function for each entry. If the call to @loop_tuple
1398 * returns 0, the loop exits. Returns 0 on success or errorcode otherwise.
1399 */
1400int pccard_loop_tuple(struct pcmcia_socket *s, unsigned int function,
1401 cisdata_t code, cisparse_t *parse, void *priv_data,
1402 int (*loop_tuple) (tuple_t *tuple,
1403 cisparse_t *parse,
1404 void *priv_data))
1405{
1406 tuple_t tuple;
1407 cisdata_t *buf;
1408 int ret;
1409
1410 buf = kzalloc(256, GFP_KERNEL);
1411 if (buf == NULL) {
1412 dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
1413 return -ENOMEM;
1414 }
1415
1416 tuple.TupleData = buf;
1417 tuple.TupleDataMax = 255;
1418 tuple.TupleOffset = 0;
1419 tuple.DesiredTuple = code;
1420 tuple.Attributes = 0;
1421
1422 ret = pccard_get_first_tuple(s, function, &tuple);
1423 while (!ret) {
1424 if (pccard_get_tuple_data(s, &tuple))
1425 goto next_entry;
1426
1427 if (parse)
1428 if (pcmcia_parse_tuple(&tuple, parse))
1429 goto next_entry;
1430
1431 ret = loop_tuple(&tuple, parse, priv_data);
1432 if (!ret)
1433 break;
1434
1435next_entry:
1436 ret = pccard_get_next_tuple(s, function, &tuple);
1437 }
1438
1439 kfree(buf);
1440 return ret;
1441}
1442EXPORT_SYMBOL(pccard_loop_tuple);
1443
1444
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001445/**
1446 * pccard_validate_cis() - check whether card has a sensible CIS
1447 * @s: the struct pcmcia_socket we are to check
1448 * @info: returns the number of tuples in the (valid) CIS, or 0
1449 *
1450 * This tries to determine if a card has a sensible CIS. In @info, it
1451 * returns the number of tuples in the CIS, or 0 if the CIS looks bad. The
1452 * checks include making sure several critical tuples are present and
1453 * valid; seeing if the total number of tuples is reasonable; and
1454 * looking for tuples that use reserved codes.
1455 *
1456 * The function returns 0 on success.
1457 */
Dominik Brodowski84897fc2009-10-18 23:51:09 +02001458int pccard_validate_cis(struct pcmcia_socket *s, unsigned int *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001459{
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001460 tuple_t *tuple;
1461 cisparse_t *p;
1462 unsigned int count = 0;
1463 int ret, reserved, dev_ok = 0, ident_ok = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001464
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001465 if (!s)
1466 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001467
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001468 /* We do not want to validate the CIS cache... */
1469 destroy_cis_cache(s);
Dominik Brodowski904e3772010-01-02 12:28:04 +01001470
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001471 tuple = kmalloc(sizeof(*tuple), GFP_KERNEL);
1472 if (tuple == NULL) {
1473 dev_warn(&s->dev, "no memory to validate CIS\n");
1474 return -ENOMEM;
1475 }
1476 p = kmalloc(sizeof(*p), GFP_KERNEL);
1477 if (p == NULL) {
1478 kfree(tuple);
1479 dev_warn(&s->dev, "no memory to validate CIS\n");
1480 return -ENOMEM;
1481 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001482
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001483 count = reserved = 0;
1484 tuple->DesiredTuple = RETURN_FIRST_TUPLE;
1485 tuple->Attributes = TUPLE_RETURN_COMMON;
1486 ret = pccard_get_first_tuple(s, BIND_FN_ALL, tuple);
Dominik Brodowski4c89e882008-08-03 10:07:45 +02001487 if (ret != 0)
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001488 goto done;
1489
1490 /* First tuple should be DEVICE; we should really have either that
1491 or a CFTABLE_ENTRY of some sort */
1492 if ((tuple->TupleCode == CISTPL_DEVICE) ||
1493 (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY, p)) ||
1494 (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY_CB, p)))
1495 dev_ok++;
1496
1497 /* All cards should have a MANFID tuple, and/or a VERS_1 or VERS_2
1498 tuple, for card identification. Certain old D-Link and Linksys
1499 cards have only a broken VERS_2 tuple; hence the bogus test. */
1500 if ((pccard_read_tuple(s, BIND_FN_ALL, CISTPL_MANFID, p) == 0) ||
1501 (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_1, p) == 0) ||
1502 (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_2, p) != -ENOSPC))
1503 ident_ok++;
1504
1505 if (!dev_ok && !ident_ok)
1506 goto done;
1507
1508 for (count = 1; count < MAX_TUPLES; count++) {
1509 ret = pccard_get_next_tuple(s, BIND_FN_ALL, tuple);
1510 if (ret != 0)
1511 break;
1512 if (((tuple->TupleCode > 0x23) && (tuple->TupleCode < 0x40)) ||
1513 ((tuple->TupleCode > 0x47) && (tuple->TupleCode < 0x80)) ||
1514 ((tuple->TupleCode > 0x90) && (tuple->TupleCode < 0xff)))
1515 reserved++;
1516 }
1517 if ((count == MAX_TUPLES) || (reserved > 5) ||
1518 ((!dev_ok || !ident_ok) && (count > 10)))
1519 count = 0;
1520
1521 ret = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001522
1523done:
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001524 /* invalidate CIS cache on failure */
1525 if (!dev_ok || !ident_ok || !count) {
1526 destroy_cis_cache(s);
1527 ret = -EIO;
1528 }
Dominik Brodowski904e3772010-01-02 12:28:04 +01001529
Dominik Brodowskif131ddc2010-01-02 12:58:10 +01001530 if (info)
1531 *info = count;
1532 kfree(tuple);
1533 kfree(p);
1534 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001535}
1536EXPORT_SYMBOL(pccard_validate_cis);