cistpl.c 35 KB

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