| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 1 | /* | 
|  | 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> | 
| Frederic Weisbecker | ae1f303 | 2010-02-28 19:42:38 +0100 | [diff] [blame] | 16 | #include <linux/irqflags.h> | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 17 | #include <linux/hardirq.h> | 
|  | 18 | #include <linux/module.h> | 
|  | 19 | #include <linux/percpu.h> | 
|  | 20 | #include <linux/sched.h> | 
|  | 21 | #include <linux/ktime.h> | 
| Dmitri Vorobiev | b8b9426 | 2009-03-22 19:11:11 +0200 | [diff] [blame] | 22 | #include <linux/trace_clock.h> | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 23 |  | 
| Steven Rostedt | 8b2a5da | 2009-11-11 19:36:03 -0500 | [diff] [blame] | 24 | #include "trace.h" | 
|  | 25 |  | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 26 | /* | 
|  | 27 | * trace_clock_local(): the simplest and least coherent tracing clock. | 
|  | 28 | * | 
|  | 29 | * Useful for tracing that does not cross to other CPUs nor | 
|  | 30 | * does it go through idle events. | 
|  | 31 | */ | 
|  | 32 | u64 notrace trace_clock_local(void) | 
|  | 33 | { | 
| Peter Zijlstra | 6cc3c6e | 2009-03-10 19:03:43 +0100 | [diff] [blame] | 34 | u64 clock; | 
|  | 35 |  | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 36 | /* | 
|  | 37 | * sched_clock() is an architecture implemented, fast, scalable, | 
|  | 38 | * lockless clock. It is not guaranteed to be coherent across | 
|  | 39 | * CPUs, nor across CPU idle events. | 
|  | 40 | */ | 
| Steven Rostedt | 5168ae5 | 2010-06-03 09:36:50 -0400 | [diff] [blame] | 41 | preempt_disable_notrace(); | 
| Peter Zijlstra | 6cc3c6e | 2009-03-10 19:03:43 +0100 | [diff] [blame] | 42 | clock = sched_clock(); | 
| Steven Rostedt | 5168ae5 | 2010-06-03 09:36:50 -0400 | [diff] [blame] | 43 | preempt_enable_notrace(); | 
| Peter Zijlstra | 6cc3c6e | 2009-03-10 19:03:43 +0100 | [diff] [blame] | 44 |  | 
|  | 45 | return clock; | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 46 | } | 
|  | 47 |  | 
|  | 48 | /* | 
| Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 49 | * trace_clock(): 'between' trace clock. Not completely serialized, | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 50 | * but not completely incorrect when crossing CPUs either. | 
|  | 51 | * | 
|  | 52 | * This is based on cpu_clock(), which will allow at most ~1 jiffy of | 
|  | 53 | * jitter between CPUs. So it's a pretty scalable clock, but there | 
|  | 54 | * can be offsets in the trace data. | 
|  | 55 | */ | 
|  | 56 | u64 notrace trace_clock(void) | 
|  | 57 | { | 
| Peter Zijlstra | c676329 | 2010-05-25 10:48:51 +0200 | [diff] [blame] | 58 | return local_clock(); | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 59 | } | 
|  | 60 |  | 
|  | 61 |  | 
|  | 62 | /* | 
|  | 63 | * trace_clock_global(): special globally coherent trace clock | 
|  | 64 | * | 
|  | 65 | * It has higher overhead than the other trace clocks but is still | 
|  | 66 | * an order of magnitude faster than GTOD derived hardware clocks. | 
|  | 67 | * | 
|  | 68 | * Used by plugins that need globally coherent timestamps. | 
|  | 69 | */ | 
|  | 70 |  | 
| Steven Rostedt | 6ca6cca | 2009-09-15 12:24:22 -0400 | [diff] [blame] | 71 | /* keep prev_time and lock in the same cacheline. */ | 
|  | 72 | static struct { | 
|  | 73 | u64 prev_time; | 
| Thomas Gleixner | 445c895 | 2009-12-02 19:49:50 +0100 | [diff] [blame] | 74 | arch_spinlock_t lock; | 
| Steven Rostedt | 6ca6cca | 2009-09-15 12:24:22 -0400 | [diff] [blame] | 75 | } trace_clock_struct ____cacheline_aligned_in_smp = | 
|  | 76 | { | 
| Thomas Gleixner | edc35bd | 2009-12-03 12:38:57 +0100 | [diff] [blame] | 77 | .lock = (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED, | 
| Steven Rostedt | 6ca6cca | 2009-09-15 12:24:22 -0400 | [diff] [blame] | 78 | }; | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 79 |  | 
|  | 80 | u64 notrace trace_clock_global(void) | 
|  | 81 | { | 
|  | 82 | unsigned long flags; | 
|  | 83 | int this_cpu; | 
|  | 84 | u64 now; | 
|  | 85 |  | 
| Li Zefan | e36673e | 2010-03-24 10:57:37 +0800 | [diff] [blame] | 86 | local_irq_save(flags); | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 87 |  | 
|  | 88 | this_cpu = raw_smp_processor_id(); | 
|  | 89 | now = cpu_clock(this_cpu); | 
|  | 90 | /* | 
|  | 91 | * If in an NMI context then dont risk lockups and return the | 
|  | 92 | * cpu_clock() time: | 
|  | 93 | */ | 
|  | 94 | if (unlikely(in_nmi())) | 
|  | 95 | goto out; | 
|  | 96 |  | 
| Thomas Gleixner | 0199c4e | 2009-12-02 20:01:25 +0100 | [diff] [blame] | 97 | arch_spin_lock(&trace_clock_struct.lock); | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 98 |  | 
|  | 99 | /* | 
|  | 100 | * TODO: if this happens often then maybe we should reset | 
| Steven Rostedt | 6ca6cca | 2009-09-15 12:24:22 -0400 | [diff] [blame] | 101 | * my_scd->clock to prev_time+1, to make sure | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 102 | * we start ticking with the local clock from now on? | 
|  | 103 | */ | 
| Steven Rostedt | 6ca6cca | 2009-09-15 12:24:22 -0400 | [diff] [blame] | 104 | if ((s64)(now - trace_clock_struct.prev_time) < 0) | 
|  | 105 | now = trace_clock_struct.prev_time + 1; | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 106 |  | 
| Steven Rostedt | 6ca6cca | 2009-09-15 12:24:22 -0400 | [diff] [blame] | 107 | trace_clock_struct.prev_time = now; | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 108 |  | 
| Thomas Gleixner | 0199c4e | 2009-12-02 20:01:25 +0100 | [diff] [blame] | 109 | arch_spin_unlock(&trace_clock_struct.lock); | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 110 |  | 
|  | 111 | out: | 
| Li Zefan | e36673e | 2010-03-24 10:57:37 +0800 | [diff] [blame] | 112 | local_irq_restore(flags); | 
| Ingo Molnar | 14131f2 | 2009-02-26 18:47:11 +0100 | [diff] [blame] | 113 |  | 
|  | 114 | return now; | 
|  | 115 | } | 
| Steven Rostedt | 6249687 | 2011-09-19 11:35:58 -0400 | [diff] [blame] | 116 |  | 
|  | 117 | static atomic64_t trace_counter; | 
|  | 118 |  | 
|  | 119 | /* | 
|  | 120 | * trace_clock_counter(): simply an atomic counter. | 
|  | 121 | * Use the trace_counter "counter" for cases where you do not care | 
|  | 122 | * about timings, but are interested in strict ordering. | 
|  | 123 | */ | 
|  | 124 | u64 notrace trace_clock_counter(void) | 
|  | 125 | { | 
|  | 126 | return atomic64_add_return(1, &trace_counter); | 
|  | 127 | } |