csr1212.c 38 KB

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