csr1212.c 38 KB

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