cistpl.c 38 KB

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