cistpl.c 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672
  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 <linux/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. dev_dbg(&s->dev, "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. dev_dbg(&s->dev, " %#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. dev_dbg(&s->dev, "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. /**
  274. * destroy_cis_cache() - destroy the CIS cache
  275. * @s: pcmcia_socket for which CIS cache shall be destroyed
  276. *
  277. * This destroys the CIS cache but keeps any fake CIS alive.
  278. */
  279. void destroy_cis_cache(struct pcmcia_socket *s)
  280. {
  281. struct list_head *l, *n;
  282. struct cis_cache_entry *cis;
  283. list_for_each_safe(l, n, &s->cis_cache) {
  284. cis = list_entry(l, struct cis_cache_entry, node);
  285. list_del(&cis->node);
  286. kfree(cis);
  287. }
  288. }
  289. EXPORT_SYMBOL(destroy_cis_cache);
  290. /*======================================================================
  291. This verifies if the CIS of a card matches what is in the CIS
  292. cache.
  293. ======================================================================*/
  294. int verify_cis_cache(struct pcmcia_socket *s)
  295. {
  296. struct cis_cache_entry *cis;
  297. char *buf;
  298. buf = kmalloc(256, GFP_KERNEL);
  299. if (buf == NULL) {
  300. dev_printk(KERN_WARNING, &s->dev,
  301. "no memory for verifying CIS\n");
  302. return -ENOMEM;
  303. }
  304. list_for_each_entry(cis, &s->cis_cache, node) {
  305. int len = cis->len;
  306. if (len > 256)
  307. len = 256;
  308. #ifdef CONFIG_CARDBUS
  309. if (s->state & SOCKET_CARDBUS)
  310. read_cb_mem(s, cis->attr, cis->addr, len, buf);
  311. else
  312. #endif
  313. pcmcia_read_cis_mem(s, cis->attr, cis->addr, len, buf);
  314. if (memcmp(buf, cis->cache, len) != 0) {
  315. kfree(buf);
  316. return -1;
  317. }
  318. }
  319. kfree(buf);
  320. return 0;
  321. }
  322. EXPORT_SYMBOL(verify_cis_cache);
  323. /*======================================================================
  324. For really bad cards, we provide a facility for uploading a
  325. replacement CIS.
  326. ======================================================================*/
  327. int pcmcia_replace_cis(struct pcmcia_socket *s,
  328. const u8 *data, const size_t len)
  329. {
  330. if (len > CISTPL_MAX_CIS_SIZE) {
  331. dev_printk(KERN_WARNING, &s->dev, "replacement CIS too big\n");
  332. return -EINVAL;
  333. }
  334. kfree(s->fake_cis);
  335. s->fake_cis = kmalloc(len, GFP_KERNEL);
  336. if (s->fake_cis == NULL) {
  337. dev_printk(KERN_WARNING, &s->dev, "no memory to replace CIS\n");
  338. return -ENOMEM;
  339. }
  340. s->fake_cis_len = len;
  341. memcpy(s->fake_cis, data, len);
  342. return 0;
  343. }
  344. EXPORT_SYMBOL(pcmcia_replace_cis);
  345. /*======================================================================
  346. The high-level CIS tuple services
  347. ======================================================================*/
  348. typedef struct tuple_flags {
  349. u_int link_space:4;
  350. u_int has_link:1;
  351. u_int mfc_fn:3;
  352. u_int space:4;
  353. } tuple_flags;
  354. #define LINK_SPACE(f) (((tuple_flags *)(&(f)))->link_space)
  355. #define HAS_LINK(f) (((tuple_flags *)(&(f)))->has_link)
  356. #define MFC_FN(f) (((tuple_flags *)(&(f)))->mfc_fn)
  357. #define SPACE(f) (((tuple_flags *)(&(f)))->space)
  358. int pccard_get_first_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
  359. {
  360. if (!s)
  361. return -EINVAL;
  362. if (!(s->state & SOCKET_PRESENT))
  363. return -ENODEV;
  364. tuple->TupleLink = tuple->Flags = 0;
  365. #ifdef CONFIG_CARDBUS
  366. if (s->state & SOCKET_CARDBUS) {
  367. struct pci_dev *dev = s->cb_dev;
  368. u_int ptr;
  369. pci_bus_read_config_dword(dev->subordinate, 0, PCI_CARDBUS_CIS, &ptr);
  370. tuple->CISOffset = ptr & ~7;
  371. SPACE(tuple->Flags) = (ptr & 7);
  372. } else
  373. #endif
  374. {
  375. /* Assume presence of a LONGLINK_C to address 0 */
  376. tuple->CISOffset = tuple->LinkOffset = 0;
  377. SPACE(tuple->Flags) = HAS_LINK(tuple->Flags) = 1;
  378. }
  379. if (!(s->state & SOCKET_CARDBUS) && (s->functions > 1) &&
  380. !(tuple->Attributes & TUPLE_RETURN_COMMON)) {
  381. cisdata_t req = tuple->DesiredTuple;
  382. tuple->DesiredTuple = CISTPL_LONGLINK_MFC;
  383. if (pccard_get_next_tuple(s, function, tuple) == 0) {
  384. tuple->DesiredTuple = CISTPL_LINKTARGET;
  385. if (pccard_get_next_tuple(s, function, tuple) != 0)
  386. return -ENOSPC;
  387. } else
  388. tuple->CISOffset = tuple->TupleLink = 0;
  389. tuple->DesiredTuple = req;
  390. }
  391. return pccard_get_next_tuple(s, function, tuple);
  392. }
  393. EXPORT_SYMBOL(pccard_get_first_tuple);
  394. static int follow_link(struct pcmcia_socket *s, tuple_t *tuple)
  395. {
  396. u_char link[5];
  397. u_int ofs;
  398. if (MFC_FN(tuple->Flags)) {
  399. /* Get indirect link from the MFC tuple */
  400. read_cis_cache(s, LINK_SPACE(tuple->Flags),
  401. tuple->LinkOffset, 5, link);
  402. ofs = get_unaligned_le32(link + 1);
  403. SPACE(tuple->Flags) = (link[0] == CISTPL_MFC_ATTR);
  404. /* Move to the next indirect link */
  405. tuple->LinkOffset += 5;
  406. MFC_FN(tuple->Flags)--;
  407. } else if (HAS_LINK(tuple->Flags)) {
  408. ofs = tuple->LinkOffset;
  409. SPACE(tuple->Flags) = LINK_SPACE(tuple->Flags);
  410. HAS_LINK(tuple->Flags) = 0;
  411. } else {
  412. return -1;
  413. }
  414. if (!(s->state & SOCKET_CARDBUS) && SPACE(tuple->Flags)) {
  415. /* This is ugly, but a common CIS error is to code the long
  416. link offset incorrectly, so we check the right spot... */
  417. read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
  418. if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
  419. (strncmp(link+2, "CIS", 3) == 0))
  420. return ofs;
  421. remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
  422. /* Then, we try the wrong spot... */
  423. ofs = ofs >> 1;
  424. }
  425. read_cis_cache(s, SPACE(tuple->Flags), ofs, 5, link);
  426. if ((link[0] == CISTPL_LINKTARGET) && (link[1] >= 3) &&
  427. (strncmp(link+2, "CIS", 3) == 0))
  428. return ofs;
  429. remove_cis_cache(s, SPACE(tuple->Flags), ofs, 5);
  430. return -1;
  431. }
  432. int pccard_get_next_tuple(struct pcmcia_socket *s, unsigned int function, tuple_t *tuple)
  433. {
  434. u_char link[2], tmp;
  435. int ofs, i, attr;
  436. if (!s)
  437. return -EINVAL;
  438. if (!(s->state & SOCKET_PRESENT))
  439. return -ENODEV;
  440. link[1] = tuple->TupleLink;
  441. ofs = tuple->CISOffset + tuple->TupleLink;
  442. attr = SPACE(tuple->Flags);
  443. for (i = 0; i < MAX_TUPLES; i++) {
  444. if (link[1] == 0xff) {
  445. link[0] = CISTPL_END;
  446. } else {
  447. read_cis_cache(s, attr, ofs, 2, link);
  448. if (link[0] == CISTPL_NULL) {
  449. ofs++; continue;
  450. }
  451. }
  452. /* End of chain? Follow long link if possible */
  453. if (link[0] == CISTPL_END) {
  454. ofs = follow_link(s, tuple);
  455. if (ofs < 0)
  456. return -ENOSPC;
  457. attr = SPACE(tuple->Flags);
  458. read_cis_cache(s, attr, ofs, 2, link);
  459. }
  460. /* Is this a link tuple? Make a note of it */
  461. if ((link[0] == CISTPL_LONGLINK_A) ||
  462. (link[0] == CISTPL_LONGLINK_C) ||
  463. (link[0] == CISTPL_LONGLINK_MFC) ||
  464. (link[0] == CISTPL_LINKTARGET) ||
  465. (link[0] == CISTPL_INDIRECT) ||
  466. (link[0] == CISTPL_NO_LINK)) {
  467. switch (link[0]) {
  468. case CISTPL_LONGLINK_A:
  469. HAS_LINK(tuple->Flags) = 1;
  470. LINK_SPACE(tuple->Flags) = attr | IS_ATTR;
  471. read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset);
  472. break;
  473. case CISTPL_LONGLINK_C:
  474. HAS_LINK(tuple->Flags) = 1;
  475. LINK_SPACE(tuple->Flags) = attr & ~IS_ATTR;
  476. read_cis_cache(s, attr, ofs+2, 4, &tuple->LinkOffset);
  477. break;
  478. case CISTPL_INDIRECT:
  479. HAS_LINK(tuple->Flags) = 1;
  480. LINK_SPACE(tuple->Flags) = IS_ATTR | IS_INDIRECT;
  481. tuple->LinkOffset = 0;
  482. break;
  483. case CISTPL_LONGLINK_MFC:
  484. tuple->LinkOffset = ofs + 3;
  485. LINK_SPACE(tuple->Flags) = attr;
  486. if (function == BIND_FN_ALL) {
  487. /* Follow all the MFC links */
  488. read_cis_cache(s, attr, ofs+2, 1, &tmp);
  489. MFC_FN(tuple->Flags) = tmp;
  490. } else {
  491. /* Follow exactly one of the links */
  492. MFC_FN(tuple->Flags) = 1;
  493. tuple->LinkOffset += function * 5;
  494. }
  495. break;
  496. case CISTPL_NO_LINK:
  497. HAS_LINK(tuple->Flags) = 0;
  498. break;
  499. }
  500. if ((tuple->Attributes & TUPLE_RETURN_LINK) &&
  501. (tuple->DesiredTuple == RETURN_FIRST_TUPLE))
  502. break;
  503. } else
  504. if (tuple->DesiredTuple == RETURN_FIRST_TUPLE)
  505. break;
  506. if (link[0] == tuple->DesiredTuple)
  507. break;
  508. ofs += link[1] + 2;
  509. }
  510. if (i == MAX_TUPLES) {
  511. dev_dbg(&s->dev, "cs: overrun in pcmcia_get_next_tuple\n");
  512. return -ENOSPC;
  513. }
  514. tuple->TupleCode = link[0];
  515. tuple->TupleLink = link[1];
  516. tuple->CISOffset = ofs + 2;
  517. return 0;
  518. }
  519. EXPORT_SYMBOL(pccard_get_next_tuple);
  520. /*====================================================================*/
  521. #define _MIN(a, b) (((a) < (b)) ? (a) : (b))
  522. int pccard_get_tuple_data(struct pcmcia_socket *s, tuple_t *tuple)
  523. {
  524. u_int len;
  525. if (!s)
  526. return -EINVAL;
  527. if (tuple->TupleLink < tuple->TupleOffset)
  528. return -ENOSPC;
  529. len = tuple->TupleLink - tuple->TupleOffset;
  530. tuple->TupleDataLen = tuple->TupleLink;
  531. if (len == 0)
  532. return 0;
  533. read_cis_cache(s, SPACE(tuple->Flags),
  534. tuple->CISOffset + tuple->TupleOffset,
  535. _MIN(len, tuple->TupleDataMax), tuple->TupleData);
  536. return 0;
  537. }
  538. EXPORT_SYMBOL(pccard_get_tuple_data);
  539. /*======================================================================
  540. Parsing routines for individual tuples
  541. ======================================================================*/
  542. static int parse_device(tuple_t *tuple, cistpl_device_t *device)
  543. {
  544. int i;
  545. u_char scale;
  546. u_char *p, *q;
  547. p = (u_char *)tuple->TupleData;
  548. q = p + tuple->TupleDataLen;
  549. device->ndev = 0;
  550. for (i = 0; i < CISTPL_MAX_DEVICES; i++) {
  551. if (*p == 0xff)
  552. break;
  553. device->dev[i].type = (*p >> 4);
  554. device->dev[i].wp = (*p & 0x08) ? 1 : 0;
  555. switch (*p & 0x07) {
  556. case 0:
  557. device->dev[i].speed = 0;
  558. break;
  559. case 1:
  560. device->dev[i].speed = 250;
  561. break;
  562. case 2:
  563. device->dev[i].speed = 200;
  564. break;
  565. case 3:
  566. device->dev[i].speed = 150;
  567. break;
  568. case 4:
  569. device->dev[i].speed = 100;
  570. break;
  571. case 7:
  572. if (++p == q)
  573. return -EINVAL;
  574. device->dev[i].speed = SPEED_CVT(*p);
  575. while (*p & 0x80)
  576. if (++p == q)
  577. return -EINVAL;
  578. break;
  579. default:
  580. return -EINVAL;
  581. }
  582. if (++p == q)
  583. return -EINVAL;
  584. if (*p == 0xff)
  585. break;
  586. scale = *p & 7;
  587. if (scale == 7)
  588. return -EINVAL;
  589. device->dev[i].size = ((*p >> 3) + 1) * (512 << (scale*2));
  590. device->ndev++;
  591. if (++p == q)
  592. break;
  593. }
  594. return 0;
  595. }
  596. /*====================================================================*/
  597. static int parse_checksum(tuple_t *tuple, cistpl_checksum_t *csum)
  598. {
  599. u_char *p;
  600. if (tuple->TupleDataLen < 5)
  601. return -EINVAL;
  602. p = (u_char *) tuple->TupleData;
  603. csum->addr = tuple->CISOffset + get_unaligned_le16(p) - 2;
  604. csum->len = get_unaligned_le16(p + 2);
  605. csum->sum = *(p + 4);
  606. return 0;
  607. }
  608. /*====================================================================*/
  609. static int parse_longlink(tuple_t *tuple, cistpl_longlink_t *link)
  610. {
  611. if (tuple->TupleDataLen < 4)
  612. return -EINVAL;
  613. link->addr = get_unaligned_le32(tuple->TupleData);
  614. return 0;
  615. }
  616. /*====================================================================*/
  617. static int parse_longlink_mfc(tuple_t *tuple,
  618. cistpl_longlink_mfc_t *link)
  619. {
  620. u_char *p;
  621. int i;
  622. p = (u_char *)tuple->TupleData;
  623. link->nfn = *p; p++;
  624. if (tuple->TupleDataLen <= link->nfn*5)
  625. return -EINVAL;
  626. for (i = 0; i < link->nfn; i++) {
  627. link->fn[i].space = *p; p++;
  628. link->fn[i].addr = get_unaligned_le32(p);
  629. p += 4;
  630. }
  631. return 0;
  632. }
  633. /*====================================================================*/
  634. static int parse_strings(u_char *p, u_char *q, int max,
  635. char *s, u_char *ofs, u_char *found)
  636. {
  637. int i, j, ns;
  638. if (p == q)
  639. return -EINVAL;
  640. ns = 0; j = 0;
  641. for (i = 0; i < max; i++) {
  642. if (*p == 0xff)
  643. break;
  644. ofs[i] = j;
  645. ns++;
  646. for (;;) {
  647. s[j++] = (*p == 0xff) ? '\0' : *p;
  648. if ((*p == '\0') || (*p == 0xff))
  649. break;
  650. if (++p == q)
  651. return -EINVAL;
  652. }
  653. if ((*p == 0xff) || (++p == q))
  654. break;
  655. }
  656. if (found) {
  657. *found = ns;
  658. return 0;
  659. } else {
  660. return (ns == max) ? 0 : -EINVAL;
  661. }
  662. }
  663. /*====================================================================*/
  664. static int parse_vers_1(tuple_t *tuple, cistpl_vers_1_t *vers_1)
  665. {
  666. u_char *p, *q;
  667. p = (u_char *)tuple->TupleData;
  668. q = p + tuple->TupleDataLen;
  669. vers_1->major = *p; p++;
  670. vers_1->minor = *p; p++;
  671. if (p >= q)
  672. return -EINVAL;
  673. return parse_strings(p, q, CISTPL_VERS_1_MAX_PROD_STRINGS,
  674. vers_1->str, vers_1->ofs, &vers_1->ns);
  675. }
  676. /*====================================================================*/
  677. static int parse_altstr(tuple_t *tuple, cistpl_altstr_t *altstr)
  678. {
  679. u_char *p, *q;
  680. p = (u_char *)tuple->TupleData;
  681. q = p + tuple->TupleDataLen;
  682. return parse_strings(p, q, CISTPL_MAX_ALTSTR_STRINGS,
  683. altstr->str, altstr->ofs, &altstr->ns);
  684. }
  685. /*====================================================================*/
  686. static int parse_jedec(tuple_t *tuple, cistpl_jedec_t *jedec)
  687. {
  688. u_char *p, *q;
  689. int nid;
  690. p = (u_char *)tuple->TupleData;
  691. q = p + tuple->TupleDataLen;
  692. for (nid = 0; nid < CISTPL_MAX_DEVICES; nid++) {
  693. if (p > q-2)
  694. break;
  695. jedec->id[nid].mfr = p[0];
  696. jedec->id[nid].info = p[1];
  697. p += 2;
  698. }
  699. jedec->nid = nid;
  700. return 0;
  701. }
  702. /*====================================================================*/
  703. static int parse_manfid(tuple_t *tuple, cistpl_manfid_t *m)
  704. {
  705. if (tuple->TupleDataLen < 4)
  706. return -EINVAL;
  707. m->manf = get_unaligned_le16(tuple->TupleData);
  708. m->card = get_unaligned_le16(tuple->TupleData + 2);
  709. return 0;
  710. }
  711. /*====================================================================*/
  712. static int parse_funcid(tuple_t *tuple, cistpl_funcid_t *f)
  713. {
  714. u_char *p;
  715. if (tuple->TupleDataLen < 2)
  716. return -EINVAL;
  717. p = (u_char *)tuple->TupleData;
  718. f->func = p[0];
  719. f->sysinit = p[1];
  720. return 0;
  721. }
  722. /*====================================================================*/
  723. static int parse_funce(tuple_t *tuple, cistpl_funce_t *f)
  724. {
  725. u_char *p;
  726. int i;
  727. if (tuple->TupleDataLen < 1)
  728. return -EINVAL;
  729. p = (u_char *)tuple->TupleData;
  730. f->type = p[0];
  731. for (i = 1; i < tuple->TupleDataLen; i++)
  732. f->data[i-1] = p[i];
  733. return 0;
  734. }
  735. /*====================================================================*/
  736. static int parse_config(tuple_t *tuple, cistpl_config_t *config)
  737. {
  738. int rasz, rmsz, i;
  739. u_char *p;
  740. p = (u_char *)tuple->TupleData;
  741. rasz = *p & 0x03;
  742. rmsz = (*p & 0x3c) >> 2;
  743. if (tuple->TupleDataLen < rasz+rmsz+4)
  744. return -EINVAL;
  745. config->last_idx = *(++p);
  746. p++;
  747. config->base = 0;
  748. for (i = 0; i <= rasz; i++)
  749. config->base += p[i] << (8*i);
  750. p += rasz+1;
  751. for (i = 0; i < 4; i++)
  752. config->rmask[i] = 0;
  753. for (i = 0; i <= rmsz; i++)
  754. config->rmask[i>>2] += p[i] << (8*(i%4));
  755. config->subtuples = tuple->TupleDataLen - (rasz+rmsz+4);
  756. return 0;
  757. }
  758. /*======================================================================
  759. The following routines are all used to parse the nightmarish
  760. config table entries.
  761. ======================================================================*/
  762. static u_char *parse_power(u_char *p, u_char *q,
  763. cistpl_power_t *pwr)
  764. {
  765. int i;
  766. u_int scale;
  767. if (p == q)
  768. return NULL;
  769. pwr->present = *p;
  770. pwr->flags = 0;
  771. p++;
  772. for (i = 0; i < 7; i++)
  773. if (pwr->present & (1<<i)) {
  774. if (p == q)
  775. return NULL;
  776. pwr->param[i] = POWER_CVT(*p);
  777. scale = POWER_SCALE(*p);
  778. while (*p & 0x80) {
  779. if (++p == q)
  780. return NULL;
  781. if ((*p & 0x7f) < 100)
  782. pwr->param[i] += (*p & 0x7f) * scale / 100;
  783. else if (*p == 0x7d)
  784. pwr->flags |= CISTPL_POWER_HIGHZ_OK;
  785. else if (*p == 0x7e)
  786. pwr->param[i] = 0;
  787. else if (*p == 0x7f)
  788. pwr->flags |= CISTPL_POWER_HIGHZ_REQ;
  789. else
  790. return NULL;
  791. }
  792. p++;
  793. }
  794. return p;
  795. }
  796. /*====================================================================*/
  797. static u_char *parse_timing(u_char *p, u_char *q,
  798. cistpl_timing_t *timing)
  799. {
  800. u_char scale;
  801. if (p == q)
  802. return NULL;
  803. scale = *p;
  804. if ((scale & 3) != 3) {
  805. if (++p == q)
  806. return NULL;
  807. timing->wait = SPEED_CVT(*p);
  808. timing->waitscale = exponent[scale & 3];
  809. } else
  810. timing->wait = 0;
  811. scale >>= 2;
  812. if ((scale & 7) != 7) {
  813. if (++p == q)
  814. return NULL;
  815. timing->ready = SPEED_CVT(*p);
  816. timing->rdyscale = exponent[scale & 7];
  817. } else
  818. timing->ready = 0;
  819. scale >>= 3;
  820. if (scale != 7) {
  821. if (++p == q)
  822. return NULL;
  823. timing->reserved = SPEED_CVT(*p);
  824. timing->rsvscale = exponent[scale];
  825. } else
  826. timing->reserved = 0;
  827. p++;
  828. return p;
  829. }
  830. /*====================================================================*/
  831. static u_char *parse_io(u_char *p, u_char *q, cistpl_io_t *io)
  832. {
  833. int i, j, bsz, lsz;
  834. if (p == q)
  835. return NULL;
  836. io->flags = *p;
  837. if (!(*p & 0x80)) {
  838. io->nwin = 1;
  839. io->win[0].base = 0;
  840. io->win[0].len = (1 << (io->flags & CISTPL_IO_LINES_MASK));
  841. return p+1;
  842. }
  843. if (++p == q)
  844. return NULL;
  845. io->nwin = (*p & 0x0f) + 1;
  846. bsz = (*p & 0x30) >> 4;
  847. if (bsz == 3)
  848. bsz++;
  849. lsz = (*p & 0xc0) >> 6;
  850. if (lsz == 3)
  851. lsz++;
  852. p++;
  853. for (i = 0; i < io->nwin; i++) {
  854. io->win[i].base = 0;
  855. io->win[i].len = 1;
  856. for (j = 0; j < bsz; j++, p++) {
  857. if (p == q)
  858. return NULL;
  859. io->win[i].base += *p << (j*8);
  860. }
  861. for (j = 0; j < lsz; j++, p++) {
  862. if (p == q)
  863. return NULL;
  864. io->win[i].len += *p << (j*8);
  865. }
  866. }
  867. return p;
  868. }
  869. /*====================================================================*/
  870. static u_char *parse_mem(u_char *p, u_char *q, cistpl_mem_t *mem)
  871. {
  872. int i, j, asz, lsz, has_ha;
  873. u_int len, ca, ha;
  874. if (p == q)
  875. return NULL;
  876. mem->nwin = (*p & 0x07) + 1;
  877. lsz = (*p & 0x18) >> 3;
  878. asz = (*p & 0x60) >> 5;
  879. has_ha = (*p & 0x80);
  880. if (++p == q)
  881. return NULL;
  882. for (i = 0; i < mem->nwin; i++) {
  883. len = ca = ha = 0;
  884. for (j = 0; j < lsz; j++, p++) {
  885. if (p == q)
  886. return NULL;
  887. len += *p << (j*8);
  888. }
  889. for (j = 0; j < asz; j++, p++) {
  890. if (p == q)
  891. return NULL;
  892. ca += *p << (j*8);
  893. }
  894. if (has_ha)
  895. for (j = 0; j < asz; j++, p++) {
  896. if (p == q)
  897. return NULL;
  898. ha += *p << (j*8);
  899. }
  900. mem->win[i].len = len << 8;
  901. mem->win[i].card_addr = ca << 8;
  902. mem->win[i].host_addr = ha << 8;
  903. }
  904. return p;
  905. }
  906. /*====================================================================*/
  907. static u_char *parse_irq(u_char *p, u_char *q, cistpl_irq_t *irq)
  908. {
  909. if (p == q)
  910. return NULL;
  911. irq->IRQInfo1 = *p; p++;
  912. if (irq->IRQInfo1 & IRQ_INFO2_VALID) {
  913. if (p+2 > q)
  914. return NULL;
  915. irq->IRQInfo2 = (p[1]<<8) + p[0];
  916. p += 2;
  917. }
  918. return p;
  919. }
  920. /*====================================================================*/
  921. static int parse_cftable_entry(tuple_t *tuple,
  922. cistpl_cftable_entry_t *entry)
  923. {
  924. u_char *p, *q, features;
  925. p = tuple->TupleData;
  926. q = p + tuple->TupleDataLen;
  927. entry->index = *p & 0x3f;
  928. entry->flags = 0;
  929. if (*p & 0x40)
  930. entry->flags |= CISTPL_CFTABLE_DEFAULT;
  931. if (*p & 0x80) {
  932. if (++p == q)
  933. return -EINVAL;
  934. if (*p & 0x10)
  935. entry->flags |= CISTPL_CFTABLE_BVDS;
  936. if (*p & 0x20)
  937. entry->flags |= CISTPL_CFTABLE_WP;
  938. if (*p & 0x40)
  939. entry->flags |= CISTPL_CFTABLE_RDYBSY;
  940. if (*p & 0x80)
  941. entry->flags |= CISTPL_CFTABLE_MWAIT;
  942. entry->interface = *p & 0x0f;
  943. } else
  944. entry->interface = 0;
  945. /* Process optional features */
  946. if (++p == q)
  947. return -EINVAL;
  948. features = *p; p++;
  949. /* Power options */
  950. if ((features & 3) > 0) {
  951. p = parse_power(p, q, &entry->vcc);
  952. if (p == NULL)
  953. return -EINVAL;
  954. } else
  955. entry->vcc.present = 0;
  956. if ((features & 3) > 1) {
  957. p = parse_power(p, q, &entry->vpp1);
  958. if (p == NULL)
  959. return -EINVAL;
  960. } else
  961. entry->vpp1.present = 0;
  962. if ((features & 3) > 2) {
  963. p = parse_power(p, q, &entry->vpp2);
  964. if (p == NULL)
  965. return -EINVAL;
  966. } else
  967. entry->vpp2.present = 0;
  968. /* Timing options */
  969. if (features & 0x04) {
  970. p = parse_timing(p, q, &entry->timing);
  971. if (p == NULL)
  972. return -EINVAL;
  973. } else {
  974. entry->timing.wait = 0;
  975. entry->timing.ready = 0;
  976. entry->timing.reserved = 0;
  977. }
  978. /* I/O window options */
  979. if (features & 0x08) {
  980. p = parse_io(p, q, &entry->io);
  981. if (p == NULL)
  982. return -EINVAL;
  983. } else
  984. entry->io.nwin = 0;
  985. /* Interrupt options */
  986. if (features & 0x10) {
  987. p = parse_irq(p, q, &entry->irq);
  988. if (p == NULL)
  989. return -EINVAL;
  990. } else
  991. entry->irq.IRQInfo1 = 0;
  992. switch (features & 0x60) {
  993. case 0x00:
  994. entry->mem.nwin = 0;
  995. break;
  996. case 0x20:
  997. entry->mem.nwin = 1;
  998. entry->mem.win[0].len = get_unaligned_le16(p) << 8;
  999. entry->mem.win[0].card_addr = 0;
  1000. entry->mem.win[0].host_addr = 0;
  1001. p += 2;
  1002. if (p > q)
  1003. return -EINVAL;
  1004. break;
  1005. case 0x40:
  1006. entry->mem.nwin = 1;
  1007. entry->mem.win[0].len = get_unaligned_le16(p) << 8;
  1008. entry->mem.win[0].card_addr = get_unaligned_le16(p + 2) << 8;
  1009. entry->mem.win[0].host_addr = 0;
  1010. p += 4;
  1011. if (p > q)
  1012. return -EINVAL;
  1013. break;
  1014. case 0x60:
  1015. p = parse_mem(p, q, &entry->mem);
  1016. if (p == NULL)
  1017. return -EINVAL;
  1018. break;
  1019. }
  1020. /* Misc features */
  1021. if (features & 0x80) {
  1022. if (p == q)
  1023. return -EINVAL;
  1024. entry->flags |= (*p << 8);
  1025. while (*p & 0x80)
  1026. if (++p == q)
  1027. return -EINVAL;
  1028. p++;
  1029. }
  1030. entry->subtuples = q-p;
  1031. return 0;
  1032. }
  1033. /*====================================================================*/
  1034. #ifdef CONFIG_CARDBUS
  1035. static int parse_bar(tuple_t *tuple, cistpl_bar_t *bar)
  1036. {
  1037. u_char *p;
  1038. if (tuple->TupleDataLen < 6)
  1039. return -EINVAL;
  1040. p = (u_char *)tuple->TupleData;
  1041. bar->attr = *p;
  1042. p += 2;
  1043. bar->size = get_unaligned_le32(p);
  1044. return 0;
  1045. }
  1046. static int parse_config_cb(tuple_t *tuple, cistpl_config_t *config)
  1047. {
  1048. u_char *p;
  1049. p = (u_char *)tuple->TupleData;
  1050. if ((*p != 3) || (tuple->TupleDataLen < 6))
  1051. return -EINVAL;
  1052. config->last_idx = *(++p);
  1053. p++;
  1054. config->base = get_unaligned_le32(p);
  1055. config->subtuples = tuple->TupleDataLen - 6;
  1056. return 0;
  1057. }
  1058. static int parse_cftable_entry_cb(tuple_t *tuple,
  1059. cistpl_cftable_entry_cb_t *entry)
  1060. {
  1061. u_char *p, *q, features;
  1062. p = tuple->TupleData;
  1063. q = p + tuple->TupleDataLen;
  1064. entry->index = *p & 0x3f;
  1065. entry->flags = 0;
  1066. if (*p & 0x40)
  1067. entry->flags |= CISTPL_CFTABLE_DEFAULT;
  1068. /* Process optional features */
  1069. if (++p == q)
  1070. return -EINVAL;
  1071. features = *p; p++;
  1072. /* Power options */
  1073. if ((features & 3) > 0) {
  1074. p = parse_power(p, q, &entry->vcc);
  1075. if (p == NULL)
  1076. return -EINVAL;
  1077. } else
  1078. entry->vcc.present = 0;
  1079. if ((features & 3) > 1) {
  1080. p = parse_power(p, q, &entry->vpp1);
  1081. if (p == NULL)
  1082. return -EINVAL;
  1083. } else
  1084. entry->vpp1.present = 0;
  1085. if ((features & 3) > 2) {
  1086. p = parse_power(p, q, &entry->vpp2);
  1087. if (p == NULL)
  1088. return -EINVAL;
  1089. } else
  1090. entry->vpp2.present = 0;
  1091. /* I/O window options */
  1092. if (features & 0x08) {
  1093. if (p == q)
  1094. return -EINVAL;
  1095. entry->io = *p; p++;
  1096. } else
  1097. entry->io = 0;
  1098. /* Interrupt options */
  1099. if (features & 0x10) {
  1100. p = parse_irq(p, q, &entry->irq);
  1101. if (p == NULL)
  1102. return -EINVAL;
  1103. } else
  1104. entry->irq.IRQInfo1 = 0;
  1105. if (features & 0x20) {
  1106. if (p == q)
  1107. return -EINVAL;
  1108. entry->mem = *p; p++;
  1109. } else
  1110. entry->mem = 0;
  1111. /* Misc features */
  1112. if (features & 0x80) {
  1113. if (p == q)
  1114. return -EINVAL;
  1115. entry->flags |= (*p << 8);
  1116. if (*p & 0x80) {
  1117. if (++p == q)
  1118. return -EINVAL;
  1119. entry->flags |= (*p << 16);
  1120. }
  1121. while (*p & 0x80)
  1122. if (++p == q)
  1123. return -EINVAL;
  1124. p++;
  1125. }
  1126. entry->subtuples = q-p;
  1127. return 0;
  1128. }
  1129. #endif
  1130. /*====================================================================*/
  1131. static int parse_device_geo(tuple_t *tuple, cistpl_device_geo_t *geo)
  1132. {
  1133. u_char *p, *q;
  1134. int n;
  1135. p = (u_char *)tuple->TupleData;
  1136. q = p + tuple->TupleDataLen;
  1137. for (n = 0; n < CISTPL_MAX_DEVICES; n++) {
  1138. if (p > q-6)
  1139. break;
  1140. geo->geo[n].buswidth = p[0];
  1141. geo->geo[n].erase_block = 1 << (p[1]-1);
  1142. geo->geo[n].read_block = 1 << (p[2]-1);
  1143. geo->geo[n].write_block = 1 << (p[3]-1);
  1144. geo->geo[n].partition = 1 << (p[4]-1);
  1145. geo->geo[n].interleave = 1 << (p[5]-1);
  1146. p += 6;
  1147. }
  1148. geo->ngeo = n;
  1149. return 0;
  1150. }
  1151. /*====================================================================*/
  1152. static int parse_vers_2(tuple_t *tuple, cistpl_vers_2_t *v2)
  1153. {
  1154. u_char *p, *q;
  1155. if (tuple->TupleDataLen < 10)
  1156. return -EINVAL;
  1157. p = tuple->TupleData;
  1158. q = p + tuple->TupleDataLen;
  1159. v2->vers = p[0];
  1160. v2->comply = p[1];
  1161. v2->dindex = get_unaligned_le16(p + 2);
  1162. v2->vspec8 = p[6];
  1163. v2->vspec9 = p[7];
  1164. v2->nhdr = p[8];
  1165. p += 9;
  1166. return parse_strings(p, q, 2, v2->str, &v2->vendor, NULL);
  1167. }
  1168. /*====================================================================*/
  1169. static int parse_org(tuple_t *tuple, cistpl_org_t *org)
  1170. {
  1171. u_char *p, *q;
  1172. int i;
  1173. p = tuple->TupleData;
  1174. q = p + tuple->TupleDataLen;
  1175. if (p == q)
  1176. return -EINVAL;
  1177. org->data_org = *p;
  1178. if (++p == q)
  1179. return -EINVAL;
  1180. for (i = 0; i < 30; i++) {
  1181. org->desc[i] = *p;
  1182. if (*p == '\0')
  1183. break;
  1184. if (++p == q)
  1185. return -EINVAL;
  1186. }
  1187. return 0;
  1188. }
  1189. /*====================================================================*/
  1190. static int parse_format(tuple_t *tuple, cistpl_format_t *fmt)
  1191. {
  1192. u_char *p;
  1193. if (tuple->TupleDataLen < 10)
  1194. return -EINVAL;
  1195. p = tuple->TupleData;
  1196. fmt->type = p[0];
  1197. fmt->edc = p[1];
  1198. fmt->offset = get_unaligned_le32(p + 2);
  1199. fmt->length = get_unaligned_le32(p + 6);
  1200. return 0;
  1201. }
  1202. /*====================================================================*/
  1203. int pcmcia_parse_tuple(tuple_t *tuple, cisparse_t *parse)
  1204. {
  1205. int ret = 0;
  1206. if (tuple->TupleDataLen > tuple->TupleDataMax)
  1207. return -EINVAL;
  1208. switch (tuple->TupleCode) {
  1209. case CISTPL_DEVICE:
  1210. case CISTPL_DEVICE_A:
  1211. ret = parse_device(tuple, &parse->device);
  1212. break;
  1213. #ifdef CONFIG_CARDBUS
  1214. case CISTPL_BAR:
  1215. ret = parse_bar(tuple, &parse->bar);
  1216. break;
  1217. case CISTPL_CONFIG_CB:
  1218. ret = parse_config_cb(tuple, &parse->config);
  1219. break;
  1220. case CISTPL_CFTABLE_ENTRY_CB:
  1221. ret = parse_cftable_entry_cb(tuple, &parse->cftable_entry_cb);
  1222. break;
  1223. #endif
  1224. case CISTPL_CHECKSUM:
  1225. ret = parse_checksum(tuple, &parse->checksum);
  1226. break;
  1227. case CISTPL_LONGLINK_A:
  1228. case CISTPL_LONGLINK_C:
  1229. ret = parse_longlink(tuple, &parse->longlink);
  1230. break;
  1231. case CISTPL_LONGLINK_MFC:
  1232. ret = parse_longlink_mfc(tuple, &parse->longlink_mfc);
  1233. break;
  1234. case CISTPL_VERS_1:
  1235. ret = parse_vers_1(tuple, &parse->version_1);
  1236. break;
  1237. case CISTPL_ALTSTR:
  1238. ret = parse_altstr(tuple, &parse->altstr);
  1239. break;
  1240. case CISTPL_JEDEC_A:
  1241. case CISTPL_JEDEC_C:
  1242. ret = parse_jedec(tuple, &parse->jedec);
  1243. break;
  1244. case CISTPL_MANFID:
  1245. ret = parse_manfid(tuple, &parse->manfid);
  1246. break;
  1247. case CISTPL_FUNCID:
  1248. ret = parse_funcid(tuple, &parse->funcid);
  1249. break;
  1250. case CISTPL_FUNCE:
  1251. ret = parse_funce(tuple, &parse->funce);
  1252. break;
  1253. case CISTPL_CONFIG:
  1254. ret = parse_config(tuple, &parse->config);
  1255. break;
  1256. case CISTPL_CFTABLE_ENTRY:
  1257. ret = parse_cftable_entry(tuple, &parse->cftable_entry);
  1258. break;
  1259. case CISTPL_DEVICE_GEO:
  1260. case CISTPL_DEVICE_GEO_A:
  1261. ret = parse_device_geo(tuple, &parse->device_geo);
  1262. break;
  1263. case CISTPL_VERS_2:
  1264. ret = parse_vers_2(tuple, &parse->vers_2);
  1265. break;
  1266. case CISTPL_ORG:
  1267. ret = parse_org(tuple, &parse->org);
  1268. break;
  1269. case CISTPL_FORMAT:
  1270. case CISTPL_FORMAT_A:
  1271. ret = parse_format(tuple, &parse->format);
  1272. break;
  1273. case CISTPL_NO_LINK:
  1274. case CISTPL_LINKTARGET:
  1275. ret = 0;
  1276. break;
  1277. default:
  1278. ret = -EINVAL;
  1279. break;
  1280. }
  1281. if (ret)
  1282. pr_debug("parse_tuple failed %d\n", ret);
  1283. return ret;
  1284. }
  1285. EXPORT_SYMBOL(pcmcia_parse_tuple);
  1286. /*======================================================================
  1287. This is used internally by Card Services to look up CIS stuff.
  1288. ======================================================================*/
  1289. int pccard_read_tuple(struct pcmcia_socket *s, unsigned int function, cisdata_t code, void *parse)
  1290. {
  1291. tuple_t tuple;
  1292. cisdata_t *buf;
  1293. int ret;
  1294. buf = kmalloc(256, GFP_KERNEL);
  1295. if (buf == NULL) {
  1296. dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
  1297. return -ENOMEM;
  1298. }
  1299. tuple.DesiredTuple = code;
  1300. tuple.Attributes = 0;
  1301. if (function == BIND_FN_ALL)
  1302. tuple.Attributes = TUPLE_RETURN_COMMON;
  1303. ret = pccard_get_first_tuple(s, function, &tuple);
  1304. if (ret != 0)
  1305. goto done;
  1306. tuple.TupleData = buf;
  1307. tuple.TupleOffset = 0;
  1308. tuple.TupleDataMax = 255;
  1309. ret = pccard_get_tuple_data(s, &tuple);
  1310. if (ret != 0)
  1311. goto done;
  1312. ret = pcmcia_parse_tuple(&tuple, parse);
  1313. done:
  1314. kfree(buf);
  1315. return ret;
  1316. }
  1317. EXPORT_SYMBOL(pccard_read_tuple);
  1318. /**
  1319. * pccard_loop_tuple() - loop over tuples in the CIS
  1320. * @s: the struct pcmcia_socket where the card is inserted
  1321. * @function: the device function we loop for
  1322. * @code: which CIS code shall we look for?
  1323. * @parse: buffer where the tuple shall be parsed (or NULL, if no parse)
  1324. * @priv_data: private data to be passed to the loop_tuple function.
  1325. * @loop_tuple: function to call for each CIS entry of type @function. IT
  1326. * gets passed the raw tuple, the paresed tuple (if @parse is
  1327. * set) and @priv_data.
  1328. *
  1329. * pccard_loop_tuple() loops over all CIS entries of type @function, and
  1330. * calls the @loop_tuple function for each entry. If the call to @loop_tuple
  1331. * returns 0, the loop exits. Returns 0 on success or errorcode otherwise.
  1332. */
  1333. int pccard_loop_tuple(struct pcmcia_socket *s, unsigned int function,
  1334. cisdata_t code, cisparse_t *parse, void *priv_data,
  1335. int (*loop_tuple) (tuple_t *tuple,
  1336. cisparse_t *parse,
  1337. void *priv_data))
  1338. {
  1339. tuple_t tuple;
  1340. cisdata_t *buf;
  1341. int ret;
  1342. buf = kzalloc(256, GFP_KERNEL);
  1343. if (buf == NULL) {
  1344. dev_printk(KERN_WARNING, &s->dev, "no memory to read tuple\n");
  1345. return -ENOMEM;
  1346. }
  1347. tuple.TupleData = buf;
  1348. tuple.TupleDataMax = 255;
  1349. tuple.TupleOffset = 0;
  1350. tuple.DesiredTuple = code;
  1351. tuple.Attributes = 0;
  1352. ret = pccard_get_first_tuple(s, function, &tuple);
  1353. while (!ret) {
  1354. if (pccard_get_tuple_data(s, &tuple))
  1355. goto next_entry;
  1356. if (parse)
  1357. if (pcmcia_parse_tuple(&tuple, parse))
  1358. goto next_entry;
  1359. ret = loop_tuple(&tuple, parse, priv_data);
  1360. if (!ret)
  1361. break;
  1362. next_entry:
  1363. ret = pccard_get_next_tuple(s, function, &tuple);
  1364. }
  1365. kfree(buf);
  1366. return ret;
  1367. }
  1368. EXPORT_SYMBOL(pccard_loop_tuple);
  1369. /**
  1370. * pccard_validate_cis() - check whether card has a sensible CIS
  1371. * @s: the struct pcmcia_socket we are to check
  1372. * @info: returns the number of tuples in the (valid) CIS, or 0
  1373. *
  1374. * This tries to determine if a card has a sensible CIS. In @info, it
  1375. * returns the number of tuples in the CIS, or 0 if the CIS looks bad. The
  1376. * checks include making sure several critical tuples are present and
  1377. * valid; seeing if the total number of tuples is reasonable; and
  1378. * looking for tuples that use reserved codes.
  1379. *
  1380. * The function returns 0 on success.
  1381. */
  1382. int pccard_validate_cis(struct pcmcia_socket *s, unsigned int *info)
  1383. {
  1384. tuple_t *tuple;
  1385. cisparse_t *p;
  1386. unsigned int count = 0;
  1387. int ret, reserved, dev_ok = 0, ident_ok = 0;
  1388. if (!s)
  1389. return -EINVAL;
  1390. /* We do not want to validate the CIS cache... */
  1391. destroy_cis_cache(s);
  1392. tuple = kmalloc(sizeof(*tuple), GFP_KERNEL);
  1393. if (tuple == NULL) {
  1394. dev_warn(&s->dev, "no memory to validate CIS\n");
  1395. return -ENOMEM;
  1396. }
  1397. p = kmalloc(sizeof(*p), GFP_KERNEL);
  1398. if (p == NULL) {
  1399. kfree(tuple);
  1400. dev_warn(&s->dev, "no memory to validate CIS\n");
  1401. return -ENOMEM;
  1402. }
  1403. count = reserved = 0;
  1404. tuple->DesiredTuple = RETURN_FIRST_TUPLE;
  1405. tuple->Attributes = TUPLE_RETURN_COMMON;
  1406. ret = pccard_get_first_tuple(s, BIND_FN_ALL, tuple);
  1407. if (ret != 0)
  1408. goto done;
  1409. /* First tuple should be DEVICE; we should really have either that
  1410. or a CFTABLE_ENTRY of some sort */
  1411. if ((tuple->TupleCode == CISTPL_DEVICE) ||
  1412. (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY, p)) ||
  1413. (!pccard_read_tuple(s, BIND_FN_ALL, CISTPL_CFTABLE_ENTRY_CB, p)))
  1414. dev_ok++;
  1415. /* All cards should have a MANFID tuple, and/or a VERS_1 or VERS_2
  1416. tuple, for card identification. Certain old D-Link and Linksys
  1417. cards have only a broken VERS_2 tuple; hence the bogus test. */
  1418. if ((pccard_read_tuple(s, BIND_FN_ALL, CISTPL_MANFID, p) == 0) ||
  1419. (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_1, p) == 0) ||
  1420. (pccard_read_tuple(s, BIND_FN_ALL, CISTPL_VERS_2, p) != -ENOSPC))
  1421. ident_ok++;
  1422. if (!dev_ok && !ident_ok)
  1423. goto done;
  1424. for (count = 1; count < MAX_TUPLES; count++) {
  1425. ret = pccard_get_next_tuple(s, BIND_FN_ALL, tuple);
  1426. if (ret != 0)
  1427. break;
  1428. if (((tuple->TupleCode > 0x23) && (tuple->TupleCode < 0x40)) ||
  1429. ((tuple->TupleCode > 0x47) && (tuple->TupleCode < 0x80)) ||
  1430. ((tuple->TupleCode > 0x90) && (tuple->TupleCode < 0xff)))
  1431. reserved++;
  1432. }
  1433. if ((count == MAX_TUPLES) || (reserved > 5) ||
  1434. ((!dev_ok || !ident_ok) && (count > 10)))
  1435. count = 0;
  1436. ret = 0;
  1437. done:
  1438. /* invalidate CIS cache on failure */
  1439. if (!dev_ok || !ident_ok || !count) {
  1440. destroy_cis_cache(s);
  1441. ret = -EIO;
  1442. }
  1443. if (info)
  1444. *info = count;
  1445. kfree(tuple);
  1446. kfree(p);
  1447. return ret;
  1448. }
  1449. EXPORT_SYMBOL(pccard_validate_cis);