cistpl.c 38 KB

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