cistpl.c 38 KB

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