Home
last modified time | relevance | path

Searched refs:sibling (Results 1 – 10 of 10) sorted by relevance

/u-boot/lib/
A Drbtree.c207 if (rb_is_red(sibling)) { in ____rb_erase_color()
223 sibling = tmp1; in ____rb_erase_color()
225 tmp1 = sibling->rb_right; in ____rb_erase_color()
227 tmp2 = sibling->rb_left; in ____rb_erase_color()
275 tmp1 = sibling; in ____rb_erase_color()
276 sibling = tmp2; in ____rb_erase_color()
301 if (rb_is_red(sibling)) { in ____rb_erase_color()
309 sibling = tmp1; in ____rb_erase_color()
311 tmp1 = sibling->rb_left; in ____rb_erase_color()
336 tmp1 = sibling; in ____rb_erase_color()
[all …]
A Dof_live.c121 np->sibling = dad->child; in unflatten_dt_node()
237 struct device_node *next = child->sibling; in unflatten_dt_node()
239 child->sibling = np->child; in unflatten_dt_node()
/u-boot/include/dm/
A Dof.h52 struct device_node *sibling; member
A Dofnode.h408 return np_to_ofnode(node.np->sibling); in ofnode_next_subnode()
/u-boot/drivers/core/
A Dof_access.c161 while (np->parent && !np->sibling) in of_find_all_nodes()
163 np = np->sibling; /* Might be null at the end of the tree */ in of_find_all_nodes()
305 next = prev ? prev->sibling : node->child; in __of_get_next_child()
312 for (; next; next = next->sibling) in __of_get_next_child()
A Dofnode.c198 for (np = np->child; np; np = np->sibling) { in ofnode_find_subnode()
255 return np_to_ofnode(node.np->sibling); in ofnode_next_subnode()
/u-boot/arch/arm/
A Dconfig.mk119 PLATFORM_RELFLAGS += -fno-optimize-sibling-calls
/u-boot/include/linux/
A Dioport.h23 struct resource *parent, *sibling, *child; member
/u-boot/scripts/kconfig/
A Dgconf.c1254 GtkTreeIter *sibling; in update_tree() local
1301 sibling = NULL; in update_tree()
1303 sibling = child2; in update_tree()
1306 dst, sibling); in update_tree()
/u-boot/doc/driver-model/
A Dlivetree.rst146 and their sibling. This allows nodes to be linked together in a hierarchical

Completed in 20 milliseconds