cistpl.c 38 KB

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