How can I change nodes order during building in device tree(fdt)
0
I faced with problem: nodes in device tree after compiling I have reverse order when read final fdt file. For example, I have
parent_node@10000
<properties...>
child_node2
<properties...>
;
child_node1
<properties...>
;
child_node0
<properties...>
;
;
Functions called in direct order to add nodes(checked with fdt-internals). What should I change in dt-compiler or fdt internals to make direct node order without permanent changing of dts content(swapping)? Like this
parent_node@10000
<properties...>
child_node0
<properties...>
;
child_node1
<properties...>
;
child_node2
<properties...>
;
;
linux linux-device-driver device-tree
edited Nov 12 at 16:27
Ian Abbott
2,936616
asked Nov 12 at 15:14
Ivan Efremov
11
add a comment |
0
I faced with problem: nodes in device tree after compiling I have reverse order when read final fdt file. For example, I have
parent_node@10000
<properties...>
child_node2
<properties...>
;
child_node1
<properties...>
;
child_node0
<properties...>
;
;
Functions called in direct order to add nodes(checked with fdt-internals). What should I change in dt-compiler or fdt internals to make direct node order without permanent changing of dts content(swapping)? Like this
parent_node@10000
<properties...>
child_node0
<properties...>
;
child_node1
<properties...>
;
child_node2
<properties...>
;
;
linux linux-device-driver device-tree
edited Nov 12 at 16:27
Ian Abbott
2,936616
asked Nov 12 at 15:14
Ivan Efremov
11
It is unclear what you are asking.
– Paul Ogilvie
Nov 12 at 15:44
dtc has a-soption to sort nodes and properties before outputting, but I'm not sure which order it sorts them in.
– Ian Abbott
Nov 12 at 16:25
I'm going to remove the c tag, because it does not seem to be relevant to this question.
– Ian Abbott
Nov 12 at 16:27
I need to sort not only for outputting, but for target fdt(dtb) file.
– Ivan Efremov
Nov 12 at 17:02
I'm not sure why you need the child nodes to end up in a particular order. Is the code that iterates through the child nodes of the parent node under your control? If so, you could define a property in the parent node that contains a comma-separated list of phandles to the child nodes in the order you wish to process them. Your Linux code can callof_parse_phandle()to get the node at a particular index in the list. Start at index 0 in the list, then 1, etc. until it returns NULL, meaning you have reached the end of the list. (Don't forget to callof_node_put()on the returned nodes.)
– Ian Abbott
Nov 12 at 17:30
add a comment |
0
0
0
I faced with problem: nodes in device tree after compiling I have reverse order when read final fdt file. For example, I have
parent_node@10000
<properties...>
child_node2
<properties...>
;
child_node1
<properties...>
;
child_node0
<properties...>
;
;
Functions called in direct order to add nodes(checked with fdt-internals). What should I change in dt-compiler or fdt internals to make direct node order without permanent changing of dts content(swapping)? Like this
parent_node@10000
<properties...>
child_node0
<properties...>
;
child_node1
<properties...>
;
child_node2
<properties...>
;
;
linux linux-device-driver device-tree
edited Nov 12 at 16:27
Ian Abbott
2,936616
asked Nov 12 at 15:14
Ivan Efremov
11
I faced with problem: nodes in device tree after compiling I have reverse order when read final fdt file. For example, I have
parent_node@10000
<properties...>
child_node2
<properties...>
;
child_node1
<properties...>
;
child_node0
<properties...>
;
;
Functions called in direct order to add nodes(checked with fdt-internals). What should I change in dt-compiler or fdt internals to make direct node order without permanent changing of dts content(swapping)? Like this
parent_node@10000
<properties...>
child_node0
<properties...>
;
child_node1
<properties...>
;
child_node2
<properties...>
;
;
linux linux-device-driver device-tree
linux linux-device-driver device-tree
edited Nov 12 at 16:27
Ian Abbott
2,936616
asked Nov 12 at 15:14
Ivan Efremov
11
edited Nov 12 at 16:27
Ian Abbott
2,936616
asked Nov 12 at 15:14
Ivan Efremov
11
edited Nov 12 at 16:27
Ian Abbott
2,936616
edited Nov 12 at 16:27
Ian Abbott
2,936616
edited Nov 12 at 16:27
Ian Abbott
2,936616
2,936616
asked Nov 12 at 15:14
Ivan Efremov
11
asked Nov 12 at 15:14
Ivan Efremov
11
asked Nov 12 at 15:14
Ivan Efremov
11
11
It is unclear what you are asking.
– Paul Ogilvie
Nov 12 at 15:44
dtc has a-soption to sort nodes and properties before outputting, but I'm not sure which order it sorts them in.
– Ian Abbott
Nov 12 at 16:25
I'm going to remove the c tag, because it does not seem to be relevant to this question.
– Ian Abbott
Nov 12 at 16:27
I need to sort not only for outputting, but for target fdt(dtb) file.
– Ivan Efremov
Nov 12 at 17:02
I'm not sure why you need the child nodes to end up in a particular order. Is the code that iterates through the child nodes of the parent node under your control? If so, you could define a property in the parent node that contains a comma-separated list of phandles to the child nodes in the order you wish to process them. Your Linux code can callof_parse_phandle()to get the node at a particular index in the list. Start at index 0 in the list, then 1, etc. until it returns NULL, meaning you have reached the end of the list. (Don't forget to callof_node_put()on the returned nodes.)
– Ian Abbott
Nov 12 at 17:30
add a comment |
It is unclear what you are asking.
– Paul Ogilvie
Nov 12 at 15:44
dtc has a-soption to sort nodes and properties before outputting, but I'm not sure which order it sorts them in.
– Ian Abbott
Nov 12 at 16:25
I'm going to remove the c tag, because it does not seem to be relevant to this question.
– Ian Abbott
Nov 12 at 16:27
I need to sort not only for outputting, but for target fdt(dtb) file.
– Ivan Efremov
Nov 12 at 17:02
I'm not sure why you need the child nodes to end up in a particular order. Is the code that iterates through the child nodes of the parent node under your control? If so, you could define a property in the parent node that contains a comma-separated list of phandles to the child nodes in the order you wish to process them. Your Linux code can callof_parse_phandle()to get the node at a particular index in the list. Start at index 0 in the list, then 1, etc. until it returns NULL, meaning you have reached the end of the list. (Don't forget to callof_node_put()on the returned nodes.)
– Ian Abbott
Nov 12 at 17:30
It is unclear what you are asking.
– Paul Ogilvie
Nov 12 at 15:44
It is unclear what you are asking.
– Paul Ogilvie
Nov 12 at 15:44
dtc has a
-s option to sort nodes and properties before outputting, but I'm not sure which order it sorts them in.– Ian Abbott
Nov 12 at 16:25
dtc has a
-s option to sort nodes and properties before outputting, but I'm not sure which order it sorts them in.– Ian Abbott
Nov 12 at 16:25
I'm going to remove the c tag, because it does not seem to be relevant to this question.
– Ian Abbott
Nov 12 at 16:27
I'm going to remove the c tag, because it does not seem to be relevant to this question.
– Ian Abbott
Nov 12 at 16:27
I need to sort not only for outputting, but for target fdt(dtb) file.
– Ivan Efremov
Nov 12 at 17:02
I need to sort not only for outputting, but for target fdt(dtb) file.
– Ivan Efremov
Nov 12 at 17:02
I'm not sure why you need the child nodes to end up in a particular order. Is the code that iterates through the child nodes of the parent node under your control? If so, you could define a property in the parent node that contains a comma-separated list of phandles to the child nodes in the order you wish to process them. Your Linux code can call
of_parse_phandle() to get the node at a particular index in the list. Start at index 0 in the list, then 1, etc. until it returns NULL, meaning you have reached the end of the list. (Don't forget to call of_node_put() on the returned nodes.)– Ian Abbott
Nov 12 at 17:30
I'm not sure why you need the child nodes to end up in a particular order. Is the code that iterates through the child nodes of the parent node under your control? If so, you could define a property in the parent node that contains a comma-separated list of phandles to the child nodes in the order you wish to process them. Your Linux code can call
of_parse_phandle() to get the node at a particular index in the list. Start at index 0 in the list, then 1, etc. until it returns NULL, meaning you have reached the end of the list. (Don't forget to call of_node_put() on the returned nodes.)– Ian Abbott
Nov 12 at 17:30
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53265059%2fhow-can-i-change-nodes-order-during-building-in-device-treefdt%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53265059%2fhow-can-i-change-nodes-order-during-building-in-device-treefdt%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
It is unclear what you are asking.
– Paul Ogilvie
Nov 12 at 15:44
dtc has a
-soption to sort nodes and properties before outputting, but I'm not sure which order it sorts them in.– Ian Abbott
Nov 12 at 16:25
I'm going to remove the c tag, because it does not seem to be relevant to this question.
– Ian Abbott
Nov 12 at 16:27
I need to sort not only for outputting, but for target fdt(dtb) file.
– Ivan Efremov
Nov 12 at 17:02
I'm not sure why you need the child nodes to end up in a particular order. Is the code that iterates through the child nodes of the parent node under your control? If so, you could define a property in the parent node that contains a comma-separated list of phandles to the child nodes in the order you wish to process them. Your Linux code can call
of_parse_phandle()to get the node at a particular index in the list. Start at index 0 in the list, then 1, etc. until it returns NULL, meaning you have reached the end of the list. (Don't forget to callof_node_put()on the returned nodes.)– Ian Abbott
Nov 12 at 17:30