csr1212.c 38 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465
  1. /*
  2. * csr1212.c -- IEEE 1212 Control and Status Register support for Linux
  3. *
  4. * Copyright (C) 2003 Francois Retief <fgretief@sun.ac.za>
  5. * Steve Kinneberg <kinnebergsteve@acmsystems.com>
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. *
  10. * 1. Redistributions of source code must retain the above copyright notice,
  11. * this list of conditions and the following disclaimer.
  12. * 2. Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in the
  14. * documentation and/or other materials provided with the distribution.
  15. * 3. The name of the author may not be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
  19. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  20. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
  21. * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  22. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  23. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
  24. * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  25. * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
  26. * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  27. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. */
  29. /* TODO List:
  30. * - Verify interface consistency: i.e., public functions that take a size
  31. * parameter expect size to be in bytes.
  32. */
  33. #include <linux/errno.h>
  34. #include <linux/kernel.h>
  35. #include <linux/string.h>
  36. #include <asm/bug.h>
  37. #include <asm/byteorder.h>
  38. #include "csr1212.h"
  39. /* Permitted key type for each key id */
  40. #define __I (1 << CSR1212_KV_TYPE_IMMEDIATE)
  41. #define __C (1 << CSR1212_KV_TYPE_CSR_OFFSET)
  42. #define __D (1 << CSR1212_KV_TYPE_DIRECTORY)
  43. #define __L (1 << CSR1212_KV_TYPE_LEAF)
  44. static const u8 csr1212_key_id_type_map[0x30] = {
  45. __C, /* used by Apple iSight */
  46. __D | __L, /* Descriptor */
  47. __I | __D | __L, /* Bus_Dependent_Info */
  48. __I | __D | __L, /* Vendor */
  49. __I, /* Hardware_Version */
  50. 0, 0, /* Reserved */
  51. __D | __L | __I, /* Module */
  52. __I, 0, 0, 0, /* used by Apple iSight, Reserved */
  53. __I, /* Node_Capabilities */
  54. __L, /* EUI_64 */
  55. 0, 0, 0, /* Reserved */
  56. __D, /* Unit */
  57. __I, /* Specifier_ID */
  58. __I, /* Version */
  59. __I | __C | __D | __L, /* Dependent_Info */
  60. __L, /* Unit_Location */
  61. 0, /* Reserved */
  62. __I, /* Model */
  63. __D, /* Instance */
  64. __L, /* Keyword */
  65. __D, /* Feature */
  66. __L, /* Extended_ROM */
  67. __I, /* Extended_Key_Specifier_ID */
  68. __I, /* Extended_Key */
  69. __I | __C | __D | __L, /* Extended_Data */
  70. __L, /* Modifiable_Descriptor */
  71. __I, /* Directory_ID */
  72. __I, /* Revision */
  73. };
  74. #undef __I
  75. #undef __C
  76. #undef __D
  77. #undef __L
  78. #define quads_to_bytes(_q) ((_q) * sizeof(u32))
  79. #define bytes_to_quads(_b) DIV_ROUND_UP(_b, sizeof(u32))
  80. static void free_keyval(struct csr1212_keyval *kv)
  81. {
  82. if ((kv->key.type == CSR1212_KV_TYPE_LEAF) &&
  83. (kv->key.id != CSR1212_KV_ID_EXTENDED_ROM))
  84. CSR1212_FREE(kv->value.leaf.data);
  85. CSR1212_FREE(kv);
  86. }
  87. static u16 csr1212_crc16(const u32 *buffer, size_t length)
  88. {
  89. int shift;
  90. u32 data;
  91. u16 sum, crc = 0;
  92. for (; length; length--) {
  93. data = be32_to_cpu(*buffer);
  94. buffer++;
  95. for (shift = 28; shift >= 0; shift -= 4 ) {
  96. sum = ((crc >> 12) ^ (data >> shift)) & 0xf;
  97. crc = (crc << 4) ^ (sum << 12) ^ (sum << 5) ^ (sum);
  98. }
  99. crc &= 0xffff;
  100. }
  101. return cpu_to_be16(crc);
  102. }
  103. /* Microsoft computes the CRC with the bytes in reverse order. */
  104. static u16 csr1212_msft_crc16(const u32 *buffer, size_t length)
  105. {
  106. int shift;
  107. u32 data;
  108. u16 sum, crc = 0;
  109. for (; length; length--) {
  110. data = le32_to_cpu(*buffer);
  111. buffer++;
  112. for (shift = 28; shift >= 0; shift -= 4 ) {
  113. sum = ((crc >> 12) ^ (data >> shift)) & 0xf;
  114. crc = (crc << 4) ^ (sum << 12) ^ (sum << 5) ^ (sum);
  115. }
  116. crc &= 0xffff;
  117. }
  118. return cpu_to_be16(crc);
  119. }
  120. static struct csr1212_dentry *
  121. csr1212_find_keyval(struct csr1212_keyval *dir, struct csr1212_keyval *kv)
  122. {
  123. struct csr1212_dentry *pos;
  124. for (pos = dir->value.directory.dentries_head;
  125. pos != NULL; pos = pos->next)
  126. if (pos->kv == kv)
  127. return pos;
  128. return NULL;
  129. }
  130. static struct csr1212_keyval *
  131. csr1212_find_keyval_offset(struct csr1212_keyval *kv_list, u32 offset)
  132. {
  133. struct csr1212_keyval *kv;
  134. for (kv = kv_list->next; kv && (kv != kv_list); kv = kv->next)
  135. if (kv->offset == offset)
  136. return kv;
  137. return NULL;
  138. }
  139. /* Creation Routines */
  140. struct csr1212_csr *csr1212_create_csr(struct csr1212_bus_ops *ops,
  141. size_t bus_info_size, void *private)
  142. {
  143. struct csr1212_csr *csr;
  144. csr = CSR1212_MALLOC(sizeof(*csr));
  145. if (!csr)
  146. return NULL;
  147. csr->cache_head =
  148. csr1212_rom_cache_malloc(CSR1212_CONFIG_ROM_SPACE_OFFSET,
  149. CSR1212_CONFIG_ROM_SPACE_SIZE);
  150. if (!csr->cache_head) {
  151. CSR1212_FREE(csr);
  152. return NULL;
  153. }
  154. /* The keyval key id is not used for the root node, but a valid key id
  155. * that can be used for a directory needs to be passed to
  156. * csr1212_new_directory(). */
  157. csr->root_kv = csr1212_new_directory(CSR1212_KV_ID_VENDOR);
  158. if (!csr->root_kv) {
  159. CSR1212_FREE(csr->cache_head);
  160. CSR1212_FREE(csr);
  161. return NULL;
  162. }
  163. csr->bus_info_data = csr->cache_head->data;
  164. csr->bus_info_len = bus_info_size;
  165. csr->crc_len = bus_info_size;
  166. csr->ops = ops;
  167. csr->private = private;
  168. csr->cache_tail = csr->cache_head;
  169. return csr;
  170. }
  171. void csr1212_init_local_csr(struct csr1212_csr *csr,
  172. const u32 *bus_info_data, int max_rom)
  173. {
  174. static const int mr_map[] = { 4, 64, 1024, 0 };
  175. BUG_ON(max_rom & ~0x3);
  176. csr->max_rom = mr_map[max_rom];
  177. memcpy(csr->bus_info_data, bus_info_data, csr->bus_info_len);
  178. }
  179. static struct csr1212_keyval *csr1212_new_keyval(u8 type, u8 key)
  180. {
  181. struct csr1212_keyval *kv;
  182. if (key < 0x30 && ((csr1212_key_id_type_map[key] & (1 << type)) == 0))
  183. return NULL;
  184. kv = CSR1212_MALLOC(sizeof(*kv));
  185. if (!kv)
  186. return NULL;
  187. atomic_set(&kv->refcnt, 1);
  188. kv->key.type = type;
  189. kv->key.id = key;
  190. kv->associate = NULL;
  191. kv->next = NULL;
  192. kv->prev = NULL;
  193. kv->offset = 0;
  194. kv->valid = 0;
  195. return kv;
  196. }
  197. struct csr1212_keyval *csr1212_new_immediate(u8 key, u32 value)
  198. {
  199. struct csr1212_keyval *kv;
  200. kv = csr1212_new_keyval(CSR1212_KV_TYPE_IMMEDIATE, key);
  201. if (!kv)
  202. return NULL;
  203. kv->value.immediate = value;
  204. kv->valid = 1;
  205. return kv;
  206. }
  207. static struct csr1212_keyval *
  208. csr1212_new_leaf(u8 key, const void *data, size_t data_len)
  209. {
  210. struct csr1212_keyval *kv;
  211. kv = csr1212_new_keyval(CSR1212_KV_TYPE_LEAF, key);
  212. if (!kv)
  213. return NULL;
  214. if (data_len > 0) {
  215. kv->value.leaf.data = CSR1212_MALLOC(data_len);
  216. if (!kv->value.leaf.data) {
  217. CSR1212_FREE(kv);
  218. return NULL;
  219. }
  220. if (data)
  221. memcpy(kv->value.leaf.data, data, data_len);
  222. } else {
  223. kv->value.leaf.data = NULL;
  224. }
  225. kv->value.leaf.len = bytes_to_quads(data_len);
  226. kv->offset = 0;
  227. kv->valid = 1;
  228. return kv;
  229. }
  230. static struct csr1212_keyval *
  231. csr1212_new_csr_offset(u8 key, u32 csr_offset)
  232. {
  233. struct csr1212_keyval *kv;
  234. kv = csr1212_new_keyval(CSR1212_KV_TYPE_CSR_OFFSET, key);
  235. if (!kv)
  236. return NULL;
  237. kv->value.csr_offset = csr_offset;
  238. kv->offset = 0;
  239. kv->valid = 1;
  240. return kv;
  241. }
  242. struct csr1212_keyval *csr1212_new_directory(u8 key)
  243. {
  244. struct csr1212_keyval *kv;
  245. kv = csr1212_new_keyval(CSR1212_KV_TYPE_DIRECTORY, key);
  246. if (!kv)
  247. return NULL;
  248. kv->value.directory.len = 0;
  249. kv->offset = 0;
  250. kv->value.directory.dentries_head = NULL;
  251. kv->value.directory.dentries_tail = NULL;
  252. kv->valid = 1;
  253. return kv;
  254. }
  255. void csr1212_associate_keyval(struct csr1212_keyval *kv,
  256. struct csr1212_keyval *associate)
  257. {
  258. BUG_ON(!kv || !associate || kv->key.id == CSR1212_KV_ID_DESCRIPTOR ||
  259. (associate->key.id != CSR1212_KV_ID_DESCRIPTOR &&
  260. associate->key.id != CSR1212_KV_ID_DEPENDENT_INFO &&
  261. associate->key.id != CSR1212_KV_ID_EXTENDED_KEY &&
  262. associate->key.id != CSR1212_KV_ID_EXTENDED_DATA &&
  263. associate->key.id < 0x30) ||
  264. (kv->key.id == CSR1212_KV_ID_EXTENDED_KEY_SPECIFIER_ID &&
  265. associate->key.id != CSR1212_KV_ID_EXTENDED_KEY) ||
  266. (kv->key.id == CSR1212_KV_ID_EXTENDED_KEY &&
  267. associate->key.id != CSR1212_KV_ID_EXTENDED_DATA) ||
  268. (associate->key.id == CSR1212_KV_ID_EXTENDED_KEY &&
  269. kv->key.id != CSR1212_KV_ID_EXTENDED_KEY_SPECIFIER_ID) ||
  270. (associate->key.id == CSR1212_KV_ID_EXTENDED_DATA &&
  271. kv->key.id != CSR1212_KV_ID_EXTENDED_KEY));
  272. if (kv->associate)
  273. csr1212_release_keyval(kv->associate);
  274. csr1212_keep_keyval(associate);
  275. kv->associate = associate;
  276. }
  277. static int __csr1212_attach_keyval_to_directory(struct csr1212_keyval *dir,
  278. struct csr1212_keyval *kv,
  279. bool keep_keyval)
  280. {
  281. struct csr1212_dentry *dentry;
  282. BUG_ON(!kv || !dir || dir->key.type != CSR1212_KV_TYPE_DIRECTORY);
  283. dentry = CSR1212_MALLOC(sizeof(*dentry));
  284. if (!dentry)
  285. return -ENOMEM;
  286. if (keep_keyval)
  287. csr1212_keep_keyval(kv);
  288. dentry->kv = kv;
  289. dentry->next = NULL;
  290. dentry->prev = dir->value.directory.dentries_tail;
  291. if (!dir->value.directory.dentries_head)
  292. dir->value.directory.dentries_head = dentry;
  293. if (dir->value.directory.dentries_tail)
  294. dir->value.directory.dentries_tail->next = dentry;
  295. dir->value.directory.dentries_tail = dentry;
  296. return CSR1212_SUCCESS;
  297. }
  298. int csr1212_attach_keyval_to_directory(struct csr1212_keyval *dir,
  299. struct csr1212_keyval *kv)
  300. {
  301. return __csr1212_attach_keyval_to_directory(dir, kv, true);
  302. }
  303. #define CSR1212_DESCRIPTOR_LEAF_DATA(kv) \
  304. (&((kv)->value.leaf.data[1]))
  305. #define CSR1212_DESCRIPTOR_LEAF_SET_TYPE(kv, type) \
  306. ((kv)->value.leaf.data[0] = \
  307. cpu_to_be32(CSR1212_DESCRIPTOR_LEAF_SPECIFIER_ID(kv) | \
  308. ((type) << CSR1212_DESCRIPTOR_LEAF_TYPE_SHIFT)))
  309. #define CSR1212_DESCRIPTOR_LEAF_SET_SPECIFIER_ID(kv, spec_id) \
  310. ((kv)->value.leaf.data[0] = \
  311. cpu_to_be32((CSR1212_DESCRIPTOR_LEAF_TYPE(kv) << \
  312. CSR1212_DESCRIPTOR_LEAF_TYPE_SHIFT) | \
  313. ((spec_id) & CSR1212_DESCRIPTOR_LEAF_SPECIFIER_ID_MASK)))
  314. static struct csr1212_keyval *
  315. csr1212_new_descriptor_leaf(u8 dtype, u32 specifier_id,
  316. const void *data, size_t data_len)
  317. {
  318. struct csr1212_keyval *kv;
  319. kv = csr1212_new_leaf(CSR1212_KV_ID_DESCRIPTOR, NULL,
  320. data_len + CSR1212_DESCRIPTOR_LEAF_OVERHEAD);
  321. if (!kv)
  322. return NULL;
  323. CSR1212_DESCRIPTOR_LEAF_SET_TYPE(kv, dtype);
  324. CSR1212_DESCRIPTOR_LEAF_SET_SPECIFIER_ID(kv, specifier_id);
  325. if (data)
  326. memcpy(CSR1212_DESCRIPTOR_LEAF_DATA(kv), data, data_len);
  327. return kv;
  328. }
  329. /* Check if string conforms to minimal ASCII as per IEEE 1212 clause 7.4 */
  330. static int csr1212_check_minimal_ascii(const char *s)
  331. {
  332. static const char minimal_ascii_table[] = {
  333. /* 1 2 4 8 16 32 64 128 */
  334. 128, /* --, --, --, --, --, --, --, 07, */
  335. 4 + 16 + 32, /* --, --, 0a, --, 0C, 0D, --, --, */
  336. 0, /* --, --, --, --, --, --, --, --, */
  337. 0, /* --, --, --, --, --, --, --, --, */
  338. 255 - 8 - 16, /* 20, 21, 22, --, --, 25, 26, 27, */
  339. 255, /* 28, 29, 2a, 2b, 2c, 2d, 2e, 2f, */
  340. 255, /* 30, 31, 32, 33, 34, 35, 36, 37, */
  341. 255, /* 38, 39, 3a, 3b, 3c, 3d, 3e, 3f, */
  342. 255, /* 40, 41, 42, 43, 44, 45, 46, 47, */
  343. 255, /* 48, 49, 4a, 4b, 4c, 4d, 4e, 4f, */
  344. 255, /* 50, 51, 52, 53, 54, 55, 56, 57, */
  345. 1 + 2 + 4 + 128, /* 58, 59, 5a, --, --, --, --, 5f, */
  346. 255 - 1, /* --, 61, 62, 63, 64, 65, 66, 67, */
  347. 255, /* 68, 69, 6a, 6b, 6c, 6d, 6e, 6f, */
  348. 255, /* 70, 71, 72, 73, 74, 75, 76, 77, */
  349. 1 + 2 + 4, /* 78, 79, 7a, --, --, --, --, --, */
  350. };
  351. int i, j;
  352. for (; *s; s++) {
  353. i = *s >> 3; /* i = *s / 8; */
  354. j = 1 << (*s & 3); /* j = 1 << (*s % 8); */
  355. if (i >= ARRAY_SIZE(minimal_ascii_table) ||
  356. !(minimal_ascii_table[i] & j))
  357. return -EINVAL;
  358. }
  359. return 0;
  360. }
  361. /* IEEE 1212 clause 7.5.4.1 textual descriptors (English, minimal ASCII) */
  362. struct csr1212_keyval *csr1212_new_string_descriptor_leaf(const char *s)
  363. {
  364. struct csr1212_keyval *kv;
  365. u32 *text;
  366. size_t str_len, quads;
  367. if (!s || !*s || csr1212_check_minimal_ascii(s))
  368. return NULL;
  369. str_len = strlen(s);
  370. quads = bytes_to_quads(str_len);
  371. kv = csr1212_new_descriptor_leaf(0, 0, NULL, quads_to_bytes(quads) +
  372. CSR1212_TEXTUAL_DESCRIPTOR_LEAF_OVERHEAD);
  373. if (!kv)
  374. return NULL;
  375. kv->value.leaf.data[1] = 0; /* width, character_set, language */
  376. text = CSR1212_TEXTUAL_DESCRIPTOR_LEAF_DATA(kv);
  377. text[quads - 1] = 0; /* padding */
  378. memcpy(text, s, str_len);
  379. return kv;
  380. }
  381. /* Destruction Routines */
  382. void csr1212_detach_keyval_from_directory(struct csr1212_keyval *dir,
  383. struct csr1212_keyval *kv)
  384. {
  385. struct csr1212_dentry *dentry;
  386. if (!kv || !dir || dir->key.type != CSR1212_KV_TYPE_DIRECTORY)
  387. return;
  388. dentry = csr1212_find_keyval(dir, kv);
  389. if (!dentry)
  390. return;
  391. if (dentry->prev)
  392. dentry->prev->next = dentry->next;
  393. if (dentry->next)
  394. dentry->next->prev = dentry->prev;
  395. if (dir->value.directory.dentries_head == dentry)
  396. dir->value.directory.dentries_head = dentry->next;
  397. if (dir->value.directory.dentries_tail == dentry)
  398. dir->value.directory.dentries_tail = dentry->prev;
  399. CSR1212_FREE(dentry);
  400. csr1212_release_keyval(kv);
  401. }
  402. /* This function is used to free the memory taken by a keyval. If the given
  403. * keyval is a directory type, then any keyvals contained in that directory
  404. * will be destroyed as well if noone holds a reference on them. By means of
  405. * list manipulation, this routine will descend a directory structure in a
  406. * non-recursive manner. */
  407. void csr1212_release_keyval(struct csr1212_keyval *kv)
  408. {
  409. struct csr1212_keyval *k, *a;
  410. struct csr1212_dentry dentry;
  411. struct csr1212_dentry *head, *tail;
  412. if (!atomic_dec_and_test(&kv->refcnt))
  413. return;
  414. dentry.kv = kv;
  415. dentry.next = NULL;
  416. dentry.prev = NULL;
  417. head = &dentry;
  418. tail = head;
  419. while (head) {
  420. k = head->kv;
  421. while (k) {
  422. /* must not dec_and_test kv->refcnt again */
  423. if (k != kv && !atomic_dec_and_test(&k->refcnt))
  424. break;
  425. a = k->associate;
  426. if (k->key.type == CSR1212_KV_TYPE_DIRECTORY) {
  427. /* If the current entry is a directory, move all
  428. * the entries to the destruction list. */
  429. if (k->value.directory.dentries_head) {
  430. tail->next =
  431. k->value.directory.dentries_head;
  432. k->value.directory.dentries_head->prev =
  433. tail;
  434. tail = k->value.directory.dentries_tail;
  435. }
  436. }
  437. free_keyval(k);
  438. k = a;
  439. }
  440. head = head->next;
  441. if (head) {
  442. if (head->prev && head->prev != &dentry)
  443. CSR1212_FREE(head->prev);
  444. head->prev = NULL;
  445. } else if (tail != &dentry) {
  446. CSR1212_FREE(tail);
  447. }
  448. }
  449. }
  450. void csr1212_destroy_csr(struct csr1212_csr *csr)
  451. {
  452. struct csr1212_csr_rom_cache *c, *oc;
  453. struct csr1212_cache_region *cr, *ocr;
  454. csr1212_release_keyval(csr->root_kv);
  455. c = csr->cache_head;
  456. while (c) {
  457. oc = c;
  458. cr = c->filled_head;
  459. while (cr) {
  460. ocr = cr;
  461. cr = cr->next;
  462. CSR1212_FREE(ocr);
  463. }
  464. c = c->next;
  465. CSR1212_FREE(oc);
  466. }
  467. CSR1212_FREE(csr);
  468. }
  469. /* CSR Image Creation */
  470. static int csr1212_append_new_cache(struct csr1212_csr *csr, size_t romsize)
  471. {
  472. struct csr1212_csr_rom_cache *cache;
  473. u64 csr_addr;
  474. BUG_ON(!csr || !csr->ops || !csr->ops->allocate_addr_range ||
  475. !csr->ops->release_addr || csr->max_rom < 1);
  476. /* ROM size must be a multiple of csr->max_rom */
  477. romsize = (romsize + (csr->max_rom - 1)) & ~(csr->max_rom - 1);
  478. csr_addr = csr->ops->allocate_addr_range(romsize, csr->max_rom,
  479. csr->private);
  480. if (csr_addr == CSR1212_INVALID_ADDR_SPACE)
  481. return -ENOMEM;
  482. if (csr_addr < CSR1212_REGISTER_SPACE_BASE) {
  483. /* Invalid address returned from allocate_addr_range(). */
  484. csr->ops->release_addr(csr_addr, csr->private);
  485. return -ENOMEM;
  486. }
  487. cache = csr1212_rom_cache_malloc(csr_addr - CSR1212_REGISTER_SPACE_BASE,
  488. romsize);
  489. if (!cache) {
  490. csr->ops->release_addr(csr_addr, csr->private);
  491. return -ENOMEM;
  492. }
  493. cache->ext_rom = csr1212_new_keyval(CSR1212_KV_TYPE_LEAF,
  494. CSR1212_KV_ID_EXTENDED_ROM);
  495. if (!cache->ext_rom) {
  496. csr->ops->release_addr(csr_addr, csr->private);
  497. CSR1212_FREE(cache);
  498. return -ENOMEM;
  499. }
  500. if (csr1212_attach_keyval_to_directory(csr->root_kv, cache->ext_rom) !=
  501. CSR1212_SUCCESS) {
  502. csr1212_release_keyval(cache->ext_rom);
  503. csr->ops->release_addr(csr_addr, csr->private);
  504. CSR1212_FREE(cache);
  505. return -ENOMEM;
  506. }
  507. cache->ext_rom->offset = csr_addr - CSR1212_REGISTER_SPACE_BASE;
  508. cache->ext_rom->value.leaf.len = -1;
  509. cache->ext_rom->value.leaf.data = cache->data;
  510. /* Add cache to tail of cache list */
  511. cache->prev = csr->cache_tail;
  512. csr->cache_tail->next = cache;
  513. csr->cache_tail = cache;
  514. return CSR1212_SUCCESS;
  515. }
  516. static void csr1212_remove_cache(struct csr1212_csr *csr,
  517. struct csr1212_csr_rom_cache *cache)
  518. {
  519. if (csr->cache_head == cache)
  520. csr->cache_head = cache->next;
  521. if (csr->cache_tail == cache)
  522. csr->cache_tail = cache->prev;
  523. if (cache->prev)
  524. cache->prev->next = cache->next;
  525. if (cache->next)
  526. cache->next->prev = cache->prev;
  527. if (cache->ext_rom) {
  528. csr1212_detach_keyval_from_directory(csr->root_kv,
  529. cache->ext_rom);
  530. csr1212_release_keyval(cache->ext_rom);
  531. }
  532. CSR1212_FREE(cache);
  533. }
  534. static int csr1212_generate_layout_subdir(struct csr1212_keyval *dir,
  535. struct csr1212_keyval **layout_tail)
  536. {
  537. struct csr1212_dentry *dentry;
  538. struct csr1212_keyval *dkv;
  539. struct csr1212_keyval *last_extkey_spec = NULL;
  540. struct csr1212_keyval *last_extkey = NULL;
  541. int num_entries = 0;
  542. for (dentry = dir->value.directory.dentries_head; dentry;
  543. dentry = dentry->next) {
  544. for (dkv = dentry->kv; dkv; dkv = dkv->associate) {
  545. /* Special Case: Extended Key Specifier_ID */
  546. if (dkv->key.id ==
  547. CSR1212_KV_ID_EXTENDED_KEY_SPECIFIER_ID) {
  548. if (last_extkey_spec == NULL)
  549. last_extkey_spec = dkv;
  550. else if (dkv->value.immediate !=
  551. last_extkey_spec->value.immediate)
  552. last_extkey_spec = dkv;
  553. else
  554. continue;
  555. /* Special Case: Extended Key */
  556. } else if (dkv->key.id == CSR1212_KV_ID_EXTENDED_KEY) {
  557. if (last_extkey == NULL)
  558. last_extkey = dkv;
  559. else if (dkv->value.immediate !=
  560. last_extkey->value.immediate)
  561. last_extkey = dkv;
  562. else
  563. continue;
  564. }
  565. num_entries += 1;
  566. switch (dkv->key.type) {
  567. default:
  568. case CSR1212_KV_TYPE_IMMEDIATE:
  569. case CSR1212_KV_TYPE_CSR_OFFSET:
  570. break;
  571. case CSR1212_KV_TYPE_LEAF:
  572. case CSR1212_KV_TYPE_DIRECTORY:
  573. /* Remove from list */
  574. if (dkv->prev && (dkv->prev->next == dkv))
  575. dkv->prev->next = dkv->next;
  576. if (dkv->next && (dkv->next->prev == dkv))
  577. dkv->next->prev = dkv->prev;
  578. //if (dkv == *layout_tail)
  579. // *layout_tail = dkv->prev;
  580. /* Special case: Extended ROM leafs */
  581. if (dkv->key.id == CSR1212_KV_ID_EXTENDED_ROM) {
  582. dkv->value.leaf.len = -1;
  583. /* Don't add Extended ROM leafs in the
  584. * layout list, they are handled
  585. * differently. */
  586. break;
  587. }
  588. /* Add to tail of list */
  589. dkv->next = NULL;
  590. dkv->prev = *layout_tail;
  591. (*layout_tail)->next = dkv;
  592. *layout_tail = dkv;
  593. break;
  594. }
  595. }
  596. }
  597. return num_entries;
  598. }
  599. static size_t csr1212_generate_layout_order(struct csr1212_keyval *kv)
  600. {
  601. struct csr1212_keyval *ltail = kv;
  602. size_t agg_size = 0;
  603. while (kv) {
  604. switch (kv->key.type) {
  605. case CSR1212_KV_TYPE_LEAF:
  606. /* Add 1 quadlet for crc/len field */
  607. agg_size += kv->value.leaf.len + 1;
  608. break;
  609. case CSR1212_KV_TYPE_DIRECTORY:
  610. kv->value.directory.len =
  611. csr1212_generate_layout_subdir(kv, &ltail);
  612. /* Add 1 quadlet for crc/len field */
  613. agg_size += kv->value.directory.len + 1;
  614. break;
  615. }
  616. kv = kv->next;
  617. }
  618. return quads_to_bytes(agg_size);
  619. }
  620. static struct csr1212_keyval *
  621. csr1212_generate_positions(struct csr1212_csr_rom_cache *cache,
  622. struct csr1212_keyval *start_kv, int start_pos)
  623. {
  624. struct csr1212_keyval *kv = start_kv;
  625. struct csr1212_keyval *okv = start_kv;
  626. int pos = start_pos;
  627. int kv_len = 0, okv_len = 0;
  628. cache->layout_head = kv;
  629. while (kv && pos < cache->size) {
  630. /* Special case: Extended ROM leafs */
  631. if (kv->key.id != CSR1212_KV_ID_EXTENDED_ROM)
  632. kv->offset = cache->offset + pos;
  633. switch (kv->key.type) {
  634. case CSR1212_KV_TYPE_LEAF:
  635. kv_len = kv->value.leaf.len;
  636. break;
  637. case CSR1212_KV_TYPE_DIRECTORY:
  638. kv_len = kv->value.directory.len;
  639. break;
  640. default:
  641. /* Should never get here */
  642. WARN_ON(1);
  643. break;
  644. }
  645. pos += quads_to_bytes(kv_len + 1);
  646. if (pos <= cache->size) {
  647. okv = kv;
  648. okv_len = kv_len;
  649. kv = kv->next;
  650. }
  651. }
  652. cache->layout_tail = okv;
  653. cache->len = okv->offset - cache->offset + quads_to_bytes(okv_len + 1);
  654. return kv;
  655. }
  656. #define CSR1212_KV_KEY_SHIFT 24
  657. #define CSR1212_KV_KEY_TYPE_SHIFT 6
  658. #define CSR1212_KV_KEY_ID_MASK 0x3f
  659. #define CSR1212_KV_KEY_TYPE_MASK 0x3 /* after shift */
  660. static void
  661. csr1212_generate_tree_subdir(struct csr1212_keyval *dir, u32 *data_buffer)
  662. {
  663. struct csr1212_dentry *dentry;
  664. struct csr1212_keyval *last_extkey_spec = NULL;
  665. struct csr1212_keyval *last_extkey = NULL;
  666. int index = 0;
  667. for (dentry = dir->value.directory.dentries_head;
  668. dentry;
  669. dentry = dentry->next) {
  670. struct csr1212_keyval *a;
  671. for (a = dentry->kv; a; a = a->associate) {
  672. u32 value = 0;
  673. /* Special Case: Extended Key Specifier_ID */
  674. if (a->key.id ==
  675. CSR1212_KV_ID_EXTENDED_KEY_SPECIFIER_ID) {
  676. if (last_extkey_spec == NULL)
  677. last_extkey_spec = a;
  678. else if (a->value.immediate !=
  679. last_extkey_spec->value.immediate)
  680. last_extkey_spec = a;
  681. else
  682. continue;
  683. /* Special Case: Extended Key */
  684. } else if (a->key.id == CSR1212_KV_ID_EXTENDED_KEY) {
  685. if (last_extkey == NULL)
  686. last_extkey = a;
  687. else if (a->value.immediate !=
  688. last_extkey->value.immediate)
  689. last_extkey = a;
  690. else
  691. continue;
  692. }
  693. switch (a->key.type) {
  694. case CSR1212_KV_TYPE_IMMEDIATE:
  695. value = a->value.immediate;
  696. break;
  697. case CSR1212_KV_TYPE_CSR_OFFSET:
  698. value = a->value.csr_offset;
  699. break;
  700. case CSR1212_KV_TYPE_LEAF:
  701. value = a->offset;
  702. value -= dir->offset + quads_to_bytes(1+index);
  703. value = bytes_to_quads(value);
  704. break;
  705. case CSR1212_KV_TYPE_DIRECTORY:
  706. value = a->offset;
  707. value -= dir->offset + quads_to_bytes(1+index);
  708. value = bytes_to_quads(value);
  709. break;
  710. default:
  711. /* Should never get here */
  712. WARN_ON(1);
  713. break;
  714. }
  715. value |= (a->key.id & CSR1212_KV_KEY_ID_MASK) <<
  716. CSR1212_KV_KEY_SHIFT;
  717. value |= (a->key.type & CSR1212_KV_KEY_TYPE_MASK) <<
  718. (CSR1212_KV_KEY_SHIFT +
  719. CSR1212_KV_KEY_TYPE_SHIFT);
  720. data_buffer[index] = cpu_to_be32(value);
  721. index++;
  722. }
  723. }
  724. }
  725. struct csr1212_keyval_img {
  726. u16 length;
  727. u16 crc;
  728. /* Must be last */
  729. u32 data[0]; /* older gcc can't handle [] which is standard */
  730. };
  731. static void csr1212_fill_cache(struct csr1212_csr_rom_cache *cache)
  732. {
  733. struct csr1212_keyval *kv, *nkv;
  734. struct csr1212_keyval_img *kvi;
  735. for (kv = cache->layout_head;
  736. kv != cache->layout_tail->next;
  737. kv = nkv) {
  738. kvi = (struct csr1212_keyval_img *)(cache->data +
  739. bytes_to_quads(kv->offset - cache->offset));
  740. switch (kv->key.type) {
  741. default:
  742. case CSR1212_KV_TYPE_IMMEDIATE:
  743. case CSR1212_KV_TYPE_CSR_OFFSET:
  744. /* Should never get here */
  745. WARN_ON(1);
  746. break;
  747. case CSR1212_KV_TYPE_LEAF:
  748. /* Don't copy over Extended ROM areas, they are
  749. * already filled out! */
  750. if (kv->key.id != CSR1212_KV_ID_EXTENDED_ROM)
  751. memcpy(kvi->data, kv->value.leaf.data,
  752. quads_to_bytes(kv->value.leaf.len));
  753. kvi->length = cpu_to_be16(kv->value.leaf.len);
  754. kvi->crc = csr1212_crc16(kvi->data, kv->value.leaf.len);
  755. break;
  756. case CSR1212_KV_TYPE_DIRECTORY:
  757. csr1212_generate_tree_subdir(kv, kvi->data);
  758. kvi->length = cpu_to_be16(kv->value.directory.len);
  759. kvi->crc = csr1212_crc16(kvi->data,
  760. kv->value.directory.len);
  761. break;
  762. }
  763. nkv = kv->next;
  764. if (kv->prev)
  765. kv->prev->next = NULL;
  766. if (kv->next)
  767. kv->next->prev = NULL;
  768. kv->prev = NULL;
  769. kv->next = NULL;
  770. }
  771. }
  772. /* This size is arbitrarily chosen.
  773. * The struct overhead is subtracted for more economic allocations. */
  774. #define CSR1212_EXTENDED_ROM_SIZE (2048 - sizeof(struct csr1212_csr_rom_cache))
  775. int csr1212_generate_csr_image(struct csr1212_csr *csr)
  776. {
  777. struct csr1212_bus_info_block_img *bi;
  778. struct csr1212_csr_rom_cache *cache;
  779. struct csr1212_keyval *kv;
  780. size_t agg_size;
  781. int ret;
  782. int init_offset;
  783. BUG_ON(!csr);
  784. cache = csr->cache_head;
  785. bi = (struct csr1212_bus_info_block_img*)cache->data;
  786. bi->length = bytes_to_quads(csr->bus_info_len) - 1;
  787. bi->crc_length = bi->length;
  788. bi->crc = csr1212_crc16(bi->data, bi->crc_length);
  789. csr->root_kv->next = NULL;
  790. csr->root_kv->prev = NULL;
  791. agg_size = csr1212_generate_layout_order(csr->root_kv);
  792. init_offset = csr->bus_info_len;
  793. for (kv = csr->root_kv, cache = csr->cache_head;
  794. kv;
  795. cache = cache->next) {
  796. if (!cache) {
  797. /* Estimate approximate number of additional cache
  798. * regions needed (it assumes that the cache holding
  799. * the first 1K Config ROM space always exists). */
  800. int est_c = agg_size / (CSR1212_EXTENDED_ROM_SIZE -
  801. (2 * sizeof(u32))) + 1;
  802. /* Add additional cache regions, extras will be
  803. * removed later */
  804. for (; est_c; est_c--) {
  805. ret = csr1212_append_new_cache(csr,
  806. CSR1212_EXTENDED_ROM_SIZE);
  807. if (ret != CSR1212_SUCCESS)
  808. return ret;
  809. }
  810. /* Need to re-layout for additional cache regions */
  811. agg_size = csr1212_generate_layout_order(csr->root_kv);
  812. kv = csr->root_kv;
  813. cache = csr->cache_head;
  814. init_offset = csr->bus_info_len;
  815. }
  816. kv = csr1212_generate_positions(cache, kv, init_offset);
  817. agg_size -= cache->len;
  818. init_offset = sizeof(u32);
  819. }
  820. /* Remove unused, excess cache regions */
  821. while (cache) {
  822. struct csr1212_csr_rom_cache *oc = cache;
  823. cache = cache->next;
  824. csr1212_remove_cache(csr, oc);
  825. }
  826. /* Go through the list backward so that when done, the correct CRC
  827. * will be calculated for the Extended ROM areas. */
  828. for (cache = csr->cache_tail; cache; cache = cache->prev) {
  829. /* Only Extended ROM caches should have this set. */
  830. if (cache->ext_rom) {
  831. int leaf_size;
  832. /* Make sure the Extended ROM leaf is a multiple of
  833. * max_rom in size. */
  834. BUG_ON(csr->max_rom < 1);
  835. leaf_size = (cache->len + (csr->max_rom - 1)) &
  836. ~(csr->max_rom - 1);
  837. /* Zero out the unused ROM region */
  838. memset(cache->data + bytes_to_quads(cache->len), 0x00,
  839. leaf_size - cache->len);
  840. /* Subtract leaf header */
  841. leaf_size -= sizeof(u32);
  842. /* Update the Extended ROM leaf length */
  843. cache->ext_rom->value.leaf.len =
  844. bytes_to_quads(leaf_size);
  845. } else {
  846. /* Zero out the unused ROM region */
  847. memset(cache->data + bytes_to_quads(cache->len), 0x00,
  848. cache->size - cache->len);
  849. }
  850. /* Copy the data into the cache buffer */
  851. csr1212_fill_cache(cache);
  852. if (cache != csr->cache_head) {
  853. /* Set the length and CRC of the extended ROM. */
  854. struct csr1212_keyval_img *kvi =
  855. (struct csr1212_keyval_img*)cache->data;
  856. u16 len = bytes_to_quads(cache->len) - 1;
  857. kvi->length = cpu_to_be16(len);
  858. kvi->crc = csr1212_crc16(kvi->data, len);
  859. }
  860. }
  861. return CSR1212_SUCCESS;
  862. }
  863. int csr1212_read(struct csr1212_csr *csr, u32 offset, void *buffer, u32 len)
  864. {
  865. struct csr1212_csr_rom_cache *cache;
  866. for (cache = csr->cache_head; cache; cache = cache->next)
  867. if (offset >= cache->offset &&
  868. (offset + len) <= (cache->offset + cache->size)) {
  869. memcpy(buffer, &cache->data[
  870. bytes_to_quads(offset - cache->offset)],
  871. len);
  872. return CSR1212_SUCCESS;
  873. }
  874. return -ENOENT;
  875. }
  876. /*
  877. * Apparently there are many different wrong implementations of the CRC
  878. * algorithm. We don't fail, we just warn... approximately once per GUID.
  879. */
  880. static void
  881. csr1212_check_crc(const u32 *buffer, size_t length, u16 crc, __be32 *guid)
  882. {
  883. static u64 last_bad_eui64;
  884. u64 eui64 = ((u64)be32_to_cpu(guid[0]) << 32) | be32_to_cpu(guid[1]);
  885. if (csr1212_crc16(buffer, length) == crc ||
  886. csr1212_msft_crc16(buffer, length) == crc ||
  887. eui64 == last_bad_eui64)
  888. return;
  889. printk(KERN_DEBUG "ieee1394: config ROM CRC error\n");
  890. last_bad_eui64 = eui64;
  891. }
  892. /* Parse a chunk of data as a Config ROM */
  893. static int csr1212_parse_bus_info_block(struct csr1212_csr *csr)
  894. {
  895. struct csr1212_bus_info_block_img *bi;
  896. struct csr1212_cache_region *cr;
  897. int i;
  898. int ret;
  899. for (i = 0; i < csr->bus_info_len; i += sizeof(u32)) {
  900. ret = csr->ops->bus_read(csr, CSR1212_CONFIG_ROM_SPACE_BASE + i,
  901. &csr->cache_head->data[bytes_to_quads(i)],
  902. csr->private);
  903. if (ret != CSR1212_SUCCESS)
  904. return ret;
  905. /* check ROM header's info_length */
  906. if (i == 0 &&
  907. be32_to_cpu(csr->cache_head->data[0]) >> 24 !=
  908. bytes_to_quads(csr->bus_info_len) - 1)
  909. return -EINVAL;
  910. }
  911. bi = (struct csr1212_bus_info_block_img*)csr->cache_head->data;
  912. csr->crc_len = quads_to_bytes(bi->crc_length);
  913. /* IEEE 1212 recommends that crc_len be equal to bus_info_len, but that
  914. * is not always the case, so read the rest of the crc area 1 quadlet at
  915. * a time. */
  916. for (i = csr->bus_info_len; i <= csr->crc_len; i += sizeof(u32)) {
  917. ret = csr->ops->bus_read(csr, CSR1212_CONFIG_ROM_SPACE_BASE + i,
  918. &csr->cache_head->data[bytes_to_quads(i)],
  919. csr->private);
  920. if (ret != CSR1212_SUCCESS)
  921. return ret;
  922. }
  923. csr1212_check_crc(bi->data, bi->crc_length, bi->crc,
  924. &csr->bus_info_data[3]);
  925. cr = CSR1212_MALLOC(sizeof(*cr));
  926. if (!cr)
  927. return -ENOMEM;
  928. cr->next = NULL;
  929. cr->prev = NULL;
  930. cr->offset_start = 0;
  931. cr->offset_end = csr->crc_len + 4;
  932. csr->cache_head->filled_head = cr;
  933. csr->cache_head->filled_tail = cr;
  934. return CSR1212_SUCCESS;
  935. }
  936. #define CSR1212_KV_KEY(q) (be32_to_cpu(q) >> CSR1212_KV_KEY_SHIFT)
  937. #define CSR1212_KV_KEY_TYPE(q) (CSR1212_KV_KEY(q) >> CSR1212_KV_KEY_TYPE_SHIFT)
  938. #define CSR1212_KV_KEY_ID(q) (CSR1212_KV_KEY(q) & CSR1212_KV_KEY_ID_MASK)
  939. #define CSR1212_KV_VAL_MASK 0xffffff
  940. #define CSR1212_KV_VAL(q) (be32_to_cpu(q) & CSR1212_KV_VAL_MASK)
  941. static int
  942. csr1212_parse_dir_entry(struct csr1212_keyval *dir, u32 ki, u32 kv_pos)
  943. {
  944. int ret = CSR1212_SUCCESS;
  945. struct csr1212_keyval *k = NULL;
  946. u32 offset;
  947. bool keep_keyval = true;
  948. switch (CSR1212_KV_KEY_TYPE(ki)) {
  949. case CSR1212_KV_TYPE_IMMEDIATE:
  950. k = csr1212_new_immediate(CSR1212_KV_KEY_ID(ki),
  951. CSR1212_KV_VAL(ki));
  952. if (!k) {
  953. ret = -ENOMEM;
  954. goto out;
  955. }
  956. /* Don't keep local reference when parsing. */
  957. keep_keyval = false;
  958. break;
  959. case CSR1212_KV_TYPE_CSR_OFFSET:
  960. k = csr1212_new_csr_offset(CSR1212_KV_KEY_ID(ki),
  961. CSR1212_KV_VAL(ki));
  962. if (!k) {
  963. ret = -ENOMEM;
  964. goto out;
  965. }
  966. /* Don't keep local reference when parsing. */
  967. keep_keyval = false;
  968. break;
  969. default:
  970. /* Compute the offset from 0xffff f000 0000. */
  971. offset = quads_to_bytes(CSR1212_KV_VAL(ki)) + kv_pos;
  972. if (offset == kv_pos) {
  973. /* Uh-oh. Can't have a relative offset of 0 for Leaves
  974. * or Directories. The Config ROM image is most likely
  975. * messed up, so we'll just abort here. */
  976. ret = -EIO;
  977. goto out;
  978. }
  979. k = csr1212_find_keyval_offset(dir, offset);
  980. if (k)
  981. break; /* Found it. */
  982. if (CSR1212_KV_KEY_TYPE(ki) == CSR1212_KV_TYPE_DIRECTORY)
  983. k = csr1212_new_directory(CSR1212_KV_KEY_ID(ki));
  984. else
  985. k = csr1212_new_leaf(CSR1212_KV_KEY_ID(ki), NULL, 0);
  986. if (!k) {
  987. ret = -ENOMEM;
  988. goto out;
  989. }
  990. /* Don't keep local reference when parsing. */
  991. keep_keyval = false;
  992. /* Contents not read yet so it's not valid. */
  993. k->valid = 0;
  994. k->offset = offset;
  995. k->prev = dir;
  996. k->next = dir->next;
  997. dir->next->prev = k;
  998. dir->next = k;
  999. }
  1000. ret = __csr1212_attach_keyval_to_directory(dir, k, keep_keyval);
  1001. out:
  1002. if (ret != CSR1212_SUCCESS && k != NULL)
  1003. free_keyval(k);
  1004. return ret;
  1005. }
  1006. int csr1212_parse_keyval(struct csr1212_keyval *kv,
  1007. struct csr1212_csr_rom_cache *cache)
  1008. {
  1009. struct csr1212_keyval_img *kvi;
  1010. int i;
  1011. int ret = CSR1212_SUCCESS;
  1012. int kvi_len;
  1013. kvi = (struct csr1212_keyval_img*)
  1014. &cache->data[bytes_to_quads(kv->offset - cache->offset)];
  1015. kvi_len = be16_to_cpu(kvi->length);
  1016. /* GUID is wrong in here in case of extended ROM. We don't care. */
  1017. csr1212_check_crc(kvi->data, kvi_len, kvi->crc, &cache->data[3]);
  1018. switch (kv->key.type) {
  1019. case CSR1212_KV_TYPE_DIRECTORY:
  1020. for (i = 0; i < kvi_len; i++) {
  1021. u32 ki = kvi->data[i];
  1022. /* Some devices put null entries in their unit
  1023. * directories. If we come across such an entry,
  1024. * then skip it. */
  1025. if (ki == 0x0)
  1026. continue;
  1027. ret = csr1212_parse_dir_entry(kv, ki,
  1028. kv->offset + quads_to_bytes(i + 1));
  1029. }
  1030. kv->value.directory.len = kvi_len;
  1031. break;
  1032. case CSR1212_KV_TYPE_LEAF:
  1033. if (kv->key.id != CSR1212_KV_ID_EXTENDED_ROM) {
  1034. size_t size = quads_to_bytes(kvi_len);
  1035. kv->value.leaf.data = CSR1212_MALLOC(size);
  1036. if (!kv->value.leaf.data) {
  1037. ret = -ENOMEM;
  1038. goto out;
  1039. }
  1040. kv->value.leaf.len = kvi_len;
  1041. memcpy(kv->value.leaf.data, kvi->data, size);
  1042. }
  1043. break;
  1044. }
  1045. kv->valid = 1;
  1046. out:
  1047. return ret;
  1048. }
  1049. static int
  1050. csr1212_read_keyval(struct csr1212_csr *csr, struct csr1212_keyval *kv)
  1051. {
  1052. struct csr1212_cache_region *cr, *ncr, *newcr = NULL;
  1053. struct csr1212_keyval_img *kvi = NULL;
  1054. struct csr1212_csr_rom_cache *cache;
  1055. int cache_index;
  1056. u64 addr;
  1057. u32 *cache_ptr;
  1058. u16 kv_len = 0;
  1059. BUG_ON(!csr || !kv || csr->max_rom < 1);
  1060. /* First find which cache the data should be in (or go in if not read
  1061. * yet). */
  1062. for (cache = csr->cache_head; cache; cache = cache->next)
  1063. if (kv->offset >= cache->offset &&
  1064. kv->offset < (cache->offset + cache->size))
  1065. break;
  1066. if (!cache) {
  1067. u32 q, cache_size;
  1068. /* Only create a new cache for Extended ROM leaves. */
  1069. if (kv->key.id != CSR1212_KV_ID_EXTENDED_ROM)
  1070. return -EINVAL;
  1071. if (csr->ops->bus_read(csr,
  1072. CSR1212_REGISTER_SPACE_BASE + kv->offset,
  1073. &q, csr->private))
  1074. return -EIO;
  1075. kv->value.leaf.len = be32_to_cpu(q) >> 16;
  1076. cache_size = (quads_to_bytes(kv->value.leaf.len + 1) +
  1077. (csr->max_rom - 1)) & ~(csr->max_rom - 1);
  1078. cache = csr1212_rom_cache_malloc(kv->offset, cache_size);
  1079. if (!cache)
  1080. return -ENOMEM;
  1081. kv->value.leaf.data = &cache->data[1];
  1082. csr->cache_tail->next = cache;
  1083. cache->prev = csr->cache_tail;
  1084. cache->next = NULL;
  1085. csr->cache_tail = cache;
  1086. cache->filled_head =
  1087. CSR1212_MALLOC(sizeof(*cache->filled_head));
  1088. if (!cache->filled_head)
  1089. return -ENOMEM;
  1090. cache->filled_head->offset_start = 0;
  1091. cache->filled_head->offset_end = sizeof(u32);
  1092. cache->filled_tail = cache->filled_head;
  1093. cache->filled_head->next = NULL;
  1094. cache->filled_head->prev = NULL;
  1095. cache->data[0] = q;
  1096. /* Don't read the entire extended ROM now. Pieces of it will
  1097. * be read when entries inside it are read. */
  1098. return csr1212_parse_keyval(kv, cache);
  1099. }
  1100. cache_index = kv->offset - cache->offset;
  1101. /* Now seach read portions of the cache to see if it is there. */
  1102. for (cr = cache->filled_head; cr; cr = cr->next) {
  1103. if (cache_index < cr->offset_start) {
  1104. newcr = CSR1212_MALLOC(sizeof(*newcr));
  1105. if (!newcr)
  1106. return -ENOMEM;
  1107. newcr->offset_start = cache_index & ~(csr->max_rom - 1);
  1108. newcr->offset_end = newcr->offset_start;
  1109. newcr->next = cr;
  1110. newcr->prev = cr->prev;
  1111. cr->prev = newcr;
  1112. cr = newcr;
  1113. break;
  1114. } else if ((cache_index >= cr->offset_start) &&
  1115. (cache_index < cr->offset_end)) {
  1116. kvi = (struct csr1212_keyval_img*)
  1117. (&cache->data[bytes_to_quads(cache_index)]);
  1118. kv_len = quads_to_bytes(be16_to_cpu(kvi->length) + 1);
  1119. break;
  1120. } else if (cache_index == cr->offset_end) {
  1121. break;
  1122. }
  1123. }
  1124. if (!cr) {
  1125. cr = cache->filled_tail;
  1126. newcr = CSR1212_MALLOC(sizeof(*newcr));
  1127. if (!newcr)
  1128. return -ENOMEM;
  1129. newcr->offset_start = cache_index & ~(csr->max_rom - 1);
  1130. newcr->offset_end = newcr->offset_start;
  1131. newcr->prev = cr;
  1132. newcr->next = cr->next;
  1133. cr->next = newcr;
  1134. cr = newcr;
  1135. cache->filled_tail = newcr;
  1136. }
  1137. while(!kvi || cr->offset_end < cache_index + kv_len) {
  1138. cache_ptr = &cache->data[bytes_to_quads(cr->offset_end &
  1139. ~(csr->max_rom - 1))];
  1140. addr = (CSR1212_CSR_ARCH_REG_SPACE_BASE + cache->offset +
  1141. cr->offset_end) & ~(csr->max_rom - 1);
  1142. if (csr->ops->bus_read(csr, addr, cache_ptr, csr->private))
  1143. return -EIO;
  1144. cr->offset_end += csr->max_rom - (cr->offset_end &
  1145. (csr->max_rom - 1));
  1146. if (!kvi && (cr->offset_end > cache_index)) {
  1147. kvi = (struct csr1212_keyval_img*)
  1148. (&cache->data[bytes_to_quads(cache_index)]);
  1149. kv_len = quads_to_bytes(be16_to_cpu(kvi->length) + 1);
  1150. }
  1151. if ((kv_len + (kv->offset - cache->offset)) > cache->size) {
  1152. /* The Leaf or Directory claims its length extends
  1153. * beyond the ConfigROM image region and thus beyond the
  1154. * end of our cache region. Therefore, we abort now
  1155. * rather than seg faulting later. */
  1156. return -EIO;
  1157. }
  1158. ncr = cr->next;
  1159. if (ncr && (cr->offset_end >= ncr->offset_start)) {
  1160. /* consolidate region entries */
  1161. ncr->offset_start = cr->offset_start;
  1162. if (cr->prev)
  1163. cr->prev->next = cr->next;
  1164. ncr->prev = cr->prev;
  1165. if (cache->filled_head == cr)
  1166. cache->filled_head = ncr;
  1167. CSR1212_FREE(cr);
  1168. cr = ncr;
  1169. }
  1170. }
  1171. return csr1212_parse_keyval(kv, cache);
  1172. }
  1173. struct csr1212_keyval *
  1174. csr1212_get_keyval(struct csr1212_csr *csr, struct csr1212_keyval *kv)
  1175. {
  1176. if (!kv)
  1177. return NULL;
  1178. if (!kv->valid)
  1179. if (csr1212_read_keyval(csr, kv) != CSR1212_SUCCESS)
  1180. return NULL;
  1181. return kv;
  1182. }
  1183. int csr1212_parse_csr(struct csr1212_csr *csr)
  1184. {
  1185. struct csr1212_dentry *dentry;
  1186. int ret;
  1187. BUG_ON(!csr || !csr->ops || !csr->ops->bus_read);
  1188. ret = csr1212_parse_bus_info_block(csr);
  1189. if (ret != CSR1212_SUCCESS)
  1190. return ret;
  1191. /*
  1192. * There has been a buggy firmware with bus_info_block.max_rom > 0
  1193. * spotted which actually only supported quadlet read requests to the
  1194. * config ROM. Therefore read everything quadlet by quadlet regardless
  1195. * of what the bus info block says.
  1196. */
  1197. csr->max_rom = 4;
  1198. csr->cache_head->layout_head = csr->root_kv;
  1199. csr->cache_head->layout_tail = csr->root_kv;
  1200. csr->root_kv->offset = (CSR1212_CONFIG_ROM_SPACE_BASE & 0xffff) +
  1201. csr->bus_info_len;
  1202. csr->root_kv->valid = 0;
  1203. csr->root_kv->next = csr->root_kv;
  1204. csr->root_kv->prev = csr->root_kv;
  1205. ret = csr1212_read_keyval(csr, csr->root_kv);
  1206. if (ret != CSR1212_SUCCESS)
  1207. return ret;
  1208. /* Scan through the Root directory finding all extended ROM regions
  1209. * and make cache regions for them */
  1210. for (dentry = csr->root_kv->value.directory.dentries_head;
  1211. dentry; dentry = dentry->next) {
  1212. if (dentry->kv->key.id == CSR1212_KV_ID_EXTENDED_ROM &&
  1213. !dentry->kv->valid) {
  1214. ret = csr1212_read_keyval(csr, dentry->kv);
  1215. if (ret != CSR1212_SUCCESS)
  1216. return ret;
  1217. }
  1218. }
  1219. return CSR1212_SUCCESS;
  1220. }