[RFC PATCH v2 44/74] dtc: Introduce orphan nodes
From: Herve Codina
Date: Wed Aug 26 2026 - 06:09:39 EST
Orphans nodes can be present in plugin and addon device-trees.
Those nodes are nodes without a parent. The root device-tree node is a
particular orphan node and is not part of those 'orphan' nodes group.
The orphan nodes group is related to nodes identified by a reference in
addons or plugins device-trees. For instance, the following node can be
described in addons and plugins (overlay) device-trees:
--- 8< ---
&foo {
subnode {
prop = <1>;
};
};
--- 8< ---
The foo referenced node described here has no parent. Indeed, it is not
a child of the root node.
This kind of node is legit in plugins and addons device-tree in order to
perform modification on existing node when the plugin or addon dtb is
applied. The foo referenced node is an existing node in the base tree an
the subnode node is added to the foo referenced node chen the dtb is
applied. Even if foo itself doesn't exists in the plugin or addon
device-tree, it needs to be referenced and modifications expected need
to be described (new sub-node for instance).
In plugin dts, when a orphan node is parsed, the dts structure is
changed and the orphan node is merged in the /fragment@n/__overlay__
node. The foo referenced node mentioned in the previous snippet is
transformed to:
--- 8< ---
/ {
fragment@0 {
target = <&foo>;
__overlay__ {
subnode {
prop = <0x01>;
};
};
};
__fixups__ {
foo = "/fragment@0:target:0";
};
};
--- 8< ---
With this mechanism, the orphan node itself doesn't exist anymore in
resulting plugin dtb but the resulting device-tree contains meta-data
mixed with pure 'device-tree' data.
Addons have been introduced to avoid this kind of mixing.
For addons, instead of changing the device-tree structure to add
something similar to fragments and __overlay__ present in plugins, the
orphan node will be present as a new dtb block and will be identified as
orphan thanks to meta-data added in dtb.
Modification done in this commit doesn't add functional changes but just
introduce orphan nodes entry points in data structures and functions in
order to prepare future changes related to parsing/generating dts and
dtb files.
Signed-off-by: Herve Codina <herve.codina@xxxxxxxxxxx>
---
dtc-parser.y | 4 ++--
dtc.h | 10 +++++++++-
flattree.c | 3 ++-
fstree.c | 3 ++-
livetree.c | 16 +++++++++++++++-
5 files changed, 30 insertions(+), 6 deletions(-)
diff --git a/dtc-parser.y b/dtc-parser.y
index dd346fb4..47f644eb 100644
--- a/dtc-parser.y
+++ b/dtc-parser.y
@@ -132,7 +132,7 @@ sourcefile:
{
parser_output = build_dt_info($1, $2, $3,
guess_boot_cpuid($3),
- NULL);
+ NULL, NULL);
}
| headers memreserves importlist devicetree
{
@@ -143,7 +143,7 @@ sourcefile:
*/
parser_output = build_dt_info($1, $2, $4,
$4 ? guess_boot_cpuid($4) : 0,
- reverse_symbol($3));
+ reverse_symbol($3), NULL);
}
;
diff --git a/dtc.h b/dtc.h
index e2d90f63..06dd7db1 100644
--- a/dtc.h
+++ b/dtc.h
@@ -250,6 +250,8 @@ struct node {
const struct bus_type *bus;
struct srcpos *srcpos;
+ char *ref; /* Use only for orphan nodes */
+
bool omit_if_unused, is_referenced;
};
@@ -277,6 +279,9 @@ struct node {
#define for_each_symbol(s0, s) \
for ((s) = (s0); (s); (s) = (s)->next)
+#define for_each_orphan(o0, o) \
+ for ((o) = (o0); (o); (o) = (o)->next_sibling)
+
void add_label(struct label **labels, char *label);
void delete_labels(struct label **labels);
@@ -345,6 +350,7 @@ struct dt_info {
uint32_t boot_cpuid_phys;
struct node *dt; /* the device tree */
struct symbol *importsymlist; /* Import symbol list */
+ struct node *orphanlist; /* orphan nodes list */
const char *outname; /* filename being written to, "-" for stdout */
};
@@ -357,6 +363,7 @@ struct property *get_property_by_label(struct dt_info *dti, const char *label,
struct node **node);
struct marker *get_marker_label(struct dt_info *dti, const char *label,
struct node **node, struct property **prop);
+bool node_is_orphan(struct dt_info *dti, const struct node *node);
/* DTS version flags definitions */
#define DTSF_V1 0x0001 /* /dts-v1/ */
@@ -366,7 +373,8 @@ struct marker *get_marker_label(struct dt_info *dti, const char *label,
struct dt_info *build_dt_info(unsigned int dtsflags,
struct reserve_info *reservelist,
struct node *tree, uint32_t boot_cpuid_phys,
- struct symbol *importsymlist);
+ struct symbol *importsymlist,
+ struct node *orphanlist);
void sort_tree(struct dt_info *dti);
void generate_labels_from_tree(struct dt_info *dti, const char *name);
void generate_label_tree(struct dt_info *dti, const char *name, bool allocph);
diff --git a/flattree.c b/flattree.c
index 4f4a185a..bd6974b8 100644
--- a/flattree.c
+++ b/flattree.c
@@ -1315,5 +1315,6 @@ struct dt_info *dt_from_blob(const char *fname)
if (get_subnode(tree, "__fixups__") || get_subnode(tree, "__local_fixups__"))
dtsflags |= DTSF_PLUGIN;
- return build_dt_info(dtsflags, reservelist, tree, boot_cpuid_phys, importsymlist);
+ return build_dt_info(dtsflags, reservelist, tree, boot_cpuid_phys,
+ importsymlist, NULL);
}
diff --git a/fstree.c b/fstree.c
index a6aaf1e8..2be1ffaf 100644
--- a/fstree.c
+++ b/fstree.c
@@ -72,5 +72,6 @@ struct dt_info *dt_from_fs(const char *dirname)
tree = read_fstree(dirname);
tree = name_node(tree, "");
- return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree), NULL);
+ return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree), NULL,
+ NULL);
}
diff --git a/livetree.c b/livetree.c
index a8c7c852..fddb4b4f 100644
--- a/livetree.c
+++ b/livetree.c
@@ -656,7 +656,8 @@ static void complete_references(struct dt_info *dti)
struct dt_info *build_dt_info(unsigned int dtsflags,
struct reserve_info *reservelist,
struct node *tree, uint32_t boot_cpuid_phys,
- struct symbol *importsymlist)
+ struct symbol *importsymlist,
+ struct node *orphanlist)
{
struct dt_info *dti;
@@ -666,6 +667,7 @@ struct dt_info *build_dt_info(unsigned int dtsflags,
dti->dt = tree;
dti->boot_cpuid_phys = boot_cpuid_phys;
dti->importsymlist = importsymlist;
+ dti->orphanlist = orphanlist;
fill_fullpaths(dti);
@@ -952,6 +954,18 @@ struct node *get_node_by_ref(struct dt_info *dti, const char *ref)
return NULL;
}
+bool node_is_orphan(struct dt_info *dti, const struct node *node)
+{
+ struct node *orphan;
+
+ for_each_orphan(dti->orphanlist, orphan) {
+ if (orphan == node)
+ return true;
+ }
+
+ return false;
+}
+
struct property *get_property_by_label(struct dt_info *dti, const char *label,
struct node **node)
{
--
2.55.0