cistpl.c 37 KB

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