dsi_parser.c 24 KB

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