Second preparatory patch for fix-ideal runtime: Mark prev_sum_exec_runtime at the beginning of our run, the same spot that adds our wait period to wait_runtime. This seems a more natural location to do this, and it also reduces the code a bit: text data bss dec hex filename 13397 228 1204 14829 39ed sched.o.before 13391 228 1204 14823 39e7 sched.o.after
Unified · Split
| @@ -684,10 +684,8 @@ __check_preempt_curr_fair(struct cfs_rq *cfs_rq, struct sched_entity *se, · 683 unmodified lines | ||
| 684 | 684 | * preempt the current task unless the best task has |
| 685 | 685 | * a larger than sched_granularity fairness advantage: |
| 686 | 686 | */ |
| 687 | − if (__delta > niced_granularity(curr, granularity)) { | |
| 687 | + if (__delta > niced_granularity(curr, granularity)) | |
| 688 | 688 | resched_task(rq_of(cfs_rq)->curr); |
| 689 | − curr->prev_sum_exec_runtime = curr->sum_exec_runtime; | |
| 690 | − } | |
| 691 | 689 | } |
| 692 | 690 | |
| 693 | 691 | static inline void |
| @@ -703,6 +701,7 @@ set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) · 9 unmodified lines | ||
| 703 | 701 | update_stats_wait_end(cfs_rq, se); |
| 704 | 702 | update_stats_curr_start(cfs_rq, se); |
| 705 | 703 | set_cfs_rq_curr(cfs_rq, se); |
| 704 | + se->prev_sum_exec_runtime = se->sum_exec_runtime; | |
| 706 | 705 | } |
| 707 | 706 | |
| 708 | 707 | static struct sched_entity *pick_next_entity(struct cfs_rq *cfs_rq) |