70 	struct toptree *child, *tmp;  in toptree_free()  local
74 	toptree_for_each_child_safe(child, tmp, cand)  in toptree_free()
75 		toptree_free(child);  in toptree_free()
93 	struct toptree *child;  in toptree_update_mask()  local
96 	list_for_each_entry(child, &cand->children, sibling)  in toptree_update_mask()
97 		cpumask_or(&cand->mask, &cand->mask, &child->mask);  in toptree_update_mask()
134 	struct toptree *child, *tmp;  in toptree_move_children()  local
136 	toptree_for_each_child_safe(child, tmp, cand)  in toptree_move_children()
137 		toptree_move(child, target);  in toptree_move_children()
150 	struct toptree *child, *tmp, *cand_copy;  in toptree_unify()  local
157 	toptree_for_each_child_safe(child, tmp, cand) {  in toptree_unify()
160 		if (!cpumask_empty(&child->mask)) {  in toptree_unify()
161 			tmpchild = toptree_get_child(cand_copy, child->id);  in toptree_unify()
162 			toptree_move_children(child, tmpchild);  in toptree_unify()
164 		toptree_free(child);  in toptree_unify()
169 	toptree_for_each_child(child, cand)  in toptree_unify()
170 		toptree_unify(child);  in toptree_unify()
229 	struct toptree *child;  in toptree_get_child()  local
231 	toptree_for_each_child(child, cand)  in toptree_get_child()
232 		if (child->id == id)  in toptree_get_child()
233 			return child;  in toptree_get_child()
234 	child = toptree_alloc(cand->level-1, id);  in toptree_get_child()
235 	toptree_insert(child, cand);  in toptree_get_child()
236 	return child;  in toptree_get_child()
250 	struct toptree *child, *tmp;  in toptree_first()  local
256 		list_for_each_entry(child, &context->children, sibling) {  in toptree_first()
257 			tmp = toptree_first(child, level);  in toptree_first()