dsi_parser.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * Copyright (c) 2018-2021, The Linux Foundation. All rights reserved.
  4. */
  5. #include <linux/delay.h>
  6. #include <linux/slab.h>
  7. #include <linux/string.h>
  8. #include <linux/firmware.h>
  9. #include <linux/debugfs.h>
  10. #include <linux/uaccess.h>
  11. #include <linux/device.h>
  12. #include "dsi_parser.h"
  13. #include "dsi_defs.h"
  14. #define DSI_PARSER_MAX_NODES 20
  15. enum dsi_parser_prop_type {
  16. DSI_PROP_TYPE_STR,
  17. DSI_PROP_TYPE_STR_ARRAY,
  18. DSI_PROP_TYPE_INT_SET,
  19. DSI_PROP_TYPE_INT_SET_ARRAY,
  20. DSI_PROP_TYPE_INT_ARRAY,
  21. };
  22. struct dsi_parser_prop {
  23. char *name;
  24. char *raw;
  25. char *value;
  26. char **items;
  27. enum dsi_parser_prop_type type;
  28. int len;
  29. };
  30. struct dsi_parser_node {
  31. char *name;
  32. char *data;
  33. struct dsi_parser_prop *prop;
  34. int prop_count;
  35. struct dsi_parser_node *child[DSI_PARSER_MAX_NODES];
  36. int children_count;
  37. };
  38. struct dsi_parser {
  39. const struct firmware *fw;
  40. struct dsi_parser_node *head_node;
  41. struct dsi_parser_node *current_node;
  42. struct device *dev;
  43. char *buf;
  44. char file_name[SZ_32];
  45. };
  46. static int dsi_parser_count(char *buf, int item)
  47. {
  48. int count = 0;
  49. do {
  50. buf = strnchr(buf, strlen(buf), item);
  51. if (buf)
  52. count++;
  53. } while (buf++);
  54. return count;
  55. }
  56. static char *dsi_parser_clear_tail(char *buf)
  57. {
  58. int size = strlen(buf);
  59. char *end;
  60. if (!size)
  61. goto exit;
  62. end = buf + size - 1;
  63. while (end >= buf && *end == '*')
  64. end--;
  65. *(end + 1) = '\0';
  66. exit:
  67. return buf;
  68. }
  69. static char *dsi_parser_strim(char *buf)
  70. {
  71. strreplace(buf, '*', ' ');
  72. return strim(buf);
  73. }
  74. static char *dsi_parser_get_data(char *start, char *end, char *str)
  75. {
  76. strsep(&str, start);
  77. if (str)
  78. return dsi_parser_clear_tail(strsep(&str, end));
  79. return NULL;
  80. }
  81. static bool dsi_parser_get_tuples_data(
  82. struct dsi_parser_prop *prop, char *str)
  83. {
  84. bool middle_of_tx = false;
  85. if (!str) {
  86. DSI_ERR("Invalid input\n");
  87. return middle_of_tx;
  88. }
  89. while (str) {
  90. char *out = strsep(&str, " ");
  91. if (str || middle_of_tx) {
  92. middle_of_tx = true;
  93. prop->items[prop->len++] = dsi_parser_strim(out);
  94. }
  95. }
  96. return middle_of_tx;
  97. }
  98. static bool dsi_parser_get_strings(struct device *dev,
  99. struct dsi_parser_prop *prop, char *str)
  100. {
  101. bool middle_of_tx = false;
  102. int i = 0;
  103. int count = 0;
  104. if (!str) {
  105. DSI_ERR("Invalid input\n");
  106. goto end;
  107. }
  108. if (!dsi_parser_count(str, '"'))
  109. goto end;
  110. count = dsi_parser_count(str, ',');
  111. DSI_DEBUG("count=%d\n", count);
  112. if (!count) {
  113. prop->value = dsi_parser_get_data("\"", "\"", str);
  114. prop->type = DSI_PROP_TYPE_STR;
  115. middle_of_tx = prop->value ? true : false;
  116. goto end;
  117. }
  118. /* number of items are 1 more than separator */
  119. count++;
  120. prop->items = devm_kzalloc(dev, count, GFP_KERNEL);
  121. if (!prop->items)
  122. goto end;
  123. prop->type = DSI_PROP_TYPE_STR_ARRAY;
  124. while (str) {
  125. char *out = strsep(&str, ",");
  126. if ((str || middle_of_tx) && (i < count)) {
  127. prop->items[i++] =
  128. dsi_parser_get_data("\"", "\"", out);
  129. prop->len++;
  130. middle_of_tx = true;
  131. }
  132. }
  133. end:
  134. return middle_of_tx;
  135. }
  136. static bool dsi_parser_get_tuples(struct device *dev,
  137. struct dsi_parser_prop *prop, char *str)
  138. {
  139. bool middle_of_tx = false;
  140. char *data = NULL;
  141. if (!str) {
  142. DSI_ERR("Invalid input\n");
  143. return middle_of_tx;
  144. }
  145. while (str) {
  146. char *out = strsep(&str, ",");
  147. if (str || middle_of_tx) {
  148. data = dsi_parser_get_data("<", ">", out);
  149. middle_of_tx = true;
  150. dsi_parser_get_tuples_data(prop, data);
  151. }
  152. }
  153. return middle_of_tx;
  154. }
  155. static void dsi_parser_get_int_value(struct dsi_parser_prop *prop,
  156. int forced_base)
  157. {
  158. int i;
  159. for (i = 0; i < prop->len; i++) {
  160. int base, val;
  161. char *to_int, *tmp;
  162. char item[SZ_128];
  163. strlcpy(item, prop->items[i], SZ_128);
  164. tmp = item;
  165. if (forced_base) {
  166. base = forced_base;
  167. } else {
  168. to_int = strsep(&tmp, "x");
  169. if (!tmp) {
  170. tmp = to_int;
  171. base = 10;
  172. } else {
  173. base = 16;
  174. }
  175. }
  176. if (kstrtoint(tmp, base, &val)) {
  177. DSI_ERR("error converting %s at %d\n",
  178. tmp, i);
  179. continue;
  180. }
  181. prop->value[i] = val & 0xFF;
  182. }
  183. }
  184. static bool dsi_parser_parse_prop(struct device *dev,
  185. struct dsi_parser_prop *prop, char *buf)
  186. {
  187. bool found = false;
  188. char *out = strsep(&buf, "=");
  189. size_t buf_len;
  190. if (!out || !buf)
  191. goto end;
  192. buf_len = strlen(buf);
  193. prop->raw = devm_kzalloc(dev, buf_len + 1, GFP_KERNEL);
  194. if (!prop->raw)
  195. goto end;
  196. strlcpy(prop->raw, buf, buf_len + 1);
  197. found = true;
  198. prop->name = dsi_parser_strim(out);
  199. DSI_DEBUG("RAW: %s: %s\n", prop->name, prop->raw);
  200. prop->len = 0;
  201. if (dsi_parser_get_strings(dev, prop, buf))
  202. goto end;
  203. prop->items = devm_kzalloc(dev, strlen(buf) * 2, GFP_KERNEL);
  204. if (!prop->items)
  205. goto end;
  206. if (dsi_parser_get_tuples(dev, prop, buf)) {
  207. prop->value = devm_kzalloc(dev, prop->len, GFP_KERNEL);
  208. if (prop->value) {
  209. prop->type = DSI_PROP_TYPE_INT_SET_ARRAY;
  210. dsi_parser_get_int_value(prop, 0);
  211. }
  212. goto end;
  213. }
  214. prop->value = dsi_parser_get_data("<", ">", buf);
  215. if (prop->value) {
  216. if (dsi_parser_get_tuples_data(prop, prop->value)) {
  217. prop->value = devm_kzalloc(dev, prop->len, GFP_KERNEL);
  218. if (prop->value) {
  219. prop->type = DSI_PROP_TYPE_INT_SET;
  220. dsi_parser_get_int_value(prop, 0);
  221. }
  222. goto end;
  223. } else {
  224. prop->items[prop->len++] = prop->value;
  225. }
  226. goto end;
  227. }
  228. prop->value = dsi_parser_get_data("[", "]", buf);
  229. if (prop->value) {
  230. char *out5;
  231. if (!prop->items)
  232. goto end;
  233. out5 = prop->value;
  234. while (out5 && strlen(out5)) {
  235. char *out6 = strsep(&out5, " ");
  236. out6 = dsi_parser_strim(out6);
  237. if (out6 && strlen(out6))
  238. prop->items[prop->len++] = out6;
  239. }
  240. prop->value = devm_kzalloc(dev, prop->len, GFP_KERNEL);
  241. if (prop->value) {
  242. prop->type = DSI_PROP_TYPE_INT_ARRAY;
  243. dsi_parser_get_int_value(prop, 16);
  244. }
  245. } else {
  246. found = false;
  247. }
  248. end:
  249. return found;
  250. }
  251. static char *dsi_parser_clean_name(char *name)
  252. {
  253. char *clean_name = name;
  254. if (!name) {
  255. DSI_ERR("Invalid input\n");
  256. return NULL;
  257. }
  258. while (name)
  259. clean_name = strsep(&name, ";");
  260. return dsi_parser_strim(clean_name);
  261. }
  262. static char *dsi_parser_get_blob(char **buf, bool *has_child)
  263. {
  264. char *data = NULL;
  265. char *start = *buf;
  266. data = strpbrk(*buf, "{}");
  267. if (!data)
  268. goto end;
  269. if (*data == '{')
  270. *has_child = true;
  271. if (*has_child) {
  272. while (data != *buf) {
  273. data--;
  274. if (*data == ';') {
  275. data++;
  276. *data = '\0';
  277. *buf = data + 1;
  278. break;
  279. }
  280. }
  281. } else {
  282. *data = '\0';
  283. *buf = data + 1;
  284. }
  285. end:
  286. return start;
  287. }
  288. static struct dsi_parser_node *dsi_parser_find_nodes(struct device *dev,
  289. char **buf)
  290. {
  291. struct dsi_parser_node *node = NULL, *cnode = NULL;
  292. char *name, *data;
  293. bool has_child = false;
  294. if (!buf || !*buf)
  295. goto end;
  296. data = strpbrk(*buf, "{}");
  297. if (!data) {
  298. DSI_DEBUG("{} not found\n");
  299. goto end;
  300. }
  301. if (*data == '}') {
  302. *buf = data + 1;
  303. goto end;
  304. }
  305. name = strsep(buf, "{");
  306. if (*buf && name) {
  307. node = devm_kzalloc(dev, sizeof(*node), GFP_KERNEL);
  308. if (!node)
  309. goto end;
  310. node->name = dsi_parser_clean_name(name);
  311. node->data = dsi_parser_get_blob(buf, &has_child);
  312. if (!has_child)
  313. goto end;
  314. do {
  315. cnode = dsi_parser_find_nodes(dev, buf);
  316. if (cnode &&
  317. (node->children_count < DSI_PARSER_MAX_NODES))
  318. node->child[node->children_count++] = cnode;
  319. } while (cnode);
  320. }
  321. end:
  322. return node;
  323. }
  324. static void dsi_parser_count_properties(struct dsi_parser_node *node)
  325. {
  326. int count;
  327. if (node && strlen(node->data)) {
  328. node->prop_count = dsi_parser_count(node->data, ';');
  329. for (count = 0; count < node->children_count; count++)
  330. dsi_parser_count_properties(node->child[count]);
  331. }
  332. }
  333. static void dsi_parser_get_properties(struct device *dev,
  334. struct dsi_parser_node *node)
  335. {
  336. int count;
  337. if (!node)
  338. return;
  339. if (node->prop_count) {
  340. int i = 0;
  341. char *buf = node->data;
  342. node->prop = devm_kcalloc(dev, node->prop_count,
  343. sizeof(struct dsi_parser_prop),
  344. GFP_KERNEL);
  345. if (!node->prop)
  346. return;
  347. for (i = 0; i < node->prop_count; i++) {
  348. char *out = strsep(&buf, ";");
  349. struct dsi_parser_prop *prop = &node->prop[i];
  350. if (!out || !prop)
  351. continue;
  352. if (!dsi_parser_parse_prop(dev, prop, out)) {
  353. char *out1 = strsep(&out, "}");
  354. if (!out1)
  355. continue;
  356. out1 = dsi_parser_strim(out1);
  357. if (!out && strlen(out1)) {
  358. prop->name = out1;
  359. prop->value = "1";
  360. }
  361. }
  362. }
  363. }
  364. for (count = 0; count < node->children_count; count++)
  365. dsi_parser_get_properties(dev, node->child[count]);
  366. }
  367. static struct dsi_parser_prop *dsi_parser_search_property(
  368. struct dsi_parser_node *node,
  369. const char *name)
  370. {
  371. int i = 0;
  372. struct dsi_parser_prop *prop = node->prop;
  373. for (i = 0; i < node->prop_count; i++) {
  374. if (prop[i].name && !strcmp(prop[i].name, name))
  375. return &prop[i];
  376. }
  377. return NULL;
  378. }
  379. /* APIs for the clients */
  380. struct property *dsi_parser_find_property(const struct device_node *np,
  381. const char *name,
  382. int *lenp)
  383. {
  384. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  385. struct dsi_parser_prop *prop = NULL;
  386. if (!node || !name || !lenp)
  387. goto end;
  388. prop = dsi_parser_search_property(node, name);
  389. if (!prop) {
  390. DSI_DEBUG("%s not found\n", name);
  391. goto end;
  392. }
  393. if (lenp) {
  394. if (prop->type == DSI_PROP_TYPE_INT_ARRAY)
  395. *lenp = prop->len;
  396. else if (prop->type == DSI_PROP_TYPE_INT_SET_ARRAY ||
  397. prop->type == DSI_PROP_TYPE_INT_SET)
  398. *lenp = prop->len * sizeof(u32);
  399. else
  400. *lenp = strlen(prop->raw) + 1;
  401. DSI_DEBUG("%s len=%d\n", name, *lenp);
  402. }
  403. end:
  404. return (struct property *)prop;
  405. }
  406. bool dsi_parser_read_bool(const struct device_node *np,
  407. const char *propname)
  408. {
  409. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  410. bool prop_set;
  411. prop_set = dsi_parser_search_property(node, propname) ? true : false;
  412. DSI_DEBUG("%s=%s\n", propname, prop_set ? "set" : "not set");
  413. return prop_set;
  414. }
  415. int dsi_parser_read_string(const struct device_node *np,
  416. const char *propname, const char **out_string)
  417. {
  418. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  419. struct dsi_parser_prop *prop;
  420. char *property = NULL;
  421. int rc = 0;
  422. prop = dsi_parser_search_property(node, propname);
  423. if (!prop) {
  424. DSI_DEBUG("%s not found\n", propname);
  425. rc = -EINVAL;
  426. } else {
  427. property = prop->value;
  428. }
  429. *out_string = property;
  430. DSI_DEBUG("%s=%s\n", propname, *out_string);
  431. return rc;
  432. }
  433. int dsi_parser_read_u64(const struct device_node *np, const char *propname,
  434. u64 *out_value)
  435. {
  436. return -EINVAL;
  437. }
  438. int dsi_parser_read_u32(const struct device_node *np,
  439. const char *propname, u32 *out_value)
  440. {
  441. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  442. struct dsi_parser_prop *prop;
  443. char *property, *to_int, item[SZ_128];
  444. int rc = 0, base;
  445. prop = dsi_parser_search_property(node, propname);
  446. if (!prop) {
  447. DSI_DEBUG("%s not found\n", propname);
  448. rc = -EINVAL;
  449. goto end;
  450. }
  451. if (!prop->value)
  452. goto end;
  453. strlcpy(item, prop->value, SZ_128);
  454. property = item;
  455. to_int = strsep(&property, "x");
  456. if (!property) {
  457. property = to_int;
  458. base = 10;
  459. } else {
  460. base = 16;
  461. }
  462. rc = kstrtoint(property, base, out_value);
  463. if (rc) {
  464. DSI_ERR("prop=%s error(%d) converting %s, base=%d\n",
  465. propname, rc, property, base);
  466. goto end;
  467. }
  468. DSI_DEBUG("%s=%d\n", propname, *out_value);
  469. end:
  470. return rc;
  471. }
  472. int dsi_parser_read_u32_index(const struct device_node *np,
  473. const char *propname, u32 index, u32 *out_value)
  474. {
  475. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  476. struct dsi_parser_prop *prop;
  477. char *property, *to_int, item[SZ_128];
  478. int rc = 0, base;
  479. prop = dsi_parser_search_property(node, propname);
  480. if (!prop) {
  481. DSI_DEBUG("%s not found\n", propname);
  482. rc = -EINVAL;
  483. goto end;
  484. }
  485. if (index >= prop->len) {
  486. rc = -EINVAL;
  487. goto end;
  488. }
  489. strlcpy(item, prop->items[index], SZ_128);
  490. property = item;
  491. to_int = strsep(&property, "x");
  492. if (!property) {
  493. property = to_int;
  494. base = 10;
  495. } else {
  496. base = 16;
  497. }
  498. rc = kstrtoint(property, base, out_value);
  499. if (rc) {
  500. DSI_ERR("prop=%s error(%d) converting %s, base=%d\n",
  501. propname, rc, property, base);
  502. goto end;
  503. }
  504. DSI_DEBUG("%s=%d\n", propname, *out_value);
  505. end:
  506. return rc;
  507. }
  508. int dsi_parser_read_u32_array(const struct device_node *np,
  509. const char *propname,
  510. u32 *out_values, size_t sz)
  511. {
  512. int i, rc = 0;
  513. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  514. struct dsi_parser_prop *prop;
  515. prop = dsi_parser_search_property(node, propname);
  516. if (!prop) {
  517. DSI_DEBUG("%s not found\n", propname);
  518. rc = -EINVAL;
  519. goto end;
  520. }
  521. for (i = 0; i < prop->len; i++) {
  522. int base, val;
  523. char item[SZ_128];
  524. char *to_int, *tmp;
  525. strlcpy(item, prop->items[i], SZ_128);
  526. tmp = item;
  527. to_int = strsep(&tmp, "x");
  528. if (!tmp) {
  529. tmp = to_int;
  530. base = 10;
  531. } else {
  532. base = 16;
  533. }
  534. rc = kstrtoint(tmp, base, &val);
  535. if (rc) {
  536. DSI_ERR("prop=%s error(%d) converting %s(%d), base=%d\n",
  537. propname, rc, tmp, i, base);
  538. continue;
  539. }
  540. *out_values++ = val;
  541. DSI_DEBUG("%s: [%d]=%d\n", propname, i, *(out_values - 1));
  542. }
  543. end:
  544. return rc;
  545. }
  546. const void *dsi_parser_get_property(const struct device_node *np,
  547. const char *name, int *lenp)
  548. {
  549. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  550. struct dsi_parser_prop *prop;
  551. char *property = NULL;
  552. prop = dsi_parser_search_property(node, name);
  553. if (!prop) {
  554. DSI_DEBUG("%s not found\n", name);
  555. goto end;
  556. }
  557. property = prop->value;
  558. if (prop->type == DSI_PROP_TYPE_STR)
  559. DSI_DEBUG("%s=%s\n", name, property);
  560. if (lenp) {
  561. if (prop->type == DSI_PROP_TYPE_INT_ARRAY)
  562. *lenp = prop->len;
  563. else if (prop->type == DSI_PROP_TYPE_INT_SET_ARRAY ||
  564. prop->type == DSI_PROP_TYPE_INT_SET)
  565. *lenp = prop->len * sizeof(u32);
  566. else
  567. *lenp = strlen(prop->raw) + 1;
  568. DSI_DEBUG("%s len=%d\n", name, *lenp);
  569. }
  570. end:
  571. return property;
  572. }
  573. struct device_node *dsi_parser_get_child_by_name(const struct device_node *np,
  574. const char *name)
  575. {
  576. int index = 0;
  577. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  578. struct dsi_parser_node *matched_node = NULL;
  579. if (!node || !node->children_count)
  580. goto end;
  581. do {
  582. struct dsi_parser_node *child_node = node->child[index++];
  583. if (!child_node)
  584. goto end;
  585. if (!strcmp(child_node->name, name)) {
  586. matched_node = child_node;
  587. break;
  588. }
  589. } while (index < node->children_count);
  590. end:
  591. DSI_DEBUG("%s: %s\n", name, matched_node ? "found" : "not found");
  592. return (struct device_node *)matched_node;
  593. }
  594. struct dsi_parser_node *dsi_parser_get_node_by_name(
  595. struct dsi_parser_node *node,
  596. char *name)
  597. {
  598. int count = 0;
  599. struct dsi_parser_node *matched_node = NULL;
  600. if (!node) {
  601. DSI_ERR("node is null\n");
  602. goto end;
  603. }
  604. if (!strcmp(node->name, name)) {
  605. matched_node = node;
  606. goto end;
  607. }
  608. for (count = 0; count < node->children_count; count++) {
  609. matched_node = dsi_parser_get_node_by_name(
  610. node->child[count], name);
  611. if (matched_node)
  612. break;
  613. }
  614. end:
  615. DSI_DEBUG("%s: %s\n", name, matched_node ? "found" : "not found");
  616. return matched_node;
  617. }
  618. int dsi_parser_get_child_count(const struct device_node *np)
  619. {
  620. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  621. int count = 0;
  622. if (node) {
  623. count = node->children_count;
  624. DSI_DEBUG("node %s child count=%d\n", node->name, count);
  625. }
  626. return count;
  627. }
  628. struct device_node *dsi_parser_get_next_child(const struct device_node *np,
  629. struct device_node *prev)
  630. {
  631. int index = 0;
  632. struct dsi_parser_node *parent = (struct dsi_parser_node *)np;
  633. struct dsi_parser_node *prev_child = (struct dsi_parser_node *)prev;
  634. struct dsi_parser_node *matched_node = NULL;
  635. if (!parent || !parent->children_count)
  636. goto end;
  637. do {
  638. struct dsi_parser_node *child_node = parent->child[index++];
  639. if (!child_node)
  640. goto end;
  641. if (!prev) {
  642. matched_node = child_node;
  643. goto end;
  644. }
  645. if (!strcmp(child_node->name, prev_child->name)) {
  646. if (index < parent->children_count)
  647. matched_node = parent->child[index];
  648. break;
  649. }
  650. } while (index < parent->children_count);
  651. end:
  652. if (matched_node)
  653. DSI_DEBUG("next child: %s\n", matched_node->name);
  654. return (struct device_node *)matched_node;
  655. }
  656. int dsi_parser_count_u32_elems(const struct device_node *np,
  657. const char *propname)
  658. {
  659. int count = 0;
  660. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  661. struct dsi_parser_prop *prop;
  662. prop = dsi_parser_search_property(node, propname);
  663. if (!prop) {
  664. DSI_DEBUG("%s not found\n", propname);
  665. goto end;
  666. }
  667. count = prop->len;
  668. DSI_DEBUG("prop %s has %d items\n", prop->name, count);
  669. end:
  670. return count;
  671. }
  672. int dsi_parser_count_strings(const struct device_node *np,
  673. const char *propname)
  674. {
  675. int count = 0;
  676. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  677. struct dsi_parser_prop *prop;
  678. prop = dsi_parser_search_property(node, propname);
  679. if (!prop) {
  680. DSI_DEBUG("%s not found\n", propname);
  681. goto end;
  682. }
  683. if (prop->type == DSI_PROP_TYPE_STR_ARRAY)
  684. count = prop->len;
  685. else if (prop->type == DSI_PROP_TYPE_STR)
  686. count = 1;
  687. DSI_DEBUG("prop %s has %d items\n", prop->name, count);
  688. end:
  689. return count;
  690. }
  691. int dsi_parser_read_string_index(const struct device_node *np,
  692. const char *propname,
  693. int index, const char **output)
  694. {
  695. struct dsi_parser_node *node = (struct dsi_parser_node *)np;
  696. struct dsi_parser_prop *prop;
  697. prop = dsi_parser_search_property(node, propname);
  698. if (!prop) {
  699. DSI_DEBUG("%s not found\n", propname);
  700. goto end;
  701. }
  702. if (prop->type != DSI_PROP_TYPE_STR_ARRAY) {
  703. DSI_ERR("not a string array property\n");
  704. goto end;
  705. }
  706. if (index >= prop->len) {
  707. DSI_ERR("out of bond index %d\n", index);
  708. goto end;
  709. }
  710. *output = prop->items[index];
  711. return 0;
  712. end:
  713. return -EINVAL;
  714. }
  715. int dsi_parser_get_named_gpio(struct device_node *np,
  716. const char *propname, int index)
  717. {
  718. int gpio = -EINVAL;
  719. dsi_parser_read_u32(np, propname, &gpio);
  720. return gpio;
  721. }
  722. void *dsi_parser_get_head_node(void *in,
  723. const u8 *data, u32 size)
  724. {
  725. struct dsi_parser *parser = in;
  726. char *buf;
  727. if (!parser || !data || !size) {
  728. DSI_ERR("invalid input\n");
  729. goto err;
  730. }
  731. parser->buf = devm_kzalloc(parser->dev, size, GFP_KERNEL);
  732. if (!parser->buf)
  733. goto err;
  734. buf = parser->buf;
  735. memcpy(buf, data, size);
  736. strreplace(buf, '\n', ' ');
  737. strreplace(buf, '\t', '*');
  738. parser->head_node = dsi_parser_find_nodes(parser->dev, &buf);
  739. if (!parser->head_node) {
  740. DSI_ERR("could not get head node\n");
  741. devm_kfree(parser->dev, parser->buf);
  742. goto err;
  743. }
  744. dsi_parser_count_properties(parser->head_node);
  745. dsi_parser_get_properties(parser->dev, parser->head_node);
  746. parser->current_node = parser->head_node;
  747. return parser->head_node;
  748. err:
  749. return NULL;
  750. }
  751. static int dsi_parser_read_file(struct dsi_parser *parser,
  752. const u8 **buf, u32 *size)
  753. {
  754. int rc = 0;
  755. release_firmware(parser->fw);
  756. rc = request_firmware(&parser->fw, parser->file_name, parser->dev);
  757. if (rc || !parser->fw) {
  758. DSI_ERR("couldn't read firmware\n");
  759. goto end;
  760. }
  761. *buf = parser->fw->data;
  762. *size = parser->fw->size;
  763. DSI_DEBUG("file %s: size %zd\n",
  764. parser->file_name, parser->fw->size);
  765. end:
  766. return rc;
  767. }
  768. static void dsi_parser_free_mem(struct device *dev,
  769. struct dsi_parser_node *node)
  770. {
  771. int i = 0;
  772. if (!node)
  773. return;
  774. DSI_DEBUG("node=%s, prop_count=%d\n", node->name, node->prop_count);
  775. for (i = 0; i < node->prop_count; i++) {
  776. struct dsi_parser_prop *prop = &node->prop[i];
  777. if (!prop)
  778. continue;
  779. DSI_DEBUG("deleting prop=%s\n", prop->name);
  780. if (prop->items)
  781. devm_kfree(dev, prop->items);
  782. if (prop->raw)
  783. devm_kfree(dev, prop->raw);
  784. if ((prop->type == DSI_PROP_TYPE_INT_SET_ARRAY ||
  785. prop->type == DSI_PROP_TYPE_INT_SET ||
  786. prop->type == DSI_PROP_TYPE_INT_ARRAY) && prop->value)
  787. devm_kfree(dev, prop->value);
  788. }
  789. if (node->prop)
  790. devm_kfree(dev, node->prop);
  791. for (i = 0; i < node->children_count; i++)
  792. dsi_parser_free_mem(dev, node->child[i]);
  793. devm_kfree(dev, node);
  794. }
  795. static ssize_t dsi_parser_write_init(struct file *file,
  796. const char __user *user_buff, size_t count, loff_t *ppos)
  797. {
  798. struct dsi_parser *parser = file->private_data;
  799. const u8 *data = NULL;
  800. u32 size = 0;
  801. char buf[SZ_32];
  802. size_t len = 0;
  803. if (!parser)
  804. return -ENODEV;
  805. if (*ppos)
  806. return 0;
  807. /* Leave room for termination char */
  808. len = min_t(size_t, count, SZ_32 - 1);
  809. if (copy_from_user(buf, user_buff, len))
  810. goto end;
  811. buf[len] = '\0';
  812. if (sscanf(buf, "%31s", parser->file_name) != 1) {
  813. DSI_ERR("failed to get val\n");
  814. goto end;
  815. }
  816. if (dsi_parser_read_file(parser, &data, &size)) {
  817. DSI_ERR("failed to read file\n");
  818. goto end;
  819. }
  820. dsi_parser_free_mem(parser->dev, parser->head_node);
  821. if (parser->buf) {
  822. devm_kfree(parser->dev, parser->buf);
  823. parser->buf = NULL;
  824. }
  825. parser->head_node = dsi_parser_get_head_node(parser, data, size);
  826. if (!parser->head_node) {
  827. DSI_ERR("failed to parse data\n");
  828. goto end;
  829. }
  830. end:
  831. return len;
  832. }
  833. static ssize_t dsi_parser_read_node(struct file *file,
  834. char __user *user_buff, size_t count, loff_t *ppos)
  835. {
  836. char *buf = NULL;
  837. int i, j, len = 0, max_size = SZ_4K;
  838. struct dsi_parser *parser = file->private_data;
  839. struct dsi_parser_node *node;
  840. struct dsi_parser_prop *prop;
  841. if (!parser)
  842. return -ENODEV;
  843. if (*ppos)
  844. return len;
  845. buf = kzalloc(SZ_4K, GFP_KERNEL);
  846. if (!buf)
  847. return -ENOMEM;
  848. node = parser->current_node;
  849. if (!node) {
  850. len = -EINVAL;
  851. goto error;
  852. }
  853. prop = node->prop;
  854. len += scnprintf(buf + len, max_size - len, "node name=%s\n",
  855. node->name);
  856. if (len == max_size)
  857. goto buffer_overflow;
  858. len += scnprintf(buf + len, max_size - len, "children count=%d\n",
  859. node->children_count);
  860. if (len == max_size)
  861. goto buffer_overflow;
  862. for (i = 0; i < node->children_count; i++) {
  863. len += scnprintf(buf + len, max_size - len, "child[%d]=%s\n",
  864. i, node->child[i]->name);
  865. if (len == max_size)
  866. goto buffer_overflow;
  867. }
  868. for (i = 0; i < node->prop_count; i++) {
  869. if (!prop[i].name)
  870. continue;
  871. len += scnprintf(buf + len, max_size - len,
  872. "property=%s\n", prop[i].name);
  873. if (len == max_size)
  874. goto buffer_overflow;
  875. if (prop[i].value) {
  876. if (prop[i].type == DSI_PROP_TYPE_STR) {
  877. len += scnprintf(buf + len, max_size - len,
  878. "value=%s\n", prop[i].value);
  879. if (len == max_size)
  880. goto buffer_overflow;
  881. } else {
  882. for (j = 0; j < prop[i].len; j++) {
  883. len += scnprintf(buf + len,
  884. max_size - len,
  885. "%x", prop[i].value[j]);
  886. if (len == max_size)
  887. goto buffer_overflow;
  888. }
  889. len += scnprintf(buf + len, max_size - len,
  890. "\n");
  891. if (len == max_size)
  892. goto buffer_overflow;
  893. }
  894. }
  895. if (prop[i].len) {
  896. len += scnprintf(buf + len, max_size - len, "items:\n");
  897. if (len == max_size)
  898. goto buffer_overflow;
  899. }
  900. for (j = 0; j < prop[i].len; j++) {
  901. char delim;
  902. if (j && !(j % 10))
  903. delim = '\n';
  904. else
  905. delim = ' ';
  906. len += scnprintf(buf + len, max_size - len, "%s%c",
  907. prop[i].items[j], delim);
  908. if (len == max_size)
  909. goto buffer_overflow;
  910. }
  911. len += scnprintf(buf + len, max_size - len, "\n\n");
  912. if (len == max_size)
  913. goto buffer_overflow;
  914. }
  915. buffer_overflow:
  916. if (simple_read_from_buffer(user_buff, count, ppos, buf, len)) {
  917. len = -EFAULT;
  918. goto error;
  919. }
  920. error:
  921. kfree(buf);
  922. return len;
  923. }
  924. static ssize_t dsi_parser_write_node(struct file *file,
  925. const char __user *user_buff, size_t count, loff_t *ppos)
  926. {
  927. struct dsi_parser *parser = file->private_data;
  928. char buf[SZ_512];
  929. size_t len = 0;
  930. if (!parser)
  931. return -ENODEV;
  932. if (*ppos)
  933. return 0;
  934. /* Leave room for termination char */
  935. len = min_t(size_t, count, SZ_512 - 1);
  936. if (copy_from_user(buf, user_buff, len))
  937. goto end;
  938. buf[len] = '\0';
  939. strreplace(buf, '\n', ' ');
  940. if (!strcmp(strim(buf), "head_node"))
  941. parser->current_node = parser->head_node;
  942. else
  943. parser->current_node = dsi_parser_get_node_by_name(
  944. parser->head_node, strim(buf));
  945. end:
  946. return len;
  947. }
  948. static const struct file_operations dsi_parser_init_fops = {
  949. .open = simple_open,
  950. .write = dsi_parser_write_init,
  951. };
  952. static const struct file_operations dsi_parser_node_fops = {
  953. .open = simple_open,
  954. .read = dsi_parser_read_node,
  955. .write = dsi_parser_write_node,
  956. };
  957. int dsi_parser_dbg_init(void *parser, struct dentry *parent_dir)
  958. {
  959. int rc = 0;
  960. struct dentry *dir, *file;
  961. if (!parser || !parent_dir) {
  962. DSI_ERR("invalid input\n");
  963. goto end;
  964. }
  965. dir = debugfs_create_dir("parser", parent_dir);
  966. if (IS_ERR_OR_NULL(dir)) {
  967. rc = PTR_ERR(dir);
  968. DSI_ERR("failed to create parser debugfs\n");
  969. goto end;
  970. }
  971. file = debugfs_create_file("init", 0644, dir,
  972. parser, &dsi_parser_init_fops);
  973. if (IS_ERR_OR_NULL(file)) {
  974. rc = PTR_ERR(file);
  975. DSI_ERR("failed to create init debugfs\n");
  976. goto dbg;
  977. }
  978. file = debugfs_create_file("node", 0644, dir,
  979. parser, &dsi_parser_node_fops);
  980. if (IS_ERR_OR_NULL(file)) {
  981. rc = PTR_ERR(file);
  982. DSI_ERR("failed to create init debugfs\n");
  983. goto dbg;
  984. }
  985. DSI_DEBUG("success\n");
  986. return 0;
  987. dbg:
  988. debugfs_remove_recursive(dir);
  989. end:
  990. return rc;
  991. }
  992. void *dsi_parser_get(struct device *dev)
  993. {
  994. int rc = 0;
  995. struct dsi_parser *parser = NULL;
  996. if (!dev) {
  997. DSI_ERR("invalid data\n");
  998. rc = -EINVAL;
  999. goto end;
  1000. }
  1001. parser = devm_kzalloc(dev, sizeof(*parser), GFP_KERNEL);
  1002. if (!parser) {
  1003. rc = -ENOMEM;
  1004. goto end;
  1005. }
  1006. parser->dev = dev;
  1007. strlcpy(parser->file_name, "dsi_prop", sizeof(parser->file_name));
  1008. return parser;
  1009. end:
  1010. return ERR_PTR(rc);
  1011. }
  1012. void dsi_parser_put(void *data)
  1013. {
  1014. struct dsi_parser *parser = data;
  1015. if (!parser)
  1016. return;
  1017. dsi_parser_free_mem(parser->dev, parser->head_node);
  1018. devm_kfree(parser->dev, parser->buf);
  1019. devm_kfree(parser->dev, parser);
  1020. }