cistpl.c 38 KB

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