cistpl.c 38 KB

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