2008-05-12 19:20:44 +00:00
|
|
|
/* Include in trace.c */
|
|
|
|
|
2009-03-09 20:00:22 +00:00
|
|
|
#include <linux/stringify.h>
|
2008-05-12 19:20:44 +00:00
|
|
|
#include <linux/kthread.h>
|
2008-05-12 19:20:45 +00:00
|
|
|
#include <linux/delay.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2008-05-12 19:20:51 +00:00
|
|
|
static inline int trace_valid_entry(struct trace_entry *entry)
|
2008-05-12 19:20:44 +00:00
|
|
|
{
|
|
|
|
switch (entry->type) {
|
|
|
|
case TRACE_FN:
|
|
|
|
case TRACE_CTX:
|
2008-05-12 19:20:51 +00:00
|
|
|
case TRACE_WAKE:
|
2008-05-12 19:20:54 +00:00
|
|
|
case TRACE_STACK:
|
2008-08-01 16:26:41 +00:00
|
|
|
case TRACE_PRINT:
|
2008-11-12 20:24:24 +00:00
|
|
|
case TRACE_BRANCH:
|
2009-02-07 20:33:57 +00:00
|
|
|
case TRACE_GRAPH_ENT:
|
|
|
|
case TRACE_GRAPH_RET:
|
2008-05-12 19:20:44 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-09-30 03:02:41 +00:00
|
|
|
static int trace_test_buffer_cpu(struct trace_array *tr, int cpu)
|
2008-05-12 19:20:44 +00:00
|
|
|
{
|
2008-09-30 03:02:41 +00:00
|
|
|
struct ring_buffer_event *event;
|
|
|
|
struct trace_entry *entry;
|
2009-02-19 03:50:01 +00:00
|
|
|
unsigned int loops = 0;
|
2008-05-12 19:20:44 +00:00
|
|
|
|
ring-buffer: Add place holder recording of dropped events
Currently, when the ring buffer drops events, it does not record
the fact that it did so. It does inform the writer that the event
was dropped by returning a NULL event, but it does not put in any
place holder where the event was dropped.
This is not a trivial thing to add because the ring buffer mostly
runs in overwrite (flight recorder) mode. That is, when the ring
buffer is full, new data will overwrite old data.
In a produce/consumer mode, where new data is simply dropped when
the ring buffer is full, it is trivial to add the placeholder
for dropped events. When there's more room to write new data, then
a special event can be added to notify the reader about the dropped
events.
But in overwrite mode, any new write can overwrite events. A place
holder can not be inserted into the ring buffer since there never
may be room. A reader could also come in at anytime and miss the
placeholder.
Luckily, the way the ring buffer works, the read side can find out
if events were lost or not, and how many events. Everytime a write
takes place, if it overwrites the header page (the next read) it
updates a "overrun" variable that keeps track of the number of
lost events. When a reader swaps out a page from the ring buffer,
it can record this number, perfom the swap, and then check to
see if the number changed, and take the diff if it has, which would be
the number of events dropped. This can be stored by the reader
and returned to callers of the reader.
Since the reader page swap will fail if the writer moved the head
page since the time the reader page set up the swap, this gives room
to record the overruns without worrying about races. If the reader
sets up the pages, records the overrun, than performs the swap,
if the swap succeeds, then the overrun variable has not been
updated since the setup before the swap.
For binary readers of the ring buffer, a flag is set in the header
of each sub page (sub buffer) of the ring buffer. This flag is embedded
in the size field of the data on the sub buffer, in the 31st bit (the size
can be 32 or 64 bits depending on the architecture), but only 27
bits needs to be used for the actual size (less actually).
We could add a new field in the sub buffer header to also record the
number of events dropped since the last read, but this will change the
format of the binary ring buffer a bit too much. Perhaps this change can
be made if the information on the number of events dropped is considered
important enough.
Note, the notification of dropped events is only used by consuming reads
or peeking at the ring buffer. Iterating over the ring buffer does not
keep this information because the necessary data is only available when
a page swap is made, and the iterator does not swap out pages.
Cc: Robert Richter <robert.richter@amd.com>
Cc: Andi Kleen <andi@firstfloor.org>
Cc: Li Zefan <lizf@cn.fujitsu.com>
Cc: Arnaldo Carvalho de Melo <acme@redhat.com>
Cc: "Luis Claudio R. Goncalves" <lclaudio@uudg.org>
Cc: Frederic Weisbecker <fweisbec@gmail.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2010-03-31 17:21:56 +00:00
|
|
|
while ((event = ring_buffer_consume(tr->buffer, cpu, NULL, NULL))) {
|
2008-09-30 03:02:41 +00:00
|
|
|
entry = ring_buffer_event_data(event);
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2009-02-19 03:50:01 +00:00
|
|
|
/*
|
|
|
|
* The ring buffer is a size of trace_buf_size, if
|
|
|
|
* we loop more than the size, there's something wrong
|
|
|
|
* with the ring buffer.
|
|
|
|
*/
|
|
|
|
if (loops++ > trace_buf_size) {
|
|
|
|
printk(KERN_CONT ".. bad ring buffer ");
|
|
|
|
goto failed;
|
|
|
|
}
|
2008-09-30 03:02:41 +00:00
|
|
|
if (!trace_valid_entry(entry)) {
|
2008-05-12 19:20:45 +00:00
|
|
|
printk(KERN_CONT ".. invalid entry %d ",
|
2008-09-30 03:02:41 +00:00
|
|
|
entry->type);
|
2008-05-12 19:20:44 +00:00
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
failed:
|
2008-05-12 19:20:45 +00:00
|
|
|
/* disable tracing */
|
|
|
|
tracing_disabled = 1;
|
2008-05-12 19:20:44 +00:00
|
|
|
printk(KERN_CONT ".. corrupted trace buffer .. ");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Test the trace buffer to see if all the elements
|
|
|
|
* are still sane.
|
|
|
|
*/
|
|
|
|
static int trace_test_buffer(struct trace_array *tr, unsigned long *count)
|
|
|
|
{
|
2008-05-12 19:20:56 +00:00
|
|
|
unsigned long flags, cnt = 0;
|
|
|
|
int cpu, ret = 0;
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2008-05-12 19:20:56 +00:00
|
|
|
/* Don't allow flipping of max traces now */
|
2008-11-15 20:48:29 +00:00
|
|
|
local_irq_save(flags);
|
2009-12-02 19:01:25 +00:00
|
|
|
arch_spin_lock(&ftrace_max_lock);
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2008-09-30 03:02:41 +00:00
|
|
|
cnt = ring_buffer_entries(tr->buffer);
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2009-02-18 23:33:57 +00:00
|
|
|
/*
|
|
|
|
* The trace_test_buffer_cpu runs a while loop to consume all data.
|
|
|
|
* If the calling tracer is broken, and is constantly filling
|
|
|
|
* the buffer, this will run forever, and hard lock the box.
|
|
|
|
* We disable the ring buffer while we do this test to prevent
|
|
|
|
* a hard lock up.
|
|
|
|
*/
|
|
|
|
tracing_off();
|
2008-09-30 03:02:41 +00:00
|
|
|
for_each_possible_cpu(cpu) {
|
|
|
|
ret = trace_test_buffer_cpu(tr, cpu);
|
2008-05-12 19:20:44 +00:00
|
|
|
if (ret)
|
|
|
|
break;
|
|
|
|
}
|
2009-02-18 23:33:57 +00:00
|
|
|
tracing_on();
|
2009-12-02 19:01:25 +00:00
|
|
|
arch_spin_unlock(&ftrace_max_lock);
|
2008-11-15 20:48:29 +00:00
|
|
|
local_irq_restore(flags);
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
if (count)
|
|
|
|
*count = cnt;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-11-16 04:57:26 +00:00
|
|
|
static inline void warn_failed_init_tracer(struct tracer *trace, int init_ret)
|
|
|
|
{
|
|
|
|
printk(KERN_WARNING "Failed to init %s tracer, init returned %d\n",
|
|
|
|
trace->name, init_ret);
|
|
|
|
}
|
2008-10-06 23:06:12 +00:00
|
|
|
#ifdef CONFIG_FUNCTION_TRACER
|
2008-05-12 19:20:45 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_DYNAMIC_FTRACE
|
|
|
|
|
|
|
|
/* Test dynamic code modification and ftrace filters */
|
|
|
|
int trace_selftest_startup_dynamic_tracing(struct tracer *trace,
|
|
|
|
struct trace_array *tr,
|
|
|
|
int (*func)(void))
|
|
|
|
{
|
|
|
|
int save_ftrace_enabled = ftrace_enabled;
|
|
|
|
int save_tracer_enabled = tracer_enabled;
|
2008-08-01 16:26:41 +00:00
|
|
|
unsigned long count;
|
2008-05-15 03:49:44 +00:00
|
|
|
char *func_name;
|
2008-08-01 16:26:41 +00:00
|
|
|
int ret;
|
2008-05-12 19:20:45 +00:00
|
|
|
|
|
|
|
/* The ftrace test PASSED */
|
|
|
|
printk(KERN_CONT "PASSED\n");
|
|
|
|
pr_info("Testing dynamic ftrace: ");
|
|
|
|
|
|
|
|
/* enable tracing, and record the filter function */
|
|
|
|
ftrace_enabled = 1;
|
|
|
|
tracer_enabled = 1;
|
|
|
|
|
|
|
|
/* passed in by parameter to fool gcc from optimizing */
|
|
|
|
func();
|
|
|
|
|
2008-05-15 03:49:44 +00:00
|
|
|
/*
|
2009-02-17 06:10:02 +00:00
|
|
|
* Some archs *cough*PowerPC*cough* add characters to the
|
2008-05-15 03:49:44 +00:00
|
|
|
* start of the function names. We simply put a '*' to
|
2009-02-17 06:10:02 +00:00
|
|
|
* accommodate them.
|
2008-05-15 03:49:44 +00:00
|
|
|
*/
|
2009-03-09 20:00:22 +00:00
|
|
|
func_name = "*" __stringify(DYN_FTRACE_TEST_NAME);
|
2008-05-15 03:49:44 +00:00
|
|
|
|
2008-05-12 19:20:45 +00:00
|
|
|
/* filter only on our function */
|
2008-05-15 03:49:44 +00:00
|
|
|
ftrace_set_filter(func_name, strlen(func_name), 1);
|
2008-05-12 19:20:45 +00:00
|
|
|
|
|
|
|
/* enable tracing */
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
goto out;
|
|
|
|
}
|
2008-08-01 16:26:41 +00:00
|
|
|
|
2008-05-12 19:20:45 +00:00
|
|
|
/* Sleep for a 1/10 of a second */
|
|
|
|
msleep(100);
|
|
|
|
|
|
|
|
/* we should have nothing in the buffer */
|
|
|
|
ret = trace_test_buffer(tr, &count);
|
|
|
|
if (ret)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (count) {
|
|
|
|
ret = -1;
|
|
|
|
printk(KERN_CONT ".. filter did not filter .. ");
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* call our function again */
|
|
|
|
func();
|
|
|
|
|
|
|
|
/* sleep again */
|
|
|
|
msleep(100);
|
|
|
|
|
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:45 +00:00
|
|
|
ftrace_enabled = 0;
|
|
|
|
|
|
|
|
/* check the trace buffer */
|
|
|
|
ret = trace_test_buffer(tr, &count);
|
|
|
|
trace->reset(tr);
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2008-05-12 19:20:45 +00:00
|
|
|
|
|
|
|
/* we should only have one item */
|
|
|
|
if (!ret && count != 1) {
|
2008-05-12 19:20:54 +00:00
|
|
|
printk(KERN_CONT ".. filter failed count=%ld ..", count);
|
2008-05-12 19:20:45 +00:00
|
|
|
ret = -1;
|
|
|
|
goto out;
|
|
|
|
}
|
2008-11-08 03:36:02 +00:00
|
|
|
|
2008-05-12 19:20:45 +00:00
|
|
|
out:
|
|
|
|
ftrace_enabled = save_ftrace_enabled;
|
|
|
|
tracer_enabled = save_tracer_enabled;
|
|
|
|
|
|
|
|
/* Enable tracing on all functions again */
|
|
|
|
ftrace_set_filter(NULL, 0, 1);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
# define trace_selftest_startup_dynamic_tracing(trace, tr, func) ({ 0; })
|
|
|
|
#endif /* CONFIG_DYNAMIC_FTRACE */
|
2009-03-13 10:54:40 +00:00
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/*
|
|
|
|
* Simple verification test of ftrace function tracer.
|
|
|
|
* Enable ftrace, sleep 1/10 second, and then read the trace
|
|
|
|
* buffer to see if all is in order.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
trace_selftest_startup_function(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
2008-05-12 19:20:45 +00:00
|
|
|
int save_ftrace_enabled = ftrace_enabled;
|
|
|
|
int save_tracer_enabled = tracer_enabled;
|
2008-08-01 16:26:41 +00:00
|
|
|
unsigned long count;
|
|
|
|
int ret;
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2008-05-12 19:20:45 +00:00
|
|
|
/* make sure msleep has been recorded */
|
|
|
|
msleep(1);
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* start the tracing */
|
2008-05-12 19:20:45 +00:00
|
|
|
ftrace_enabled = 1;
|
2008-05-12 19:20:45 +00:00
|
|
|
tracer_enabled = 1;
|
2008-05-12 19:20:45 +00:00
|
|
|
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* Sleep for a 1/10 of a second */
|
|
|
|
msleep(100);
|
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:45 +00:00
|
|
|
ftrace_enabled = 0;
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* check the trace buffer */
|
|
|
|
ret = trace_test_buffer(tr, &count);
|
|
|
|
trace->reset(tr);
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
2008-05-12 19:20:45 +00:00
|
|
|
goto out;
|
2008-05-12 19:20:44 +00:00
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:45 +00:00
|
|
|
ret = trace_selftest_startup_dynamic_tracing(trace, tr,
|
|
|
|
DYN_FTRACE_TEST_NAME);
|
|
|
|
|
|
|
|
out:
|
|
|
|
ftrace_enabled = save_ftrace_enabled;
|
|
|
|
tracer_enabled = save_tracer_enabled;
|
|
|
|
|
2008-05-12 19:20:48 +00:00
|
|
|
/* kill ftrace totally if we failed */
|
|
|
|
if (ret)
|
|
|
|
ftrace_kill();
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2008-10-06 23:06:12 +00:00
|
|
|
#endif /* CONFIG_FUNCTION_TRACER */
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2009-02-07 20:33:57 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_FUNCTION_GRAPH_TRACER
|
2009-03-22 04:04:35 +00:00
|
|
|
|
|
|
|
/* Maximum number of functions to trace before diagnosing a hang */
|
|
|
|
#define GRAPH_MAX_FUNC_TEST 100000000
|
|
|
|
|
2010-04-18 17:08:41 +00:00
|
|
|
static void
|
|
|
|
__ftrace_dump(bool disable_tracing, enum ftrace_dump_mode oops_dump_mode);
|
2009-03-22 04:04:35 +00:00
|
|
|
static unsigned int graph_hang_thresh;
|
|
|
|
|
|
|
|
/* Wrap the real function entry probe to avoid possible hanging */
|
|
|
|
static int trace_graph_entry_watchdog(struct ftrace_graph_ent *trace)
|
|
|
|
{
|
|
|
|
/* This is harmlessly racy, we want to approximately detect a hang */
|
|
|
|
if (unlikely(++graph_hang_thresh > GRAPH_MAX_FUNC_TEST)) {
|
|
|
|
ftrace_graph_stop();
|
|
|
|
printk(KERN_WARNING "BUG: Function graph tracer hang!\n");
|
|
|
|
if (ftrace_dump_on_oops)
|
2010-04-18 17:08:41 +00:00
|
|
|
__ftrace_dump(false, DUMP_ALL);
|
2009-03-22 04:04:35 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return trace_graph_entry(trace);
|
|
|
|
}
|
|
|
|
|
2009-02-07 20:33:57 +00:00
|
|
|
/*
|
|
|
|
* Pretty much the same than for the function tracer from which the selftest
|
|
|
|
* has been borrowed.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
trace_selftest_startup_function_graph(struct tracer *trace,
|
|
|
|
struct trace_array *tr)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
unsigned long count;
|
|
|
|
|
2009-03-22 04:04:35 +00:00
|
|
|
/*
|
|
|
|
* Simulate the init() callback but we attach a watchdog callback
|
|
|
|
* to detect and recover from possible hangs
|
|
|
|
*/
|
|
|
|
tracing_reset_online_cpus(tr);
|
2009-07-29 16:59:58 +00:00
|
|
|
set_graph_array(tr);
|
2009-03-22 04:04:35 +00:00
|
|
|
ret = register_ftrace_graph(&trace_graph_return,
|
|
|
|
&trace_graph_entry_watchdog);
|
2009-02-07 20:33:57 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
goto out;
|
|
|
|
}
|
2009-03-22 04:04:35 +00:00
|
|
|
tracing_start_cmdline_record();
|
2009-02-07 20:33:57 +00:00
|
|
|
|
|
|
|
/* Sleep for a 1/10 of a second */
|
|
|
|
msleep(100);
|
|
|
|
|
2009-03-22 04:04:35 +00:00
|
|
|
/* Have we just recovered from a hang? */
|
|
|
|
if (graph_hang_thresh > GRAPH_MAX_FUNC_TEST) {
|
2009-03-22 14:13:07 +00:00
|
|
|
tracing_selftest_disabled = true;
|
2009-03-22 04:04:35 +00:00
|
|
|
ret = -1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2009-02-07 20:33:57 +00:00
|
|
|
tracing_stop();
|
|
|
|
|
|
|
|
/* check the trace buffer */
|
|
|
|
ret = trace_test_buffer(tr, &count);
|
|
|
|
|
|
|
|
trace->reset(tr);
|
|
|
|
tracing_start();
|
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Don't test dynamic tracing, the function tracer already did */
|
|
|
|
|
|
|
|
out:
|
|
|
|
/* Stop it if we failed */
|
|
|
|
if (ret)
|
|
|
|
ftrace_graph_stop();
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_FUNCTION_GRAPH_TRACER */
|
|
|
|
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
#ifdef CONFIG_IRQSOFF_TRACER
|
|
|
|
int
|
|
|
|
trace_selftest_startup_irqsoff(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
unsigned long save_max = tracing_max_latency;
|
|
|
|
unsigned long count;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* start the tracing */
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* reset the max latency */
|
|
|
|
tracing_max_latency = 0;
|
|
|
|
/* disable interrupts for a bit */
|
|
|
|
local_irq_disable();
|
|
|
|
udelay(100);
|
|
|
|
local_irq_enable();
|
2009-03-17 21:38:58 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Stop the tracer to avoid a warning subsequent
|
|
|
|
* to buffer flipping failure because tracing_stop()
|
|
|
|
* disables the tr and max buffers, making flipping impossible
|
|
|
|
* in case of parallels max irqs off latencies.
|
|
|
|
*/
|
|
|
|
trace->stop(tr);
|
2008-05-12 19:20:44 +00:00
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:44 +00:00
|
|
|
/* check both trace buffers */
|
|
|
|
ret = trace_test_buffer(tr, NULL);
|
|
|
|
if (!ret)
|
|
|
|
ret = trace_test_buffer(&max_tr, &count);
|
|
|
|
trace->reset(tr);
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
tracing_max_latency = save_max;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_IRQSOFF_TRACER */
|
|
|
|
|
|
|
|
#ifdef CONFIG_PREEMPT_TRACER
|
|
|
|
int
|
|
|
|
trace_selftest_startup_preemptoff(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
unsigned long save_max = tracing_max_latency;
|
|
|
|
unsigned long count;
|
|
|
|
int ret;
|
|
|
|
|
2008-11-08 03:36:02 +00:00
|
|
|
/*
|
|
|
|
* Now that the big kernel lock is no longer preemptable,
|
|
|
|
* and this is called with the BKL held, it will always
|
|
|
|
* fail. If preemption is already disabled, simply
|
|
|
|
* pass the test. When the BKL is removed, or becomes
|
|
|
|
* preemptible again, we will once again test this,
|
|
|
|
* so keep it in.
|
|
|
|
*/
|
|
|
|
if (preempt_count()) {
|
|
|
|
printk(KERN_CONT "can not test ... force ");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* start the tracing */
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* reset the max latency */
|
|
|
|
tracing_max_latency = 0;
|
|
|
|
/* disable preemption for a bit */
|
|
|
|
preempt_disable();
|
|
|
|
udelay(100);
|
|
|
|
preempt_enable();
|
2009-03-17 21:38:58 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Stop the tracer to avoid a warning subsequent
|
|
|
|
* to buffer flipping failure because tracing_stop()
|
|
|
|
* disables the tr and max buffers, making flipping impossible
|
|
|
|
* in case of parallels max preempt off latencies.
|
|
|
|
*/
|
|
|
|
trace->stop(tr);
|
2008-05-12 19:20:44 +00:00
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:44 +00:00
|
|
|
/* check both trace buffers */
|
|
|
|
ret = trace_test_buffer(tr, NULL);
|
|
|
|
if (!ret)
|
|
|
|
ret = trace_test_buffer(&max_tr, &count);
|
|
|
|
trace->reset(tr);
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
tracing_max_latency = save_max;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_PREEMPT_TRACER */
|
|
|
|
|
|
|
|
#if defined(CONFIG_IRQSOFF_TRACER) && defined(CONFIG_PREEMPT_TRACER)
|
|
|
|
int
|
|
|
|
trace_selftest_startup_preemptirqsoff(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
unsigned long save_max = tracing_max_latency;
|
|
|
|
unsigned long count;
|
|
|
|
int ret;
|
|
|
|
|
2008-11-08 03:36:02 +00:00
|
|
|
/*
|
|
|
|
* Now that the big kernel lock is no longer preemptable,
|
|
|
|
* and this is called with the BKL held, it will always
|
|
|
|
* fail. If preemption is already disabled, simply
|
|
|
|
* pass the test. When the BKL is removed, or becomes
|
|
|
|
* preemptible again, we will once again test this,
|
|
|
|
* so keep it in.
|
|
|
|
*/
|
|
|
|
if (preempt_count()) {
|
|
|
|
printk(KERN_CONT "can not test ... force ");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* start the tracing */
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
2009-03-15 23:32:41 +00:00
|
|
|
goto out_no_start;
|
2008-11-16 04:57:26 +00:00
|
|
|
}
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
/* reset the max latency */
|
|
|
|
tracing_max_latency = 0;
|
|
|
|
|
|
|
|
/* disable preemption and interrupts for a bit */
|
|
|
|
preempt_disable();
|
|
|
|
local_irq_disable();
|
|
|
|
udelay(100);
|
|
|
|
preempt_enable();
|
|
|
|
/* reverse the order of preempt vs irqs */
|
|
|
|
local_irq_enable();
|
|
|
|
|
2009-03-17 21:38:58 +00:00
|
|
|
/*
|
|
|
|
* Stop the tracer to avoid a warning subsequent
|
|
|
|
* to buffer flipping failure because tracing_stop()
|
|
|
|
* disables the tr and max buffers, making flipping impossible
|
|
|
|
* in case of parallels max irqs/preempt off latencies.
|
|
|
|
*/
|
|
|
|
trace->stop(tr);
|
2008-05-12 19:20:44 +00:00
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:44 +00:00
|
|
|
/* check both trace buffers */
|
|
|
|
ret = trace_test_buffer(tr, NULL);
|
2009-03-15 23:32:41 +00:00
|
|
|
if (ret)
|
2008-05-12 19:20:44 +00:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
ret = trace_test_buffer(&max_tr, &count);
|
2009-03-15 23:32:41 +00:00
|
|
|
if (ret)
|
2008-05-12 19:20:44 +00:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* do the test by disabling interrupts first this time */
|
|
|
|
tracing_max_latency = 0;
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2009-03-17 21:38:58 +00:00
|
|
|
trace->start(tr);
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
preempt_disable();
|
|
|
|
local_irq_disable();
|
|
|
|
udelay(100);
|
|
|
|
preempt_enable();
|
|
|
|
/* reverse the order of preempt vs irqs */
|
|
|
|
local_irq_enable();
|
|
|
|
|
2009-03-17 21:38:58 +00:00
|
|
|
trace->stop(tr);
|
2008-05-12 19:20:44 +00:00
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:44 +00:00
|
|
|
/* check both trace buffers */
|
|
|
|
ret = trace_test_buffer(tr, NULL);
|
|
|
|
if (ret)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
ret = trace_test_buffer(&max_tr, &count);
|
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2009-03-15 23:32:41 +00:00
|
|
|
out:
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2009-03-15 23:32:41 +00:00
|
|
|
out_no_start:
|
|
|
|
trace->reset(tr);
|
2008-05-12 19:20:44 +00:00
|
|
|
tracing_max_latency = save_max;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_IRQSOFF_TRACER && CONFIG_PREEMPT_TRACER */
|
|
|
|
|
2008-09-19 10:06:43 +00:00
|
|
|
#ifdef CONFIG_NOP_TRACER
|
|
|
|
int
|
|
|
|
trace_selftest_startup_nop(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
/* What could possibly go wrong? */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
#ifdef CONFIG_SCHED_TRACER
|
|
|
|
static int trace_wakeup_test_thread(void *data)
|
|
|
|
{
|
|
|
|
/* Make this a RT thread, doesn't need to be too high */
|
2011-01-07 12:41:40 +00:00
|
|
|
static const struct sched_param param = { .sched_priority = 5 };
|
2008-05-12 19:20:59 +00:00
|
|
|
struct completion *x = data;
|
2008-05-12 19:20:44 +00:00
|
|
|
|
2008-05-12 19:20:59 +00:00
|
|
|
sched_setscheduler(current, SCHED_FIFO, ¶m);
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
/* Make it know we have a new prio */
|
|
|
|
complete(x);
|
|
|
|
|
|
|
|
/* now go to sleep and let the test wake us up */
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
schedule();
|
|
|
|
|
|
|
|
/* we are awake, now wait to disappear */
|
|
|
|
while (!kthread_should_stop()) {
|
|
|
|
/*
|
|
|
|
* This is an RT task, do short sleeps to let
|
|
|
|
* others run.
|
|
|
|
*/
|
|
|
|
msleep(100);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
trace_selftest_startup_wakeup(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
unsigned long save_max = tracing_max_latency;
|
|
|
|
struct task_struct *p;
|
|
|
|
struct completion isrt;
|
|
|
|
unsigned long count;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
init_completion(&isrt);
|
|
|
|
|
|
|
|
/* create a high prio thread */
|
|
|
|
p = kthread_run(trace_wakeup_test_thread, &isrt, "ftrace-test");
|
2008-05-12 19:20:45 +00:00
|
|
|
if (IS_ERR(p)) {
|
2008-05-12 19:20:44 +00:00
|
|
|
printk(KERN_CONT "Failed to create ftrace wakeup test thread ");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* make sure the thread is running at an RT prio */
|
|
|
|
wait_for_completion(&isrt);
|
|
|
|
|
|
|
|
/* start the tracing */
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* reset the max latency */
|
|
|
|
tracing_max_latency = 0;
|
|
|
|
|
|
|
|
/* sleep to let the RT thread sleep too */
|
|
|
|
msleep(100);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Yes this is slightly racy. It is possible that for some
|
|
|
|
* strange reason that the RT thread we created, did not
|
|
|
|
* call schedule for 100ms after doing the completion,
|
|
|
|
* and we do a wakeup on a task that already is awake.
|
|
|
|
* But that is extremely unlikely, and the worst thing that
|
|
|
|
* happens in such a case, is that we disable tracing.
|
|
|
|
* Honestly, if this race does happen something is horrible
|
|
|
|
* wrong with the system.
|
|
|
|
*/
|
|
|
|
|
|
|
|
wake_up_process(p);
|
|
|
|
|
2008-09-30 03:02:37 +00:00
|
|
|
/* give a little time to let the thread wake up */
|
|
|
|
msleep(100);
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:44 +00:00
|
|
|
/* check both trace buffers */
|
|
|
|
ret = trace_test_buffer(tr, NULL);
|
|
|
|
if (!ret)
|
|
|
|
ret = trace_test_buffer(&max_tr, &count);
|
|
|
|
|
|
|
|
|
|
|
|
trace->reset(tr);
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
tracing_max_latency = save_max;
|
|
|
|
|
|
|
|
/* kill the thread */
|
|
|
|
kthread_stop(p);
|
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_SCHED_TRACER */
|
|
|
|
|
|
|
|
#ifdef CONFIG_CONTEXT_SWITCH_TRACER
|
|
|
|
int
|
|
|
|
trace_selftest_startup_sched_switch(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
unsigned long count;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* start the tracing */
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-05-12 19:20:44 +00:00
|
|
|
/* Sleep for a 1/10 of a second */
|
|
|
|
msleep(100);
|
|
|
|
/* stop the tracing. */
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_stop();
|
2008-05-12 19:20:44 +00:00
|
|
|
/* check the trace buffer */
|
|
|
|
ret = trace_test_buffer(tr, &count);
|
|
|
|
trace->reset(tr);
|
2008-11-08 03:36:02 +00:00
|
|
|
tracing_start();
|
2008-05-12 19:20:44 +00:00
|
|
|
|
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_CONTEXT_SWITCH_TRACER */
|
2008-05-12 19:20:47 +00:00
|
|
|
|
2008-11-12 20:24:24 +00:00
|
|
|
#ifdef CONFIG_BRANCH_TRACER
|
|
|
|
int
|
|
|
|
trace_selftest_startup_branch(struct tracer *trace, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
unsigned long count;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* start the tracing */
|
2009-02-05 20:02:00 +00:00
|
|
|
ret = tracer_init(trace, tr);
|
2008-11-16 04:57:26 +00:00
|
|
|
if (ret) {
|
|
|
|
warn_failed_init_tracer(trace, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2008-11-12 20:24:24 +00:00
|
|
|
/* Sleep for a 1/10 of a second */
|
|
|
|
msleep(100);
|
|
|
|
/* stop the tracing. */
|
|
|
|
tracing_stop();
|
|
|
|
/* check the trace buffer */
|
|
|
|
ret = trace_test_buffer(tr, &count);
|
|
|
|
trace->reset(tr);
|
|
|
|
tracing_start();
|
|
|
|
|
2009-02-17 06:09:47 +00:00
|
|
|
if (!ret && !count) {
|
|
|
|
printk(KERN_CONT ".. no entries found ..");
|
|
|
|
ret = -1;
|
|
|
|
}
|
|
|
|
|
2008-11-12 20:24:24 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_BRANCH_TRACER */
|
2009-03-13 09:50:27 +00:00
|
|
|
|