csr1212.c 39 KB

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