cistpl.c 38 KB

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