of: Add for_each_reserved_child_of_node()

JIRA: https://issues.redhat.com/browse/RHEL-77190

commit 28c5d4e40752fc39507a647b20649c5ca1cf33b7
Author: Kuninori Morimoto <kuninori.morimoto.gx@renesas.com>
Date:   Wed Jan 10 01:14:50 2024 +0000

    of: Add for_each_reserved_child_of_node()

    We would like to use for_each loop for status = "reserved" nodes.
    Add for_each_reserved_child_of_node() for it.

    Signed-off-by: Kuninori Morimoto <kuninori.morimoto.gx@renesas.com>
    Tested-by: Yusuke Goda <yusuke.goda.sx@renesas.com>
    Reviewed-by: Geert Uytterhoeven <geert+renesas@glider.be>
    Reviewed-by: Rob Herring <robh@kernel.org>
    Link: https://lore.kernel.org/r/87a5pegfau.wl-kuninori.morimoto.gx@renesas.com
    Signed-off-by: Geert Uytterhoeven <geert+renesas@glider.be>

Signed-off-by: Radu Rendec <rrendec@redhat.com>
This commit is contained in:
Radu Rendec 2025-01-31 12:56:42 -05:00
parent 8b24722d13
commit f940a54018
2 changed files with 40 additions and 0 deletions

View File

@ -464,6 +464,20 @@ static bool __of_device_is_available(const struct device_node *device)
__of_device_is_status(device, ok);
}
/**
* __of_device_is_reserved - check if a device is reserved
*
* @device: Node to check for availability, with locks already held
*
* Return: True if the status property is set to "reserved", false otherwise
*/
static bool __of_device_is_reserved(const struct device_node *device)
{
static const char * const reserved[] = {"reserved", NULL};
return __of_device_is_status(device, reserved);
}
/**
* of_device_is_available - check if a device is available for use
*
@ -649,6 +663,21 @@ struct device_node *of_get_next_available_child(const struct device_node *node,
}
EXPORT_SYMBOL(of_get_next_available_child);
/**
* of_get_next_reserved_child - Find the next reserved child node
* @node: parent node
* @prev: previous child of the parent node, or NULL to get first
*
* This function is like of_get_next_child(), except that it
* automatically skips any disabled nodes (i.e. status = "disabled").
*/
struct device_node *of_get_next_reserved_child(const struct device_node *node,
struct device_node *prev)
{
return of_get_next_status_child(node, prev, __of_device_is_reserved);
}
EXPORT_SYMBOL(of_get_next_reserved_child);
/**
* of_get_next_cpu_node - Iterate on cpu nodes
* @prev: previous child of the /cpus node, or NULL to get first

View File

@ -286,6 +286,8 @@ extern struct device_node *of_get_next_child(const struct device_node *node,
struct device_node *prev);
extern struct device_node *of_get_next_available_child(
const struct device_node *node, struct device_node *prev);
extern struct device_node *of_get_next_reserved_child(
const struct device_node *node, struct device_node *prev);
extern struct device_node *of_get_compatible_child(const struct device_node *parent,
const char *compatible);
@ -533,6 +535,12 @@ static inline struct device_node *of_get_next_available_child(
return NULL;
}
static inline struct device_node *of_get_next_reserved_child(
const struct device_node *node, struct device_node *prev)
{
return NULL;
}
static inline struct device_node *of_find_node_with_property(
struct device_node *from, const char *prop_name)
{
@ -1404,6 +1412,9 @@ static inline int of_property_read_s32(const struct device_node *np,
#define for_each_available_child_of_node(parent, child) \
for (child = of_get_next_available_child(parent, NULL); child != NULL; \
child = of_get_next_available_child(parent, child))
#define for_each_reserved_child_of_node(parent, child) \
for (child = of_get_next_reserved_child(parent, NULL); child != NULL; \
child = of_get_next_reserved_child(parent, child))
#define for_each_available_child_of_node_scoped(parent, child) \
for (struct device_node *child __free(device_node) = \