Lines Matching defs:parent
107 * parent will (try to) run first.
307 #define for_each_sched_entity(se) for (; se; se = se->parent)
353 * Ensure we either appear before our parent (if already
354 * enqueued) or force our parent to appear after us when it is
361 if (cfs_rq->tg->parent && cfs_rq->tg->parent->cfs_rq[cpu]->on_list) {
363 * If parent is already on the list, we add the child
366 * of the list that starts by parent.
368 list_add_tail_rcu(&cfs_rq->leaf_cfs_rq_list, &(cfs_rq->tg->parent->cfs_rq[cpu]->leaf_cfs_rq_list));
378 if (!cfs_rq->tg->parent) {
380 * cfs rq without parent should be put
393 * The parent has not already been added so we want to
396 * where we will add parent.
449 return se->parent;
458 * same cfs_rq i.e who have a common parent. Walk up the hierarchy of
460 * parent.
615 struct rb_node *parent = NULL;
623 parent = *link;
624 entry = rb_entry(parent, struct sched_entity, run_node);
630 link = &parent->rb_left;
632 link = &parent->rb_right;
637 rb_link_node(&se->run_node, parent, link);
3583 /* Update parent cfs_rq utilization */
3608 /* Update parent cfs_rq runnable */
4468 * because of a parent been throttled but cfs->nr_running > 1. Try to
4928 /* check whether cfs_rq, or any parent, is throttled */
5117 * One parent has been throttled and cfs_rq removed from the
5417 if (!tg->parent) {
5422 pcfs_rq = tg->parent->cfs_rq[cpu];
5852 * One parent has been throttled and cfs_rq removed from the
5935 /* Don't dequeue parent if it has other entities besides us */
6986 * their util_avg from the parent task, but those heuristics could hurt
7011 sd = sd->parent;
7502 * throttle and dequeue its entity in the parent(s).
8471 /* Propagate pending load changes to the parent, if any: */
9572 if (!env->sd->parent) {
10155 struct sched_domain *sd_parent = sd->parent;
10398 * we can't migrate them. Let the imbalance flag set so parent level
11563 * called on fork with the child task as argument from the parent's context
11666 /* Start to propagate at parent */
11667 se = se->parent;
11708 se->depth = se->parent ? se->parent->depth + 1 : 0;
11816 se->depth = se->parent ? se->parent->depth + 1 : 0;
11864 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)
11896 init_tg_cfs_entry(tg, cfs_rq, se, i, parent->se[i]);
11956 struct sched_entity *parent)
11972 if (!parent) {
11976 se->cfs_rq = parent->my_q;
11977 se->depth = parent->depth + 1;
11983 se->parent = parent;
12032 int alloc_fair_sched_group(struct task_group *tg, struct task_group *parent)