cistpl.c 35 KB

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