Lines Matching defs:prev
226 struct device_node *__of_find_all_nodes(struct device_node *prev)
229 if (!prev) {
231 } else if (prev->child) {
232 np = prev->child;
235 np = prev;
245 * @prev: Previous node or NULL to start iteration
251 struct device_node *of_find_all_nodes(struct device_node *prev)
257 np = __of_find_all_nodes(prev);
259 of_node_put(prev);
562 struct device_node *prev)
569 next = prev ? prev->sibling : node->child;
571 of_node_put(prev);
581 * @prev: previous child of the parent node, or NULL to get first
584 * it when done. Returns NULL when prev is the last child. Decrements the
585 * refcount of prev.
588 struct device_node *prev)
594 next = __of_get_next_child(node, prev);
603 * @prev: previous child of the parent node, or NULL to get first
609 struct device_node *prev)
618 next = prev ? prev->sibling : node->child;
625 of_node_put(prev);
633 * @prev: previous child of the /cpus node, or NULL to get first
639 * on it when done. Returns NULL when prev is the last child. Decrements
640 * the refcount of prev.
642 struct device_node *of_get_next_cpu_node(struct device_node *prev)
648 if (!prev)
652 if (prev)
653 next = prev->sibling;
667 of_node_put(prev);
1922 struct device_node *prev = NULL, *np = of_cpu_device_node_get(cpu);
1925 of_node_put(prev);
1926 prev = np;
1930 of_property_read_u32(prev, "cache-level", &cache_level);
1931 of_node_put(prev);