stats.h 5.3 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
2 3

#ifdef CONFIG_SCHEDSTATS
4

5 6 7 8 9 10 11 12
/*
 * Expects runqueue lock to be held for atomicity of update
 */
static inline void
rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
{
	if (rq) {
		rq->rq_sched_info.run_delay += delta;
13
		rq->rq_sched_info.pcount++;
14 15 16 17 18 19 20 21 22 23
	}
}

/*
 * Expects runqueue lock to be held for atomicity of update
 */
static inline void
rq_sched_info_depart(struct rq *rq, unsigned long long delta)
{
	if (rq)
24
		rq->rq_cpu_time += delta;
25
}
26 27 28 29 30 31 32

static inline void
rq_sched_info_dequeued(struct rq *rq, unsigned long long delta)
{
	if (rq)
		rq->rq_sched_info.run_delay += delta;
}
33
#define schedstat_enabled()		static_branch_unlikely(&sched_schedstats)
34
#define __schedstat_inc(var)		do { var++; } while (0)
35
#define schedstat_inc(var)		do { if (schedstat_enabled()) { var++; } } while (0)
36
#define __schedstat_add(var, amt)	do { var += (amt); } while (0)
37
#define schedstat_add(var, amt)		do { if (schedstat_enabled()) { var += (amt); } } while (0)
38
#define __schedstat_set(var, val)		do { var = (val); } while (0)
39
#define schedstat_set(var, val)		do { if (schedstat_enabled()) { var = (val); } } while (0)
40 41
#define schedstat_val(var)		(var)
#define schedstat_val_or_zero(var)	((schedstat_enabled()) ? (var) : 0)
42

43 44 45 46 47
#else /* !CONFIG_SCHEDSTATS */
static inline void
rq_sched_info_arrive(struct rq *rq, unsigned long long delta)
{}
static inline void
48 49 50
rq_sched_info_dequeued(struct rq *rq, unsigned long long delta)
{}
static inline void
51 52
rq_sched_info_depart(struct rq *rq, unsigned long long delta)
{}
53
#define schedstat_enabled()		0
54
#define __schedstat_inc(var)		do { } while (0)
55
#define schedstat_inc(var)		do { } while (0)
56
#define __schedstat_add(var, amt)	do { } while (0)
57
#define schedstat_add(var, amt)		do { } while (0)
58
#define __schedstat_set(var, val)	do { } while (0)
59 60
#define schedstat_set(var, val)		do { } while (0)
#define schedstat_val(var)		0
61
#define schedstat_val_or_zero(var)	0
62
#endif /* CONFIG_SCHEDSTATS */
63

64
#ifdef CONFIG_SCHED_INFO
65 66 67 68 69
static inline void sched_info_reset_dequeued(struct task_struct *t)
{
	t->sched_info.last_queued = 0;
}

70
/*
71
 * We are interested in knowing how long it was from the *first* time a
72 73 74
 * task was queued to the time that it finally hit a cpu, we call this routine
 * from dequeue_task() to account for possible rq->clock skew across cpus. The
 * delta taken on each cpu would annul the skew.
75
 */
76
static inline void sched_info_dequeued(struct rq *rq, struct task_struct *t)
77
{
78
	unsigned long long now = rq_clock(rq), delta = 0;
79 80 81 82 83 84 85

	if (unlikely(sched_info_on()))
		if (t->sched_info.last_queued)
			delta = now - t->sched_info.last_queued;
	sched_info_reset_dequeued(t);
	t->sched_info.run_delay += delta;

86
	rq_sched_info_dequeued(rq, delta);
87 88 89 90 91 92 93
}

/*
 * Called when a task finally hits the cpu.  We can now calculate how
 * long it was waiting to run.  We also note when it began so that we
 * can keep stats on how long its timeslice is.
 */
94
static void sched_info_arrive(struct rq *rq, struct task_struct *t)
95
{
96
	unsigned long long now = rq_clock(rq), delta = 0;
97 98 99

	if (t->sched_info.last_queued)
		delta = now - t->sched_info.last_queued;
100
	sched_info_reset_dequeued(t);
101 102
	t->sched_info.run_delay += delta;
	t->sched_info.last_arrival = now;
103
	t->sched_info.pcount++;
104

105
	rq_sched_info_arrive(rq, delta);
106 107 108 109 110 111 112
}

/*
 * This function is only called from enqueue_task(), but also only updates
 * the timestamp if it is already not set.  It's assumed that
 * sched_info_dequeued() will clear that stamp when appropriate.
 */
113
static inline void sched_info_queued(struct rq *rq, struct task_struct *t)
114 115 116
{
	if (unlikely(sched_info_on()))
		if (!t->sched_info.last_queued)
117
			t->sched_info.last_queued = rq_clock(rq);
118 119 120
}

/*
121 122 123
 * Called when a process ceases being the active-running process involuntarily
 * due, typically, to expiring its time slice (this may also be called when
 * switching to the idle task).  Now we can calculate how long we ran.
124 125 126
 * Also, if the process is still in the TASK_RUNNING state, call
 * sched_info_queued() to mark that it has now again started waiting on
 * the runqueue.
127
 */
128
static inline void sched_info_depart(struct rq *rq, struct task_struct *t)
129
{
130
	unsigned long long delta = rq_clock(rq) -
131
					t->sched_info.last_arrival;
132

133
	rq_sched_info_depart(rq, delta);
134 135

	if (t->state == TASK_RUNNING)
136
		sched_info_queued(rq, t);
137 138 139 140 141 142 143 144
}

/*
 * Called when tasks are switched involuntarily due, typically, to expiring
 * their time slice.  (This may also be called when switching to or from
 * the idle task.)  We are only called when prev != next.
 */
static inline void
145 146
__sched_info_switch(struct rq *rq,
		    struct task_struct *prev, struct task_struct *next)
147 148 149 150 151 152 153
{
	/*
	 * prev now departs the cpu.  It's not interesting to record
	 * stats about how efficient we were at scheduling the idle
	 * process, however.
	 */
	if (prev != rq->idle)
154
		sched_info_depart(rq, prev);
155 156

	if (next != rq->idle)
157
		sched_info_arrive(rq, next);
158 159
}
static inline void
160 161
sched_info_switch(struct rq *rq,
		  struct task_struct *prev, struct task_struct *next)
162 163
{
	if (unlikely(sched_info_on()))
164
		__sched_info_switch(rq, prev, next);
165 166
}
#else
167
#define sched_info_queued(rq, t)		do { } while (0)
168
#define sched_info_reset_dequeued(t)	do { } while (0)
169 170 171 172
#define sched_info_dequeued(rq, t)		do { } while (0)
#define sched_info_depart(rq, t)		do { } while (0)
#define sched_info_arrive(rq, next)		do { } while (0)
#define sched_info_switch(rq, t, next)		do { } while (0)
173
#endif /* CONFIG_SCHED_INFO */