| /openbmc/openbmc/poky/bitbake/lib/bs4/ |
| H A D | element.py | 157 previous_sibling=None, next_sibling=None): argument
185 self.next_sibling = next_sibling
186 if self.next_sibling is not None:
187 self.next_sibling.previous_sibling = self
195 self.previous_sibling.next_sibling = self
379 and self.previous_sibling is not self.next_sibling):
380 self.previous_sibling.next_sibling = self.next_sibling
381 if (self.next_sibling is not None
382 and self.next_sibling is not self.previous_sibling):
383 self.next_sibling.previous_sibling = self.previous_sibling
[all …]
|
| H A D | __init__.py | 629 next_element = previous_sibling = next_sibling = None
632 next_sibling = o.next_sibling
639 o.setup(parent, previous_element, next_element, previous_sibling, next_sibling)
667 child.next_sibling = None
677 descendant.next_sibling = None
682 elif target.next_sibling is not None:
683 descendant.next_element = target.next_sibling
684 target.next_sibling.previous_element = child
|
| /openbmc/libpldm/src/dsp/ |
| H A D | pdr.c | 469 pldm_entity_node *next_sibling; member
511 while (start->next_sibling != NULL) { in find_insertion_at()
513 pldm_entity_node *next = start->next_sibling; in find_insertion_at()
518 start = start->next_sibling; in find_insertion_at()
564 node->next_sibling = NULL; in pldm_entity_association_tree_add_entity()
623 pldm_entity_node *next = prev->next_sibling; in pldm_entity_association_tree_add_entity()
634 prev->next_sibling = node; in pldm_entity_association_tree_add_entity()
636 node->next_sibling = next; in pldm_entity_association_tree_add_entity()
655 get_num_nodes(node->next_sibling, num); in get_num_nodes()
672 entity_association_tree_visit(node->next_sibling, entitie in entity_association_tree_visit()
[all...] |
| /openbmc/u-boot/scripts/dtc/ |
| H A D | livetree.c | 188 new_node->children = new_child->next_sibling; in merge_nodes()
190 new_child->next_sibling = NULL; in merge_nodes()
244 assert(first->next_sibling == NULL); in chain_node()
246 first->next_sibling = list; in chain_node()
286 child->next_sibling = NULL; in add_child()
291 p = &((*p)->next_sibling); in add_child()
305 node = node->next_sibling; in delete_node_by_name()
743 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
744 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
|
| H A D | dtc.h | 161 struct node *next_sibling; member
188 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
|
| H A D | checks.c | 254 for (child2 = child->next_sibling; in check_duplicate_node_names()
256 child2 = child2->next_sibling) in check_duplicate_node_names()
|
| /openbmc/linux/scripts/dtc/ |
| H A D | livetree.c | 195 new_node->children = new_child->next_sibling; in merge_nodes()
197 new_child->next_sibling = NULL; in merge_nodes()
260 assert(first->next_sibling == NULL); in chain_node()
262 first->next_sibling = list; in chain_node()
302 child->next_sibling = NULL; in add_child()
307 p = &((*p)->next_sibling); in add_child()
321 node = node->next_sibling; in delete_node_by_name()
788 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
789 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
|
| H A D | dtc.h | 224 struct node *next_sibling; member
254 for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
|
| H A D | checks.c | 281 for (child2 = child->next_sibling; in check_duplicate_node_names()
283 child2 = child2->next_sibling) in check_duplicate_node_names()
|
| /openbmc/openbmc/poky/bitbake/lib/bs4/builder/ |
| H A D | _html5lib.py | 400 final_next_element = element.next_sibling
428 new_parents_last_child.next_sibling = first_child
442 last_childs_last_descendant.next_sibling = None
|
| /openbmc/linux/drivers/of/ |
| H A D | unittest.c | 3180 struct device_node *prev_sibling, *next_sibling; in of_unittest_lifecycle() local
3290 next_sibling = prev_sibling->sibling; in of_unittest_lifecycle()
3292 np->child = next_sibling; in of_unittest_lifecycle()
3293 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
3295 while (next_sibling) { in of_unittest_lifecycle()
3296 if (!strcmp(next_sibling->full_name, "refcount-node")) in of_unittest_lifecycle()
3297 prev_sibling->sibling = next_sibling->sibling; in of_unittest_lifecycle()
3298 prev_sibling = next_sibling; in of_unittest_lifecycle()
3299 next_sibling = next_sibling->sibling; in of_unittest_lifecycle()
|
| /openbmc/pldm/libpldmresponder/test/ |
| H A D | libpldmresponder_fru_test.cpp | 114 pldm_entity_node* next_sibling; in TEST() member
|
| /openbmc/linux/net/ipv6/ |
| H A D | ip6_fib.c | 1231 struct fib6_info *sibling, *next_sibling; in fib6_add_rt2node() local
1239 list_for_each_entry_safe(sibling, next_sibling, in fib6_add_rt2node()
1245 rt6_multipath_rebalance(next_sibling); in fib6_add_rt2node()
1943 struct fib6_info *sibling, *next_sibling; in fib6_del_route() local
1953 list_for_each_entry_safe(sibling, next_sibling, in fib6_del_route()
1958 rt6_multipath_rebalance(next_sibling); in fib6_del_route()
|
| H A D | route.c | 3907 struct fib6_info *sibling, *next_sibling; in __ip6_del_rt_siblings() local
3950 list_for_each_entry_safe(sibling, next_sibling, in __ip6_del_rt_siblings()
5830 struct fib6_info *sibling, *next_sibling; in fib6_info_uses_dev() local
5832 list_for_each_entry_safe(sibling, next_sibling, in fib6_info_uses_dev()
|
| /openbmc/libpldm/abi/x86_64/ |
| H A D | gcc.dump | 11995 'name' => 'next_sibling',
|