ofnode.c 37 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * Copyright (c) 2017 Google, Inc
  4. * Written by Simon Glass <sjg@chromium.org>
  5. */
  6. #define LOG_CATEGORY LOGC_DT
  7. #include <common.h>
  8. #include <dm.h>
  9. #include <fdtdec.h>
  10. #include <fdt_support.h>
  11. #include <log.h>
  12. #include <malloc.h>
  13. #include <of_live.h>
  14. #include <linux/libfdt.h>
  15. #include <dm/of_access.h>
  16. #include <dm/of_addr.h>
  17. #include <dm/ofnode.h>
  18. #include <linux/err.h>
  19. #include <linux/ioport.h>
  20. #include <asm/global_data.h>
  21. DECLARE_GLOBAL_DATA_PTR;
  22. #if CONFIG_IS_ENABLED(OFNODE_MULTI_TREE)
  23. static void *oftree_list[CONFIG_OFNODE_MULTI_TREE_MAX];
  24. static int oftree_count;
  25. void oftree_reset(void)
  26. {
  27. if (gd->flags & GD_FLG_RELOC) {
  28. oftree_count = 0;
  29. oftree_list[oftree_count++] = (void *)gd->fdt_blob;
  30. }
  31. }
  32. static int oftree_find(const void *fdt)
  33. {
  34. int i;
  35. for (i = 0; i < oftree_count; i++) {
  36. if (fdt == oftree_list[i])
  37. return i;
  38. }
  39. return -1;
  40. }
  41. static oftree oftree_ensure(void *fdt)
  42. {
  43. oftree tree;
  44. int i;
  45. if (of_live_active()) {
  46. struct device_node *root;
  47. int ret;
  48. ret = unflatten_device_tree(fdt, &root);
  49. if (ret) {
  50. log_err("Failed to create live tree: err=%d\n", ret);
  51. return oftree_null();
  52. }
  53. tree = oftree_from_np(root);
  54. return tree;
  55. }
  56. if (gd->flags & GD_FLG_RELOC) {
  57. i = oftree_find(fdt);
  58. if (i == -1) {
  59. if (oftree_count == CONFIG_OFNODE_MULTI_TREE_MAX) {
  60. log_warning("Too many registered device trees (max %d)\n",
  61. CONFIG_OFNODE_MULTI_TREE_MAX);
  62. return oftree_null();
  63. }
  64. /* register the new tree */
  65. i = oftree_count++;
  66. oftree_list[i] = fdt;
  67. log_debug("oftree: registered tree %d: %p\n", i, fdt);
  68. }
  69. } else {
  70. if (fdt != gd->fdt_blob) {
  71. log_debug("Only the control FDT can be accessed before relocation\n");
  72. return oftree_null();
  73. }
  74. }
  75. tree.fdt = fdt;
  76. return tree;
  77. }
  78. void oftree_dispose(oftree tree)
  79. {
  80. if (of_live_active())
  81. of_live_free(tree.np);
  82. }
  83. void *ofnode_lookup_fdt(ofnode node)
  84. {
  85. if (gd->flags & GD_FLG_RELOC) {
  86. uint i = OFTREE_TREE_ID(node.of_offset);
  87. if (i > oftree_count) {
  88. log_debug("Invalid tree ID %x\n", i);
  89. return NULL;
  90. }
  91. return oftree_list[i];
  92. } else {
  93. return (void *)gd->fdt_blob;
  94. }
  95. }
  96. void *ofnode_to_fdt(ofnode node)
  97. {
  98. #ifdef OF_CHECKS
  99. if (of_live_active())
  100. return NULL;
  101. #endif
  102. if (CONFIG_IS_ENABLED(OFNODE_MULTI_TREE) && ofnode_valid(node))
  103. return ofnode_lookup_fdt(node);
  104. /* Use the control FDT by default */
  105. return (void *)gd->fdt_blob;
  106. }
  107. /**
  108. * ofnode_to_offset() - convert an ofnode to a flat DT offset
  109. *
  110. * This cannot be called if the reference contains a node pointer.
  111. *
  112. * @node: Reference containing offset (possibly invalid)
  113. * Return: DT offset (can be -1)
  114. */
  115. int ofnode_to_offset(ofnode node)
  116. {
  117. #ifdef OF_CHECKS
  118. if (of_live_active())
  119. return -1;
  120. #endif
  121. if (CONFIG_IS_ENABLED(OFNODE_MULTI_TREE) && node.of_offset >= 0)
  122. return OFTREE_OFFSET(node.of_offset);
  123. return node.of_offset;
  124. }
  125. oftree oftree_from_fdt(void *fdt)
  126. {
  127. oftree tree;
  128. if (CONFIG_IS_ENABLED(OFNODE_MULTI_TREE))
  129. return oftree_ensure(fdt);
  130. #ifdef OF_CHECKS
  131. if (of_live_active())
  132. return oftree_null();
  133. #endif
  134. tree.fdt = fdt;
  135. return tree;
  136. }
  137. /**
  138. * noffset_to_ofnode() - convert a DT offset to an ofnode
  139. *
  140. * @other_node: Node in the same tree to use as a reference
  141. * @of_offset: DT offset (either valid, or -1)
  142. * Return: reference to the associated DT offset
  143. */
  144. ofnode noffset_to_ofnode(ofnode other_node, int of_offset)
  145. {
  146. ofnode node;
  147. if (of_live_active())
  148. node.np = NULL;
  149. else if (!CONFIG_IS_ENABLED(OFNODE_MULTI_TREE) || of_offset < 0 ||
  150. !ofnode_valid(other_node))
  151. node.of_offset = of_offset;
  152. else
  153. node.of_offset = OFTREE_MAKE_NODE(other_node.of_offset,
  154. of_offset);
  155. return node;
  156. }
  157. #else /* !OFNODE_MULTI_TREE */
  158. static inline int oftree_find(const void *fdt)
  159. {
  160. return 0;
  161. }
  162. #endif /* OFNODE_MULTI_TREE */
  163. /**
  164. * ofnode_from_tree_offset() - get an ofnode from a tree offset (flat tree)
  165. *
  166. * Looks up the tree and returns an ofnode with the correct of_offset (i.e.
  167. * containing the tree ID).
  168. *
  169. * If @offset is < 0 then this returns an ofnode with that offset and no tree
  170. * ID.
  171. *
  172. * @tree: tree to check
  173. * @offset: offset within that tree (can be < 0)
  174. * @return node for that offset, with the correct ID
  175. */
  176. static ofnode ofnode_from_tree_offset(oftree tree, int offset)
  177. {
  178. ofnode node;
  179. if (CONFIG_IS_ENABLED(OFNODE_MULTI_TREE) && offset >= 0) {
  180. int tree_id = oftree_find(tree.fdt);
  181. if (tree_id == -1)
  182. return ofnode_null();
  183. node.of_offset = OFTREE_NODE(tree_id, offset);
  184. } else {
  185. node.of_offset = offset;
  186. }
  187. return node;
  188. }
  189. bool ofnode_name_eq(ofnode node, const char *name)
  190. {
  191. const char *node_name;
  192. size_t len;
  193. assert(ofnode_valid(node));
  194. node_name = ofnode_get_name(node);
  195. len = strchrnul(node_name, '@') - node_name;
  196. return (strlen(name) == len) && !strncmp(node_name, name, len);
  197. }
  198. int ofnode_read_u8(ofnode node, const char *propname, u8 *outp)
  199. {
  200. const u8 *cell;
  201. int len;
  202. assert(ofnode_valid(node));
  203. debug("%s: %s: ", __func__, propname);
  204. if (ofnode_is_np(node))
  205. return of_read_u8(ofnode_to_np(node), propname, outp);
  206. cell = fdt_getprop(gd->fdt_blob, ofnode_to_offset(node), propname,
  207. &len);
  208. if (!cell || len < sizeof(*cell)) {
  209. debug("(not found)\n");
  210. return -EINVAL;
  211. }
  212. *outp = *cell;
  213. debug("%#x (%d)\n", *outp, *outp);
  214. return 0;
  215. }
  216. u8 ofnode_read_u8_default(ofnode node, const char *propname, u8 def)
  217. {
  218. assert(ofnode_valid(node));
  219. ofnode_read_u8(node, propname, &def);
  220. return def;
  221. }
  222. int ofnode_read_u16(ofnode node, const char *propname, u16 *outp)
  223. {
  224. const fdt16_t *cell;
  225. int len;
  226. assert(ofnode_valid(node));
  227. debug("%s: %s: ", __func__, propname);
  228. if (ofnode_is_np(node))
  229. return of_read_u16(ofnode_to_np(node), propname, outp);
  230. cell = fdt_getprop(gd->fdt_blob, ofnode_to_offset(node), propname,
  231. &len);
  232. if (!cell || len < sizeof(*cell)) {
  233. debug("(not found)\n");
  234. return -EINVAL;
  235. }
  236. *outp = be16_to_cpup(cell);
  237. debug("%#x (%d)\n", *outp, *outp);
  238. return 0;
  239. }
  240. u16 ofnode_read_u16_default(ofnode node, const char *propname, u16 def)
  241. {
  242. assert(ofnode_valid(node));
  243. ofnode_read_u16(node, propname, &def);
  244. return def;
  245. }
  246. int ofnode_read_u32(ofnode node, const char *propname, u32 *outp)
  247. {
  248. return ofnode_read_u32_index(node, propname, 0, outp);
  249. }
  250. u32 ofnode_read_u32_default(ofnode node, const char *propname, u32 def)
  251. {
  252. assert(ofnode_valid(node));
  253. ofnode_read_u32_index(node, propname, 0, &def);
  254. return def;
  255. }
  256. int ofnode_read_u32_index(ofnode node, const char *propname, int index,
  257. u32 *outp)
  258. {
  259. const fdt32_t *cell;
  260. int len;
  261. assert(ofnode_valid(node));
  262. debug("%s: %s: ", __func__, propname);
  263. if (ofnode_is_np(node))
  264. return of_read_u32_index(ofnode_to_np(node), propname, index,
  265. outp);
  266. cell = fdt_getprop(ofnode_to_fdt(node), ofnode_to_offset(node),
  267. propname, &len);
  268. if (!cell) {
  269. debug("(not found)\n");
  270. return -EINVAL;
  271. }
  272. if (len < (sizeof(int) * (index + 1))) {
  273. debug("(not large enough)\n");
  274. return -EOVERFLOW;
  275. }
  276. *outp = fdt32_to_cpu(cell[index]);
  277. debug("%#x (%d)\n", *outp, *outp);
  278. return 0;
  279. }
  280. u32 ofnode_read_u32_index_default(ofnode node, const char *propname, int index,
  281. u32 def)
  282. {
  283. assert(ofnode_valid(node));
  284. ofnode_read_u32_index(node, propname, index, &def);
  285. return def;
  286. }
  287. int ofnode_read_s32_default(ofnode node, const char *propname, s32 def)
  288. {
  289. assert(ofnode_valid(node));
  290. ofnode_read_u32(node, propname, (u32 *)&def);
  291. return def;
  292. }
  293. int ofnode_read_u64(ofnode node, const char *propname, u64 *outp)
  294. {
  295. const unaligned_fdt64_t *cell;
  296. int len;
  297. assert(ofnode_valid(node));
  298. debug("%s: %s: ", __func__, propname);
  299. if (ofnode_is_np(node))
  300. return of_read_u64(ofnode_to_np(node), propname, outp);
  301. cell = fdt_getprop(ofnode_to_fdt(node), ofnode_to_offset(node),
  302. propname, &len);
  303. if (!cell || len < sizeof(*cell)) {
  304. debug("(not found)\n");
  305. return -EINVAL;
  306. }
  307. *outp = fdt64_to_cpu(cell[0]);
  308. debug("%#llx (%lld)\n", (unsigned long long)*outp,
  309. (unsigned long long)*outp);
  310. return 0;
  311. }
  312. u64 ofnode_read_u64_default(ofnode node, const char *propname, u64 def)
  313. {
  314. assert(ofnode_valid(node));
  315. ofnode_read_u64(node, propname, &def);
  316. return def;
  317. }
  318. bool ofnode_read_bool(ofnode node, const char *propname)
  319. {
  320. const void *prop;
  321. assert(ofnode_valid(node));
  322. debug("%s: %s: ", __func__, propname);
  323. prop = ofnode_get_property(node, propname, NULL);
  324. debug("%s\n", prop ? "true" : "false");
  325. return prop ? true : false;
  326. }
  327. const void *ofnode_read_prop(ofnode node, const char *propname, int *sizep)
  328. {
  329. const char *val = NULL;
  330. int len;
  331. assert(ofnode_valid(node));
  332. debug("%s: %s: ", __func__, propname);
  333. if (ofnode_is_np(node)) {
  334. struct property *prop = of_find_property(
  335. ofnode_to_np(node), propname, &len);
  336. if (prop) {
  337. val = prop->value;
  338. len = prop->length;
  339. }
  340. } else {
  341. val = fdt_getprop(ofnode_to_fdt(node), ofnode_to_offset(node),
  342. propname, &len);
  343. }
  344. if (!val) {
  345. debug("<not found>\n");
  346. if (sizep)
  347. *sizep = -FDT_ERR_NOTFOUND;
  348. return NULL;
  349. }
  350. if (sizep)
  351. *sizep = len;
  352. return val;
  353. }
  354. const char *ofnode_read_string(ofnode node, const char *propname)
  355. {
  356. const char *str;
  357. int len;
  358. str = ofnode_read_prop(node, propname, &len);
  359. if (!str)
  360. return NULL;
  361. if (strnlen(str, len) >= len) {
  362. debug("<invalid>\n");
  363. return NULL;
  364. }
  365. debug("%s\n", str);
  366. return str;
  367. }
  368. int ofnode_read_size(ofnode node, const char *propname)
  369. {
  370. int len;
  371. if (!ofnode_read_prop(node, propname, &len))
  372. return -EINVAL;
  373. return len;
  374. }
  375. ofnode ofnode_find_subnode(ofnode node, const char *subnode_name)
  376. {
  377. ofnode subnode;
  378. assert(ofnode_valid(node));
  379. debug("%s: %s: ", __func__, subnode_name);
  380. if (ofnode_is_np(node)) {
  381. struct device_node *np = ofnode_to_np(node);
  382. for (np = np->child; np; np = np->sibling) {
  383. if (!strcmp(subnode_name, np->name))
  384. break;
  385. }
  386. subnode = np_to_ofnode(np);
  387. } else {
  388. int ooffset = fdt_subnode_offset(ofnode_to_fdt(node),
  389. ofnode_to_offset(node), subnode_name);
  390. subnode = noffset_to_ofnode(node, ooffset);
  391. }
  392. debug("%s\n", ofnode_valid(subnode) ?
  393. ofnode_get_name(subnode) : "<none>");
  394. return subnode;
  395. }
  396. int ofnode_read_u32_array(ofnode node, const char *propname,
  397. u32 *out_values, size_t sz)
  398. {
  399. assert(ofnode_valid(node));
  400. debug("%s: %s: ", __func__, propname);
  401. if (ofnode_is_np(node)) {
  402. return of_read_u32_array(ofnode_to_np(node), propname,
  403. out_values, sz);
  404. } else {
  405. int ret;
  406. ret = fdtdec_get_int_array(ofnode_to_fdt(node),
  407. ofnode_to_offset(node), propname,
  408. out_values, sz);
  409. /* get the error right, but space is more important in SPL */
  410. if (!IS_ENABLED(CONFIG_SPL_BUILD)) {
  411. if (ret == -FDT_ERR_NOTFOUND)
  412. return -EINVAL;
  413. else if (ret == -FDT_ERR_BADLAYOUT)
  414. return -EOVERFLOW;
  415. }
  416. return ret;
  417. }
  418. }
  419. #if !CONFIG_IS_ENABLED(DM_INLINE_OFNODE)
  420. bool ofnode_is_enabled(ofnode node)
  421. {
  422. if (ofnode_is_np(node)) {
  423. return of_device_is_available(ofnode_to_np(node));
  424. } else {
  425. return fdtdec_get_is_enabled(ofnode_to_fdt(node),
  426. ofnode_to_offset(node));
  427. }
  428. }
  429. ofnode ofnode_first_subnode(ofnode node)
  430. {
  431. assert(ofnode_valid(node));
  432. if (ofnode_is_np(node))
  433. return np_to_ofnode(node.np->child);
  434. return noffset_to_ofnode(node,
  435. fdt_first_subnode(ofnode_to_fdt(node), ofnode_to_offset(node)));
  436. }
  437. ofnode ofnode_next_subnode(ofnode node)
  438. {
  439. assert(ofnode_valid(node));
  440. if (ofnode_is_np(node))
  441. return np_to_ofnode(node.np->sibling);
  442. return noffset_to_ofnode(node,
  443. fdt_next_subnode(ofnode_to_fdt(node), ofnode_to_offset(node)));
  444. }
  445. #endif /* !DM_INLINE_OFNODE */
  446. ofnode ofnode_get_parent(ofnode node)
  447. {
  448. ofnode parent;
  449. assert(ofnode_valid(node));
  450. if (ofnode_is_np(node))
  451. parent = np_to_ofnode(of_get_parent(ofnode_to_np(node)));
  452. else
  453. parent.of_offset = fdt_parent_offset(ofnode_to_fdt(node),
  454. ofnode_to_offset(node));
  455. return parent;
  456. }
  457. const char *ofnode_get_name(ofnode node)
  458. {
  459. if (!ofnode_valid(node)) {
  460. debug("%s node not valid\n", __func__);
  461. return NULL;
  462. }
  463. if (ofnode_is_np(node))
  464. return node.np->name;
  465. return fdt_get_name(ofnode_to_fdt(node), ofnode_to_offset(node), NULL);
  466. }
  467. int ofnode_get_path(ofnode node, char *buf, int buflen)
  468. {
  469. assert(ofnode_valid(node));
  470. if (ofnode_is_np(node)) {
  471. if (strlen(node.np->full_name) >= buflen)
  472. return -ENOSPC;
  473. strcpy(buf, node.np->full_name);
  474. return 0;
  475. } else {
  476. int res;
  477. res = fdt_get_path(ofnode_to_fdt(node), ofnode_to_offset(node), buf,
  478. buflen);
  479. if (!res)
  480. return res;
  481. else if (res == -FDT_ERR_NOSPACE)
  482. return -ENOSPC;
  483. else
  484. return -EINVAL;
  485. }
  486. }
  487. ofnode ofnode_get_by_phandle(uint phandle)
  488. {
  489. ofnode node;
  490. if (of_live_active())
  491. node = np_to_ofnode(of_find_node_by_phandle(NULL, phandle));
  492. else
  493. node.of_offset = fdt_node_offset_by_phandle(gd->fdt_blob,
  494. phandle);
  495. return node;
  496. }
  497. ofnode oftree_get_by_phandle(oftree tree, uint phandle)
  498. {
  499. ofnode node;
  500. if (of_live_active())
  501. node = np_to_ofnode(of_find_node_by_phandle(tree.np, phandle));
  502. else
  503. node = ofnode_from_tree_offset(tree,
  504. fdt_node_offset_by_phandle(oftree_lookup_fdt(tree),
  505. phandle));
  506. return node;
  507. }
  508. static fdt_addr_t __ofnode_get_addr_size_index(ofnode node, int index,
  509. fdt_size_t *size, bool translate)
  510. {
  511. int na, ns;
  512. if (size)
  513. *size = FDT_SIZE_T_NONE;
  514. if (ofnode_is_np(node)) {
  515. const __be32 *prop_val;
  516. u64 size64;
  517. uint flags;
  518. prop_val = of_get_address(ofnode_to_np(node), index, &size64,
  519. &flags);
  520. if (!prop_val)
  521. return FDT_ADDR_T_NONE;
  522. if (size)
  523. *size = size64;
  524. ns = of_n_size_cells(ofnode_to_np(node));
  525. if (translate && IS_ENABLED(CONFIG_OF_TRANSLATE) && ns > 0) {
  526. return of_translate_address(ofnode_to_np(node), prop_val);
  527. } else {
  528. na = of_n_addr_cells(ofnode_to_np(node));
  529. return of_read_number(prop_val, na);
  530. }
  531. } else {
  532. na = ofnode_read_simple_addr_cells(ofnode_get_parent(node));
  533. ns = ofnode_read_simple_size_cells(ofnode_get_parent(node));
  534. return fdtdec_get_addr_size_fixed(ofnode_to_fdt(node),
  535. ofnode_to_offset(node), "reg",
  536. index, na, ns, size,
  537. translate);
  538. }
  539. }
  540. fdt_addr_t ofnode_get_addr_size_index(ofnode node, int index, fdt_size_t *size)
  541. {
  542. return __ofnode_get_addr_size_index(node, index, size, true);
  543. }
  544. fdt_addr_t ofnode_get_addr_size_index_notrans(ofnode node, int index,
  545. fdt_size_t *size)
  546. {
  547. return __ofnode_get_addr_size_index(node, index, size, false);
  548. }
  549. fdt_addr_t ofnode_get_addr_index(ofnode node, int index)
  550. {
  551. fdt_size_t size;
  552. return ofnode_get_addr_size_index(node, index, &size);
  553. }
  554. fdt_addr_t ofnode_get_addr(ofnode node)
  555. {
  556. return ofnode_get_addr_index(node, 0);
  557. }
  558. fdt_size_t ofnode_get_size(ofnode node)
  559. {
  560. fdt_size_t size;
  561. ofnode_get_addr_size_index(node, 0, &size);
  562. return size;
  563. }
  564. int ofnode_stringlist_search(ofnode node, const char *property,
  565. const char *string)
  566. {
  567. if (ofnode_is_np(node)) {
  568. return of_property_match_string(ofnode_to_np(node),
  569. property, string);
  570. } else {
  571. int ret;
  572. ret = fdt_stringlist_search(ofnode_to_fdt(node),
  573. ofnode_to_offset(node), property,
  574. string);
  575. if (ret == -FDT_ERR_NOTFOUND)
  576. return -ENODATA;
  577. else if (ret < 0)
  578. return -EINVAL;
  579. return ret;
  580. }
  581. }
  582. int ofnode_read_string_index(ofnode node, const char *property, int index,
  583. const char **outp)
  584. {
  585. if (ofnode_is_np(node)) {
  586. return of_property_read_string_index(ofnode_to_np(node),
  587. property, index, outp);
  588. } else {
  589. int len;
  590. *outp = fdt_stringlist_get(ofnode_to_fdt(node),
  591. ofnode_to_offset(node),
  592. property, index, &len);
  593. if (len < 0)
  594. return -EINVAL;
  595. return 0;
  596. }
  597. }
  598. int ofnode_read_string_count(ofnode node, const char *property)
  599. {
  600. if (ofnode_is_np(node)) {
  601. return of_property_count_strings(ofnode_to_np(node), property);
  602. } else {
  603. return fdt_stringlist_count(ofnode_to_fdt(node),
  604. ofnode_to_offset(node), property);
  605. }
  606. }
  607. int ofnode_read_string_list(ofnode node, const char *property,
  608. const char ***listp)
  609. {
  610. const char **prop;
  611. int count;
  612. int i;
  613. *listp = NULL;
  614. count = ofnode_read_string_count(node, property);
  615. if (count < 0)
  616. return count;
  617. if (!count)
  618. return 0;
  619. prop = calloc(count + 1, sizeof(char *));
  620. if (!prop)
  621. return -ENOMEM;
  622. for (i = 0; i < count; i++)
  623. ofnode_read_string_index(node, property, i, &prop[i]);
  624. prop[count] = NULL;
  625. *listp = prop;
  626. return count;
  627. }
  628. static void ofnode_from_fdtdec_phandle_args(struct fdtdec_phandle_args *in,
  629. struct ofnode_phandle_args *out)
  630. {
  631. assert(OF_MAX_PHANDLE_ARGS == MAX_PHANDLE_ARGS);
  632. out->node = offset_to_ofnode(in->node);
  633. out->args_count = in->args_count;
  634. memcpy(out->args, in->args, sizeof(out->args));
  635. }
  636. static void ofnode_from_of_phandle_args(struct of_phandle_args *in,
  637. struct ofnode_phandle_args *out)
  638. {
  639. assert(OF_MAX_PHANDLE_ARGS == MAX_PHANDLE_ARGS);
  640. out->node = np_to_ofnode(in->np);
  641. out->args_count = in->args_count;
  642. memcpy(out->args, in->args, sizeof(out->args));
  643. }
  644. int ofnode_parse_phandle_with_args(ofnode node, const char *list_name,
  645. const char *cells_name, int cell_count,
  646. int index,
  647. struct ofnode_phandle_args *out_args)
  648. {
  649. if (ofnode_is_np(node)) {
  650. struct of_phandle_args args;
  651. int ret;
  652. ret = of_parse_phandle_with_args(ofnode_to_np(node),
  653. list_name, cells_name,
  654. cell_count, index,
  655. &args);
  656. if (ret)
  657. return ret;
  658. ofnode_from_of_phandle_args(&args, out_args);
  659. } else {
  660. struct fdtdec_phandle_args args;
  661. int ret;
  662. ret = fdtdec_parse_phandle_with_args(ofnode_to_fdt(node),
  663. ofnode_to_offset(node),
  664. list_name, cells_name,
  665. cell_count, index, &args);
  666. if (ret)
  667. return ret;
  668. ofnode_from_fdtdec_phandle_args(&args, out_args);
  669. }
  670. return 0;
  671. }
  672. int ofnode_count_phandle_with_args(ofnode node, const char *list_name,
  673. const char *cells_name, int cell_count)
  674. {
  675. if (ofnode_is_np(node))
  676. return of_count_phandle_with_args(ofnode_to_np(node),
  677. list_name, cells_name, cell_count);
  678. else
  679. return fdtdec_parse_phandle_with_args(ofnode_to_fdt(node),
  680. ofnode_to_offset(node), list_name, cells_name,
  681. cell_count, -1, NULL);
  682. }
  683. ofnode ofnode_path(const char *path)
  684. {
  685. if (of_live_active())
  686. return np_to_ofnode(of_find_node_by_path(path));
  687. else
  688. return offset_to_ofnode(fdt_path_offset(gd->fdt_blob, path));
  689. }
  690. ofnode oftree_root(oftree tree)
  691. {
  692. if (of_live_active()) {
  693. return np_to_ofnode(tree.np);
  694. } else {
  695. return ofnode_from_tree_offset(tree, 0);
  696. }
  697. }
  698. ofnode oftree_path(oftree tree, const char *path)
  699. {
  700. if (of_live_active()) {
  701. return np_to_ofnode(of_find_node_opts_by_path(tree.np, path,
  702. NULL));
  703. } else if (*path != '/' && tree.fdt != gd->fdt_blob) {
  704. return ofnode_null(); /* Aliases only on control FDT */
  705. } else {
  706. int offset = fdt_path_offset(tree.fdt, path);
  707. return ofnode_from_tree_offset(tree, offset);
  708. }
  709. }
  710. const void *ofnode_read_chosen_prop(const char *propname, int *sizep)
  711. {
  712. ofnode chosen_node;
  713. chosen_node = ofnode_path("/chosen");
  714. return ofnode_read_prop(chosen_node, propname, sizep);
  715. }
  716. const char *ofnode_read_chosen_string(const char *propname)
  717. {
  718. return ofnode_read_chosen_prop(propname, NULL);
  719. }
  720. ofnode ofnode_get_chosen_node(const char *name)
  721. {
  722. const char *prop;
  723. prop = ofnode_read_chosen_prop(name, NULL);
  724. if (!prop)
  725. return ofnode_null();
  726. return ofnode_path(prop);
  727. }
  728. const void *ofnode_read_aliases_prop(const char *propname, int *sizep)
  729. {
  730. ofnode node;
  731. node = ofnode_path("/aliases");
  732. return ofnode_read_prop(node, propname, sizep);
  733. }
  734. ofnode ofnode_get_aliases_node(const char *name)
  735. {
  736. const char *prop;
  737. prop = ofnode_read_aliases_prop(name, NULL);
  738. if (!prop)
  739. return ofnode_null();
  740. debug("%s: node_path: %s\n", __func__, prop);
  741. return ofnode_path(prop);
  742. }
  743. int ofnode_get_child_count(ofnode parent)
  744. {
  745. ofnode child;
  746. int num = 0;
  747. ofnode_for_each_subnode(child, parent)
  748. num++;
  749. return num;
  750. }
  751. static int decode_timing_property(ofnode node, const char *name,
  752. struct timing_entry *result)
  753. {
  754. int length, ret = 0;
  755. length = ofnode_read_size(node, name);
  756. if (length < 0) {
  757. debug("%s: could not find property %s\n",
  758. ofnode_get_name(node), name);
  759. return length;
  760. }
  761. if (length == sizeof(u32)) {
  762. result->typ = ofnode_read_u32_default(node, name, 0);
  763. result->min = result->typ;
  764. result->max = result->typ;
  765. } else {
  766. ret = ofnode_read_u32_array(node, name, &result->min, 3);
  767. }
  768. return ret;
  769. }
  770. int ofnode_decode_display_timing(ofnode parent, int index,
  771. struct display_timing *dt)
  772. {
  773. int i;
  774. ofnode timings, node;
  775. u32 val = 0;
  776. int ret = 0;
  777. timings = ofnode_find_subnode(parent, "display-timings");
  778. if (!ofnode_valid(timings))
  779. return -EINVAL;
  780. i = 0;
  781. ofnode_for_each_subnode(node, timings) {
  782. if (i++ == index)
  783. break;
  784. }
  785. if (!ofnode_valid(node))
  786. return -EINVAL;
  787. memset(dt, 0, sizeof(*dt));
  788. ret |= decode_timing_property(node, "hback-porch", &dt->hback_porch);
  789. ret |= decode_timing_property(node, "hfront-porch", &dt->hfront_porch);
  790. ret |= decode_timing_property(node, "hactive", &dt->hactive);
  791. ret |= decode_timing_property(node, "hsync-len", &dt->hsync_len);
  792. ret |= decode_timing_property(node, "vback-porch", &dt->vback_porch);
  793. ret |= decode_timing_property(node, "vfront-porch", &dt->vfront_porch);
  794. ret |= decode_timing_property(node, "vactive", &dt->vactive);
  795. ret |= decode_timing_property(node, "vsync-len", &dt->vsync_len);
  796. ret |= decode_timing_property(node, "clock-frequency", &dt->pixelclock);
  797. dt->flags = 0;
  798. val = ofnode_read_u32_default(node, "vsync-active", -1);
  799. if (val != -1) {
  800. dt->flags |= val ? DISPLAY_FLAGS_VSYNC_HIGH :
  801. DISPLAY_FLAGS_VSYNC_LOW;
  802. }
  803. val = ofnode_read_u32_default(node, "hsync-active", -1);
  804. if (val != -1) {
  805. dt->flags |= val ? DISPLAY_FLAGS_HSYNC_HIGH :
  806. DISPLAY_FLAGS_HSYNC_LOW;
  807. }
  808. val = ofnode_read_u32_default(node, "de-active", -1);
  809. if (val != -1) {
  810. dt->flags |= val ? DISPLAY_FLAGS_DE_HIGH :
  811. DISPLAY_FLAGS_DE_LOW;
  812. }
  813. val = ofnode_read_u32_default(node, "pixelclk-active", -1);
  814. if (val != -1) {
  815. dt->flags |= val ? DISPLAY_FLAGS_PIXDATA_POSEDGE :
  816. DISPLAY_FLAGS_PIXDATA_NEGEDGE;
  817. }
  818. if (ofnode_read_bool(node, "interlaced"))
  819. dt->flags |= DISPLAY_FLAGS_INTERLACED;
  820. if (ofnode_read_bool(node, "doublescan"))
  821. dt->flags |= DISPLAY_FLAGS_DOUBLESCAN;
  822. if (ofnode_read_bool(node, "doubleclk"))
  823. dt->flags |= DISPLAY_FLAGS_DOUBLECLK;
  824. return ret;
  825. }
  826. int ofnode_decode_panel_timing(ofnode parent,
  827. struct display_timing *dt)
  828. {
  829. ofnode timings;
  830. u32 val = 0;
  831. int ret = 0;
  832. timings = ofnode_find_subnode(parent, "panel-timing");
  833. if (!ofnode_valid(timings))
  834. return -EINVAL;
  835. memset(dt, 0, sizeof(*dt));
  836. ret |= decode_timing_property(timings, "hback-porch", &dt->hback_porch);
  837. ret |= decode_timing_property(timings, "hfront-porch", &dt->hfront_porch);
  838. ret |= decode_timing_property(timings, "hactive", &dt->hactive);
  839. ret |= decode_timing_property(timings, "hsync-len", &dt->hsync_len);
  840. ret |= decode_timing_property(timings, "vback-porch", &dt->vback_porch);
  841. ret |= decode_timing_property(timings, "vfront-porch", &dt->vfront_porch);
  842. ret |= decode_timing_property(timings, "vactive", &dt->vactive);
  843. ret |= decode_timing_property(timings, "vsync-len", &dt->vsync_len);
  844. ret |= decode_timing_property(timings, "clock-frequency", &dt->pixelclock);
  845. dt->flags = 0;
  846. if (!ofnode_read_u32(timings, "vsync-active", &val)) {
  847. dt->flags |= val ? DISPLAY_FLAGS_VSYNC_HIGH :
  848. DISPLAY_FLAGS_VSYNC_LOW;
  849. }
  850. if (!ofnode_read_u32(timings, "hsync-active", &val)) {
  851. dt->flags |= val ? DISPLAY_FLAGS_HSYNC_HIGH :
  852. DISPLAY_FLAGS_HSYNC_LOW;
  853. }
  854. if (!ofnode_read_u32(timings, "de-active", &val)) {
  855. dt->flags |= val ? DISPLAY_FLAGS_DE_HIGH :
  856. DISPLAY_FLAGS_DE_LOW;
  857. }
  858. if (!ofnode_read_u32(timings, "pixelclk-active", &val)) {
  859. dt->flags |= val ? DISPLAY_FLAGS_PIXDATA_POSEDGE :
  860. DISPLAY_FLAGS_PIXDATA_NEGEDGE;
  861. }
  862. if (ofnode_read_bool(timings, "interlaced"))
  863. dt->flags |= DISPLAY_FLAGS_INTERLACED;
  864. if (ofnode_read_bool(timings, "doublescan"))
  865. dt->flags |= DISPLAY_FLAGS_DOUBLESCAN;
  866. if (ofnode_read_bool(timings, "doubleclk"))
  867. dt->flags |= DISPLAY_FLAGS_DOUBLECLK;
  868. return ret;
  869. }
  870. const void *ofnode_get_property(ofnode node, const char *propname, int *lenp)
  871. {
  872. if (ofnode_is_np(node))
  873. return of_get_property(ofnode_to_np(node), propname, lenp);
  874. else
  875. return fdt_getprop(ofnode_to_fdt(node), ofnode_to_offset(node),
  876. propname, lenp);
  877. }
  878. int ofnode_first_property(ofnode node, struct ofprop *prop)
  879. {
  880. prop->node = node;
  881. if (ofnode_is_np(node)) {
  882. prop->prop = of_get_first_property(ofnode_to_np(prop->node));
  883. if (!prop->prop)
  884. return -FDT_ERR_NOTFOUND;
  885. } else {
  886. prop->offset =
  887. fdt_first_property_offset(ofnode_to_fdt(node),
  888. ofnode_to_offset(prop->node));
  889. if (prop->offset < 0)
  890. return prop->offset;
  891. }
  892. return 0;
  893. }
  894. int ofnode_next_property(struct ofprop *prop)
  895. {
  896. if (ofnode_is_np(prop->node)) {
  897. prop->prop = of_get_next_property(ofnode_to_np(prop->node),
  898. prop->prop);
  899. if (!prop->prop)
  900. return -FDT_ERR_NOTFOUND;
  901. } else {
  902. prop->offset =
  903. fdt_next_property_offset(ofnode_to_fdt(prop->node),
  904. prop->offset);
  905. if (prop->offset < 0)
  906. return prop->offset;
  907. }
  908. return 0;
  909. }
  910. const void *ofprop_get_property(const struct ofprop *prop,
  911. const char **propname, int *lenp)
  912. {
  913. if (ofnode_is_np(prop->node))
  914. return of_get_property_by_prop(ofnode_to_np(prop->node),
  915. prop->prop, propname, lenp);
  916. else
  917. return fdt_getprop_by_offset(ofnode_to_fdt(prop->node),
  918. prop->offset,
  919. propname, lenp);
  920. }
  921. fdt_addr_t ofnode_get_addr_size(ofnode node, const char *property,
  922. fdt_size_t *sizep)
  923. {
  924. if (ofnode_is_np(node)) {
  925. int na, ns;
  926. int psize;
  927. const struct device_node *np = ofnode_to_np(node);
  928. const __be32 *prop = of_get_property(np, property, &psize);
  929. if (!prop)
  930. return FDT_ADDR_T_NONE;
  931. na = of_n_addr_cells(np);
  932. ns = of_n_size_cells(np);
  933. *sizep = of_read_number(prop + na, ns);
  934. if (CONFIG_IS_ENABLED(OF_TRANSLATE) && ns > 0)
  935. return of_translate_address(np, prop);
  936. else
  937. return of_read_number(prop, na);
  938. } else {
  939. return fdtdec_get_addr_size(ofnode_to_fdt(node),
  940. ofnode_to_offset(node), property,
  941. sizep);
  942. }
  943. }
  944. const uint8_t *ofnode_read_u8_array_ptr(ofnode node, const char *propname,
  945. size_t sz)
  946. {
  947. if (ofnode_is_np(node)) {
  948. const struct device_node *np = ofnode_to_np(node);
  949. int psize;
  950. const __be32 *prop = of_get_property(np, propname, &psize);
  951. if (!prop || sz != psize)
  952. return NULL;
  953. return (uint8_t *)prop;
  954. } else {
  955. return fdtdec_locate_byte_array(ofnode_to_fdt(node),
  956. ofnode_to_offset(node), propname, sz);
  957. }
  958. }
  959. int ofnode_read_pci_addr(ofnode node, enum fdt_pci_space type,
  960. const char *propname, struct fdt_pci_addr *addr)
  961. {
  962. const fdt32_t *cell;
  963. int len;
  964. int ret = -ENOENT;
  965. debug("%s: %s: ", __func__, propname);
  966. /*
  967. * If we follow the pci bus bindings strictly, we should check
  968. * the value of the node's parent node's #address-cells and
  969. * #size-cells. They need to be 3 and 2 accordingly. However,
  970. * for simplicity we skip the check here.
  971. */
  972. cell = ofnode_get_property(node, propname, &len);
  973. if (!cell)
  974. goto fail;
  975. if ((len % FDT_PCI_REG_SIZE) == 0) {
  976. int num = len / FDT_PCI_REG_SIZE;
  977. int i;
  978. for (i = 0; i < num; i++) {
  979. debug("pci address #%d: %08lx %08lx %08lx\n", i,
  980. (ulong)fdt32_to_cpu(cell[0]),
  981. (ulong)fdt32_to_cpu(cell[1]),
  982. (ulong)fdt32_to_cpu(cell[2]));
  983. if ((fdt32_to_cpu(*cell) & type) == type) {
  984. addr->phys_hi = fdt32_to_cpu(cell[0]);
  985. addr->phys_mid = fdt32_to_cpu(cell[1]);
  986. addr->phys_lo = fdt32_to_cpu(cell[2]);
  987. break;
  988. }
  989. cell += (FDT_PCI_ADDR_CELLS +
  990. FDT_PCI_SIZE_CELLS);
  991. }
  992. if (i == num) {
  993. ret = -ENXIO;
  994. goto fail;
  995. }
  996. return 0;
  997. }
  998. ret = -EINVAL;
  999. fail:
  1000. debug("(not found)\n");
  1001. return ret;
  1002. }
  1003. int ofnode_read_pci_vendev(ofnode node, u16 *vendor, u16 *device)
  1004. {
  1005. const char *list, *end;
  1006. int len;
  1007. list = ofnode_get_property(node, "compatible", &len);
  1008. if (!list)
  1009. return -ENOENT;
  1010. end = list + len;
  1011. while (list < end) {
  1012. len = strlen(list);
  1013. if (len >= strlen("pciVVVV,DDDD")) {
  1014. char *s = strstr(list, "pci");
  1015. /*
  1016. * check if the string is something like pciVVVV,DDDD.RR
  1017. * or just pciVVVV,DDDD
  1018. */
  1019. if (s && s[7] == ',' &&
  1020. (s[12] == '.' || s[12] == 0)) {
  1021. s += 3;
  1022. *vendor = simple_strtol(s, NULL, 16);
  1023. s += 5;
  1024. *device = simple_strtol(s, NULL, 16);
  1025. return 0;
  1026. }
  1027. }
  1028. list += (len + 1);
  1029. }
  1030. return -ENOENT;
  1031. }
  1032. int ofnode_read_eth_phy_id(ofnode node, u16 *vendor, u16 *device)
  1033. {
  1034. const char *list, *end;
  1035. int len;
  1036. list = ofnode_get_property(node, "compatible", &len);
  1037. if (!list)
  1038. return -ENOENT;
  1039. end = list + len;
  1040. while (list < end) {
  1041. len = strlen(list);
  1042. if (len >= strlen("ethernet-phy-idVVVV.DDDD")) {
  1043. char *s = strstr(list, "ethernet-phy-id");
  1044. /*
  1045. * check if the string is something like
  1046. * ethernet-phy-idVVVV.DDDD
  1047. */
  1048. if (s && s[19] == '.') {
  1049. s += strlen("ethernet-phy-id");
  1050. *vendor = simple_strtol(s, NULL, 16);
  1051. s += 5;
  1052. *device = simple_strtol(s, NULL, 16);
  1053. return 0;
  1054. }
  1055. }
  1056. list += (len + 1);
  1057. }
  1058. return -ENOENT;
  1059. }
  1060. int ofnode_read_addr_cells(ofnode node)
  1061. {
  1062. if (ofnode_is_np(node)) {
  1063. return of_n_addr_cells(ofnode_to_np(node));
  1064. } else {
  1065. int parent = fdt_parent_offset(ofnode_to_fdt(node),
  1066. ofnode_to_offset(node));
  1067. return fdt_address_cells(ofnode_to_fdt(node), parent);
  1068. }
  1069. }
  1070. int ofnode_read_size_cells(ofnode node)
  1071. {
  1072. if (ofnode_is_np(node)) {
  1073. return of_n_size_cells(ofnode_to_np(node));
  1074. } else {
  1075. int parent = fdt_parent_offset(ofnode_to_fdt(node),
  1076. ofnode_to_offset(node));
  1077. return fdt_size_cells(ofnode_to_fdt(node), parent);
  1078. }
  1079. }
  1080. int ofnode_read_simple_addr_cells(ofnode node)
  1081. {
  1082. if (ofnode_is_np(node))
  1083. return of_simple_addr_cells(ofnode_to_np(node));
  1084. else
  1085. return fdt_address_cells(ofnode_to_fdt(node),
  1086. ofnode_to_offset(node));
  1087. }
  1088. int ofnode_read_simple_size_cells(ofnode node)
  1089. {
  1090. if (ofnode_is_np(node))
  1091. return of_simple_size_cells(ofnode_to_np(node));
  1092. else
  1093. return fdt_size_cells(ofnode_to_fdt(node),
  1094. ofnode_to_offset(node));
  1095. }
  1096. bool ofnode_pre_reloc(ofnode node)
  1097. {
  1098. #if defined(CONFIG_SPL_BUILD) || defined(CONFIG_TPL_BUILD)
  1099. /* for SPL and TPL the remaining nodes after the fdtgrep 1st pass
  1100. * had property bootph-all or bootph-pre-sram/bootph-pre-ram.
  1101. * They are removed in final dtb (fdtgrep 2nd pass)
  1102. */
  1103. return true;
  1104. #else
  1105. if (ofnode_read_bool(node, "bootph-all"))
  1106. return true;
  1107. if (ofnode_read_bool(node, "bootph-some-ram"))
  1108. return true;
  1109. /*
  1110. * In regular builds individual spl and tpl handling both
  1111. * count as handled pre-relocation for later second init.
  1112. */
  1113. if (ofnode_read_bool(node, "bootph-pre-ram") ||
  1114. ofnode_read_bool(node, "bootph-pre-sram"))
  1115. return true;
  1116. if (IS_ENABLED(CONFIG_OF_TAG_MIGRATE)) {
  1117. /* detect and handle old tags */
  1118. if (ofnode_read_bool(node, "u-boot,dm-pre-reloc") ||
  1119. ofnode_read_bool(node, "u-boot,dm-pre-proper") ||
  1120. ofnode_read_bool(node, "u-boot,dm-spl") ||
  1121. ofnode_read_bool(node, "u-boot,dm-tpl") ||
  1122. ofnode_read_bool(node, "u-boot,dm-vpl")) {
  1123. gd->flags |= GD_FLG_OF_TAG_MIGRATE;
  1124. return true;
  1125. }
  1126. }
  1127. return false;
  1128. #endif
  1129. }
  1130. int ofnode_read_resource(ofnode node, uint index, struct resource *res)
  1131. {
  1132. if (ofnode_is_np(node)) {
  1133. return of_address_to_resource(ofnode_to_np(node), index, res);
  1134. } else {
  1135. struct fdt_resource fres;
  1136. int ret;
  1137. ret = fdt_get_resource(ofnode_to_fdt(node),
  1138. ofnode_to_offset(node),
  1139. "reg", index, &fres);
  1140. if (ret < 0)
  1141. return -EINVAL;
  1142. memset(res, '\0', sizeof(*res));
  1143. res->start = fres.start;
  1144. res->end = fres.end;
  1145. return 0;
  1146. }
  1147. }
  1148. int ofnode_read_resource_byname(ofnode node, const char *name,
  1149. struct resource *res)
  1150. {
  1151. int index;
  1152. index = ofnode_stringlist_search(node, "reg-names", name);
  1153. if (index < 0)
  1154. return index;
  1155. return ofnode_read_resource(node, index, res);
  1156. }
  1157. u64 ofnode_translate_address(ofnode node, const fdt32_t *in_addr)
  1158. {
  1159. if (ofnode_is_np(node))
  1160. return of_translate_address(ofnode_to_np(node), in_addr);
  1161. else
  1162. return fdt_translate_address(ofnode_to_fdt(node),
  1163. ofnode_to_offset(node), in_addr);
  1164. }
  1165. u64 ofnode_translate_dma_address(ofnode node, const fdt32_t *in_addr)
  1166. {
  1167. if (ofnode_is_np(node))
  1168. return of_translate_dma_address(ofnode_to_np(node), in_addr);
  1169. else
  1170. return fdt_translate_dma_address(ofnode_to_fdt(node),
  1171. ofnode_to_offset(node), in_addr);
  1172. }
  1173. int ofnode_get_dma_range(ofnode node, phys_addr_t *cpu, dma_addr_t *bus, u64 *size)
  1174. {
  1175. if (ofnode_is_np(node))
  1176. return of_get_dma_range(ofnode_to_np(node), cpu, bus, size);
  1177. else
  1178. return fdt_get_dma_range(ofnode_to_fdt(node),
  1179. ofnode_to_offset(node),
  1180. cpu, bus, size);
  1181. }
  1182. int ofnode_device_is_compatible(ofnode node, const char *compat)
  1183. {
  1184. if (ofnode_is_np(node))
  1185. return of_device_is_compatible(ofnode_to_np(node), compat,
  1186. NULL, NULL);
  1187. else
  1188. return !fdt_node_check_compatible(ofnode_to_fdt(node),
  1189. ofnode_to_offset(node),
  1190. compat);
  1191. }
  1192. ofnode ofnode_by_compatible(ofnode from, const char *compat)
  1193. {
  1194. if (of_live_active()) {
  1195. return np_to_ofnode(of_find_compatible_node(
  1196. (struct device_node *)ofnode_to_np(from), NULL,
  1197. compat));
  1198. } else {
  1199. return noffset_to_ofnode(from,
  1200. fdt_node_offset_by_compatible(ofnode_to_fdt(from),
  1201. ofnode_to_offset(from), compat));
  1202. }
  1203. }
  1204. ofnode ofnode_by_prop_value(ofnode from, const char *propname,
  1205. const void *propval, int proplen)
  1206. {
  1207. if (of_live_active()) {
  1208. return np_to_ofnode(of_find_node_by_prop_value(
  1209. (struct device_node *)ofnode_to_np(from), propname,
  1210. propval, proplen));
  1211. } else {
  1212. return noffset_to_ofnode(from,
  1213. fdt_node_offset_by_prop_value(ofnode_to_fdt(from),
  1214. ofnode_to_offset(from), propname, propval,
  1215. proplen));
  1216. }
  1217. }
  1218. int ofnode_write_prop(ofnode node, const char *propname, const void *value,
  1219. int len, bool copy)
  1220. {
  1221. if (of_live_active()) {
  1222. void *newval;
  1223. int ret;
  1224. if (copy) {
  1225. newval = malloc(len);
  1226. if (!newval)
  1227. return log_ret(-ENOMEM);
  1228. memcpy(newval, value, len);
  1229. value = newval;
  1230. }
  1231. ret = of_write_prop(ofnode_to_np(node), propname, len, value);
  1232. if (ret && copy)
  1233. free(newval);
  1234. return ret;
  1235. } else {
  1236. return fdt_setprop(ofnode_to_fdt(node), ofnode_to_offset(node),
  1237. propname, value, len);
  1238. }
  1239. }
  1240. int ofnode_write_string(ofnode node, const char *propname, const char *value)
  1241. {
  1242. assert(ofnode_valid(node));
  1243. debug("%s: %s = %s", __func__, propname, value);
  1244. return ofnode_write_prop(node, propname, value, strlen(value) + 1,
  1245. false);
  1246. }
  1247. int ofnode_write_u32(ofnode node, const char *propname, u32 value)
  1248. {
  1249. fdt32_t *val;
  1250. assert(ofnode_valid(node));
  1251. log_debug("%s = %x", propname, value);
  1252. val = malloc(sizeof(*val));
  1253. if (!val)
  1254. return -ENOMEM;
  1255. *val = cpu_to_fdt32(value);
  1256. return ofnode_write_prop(node, propname, val, sizeof(value), false);
  1257. }
  1258. int ofnode_set_enabled(ofnode node, bool value)
  1259. {
  1260. assert(ofnode_valid(node));
  1261. if (value)
  1262. return ofnode_write_string(node, "status", "okay");
  1263. else
  1264. return ofnode_write_string(node, "status", "disabled");
  1265. }
  1266. bool ofnode_conf_read_bool(const char *prop_name)
  1267. {
  1268. ofnode node;
  1269. node = ofnode_path("/config");
  1270. if (!ofnode_valid(node))
  1271. return false;
  1272. return ofnode_read_bool(node, prop_name);
  1273. }
  1274. int ofnode_conf_read_int(const char *prop_name, int default_val)
  1275. {
  1276. ofnode node;
  1277. node = ofnode_path("/config");
  1278. if (!ofnode_valid(node))
  1279. return default_val;
  1280. return ofnode_read_u32_default(node, prop_name, default_val);
  1281. }
  1282. const char *ofnode_conf_read_str(const char *prop_name)
  1283. {
  1284. ofnode node;
  1285. node = ofnode_path("/config");
  1286. if (!ofnode_valid(node))
  1287. return NULL;
  1288. return ofnode_read_string(node, prop_name);
  1289. }
  1290. ofnode ofnode_get_phy_node(ofnode node)
  1291. {
  1292. /* DT node properties that reference a PHY node */
  1293. static const char * const phy_handle_str[] = {
  1294. "phy-handle", "phy", "phy-device",
  1295. };
  1296. struct ofnode_phandle_args args = {
  1297. .node = ofnode_null()
  1298. };
  1299. int i;
  1300. assert(ofnode_valid(node));
  1301. for (i = 0; i < ARRAY_SIZE(phy_handle_str); i++)
  1302. if (!ofnode_parse_phandle_with_args(node, phy_handle_str[i],
  1303. NULL, 0, 0, &args))
  1304. break;
  1305. return args.node;
  1306. }
  1307. phy_interface_t ofnode_read_phy_mode(ofnode node)
  1308. {
  1309. const char *mode;
  1310. int i;
  1311. assert(ofnode_valid(node));
  1312. mode = ofnode_read_string(node, "phy-mode");
  1313. if (!mode)
  1314. mode = ofnode_read_string(node, "phy-connection-type");
  1315. if (!mode)
  1316. return PHY_INTERFACE_MODE_NA;
  1317. for (i = 0; i < PHY_INTERFACE_MODE_MAX; i++)
  1318. if (!strcmp(mode, phy_interface_strings[i]))
  1319. return i;
  1320. debug("%s: Invalid PHY interface '%s'\n", __func__, mode);
  1321. return PHY_INTERFACE_MODE_NA;
  1322. }
  1323. int ofnode_add_subnode(ofnode node, const char *name, ofnode *subnodep)
  1324. {
  1325. ofnode subnode;
  1326. int ret = 0;
  1327. assert(ofnode_valid(node));
  1328. if (ofnode_is_np(node)) {
  1329. struct device_node *np, *child;
  1330. np = (struct device_node *)ofnode_to_np(node);
  1331. ret = of_add_subnode(np, name, -1, &child);
  1332. if (ret && ret != -EEXIST)
  1333. return ret;
  1334. subnode = np_to_ofnode(child);
  1335. } else {
  1336. void *fdt = ofnode_to_fdt(node);
  1337. int poffset = ofnode_to_offset(node);
  1338. int offset;
  1339. offset = fdt_add_subnode(fdt, poffset, name);
  1340. if (offset == -FDT_ERR_EXISTS) {
  1341. offset = fdt_subnode_offset(fdt, poffset, name);
  1342. ret = -EEXIST;
  1343. }
  1344. if (offset < 0)
  1345. return -EINVAL;
  1346. subnode = noffset_to_ofnode(node, offset);
  1347. }
  1348. *subnodep = subnode;
  1349. return ret; /* 0 or -EEXIST */
  1350. }
  1351. int ofnode_copy_props(ofnode src, ofnode dst)
  1352. {
  1353. struct ofprop prop;
  1354. ofnode_for_each_prop(prop, src) {
  1355. const char *name;
  1356. const char *val;
  1357. int len, ret;
  1358. val = ofprop_get_property(&prop, &name, &len);
  1359. if (!val) {
  1360. log_debug("Cannot read prop (err=%d)\n", len);
  1361. return log_msg_ret("get", -EINVAL);
  1362. }
  1363. ret = ofnode_write_prop(dst, name, val, len, true);
  1364. if (ret) {
  1365. log_debug("Cannot write prop (err=%d)\n", ret);
  1366. return log_msg_ret("wr", -EINVAL);
  1367. }
  1368. }
  1369. return 0;
  1370. }