cistpl.c 38 KB

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