blob: 20c5f92e28a8864cc3ca188cc1205200a89b6c55 [file] [log] [blame]
Ingo Molnar14131f22009-02-26 18:47:11 +01001/*
2 * tracing clocks
3 *
4 * Copyright (C) 2009 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
5 *
6 * Implements 3 trace clock variants, with differing scalability/precision
7 * tradeoffs:
8 *
9 * - local: CPU-local trace clock
10 * - medium: scalable global clock with some jitter
11 * - global: globally monotonic, serialized clock
12 *
13 * Tracer plugins will chose a default from these clocks.
14 */
15#include <linux/spinlock.h>
16#include <linux/hardirq.h>
17#include <linux/module.h>
18#include <linux/percpu.h>
19#include <linux/sched.h>
20#include <linux/ktime.h>
Dmitri Vorobievb8b94262009-03-22 19:11:11 +020021#include <linux/trace_clock.h>
Ingo Molnar14131f22009-02-26 18:47:11 +010022
23/*
24 * trace_clock_local(): the simplest and least coherent tracing clock.
25 *
26 * Useful for tracing that does not cross to other CPUs nor
27 * does it go through idle events.
28 */
29u64 notrace trace_clock_local(void)
30{
Peter Zijlstra6cc3c6e2009-03-10 19:03:43 +010031 unsigned long flags;
32 u64 clock;
33
Ingo Molnar14131f22009-02-26 18:47:11 +010034 /*
35 * sched_clock() is an architecture implemented, fast, scalable,
36 * lockless clock. It is not guaranteed to be coherent across
37 * CPUs, nor across CPU idle events.
38 */
Peter Zijlstra6cc3c6e2009-03-10 19:03:43 +010039 raw_local_irq_save(flags);
40 clock = sched_clock();
41 raw_local_irq_restore(flags);
42
43 return clock;
Ingo Molnar14131f22009-02-26 18:47:11 +010044}
45
46/*
47 * trace_clock(): 'inbetween' trace clock. Not completely serialized,
48 * but not completely incorrect when crossing CPUs either.
49 *
50 * This is based on cpu_clock(), which will allow at most ~1 jiffy of
51 * jitter between CPUs. So it's a pretty scalable clock, but there
52 * can be offsets in the trace data.
53 */
54u64 notrace trace_clock(void)
55{
56 return cpu_clock(raw_smp_processor_id());
57}
58
59
60/*
61 * trace_clock_global(): special globally coherent trace clock
62 *
63 * It has higher overhead than the other trace clocks but is still
64 * an order of magnitude faster than GTOD derived hardware clocks.
65 *
66 * Used by plugins that need globally coherent timestamps.
67 */
68
Steven Rostedt6ca6cca2009-09-15 12:24:22 -040069/* keep prev_time and lock in the same cacheline. */
70static struct {
71 u64 prev_time;
72 raw_spinlock_t lock;
73} trace_clock_struct ____cacheline_aligned_in_smp =
74 {
75 .lock = (raw_spinlock_t)__RAW_SPIN_LOCK_UNLOCKED,
76 };
Ingo Molnar14131f22009-02-26 18:47:11 +010077
78u64 notrace trace_clock_global(void)
79{
80 unsigned long flags;
81 int this_cpu;
82 u64 now;
83
84 raw_local_irq_save(flags);
85
86 this_cpu = raw_smp_processor_id();
87 now = cpu_clock(this_cpu);
88 /*
89 * If in an NMI context then dont risk lockups and return the
90 * cpu_clock() time:
91 */
92 if (unlikely(in_nmi()))
93 goto out;
94
Steven Rostedt6ca6cca2009-09-15 12:24:22 -040095 __raw_spin_lock(&trace_clock_struct.lock);
Ingo Molnar14131f22009-02-26 18:47:11 +010096
97 /*
98 * TODO: if this happens often then maybe we should reset
Steven Rostedt6ca6cca2009-09-15 12:24:22 -040099 * my_scd->clock to prev_time+1, to make sure
Ingo Molnar14131f22009-02-26 18:47:11 +0100100 * we start ticking with the local clock from now on?
101 */
Steven Rostedt6ca6cca2009-09-15 12:24:22 -0400102 if ((s64)(now - trace_clock_struct.prev_time) < 0)
103 now = trace_clock_struct.prev_time + 1;
Ingo Molnar14131f22009-02-26 18:47:11 +0100104
Steven Rostedt6ca6cca2009-09-15 12:24:22 -0400105 trace_clock_struct.prev_time = now;
Ingo Molnar14131f22009-02-26 18:47:11 +0100106
Steven Rostedt6ca6cca2009-09-15 12:24:22 -0400107 __raw_spin_unlock(&trace_clock_struct.lock);
Ingo Molnar14131f22009-02-26 18:47:11 +0100108
109 out:
110 raw_local_irq_restore(flags);
111
112 return now;
113}