sched_clock.c 8.3 KB
Newer Older
1
/*
2 3
 * sched_clock.c: Generic sched_clock() support, to extend low level
 *                hardware time counters to full 64-bit ns values.
4 5 6 7 8 9 10 11
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */
#include <linux/clocksource.h>
#include <linux/init.h>
#include <linux/jiffies.h>
12
#include <linux/ktime.h>
13
#include <linux/kernel.h>
14
#include <linux/moduleparam.h>
15
#include <linux/sched.h>
16
#include <linux/sched/clock.h>
17
#include <linux/syscore_ops.h>
18
#include <linux/hrtimer.h>
19
#include <linux/sched_clock.h>
20
#include <linux/seqlock.h>
21
#include <linux/bitops.h>
22

23
/**
24
 * struct clock_read_data - data required to read from sched_clock()
25
 *
26 27
 * @epoch_ns:		sched_clock() value at last update
 * @epoch_cyc:		Clock cycle value at last update.
28
 * @sched_clock_mask:   Bitmask for two's complement subtraction of non 64bit
29 30 31 32
 *			clocks.
 * @read_sched_clock:	Current clock source (or dummy source when suspended).
 * @mult:		Multipler for scaled math conversion.
 * @shift:		Shift value for scaled math conversion.
33 34
 *
 * Care must be taken when updating this structure; it is read by
35
 * some very hot code paths. It occupies <=40 bytes and, when combined
36 37 38 39
 * with the seqcount used to synchronize access, comfortably fits into
 * a 64 byte cache line.
 */
struct clock_read_data {
40
	u64 epoch_ns;
41
	u64 epoch_cyc;
42 43
	u64 sched_clock_mask;
	u64 (*read_sched_clock)(void);
44 45 46 47
	u32 mult;
	u32 shift;
};

48
/**
49
 * struct clock_data - all data needed for sched_clock() (including
50 51
 *                     registration of a new clock source)
 *
52 53
 * @seq:		Sequence counter for protecting updates. The lowest
 *			bit is the index for @read_data.
54
 * @read_data:		Data required to read from sched_clock.
55 56 57
 * @wrap_kt:		Duration for which clock can run before wrapping.
 * @rate:		Tick rate of the registered clock.
 * @actual_read_sched_clock: Registered hardware level clock read function.
58 59
 *
 * The ordering of this structure has been chosen to optimize cache
60 61
 * performance. In particular 'seq' and 'read_data[0]' (combined) should fit
 * into a single 64-byte cache line.
62 63
 */
struct clock_data {
64 65 66 67 68
	seqcount_t		seq;
	struct clock_read_data	read_data[2];
	ktime_t			wrap_kt;
	unsigned long		rate;

69
	u64 (*actual_read_sched_clock)(void);
70 71
};

72
static struct hrtimer sched_clock_timer;
73 74 75
static int irqtime = -1;

core_param(irqtime, irqtime, int, 0400);
76

77
static u64 notrace jiffy_sched_clock_read(void)
78
{
79 80 81 82 83 84 85
	/*
	 * We don't need to use get_jiffies_64 on 32-bit arches here
	 * because we register with BITS_PER_LONG
	 */
	return (u64)(jiffies - INITIAL_JIFFIES);
}

86
static struct clock_data cd ____cacheline_aligned = {
87 88
	.read_data[0] = { .mult = NSEC_PER_SEC / HZ,
			  .read_sched_clock = jiffy_sched_clock_read, },
89
	.actual_read_sched_clock = jiffy_sched_clock_read,
90
};
91

92
static inline u64 notrace cyc_to_ns(u64 cyc, u32 mult, u32 shift)
93 94 95 96
{
	return (cyc * mult) >> shift;
}

97
unsigned long long notrace sched_clock(void)
98
{
99
	u64 cyc, res;
100
	unsigned long seq;
101
	struct clock_read_data *rd;
102

103
	do {
104 105
		seq = raw_read_seqcount(&cd.seq);
		rd = cd.read_data + (seq & 1);
106

107 108 109
		cyc = (rd->read_sched_clock() - rd->epoch_cyc) &
		      rd->sched_clock_mask;
		res = rd->epoch_ns + cyc_to_ns(cyc, rd->mult, rd->shift);
110
	} while (read_seqcount_retry(&cd.seq, seq));
111

112
	return res;
113 114
}

115 116 117
/*
 * Updating the data required to read the clock.
 *
118
 * sched_clock() will never observe mis-matched data even if called from
119
 * an NMI. We do this by maintaining an odd/even copy of the data and
120 121
 * steering sched_clock() to one or the other using a sequence counter.
 * In order to preserve the data cache profile of sched_clock() as much
122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
 * as possible the system reverts back to the even copy when the update
 * completes; the odd copy is used *only* during an update.
 */
static void update_clock_read_data(struct clock_read_data *rd)
{
	/* update the backup (odd) copy with the new data */
	cd.read_data[1] = *rd;

	/* steer readers towards the odd copy */
	raw_write_seqcount_latch(&cd.seq);

	/* now its safe for us to update the normal (even) copy */
	cd.read_data[0] = *rd;

	/* switch readers back to the even copy */
	raw_write_seqcount_latch(&cd.seq);
}

140
/*
141
 * Atomically update the sched_clock() epoch.
142
 */
143
static void update_sched_clock(void)
144
{
145
	u64 cyc;
146
	u64 ns;
147 148 149
	struct clock_read_data rd;

	rd = cd.read_data[0];
150

151
	cyc = cd.actual_read_sched_clock();
152
	ns = rd.epoch_ns + cyc_to_ns((cyc - rd.epoch_cyc) & rd.sched_clock_mask, rd.mult, rd.shift);
153 154 155 156 157

	rd.epoch_ns = ns;
	rd.epoch_cyc = cyc;

	update_clock_read_data(&rd);
158
}
159

160
static enum hrtimer_restart sched_clock_poll(struct hrtimer *hrt)
161
{
162
	update_sched_clock();
163
	hrtimer_forward_now(hrt, cd.wrap_kt);
164

165
	return HRTIMER_RESTART;
166 167
}

168 169
void __init
sched_clock_register(u64 (*read)(void), int bits, unsigned long rate)
170
{
171 172
	u64 res, wrap, new_mask, new_epoch, cyc, ns;
	u32 new_mult, new_shift;
173
	unsigned long r;
174
	char r_unit;
175
	struct clock_read_data rd;
176

177 178 179
	if (cd.rate > rate)
		return;

180
	WARN_ON(!irqs_disabled());
181

182
	/* Calculate the mult/shift to convert counter ticks to ns. */
183 184 185
	clocks_calc_mult_shift(&new_mult, &new_shift, rate, NSEC_PER_SEC, 3600);

	new_mask = CLOCKSOURCE_MASK(bits);
186
	cd.rate = rate;
187

188
	/* Calculate how many nanosecs until we risk wrapping */
189
	wrap = clocks_calc_max_nsecs(new_mult, new_shift, 0, new_mask, NULL);
190
	cd.wrap_kt = ns_to_ktime(wrap);
191

192 193
	rd = cd.read_data[0];

194
	/* Update epoch for new counter and update 'epoch_ns' from old counter*/
195
	new_epoch = read();
196
	cyc = cd.actual_read_sched_clock();
197
	ns = rd.epoch_ns + cyc_to_ns((cyc - rd.epoch_cyc) & rd.sched_clock_mask, rd.mult, rd.shift);
198
	cd.actual_read_sched_clock = read;
199

200 201 202 203 204 205 206
	rd.read_sched_clock	= read;
	rd.sched_clock_mask	= new_mask;
	rd.mult			= new_mult;
	rd.shift		= new_shift;
	rd.epoch_cyc		= new_epoch;
	rd.epoch_ns		= ns;

207
	update_clock_read_data(&rd);
208

209 210 211 212 213
	if (sched_clock_timer.function != NULL) {
		/* update timeout for clock wrap */
		hrtimer_start(&sched_clock_timer, cd.wrap_kt, HRTIMER_MODE_REL);
	}

214 215 216 217
	r = rate;
	if (r >= 4000000) {
		r /= 1000000;
		r_unit = 'M';
218 219 220 221 222 223 224 225 226 227
	} else {
		if (r >= 1000) {
			r /= 1000;
			r_unit = 'k';
		} else {
			r_unit = ' ';
		}
	}

	/* Calculate the ns resolution of this counter */
228 229
	res = cyc_to_ns(1ULL, new_mult, new_shift);

230 231
	pr_info("sched_clock: %u bits at %lu%cHz, resolution %lluns, wraps every %lluns\n",
		bits, r, r_unit, res, wrap);
232

233
	/* Enable IRQ time accounting if we have a fast enough sched_clock() */
234 235 236
	if (irqtime > 0 || (irqtime == -1 && rate >= 1000000))
		enable_sched_clock_irqtime();

237 238 239
	pr_debug("Registered %pF as sched_clock source\n", read);
}

240
void __init generic_sched_clock_init(void)
241
{
242
	/*
243
	 * If no sched_clock() function has been provided at that point,
244 245
	 * make it the final one one.
	 */
246
	if (cd.actual_read_sched_clock == jiffy_sched_clock_read)
247
		sched_clock_register(jiffy_sched_clock_read, BITS_PER_LONG, HZ);
248

249 250 251 252 253 254 255 256 257
	update_sched_clock();

	/*
	 * Start the timer to keep sched_clock() properly updated and
	 * sets the initial epoch.
	 */
	hrtimer_init(&sched_clock_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL);
	sched_clock_timer.function = sched_clock_poll;
	hrtimer_start(&sched_clock_timer, cd.wrap_kt, HRTIMER_MODE_REL);
258
}
259

260 261 262 263 264
/*
 * Clock read function for use when the clock is suspended.
 *
 * This function makes it appear to sched_clock() as if the clock
 * stopped counting at its last update.
265 266 267 268
 *
 * This function must only be called from the critical
 * section in sched_clock(). It relies on the read_seqcount_retry()
 * at the end of the critical section to be sure we observe the
269
 * correct copy of 'epoch_cyc'.
270 271 272
 */
static u64 notrace suspended_sched_clock_read(void)
{
273 274 275
	unsigned long seq = raw_read_seqcount(&cd.seq);

	return cd.read_data[seq & 1].epoch_cyc;
276 277
}

278
int sched_clock_suspend(void)
279
{
280
	struct clock_read_data *rd = &cd.read_data[0];
281

282 283
	update_sched_clock();
	hrtimer_cancel(&sched_clock_timer);
284
	rd->read_sched_clock = suspended_sched_clock_read;
285

286 287 288
	return 0;
}

289
void sched_clock_resume(void)
290
{
291
	struct clock_read_data *rd = &cd.read_data[0];
292

293
	rd->epoch_cyc = cd.actual_read_sched_clock();
294
	hrtimer_start(&sched_clock_timer, cd.wrap_kt, HRTIMER_MODE_REL);
295
	rd->read_sched_clock = cd.actual_read_sched_clock;
296 297
}

298
static struct syscore_ops sched_clock_ops = {
299 300
	.suspend	= sched_clock_suspend,
	.resume		= sched_clock_resume,
301 302 303 304 305
};

static int __init sched_clock_syscore_init(void)
{
	register_syscore_ops(&sched_clock_ops);
306

307 308 309
	return 0;
}
device_initcall(sched_clock_syscore_init);