Lines Matching full:children

13  * children. It propagates the constraints set at its level to its
14  * children and collect the children power information. The leaves of
72 	list_for_each_entry(child, &dtpm->children, sibling) {  in __get_power_uw()
91 	list_for_each_entry(child, &dtpm->children, sibling) {  in __dtpm_rebalance_weight()
163  * release will be denied if the node has children. This function must
167  * Return: 0 on success, -EBUSY if there are children
174 	if (!list_empty(&dtpm->children))  in dtpm_release_zone()
200  * given the weight of the children.
231 		list_for_each_entry(child, &dtpm->children, sibling) {  in __set_power_limit_uw()
322 		INIT_LIST_HEAD(&dtpm->children);  in dtpm_init()
398 		list_add_tail(&dtpm->sibling, &parent->children);  in dtpm_register()
492 		 * A NULL pointer means there is no children, hence we  in dtpm_for_each_child()
622 	list_for_each_entry_safe(child, aux, &dtpm->children, sibling)  in __dtpm_destroy_hierarchy()
626 	 * At this point, we know all children were removed from the  in __dtpm_destroy_hierarchy()