Lines Matching refs:se
168 struct sched_entity **se;
189 .se = init_sched_entity_p,
220 p->se.cfs_rq = task_group(p)->cfs_rq[cpu];
221 p->se.parent = task_group(p)->se[cpu];
901 update_load_add(&rq->load, p->se.load.weight);
906 update_load_sub(&rq->load, p->se.load.weight);
924 p->se.load.weight = prio_to_weight[0] * 2;
925 p->se.load.inv_weight = prio_to_wmult[0] >> 1;
933 p->se.load.weight = WEIGHT_IDLEPRIO;
934 p->se.load.inv_weight = WMULT_IDLEPRIO;
938 p->se.load.weight = prio_to_weight[p->static_prio - MAX_RT_PRIO];
939 p->se.load.inv_weight = prio_to_wmult[p->static_prio - MAX_RT_PRIO];
946 p->se.on_rq = 1;
952 p->se.on_rq = 0;
1072 delta = now - p->se.exec_start;
1089 if (p->se.wait_start)
1090 p->se.wait_start -= clock_offset;
1091 if (p->se.sleep_start)
1092 p->se.sleep_start -= clock_offset;
1093 if (p->se.block_start)
1094 p->se.block_start -= clock_offset;
1096 schedstat_inc(p, se.nr_migrations);
1098 schedstat_inc(p, se.nr_forced2_migrations);
1101 p->se.vruntime -= old_cfsrq->min_vruntime -
1129 if (!p->se.on_rq && !task_running(rq, p)) {
1187 on_rq = p->se.on_rq;
1475 se.nr_wakeups_idle);
1524 if (p->se.on_rq)
1578 schedstat_inc(p, se.nr_wakeups_affine_attempts);
1587 tl -= current->se.load.weight;
1591 100*(tl + p->se.load.weight) <= imbalance*load) {
1598 schedstat_inc(p, se.nr_wakeups_affine);
1610 schedstat_inc(p, se.nr_wakeups_passive);
1627 if (p->se.on_rq)
1636 schedstat_inc(p, se.nr_wakeups);
1638 schedstat_inc(p, se.nr_wakeups_sync);
1640 schedstat_inc(p, se.nr_wakeups_migrate);
1642 schedstat_inc(p, se.nr_wakeups_local);
1644 schedstat_inc(p, se.nr_wakeups_remote);
1678 p->se.exec_start = 0;
1679 p->se.sum_exec_runtime = 0;
1680 p->se.prev_sum_exec_runtime = 0;
1683 p->se.wait_start = 0;
1684 p->se.sum_sleep_runtime = 0;
1685 p->se.sleep_start = 0;
1686 p->se.block_start = 0;
1687 p->se.sleep_max = 0;
1688 p->se.block_max = 0;
1689 p->se.exec_max = 0;
1690 p->se.slice_max = 0;
1691 p->se.wait_max = 0;
1695 p->se.on_rq = 0;
1763 if (!p->sched_class->task_new || !current->se.on_rq) {
2226 schedstat_inc(p, se.nr_failed_migrations_affine);
2232 schedstat_inc(p, se.nr_failed_migrations_running);
2247 schedstat_inc(p, se.nr_forced_migrations);
2254 schedstat_inc(p, se.nr_failed_migrations_hot);
2287 skip_for_load = (p->se.load.weight >> 1) > rem_load_move +
2297 rem_load_move -= p->se.load.weight;
3342 ns = p->se.sum_exec_runtime;
3345 delta_exec = rq->clock - p->se.exec_start;
4029 on_rq = p->se.on_rq;
4089 on_rq = p->se.on_rq;
4226 BUG_ON(p->se.on_rq);
4340 on_rq = p->se.on_rq;
4872 struct sched_entity *se = &p->se;
4878 time_slice = NS_TO_JIFFIES(sched_slice(&rq->cfs, se));
4981 idle->se.exec_start = sched_clock();
5130 on_rq = p->se.on_rq;
6770 struct sched_entity *se =
6779 init_sched_entity_p[i] = se;
6780 se->cfs_rq = &rq->cfs;
6781 se->my_q = cfs_rq;
6782 se->load.weight = init_task_group_load;
6783 se->load.inv_weight =
6785 se->parent = NULL;
6878 on_rq = p->se.on_rq;
6902 p->se.exec_start = 0;
6904 p->se.wait_start = 0;
6905 p->se.sleep_start = 0;
6906 p->se.block_start = 0;
6985 struct sched_entity *se;
6996 tg->se = kzalloc(sizeof(se) * NR_CPUS, GFP_KERNEL);
6997 if (!tg->se)
7008 se = kmalloc_node(sizeof(struct sched_entity), GFP_KERNEL,
7010 if (!se)
7014 memset(se, 0, sizeof(struct sched_entity));
7020 tg->se[i] = se;
7021 se->cfs_rq = &rq->cfs;
7022 se->my_q = cfs_rq;
7023 se->load.weight = NICE_0_LOAD;
7024 se->load.inv_weight = div64_64(1ULL<<32, NICE_0_LOAD);
7025 se->parent = NULL;
7043 if (tg->se)
7044 kfree(tg->se[i]);
7047 kfree(tg->se);
7058 struct sched_entity *se;
7066 se = tg->se[i];
7067 kfree(se);
7071 kfree(tg->se);
7094 * by now. This function just updates tsk->se.cfs_rq and tsk->se.parent to
7113 on_rq = tsk->se.on_rq;
7133 static void set_se_shares(struct sched_entity *se, unsigned long shares)
7135 struct cfs_rq *cfs_rq = se->cfs_rq;
7141 on_rq = se->on_rq;
7143 dequeue_entity(cfs_rq, se, 0);
7145 se->load.weight = shares;
7146 se->load.inv_weight = div64_64((1ULL<<32), shares);
7149 enqueue_entity(cfs_rq, se, 0);
7164 set_se_shares(tg->se[i], shares);