cistpl.c 38 KB

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