Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
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 | ||
1da177e4 LT |
15 | #include <linux/module.h> |
16 | #include <linux/moduleparam.h> | |
17 | #include <linux/kernel.h> | |
18 | #include <linux/string.h> | |
19 | #include <linux/major.h> | |
20 | #include <linux/errno.h> | |
21 | #include <linux/timer.h> | |
22 | #include <linux/slab.h> | |
23 | #include <linux/mm.h> | |
1da177e4 LT |
24 | #include <linux/pci.h> |
25 | #include <linux/ioport.h> | |
26 | #include <asm/io.h> | |
27 | #include <asm/byteorder.h> | |
dc0cf6a2 | 28 | #include <asm/unaligned.h> |
1da177e4 LT |
29 | |
30 | #include <pcmcia/cs_types.h> | |
31 | #include <pcmcia/ss.h> | |
32 | #include <pcmcia/cs.h> | |
1da177e4 LT |
33 | #include <pcmcia/cisreg.h> |
34 | #include <pcmcia/cistpl.h> | |
35 | #include "cs_internal.h" | |
36 | ||
37 | static const u_char mantissa[] = { | |
38 | 10, 12, 13, 15, 20, 25, 30, 35, | |
39 | 40, 45, 50, 55, 60, 70, 80, 90 | |
40 | }; | |
41 | ||
42 | static 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 | ||
37f77955 PM |
61 | /* 16-bit CIS? */ |
62 | static int cis_width; | |
63 | module_param(cis_width, int, 0444); | |
1da177e4 LT |
64 | |
65 | void 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 | } | |
79 | EXPORT_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 | */ | |
86 | static void __iomem * | |
87 | set_cis_map(struct pcmcia_socket *s, unsigned int card_offset, unsigned int flags) | |
88 | { | |
2e5a3e79 DB |
89 | pccard_mem_map *mem = &s->cis_mem; |
90 | int ret; | |
91 | ||
92 | if (!(s->features & SS_CAP_STATIC_MAP) && (mem->res == NULL)) { | |
93 | mem->res = pcmcia_find_mem_region(0, s->map_size, s->map_size, 0, s); | |
94 | if (mem->res == NULL) { | |
2e55bf6b DB |
95 | dev_printk(KERN_NOTICE, &s->dev, |
96 | "cs: unable to map card memory!\n"); | |
2e5a3e79 DB |
97 | return NULL; |
98 | } | |
99 | s->cis_virt = NULL; | |
1da177e4 | 100 | } |
2ad0a0a7 | 101 | |
2e5a3e79 DB |
102 | 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; | |
1da177e4 LT |
122 | } |
123 | ||
124 | /*====================================================================== | |
125 | ||
126 | Low-level functions to read and write CIS memory. I think the | |
127 | write routine is only useful for writing one-byte registers. | |
128 | ||
129 | ======================================================================*/ | |
130 | ||
131 | /* Bits in attr field */ | |
132 | #define IS_ATTR 1 | |
133 | #define IS_INDIRECT 8 | |
134 | ||
e6ea0b9e | 135 | int pcmcia_read_cis_mem(struct pcmcia_socket *s, int attr, u_int addr, |
1da177e4 LT |
136 | u_int len, void *ptr) |
137 | { | |
138 | void __iomem *sys, *end; | |
139 | unsigned char *buf = ptr; | |
140 | ||
e6ea0b9e | 141 | cs_dbg(s, 3, "pcmcia_read_cis_mem(%d, %#x, %u)\n", attr, addr, len); |
1da177e4 LT |
142 | |
143 | if (attr & IS_INDIRECT) { | |
144 | /* Indirect accesses use a bunch of special registers at fixed | |
145 | locations in common memory */ | |
146 | u_char flags = ICTRL0_COMMON|ICTRL0_AUTOINC|ICTRL0_BYTEGRAN; | |
147 | if (attr & IS_ATTR) { | |
148 | addr *= 2; | |
149 | flags = ICTRL0_AUTOINC; | |
150 | } | |
151 | ||
152 | sys = set_cis_map(s, 0, MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0)); | |
153 | if (!sys) { | |
154 | memset(ptr, 0xff, len); | |
155 | return -1; | |
156 | } | |
157 | ||
158 | writeb(flags, sys+CISREG_ICTRL0); | |
159 | writeb(addr & 0xff, sys+CISREG_IADDR0); | |
160 | writeb((addr>>8) & 0xff, sys+CISREG_IADDR1); | |
161 | writeb((addr>>16) & 0xff, sys+CISREG_IADDR2); | |
162 | writeb((addr>>24) & 0xff, sys+CISREG_IADDR3); | |
163 | for ( ; len > 0; len--, buf++) | |
164 | *buf = readb(sys+CISREG_IDATA0); | |
165 | } else { | |
166 | u_int inc = 1, card_offset, flags; | |
167 | ||
168 | flags = MAP_ACTIVE | ((cis_width) ? MAP_16BIT : 0); | |
169 | if (attr) { | |
170 | flags |= MAP_ATTRIB; | |
171 | inc++; | |
172 | addr *= 2; | |
173 | } | |
174 | ||
175 | card_offset = addr & ~(s->map_size-1); | |
176 | while (len) { | |
177 | sys = set_cis_map(s, card_offset, flags); | |
178 | if (!sys) { | |
179 | memset(ptr, 0xff, len); | |
180 | return -1; | |
181 | } | |
182 | end = sys + s->map_size; | |
183 | sys = sys + (addr & (s->map_size-1)); | |
184 | for ( ; len > 0; len--, buf++, sys += inc) { | |
185 | if (sys == end) | |
186 | break; | |
187 | *buf = readb(sys); | |
188 | } | |
189 | card_offset += s->map_size; | |
190 | addr = 0; | |
191 | } | |
192 | } | |
193 | cs_dbg(s, 3, " %#2.2x %#2.2x %#2.2x %#2.2x ...\n", | |
194 | *(u_char *)(ptr+0), *(u_char *)(ptr+1), | |
195 | *(u_char *)(ptr+2), *(u_char *)(ptr+3)); | |
196 | return 0; | |
197 | } | |
1a8d4663 DB |
198 | EXPORT_SYMBOL(pcmcia_read_cis_mem); |
199 | ||
1da177e4 | 200 | |
e6ea0b9e | 201 | void pcmcia_write_cis_mem(struct pcmcia_socket *s, int attr, u_int addr, |
1da177e4 LT |
202 | u_int len, void *ptr) |
203 | { | |
204 | void __iomem *sys, *end; | |
205 | unsigned char *buf = ptr; | |
206 | ||
e6ea0b9e | 207 | cs_dbg(s, 3, "pcmcia_write_cis_mem(%d, %#x, %u)\n", attr, addr, len); |
1da177e4 LT |
208 | |
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 | } | |
1a8d4663 DB |
257 | EXPORT_SYMBOL(pcmcia_write_cis_mem); |
258 | ||
1da177e4 LT |
259 | |
260 | /*====================================================================== | |
261 | ||
262 | This is a wrapper around read_cis_mem, with the same interface, | |
263 | but which caches information, for cards whose CIS may not be | |
264 | readable all the time. | |
265 | ||
266 | ======================================================================*/ | |
267 | ||
268 | static void read_cis_cache(struct pcmcia_socket *s, int attr, u_int addr, | |
53efec95 | 269 | size_t len, void *ptr) |
1da177e4 LT |
270 | { |
271 | struct cis_cache_entry *cis; | |
272 | int ret; | |
273 | ||
274 | if (s->fake_cis) { | |
53efec95 | 275 | if (s->fake_cis_len >= addr+len) |
1da177e4 LT |
276 | 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 | |
e6ea0b9e | 294 | ret = pcmcia_read_cis_mem(s, attr, addr, len, ptr); |
1da177e4 LT |
295 | |
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 | ||
309 | static void | |
310 | remove_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 | ||
322 | void destroy_cis_cache(struct pcmcia_socket *s) | |
323 | { | |
324 | struct list_head *l, *n; | |
325 | ||
326 | list_for_each_safe(l, n, &s->cis_cache) { | |
327 | struct cis_cache_entry *cis = list_entry(l, struct cis_cache_entry, node); | |
328 | ||
329 | list_del(&cis->node); | |
330 | kfree(cis); | |
331 | } | |
332 | ||
333 | /* | |
334 | * If there was a fake CIS, destroy that as well. | |
335 | */ | |
6044ec88 JJ |
336 | kfree(s->fake_cis); |
337 | s->fake_cis = NULL; | |
1da177e4 LT |
338 | } |
339 | EXPORT_SYMBOL(destroy_cis_cache); | |
340 | ||
341 | /*====================================================================== | |
342 | ||
343 | This verifies if the CIS of a card matches what is in the CIS | |
344 | cache. | |
345 | ||
346 | ======================================================================*/ | |
347 | ||
348 | int verify_cis_cache(struct pcmcia_socket *s) | |
349 | { | |
350 | struct cis_cache_entry *cis; | |
351 | char *buf; | |
352 | ||
353 | buf = kmalloc(256, GFP_KERNEL); | |
354 | if (buf == NULL) | |
355 | return -1; | |
356 | list_for_each_entry(cis, &s->cis_cache, node) { | |
357 | int len = cis->len; | |
358 | ||
359 | if (len > 256) | |
360 | len = 256; | |
361 | #ifdef CONFIG_CARDBUS | |
362 | if (s->state & SOCKET_CARDBUS) | |
363 | read_cb_mem(s, cis->attr, cis->addr, len, buf); | |
364 | else | |
365 | #endif | |
e6ea0b9e | 366 | pcmcia_read_cis_mem(s, cis->attr, cis->addr, len, buf); |
1da177e4 LT |
367 | |
368 | if (memcmp(buf, cis->cache, len) != 0) { | |
369 | kfree(buf); | |
370 | return -1; | |
371 | } | |
372 | } | |
373 | kfree(buf); | |
374 | return 0; | |
375 | } | |
376 | ||
377 | /*====================================================================== | |
378 | ||
379 | For really bad cards, we provide a facility for uploading a | |
380 | replacement CIS. | |
381 | ||
382 | ======================================================================*/ | |
383 | ||
53efec95 DB |
384 | int pcmcia_replace_cis(struct pcmcia_socket *s, |
385 | const u8 *data, const size_t len) | |
1da177e4 | 386 | { |
53efec95 | 387 | if (len > CISTPL_MAX_CIS_SIZE) |
1da177e4 | 388 | return CS_BAD_SIZE; |
53efec95 DB |
389 | kfree(s->fake_cis); |
390 | s->fake_cis = kmalloc(len, GFP_KERNEL); | |
1da177e4 LT |
391 | if (s->fake_cis == NULL) |
392 | return CS_OUT_OF_RESOURCE; | |
53efec95 DB |
393 | s->fake_cis_len = len; |
394 | memcpy(s->fake_cis, data, len); | |
1da177e4 LT |
395 | return CS_SUCCESS; |
396 | } | |
33519ddd | 397 | EXPORT_SYMBOL(pcmcia_replace_cis); |
1da177e4 LT |
398 | |
399 | /*====================================================================== | |
400 | ||
401 | The high-level CIS tuple services | |
402 | ||
403 | ======================================================================*/ | |
404 | ||
405 | typedef struct tuple_flags { | |
406 | u_int link_space:4; | |
407 | u_int has_link:1; | |
408 | u_int mfc_fn:3; | |
409 | u_int space:4; | |
410 | } tuple_flags; | |
411 | ||
412 | #define LINK_SPACE(f) (((tuple_flags *)(&(f)))->link_space) | |
413 | #define HAS_LINK(f) (((tuple_flags *)(&(f)))->has_link) | |
414 | #define MFC_FN(f) (((tuple_flags *)(&(f)))->mfc_fn) | |
415 | #define SPACE(f) (((tuple_flags *)(&(f)))->space) | |
416 | ||
417 | int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int func, tuple_t *tuple); | |
418 | ||
419 | int pccard_get_first_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple) | |
420 | { | |
421 | if (!s) | |
422 | return CS_BAD_HANDLE; | |
423 | if (!(s->state & SOCKET_PRESENT)) | |
424 | return CS_NO_CARD; | |
425 | tuple->TupleLink = tuple->Flags = 0; | |
426 | #ifdef CONFIG_CARDBUS | |
427 | if (s->state & SOCKET_CARDBUS) { | |
428 | struct pci_dev *dev = s->cb_dev; | |
429 | u_int ptr; | |
430 | pci_bus_read_config_dword(dev->subordinate, 0, PCI_CARDBUS_CIS, &ptr); | |
431 | tuple->CISOffset = ptr & ~7; | |
432 | SPACE(tuple->Flags) = (ptr & 7); | |
433 | } else | |
434 | #endif | |
435 | { | |
436 | /* Assume presence of a LONGLINK_C to address 0 */ | |
437 | tuple->CISOffset = tuple->LinkOffset = 0; | |
438 | SPACE(tuple->Flags) = HAS_LINK(tuple->Flags) = 1; | |
439 | } | |
440 | if (!(s->state & SOCKET_CARDBUS) && (s->functions > 1) && | |
441 | !(tuple->Attributes & TUPLE_RETURN_COMMON)) { | |
442 | cisdata_t req = tuple->DesiredTuple; | |
443 | tuple->DesiredTuple = CISTPL_LONGLINK_MFC; | |
444 | if (pccard_get_next_tuple(s, function, tuple) == CS_SUCCESS) { | |
445 | tuple->DesiredTuple = CISTPL_LINKTARGET; | |
446 | if (pccard_get_next_tuple(s, function, tuple) != CS_SUCCESS) | |
447 | return CS_NO_MORE_ITEMS; | |
448 | } else | |
449 | tuple->CISOffset = tuple->TupleLink = 0; | |
450 | tuple->DesiredTuple = req; | |
451 | } | |
452 | return pccard_get_next_tuple(s, function, tuple); | |
453 | } | |
454 | EXPORT_SYMBOL(pccard_get_first_tuple); | |
455 | ||
456 | static int follow_link(struct pcmcia_socket *s, tuple_t *tuple) | |
457 | { | |
458 | u_char link[5]; | |
459 | u_int ofs; | |
460 | ||
461 | if (MFC_FN(tuple->Flags)) { | |
462 | /* Get indirect link from the MFC tuple */ | |
463 | read_cis_cache(s, LINK_SPACE(tuple->Flags), | |
464 | tuple->LinkOffset, 5, link); | |
6b1e6f63 | 465 | ofs = get_unaligned_le32(link + 1); |
1da177e4 LT |
466 | SPACE(tuple->Flags) = (link[0] == CISTPL_MFC_ATTR); |
467 | /* Move to the next indirect link */ | |
468 | tuple->LinkOffset += 5; | |
469 | MFC_FN(tuple->Flags)--; | |
470 | } else if (HAS_LINK(tuple->Flags)) { | |
471 | ofs = tuple->LinkOffset; | |
472 | SPACE(tuple->Flags) = LINK_SPACE(tuple->Flags); | |
473 | HAS_LINK(tuple->Flags) = 0; | |
474 | } else { | |
475 | return -1; | |
476 | } | |
477 | if (!(s->state & SOCKET_CARDBUS) && SPACE(tuple->Flags)) { | |
478 | /* This is ugly, but a common CIS error is to code the long | |
479 | link offset incorrectly, so we check the right spot... */ | |
480 | read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link); | |
481 | if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) && | |
482 | (strncmp(link+2, "CIS", 3) == 0)) | |
483 | return ofs; | |
484 | remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5); | |
485 | /* Then, we try the wrong spot... */ | |
486 | ofs = ofs >> 1; | |
487 | } | |
488 | read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link); | |
489 | if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) && | |
490 | (strncmp(link+2, "CIS", 3) == 0)) | |
491 | return ofs; | |
492 | remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5); | |
493 | return -1; | |
494 | } | |
495 | ||
496 | int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple) | |
497 | { | |
498 | u_char link[2], tmp; | |
499 | int ofs, i, attr; | |
500 | ||
501 | if (!s) | |
502 | return CS_BAD_HANDLE; | |
503 | if (!(s->state & SOCKET_PRESENT)) | |
504 | return CS_NO_CARD; | |
505 | ||
506 | link[1] = tuple->TupleLink; | |
507 | ofs = tuple->CISOffset + tuple->TupleLink; | |
508 | attr = SPACE(tuple->Flags); | |
509 | ||
510 | for (i = 0; i < MAX_TUPLES; i++) { | |
511 | if (link[1] == 0xff) { | |
512 | link[0] = CISTPL_END; | |
513 | } else { | |
514 | read_cis_cache(s, attr, ofs, 2, link); | |
515 | if (link[0] == CISTPL_NULL) { | |
516 | ofs++; continue; | |
517 | } | |
518 | } | |
519 | ||
520 | /* End of chain? Follow long link if possible */ | |
521 | if (link[0] == CISTPL_END) { | |
522 | if ((ofs = follow_link(s, tuple)) < 0) | |
523 | return CS_NO_MORE_ITEMS; | |
524 | attr = SPACE(tuple->Flags); | |
525 | read_cis_cache(s, attr, ofs, 2, link); | |
526 | } | |
527 | ||
528 | /* Is this a link tuple? Make a note of it */ | |
529 | if ((link[0] == CISTPL_LONGLINK_A) || | |
530 | (link[0] == CISTPL_LONGLINK_C) || | |
531 | (link[0] == CISTPL_LONGLINK_MFC) || | |
532 | (link[0] == CISTPL_LINKTARGET) || | |
533 | (link[0] == CISTPL_INDIRECT) || | |
534 | (link[0] == CISTPL_NO_LINK)) { | |
535 | switch (link[0]) { | |
536 | case CISTPL_LONGLINK_A: | |
537 | HAS_LINK(tuple->Flags) = 1; | |
538 | LINK_SPACE(tuple->Flags) = attr | IS_ATTR; | |
539 | read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset); | |
540 | break; | |
541 | case CISTPL_LONGLINK_C: | |
542 | HAS_LINK(tuple->Flags) = 1; | |
543 | LINK_SPACE(tuple->Flags) = attr & ~IS_ATTR; | |
544 | read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset); | |
545 | break; | |
546 | case CISTPL_INDIRECT: | |
547 | HAS_LINK(tuple->Flags) = 1; | |
548 | LINK_SPACE(tuple->Flags) = IS_ATTR | IS_INDIRECT; | |
549 | tuple->LinkOffset = 0; | |
550 | break; | |
551 | case CISTPL_LONGLINK_MFC: | |
552 | tuple->LinkOffset = ofs + 3; | |
553 | LINK_SPACE(tuple->Flags) = attr; | |
554 | if (function == BIND_FN_ALL) { | |
555 | /* Follow all the MFC links */ | |
556 | read_cis_cache(s, attr, ofs+2, 1, &tmp); | |
557 | MFC_FN(tuple->Flags) = tmp; | |
558 | } else { | |
559 | /* Follow exactly one of the links */ | |
560 | MFC_FN(tuple->Flags) = 1; | |
561 | tuple->LinkOffset += function * 5; | |
562 | } | |
563 | break; | |
564 | case CISTPL_NO_LINK: | |
565 | HAS_LINK(tuple->Flags) = 0; | |
566 | break; | |
567 | } | |
568 | if ((tuple->Attributes & TUPLE_RETURN_LINK) && | |
569 | (tuple->DesiredTuple == RETURN_FIRST_TUPLE)) | |
570 | break; | |
571 | } else | |
572 | if (tuple->DesiredTuple == RETURN_FIRST_TUPLE) | |
573 | break; | |
574 | ||
575 | if (link[0] == tuple->DesiredTuple) | |
576 | break; | |
577 | ofs += link[1] + 2; | |
578 | } | |
579 | if (i == MAX_TUPLES) { | |
580 | cs_dbg(s, 1, "cs: overrun in pcmcia_get_next_tuple\n"); | |
581 | return CS_NO_MORE_ITEMS; | |
582 | } | |
583 | ||
584 | tuple->TupleCode = link[0]; | |
585 | tuple->TupleLink = link[1]; | |
586 | tuple->CISOffset = ofs + 2; | |
587 | return CS_SUCCESS; | |
588 | } | |
589 | EXPORT_SYMBOL(pccard_get_next_tuple); | |
590 | ||
591 | /*====================================================================*/ | |
592 | ||
593 | #define _MIN(a, b) (((a) < (b)) ? (a) : (b)) | |
594 | ||
595 | int pccard_get_tuple_data(struct pcmcia_socket *s, tuple_t *tuple) | |
596 | { | |
597 | u_int len; | |
598 | ||
599 | if (!s) | |
600 | return CS_BAD_HANDLE; | |
601 | ||
602 | if (tuple->TupleLink < tuple->TupleOffset) | |
603 | return CS_NO_MORE_ITEMS; | |
604 | len = tuple->TupleLink - tuple->TupleOffset; | |
605 | tuple->TupleDataLen = tuple->TupleLink; | |
606 | if (len == 0) | |
607 | return CS_SUCCESS; | |
608 | read_cis_cache(s, SPACE(tuple->Flags), | |
609 | tuple->CISOffset + tuple->TupleOffset, | |
610 | _MIN(len, tuple->TupleDataMax), tuple->TupleData); | |
611 | return CS_SUCCESS; | |
612 | } | |
613 | EXPORT_SYMBOL(pccard_get_tuple_data); | |
614 | ||
615 | ||
616 | /*====================================================================== | |
617 | ||
618 | Parsing routines for individual tuples | |
619 | ||
620 | ======================================================================*/ | |
621 | ||
622 | static int parse_device(tuple_t *tuple, cistpl_device_t *device) | |
623 | { | |
624 | int i; | |
625 | u_char scale; | |
626 | u_char *p, *q; | |
627 | ||
628 | p = (u_char *)tuple->TupleData; | |
629 | q = p + tuple->TupleDataLen; | |
630 | ||
631 | device->ndev = 0; | |
632 | for (i = 0; i < CISTPL_MAX_DEVICES; i++) { | |
633 | ||
634 | if (*p == 0xff) break; | |
635 | device->dev[i].type = (*p >> 4); | |
636 | device->dev[i].wp = (*p & 0x08) ? 1 : 0; | |
637 | switch (*p & 0x07) { | |
638 | case 0: device->dev[i].speed = 0; break; | |
639 | case 1: device->dev[i].speed = 250; break; | |
640 | case 2: device->dev[i].speed = 200; break; | |
641 | case 3: device->dev[i].speed = 150; break; | |
642 | case 4: device->dev[i].speed = 100; break; | |
643 | case 7: | |
644 | if (++p == q) return CS_BAD_TUPLE; | |
645 | device->dev[i].speed = SPEED_CVT(*p); | |
646 | while (*p & 0x80) | |
647 | if (++p == q) return CS_BAD_TUPLE; | |
648 | break; | |
649 | default: | |
650 | return CS_BAD_TUPLE; | |
651 | } | |
652 | ||
653 | if (++p == q) return CS_BAD_TUPLE; | |
654 | if (*p == 0xff) break; | |
655 | scale = *p & 7; | |
656 | if (scale == 7) return CS_BAD_TUPLE; | |
657 | device->dev[i].size = ((*p >> 3) + 1) * (512 << (scale*2)); | |
658 | device->ndev++; | |
659 | if (++p == q) break; | |
660 | } | |
661 | ||
662 | return CS_SUCCESS; | |
663 | } | |
664 | ||
665 | /*====================================================================*/ | |
666 | ||
667 | static int parse_checksum(tuple_t *tuple, cistpl_checksum_t *csum) | |
668 | { | |
669 | u_char *p; | |
670 | if (tuple->TupleDataLen < 5) | |
671 | return CS_BAD_TUPLE; | |
dc0cf6a2 | 672 | p = (u_char *) tuple->TupleData; |
6b1e6f63 HH |
673 | csum->addr = tuple->CISOffset + get_unaligned_le16(p) - 2; |
674 | csum->len = get_unaligned_le16(p + 2); | |
dc0cf6a2 | 675 | csum->sum = *(p + 4); |
1da177e4 LT |
676 | return CS_SUCCESS; |
677 | } | |
678 | ||
679 | /*====================================================================*/ | |
680 | ||
681 | static int parse_longlink(tuple_t *tuple, cistpl_longlink_t *link) | |
682 | { | |
683 | if (tuple->TupleDataLen < 4) | |
684 | return CS_BAD_TUPLE; | |
6b1e6f63 | 685 | link->addr = get_unaligned_le32(tuple->TupleData); |
1da177e4 LT |
686 | return CS_SUCCESS; |
687 | } | |
688 | ||
689 | /*====================================================================*/ | |
690 | ||
691 | static int parse_longlink_mfc(tuple_t *tuple, | |
692 | cistpl_longlink_mfc_t *link) | |
693 | { | |
694 | u_char *p; | |
695 | int i; | |
696 | ||
697 | p = (u_char *)tuple->TupleData; | |
698 | ||
699 | link->nfn = *p; p++; | |
700 | if (tuple->TupleDataLen <= link->nfn*5) | |
701 | return CS_BAD_TUPLE; | |
702 | for (i = 0; i < link->nfn; i++) { | |
703 | link->fn[i].space = *p; p++; | |
6b1e6f63 | 704 | link->fn[i].addr = get_unaligned_le32(p); |
dc0cf6a2 | 705 | p += 4; |
1da177e4 LT |
706 | } |
707 | return CS_SUCCESS; | |
708 | } | |
709 | ||
710 | /*====================================================================*/ | |
711 | ||
712 | static int parse_strings(u_char *p, u_char *q, int max, | |
713 | char *s, u_char *ofs, u_char *found) | |
714 | { | |
715 | int i, j, ns; | |
716 | ||
717 | if (p == q) return CS_BAD_TUPLE; | |
718 | ns = 0; j = 0; | |
719 | for (i = 0; i < max; i++) { | |
720 | if (*p == 0xff) break; | |
721 | ofs[i] = j; | |
722 | ns++; | |
723 | for (;;) { | |
724 | s[j++] = (*p == 0xff) ? '\0' : *p; | |
725 | if ((*p == '\0') || (*p == 0xff)) break; | |
726 | if (++p == q) return CS_BAD_TUPLE; | |
727 | } | |
728 | if ((*p == 0xff) || (++p == q)) break; | |
729 | } | |
730 | if (found) { | |
731 | *found = ns; | |
732 | return CS_SUCCESS; | |
733 | } else { | |
734 | return (ns == max) ? CS_SUCCESS : CS_BAD_TUPLE; | |
735 | } | |
736 | } | |
737 | ||
738 | /*====================================================================*/ | |
739 | ||
740 | static int parse_vers_1(tuple_t *tuple, cistpl_vers_1_t *vers_1) | |
741 | { | |
742 | u_char *p, *q; | |
743 | ||
744 | p = (u_char *)tuple->TupleData; | |
745 | q = p + tuple->TupleDataLen; | |
746 | ||
747 | vers_1->major = *p; p++; | |
748 | vers_1->minor = *p; p++; | |
749 | if (p >= q) return CS_BAD_TUPLE; | |
750 | ||
751 | return parse_strings(p, q, CISTPL_VERS_1_MAX_PROD_STRINGS, | |
752 | vers_1->str, vers_1->ofs, &vers_1->ns); | |
753 | } | |
754 | ||
755 | /*====================================================================*/ | |
756 | ||
757 | static int parse_altstr(tuple_t *tuple, cistpl_altstr_t *altstr) | |
758 | { | |
759 | u_char *p, *q; | |
760 | ||
761 | p = (u_char *)tuple->TupleData; | |
762 | q = p + tuple->TupleDataLen; | |
763 | ||
764 | return parse_strings(p, q, CISTPL_MAX_ALTSTR_STRINGS, | |
765 | altstr->str, altstr->ofs, &altstr->ns); | |
766 | } | |
767 | ||
768 | /*====================================================================*/ | |
769 | ||
770 | static int parse_jedec(tuple_t *tuple, cistpl_jedec_t *jedec) | |
771 | { | |
772 | u_char *p, *q; | |
773 | int nid; | |
774 | ||
775 | p = (u_char *)tuple->TupleData; | |
776 | q = p + tuple->TupleDataLen; | |
777 | ||
778 | for (nid = 0; nid < CISTPL_MAX_DEVICES; nid++) { | |
779 | if (p > q-2) break; | |
780 | jedec->id[nid].mfr = p[0]; | |
781 | jedec->id[nid].info = p[1]; | |
782 | p += 2; | |
783 | } | |
784 | jedec->nid = nid; | |
785 | return CS_SUCCESS; | |
786 | } | |
787 | ||
788 | /*====================================================================*/ | |
789 | ||
790 | static int parse_manfid(tuple_t *tuple, cistpl_manfid_t *m) | |
791 | { | |
1da177e4 LT |
792 | if (tuple->TupleDataLen < 4) |
793 | return CS_BAD_TUPLE; | |
6b1e6f63 HH |
794 | m->manf = get_unaligned_le16(tuple->TupleData); |
795 | m->card = get_unaligned_le16(tuple->TupleData + 2); | |
1da177e4 LT |
796 | return CS_SUCCESS; |
797 | } | |
798 | ||
799 | /*====================================================================*/ | |
800 | ||
801 | static int parse_funcid(tuple_t *tuple, cistpl_funcid_t *f) | |
802 | { | |
803 | u_char *p; | |
804 | if (tuple->TupleDataLen < 2) | |
805 | return CS_BAD_TUPLE; | |
806 | p = (u_char *)tuple->TupleData; | |
807 | f->func = p[0]; | |
808 | f->sysinit = p[1]; | |
809 | return CS_SUCCESS; | |
810 | } | |
811 | ||
812 | /*====================================================================*/ | |
813 | ||
814 | static int parse_funce(tuple_t *tuple, cistpl_funce_t *f) | |
815 | { | |
816 | u_char *p; | |
817 | int i; | |
818 | if (tuple->TupleDataLen < 1) | |
819 | return CS_BAD_TUPLE; | |
820 | p = (u_char *)tuple->TupleData; | |
821 | f->type = p[0]; | |
822 | for (i = 1; i < tuple->TupleDataLen; i++) | |
823 | f->data[i-1] = p[i]; | |
824 | return CS_SUCCESS; | |
825 | } | |
826 | ||
827 | /*====================================================================*/ | |
828 | ||
829 | static int parse_config(tuple_t *tuple, cistpl_config_t *config) | |
830 | { | |
831 | int rasz, rmsz, i; | |
832 | u_char *p; | |
833 | ||
834 | p = (u_char *)tuple->TupleData; | |
835 | rasz = *p & 0x03; | |
836 | rmsz = (*p & 0x3c) >> 2; | |
837 | if (tuple->TupleDataLen < rasz+rmsz+4) | |
838 | return CS_BAD_TUPLE; | |
839 | config->last_idx = *(++p); | |
840 | p++; | |
841 | config->base = 0; | |
842 | for (i = 0; i <= rasz; i++) | |
843 | config->base += p[i] << (8*i); | |
844 | p += rasz+1; | |
845 | for (i = 0; i < 4; i++) | |
846 | config->rmask[i] = 0; | |
847 | for (i = 0; i <= rmsz; i++) | |
848 | config->rmask[i>>2] += p[i] << (8*(i%4)); | |
849 | config->subtuples = tuple->TupleDataLen - (rasz+rmsz+4); | |
850 | return CS_SUCCESS; | |
851 | } | |
852 | ||
853 | /*====================================================================== | |
854 | ||
855 | The following routines are all used to parse the nightmarish | |
856 | config table entries. | |
857 | ||
858 | ======================================================================*/ | |
859 | ||
860 | static u_char *parse_power(u_char *p, u_char *q, | |
861 | cistpl_power_t *pwr) | |
862 | { | |
863 | int i; | |
864 | u_int scale; | |
865 | ||
866 | if (p == q) return NULL; | |
867 | pwr->present = *p; | |
868 | pwr->flags = 0; | |
869 | p++; | |
870 | for (i = 0; i < 7; i++) | |
871 | if (pwr->present & (1<<i)) { | |
872 | if (p == q) return NULL; | |
873 | pwr->param[i] = POWER_CVT(*p); | |
874 | scale = POWER_SCALE(*p); | |
875 | while (*p & 0x80) { | |
876 | if (++p == q) return NULL; | |
877 | if ((*p & 0x7f) < 100) | |
878 | pwr->param[i] += (*p & 0x7f) * scale / 100; | |
879 | else if (*p == 0x7d) | |
880 | pwr->flags |= CISTPL_POWER_HIGHZ_OK; | |
881 | else if (*p == 0x7e) | |
882 | pwr->param[i] = 0; | |
883 | else if (*p == 0x7f) | |
884 | pwr->flags |= CISTPL_POWER_HIGHZ_REQ; | |
885 | else | |
886 | return NULL; | |
887 | } | |
888 | p++; | |
889 | } | |
890 | return p; | |
891 | } | |
892 | ||
893 | /*====================================================================*/ | |
894 | ||
895 | static u_char *parse_timing(u_char *p, u_char *q, | |
896 | cistpl_timing_t *timing) | |
897 | { | |
898 | u_char scale; | |
899 | ||
900 | if (p == q) return NULL; | |
901 | scale = *p; | |
902 | if ((scale & 3) != 3) { | |
903 | if (++p == q) return NULL; | |
904 | timing->wait = SPEED_CVT(*p); | |
905 | timing->waitscale = exponent[scale & 3]; | |
906 | } else | |
907 | timing->wait = 0; | |
908 | scale >>= 2; | |
909 | if ((scale & 7) != 7) { | |
910 | if (++p == q) return NULL; | |
911 | timing->ready = SPEED_CVT(*p); | |
912 | timing->rdyscale = exponent[scale & 7]; | |
913 | } else | |
914 | timing->ready = 0; | |
915 | scale >>= 3; | |
916 | if (scale != 7) { | |
917 | if (++p == q) return NULL; | |
918 | timing->reserved = SPEED_CVT(*p); | |
919 | timing->rsvscale = exponent[scale]; | |
920 | } else | |
921 | timing->reserved = 0; | |
922 | p++; | |
923 | return p; | |
924 | } | |
925 | ||
926 | /*====================================================================*/ | |
927 | ||
928 | static u_char *parse_io(u_char *p, u_char *q, cistpl_io_t *io) | |
929 | { | |
930 | int i, j, bsz, lsz; | |
931 | ||
932 | if (p == q) return NULL; | |
933 | io->flags = *p; | |
934 | ||
935 | if (!(*p & 0x80)) { | |
936 | io->nwin = 1; | |
937 | io->win[0].base = 0; | |
938 | io->win[0].len = (1 << (io->flags & CISTPL_IO_LINES_MASK)); | |
939 | return p+1; | |
940 | } | |
941 | ||
942 | if (++p == q) return NULL; | |
943 | io->nwin = (*p & 0x0f) + 1; | |
944 | bsz = (*p & 0x30) >> 4; | |
945 | if (bsz == 3) bsz++; | |
946 | lsz = (*p & 0xc0) >> 6; | |
947 | if (lsz == 3) lsz++; | |
948 | p++; | |
949 | ||
950 | for (i = 0; i < io->nwin; i++) { | |
951 | io->win[i].base = 0; | |
952 | io->win[i].len = 1; | |
953 | for (j = 0; j < bsz; j++, p++) { | |
954 | if (p == q) return NULL; | |
955 | io->win[i].base += *p << (j*8); | |
956 | } | |
957 | for (j = 0; j < lsz; j++, p++) { | |
958 | if (p == q) return NULL; | |
959 | io->win[i].len += *p << (j*8); | |
960 | } | |
961 | } | |
962 | return p; | |
963 | } | |
964 | ||
965 | /*====================================================================*/ | |
966 | ||
967 | static u_char *parse_mem(u_char *p, u_char *q, cistpl_mem_t *mem) | |
968 | { | |
969 | int i, j, asz, lsz, has_ha; | |
970 | u_int len, ca, ha; | |
971 | ||
972 | if (p == q) return NULL; | |
973 | ||
974 | mem->nwin = (*p & 0x07) + 1; | |
975 | lsz = (*p & 0x18) >> 3; | |
976 | asz = (*p & 0x60) >> 5; | |
977 | has_ha = (*p & 0x80); | |
978 | if (++p == q) return NULL; | |
979 | ||
980 | for (i = 0; i < mem->nwin; i++) { | |
981 | len = ca = ha = 0; | |
982 | for (j = 0; j < lsz; j++, p++) { | |
983 | if (p == q) return NULL; | |
984 | len += *p << (j*8); | |
985 | } | |
986 | for (j = 0; j < asz; j++, p++) { | |
987 | if (p == q) return NULL; | |
988 | ca += *p << (j*8); | |
989 | } | |
990 | if (has_ha) | |
991 | for (j = 0; j < asz; j++, p++) { | |
992 | if (p == q) return NULL; | |
993 | ha += *p << (j*8); | |
994 | } | |
995 | mem->win[i].len = len << 8; | |
996 | mem->win[i].card_addr = ca << 8; | |
997 | mem->win[i].host_addr = ha << 8; | |
998 | } | |
999 | return p; | |
1000 | } | |
1001 | ||
1002 | /*====================================================================*/ | |
1003 | ||
1004 | static u_char *parse_irq(u_char *p, u_char *q, cistpl_irq_t *irq) | |
1005 | { | |
1006 | if (p == q) return NULL; | |
1007 | irq->IRQInfo1 = *p; p++; | |
1008 | if (irq->IRQInfo1 & IRQ_INFO2_VALID) { | |
1009 | if (p+2 > q) return NULL; | |
1010 | irq->IRQInfo2 = (p[1]<<8) + p[0]; | |
1011 | p += 2; | |
1012 | } | |
1013 | return p; | |
1014 | } | |
1015 | ||
1016 | /*====================================================================*/ | |
1017 | ||
1018 | static int parse_cftable_entry(tuple_t *tuple, | |
1019 | cistpl_cftable_entry_t *entry) | |
1020 | { | |
1021 | u_char *p, *q, features; | |
1022 | ||
1023 | p = tuple->TupleData; | |
1024 | q = p + tuple->TupleDataLen; | |
1025 | entry->index = *p & 0x3f; | |
1026 | entry->flags = 0; | |
1027 | if (*p & 0x40) | |
1028 | entry->flags |= CISTPL_CFTABLE_DEFAULT; | |
1029 | if (*p & 0x80) { | |
1030 | if (++p == q) return CS_BAD_TUPLE; | |
1031 | if (*p & 0x10) | |
1032 | entry->flags |= CISTPL_CFTABLE_BVDS; | |
1033 | if (*p & 0x20) | |
1034 | entry->flags |= CISTPL_CFTABLE_WP; | |
1035 | if (*p & 0x40) | |
1036 | entry->flags |= CISTPL_CFTABLE_RDYBSY; | |
1037 | if (*p & 0x80) | |
1038 | entry->flags |= CISTPL_CFTABLE_MWAIT; | |
1039 | entry->interface = *p & 0x0f; | |
1040 | } else | |
1041 | entry->interface = 0; | |
1042 | ||
1043 | /* Process optional features */ | |
1044 | if (++p == q) return CS_BAD_TUPLE; | |
1045 | features = *p; p++; | |
1046 | ||
1047 | /* Power options */ | |
1048 | if ((features & 3) > 0) { | |
1049 | p = parse_power(p, q, &entry->vcc); | |
1050 | if (p == NULL) return CS_BAD_TUPLE; | |
1051 | } else | |
1052 | entry->vcc.present = 0; | |
1053 | if ((features & 3) > 1) { | |
1054 | p = parse_power(p, q, &entry->vpp1); | |
1055 | if (p == NULL) return CS_BAD_TUPLE; | |
1056 | } else | |
1057 | entry->vpp1.present = 0; | |
1058 | if ((features & 3) > 2) { | |
1059 | p = parse_power(p, q, &entry->vpp2); | |
1060 | if (p == NULL) return CS_BAD_TUPLE; | |
1061 | } else | |
1062 | entry->vpp2.present = 0; | |
1063 | ||
1064 | /* Timing options */ | |
1065 | if (features & 0x04) { | |
1066 | p = parse_timing(p, q, &entry->timing); | |
1067 | if (p == NULL) return CS_BAD_TUPLE; | |
1068 | } else { | |
1069 | entry->timing.wait = 0; | |
1070 | entry->timing.ready = 0; | |
1071 | entry->timing.reserved = 0; | |
1072 | } | |
1073 | ||
1074 | /* I/O window options */ | |
1075 | if (features & 0x08) { | |
1076 | p = parse_io(p, q, &entry->io); | |
1077 | if (p == NULL) return CS_BAD_TUPLE; | |
1078 | } else | |
1079 | entry->io.nwin = 0; | |
1080 | ||
1081 | /* Interrupt options */ | |
1082 | if (features & 0x10) { | |
1083 | p = parse_irq(p, q, &entry->irq); | |
1084 | if (p == NULL) return CS_BAD_TUPLE; | |
1085 | } else | |
1086 | entry->irq.IRQInfo1 = 0; | |
1087 | ||
1088 | switch (features & 0x60) { | |
1089 | case 0x00: | |
1090 | entry->mem.nwin = 0; | |
1091 | break; | |
1092 | case 0x20: | |
1093 | entry->mem.nwin = 1; | |
6b1e6f63 | 1094 | entry->mem.win[0].len = get_unaligned_le16(p) << 8; |
1da177e4 LT |
1095 | entry->mem.win[0].card_addr = 0; |
1096 | entry->mem.win[0].host_addr = 0; | |
1097 | p += 2; | |
1098 | if (p > q) return CS_BAD_TUPLE; | |
1099 | break; | |
1100 | case 0x40: | |
1101 | entry->mem.nwin = 1; | |
6b1e6f63 HH |
1102 | entry->mem.win[0].len = get_unaligned_le16(p) << 8; |
1103 | entry->mem.win[0].card_addr = get_unaligned_le16(p + 2) << 8; | |
1da177e4 LT |
1104 | entry->mem.win[0].host_addr = 0; |
1105 | p += 4; | |
1106 | if (p > q) return CS_BAD_TUPLE; | |
1107 | break; | |
1108 | case 0x60: | |
1109 | p = parse_mem(p, q, &entry->mem); | |
1110 | if (p == NULL) return CS_BAD_TUPLE; | |
1111 | break; | |
1112 | } | |
1113 | ||
1114 | /* Misc features */ | |
1115 | if (features & 0x80) { | |
1116 | if (p == q) return CS_BAD_TUPLE; | |
1117 | entry->flags |= (*p << 8); | |
1118 | while (*p & 0x80) | |
1119 | if (++p == q) return CS_BAD_TUPLE; | |
1120 | p++; | |
1121 | } | |
1122 | ||
1123 | entry->subtuples = q-p; | |
1124 | ||
1125 | return CS_SUCCESS; | |
1126 | } | |
1127 | ||
1128 | /*====================================================================*/ | |
1129 | ||
1130 | #ifdef CONFIG_CARDBUS | |
1131 | ||
1132 | static int parse_bar(tuple_t *tuple, cistpl_bar_t *bar) | |
1133 | { | |
1134 | u_char *p; | |
1135 | if (tuple->TupleDataLen < 6) | |
1136 | return CS_BAD_TUPLE; | |
1137 | p = (u_char *)tuple->TupleData; | |
1138 | bar->attr = *p; | |
1139 | p += 2; | |
6b1e6f63 | 1140 | bar->size = get_unaligned_le32(p); |
1da177e4 LT |
1141 | return CS_SUCCESS; |
1142 | } | |
1143 | ||
1144 | static int parse_config_cb(tuple_t *tuple, cistpl_config_t *config) | |
1145 | { | |
1146 | u_char *p; | |
1147 | ||
1148 | p = (u_char *)tuple->TupleData; | |
1149 | if ((*p != 3) || (tuple->TupleDataLen < 6)) | |
1150 | return CS_BAD_TUPLE; | |
1151 | config->last_idx = *(++p); | |
1152 | p++; | |
6b1e6f63 | 1153 | config->base = get_unaligned_le32(p); |
1da177e4 LT |
1154 | config->subtuples = tuple->TupleDataLen - 6; |
1155 | return CS_SUCCESS; | |
1156 | } | |
1157 | ||
1158 | static int parse_cftable_entry_cb(tuple_t *tuple, | |
1159 | cistpl_cftable_entry_cb_t *entry) | |
1160 | { | |
1161 | u_char *p, *q, features; | |
1162 | ||
1163 | p = tuple->TupleData; | |
1164 | q = p + tuple->TupleDataLen; | |
1165 | entry->index = *p & 0x3f; | |
1166 | entry->flags = 0; | |
1167 | if (*p & 0x40) | |
1168 | entry->flags |= CISTPL_CFTABLE_DEFAULT; | |
1169 | ||
1170 | /* Process optional features */ | |
1171 | if (++p == q) return CS_BAD_TUPLE; | |
1172 | features = *p; p++; | |
1173 | ||
1174 | /* Power options */ | |
1175 | if ((features & 3) > 0) { | |
1176 | p = parse_power(p, q, &entry->vcc); | |
1177 | if (p == NULL) return CS_BAD_TUPLE; | |
1178 | } else | |
1179 | entry->vcc.present = 0; | |
1180 | if ((features & 3) > 1) { | |
1181 | p = parse_power(p, q, &entry->vpp1); | |
1182 | if (p == NULL) return CS_BAD_TUPLE; | |
1183 | } else | |
1184 | entry->vpp1.present = 0; | |
1185 | if ((features & 3) > 2) { | |
1186 | p = parse_power(p, q, &entry->vpp2); | |
1187 | if (p == NULL) return CS_BAD_TUPLE; | |
1188 | } else | |
1189 | entry->vpp2.present = 0; | |
1190 | ||
1191 | /* I/O window options */ | |
1192 | if (features & 0x08) { | |
1193 | if (p == q) return CS_BAD_TUPLE; | |
1194 | entry->io = *p; p++; | |
1195 | } else | |
1196 | entry->io = 0; | |
1197 | ||
1198 | /* Interrupt options */ | |
1199 | if (features & 0x10) { | |
1200 | p = parse_irq(p, q, &entry->irq); | |
1201 | if (p == NULL) return CS_BAD_TUPLE; | |
1202 | } else | |
1203 | entry->irq.IRQInfo1 = 0; | |
1204 | ||
1205 | if (features & 0x20) { | |
1206 | if (p == q) return CS_BAD_TUPLE; | |
1207 | entry->mem = *p; p++; | |
1208 | } else | |
1209 | entry->mem = 0; | |
1210 | ||
1211 | /* Misc features */ | |
1212 | if (features & 0x80) { | |
1213 | if (p == q) return CS_BAD_TUPLE; | |
1214 | entry->flags |= (*p << 8); | |
1215 | if (*p & 0x80) { | |
1216 | if (++p == q) return CS_BAD_TUPLE; | |
1217 | entry->flags |= (*p << 16); | |
1218 | } | |
1219 | while (*p & 0x80) | |
1220 | if (++p == q) return CS_BAD_TUPLE; | |
1221 | p++; | |
1222 | } | |
1223 | ||
1224 | entry->subtuples = q-p; | |
1225 | ||
1226 | return CS_SUCCESS; | |
1227 | } | |
1228 | ||
1229 | #endif | |
1230 | ||
1231 | /*====================================================================*/ | |
1232 | ||
1233 | static int parse_device_geo(tuple_t *tuple, cistpl_device_geo_t *geo) | |
1234 | { | |
1235 | u_char *p, *q; | |
1236 | int n; | |
1237 | ||
1238 | p = (u_char *)tuple->TupleData; | |
1239 | q = p + tuple->TupleDataLen; | |
1240 | ||
1241 | for (n = 0; n < CISTPL_MAX_DEVICES; n++) { | |
1242 | if (p > q-6) break; | |
1243 | geo->geo[n].buswidth = p[0]; | |
1244 | geo->geo[n].erase_block = 1 << (p[1]-1); | |
1245 | geo->geo[n].read_block = 1 << (p[2]-1); | |
1246 | geo->geo[n].write_block = 1 << (p[3]-1); | |
1247 | geo->geo[n].partition = 1 << (p[4]-1); | |
1248 | geo->geo[n].interleave = 1 << (p[5]-1); | |
1249 | p += 6; | |
1250 | } | |
1251 | geo->ngeo = n; | |
1252 | return CS_SUCCESS; | |
1253 | } | |
1254 | ||
1255 | /*====================================================================*/ | |
1256 | ||
1257 | static int parse_vers_2(tuple_t *tuple, cistpl_vers_2_t *v2) | |
1258 | { | |
1259 | u_char *p, *q; | |
1260 | ||
1261 | if (tuple->TupleDataLen < 10) | |
1262 | return CS_BAD_TUPLE; | |
1263 | ||
1264 | p = tuple->TupleData; | |
1265 | q = p + tuple->TupleDataLen; | |
1266 | ||
1267 | v2->vers = p[0]; | |
1268 | v2->comply = p[1]; | |
6b1e6f63 | 1269 | v2->dindex = get_unaligned_le16(p +2 ); |
1da177e4 LT |
1270 | v2->vspec8 = p[6]; |
1271 | v2->vspec9 = p[7]; | |
1272 | v2->nhdr = p[8]; | |
1273 | p += 9; | |
1274 | return parse_strings(p, q, 2, v2->str, &v2->vendor, NULL); | |
1275 | } | |
1276 | ||
1277 | /*====================================================================*/ | |
1278 | ||
1279 | static int parse_org(tuple_t *tuple, cistpl_org_t *org) | |
1280 | { | |
1281 | u_char *p, *q; | |
1282 | int i; | |
1283 | ||
1284 | p = tuple->TupleData; | |
1285 | q = p + tuple->TupleDataLen; | |
1286 | if (p == q) return CS_BAD_TUPLE; | |
1287 | org->data_org = *p; | |
1288 | if (++p == q) return CS_BAD_TUPLE; | |
1289 | for (i = 0; i < 30; i++) { | |
1290 | org->desc[i] = *p; | |
1291 | if (*p == '\0') break; | |
1292 | if (++p == q) return CS_BAD_TUPLE; | |
1293 | } | |
1294 | return CS_SUCCESS; | |
1295 | } | |
1296 | ||
1297 | /*====================================================================*/ | |
1298 | ||
1299 | static int parse_format(tuple_t *tuple, cistpl_format_t *fmt) | |
1300 | { | |
1301 | u_char *p; | |
1302 | ||
1303 | if (tuple->TupleDataLen < 10) | |
1304 | return CS_BAD_TUPLE; | |
1305 | ||
1306 | p = tuple->TupleData; | |
1307 | ||
1308 | fmt->type = p[0]; | |
1309 | fmt->edc = p[1]; | |
6b1e6f63 HH |
1310 | fmt->offset = get_unaligned_le32(p + 2); |
1311 | fmt->length = get_unaligned_le32(p + 6); | |
1da177e4 LT |
1312 | |
1313 | return CS_SUCCESS; | |
1314 | } | |
1315 | ||
1316 | /*====================================================================*/ | |
1317 | ||
1318 | int pccard_parse_tuple(tuple_t *tuple, cisparse_t *parse) | |
1319 | { | |
1320 | int ret = CS_SUCCESS; | |
1321 | ||
1322 | if (tuple->TupleDataLen > tuple->TupleDataMax) | |
1323 | return CS_BAD_TUPLE; | |
1324 | switch (tuple->TupleCode) { | |
1325 | case CISTPL_DEVICE: | |
1326 | case CISTPL_DEVICE_A: | |
1327 | ret = parse_device(tuple, &parse->device); | |
1328 | break; | |
1329 | #ifdef CONFIG_CARDBUS | |
1330 | case CISTPL_BAR: | |
1331 | ret = parse_bar(tuple, &parse->bar); | |
1332 | break; | |
1333 | case CISTPL_CONFIG_CB: | |
1334 | ret = parse_config_cb(tuple, &parse->config); | |
1335 | break; | |
1336 | case CISTPL_CFTABLE_ENTRY_CB: | |
1337 | ret = parse_cftable_entry_cb(tuple, &parse->cftable_entry_cb); | |
1338 | break; | |
1339 | #endif | |
1340 | case CISTPL_CHECKSUM: | |
1341 | ret = parse_checksum(tuple, &parse->checksum); | |
1342 | break; | |
1343 | case CISTPL_LONGLINK_A: | |
1344 | case CISTPL_LONGLINK_C: | |
1345 | ret = parse_longlink(tuple, &parse->longlink); | |
1346 | break; | |
1347 | case CISTPL_LONGLINK_MFC: | |
1348 | ret = parse_longlink_mfc(tuple, &parse->longlink_mfc); | |
1349 | break; | |
1350 | case CISTPL_VERS_1: | |
1351 | ret = parse_vers_1(tuple, &parse->version_1); | |
1352 | break; | |
1353 | case CISTPL_ALTSTR: | |
1354 | ret = parse_altstr(tuple, &parse->altstr); | |
1355 | break; | |
1356 | case CISTPL_JEDEC_A: | |
1357 | case CISTPL_JEDEC_C: | |
1358 | ret = parse_jedec(tuple, &parse->jedec); | |
1359 | break; | |
1360 | case CISTPL_MANFID: | |
1361 | ret = parse_manfid(tuple, &parse->manfid); | |
1362 | break; | |
1363 | case CISTPL_FUNCID: | |
1364 | ret = parse_funcid(tuple, &parse->funcid); | |
1365 | break; | |
1366 | case CISTPL_FUNCE: | |
1367 | ret = parse_funce(tuple, &parse->funce); | |
1368 | break; | |
1369 | case CISTPL_CONFIG: | |
1370 | ret = parse_config(tuple, &parse->config); | |
1371 | break; | |
1372 | case CISTPL_CFTABLE_ENTRY: | |
1373 | ret = parse_cftable_entry(tuple, &parse->cftable_entry); | |
1374 | break; | |
1375 | case CISTPL_DEVICE_GEO: | |
1376 | case CISTPL_DEVICE_GEO_A: | |
1377 | ret = parse_device_geo(tuple, &parse->device_geo); | |
1378 | break; | |
1379 | case CISTPL_VERS_2: | |
1380 | ret = parse_vers_2(tuple, &parse->vers_2); | |
1381 | break; | |
1382 | case CISTPL_ORG: | |
1383 | ret = parse_org(tuple, &parse->org); | |
1384 | break; | |
1385 | case CISTPL_FORMAT: | |
1386 | case CISTPL_FORMAT_A: | |
1387 | ret = parse_format(tuple, &parse->format); | |
1388 | break; | |
1389 | case CISTPL_NO_LINK: | |
1390 | case CISTPL_LINKTARGET: | |
1391 | ret = CS_SUCCESS; | |
1392 | break; | |
1393 | default: | |
1394 | ret = CS_UNSUPPORTED_FUNCTION; | |
1395 | break; | |
1396 | } | |
1397 | return ret; | |
1398 | } | |
1399 | EXPORT_SYMBOL(pccard_parse_tuple); | |
1400 | ||
1401 | /*====================================================================== | |
1402 | ||
1403 | This is used internally by Card Services to look up CIS stuff. | |
1404 | ||
1405 | ======================================================================*/ | |
1406 | ||
1407 | int pccard_read_tuple(struct pcmcia_socket *s, unsigned int function, cisdata_t code, void *parse) | |
1408 | { | |
1409 | tuple_t tuple; | |
1410 | cisdata_t *buf; | |
1411 | int ret; | |
1412 | ||
1413 | buf = kmalloc(256, GFP_KERNEL); | |
1414 | if (buf == NULL) | |
1415 | return CS_OUT_OF_RESOURCE; | |
1416 | tuple.DesiredTuple = code; | |
1417 | tuple.Attributes = TUPLE_RETURN_COMMON; | |
1418 | ret = pccard_get_first_tuple(s, function, &tuple); | |
1419 | if (ret != CS_SUCCESS) goto done; | |
1420 | tuple.TupleData = buf; | |
1421 | tuple.TupleOffset = 0; | |
1422 | tuple.TupleDataMax = 255; | |
1423 | ret = pccard_get_tuple_data(s, &tuple); | |
1424 | if (ret != CS_SUCCESS) goto done; | |
1425 | ret = pccard_parse_tuple(&tuple, parse); | |
1426 | done: | |
1427 | kfree(buf); | |
1428 | return ret; | |
1429 | } | |
1430 | EXPORT_SYMBOL(pccard_read_tuple); | |
1431 | ||
1432 | /*====================================================================== | |
1433 | ||
1434 | This tries to determine if a card has a sensible CIS. It returns | |
1435 | the number of tuples in the CIS, or 0 if the CIS looks bad. The | |
1436 | checks include making sure several critical tuples are present and | |
1437 | valid; seeing if the total number of tuples is reasonable; and | |
1438 | looking for tuples that use reserved codes. | |
1439 | ||
1440 | ======================================================================*/ | |
1441 | ||
c5081d5f | 1442 | int pccard_validate_cis(struct pcmcia_socket *s, unsigned int function, unsigned int *info) |
1da177e4 LT |
1443 | { |
1444 | tuple_t *tuple; | |
1445 | cisparse_t *p; | |
c5081d5f | 1446 | unsigned int count = 0; |
1da177e4 LT |
1447 | int ret, reserved, dev_ok = 0, ident_ok = 0; |
1448 | ||
1449 | if (!s) | |
1450 | return CS_BAD_HANDLE; | |
1451 | ||
1452 | tuple = kmalloc(sizeof(*tuple), GFP_KERNEL); | |
1453 | if (tuple == NULL) | |
1454 | return CS_OUT_OF_RESOURCE; | |
1455 | p = kmalloc(sizeof(*p), GFP_KERNEL); | |
1456 | if (p == NULL) { | |
1457 | kfree(tuple); | |
1458 | return CS_OUT_OF_RESOURCE; | |
1459 | } | |
1460 | ||
c5081d5f | 1461 | count = reserved = 0; |
1da177e4 LT |
1462 | tuple->DesiredTuple = RETURN_FIRST_TUPLE; |
1463 | tuple->Attributes = TUPLE_RETURN_COMMON; | |
1464 | ret = pccard_get_first_tuple(s, function, tuple); | |
1465 | if (ret != CS_SUCCESS) | |
1466 | goto done; | |
1467 | ||
1468 | /* First tuple should be DEVICE; we should really have either that | |
1469 | or a CFTABLE_ENTRY of some sort */ | |
1470 | if ((tuple->TupleCode == CISTPL_DEVICE) || | |
1471 | (pccard_read_tuple(s, function, CISTPL_CFTABLE_ENTRY, p) == CS_SUCCESS) || | |
1472 | (pccard_read_tuple(s, function, CISTPL_CFTABLE_ENTRY_CB, p) == CS_SUCCESS)) | |
1473 | dev_ok++; | |
1474 | ||
1475 | /* All cards should have a MANFID tuple, and/or a VERS_1 or VERS_2 | |
1476 | tuple, for card identification. Certain old D-Link and Linksys | |
1477 | cards have only a broken VERS_2 tuple; hence the bogus test. */ | |
1478 | if ((pccard_read_tuple(s, function, CISTPL_MANFID, p) == CS_SUCCESS) || | |
1479 | (pccard_read_tuple(s, function, CISTPL_VERS_1, p) == CS_SUCCESS) || | |
1480 | (pccard_read_tuple(s, function, CISTPL_VERS_2, p) != CS_NO_MORE_ITEMS)) | |
1481 | ident_ok++; | |
1482 | ||
1483 | if (!dev_ok && !ident_ok) | |
1484 | goto done; | |
1485 | ||
c5081d5f | 1486 | for (count = 1; count < MAX_TUPLES; count++) { |
1da177e4 LT |
1487 | ret = pccard_get_next_tuple(s, function, tuple); |
1488 | if (ret != CS_SUCCESS) break; | |
1489 | if (((tuple->TupleCode > 0x23) && (tuple->TupleCode < 0x40)) || | |
1490 | ((tuple->TupleCode > 0x47) && (tuple->TupleCode < 0x80)) || | |
1491 | ((tuple->TupleCode > 0x90) && (tuple->TupleCode < 0xff))) | |
1492 | reserved++; | |
1493 | } | |
002b90a1 | 1494 | if ((count == MAX_TUPLES) || (reserved > 5) || |
c5081d5f DB |
1495 | ((!dev_ok || !ident_ok) && (count > 10))) |
1496 | count = 0; | |
1da177e4 LT |
1497 | |
1498 | done: | |
c5081d5f DB |
1499 | if (info) |
1500 | *info = count; | |
1da177e4 LT |
1501 | kfree(tuple); |
1502 | kfree(p); | |
1503 | return CS_SUCCESS; | |
1504 | } | |
1505 | EXPORT_SYMBOL(pccard_validate_cis); |