Home
last modified time | relevance | path

Searched refs:child2 (Results 1 – 5 of 5) sorted by relevance

/linux-4.4.14/include/linux/
Drbtree_augmented.h170 struct rb_node *successor = child, *child2; in __rb_erase_augmented() local
184 child2 = successor->rb_right; in __rb_erase_augmented()
207 child2 = successor->rb_right; in __rb_erase_augmented()
208 WRITE_ONCE(parent->rb_left, child2); in __rb_erase_augmented()
224 if (child2) { in __rb_erase_augmented()
226 rb_set_parent_color(child2, parent, RB_BLACK); in __rb_erase_augmented()
/linux-4.4.14/tools/include/linux/
Drbtree_augmented.h172 struct rb_node *successor = child, *child2; in __rb_erase_augmented() local
185 child2 = successor->rb_right; in __rb_erase_augmented()
207 parent->rb_left = child2 = successor->rb_right; in __rb_erase_augmented()
220 if (child2) { in __rb_erase_augmented()
222 rb_set_parent_color(child2, parent, RB_BLACK); in __rb_erase_augmented()
/linux-4.4.14/scripts/kconfig/
Dgconf.c1252 GtkTreeIter *child2 = &iter; in update_tree() local
1261 valid = gtk_tree_model_iter_children(model2, child2, dst); in update_tree()
1269 gtk_tree_model_get(model2, child2, COL_MENU, in update_tree()
1286 memcpy(&tmp, child2, sizeof(GtkTreeIter)); in update_tree()
1288 child2); in update_tree()
1303 sibling = child2; in update_tree()
1305 child2, in update_tree()
1307 set_node(child2, menu1, fill_row(menu1)); in update_tree()
1311 memcpy(&tmp, child2, sizeof(GtkTreeIter)); in update_tree()
1313 child2); in update_tree()
[all …]
/linux-4.4.14/drivers/pinctrl/freescale/
Dpinctrl-mxs.c448 struct device_node *child2; in mxs_pinctrl_probe_dt() local
464 for (child2 = of_get_next_child(np, child); in mxs_pinctrl_probe_dt()
465 child2 != NULL; in mxs_pinctrl_probe_dt()
466 child2 = of_get_next_child(np, child2)) { in mxs_pinctrl_probe_dt()
467 if (!strcmp(child2->name, fn)) in mxs_pinctrl_probe_dt()
/linux-4.4.14/scripts/dtc/
Dchecks.c243 struct node *child, *child2; in check_duplicate_node_names() local
246 for (child2 = child->next_sibling; in check_duplicate_node_names()
247 child2; in check_duplicate_node_names()
248 child2 = child2->next_sibling) in check_duplicate_node_names()
249 if (streq(child->name, child2->name)) in check_duplicate_node_names()