aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAthira Rajeev <atrajeev@linux.vnet.ibm.com>2023-09-14 22:02:04 +0530
committerReza Arbab <arbab@linux.ibm.com>2023-09-15 12:59:35 -0500
commitf6434d0961f793836fb06a0434e3608d9ac9ff00 (patch)
tree1723bfce951abc2d06f9eb076ebd120d04afa982
parent23c01ab3eb4cf0d4487d548257f330d19bef3188 (diff)
downloadskiboot-f6434d0961f793836fb06a0434e3608d9ac9ff00.zip
skiboot-f6434d0961f793836fb06a0434e3608d9ac9ff00.tar.gz
skiboot-f6434d0961f793836fb06a0434e3608d9ac9ff00.tar.bz2
core/device: Add function to return child node using name at substring "@"
Add a function dt_find_by_name_before_addr() that returns the child node if it matches till first occurrence at "@" of a given name, otherwise NULL. This is helpful for cases with node name like: "name@addr". In scenarios where nodes are added with "name@addr" format and if the value of "addr" is not known, that node can't be matched with node name or addr. Hence matching with substring as node name will return the expected result. Patch adds dt_find_by_name_before_addr() function and testcase for the same in core/test/run-device.c Signed-off-by: Athira Rajeev <atrajeev@linux.vnet.ibm.com> Reviewed-by: Mahesh Salgaonkar <mahesh@linux.ibm.com> [arbab: Refactor the loop to fix possible memory leak] Signed-off-by: Reza Arbab <arbab@linux.ibm.com>
-rw-r--r--core/device.c23
-rw-r--r--core/test/run-device.c13
-rw-r--r--include/device.h3
3 files changed, 39 insertions, 0 deletions
diff --git a/core/device.c b/core/device.c
index 2de37c7..a9bfdb1 100644
--- a/core/device.c
+++ b/core/device.c
@@ -394,6 +394,29 @@ struct dt_node *dt_find_by_name(struct dt_node *root, const char *name)
return NULL;
}
+struct dt_node *dt_find_by_name_before_addr(struct dt_node *root, const char *name)
+{
+ struct dt_node *child, *match;
+ char *child_name;
+
+ list_for_each(&root->children, child, list) {
+ child_name = strdup(child->name);
+ if (!child_name)
+ return NULL;
+
+ child_name = strtok(child_name, "@");
+ if (!strcmp(child_name, name))
+ match = child;
+ else
+ match = dt_find_by_name_before_addr(child, name);
+
+ free(child_name);
+ if (match)
+ return match;
+ }
+
+ return NULL;
+}
struct dt_node *dt_new_check(struct dt_node *parent, const char *name)
{
diff --git a/core/test/run-device.c b/core/test/run-device.c
index 4a12382..13f360e 100644
--- a/core/test/run-device.c
+++ b/core/test/run-device.c
@@ -466,6 +466,19 @@ int main(void)
new_prop_ph = dt_prop_get_u32(ut2, "something");
assert(!(new_prop_ph == ev1_ph));
dt_free(subtree);
+
+ /* Test dt_find_by_name_before_addr */
+ root = dt_new_root("");
+ addr1 = dt_new_addr(root, "node", 0x1);
+ addr2 = dt_new_addr(root, "node0_1", 0x2);
+ assert(dt_find_by_name(root, "node@1") == addr1);
+ assert(dt_find_by_name(root, "node0_1@2") == addr2);
+ assert(dt_find_by_name_before_addr(root, "node") == addr1);
+ assert(dt_find_by_name_before_addr(root, "node0") == NULL);
+ assert(dt_find_by_name_before_addr(root, "node0_") == NULL);
+ assert(dt_find_by_name_before_addr(root, "node0_1") == addr2);
+ dt_free(root);
+
return 0;
}
diff --git a/include/device.h b/include/device.h
index 93fb90f..f2402cc 100644
--- a/include/device.h
+++ b/include/device.h
@@ -184,6 +184,9 @@ struct dt_node *dt_find_by_path(struct dt_node *root, const char *path);
/* Find a child node by name */
struct dt_node *dt_find_by_name(struct dt_node *root, const char *name);
+/* Find a child node by name and substring */
+struct dt_node *dt_find_by_name_before_addr(struct dt_node *root, const char *name);
+
/* Find a node by phandle */
struct dt_node *dt_find_by_phandle(struct dt_node *root, u32 phandle);