cistpl.c 35 KB

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