cistpl.c 39 KB

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