2009-02-24 15:21:36 +00:00
|
|
|
/*
|
|
|
|
* event tracer
|
|
|
|
*
|
|
|
|
* Copyright (C) 2008 Red Hat Inc, Steven Rostedt <srostedt@redhat.com>
|
|
|
|
*
|
2009-03-02 18:53:59 +00:00
|
|
|
* - Added format output of fields of the trace point.
|
|
|
|
* This was based off of work by Tom Zanussi <tzanussi@gmail.com>.
|
|
|
|
*
|
2009-02-24 15:21:36 +00:00
|
|
|
*/
|
|
|
|
|
2009-04-15 17:36:40 +00:00
|
|
|
#include <linux/workqueue.h>
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/kthread.h>
|
2009-02-24 15:21:36 +00:00
|
|
|
#include <linux/debugfs.h>
|
|
|
|
#include <linux/uaccess.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/ctype.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>
|
2009-04-15 17:36:40 +00:00
|
|
|
#include <linux/delay.h>
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2009-07-01 02:47:05 +00:00
|
|
|
#include <asm/setup.h>
|
|
|
|
|
2009-03-02 20:03:01 +00:00
|
|
|
#include "trace_output.h"
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2009-09-12 23:26:21 +00:00
|
|
|
#undef TRACE_SYSTEM
|
2009-02-28 04:32:58 +00:00
|
|
|
#define TRACE_SYSTEM "TRACE_SYSTEM"
|
|
|
|
|
2009-05-06 02:33:45 +00:00
|
|
|
DEFINE_MUTEX(event_mutex);
|
2009-03-02 16:49:04 +00:00
|
|
|
|
2010-11-13 03:32:11 +00:00
|
|
|
DEFINE_MUTEX(event_storage_mutex);
|
|
|
|
EXPORT_SYMBOL_GPL(event_storage_mutex);
|
|
|
|
|
|
|
|
char event_storage[EVENT_STORAGE_SIZE];
|
|
|
|
EXPORT_SYMBOL_GPL(event_storage);
|
|
|
|
|
2009-04-10 17:52:20 +00:00
|
|
|
LIST_HEAD(ftrace_events);
|
2013-03-11 07:13:42 +00:00
|
|
|
static LIST_HEAD(ftrace_common_fields);
|
2009-04-10 17:52:20 +00:00
|
|
|
|
2013-02-28 01:23:57 +00:00
|
|
|
#define GFP_TRACE (GFP_KERNEL | __GFP_ZERO)
|
|
|
|
|
|
|
|
static struct kmem_cache *field_cachep;
|
|
|
|
static struct kmem_cache *file_cachep;
|
|
|
|
|
2013-06-27 14:58:31 +00:00
|
|
|
#define SYSTEM_FL_FREE_NAME (1 << 31)
|
|
|
|
|
|
|
|
static inline int system_refcount(struct event_subsystem *system)
|
|
|
|
{
|
|
|
|
return system->ref_count & ~SYSTEM_FL_FREE_NAME;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int system_refcount_inc(struct event_subsystem *system)
|
|
|
|
{
|
|
|
|
return (system->ref_count++) & ~SYSTEM_FL_FREE_NAME;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int system_refcount_dec(struct event_subsystem *system)
|
|
|
|
{
|
|
|
|
return (--system->ref_count) & ~SYSTEM_FL_FREE_NAME;
|
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
/* Double loops, do not use break, only goto's work */
|
|
|
|
#define do_for_each_event_file(tr, file) \
|
|
|
|
list_for_each_entry(tr, &ftrace_trace_arrays, list) { \
|
|
|
|
list_for_each_entry(file, &tr->events, list)
|
|
|
|
|
|
|
|
#define do_for_each_event_file_safe(tr, file) \
|
|
|
|
list_for_each_entry(tr, &ftrace_trace_arrays, list) { \
|
|
|
|
struct ftrace_event_file *___n; \
|
|
|
|
list_for_each_entry_safe(file, ___n, &tr->events, list)
|
|
|
|
|
|
|
|
#define while_for_each_event_file() \
|
|
|
|
}
|
|
|
|
|
2013-03-11 07:13:42 +00:00
|
|
|
static struct list_head *
|
2010-04-22 14:35:55 +00:00
|
|
|
trace_get_fields(struct ftrace_event_call *event_call)
|
|
|
|
{
|
|
|
|
if (!event_call->class->get_fields)
|
|
|
|
return &event_call->class->fields;
|
|
|
|
return event_call->class->get_fields(event_call);
|
|
|
|
}
|
|
|
|
|
2013-03-11 07:13:42 +00:00
|
|
|
static struct ftrace_event_field *
|
|
|
|
__find_event_field(struct list_head *head, char *name)
|
|
|
|
{
|
|
|
|
struct ftrace_event_field *field;
|
|
|
|
|
|
|
|
list_for_each_entry(field, head, link) {
|
|
|
|
if (!strcmp(field->name, name))
|
|
|
|
return field;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct ftrace_event_field *
|
|
|
|
trace_find_event_field(struct ftrace_event_call *call, char *name)
|
|
|
|
{
|
|
|
|
struct ftrace_event_field *field;
|
|
|
|
struct list_head *head;
|
|
|
|
|
|
|
|
field = __find_event_field(&ftrace_common_fields, name);
|
|
|
|
if (field)
|
|
|
|
return field;
|
|
|
|
|
|
|
|
head = trace_get_fields(call);
|
|
|
|
return __find_event_field(head, name);
|
|
|
|
}
|
|
|
|
|
2010-05-24 08:22:49 +00:00
|
|
|
static int __trace_define_field(struct list_head *head, const char *type,
|
|
|
|
const char *name, int offset, int size,
|
|
|
|
int is_signed, int filter_type)
|
2009-03-22 08:30:39 +00:00
|
|
|
{
|
|
|
|
struct ftrace_event_field *field;
|
|
|
|
|
2013-02-28 01:23:57 +00:00
|
|
|
field = kmem_cache_alloc(field_cachep, GFP_TRACE);
|
2009-03-22 08:30:39 +00:00
|
|
|
if (!field)
|
2013-06-07 06:07:48 +00:00
|
|
|
return -ENOMEM;
|
2009-03-22 17:41:59 +00:00
|
|
|
|
2013-02-28 01:41:37 +00:00
|
|
|
field->name = name;
|
|
|
|
field->type = type;
|
2009-03-22 17:41:59 +00:00
|
|
|
|
2009-08-07 02:33:22 +00:00
|
|
|
if (filter_type == FILTER_OTHER)
|
|
|
|
field->filter_type = filter_assign_type(type);
|
|
|
|
else
|
|
|
|
field->filter_type = filter_type;
|
|
|
|
|
2009-03-22 08:30:39 +00:00
|
|
|
field->offset = offset;
|
|
|
|
field->size = size;
|
2009-04-28 08:04:53 +00:00
|
|
|
field->is_signed = is_signed;
|
2009-08-07 02:33:02 +00:00
|
|
|
|
2010-04-22 14:35:55 +00:00
|
|
|
list_add(&field->link, head);
|
2009-03-22 08:30:39 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2010-05-24 08:22:49 +00:00
|
|
|
|
|
|
|
int trace_define_field(struct ftrace_event_call *call, const char *type,
|
|
|
|
const char *name, int offset, int size, int is_signed,
|
|
|
|
int filter_type)
|
|
|
|
{
|
|
|
|
struct list_head *head;
|
|
|
|
|
|
|
|
if (WARN_ON(!call->class))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
head = trace_get_fields(call);
|
|
|
|
return __trace_define_field(head, type, name, offset, size,
|
|
|
|
is_signed, filter_type);
|
|
|
|
}
|
2009-04-10 22:12:50 +00:00
|
|
|
EXPORT_SYMBOL_GPL(trace_define_field);
|
2009-03-22 08:30:39 +00:00
|
|
|
|
2009-08-19 07:54:32 +00:00
|
|
|
#define __common_field(type, item) \
|
2010-05-24 08:22:49 +00:00
|
|
|
ret = __trace_define_field(&ftrace_common_fields, #type, \
|
|
|
|
"common_" #item, \
|
|
|
|
offsetof(typeof(ent), item), \
|
|
|
|
sizeof(ent.item), \
|
|
|
|
is_signed_type(type), FILTER_OTHER); \
|
2009-08-19 07:54:32 +00:00
|
|
|
if (ret) \
|
|
|
|
return ret;
|
|
|
|
|
2010-05-24 08:22:49 +00:00
|
|
|
static int trace_define_common_fields(void)
|
2009-08-19 07:54:32 +00:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct trace_entry ent;
|
|
|
|
|
|
|
|
__common_field(unsigned short, type);
|
|
|
|
__common_field(unsigned char, flags);
|
|
|
|
__common_field(unsigned char, preempt_count);
|
|
|
|
__common_field(int, pid);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2013-03-11 07:13:46 +00:00
|
|
|
static void trace_destroy_fields(struct ftrace_event_call *call)
|
2009-05-06 02:33:04 +00:00
|
|
|
{
|
|
|
|
struct ftrace_event_field *field, *next;
|
2010-04-22 14:35:55 +00:00
|
|
|
struct list_head *head;
|
2009-05-06 02:33:04 +00:00
|
|
|
|
2010-04-22 14:35:55 +00:00
|
|
|
head = trace_get_fields(call);
|
|
|
|
list_for_each_entry_safe(field, next, head, link) {
|
2009-05-06 02:33:04 +00:00
|
|
|
list_del(&field->link);
|
2013-02-28 01:23:57 +00:00
|
|
|
kmem_cache_free(field_cachep, field);
|
2009-05-06 02:33:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-12-08 03:14:20 +00:00
|
|
|
int trace_event_raw_init(struct ftrace_event_call *call)
|
|
|
|
{
|
|
|
|
int id;
|
|
|
|
|
2010-04-23 14:00:22 +00:00
|
|
|
id = register_ftrace_event(&call->event);
|
2009-12-08 03:14:20 +00:00
|
|
|
if (!id)
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(trace_event_raw_init);
|
|
|
|
|
2012-02-15 14:51:49 +00:00
|
|
|
int ftrace_event_reg(struct ftrace_event_call *call,
|
|
|
|
enum trace_reg type, void *data)
|
2010-06-08 15:22:06 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file = data;
|
|
|
|
|
2010-06-08 15:22:06 +00:00
|
|
|
switch (type) {
|
|
|
|
case TRACE_REG_REGISTER:
|
|
|
|
return tracepoint_probe_register(call->name,
|
|
|
|
call->class->probe,
|
2012-05-04 03:09:03 +00:00
|
|
|
file);
|
2010-06-08 15:22:06 +00:00
|
|
|
case TRACE_REG_UNREGISTER:
|
|
|
|
tracepoint_probe_unregister(call->name,
|
|
|
|
call->class->probe,
|
2012-05-04 03:09:03 +00:00
|
|
|
file);
|
2010-06-08 15:22:06 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
#ifdef CONFIG_PERF_EVENTS
|
|
|
|
case TRACE_REG_PERF_REGISTER:
|
|
|
|
return tracepoint_probe_register(call->name,
|
|
|
|
call->class->perf_probe,
|
|
|
|
call);
|
|
|
|
case TRACE_REG_PERF_UNREGISTER:
|
|
|
|
tracepoint_probe_unregister(call->name,
|
|
|
|
call->class->perf_probe,
|
|
|
|
call);
|
|
|
|
return 0;
|
2012-02-15 14:51:49 +00:00
|
|
|
case TRACE_REG_PERF_OPEN:
|
|
|
|
case TRACE_REG_PERF_CLOSE:
|
2012-02-15 14:51:50 +00:00
|
|
|
case TRACE_REG_PERF_ADD:
|
|
|
|
case TRACE_REG_PERF_DEL:
|
2012-02-15 14:51:49 +00:00
|
|
|
return 0;
|
2010-06-08 15:22:06 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(ftrace_event_reg);
|
|
|
|
|
2010-07-02 03:07:32 +00:00
|
|
|
void trace_event_enable_cmd_record(bool enable)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file;
|
|
|
|
struct trace_array *tr;
|
2010-07-02 03:07:32 +00:00
|
|
|
|
|
|
|
mutex_lock(&event_mutex);
|
2012-05-04 03:09:03 +00:00
|
|
|
do_for_each_event_file(tr, file) {
|
|
|
|
|
|
|
|
if (!(file->flags & FTRACE_EVENT_FL_ENABLED))
|
2010-07-02 03:07:32 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (enable) {
|
|
|
|
tracing_start_cmdline_record();
|
2013-03-12 17:26:18 +00:00
|
|
|
set_bit(FTRACE_EVENT_FL_RECORDED_CMD_BIT, &file->flags);
|
2010-07-02 03:07:32 +00:00
|
|
|
} else {
|
|
|
|
tracing_stop_cmdline_record();
|
2013-03-12 17:26:18 +00:00
|
|
|
clear_bit(FTRACE_EVENT_FL_RECORDED_CMD_BIT, &file->flags);
|
2010-07-02 03:07:32 +00:00
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
} while_for_each_event_file();
|
2010-07-02 03:07:32 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
}
|
|
|
|
|
2013-03-12 17:26:18 +00:00
|
|
|
static int __ftrace_event_enable_disable(struct ftrace_event_file *file,
|
|
|
|
int enable, int soft_disable)
|
2009-02-28 07:41:25 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_call *call = file->event_call;
|
2009-12-08 03:14:52 +00:00
|
|
|
int ret = 0;
|
2013-03-12 17:26:18 +00:00
|
|
|
int disable;
|
2009-12-08 03:14:52 +00:00
|
|
|
|
2009-02-28 07:41:25 +00:00
|
|
|
switch (enable) {
|
|
|
|
case 0:
|
2013-03-12 17:26:18 +00:00
|
|
|
/*
|
2013-05-09 05:44:29 +00:00
|
|
|
* When soft_disable is set and enable is cleared, the sm_ref
|
|
|
|
* reference counter is decremented. If it reaches 0, we want
|
2013-03-12 17:26:18 +00:00
|
|
|
* to clear the SOFT_DISABLED flag but leave the event in the
|
|
|
|
* state that it was. That is, if the event was enabled and
|
|
|
|
* SOFT_DISABLED isn't set, then do nothing. But if SOFT_DISABLED
|
|
|
|
* is set we do not want the event to be enabled before we
|
|
|
|
* clear the bit.
|
|
|
|
*
|
|
|
|
* When soft_disable is not set but the SOFT_MODE flag is,
|
|
|
|
* we do nothing. Do not disable the tracepoint, otherwise
|
|
|
|
* "soft enable"s (clearing the SOFT_DISABLED bit) wont work.
|
|
|
|
*/
|
|
|
|
if (soft_disable) {
|
2013-05-09 05:44:29 +00:00
|
|
|
if (atomic_dec_return(&file->sm_ref) > 0)
|
|
|
|
break;
|
2013-03-12 17:26:18 +00:00
|
|
|
disable = file->flags & FTRACE_EVENT_FL_SOFT_DISABLED;
|
|
|
|
clear_bit(FTRACE_EVENT_FL_SOFT_MODE_BIT, &file->flags);
|
|
|
|
} else
|
|
|
|
disable = !(file->flags & FTRACE_EVENT_FL_SOFT_MODE);
|
|
|
|
|
|
|
|
if (disable && (file->flags & FTRACE_EVENT_FL_ENABLED)) {
|
|
|
|
clear_bit(FTRACE_EVENT_FL_ENABLED_BIT, &file->flags);
|
2012-05-04 03:09:03 +00:00
|
|
|
if (file->flags & FTRACE_EVENT_FL_RECORDED_CMD) {
|
2010-07-02 03:07:32 +00:00
|
|
|
tracing_stop_cmdline_record();
|
2013-03-12 17:26:18 +00:00
|
|
|
clear_bit(FTRACE_EVENT_FL_RECORDED_CMD_BIT, &file->flags);
|
2010-07-02 03:07:32 +00:00
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
call->class->reg(call, TRACE_REG_UNREGISTER, file);
|
2009-02-28 07:41:25 +00:00
|
|
|
}
|
2013-06-29 05:08:07 +00:00
|
|
|
/* If in SOFT_MODE, just set the SOFT_DISABLE_BIT, else clear it */
|
2013-03-12 17:26:18 +00:00
|
|
|
if (file->flags & FTRACE_EVENT_FL_SOFT_MODE)
|
|
|
|
set_bit(FTRACE_EVENT_FL_SOFT_DISABLED_BIT, &file->flags);
|
2013-06-29 05:08:07 +00:00
|
|
|
else
|
|
|
|
clear_bit(FTRACE_EVENT_FL_SOFT_DISABLED_BIT, &file->flags);
|
2009-02-28 07:41:25 +00:00
|
|
|
break;
|
|
|
|
case 1:
|
2013-03-12 17:26:18 +00:00
|
|
|
/*
|
|
|
|
* When soft_disable is set and enable is set, we want to
|
|
|
|
* register the tracepoint for the event, but leave the event
|
|
|
|
* as is. That means, if the event was already enabled, we do
|
|
|
|
* nothing (but set SOFT_MODE). If the event is disabled, we
|
|
|
|
* set SOFT_DISABLED before enabling the event tracepoint, so
|
|
|
|
* it still seems to be disabled.
|
|
|
|
*/
|
|
|
|
if (!soft_disable)
|
|
|
|
clear_bit(FTRACE_EVENT_FL_SOFT_DISABLED_BIT, &file->flags);
|
2013-05-09 05:44:29 +00:00
|
|
|
else {
|
|
|
|
if (atomic_inc_return(&file->sm_ref) > 1)
|
|
|
|
break;
|
2013-03-12 17:26:18 +00:00
|
|
|
set_bit(FTRACE_EVENT_FL_SOFT_MODE_BIT, &file->flags);
|
2013-05-09 05:44:29 +00:00
|
|
|
}
|
2013-03-12 17:26:18 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
if (!(file->flags & FTRACE_EVENT_FL_ENABLED)) {
|
2013-03-12 17:26:18 +00:00
|
|
|
|
|
|
|
/* Keep the event disabled, when going to SOFT_MODE. */
|
|
|
|
if (soft_disable)
|
|
|
|
set_bit(FTRACE_EVENT_FL_SOFT_DISABLED_BIT, &file->flags);
|
|
|
|
|
2010-07-02 03:07:32 +00:00
|
|
|
if (trace_flags & TRACE_ITER_RECORD_CMD) {
|
|
|
|
tracing_start_cmdline_record();
|
2013-03-12 17:26:18 +00:00
|
|
|
set_bit(FTRACE_EVENT_FL_RECORDED_CMD_BIT, &file->flags);
|
2010-07-02 03:07:32 +00:00
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = call->class->reg(call, TRACE_REG_REGISTER, file);
|
2009-12-08 03:14:52 +00:00
|
|
|
if (ret) {
|
|
|
|
tracing_stop_cmdline_record();
|
|
|
|
pr_info("event trace: Could not enable event "
|
|
|
|
"%s\n", call->name);
|
|
|
|
break;
|
|
|
|
}
|
2013-03-12 17:26:18 +00:00
|
|
|
set_bit(FTRACE_EVENT_FL_ENABLED_BIT, &file->flags);
|
2013-03-05 04:05:12 +00:00
|
|
|
|
|
|
|
/* WAS_ENABLED gets set but never cleared. */
|
|
|
|
call->flags |= TRACE_EVENT_FL_WAS_ENABLED;
|
2009-02-28 07:41:25 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
2009-12-08 03:14:52 +00:00
|
|
|
|
|
|
|
return ret;
|
2009-02-28 07:41:25 +00:00
|
|
|
}
|
|
|
|
|
2013-03-12 17:26:18 +00:00
|
|
|
static int ftrace_event_enable_disable(struct ftrace_event_file *file,
|
|
|
|
int enable)
|
|
|
|
{
|
|
|
|
return __ftrace_event_enable_disable(file, enable, 0);
|
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
static void ftrace_clear_events(struct trace_array *tr)
|
2009-05-25 10:13:59 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file;
|
2009-05-25 10:13:59 +00:00
|
|
|
|
|
|
|
mutex_lock(&event_mutex);
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry(file, &tr->events, list) {
|
|
|
|
ftrace_event_enable_disable(file, 0);
|
2009-05-25 10:13:59 +00:00
|
|
|
}
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
}
|
|
|
|
|
2011-07-05 15:36:06 +00:00
|
|
|
static void __put_system(struct event_subsystem *system)
|
|
|
|
{
|
|
|
|
struct event_filter *filter = system->filter;
|
|
|
|
|
2013-06-27 14:58:31 +00:00
|
|
|
WARN_ON_ONCE(system_refcount(system) == 0);
|
|
|
|
if (system_refcount_dec(system))
|
2011-07-05 15:36:06 +00:00
|
|
|
return;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_del(&system->list);
|
|
|
|
|
2011-07-05 15:36:06 +00:00
|
|
|
if (filter) {
|
|
|
|
kfree(filter->filter_string);
|
|
|
|
kfree(filter);
|
|
|
|
}
|
2013-06-27 14:58:31 +00:00
|
|
|
if (system->ref_count & SYSTEM_FL_FREE_NAME)
|
|
|
|
kfree(system->name);
|
2011-07-05 15:36:06 +00:00
|
|
|
kfree(system);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __get_system(struct event_subsystem *system)
|
|
|
|
{
|
2013-06-27 14:58:31 +00:00
|
|
|
WARN_ON_ONCE(system_refcount(system) == 0);
|
|
|
|
system_refcount_inc(system);
|
2011-07-05 15:36:06 +00:00
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
static void __get_system_dir(struct ftrace_subsystem_dir *dir)
|
|
|
|
{
|
|
|
|
WARN_ON_ONCE(dir->ref_count == 0);
|
|
|
|
dir->ref_count++;
|
|
|
|
__get_system(dir->subsystem);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __put_system_dir(struct ftrace_subsystem_dir *dir)
|
|
|
|
{
|
|
|
|
WARN_ON_ONCE(dir->ref_count == 0);
|
|
|
|
/* If the subsystem is about to be freed, the dir must be too */
|
2013-06-27 14:58:31 +00:00
|
|
|
WARN_ON_ONCE(system_refcount(dir->subsystem) == 1 && dir->ref_count != 1);
|
2012-05-04 03:09:03 +00:00
|
|
|
|
|
|
|
__put_system(dir->subsystem);
|
|
|
|
if (!--dir->ref_count)
|
|
|
|
kfree(dir);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void put_system(struct ftrace_subsystem_dir *dir)
|
2011-07-05 15:36:06 +00:00
|
|
|
{
|
|
|
|
mutex_lock(&event_mutex);
|
2012-05-04 03:09:03 +00:00
|
|
|
__put_system_dir(dir);
|
2011-07-05 15:36:06 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
}
|
|
|
|
|
2013-07-26 17:25:47 +00:00
|
|
|
static void remove_subsystem(struct ftrace_subsystem_dir *dir)
|
|
|
|
{
|
|
|
|
if (!dir)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!--dir->nr_events) {
|
|
|
|
debugfs_remove_recursive(dir->entry);
|
|
|
|
list_del(&dir->list);
|
|
|
|
__put_system_dir(dir);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-26 17:25:32 +00:00
|
|
|
static void *event_file_data(struct file *filp)
|
|
|
|
{
|
|
|
|
return ACCESS_ONCE(file_inode(filp)->i_private);
|
|
|
|
}
|
|
|
|
|
2013-07-26 17:25:47 +00:00
|
|
|
static void remove_event_file_dir(struct ftrace_event_file *file)
|
|
|
|
{
|
2013-07-28 18:35:27 +00:00
|
|
|
struct dentry *dir = file->dir;
|
|
|
|
struct dentry *child;
|
|
|
|
|
|
|
|
if (dir) {
|
|
|
|
spin_lock(&dir->d_lock); /* probably unneeded */
|
|
|
|
list_for_each_entry(child, &dir->d_subdirs, d_u.d_child) {
|
|
|
|
if (child->d_inode) /* probably unneeded */
|
|
|
|
child->d_inode->i_private = NULL;
|
|
|
|
}
|
|
|
|
spin_unlock(&dir->d_lock);
|
|
|
|
|
|
|
|
debugfs_remove_recursive(dir);
|
|
|
|
}
|
|
|
|
|
2013-07-26 17:25:47 +00:00
|
|
|
list_del(&file->list);
|
|
|
|
remove_subsystem(file->system);
|
|
|
|
kmem_cache_free(file_cachep, file);
|
|
|
|
}
|
|
|
|
|
2009-05-08 02:31:42 +00:00
|
|
|
/*
|
|
|
|
* __ftrace_set_clr_event(NULL, NULL, NULL, set) will set/unset all events.
|
|
|
|
*/
|
2013-07-02 18:48:23 +00:00
|
|
|
static int
|
|
|
|
__ftrace_set_clr_event_nolock(struct trace_array *tr, const char *match,
|
|
|
|
const char *sub, const char *event, int set)
|
2009-02-24 15:21:36 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file;
|
2009-04-10 17:52:20 +00:00
|
|
|
struct ftrace_event_call *call;
|
2009-05-08 20:06:47 +00:00
|
|
|
int ret = -EINVAL;
|
2009-05-08 02:31:42 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry(file, &tr->events, list) {
|
|
|
|
|
|
|
|
call = file->event_call;
|
2009-05-08 02:31:42 +00:00
|
|
|
|
2010-06-08 15:22:06 +00:00
|
|
|
if (!call->name || !call->class || !call->class->reg)
|
2009-05-08 02:31:42 +00:00
|
|
|
continue;
|
|
|
|
|
2012-05-10 19:55:43 +00:00
|
|
|
if (call->flags & TRACE_EVENT_FL_IGNORE_ENABLE)
|
|
|
|
continue;
|
|
|
|
|
2009-05-08 02:31:42 +00:00
|
|
|
if (match &&
|
|
|
|
strcmp(match, call->name) != 0 &&
|
2010-04-20 14:47:33 +00:00
|
|
|
strcmp(match, call->class->system) != 0)
|
2009-05-08 02:31:42 +00:00
|
|
|
continue;
|
|
|
|
|
2010-04-20 14:47:33 +00:00
|
|
|
if (sub && strcmp(sub, call->class->system) != 0)
|
2009-05-08 02:31:42 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
if (event && strcmp(event, call->name) != 0)
|
|
|
|
continue;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ftrace_event_enable_disable(file, set);
|
2009-05-08 02:31:42 +00:00
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
}
|
2013-07-02 18:48:23 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int __ftrace_set_clr_event(struct trace_array *tr, const char *match,
|
|
|
|
const char *sub, const char *event, int set)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
ret = __ftrace_set_clr_event_nolock(tr, match, sub, event, set);
|
2009-05-08 02:31:42 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
static int ftrace_set_clr_event(struct trace_array *tr, char *buf, int set)
|
2009-05-08 02:31:42 +00:00
|
|
|
{
|
2009-02-28 04:32:58 +00:00
|
|
|
char *event = NULL, *sub = NULL, *match;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The buf format can be <subsystem>:<event-name>
|
|
|
|
* *:<event-name> means any event by that name.
|
|
|
|
* :<event-name> is the same.
|
|
|
|
*
|
|
|
|
* <subsystem>:* means all events in that subsystem
|
|
|
|
* <subsystem>: means the same.
|
|
|
|
*
|
|
|
|
* <name> (no ':') means all events in a subsystem with
|
|
|
|
* the name <name> or any event that matches <name>
|
|
|
|
*/
|
|
|
|
|
|
|
|
match = strsep(&buf, ":");
|
|
|
|
if (buf) {
|
|
|
|
sub = match;
|
|
|
|
event = buf;
|
|
|
|
match = NULL;
|
|
|
|
|
|
|
|
if (!strlen(sub) || strcmp(sub, "*") == 0)
|
|
|
|
sub = NULL;
|
|
|
|
if (!strlen(event) || strcmp(event, "*") == 0)
|
|
|
|
event = NULL;
|
|
|
|
}
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
return __ftrace_set_clr_event(tr, match, sub, event, set);
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
2009-05-08 20:27:41 +00:00
|
|
|
/**
|
|
|
|
* trace_set_clr_event - enable or disable an event
|
|
|
|
* @system: system name to match (NULL for any system)
|
|
|
|
* @event: event name to match (NULL for all events, within system)
|
|
|
|
* @set: 1 to enable, 0 to disable
|
|
|
|
*
|
|
|
|
* This is a way for other parts of the kernel to enable or disable
|
|
|
|
* event recording.
|
|
|
|
*
|
|
|
|
* Returns 0 on success, -EINVAL if the parameters do not match any
|
|
|
|
* registered events.
|
|
|
|
*/
|
|
|
|
int trace_set_clr_event(const char *system, const char *event, int set)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct trace_array *tr = top_trace_array();
|
|
|
|
|
|
|
|
return __ftrace_set_clr_event(tr, NULL, system, event, set);
|
2009-05-08 20:27:41 +00:00
|
|
|
}
|
2010-11-08 06:05:12 +00:00
|
|
|
EXPORT_SYMBOL_GPL(trace_set_clr_event);
|
2009-05-08 20:27:41 +00:00
|
|
|
|
2009-02-24 15:21:36 +00:00
|
|
|
/* 128 should be much more than enough */
|
|
|
|
#define EVENT_BUF_SIZE 127
|
|
|
|
|
|
|
|
static ssize_t
|
|
|
|
ftrace_event_write(struct file *file, const char __user *ubuf,
|
|
|
|
size_t cnt, loff_t *ppos)
|
|
|
|
{
|
2009-09-11 15:29:28 +00:00
|
|
|
struct trace_parser parser;
|
2012-05-04 03:09:03 +00:00
|
|
|
struct seq_file *m = file->private_data;
|
|
|
|
struct trace_array *tr = m->private;
|
2009-09-22 05:52:20 +00:00
|
|
|
ssize_t read, ret;
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2009-09-22 05:52:20 +00:00
|
|
|
if (!cnt)
|
2009-02-24 15:21:36 +00:00
|
|
|
return 0;
|
|
|
|
|
2009-03-11 18:33:00 +00:00
|
|
|
ret = tracing_update_buffers();
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
2009-09-11 15:29:28 +00:00
|
|
|
if (trace_parser_get_init(&parser, EVENT_BUF_SIZE + 1))
|
2009-02-24 15:21:36 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
|
2009-09-11 15:29:28 +00:00
|
|
|
read = trace_get_user(&parser, ubuf, cnt, ppos);
|
|
|
|
|
2009-09-22 05:52:20 +00:00
|
|
|
if (read >= 0 && trace_parser_loaded((&parser))) {
|
2009-09-11 15:29:28 +00:00
|
|
|
int set = 1;
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2009-09-11 15:29:28 +00:00
|
|
|
if (*parser.buffer == '!')
|
2009-02-24 15:21:36 +00:00
|
|
|
set = 0;
|
|
|
|
|
2009-09-11 15:29:28 +00:00
|
|
|
parser.buffer[parser.idx] = 0;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = ftrace_set_clr_event(tr, parser.buffer + !set, set);
|
2009-02-24 15:21:36 +00:00
|
|
|
if (ret)
|
2009-09-11 15:29:28 +00:00
|
|
|
goto out_put;
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = read;
|
|
|
|
|
2009-09-11 15:29:28 +00:00
|
|
|
out_put:
|
|
|
|
trace_parser_put(&parser);
|
2009-02-24 15:21:36 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *
|
|
|
|
t_next(struct seq_file *m, void *v, loff_t *pos)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file = v;
|
|
|
|
struct ftrace_event_call *call;
|
|
|
|
struct trace_array *tr = m->private;
|
2009-02-24 15:21:36 +00:00
|
|
|
|
|
|
|
(*pos)++;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry_continue(file, &tr->events, list) {
|
|
|
|
call = file->event_call;
|
2009-03-10 15:32:40 +00:00
|
|
|
/*
|
|
|
|
* The ftrace subsystem is for showing formats only.
|
|
|
|
* They can not be enabled or disabled via the event files.
|
|
|
|
*/
|
2010-06-08 15:22:06 +00:00
|
|
|
if (call->class && call->class->reg)
|
2012-05-04 03:09:03 +00:00
|
|
|
return file;
|
2009-03-10 15:32:40 +00:00
|
|
|
}
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2009-09-18 06:07:05 +00:00
|
|
|
return NULL;
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *t_start(struct seq_file *m, loff_t *pos)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file;
|
|
|
|
struct trace_array *tr = m->private;
|
2009-06-24 01:52:29 +00:00
|
|
|
loff_t l;
|
|
|
|
|
2009-05-06 02:33:45 +00:00
|
|
|
mutex_lock(&event_mutex);
|
2009-06-24 01:52:29 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
file = list_entry(&tr->events, struct ftrace_event_file, list);
|
2009-06-24 01:52:29 +00:00
|
|
|
for (l = 0; l <= *pos; ) {
|
2012-05-04 03:09:03 +00:00
|
|
|
file = t_next(m, file, &l);
|
|
|
|
if (!file)
|
2009-06-24 01:52:29 +00:00
|
|
|
break;
|
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
return file;
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *
|
|
|
|
s_next(struct seq_file *m, void *v, loff_t *pos)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file = v;
|
|
|
|
struct trace_array *tr = m->private;
|
2009-02-24 15:21:36 +00:00
|
|
|
|
|
|
|
(*pos)++;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry_continue(file, &tr->events, list) {
|
|
|
|
if (file->flags & FTRACE_EVENT_FL_ENABLED)
|
|
|
|
return file;
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
2009-09-18 06:07:05 +00:00
|
|
|
return NULL;
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *s_start(struct seq_file *m, loff_t *pos)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file;
|
|
|
|
struct trace_array *tr = m->private;
|
2009-06-24 01:52:29 +00:00
|
|
|
loff_t l;
|
|
|
|
|
2009-05-06 02:33:45 +00:00
|
|
|
mutex_lock(&event_mutex);
|
2009-06-24 01:52:29 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
file = list_entry(&tr->events, struct ftrace_event_file, list);
|
2009-06-24 01:52:29 +00:00
|
|
|
for (l = 0; l <= *pos; ) {
|
2012-05-04 03:09:03 +00:00
|
|
|
file = s_next(m, file, &l);
|
|
|
|
if (!file)
|
2009-06-24 01:52:29 +00:00
|
|
|
break;
|
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
return file;
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int t_show(struct seq_file *m, void *v)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file = v;
|
|
|
|
struct ftrace_event_call *call = file->event_call;
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2010-04-20 14:47:33 +00:00
|
|
|
if (strcmp(call->class->system, TRACE_SYSTEM) != 0)
|
|
|
|
seq_printf(m, "%s:", call->class->system);
|
2009-02-24 15:21:36 +00:00
|
|
|
seq_printf(m, "%s\n", call->name);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void t_stop(struct seq_file *m, void *p)
|
|
|
|
{
|
2009-05-06 02:33:45 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
2009-02-24 15:21:36 +00:00
|
|
|
}
|
|
|
|
|
2009-02-24 19:15:08 +00:00
|
|
|
static ssize_t
|
|
|
|
event_enable_read(struct file *filp, char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2013-07-26 17:25:36 +00:00
|
|
|
struct ftrace_event_file *file;
|
|
|
|
unsigned long flags;
|
2013-06-29 05:08:04 +00:00
|
|
|
char buf[4] = "0";
|
|
|
|
|
2013-07-26 17:25:36 +00:00
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
file = event_file_data(filp);
|
|
|
|
if (likely(file))
|
|
|
|
flags = file->flags;
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
|
|
|
|
if (!file)
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
|
|
if (flags & FTRACE_EVENT_FL_ENABLED &&
|
|
|
|
!(flags & FTRACE_EVENT_FL_SOFT_DISABLED))
|
2013-06-29 05:08:04 +00:00
|
|
|
strcpy(buf, "1");
|
|
|
|
|
2013-07-26 17:25:36 +00:00
|
|
|
if (flags & FTRACE_EVENT_FL_SOFT_DISABLED ||
|
|
|
|
flags & FTRACE_EVENT_FL_SOFT_MODE)
|
2013-06-29 05:08:04 +00:00
|
|
|
strcat(buf, "*");
|
|
|
|
|
|
|
|
strcat(buf, "\n");
|
2009-02-24 19:15:08 +00:00
|
|
|
|
2013-03-12 17:26:18 +00:00
|
|
|
return simple_read_from_buffer(ubuf, cnt, ppos, buf, strlen(buf));
|
2009-02-24 19:15:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t
|
|
|
|
event_enable_write(struct file *filp, const char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2013-07-26 17:25:36 +00:00
|
|
|
struct ftrace_event_file *file;
|
2009-02-24 19:15:08 +00:00
|
|
|
unsigned long val;
|
|
|
|
int ret;
|
|
|
|
|
2011-06-07 19:58:27 +00:00
|
|
|
ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
|
|
|
|
if (ret)
|
2009-02-24 19:15:08 +00:00
|
|
|
return ret;
|
|
|
|
|
2009-03-11 18:33:00 +00:00
|
|
|
ret = tracing_update_buffers();
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
2009-02-24 19:15:08 +00:00
|
|
|
switch (val) {
|
|
|
|
case 0:
|
|
|
|
case 1:
|
2013-07-26 17:25:36 +00:00
|
|
|
ret = -ENODEV;
|
2009-03-02 16:49:04 +00:00
|
|
|
mutex_lock(&event_mutex);
|
2013-07-26 17:25:36 +00:00
|
|
|
file = event_file_data(filp);
|
|
|
|
if (likely(file))
|
|
|
|
ret = ftrace_event_enable_disable(file, val);
|
2009-03-02 16:49:04 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
2009-02-24 19:15:08 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
*ppos += cnt;
|
|
|
|
|
2009-12-08 03:14:52 +00:00
|
|
|
return ret ? ret : cnt;
|
2009-02-24 19:15:08 +00:00
|
|
|
}
|
|
|
|
|
2009-05-07 02:52:15 +00:00
|
|
|
static ssize_t
|
|
|
|
system_enable_read(struct file *filp, char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2009-05-08 02:32:05 +00:00
|
|
|
const char set_to_char[4] = { '?', '0', '1', 'X' };
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir = filp->private_data;
|
|
|
|
struct event_subsystem *system = dir->subsystem;
|
2009-05-07 02:52:15 +00:00
|
|
|
struct ftrace_event_call *call;
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_file *file;
|
|
|
|
struct trace_array *tr = dir->tr;
|
2009-05-07 02:52:15 +00:00
|
|
|
char buf[2];
|
2009-05-08 02:32:05 +00:00
|
|
|
int set = 0;
|
2009-05-07 02:52:15 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
mutex_lock(&event_mutex);
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry(file, &tr->events, list) {
|
|
|
|
call = file->event_call;
|
2010-06-08 15:22:06 +00:00
|
|
|
if (!call->name || !call->class || !call->class->reg)
|
2009-05-07 02:52:15 +00:00
|
|
|
continue;
|
|
|
|
|
2011-07-05 18:32:51 +00:00
|
|
|
if (system && strcmp(call->class->system, system->name) != 0)
|
2009-05-07 02:52:15 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We need to find out if all the events are set
|
|
|
|
* or if all events or cleared, or if we have
|
|
|
|
* a mixture.
|
|
|
|
*/
|
2012-05-04 03:09:03 +00:00
|
|
|
set |= (1 << !!(file->flags & FTRACE_EVENT_FL_ENABLED));
|
2009-05-08 02:32:05 +00:00
|
|
|
|
2009-05-07 02:52:15 +00:00
|
|
|
/*
|
|
|
|
* If we have a mixture, no need to look further.
|
|
|
|
*/
|
2009-05-08 02:32:05 +00:00
|
|
|
if (set == 3)
|
2009-05-07 02:52:15 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
|
2009-05-08 02:32:05 +00:00
|
|
|
buf[0] = set_to_char[set];
|
2009-05-07 02:52:15 +00:00
|
|
|
buf[1] = '\n';
|
|
|
|
|
|
|
|
ret = simple_read_from_buffer(ubuf, cnt, ppos, buf, 2);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t
|
|
|
|
system_enable_write(struct file *filp, const char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir = filp->private_data;
|
|
|
|
struct event_subsystem *system = dir->subsystem;
|
2011-07-05 18:32:51 +00:00
|
|
|
const char *name = NULL;
|
2009-05-07 02:52:15 +00:00
|
|
|
unsigned long val;
|
|
|
|
ssize_t ret;
|
|
|
|
|
2011-06-07 19:58:27 +00:00
|
|
|
ret = kstrtoul_from_user(ubuf, cnt, 10, &val);
|
|
|
|
if (ret)
|
2009-05-07 02:52:15 +00:00
|
|
|
return ret;
|
|
|
|
|
|
|
|
ret = tracing_update_buffers();
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
2009-05-08 02:31:42 +00:00
|
|
|
if (val != 0 && val != 1)
|
2009-05-07 02:52:15 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2011-07-05 18:32:51 +00:00
|
|
|
/*
|
|
|
|
* Opening of "enable" adds a ref count to system,
|
|
|
|
* so the name is safe to use.
|
|
|
|
*/
|
|
|
|
if (system)
|
|
|
|
name = system->name;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = __ftrace_set_clr_event(dir->tr, NULL, name, NULL, val);
|
2009-05-07 02:52:15 +00:00
|
|
|
if (ret)
|
2009-05-08 02:31:42 +00:00
|
|
|
goto out;
|
2009-05-07 02:52:15 +00:00
|
|
|
|
|
|
|
ret = cnt;
|
|
|
|
|
2009-05-08 02:31:42 +00:00
|
|
|
out:
|
2009-05-07 02:52:15 +00:00
|
|
|
*ppos += cnt;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
enum {
|
|
|
|
FORMAT_HEADER = 1,
|
2010-08-17 05:53:06 +00:00
|
|
|
FORMAT_FIELD_SEPERATOR = 2,
|
|
|
|
FORMAT_PRINTFMT = 3,
|
2010-06-03 19:21:34 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static void *f_next(struct seq_file *m, void *v, loff_t *pos)
|
2009-03-02 18:53:59 +00:00
|
|
|
{
|
2013-07-26 17:25:43 +00:00
|
|
|
struct ftrace_event_call *call = event_file_data(m->private);
|
2010-08-17 05:53:06 +00:00
|
|
|
struct list_head *common_head = &ftrace_common_fields;
|
|
|
|
struct list_head *head = trace_get_fields(call);
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
struct list_head *node = v;
|
2009-03-02 18:53:59 +00:00
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
(*pos)++;
|
2009-12-15 07:39:53 +00:00
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
switch ((unsigned long)v) {
|
|
|
|
case FORMAT_HEADER:
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
node = common_head;
|
|
|
|
break;
|
2009-12-15 07:39:53 +00:00
|
|
|
|
2010-08-17 05:53:06 +00:00
|
|
|
case FORMAT_FIELD_SEPERATOR:
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
node = head;
|
|
|
|
break;
|
2009-12-15 07:39:53 +00:00
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
case FORMAT_PRINTFMT:
|
|
|
|
/* all done */
|
|
|
|
return NULL;
|
2009-12-15 07:39:53 +00:00
|
|
|
}
|
|
|
|
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
node = node->prev;
|
|
|
|
if (node == common_head)
|
2010-08-17 05:53:06 +00:00
|
|
|
return (void *)FORMAT_FIELD_SEPERATOR;
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
else if (node == head)
|
2010-06-03 19:21:34 +00:00
|
|
|
return (void *)FORMAT_PRINTFMT;
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
else
|
|
|
|
return node;
|
2010-06-03 19:21:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int f_show(struct seq_file *m, void *v)
|
|
|
|
{
|
2013-07-26 17:25:43 +00:00
|
|
|
struct ftrace_event_call *call = event_file_data(m->private);
|
2010-06-03 19:21:34 +00:00
|
|
|
struct ftrace_event_field *field;
|
|
|
|
const char *array_descriptor;
|
|
|
|
|
|
|
|
switch ((unsigned long)v) {
|
|
|
|
case FORMAT_HEADER:
|
|
|
|
seq_printf(m, "name: %s\n", call->name);
|
|
|
|
seq_printf(m, "ID: %d\n", call->event.type);
|
|
|
|
seq_printf(m, "format:\n");
|
2010-05-24 08:22:49 +00:00
|
|
|
return 0;
|
2009-12-15 07:39:53 +00:00
|
|
|
|
2010-08-17 05:53:06 +00:00
|
|
|
case FORMAT_FIELD_SEPERATOR:
|
|
|
|
seq_putc(m, '\n');
|
|
|
|
return 0;
|
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
case FORMAT_PRINTFMT:
|
|
|
|
seq_printf(m, "\nprint fmt: %s\n",
|
|
|
|
call->print_fmt);
|
|
|
|
return 0;
|
2009-03-02 18:53:59 +00:00
|
|
|
}
|
2010-05-24 08:22:49 +00:00
|
|
|
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
field = list_entry(v, struct ftrace_event_field, link);
|
2010-06-03 19:21:34 +00:00
|
|
|
/*
|
|
|
|
* Smartly shows the array type(except dynamic array).
|
|
|
|
* Normal:
|
|
|
|
* field:TYPE VAR
|
|
|
|
* If TYPE := TYPE[LEN], it is shown:
|
|
|
|
* field:TYPE VAR[LEN]
|
|
|
|
*/
|
|
|
|
array_descriptor = strchr(field->type, '[');
|
2010-05-24 08:22:49 +00:00
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
if (!strncmp(field->type, "__data_loc", 10))
|
|
|
|
array_descriptor = NULL;
|
2010-05-24 08:22:49 +00:00
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
if (!array_descriptor)
|
|
|
|
seq_printf(m, "\tfield:%s %s;\toffset:%u;\tsize:%u;\tsigned:%d;\n",
|
|
|
|
field->type, field->name, field->offset,
|
|
|
|
field->size, !!field->is_signed);
|
|
|
|
else
|
|
|
|
seq_printf(m, "\tfield:%.*s %s%s;\toffset:%u;\tsize:%u;\tsigned:%d;\n",
|
|
|
|
(int)(array_descriptor - field->type),
|
|
|
|
field->type, field->name,
|
|
|
|
array_descriptor, field->offset,
|
|
|
|
field->size, !!field->is_signed);
|
2010-05-24 08:22:49 +00:00
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2009-12-15 07:39:53 +00:00
|
|
|
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
static void *f_start(struct seq_file *m, loff_t *pos)
|
|
|
|
{
|
|
|
|
void *p = (void *)FORMAT_HEADER;
|
|
|
|
loff_t l = 0;
|
|
|
|
|
2013-07-26 17:25:43 +00:00
|
|
|
/* ->stop() is called even if ->start() fails */
|
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
if (!event_file_data(m->private))
|
|
|
|
return ERR_PTR(-ENODEV);
|
|
|
|
|
tracing: Simplify the iteration logic in f_start/f_next
f_next() looks overcomplicated, and it is not strictly correct
even if this doesn't matter.
Say, FORMAT_FIELD_SEPERATOR should not return NULL (means EOF)
if trace_get_fields() returns an empty list, we should simply
advance to FORMAT_PRINTFMT as we do when we find the end of list.
1. Change f_next() to return "struct list_head *" rather than
"ftrace_event_field *", and change f_show() to do list_entry().
This simplifies the code a bit, only f_show() needs to know
about ftrace_event_field, and f_next() can play with ->prev
directly
2. Change f_next() to not play with ->prev / return inside the
switch() statement. It can simply set node = head/common_head,
the prev-or-advance-to-the-next-magic below does all work.
While at it. f_start() looks overcomplicated too. I don't think
*pos == 0 makes sense as a separate case, just change this code
to do "while" instead of "do/while".
The patch also moves f_start() down, close to f_stop(). This is
purely cosmetic, just to make the locking added by the next patch
more clear/visible.
Link: http://lkml.kernel.org/r/20130718184710.GA4783@redhat.com
Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2013-07-18 18:47:10 +00:00
|
|
|
while (l < *pos && p)
|
|
|
|
p = f_next(m, p, &l);
|
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
static void f_stop(struct seq_file *m, void *p)
|
|
|
|
{
|
2013-07-26 17:25:43 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
2010-06-03 19:21:34 +00:00
|
|
|
}
|
2009-03-02 18:53:59 +00:00
|
|
|
|
2010-06-03 19:21:34 +00:00
|
|
|
static const struct seq_operations trace_format_seq_ops = {
|
|
|
|
.start = f_start,
|
|
|
|
.next = f_next,
|
|
|
|
.stop = f_stop,
|
|
|
|
.show = f_show,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int trace_format_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct seq_file *m;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = seq_open(file, &trace_format_seq_ops);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
m = file->private_data;
|
2013-07-26 17:25:43 +00:00
|
|
|
m->private = file;
|
2010-06-03 19:21:34 +00:00
|
|
|
|
|
|
|
return 0;
|
2009-03-02 18:53:59 +00:00
|
|
|
}
|
|
|
|
|
2009-03-19 19:26:13 +00:00
|
|
|
static ssize_t
|
|
|
|
event_id_read(struct file *filp, char __user *ubuf, size_t cnt, loff_t *ppos)
|
|
|
|
{
|
2013-07-26 17:25:32 +00:00
|
|
|
int id = (long)event_file_data(filp);
|
2013-07-18 18:47:12 +00:00
|
|
|
char buf[32];
|
|
|
|
int len;
|
2009-03-19 19:26:13 +00:00
|
|
|
|
|
|
|
if (*ppos)
|
|
|
|
return 0;
|
|
|
|
|
2013-07-26 17:25:32 +00:00
|
|
|
if (unlikely(!id))
|
|
|
|
return -ENODEV;
|
|
|
|
|
|
|
|
len = sprintf(buf, "%d\n", id);
|
|
|
|
|
2013-07-18 18:47:12 +00:00
|
|
|
return simple_read_from_buffer(ubuf, cnt, ppos, buf, len);
|
2009-03-19 19:26:13 +00:00
|
|
|
}
|
|
|
|
|
2009-03-22 08:31:04 +00:00
|
|
|
static ssize_t
|
|
|
|
event_filter_read(struct file *filp, char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2013-07-26 17:25:40 +00:00
|
|
|
struct ftrace_event_call *call;
|
2009-03-22 08:31:04 +00:00
|
|
|
struct trace_seq *s;
|
2013-07-26 17:25:40 +00:00
|
|
|
int r = -ENODEV;
|
2009-03-22 08:31:04 +00:00
|
|
|
|
|
|
|
if (*ppos)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
s = kmalloc(sizeof(*s), GFP_KERNEL);
|
2013-07-26 17:25:40 +00:00
|
|
|
|
2009-03-22 08:31:04 +00:00
|
|
|
if (!s)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
trace_seq_init(s);
|
|
|
|
|
2013-07-26 17:25:40 +00:00
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
call = event_file_data(filp);
|
|
|
|
if (call)
|
|
|
|
print_event_filter(call, s);
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
|
|
|
|
if (call)
|
|
|
|
r = simple_read_from_buffer(ubuf, cnt, ppos, s->buffer, s->len);
|
2009-03-22 08:31:04 +00:00
|
|
|
|
|
|
|
kfree(s);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t
|
|
|
|
event_filter_write(struct file *filp, const char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2013-07-26 17:25:40 +00:00
|
|
|
struct ftrace_event_call *call;
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
char *buf;
|
2013-07-26 17:25:40 +00:00
|
|
|
int err = -ENODEV;
|
2009-03-22 08:31:04 +00:00
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
if (cnt >= PAGE_SIZE)
|
2009-03-22 08:31:04 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
buf = (char *)__get_free_page(GFP_TEMPORARY);
|
|
|
|
if (!buf)
|
2009-03-22 08:31:04 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
if (copy_from_user(buf, ubuf, cnt)) {
|
|
|
|
free_page((unsigned long) buf);
|
|
|
|
return -EFAULT;
|
2009-03-22 08:31:04 +00:00
|
|
|
}
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
buf[cnt] = '\0';
|
2009-03-22 08:31:04 +00:00
|
|
|
|
2013-07-26 17:25:40 +00:00
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
call = event_file_data(filp);
|
|
|
|
if (call)
|
|
|
|
err = apply_event_filter(call, buf);
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
free_page((unsigned long) buf);
|
|
|
|
if (err < 0)
|
2009-04-11 07:55:28 +00:00
|
|
|
return err;
|
tracing/filters: allow on-the-fly filter switching
This patch allows event filters to be safely removed or switched
on-the-fly while avoiding the use of rcu or the suspension of tracing of
previous versions.
It does it by adding a new filter_pred_none() predicate function which
does nothing and by never deallocating either the predicates or any of
the filter_pred members used in matching; the predicate lists are
allocated and initialized during ftrace_event_calls initialization.
Whenever a filter is removed or replaced, the filter_pred_* functions
currently in use by the affected ftrace_event_call are immediately
switched over to to the filter_pred_none() function, while the rest of
the filter_pred members are left intact, allowing any currently
executing filter_pred_* functions to finish up, using the values they're
currently using.
In the case of filter replacement, the new predicate values are copied
into the old predicates after the above step, and the filter_pred_none()
functions are replaced by the filter_pred_* functions for the new
filter. In this case, it is possible though very unlikely that a
previous filter_pred_* is still running even after the
filter_pred_none() switch and the switch to the new filter_pred_*. In
that case, however, because nothing has been deallocated in the
filter_pred, the worst that can happen is that the old filter_pred_*
function sees the new values and as a result produces either a false
positive or a false negative, depending on the values it finds.
So one downside to this method is that rarely, it can produce a bad
match during the filter switch, but it should be possible to live with
that, IMHO.
The other downside is that at least in this patch the predicate lists
are always pre-allocated, taking up memory from the start. They could
probably be allocated on first-use, and de-allocated when tracing is
completely stopped - if this patch makes sense, I could create another
one to do that later on.
Oh, and it also places a restriction on the size of __arrays in events,
currently set to 128, since they can't be larger than the now embedded
str_val arrays in the filter_pred struct.
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Frederic Weisbecker <fweisbec@gmail.com>
Cc: Steven Rostedt <rostedt@goodmis.org>
Cc: paulmck@linux.vnet.ibm.com
LKML-Reference: <1239610670.6660.49.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-13 08:17:50 +00:00
|
|
|
|
2009-03-22 08:31:04 +00:00
|
|
|
*ppos += cnt;
|
|
|
|
|
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
2011-07-05 15:36:06 +00:00
|
|
|
static LIST_HEAD(event_subsystems);
|
|
|
|
|
|
|
|
static int subsystem_open(struct inode *inode, struct file *filp)
|
|
|
|
{
|
|
|
|
struct event_subsystem *system = NULL;
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir = NULL; /* Initialize for gcc */
|
|
|
|
struct trace_array *tr;
|
2011-07-05 15:36:06 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* Make sure the system still exists */
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_lock(&trace_types_lock);
|
2011-07-05 15:36:06 +00:00
|
|
|
mutex_lock(&event_mutex);
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry(tr, &ftrace_trace_arrays, list) {
|
|
|
|
list_for_each_entry(dir, &tr->systems, list) {
|
|
|
|
if (dir == inode->i_private) {
|
|
|
|
/* Don't open systems with no events */
|
|
|
|
if (dir->nr_events) {
|
|
|
|
__get_system_dir(dir);
|
|
|
|
system = dir->subsystem;
|
|
|
|
}
|
|
|
|
goto exit_loop;
|
2011-07-05 15:36:06 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
exit_loop:
|
2011-07-05 15:36:06 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_unlock(&trace_types_lock);
|
2011-07-05 15:36:06 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
if (!system)
|
2011-07-05 15:36:06 +00:00
|
|
|
return -ENODEV;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
/* Some versions of gcc think dir can be uninitialized here */
|
|
|
|
WARN_ON(!dir);
|
|
|
|
|
2013-07-02 19:30:53 +00:00
|
|
|
/* Still need to increment the ref count of the system */
|
|
|
|
if (trace_array_get(tr) < 0) {
|
|
|
|
put_system(dir);
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
|
|
|
|
2011-07-05 15:36:06 +00:00
|
|
|
ret = tracing_open_generic(inode, filp);
|
2013-07-02 19:30:53 +00:00
|
|
|
if (ret < 0) {
|
|
|
|
trace_array_put(tr);
|
2012-05-04 03:09:03 +00:00
|
|
|
put_system(dir);
|
2013-07-02 19:30:53 +00:00
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int system_tr_open(struct inode *inode, struct file *filp)
|
|
|
|
{
|
|
|
|
struct ftrace_subsystem_dir *dir;
|
|
|
|
struct trace_array *tr = inode->i_private;
|
|
|
|
int ret;
|
|
|
|
|
2013-07-02 19:30:53 +00:00
|
|
|
if (trace_array_get(tr) < 0)
|
|
|
|
return -ENODEV;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
/* Make a temporary dir that has no system but points to tr */
|
|
|
|
dir = kzalloc(sizeof(*dir), GFP_KERNEL);
|
2013-07-02 19:30:53 +00:00
|
|
|
if (!dir) {
|
|
|
|
trace_array_put(tr);
|
2012-05-04 03:09:03 +00:00
|
|
|
return -ENOMEM;
|
2013-07-02 19:30:53 +00:00
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
|
|
|
|
dir->tr = tr;
|
|
|
|
|
|
|
|
ret = tracing_open_generic(inode, filp);
|
2013-07-02 19:30:53 +00:00
|
|
|
if (ret < 0) {
|
|
|
|
trace_array_put(tr);
|
2012-05-04 03:09:03 +00:00
|
|
|
kfree(dir);
|
2013-07-02 19:30:53 +00:00
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
|
|
|
|
filp->private_data = dir;
|
2011-07-05 15:36:06 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int subsystem_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir = file->private_data;
|
2011-07-05 15:36:06 +00:00
|
|
|
|
2013-07-02 19:30:53 +00:00
|
|
|
trace_array_put(dir->tr);
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
/*
|
|
|
|
* If dir->subsystem is NULL, then this is a temporary
|
|
|
|
* descriptor that was made for a trace_array to enable
|
|
|
|
* all subsystems.
|
|
|
|
*/
|
|
|
|
if (dir->subsystem)
|
|
|
|
put_system(dir);
|
|
|
|
else
|
|
|
|
kfree(dir);
|
2011-07-05 15:36:06 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-03-22 08:31:17 +00:00
|
|
|
static ssize_t
|
|
|
|
subsystem_filter_read(struct file *filp, char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir = filp->private_data;
|
|
|
|
struct event_subsystem *system = dir->subsystem;
|
2009-03-22 08:31:17 +00:00
|
|
|
struct trace_seq *s;
|
|
|
|
int r;
|
|
|
|
|
|
|
|
if (*ppos)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
s = kmalloc(sizeof(*s), GFP_KERNEL);
|
|
|
|
if (!s)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
trace_seq_init(s);
|
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
print_subsystem_event_filter(system, s);
|
2009-03-24 07:14:31 +00:00
|
|
|
r = simple_read_from_buffer(ubuf, cnt, ppos, s->buffer, s->len);
|
2009-03-22 08:31:17 +00:00
|
|
|
|
|
|
|
kfree(s);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t
|
|
|
|
subsystem_filter_write(struct file *filp, const char __user *ubuf, size_t cnt,
|
|
|
|
loff_t *ppos)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir = filp->private_data;
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
char *buf;
|
2009-03-22 08:31:17 +00:00
|
|
|
int err;
|
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
if (cnt >= PAGE_SIZE)
|
2009-03-22 08:31:17 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
buf = (char *)__get_free_page(GFP_TEMPORARY);
|
|
|
|
if (!buf)
|
2009-03-22 08:31:17 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
if (copy_from_user(buf, ubuf, cnt)) {
|
|
|
|
free_page((unsigned long) buf);
|
|
|
|
return -EFAULT;
|
2009-03-22 08:31:17 +00:00
|
|
|
}
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
buf[cnt] = '\0';
|
2009-03-22 08:31:17 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
err = apply_subsystem_event_filter(dir, buf);
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
free_page((unsigned long) buf);
|
|
|
|
if (err < 0)
|
2009-04-11 07:55:28 +00:00
|
|
|
return err;
|
2009-03-22 08:31:17 +00:00
|
|
|
|
|
|
|
*ppos += cnt;
|
|
|
|
|
|
|
|
return cnt;
|
|
|
|
}
|
|
|
|
|
2009-04-15 20:53:47 +00:00
|
|
|
static ssize_t
|
|
|
|
show_header(struct file *filp, char __user *ubuf, size_t cnt, loff_t *ppos)
|
|
|
|
{
|
|
|
|
int (*func)(struct trace_seq *s) = filp->private_data;
|
|
|
|
struct trace_seq *s;
|
|
|
|
int r;
|
|
|
|
|
|
|
|
if (*ppos)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
s = kmalloc(sizeof(*s), GFP_KERNEL);
|
|
|
|
if (!s)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
trace_seq_init(s);
|
|
|
|
|
|
|
|
func(s);
|
|
|
|
r = simple_read_from_buffer(ubuf, cnt, ppos, s->buffer, s->len);
|
|
|
|
|
|
|
|
kfree(s);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2012-05-03 18:57:28 +00:00
|
|
|
static int ftrace_event_avail_open(struct inode *inode, struct file *file);
|
|
|
|
static int ftrace_event_set_open(struct inode *inode, struct file *file);
|
2013-07-18 18:18:44 +00:00
|
|
|
static int ftrace_event_release(struct inode *inode, struct file *file);
|
2012-05-03 18:57:28 +00:00
|
|
|
|
2009-02-24 15:21:36 +00:00
|
|
|
static const struct seq_operations show_event_seq_ops = {
|
|
|
|
.start = t_start,
|
|
|
|
.next = t_next,
|
|
|
|
.show = t_show,
|
|
|
|
.stop = t_stop,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct seq_operations show_set_event_seq_ops = {
|
|
|
|
.start = s_start,
|
|
|
|
.next = s_next,
|
|
|
|
.show = t_show,
|
|
|
|
.stop = t_stop,
|
|
|
|
};
|
|
|
|
|
2009-03-10 16:04:02 +00:00
|
|
|
static const struct file_operations ftrace_avail_fops = {
|
2012-05-03 18:57:28 +00:00
|
|
|
.open = ftrace_event_avail_open,
|
2009-03-10 16:04:02 +00:00
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = seq_release,
|
|
|
|
};
|
|
|
|
|
2009-02-24 15:21:36 +00:00
|
|
|
static const struct file_operations ftrace_set_event_fops = {
|
2012-05-03 18:57:28 +00:00
|
|
|
.open = ftrace_event_set_open,
|
2009-02-24 15:21:36 +00:00
|
|
|
.read = seq_read,
|
|
|
|
.write = ftrace_event_write,
|
|
|
|
.llseek = seq_lseek,
|
2013-07-18 18:18:44 +00:00
|
|
|
.release = ftrace_event_release,
|
2009-02-24 15:21:36 +00:00
|
|
|
};
|
|
|
|
|
2009-02-24 19:15:08 +00:00
|
|
|
static const struct file_operations ftrace_enable_fops = {
|
2013-07-28 18:35:27 +00:00
|
|
|
.open = tracing_open_generic,
|
2009-02-24 19:15:08 +00:00
|
|
|
.read = event_enable_read,
|
|
|
|
.write = event_enable_write,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2009-02-24 19:15:08 +00:00
|
|
|
};
|
|
|
|
|
2009-03-02 18:53:59 +00:00
|
|
|
static const struct file_operations ftrace_event_format_fops = {
|
2010-06-03 19:21:34 +00:00
|
|
|
.open = trace_format_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = seq_release,
|
2009-03-02 18:53:59 +00:00
|
|
|
};
|
|
|
|
|
2009-03-19 19:26:13 +00:00
|
|
|
static const struct file_operations ftrace_event_id_fops = {
|
|
|
|
.read = event_id_read,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2009-03-19 19:26:13 +00:00
|
|
|
};
|
|
|
|
|
2009-03-22 08:31:04 +00:00
|
|
|
static const struct file_operations ftrace_event_filter_fops = {
|
|
|
|
.open = tracing_open_generic,
|
|
|
|
.read = event_filter_read,
|
|
|
|
.write = event_filter_write,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2009-03-22 08:31:04 +00:00
|
|
|
};
|
|
|
|
|
2009-03-22 08:31:17 +00:00
|
|
|
static const struct file_operations ftrace_subsystem_filter_fops = {
|
2011-07-05 15:36:06 +00:00
|
|
|
.open = subsystem_open,
|
2009-03-22 08:31:17 +00:00
|
|
|
.read = subsystem_filter_read,
|
|
|
|
.write = subsystem_filter_write,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2011-07-05 15:36:06 +00:00
|
|
|
.release = subsystem_release,
|
2009-03-22 08:31:17 +00:00
|
|
|
};
|
|
|
|
|
2009-05-07 02:52:15 +00:00
|
|
|
static const struct file_operations ftrace_system_enable_fops = {
|
2011-07-05 18:32:51 +00:00
|
|
|
.open = subsystem_open,
|
2009-05-07 02:52:15 +00:00
|
|
|
.read = system_enable_read,
|
|
|
|
.write = system_enable_write,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2011-07-05 18:32:51 +00:00
|
|
|
.release = subsystem_release,
|
2009-05-07 02:52:15 +00:00
|
|
|
};
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
static const struct file_operations ftrace_tr_enable_fops = {
|
|
|
|
.open = system_tr_open,
|
|
|
|
.read = system_enable_read,
|
|
|
|
.write = system_enable_write,
|
|
|
|
.llseek = default_llseek,
|
|
|
|
.release = subsystem_release,
|
|
|
|
};
|
|
|
|
|
2009-04-15 20:53:47 +00:00
|
|
|
static const struct file_operations ftrace_show_header_fops = {
|
|
|
|
.open = tracing_open_generic,
|
|
|
|
.read = show_header,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2009-04-15 20:53:47 +00:00
|
|
|
};
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
static int
|
|
|
|
ftrace_event_open(struct inode *inode, struct file *file,
|
|
|
|
const struct seq_operations *seq_ops)
|
2009-02-24 19:15:08 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct seq_file *m;
|
|
|
|
int ret;
|
2009-02-24 19:15:08 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = seq_open(file, seq_ops);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
m = file->private_data;
|
|
|
|
/* copy tr over to seq ops */
|
|
|
|
m->private = inode->i_private;
|
2009-02-24 19:15:08 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
return ret;
|
2009-02-24 19:15:08 +00:00
|
|
|
}
|
|
|
|
|
2013-07-18 18:18:44 +00:00
|
|
|
static int ftrace_event_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct trace_array *tr = inode->i_private;
|
|
|
|
|
|
|
|
trace_array_put(tr);
|
|
|
|
|
|
|
|
return seq_release(inode, file);
|
|
|
|
}
|
|
|
|
|
2012-05-03 18:57:28 +00:00
|
|
|
static int
|
|
|
|
ftrace_event_avail_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
const struct seq_operations *seq_ops = &show_event_seq_ops;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
return ftrace_event_open(inode, file, seq_ops);
|
2012-05-03 18:57:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
ftrace_event_set_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
const struct seq_operations *seq_ops = &show_set_event_seq_ops;
|
2012-05-04 03:09:03 +00:00
|
|
|
struct trace_array *tr = inode->i_private;
|
2013-07-18 18:18:44 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (trace_array_get(tr) < 0)
|
|
|
|
return -ENODEV;
|
2012-05-03 18:57:28 +00:00
|
|
|
|
|
|
|
if ((file->f_mode & FMODE_WRITE) &&
|
|
|
|
(file->f_flags & O_TRUNC))
|
2012-05-04 03:09:03 +00:00
|
|
|
ftrace_clear_events(tr);
|
2012-05-03 18:57:28 +00:00
|
|
|
|
2013-07-18 18:18:44 +00:00
|
|
|
ret = ftrace_event_open(inode, file, seq_ops);
|
|
|
|
if (ret < 0)
|
|
|
|
trace_array_put(tr);
|
|
|
|
return ret;
|
2012-05-04 03:09:03 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct event_subsystem *
|
|
|
|
create_new_subsystem(const char *name)
|
|
|
|
{
|
|
|
|
struct event_subsystem *system;
|
|
|
|
|
|
|
|
/* need to create new entry */
|
|
|
|
system = kmalloc(sizeof(*system), GFP_KERNEL);
|
|
|
|
if (!system)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
system->ref_count = 1;
|
2013-06-27 14:58:31 +00:00
|
|
|
|
|
|
|
/* Only allocate if dynamic (kprobes and modules) */
|
|
|
|
if (!core_kernel_data((unsigned long)name)) {
|
|
|
|
system->ref_count |= SYSTEM_FL_FREE_NAME;
|
|
|
|
system->name = kstrdup(name, GFP_KERNEL);
|
|
|
|
if (!system->name)
|
|
|
|
goto out_free;
|
|
|
|
} else
|
|
|
|
system->name = name;
|
2012-05-04 03:09:03 +00:00
|
|
|
|
|
|
|
system->filter = NULL;
|
|
|
|
|
|
|
|
system->filter = kzalloc(sizeof(struct event_filter), GFP_KERNEL);
|
|
|
|
if (!system->filter)
|
|
|
|
goto out_free;
|
|
|
|
|
|
|
|
list_add(&system->list, &event_subsystems);
|
|
|
|
|
|
|
|
return system;
|
|
|
|
|
|
|
|
out_free:
|
2013-06-27 14:58:31 +00:00
|
|
|
if (system->ref_count & SYSTEM_FL_FREE_NAME)
|
|
|
|
kfree(system->name);
|
2012-05-04 03:09:03 +00:00
|
|
|
kfree(system);
|
|
|
|
return NULL;
|
2012-05-03 18:57:28 +00:00
|
|
|
}
|
|
|
|
|
2009-02-28 02:33:02 +00:00
|
|
|
static struct dentry *
|
2012-05-04 03:09:03 +00:00
|
|
|
event_subsystem_dir(struct trace_array *tr, const char *name,
|
|
|
|
struct ftrace_event_file *file, struct dentry *parent)
|
2009-02-28 02:33:02 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir;
|
2009-02-28 02:33:02 +00:00
|
|
|
struct event_subsystem *system;
|
2009-03-31 05:48:49 +00:00
|
|
|
struct dentry *entry;
|
2009-02-28 02:33:02 +00:00
|
|
|
|
|
|
|
/* First see if we did not already create this dir */
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry(dir, &tr->systems, list) {
|
|
|
|
system = dir->subsystem;
|
2009-07-09 08:22:22 +00:00
|
|
|
if (strcmp(system->name, name) == 0) {
|
2012-05-04 03:09:03 +00:00
|
|
|
dir->nr_events++;
|
|
|
|
file->system = dir;
|
|
|
|
return dir->entry;
|
2009-07-09 08:22:22 +00:00
|
|
|
}
|
2009-02-28 02:33:02 +00:00
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
/* Now see if the system itself exists. */
|
|
|
|
list_for_each_entry(system, &event_subsystems, list) {
|
|
|
|
if (strcmp(system->name, name) == 0)
|
|
|
|
break;
|
2009-02-28 02:33:02 +00:00
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
/* Reset system variable when not found */
|
|
|
|
if (&system->list == &event_subsystems)
|
|
|
|
system = NULL;
|
2009-02-28 02:33:02 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
dir = kmalloc(sizeof(*dir), GFP_KERNEL);
|
|
|
|
if (!dir)
|
|
|
|
goto out_fail;
|
2009-02-28 02:33:02 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
if (!system) {
|
|
|
|
system = create_new_subsystem(name);
|
|
|
|
if (!system)
|
|
|
|
goto out_free;
|
|
|
|
} else
|
|
|
|
__get_system(system);
|
|
|
|
|
|
|
|
dir->entry = debugfs_create_dir(name, parent);
|
|
|
|
if (!dir->entry) {
|
|
|
|
pr_warning("Failed to create system directory %s\n", name);
|
|
|
|
__put_system(system);
|
|
|
|
goto out_free;
|
2009-04-10 18:53:50 +00:00
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
dir->tr = tr;
|
|
|
|
dir->ref_count = 1;
|
|
|
|
dir->nr_events = 1;
|
|
|
|
dir->subsystem = system;
|
|
|
|
file->system = dir;
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
entry = debugfs_create_file("filter", 0644, dir->entry, dir,
|
2009-03-31 05:48:49 +00:00
|
|
|
&ftrace_subsystem_filter_fops);
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
if (!entry) {
|
|
|
|
kfree(system->filter);
|
|
|
|
system->filter = NULL;
|
2012-05-04 03:09:03 +00:00
|
|
|
pr_warning("Could not create debugfs '%s/filter' entry\n", name);
|
tracing/filters: a better event parser
Replace the current event parser hack with a better one. Filters are
no longer specified predicate by predicate, but all at once and can
use parens and any of the following operators:
numeric fields:
==, !=, <, <=, >, >=
string fields:
==, !=
predicates can be combined with the logical operators:
&&, ||
examples:
"common_preempt_count > 4" > filter
"((sig >= 10 && sig < 15) || sig == 17) && comm != bash" > filter
If there was an error, the erroneous string along with an error
message can be seen by looking at the filter e.g.:
((sig >= 10 && sig < 15) || dsig == 17) && comm != bash
^
parse_error: Field not found
Currently the caret for an error always appears at the beginning of
the filter; a real position should be used, but the error message
should be useful even without it.
To clear a filter, '0' can be written to the filter file.
Filters can also be set or cleared for a complete subsystem by writing
the same filter as would be written to an individual event to the
filter file at the root of the subsytem. Note however, that if any
event in the subsystem lacks a field specified in the filter being
set, the set will fail and all filters in the subsytem are
automatically cleared. This change from the previous version was made
because using only the fields that happen to exist for a given event
would most likely result in a meaningless filter.
Because the logical operators are now implemented as predicates, the
maximum number of predicates in a filter was increased from 8 to 16.
[ Impact: add new, extended trace-filter implementation ]
Signed-off-by: Tom Zanussi <tzanussi@gmail.com>
Acked-by: Steven Rostedt <rostedt@goodmis.org>
Cc: fweisbec@gmail.com
Cc: Li Zefan <lizf@cn.fujitsu.com>
LKML-Reference: <1240905899.6416.121.camel@tropicana>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2009-04-28 08:04:59 +00:00
|
|
|
}
|
2009-03-31 05:48:49 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
trace_create_file("enable", 0644, dir->entry, dir,
|
2009-09-24 13:27:41 +00:00
|
|
|
&ftrace_system_enable_fops);
|
2009-05-07 02:52:15 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_add(&dir->list, &tr->systems);
|
|
|
|
|
|
|
|
return dir->entry;
|
|
|
|
|
|
|
|
out_free:
|
|
|
|
kfree(dir);
|
|
|
|
out_fail:
|
|
|
|
/* Only print this message if failed on memory allocation */
|
|
|
|
if (!dir || !system)
|
|
|
|
pr_warning("No memory to create event subsystem %s\n",
|
|
|
|
name);
|
|
|
|
return NULL;
|
2009-02-28 02:33:02 +00:00
|
|
|
}
|
|
|
|
|
2009-02-24 19:15:08 +00:00
|
|
|
static int
|
2012-05-04 03:09:03 +00:00
|
|
|
event_create_dir(struct dentry *parent,
|
|
|
|
struct ftrace_event_file *file,
|
2009-04-25 03:11:22 +00:00
|
|
|
const struct file_operations *id,
|
|
|
|
const struct file_operations *enable,
|
|
|
|
const struct file_operations *filter,
|
|
|
|
const struct file_operations *format)
|
2009-02-24 19:15:08 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_event_call *call = file->event_call;
|
|
|
|
struct trace_array *tr = file->tr;
|
2010-04-22 14:35:55 +00:00
|
|
|
struct list_head *head;
|
2012-05-04 03:09:03 +00:00
|
|
|
struct dentry *d_events;
|
2009-02-28 07:41:25 +00:00
|
|
|
int ret;
|
2009-02-24 19:15:08 +00:00
|
|
|
|
2009-02-28 02:33:02 +00:00
|
|
|
/*
|
|
|
|
* If the trace point header did not define TRACE_SYSTEM
|
|
|
|
* then the system would be called "TRACE_SYSTEM".
|
|
|
|
*/
|
2012-05-04 03:09:03 +00:00
|
|
|
if (strcmp(call->class->system, TRACE_SYSTEM) != 0) {
|
|
|
|
d_events = event_subsystem_dir(tr, call->class->system, file, parent);
|
|
|
|
if (!d_events)
|
|
|
|
return -ENOMEM;
|
|
|
|
} else
|
|
|
|
d_events = parent;
|
|
|
|
|
|
|
|
file->dir = debugfs_create_dir(call->name, d_events);
|
|
|
|
if (!file->dir) {
|
|
|
|
pr_warning("Could not create debugfs '%s' directory\n",
|
|
|
|
call->name);
|
2009-02-24 19:15:08 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2012-05-10 19:55:43 +00:00
|
|
|
if (call->class->reg && !(call->flags & TRACE_EVENT_FL_IGNORE_ENABLE))
|
2012-05-04 03:09:03 +00:00
|
|
|
trace_create_file("enable", 0644, file->dir, file,
|
2009-09-24 13:27:41 +00:00
|
|
|
enable);
|
2009-02-24 19:15:08 +00:00
|
|
|
|
2010-04-21 16:27:06 +00:00
|
|
|
#ifdef CONFIG_PERF_EVENTS
|
2010-06-08 15:22:06 +00:00
|
|
|
if (call->event.type && call->class->reg)
|
2013-07-26 17:25:32 +00:00
|
|
|
trace_create_file("id", 0444, file->dir,
|
|
|
|
(void *)(long)call->event.type, id);
|
2010-04-21 16:27:06 +00:00
|
|
|
#endif
|
2009-03-19 19:26:13 +00:00
|
|
|
|
2010-05-24 08:24:28 +00:00
|
|
|
/*
|
|
|
|
* Other events may have the same class. Only update
|
|
|
|
* the fields if they are not already defined.
|
|
|
|
*/
|
|
|
|
head = trace_get_fields(call);
|
|
|
|
if (list_empty(head)) {
|
|
|
|
ret = call->class->define_fields(call);
|
|
|
|
if (ret < 0) {
|
|
|
|
pr_warning("Could not initialize trace point"
|
|
|
|
" events/%s\n", call->name);
|
2012-05-04 03:09:03 +00:00
|
|
|
return -1;
|
2009-03-22 08:30:39 +00:00
|
|
|
}
|
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
trace_create_file("filter", 0644, file->dir, call,
|
2010-05-24 08:24:28 +00:00
|
|
|
filter);
|
2009-03-22 08:30:39 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
trace_create_file("format", 0444, file->dir, call,
|
2009-09-24 13:27:41 +00:00
|
|
|
format);
|
2009-04-10 18:53:50 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
static void remove_event_from_tracers(struct ftrace_event_call *call)
|
|
|
|
{
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
struct trace_array *tr;
|
|
|
|
|
|
|
|
do_for_each_event_file_safe(tr, file) {
|
|
|
|
if (file->event_call != call)
|
|
|
|
continue;
|
|
|
|
|
2013-07-26 17:25:47 +00:00
|
|
|
remove_event_file_dir(file);
|
2012-05-04 03:09:03 +00:00
|
|
|
/*
|
|
|
|
* The do_for_each_event_file_safe() is
|
|
|
|
* a double loop. After finding the call for this
|
|
|
|
* trace_array, we use break to jump to the next
|
|
|
|
* trace_array.
|
|
|
|
*/
|
|
|
|
break;
|
|
|
|
} while_for_each_event_file();
|
|
|
|
}
|
|
|
|
|
2012-09-12 14:47:57 +00:00
|
|
|
static void event_remove(struct ftrace_event_call *call)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct trace_array *tr;
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
|
|
|
|
do_for_each_event_file(tr, file) {
|
|
|
|
if (file->event_call != call)
|
|
|
|
continue;
|
|
|
|
ftrace_event_enable_disable(file, 0);
|
|
|
|
/*
|
|
|
|
* The do_for_each_event_file() is
|
|
|
|
* a double loop. After finding the call for this
|
|
|
|
* trace_array, we use break to jump to the next
|
|
|
|
* trace_array.
|
|
|
|
*/
|
|
|
|
break;
|
|
|
|
} while_for_each_event_file();
|
|
|
|
|
2012-09-12 14:47:57 +00:00
|
|
|
if (call->event.funcs)
|
|
|
|
__unregister_ftrace_event(&call->event);
|
2012-05-04 03:09:03 +00:00
|
|
|
remove_event_from_tracers(call);
|
2012-09-12 14:47:57 +00:00
|
|
|
list_del(&call->list);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int event_init(struct ftrace_event_call *call)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (WARN_ON(!call->name))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (call->class->raw_init) {
|
|
|
|
ret = call->class->raw_init(call);
|
|
|
|
if (ret < 0 && ret != -ENOSYS)
|
|
|
|
pr_warn("Could not initialize trace events/%s\n",
|
|
|
|
call->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2010-05-24 08:25:13 +00:00
|
|
|
static int
|
2012-05-04 03:09:03 +00:00
|
|
|
__register_event(struct ftrace_event_call *call, struct module *mod)
|
2009-08-13 20:34:53 +00:00
|
|
|
{
|
|
|
|
int ret;
|
2009-04-10 18:53:50 +00:00
|
|
|
|
2012-09-12 14:47:57 +00:00
|
|
|
ret = event_init(call);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
2009-04-25 03:11:22 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_add(&call->list, &ftrace_events);
|
2010-05-24 08:25:13 +00:00
|
|
|
call->mod = mod;
|
2009-09-25 18:20:54 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
return 0;
|
2009-08-13 20:34:53 +00:00
|
|
|
}
|
|
|
|
|
2013-05-09 19:00:07 +00:00
|
|
|
static struct ftrace_event_file *
|
|
|
|
trace_create_new_event(struct ftrace_event_call *call,
|
|
|
|
struct trace_array *tr)
|
|
|
|
{
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
|
|
|
|
file = kmem_cache_alloc(file_cachep, GFP_TRACE);
|
|
|
|
if (!file)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
file->event_call = call;
|
|
|
|
file->tr = tr;
|
|
|
|
atomic_set(&file->sm_ref, 0);
|
|
|
|
list_add(&file->list, &tr->events);
|
|
|
|
|
|
|
|
return file;
|
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
/* Add an event to a trace directory */
|
|
|
|
static int
|
|
|
|
__trace_add_new_event(struct ftrace_event_call *call,
|
|
|
|
struct trace_array *tr,
|
|
|
|
const struct file_operations *id,
|
|
|
|
const struct file_operations *enable,
|
|
|
|
const struct file_operations *filter,
|
|
|
|
const struct file_operations *format)
|
|
|
|
{
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
|
2013-05-09 19:00:07 +00:00
|
|
|
file = trace_create_new_event(call, tr);
|
2012-05-04 03:09:03 +00:00
|
|
|
if (!file)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
return event_create_dir(tr->event_dir, file, id, enable, filter, format);
|
|
|
|
}
|
|
|
|
|
2013-02-27 21:28:06 +00:00
|
|
|
/*
|
|
|
|
* Just create a decriptor for early init. A descriptor is required
|
|
|
|
* for enabling events at boot. We want to enable events before
|
|
|
|
* the filesystem is initialized.
|
|
|
|
*/
|
|
|
|
static __init int
|
|
|
|
__trace_early_add_new_event(struct ftrace_event_call *call,
|
|
|
|
struct trace_array *tr)
|
|
|
|
{
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
|
2013-05-09 19:00:07 +00:00
|
|
|
file = trace_create_new_event(call, tr);
|
2013-02-27 21:28:06 +00:00
|
|
|
if (!file)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_module_file_ops;
|
|
|
|
static void __add_event_to_tracers(struct ftrace_event_call *call,
|
|
|
|
struct ftrace_module_file_ops *file_ops);
|
|
|
|
|
2009-08-13 20:34:53 +00:00
|
|
|
/* Add an additional event_call dynamically */
|
|
|
|
int trace_add_event_call(struct ftrace_event_call *call)
|
|
|
|
{
|
|
|
|
int ret;
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_lock(&trace_types_lock);
|
2009-08-13 20:34:53 +00:00
|
|
|
mutex_lock(&event_mutex);
|
2009-04-25 03:11:22 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = __register_event(call, NULL);
|
|
|
|
if (ret >= 0)
|
|
|
|
__add_event_to_tracers(call, NULL);
|
2009-08-06 05:32:21 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_unlock(&trace_types_lock);
|
2012-05-04 03:09:03 +00:00
|
|
|
return ret;
|
2009-08-06 05:32:21 +00:00
|
|
|
}
|
|
|
|
|
2009-09-14 20:49:12 +00:00
|
|
|
/*
|
2013-07-02 02:37:54 +00:00
|
|
|
* Must be called under locking of trace_types_lock, event_mutex and
|
|
|
|
* trace_event_sem.
|
2009-09-14 20:49:12 +00:00
|
|
|
*/
|
2009-08-13 20:34:53 +00:00
|
|
|
static void __trace_remove_event_call(struct ftrace_event_call *call)
|
|
|
|
{
|
2012-09-12 14:47:57 +00:00
|
|
|
event_remove(call);
|
2009-08-13 20:34:53 +00:00
|
|
|
trace_destroy_fields(call);
|
|
|
|
destroy_preds(call);
|
|
|
|
}
|
|
|
|
|
2013-07-29 17:50:33 +00:00
|
|
|
static int probe_remove_event_call(struct ftrace_event_call *call)
|
|
|
|
{
|
|
|
|
struct trace_array *tr;
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
|
|
|
|
#ifdef CONFIG_PERF_EVENTS
|
|
|
|
if (call->perf_refcount)
|
|
|
|
return -EBUSY;
|
|
|
|
#endif
|
|
|
|
do_for_each_event_file(tr, file) {
|
|
|
|
if (file->event_call != call)
|
|
|
|
continue;
|
|
|
|
/*
|
|
|
|
* We can't rely on ftrace_event_enable_disable(enable => 0)
|
|
|
|
* we are going to do, FTRACE_EVENT_FL_SOFT_MODE can suppress
|
|
|
|
* TRACE_REG_UNREGISTER.
|
|
|
|
*/
|
|
|
|
if (file->flags & FTRACE_EVENT_FL_ENABLED)
|
|
|
|
return -EBUSY;
|
2013-07-31 17:16:22 +00:00
|
|
|
/*
|
|
|
|
* The do_for_each_event_file_safe() is
|
|
|
|
* a double loop. After finding the call for this
|
|
|
|
* trace_array, we use break to jump to the next
|
|
|
|
* trace_array.
|
|
|
|
*/
|
2013-07-29 17:50:33 +00:00
|
|
|
break;
|
|
|
|
} while_for_each_event_file();
|
|
|
|
|
|
|
|
__trace_remove_event_call(call);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-08-13 20:34:53 +00:00
|
|
|
/* Remove an event_call */
|
2013-07-29 17:50:33 +00:00
|
|
|
int trace_remove_event_call(struct ftrace_event_call *call)
|
2009-08-13 20:34:53 +00:00
|
|
|
{
|
2013-07-29 17:50:33 +00:00
|
|
|
int ret;
|
|
|
|
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_lock(&trace_types_lock);
|
2009-08-13 20:34:53 +00:00
|
|
|
mutex_lock(&event_mutex);
|
2013-03-11 07:14:03 +00:00
|
|
|
down_write(&trace_event_sem);
|
2013-07-29 17:50:33 +00:00
|
|
|
ret = probe_remove_event_call(call);
|
2013-03-11 07:14:03 +00:00
|
|
|
up_write(&trace_event_sem);
|
2009-08-13 20:34:53 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_unlock(&trace_types_lock);
|
2013-07-29 17:50:33 +00:00
|
|
|
|
|
|
|
return ret;
|
2009-08-13 20:34:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#define for_each_event(event, start, end) \
|
|
|
|
for (event = start; \
|
|
|
|
(unsigned long)event < (unsigned long)end; \
|
|
|
|
event++)
|
|
|
|
|
|
|
|
#ifdef CONFIG_MODULES
|
|
|
|
|
|
|
|
static LIST_HEAD(ftrace_module_file_list);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Modules must own their file_operations to keep up with
|
|
|
|
* reference counting.
|
|
|
|
*/
|
|
|
|
struct ftrace_module_file_ops {
|
|
|
|
struct list_head list;
|
|
|
|
struct module *mod;
|
|
|
|
struct file_operations id;
|
|
|
|
struct file_operations enable;
|
|
|
|
struct file_operations format;
|
|
|
|
struct file_operations filter;
|
|
|
|
};
|
|
|
|
|
2013-03-02 22:37:14 +00:00
|
|
|
static struct ftrace_module_file_ops *
|
|
|
|
find_ftrace_file_ops(struct ftrace_module_file_ops *file_ops, struct module *mod)
|
2012-05-04 03:09:03 +00:00
|
|
|
{
|
2013-03-02 22:37:14 +00:00
|
|
|
/*
|
|
|
|
* As event_calls are added in groups by module,
|
|
|
|
* when we find one file_ops, we don't need to search for
|
|
|
|
* each call in that module, as the rest should be the
|
|
|
|
* same. Only search for a new one if the last one did
|
|
|
|
* not match.
|
|
|
|
*/
|
|
|
|
if (file_ops && mod == file_ops->mod)
|
|
|
|
return file_ops;
|
2012-05-04 03:09:03 +00:00
|
|
|
|
|
|
|
list_for_each_entry(file_ops, &ftrace_module_file_list, list) {
|
|
|
|
if (file_ops->mod == mod)
|
|
|
|
return file_ops;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2009-04-25 03:11:22 +00:00
|
|
|
static struct ftrace_module_file_ops *
|
|
|
|
trace_create_file_ops(struct module *mod)
|
|
|
|
{
|
|
|
|
struct ftrace_module_file_ops *file_ops;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is a bit of a PITA. To allow for correct reference
|
|
|
|
* counting, modules must "own" their file_operations.
|
|
|
|
* To do this, we allocate the file operations that will be
|
|
|
|
* used in the event directory.
|
|
|
|
*/
|
|
|
|
|
|
|
|
file_ops = kmalloc(sizeof(*file_ops), GFP_KERNEL);
|
|
|
|
if (!file_ops)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
file_ops->mod = mod;
|
|
|
|
|
|
|
|
file_ops->id = ftrace_event_id_fops;
|
|
|
|
file_ops->id.owner = mod;
|
|
|
|
|
|
|
|
file_ops->enable = ftrace_enable_fops;
|
|
|
|
file_ops->enable.owner = mod;
|
|
|
|
|
|
|
|
file_ops->filter = ftrace_event_filter_fops;
|
|
|
|
file_ops->filter.owner = mod;
|
|
|
|
|
|
|
|
file_ops->format = ftrace_event_format_fops;
|
|
|
|
file_ops->format.owner = mod;
|
|
|
|
|
|
|
|
list_add(&file_ops->list, &ftrace_module_file_list);
|
|
|
|
|
|
|
|
return file_ops;
|
|
|
|
}
|
|
|
|
|
2009-04-10 18:53:50 +00:00
|
|
|
static void trace_module_add_events(struct module *mod)
|
|
|
|
{
|
2009-04-25 03:11:22 +00:00
|
|
|
struct ftrace_module_file_ops *file_ops = NULL;
|
tracing: Replace trace_event struct array with pointer array
Currently the trace_event structures are placed in the _ftrace_events
section, and at link time, the linker makes one large array of all
the trace_event structures. On boot up, this array is read (much like
the initcall sections) and the events are processed.
The problem is that there is no guarantee that gcc will place complex
structures nicely together in an array format. Two structures in the
same file may be placed awkwardly, because gcc has no clue that they
are suppose to be in an array.
A hack was used previous to force the alignment to 4, to pack the
structures together. But this caused alignment issues with other
architectures (sparc).
Instead of packing the structures into an array, the structures' addresses
are now put into the _ftrace_event section. As pointers are always the
natural alignment, gcc should always pack them tightly together
(otherwise initcall, extable, etc would also fail).
By having the pointers to the structures in the section, we can still
iterate the trace_events without causing unnecessary alignment problems
with other architectures, or depending on the current behaviour of
gcc that will likely change in the future just to tick us kernel developers
off a little more.
The _ftrace_event section is also moved into the .init.data section
as it is now only needed at boot up.
Suggested-by: David Miller <davem@davemloft.net>
Cc: Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
Acked-by: David S. Miller <davem@davemloft.net>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2011-01-27 14:15:30 +00:00
|
|
|
struct ftrace_event_call **call, **start, **end;
|
2009-04-10 18:53:50 +00:00
|
|
|
|
|
|
|
start = mod->trace_events;
|
|
|
|
end = mod->trace_events + mod->num_trace_events;
|
|
|
|
|
|
|
|
if (start == end)
|
|
|
|
return;
|
|
|
|
|
2010-05-24 08:25:13 +00:00
|
|
|
file_ops = trace_create_file_ops(mod);
|
|
|
|
if (!file_ops)
|
2009-04-10 18:53:50 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
for_each_event(call, start, end) {
|
2012-05-04 03:09:03 +00:00
|
|
|
__register_event(*call, mod);
|
|
|
|
__add_event_to_tracers(*call, file_ops);
|
2009-04-10 18:53:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void trace_module_remove_events(struct module *mod)
|
|
|
|
{
|
2009-04-25 03:11:22 +00:00
|
|
|
struct ftrace_module_file_ops *file_ops;
|
2009-04-10 18:53:50 +00:00
|
|
|
struct ftrace_event_call *call, *p;
|
2013-03-05 04:05:12 +00:00
|
|
|
bool clear_trace = false;
|
2009-04-10 18:53:50 +00:00
|
|
|
|
2013-03-11 07:14:03 +00:00
|
|
|
down_write(&trace_event_sem);
|
2009-04-10 18:53:50 +00:00
|
|
|
list_for_each_entry_safe(call, p, &ftrace_events, list) {
|
|
|
|
if (call->mod == mod) {
|
2013-03-05 04:05:12 +00:00
|
|
|
if (call->flags & TRACE_EVENT_FL_WAS_ENABLED)
|
|
|
|
clear_trace = true;
|
2009-08-13 20:34:53 +00:00
|
|
|
__trace_remove_event_call(call);
|
2009-04-10 18:53:50 +00:00
|
|
|
}
|
|
|
|
}
|
2009-04-25 03:11:22 +00:00
|
|
|
|
|
|
|
/* Now free the file_operations */
|
|
|
|
list_for_each_entry(file_ops, &ftrace_module_file_list, list) {
|
|
|
|
if (file_ops->mod == mod)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (&file_ops->list != &ftrace_module_file_list) {
|
|
|
|
list_del(&file_ops->list);
|
|
|
|
kfree(file_ops);
|
|
|
|
}
|
2013-03-11 07:14:03 +00:00
|
|
|
up_write(&trace_event_sem);
|
2009-05-07 01:54:09 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* It is safest to reset the ring buffer if the module being unloaded
|
2013-03-05 04:26:06 +00:00
|
|
|
* registered any events that were used. The only worry is if
|
|
|
|
* a new module gets loaded, and takes on the same id as the events
|
|
|
|
* of this module. When printing out the buffer, traced events left
|
|
|
|
* over from this module may be passed to the new module events and
|
|
|
|
* unexpected results may occur.
|
2009-05-07 01:54:09 +00:00
|
|
|
*/
|
2013-03-05 04:05:12 +00:00
|
|
|
if (clear_trace)
|
2013-03-05 04:26:06 +00:00
|
|
|
tracing_reset_all_online_cpus();
|
2009-04-10 18:53:50 +00:00
|
|
|
}
|
|
|
|
|
2009-04-14 22:22:32 +00:00
|
|
|
static int trace_module_notify(struct notifier_block *self,
|
|
|
|
unsigned long val, void *data)
|
2009-04-10 18:53:50 +00:00
|
|
|
{
|
|
|
|
struct module *mod = data;
|
|
|
|
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_lock(&trace_types_lock);
|
2009-04-10 18:53:50 +00:00
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
switch (val) {
|
|
|
|
case MODULE_STATE_COMING:
|
|
|
|
trace_module_add_events(mod);
|
|
|
|
break;
|
|
|
|
case MODULE_STATE_GOING:
|
|
|
|
trace_module_remove_events(mod);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
mutex_unlock(&event_mutex);
|
2013-07-02 02:37:54 +00:00
|
|
|
mutex_unlock(&trace_types_lock);
|
2009-02-28 07:41:25 +00:00
|
|
|
|
2009-02-24 19:15:08 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2013-03-02 22:37:14 +00:00
|
|
|
|
|
|
|
static int
|
|
|
|
__trace_add_new_mod_event(struct ftrace_event_call *call,
|
|
|
|
struct trace_array *tr,
|
|
|
|
struct ftrace_module_file_ops *file_ops)
|
|
|
|
{
|
|
|
|
return __trace_add_new_event(call, tr,
|
|
|
|
&file_ops->id, &file_ops->enable,
|
|
|
|
&file_ops->filter, &file_ops->format);
|
|
|
|
}
|
|
|
|
|
2009-04-14 22:22:32 +00:00
|
|
|
#else
|
2013-03-02 22:37:14 +00:00
|
|
|
static inline struct ftrace_module_file_ops *
|
|
|
|
find_ftrace_file_ops(struct ftrace_module_file_ops *file_ops, struct module *mod)
|
2012-05-04 03:09:03 +00:00
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
2013-03-02 22:37:14 +00:00
|
|
|
static inline int trace_module_notify(struct notifier_block *self,
|
|
|
|
unsigned long val, void *data)
|
2009-04-14 22:22:32 +00:00
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2013-03-02 22:37:14 +00:00
|
|
|
static inline int
|
|
|
|
__trace_add_new_mod_event(struct ftrace_event_call *call,
|
|
|
|
struct trace_array *tr,
|
|
|
|
struct ftrace_module_file_ops *file_ops)
|
|
|
|
{
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
2009-04-14 22:22:32 +00:00
|
|
|
#endif /* CONFIG_MODULES */
|
2009-02-24 19:15:08 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
/* Create a new event directory structure for a trace directory. */
|
|
|
|
static void
|
|
|
|
__trace_add_event_dirs(struct trace_array *tr)
|
|
|
|
{
|
|
|
|
struct ftrace_module_file_ops *file_ops = NULL;
|
|
|
|
struct ftrace_event_call *call;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
list_for_each_entry(call, &ftrace_events, list) {
|
|
|
|
if (call->mod) {
|
|
|
|
/*
|
|
|
|
* Directories for events by modules need to
|
|
|
|
* keep module ref counts when opened (as we don't
|
|
|
|
* want the module to disappear when reading one
|
|
|
|
* of these files). The file_ops keep account of
|
|
|
|
* the module ref count.
|
|
|
|
*/
|
2013-03-02 22:37:14 +00:00
|
|
|
file_ops = find_ftrace_file_ops(file_ops, call->mod);
|
2012-05-04 03:09:03 +00:00
|
|
|
if (!file_ops)
|
|
|
|
continue; /* Warn? */
|
2013-03-02 22:37:14 +00:00
|
|
|
ret = __trace_add_new_mod_event(call, tr, file_ops);
|
2012-05-04 03:09:03 +00:00
|
|
|
if (ret < 0)
|
|
|
|
pr_warning("Could not create directory for event %s\n",
|
|
|
|
call->name);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
ret = __trace_add_new_event(call, tr,
|
|
|
|
&ftrace_event_id_fops,
|
|
|
|
&ftrace_enable_fops,
|
|
|
|
&ftrace_event_filter_fops,
|
|
|
|
&ftrace_event_format_fops);
|
|
|
|
if (ret < 0)
|
|
|
|
pr_warning("Could not create directory for event %s\n",
|
|
|
|
call->name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-12 23:35:13 +00:00
|
|
|
#ifdef CONFIG_DYNAMIC_FTRACE
|
|
|
|
|
|
|
|
/* Avoid typos */
|
|
|
|
#define ENABLE_EVENT_STR "enable_event"
|
|
|
|
#define DISABLE_EVENT_STR "disable_event"
|
|
|
|
|
|
|
|
struct event_probe_data {
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
unsigned long count;
|
|
|
|
int ref;
|
|
|
|
bool enable;
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ftrace_event_file *
|
|
|
|
find_event_file(struct trace_array *tr, const char *system, const char *event)
|
|
|
|
{
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
struct ftrace_event_call *call;
|
|
|
|
|
|
|
|
list_for_each_entry(file, &tr->events, list) {
|
|
|
|
|
|
|
|
call = file->event_call;
|
|
|
|
|
|
|
|
if (!call->name || !call->class || !call->class->reg)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (call->flags & TRACE_EVENT_FL_IGNORE_ENABLE)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (strcmp(event, call->name) == 0 &&
|
|
|
|
strcmp(system, call->class->system) == 0)
|
|
|
|
return file;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
event_enable_probe(unsigned long ip, unsigned long parent_ip, void **_data)
|
|
|
|
{
|
|
|
|
struct event_probe_data **pdata = (struct event_probe_data **)_data;
|
|
|
|
struct event_probe_data *data = *pdata;
|
|
|
|
|
|
|
|
if (!data)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (data->enable)
|
|
|
|
clear_bit(FTRACE_EVENT_FL_SOFT_DISABLED_BIT, &data->file->flags);
|
|
|
|
else
|
|
|
|
set_bit(FTRACE_EVENT_FL_SOFT_DISABLED_BIT, &data->file->flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
event_enable_count_probe(unsigned long ip, unsigned long parent_ip, void **_data)
|
|
|
|
{
|
|
|
|
struct event_probe_data **pdata = (struct event_probe_data **)_data;
|
|
|
|
struct event_probe_data *data = *pdata;
|
|
|
|
|
|
|
|
if (!data)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (!data->count)
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* Skip if the event is in a state we want to switch to */
|
|
|
|
if (data->enable == !(data->file->flags & FTRACE_EVENT_FL_SOFT_DISABLED))
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (data->count != -1)
|
|
|
|
(data->count)--;
|
|
|
|
|
|
|
|
event_enable_probe(ip, parent_ip, _data);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
event_enable_print(struct seq_file *m, unsigned long ip,
|
|
|
|
struct ftrace_probe_ops *ops, void *_data)
|
|
|
|
{
|
|
|
|
struct event_probe_data *data = _data;
|
|
|
|
|
|
|
|
seq_printf(m, "%ps:", (void *)ip);
|
|
|
|
|
|
|
|
seq_printf(m, "%s:%s:%s",
|
|
|
|
data->enable ? ENABLE_EVENT_STR : DISABLE_EVENT_STR,
|
|
|
|
data->file->event_call->class->system,
|
|
|
|
data->file->event_call->name);
|
|
|
|
|
|
|
|
if (data->count == -1)
|
|
|
|
seq_printf(m, ":unlimited\n");
|
|
|
|
else
|
|
|
|
seq_printf(m, ":count=%ld\n", data->count);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
event_enable_init(struct ftrace_probe_ops *ops, unsigned long ip,
|
|
|
|
void **_data)
|
|
|
|
{
|
|
|
|
struct event_probe_data **pdata = (struct event_probe_data **)_data;
|
|
|
|
struct event_probe_data *data = *pdata;
|
|
|
|
|
|
|
|
data->ref++;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
event_enable_free(struct ftrace_probe_ops *ops, unsigned long ip,
|
|
|
|
void **_data)
|
|
|
|
{
|
|
|
|
struct event_probe_data **pdata = (struct event_probe_data **)_data;
|
|
|
|
struct event_probe_data *data = *pdata;
|
|
|
|
|
|
|
|
if (WARN_ON_ONCE(data->ref <= 0))
|
|
|
|
return;
|
|
|
|
|
|
|
|
data->ref--;
|
|
|
|
if (!data->ref) {
|
|
|
|
/* Remove the SOFT_MODE flag */
|
|
|
|
__ftrace_event_enable_disable(data->file, 0, 1);
|
|
|
|
module_put(data->file->event_call->mod);
|
|
|
|
kfree(data);
|
|
|
|
}
|
|
|
|
*pdata = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct ftrace_probe_ops event_enable_probe_ops = {
|
|
|
|
.func = event_enable_probe,
|
|
|
|
.print = event_enable_print,
|
|
|
|
.init = event_enable_init,
|
|
|
|
.free = event_enable_free,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ftrace_probe_ops event_enable_count_probe_ops = {
|
|
|
|
.func = event_enable_count_probe,
|
|
|
|
.print = event_enable_print,
|
|
|
|
.init = event_enable_init,
|
|
|
|
.free = event_enable_free,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ftrace_probe_ops event_disable_probe_ops = {
|
|
|
|
.func = event_enable_probe,
|
|
|
|
.print = event_enable_print,
|
|
|
|
.init = event_enable_init,
|
|
|
|
.free = event_enable_free,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ftrace_probe_ops event_disable_count_probe_ops = {
|
|
|
|
.func = event_enable_count_probe,
|
|
|
|
.print = event_enable_print,
|
|
|
|
.init = event_enable_init,
|
|
|
|
.free = event_enable_free,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
event_enable_func(struct ftrace_hash *hash,
|
|
|
|
char *glob, char *cmd, char *param, int enabled)
|
|
|
|
{
|
|
|
|
struct trace_array *tr = top_trace_array();
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
struct ftrace_probe_ops *ops;
|
|
|
|
struct event_probe_data *data;
|
|
|
|
const char *system;
|
|
|
|
const char *event;
|
|
|
|
char *number;
|
|
|
|
bool enable;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* hash funcs only work with set_ftrace_filter */
|
2013-05-24 07:22:17 +00:00
|
|
|
if (!enabled || !param)
|
2013-03-12 23:35:13 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
system = strsep(¶m, ":");
|
|
|
|
if (!param)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
event = strsep(¶m, ":");
|
|
|
|
|
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
|
|
|
|
ret = -EINVAL;
|
|
|
|
file = find_event_file(tr, system, event);
|
|
|
|
if (!file)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
enable = strcmp(cmd, ENABLE_EVENT_STR) == 0;
|
|
|
|
|
|
|
|
if (enable)
|
|
|
|
ops = param ? &event_enable_count_probe_ops : &event_enable_probe_ops;
|
|
|
|
else
|
|
|
|
ops = param ? &event_disable_count_probe_ops : &event_disable_probe_ops;
|
|
|
|
|
|
|
|
if (glob[0] == '!') {
|
|
|
|
unregister_ftrace_function_probe_func(glob+1, ops);
|
|
|
|
ret = 0;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = -ENOMEM;
|
|
|
|
data = kzalloc(sizeof(*data), GFP_KERNEL);
|
|
|
|
if (!data)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
data->enable = enable;
|
|
|
|
data->count = -1;
|
|
|
|
data->file = file;
|
|
|
|
|
|
|
|
if (!param)
|
|
|
|
goto out_reg;
|
|
|
|
|
|
|
|
number = strsep(¶m, ":");
|
|
|
|
|
|
|
|
ret = -EINVAL;
|
|
|
|
if (!strlen(number))
|
|
|
|
goto out_free;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We use the callback data field (which is a pointer)
|
|
|
|
* as our counter.
|
|
|
|
*/
|
|
|
|
ret = kstrtoul(number, 0, &data->count);
|
|
|
|
if (ret)
|
|
|
|
goto out_free;
|
|
|
|
|
|
|
|
out_reg:
|
|
|
|
/* Don't let event modules unload while probe registered */
|
|
|
|
ret = try_module_get(file->event_call->mod);
|
2013-05-16 11:48:49 +00:00
|
|
|
if (!ret) {
|
|
|
|
ret = -EBUSY;
|
2013-03-12 23:35:13 +00:00
|
|
|
goto out_free;
|
2013-05-16 11:48:49 +00:00
|
|
|
}
|
2013-03-12 23:35:13 +00:00
|
|
|
|
|
|
|
ret = __ftrace_event_enable_disable(file, 1, 1);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out_put;
|
|
|
|
ret = register_ftrace_function_probe(glob, ops, data);
|
2013-05-09 15:30:26 +00:00
|
|
|
/*
|
|
|
|
* The above returns on success the # of functions enabled,
|
|
|
|
* but if it didn't find any functions it returns zero.
|
|
|
|
* Consider no functions a failure too.
|
|
|
|
*/
|
2013-05-09 05:44:14 +00:00
|
|
|
if (!ret) {
|
|
|
|
ret = -ENOENT;
|
2013-03-12 23:35:13 +00:00
|
|
|
goto out_disable;
|
2013-05-09 15:30:26 +00:00
|
|
|
} else if (ret < 0)
|
|
|
|
goto out_disable;
|
|
|
|
/* Just return zero, not the number of enabled functions */
|
|
|
|
ret = 0;
|
2013-03-12 23:35:13 +00:00
|
|
|
out:
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
out_disable:
|
|
|
|
__ftrace_event_enable_disable(file, 0, 1);
|
|
|
|
out_put:
|
|
|
|
module_put(file->event_call->mod);
|
|
|
|
out_free:
|
|
|
|
kfree(data);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct ftrace_func_command event_enable_cmd = {
|
|
|
|
.name = ENABLE_EVENT_STR,
|
|
|
|
.func = event_enable_func,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ftrace_func_command event_disable_cmd = {
|
|
|
|
.name = DISABLE_EVENT_STR,
|
|
|
|
.func = event_enable_func,
|
|
|
|
};
|
|
|
|
|
|
|
|
static __init int register_event_cmds(void)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = register_ftrace_command(&event_enable_cmd);
|
|
|
|
if (WARN_ON(ret < 0))
|
|
|
|
return ret;
|
|
|
|
ret = register_ftrace_command(&event_disable_cmd);
|
|
|
|
if (WARN_ON(ret < 0))
|
|
|
|
unregister_ftrace_command(&event_enable_cmd);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
static inline int register_event_cmds(void) { return 0; }
|
|
|
|
#endif /* CONFIG_DYNAMIC_FTRACE */
|
|
|
|
|
2013-02-27 21:28:06 +00:00
|
|
|
/*
|
|
|
|
* The top level array has already had its ftrace_event_file
|
|
|
|
* descriptors created in order to allow for early events to
|
|
|
|
* be recorded. This function is called after the debugfs has been
|
|
|
|
* initialized, and we now have to create the files associated
|
|
|
|
* to the events.
|
|
|
|
*/
|
|
|
|
static __init void
|
|
|
|
__trace_early_add_event_dirs(struct trace_array *tr)
|
|
|
|
{
|
|
|
|
struct ftrace_event_file *file;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
|
|
|
|
list_for_each_entry(file, &tr->events, list) {
|
|
|
|
ret = event_create_dir(tr->event_dir, file,
|
|
|
|
&ftrace_event_id_fops,
|
|
|
|
&ftrace_enable_fops,
|
|
|
|
&ftrace_event_filter_fops,
|
|
|
|
&ftrace_event_format_fops);
|
|
|
|
if (ret < 0)
|
|
|
|
pr_warning("Could not create directory for event %s\n",
|
|
|
|
file->event_call->name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For early boot up, the top trace array requires to have
|
|
|
|
* a list of events that can be enabled. This must be done before
|
|
|
|
* the filesystem is set up in order to allow events to be traced
|
|
|
|
* early.
|
|
|
|
*/
|
|
|
|
static __init void
|
|
|
|
__trace_early_add_events(struct trace_array *tr)
|
|
|
|
{
|
|
|
|
struct ftrace_event_call *call;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
list_for_each_entry(call, &ftrace_events, list) {
|
|
|
|
/* Early boot up should not have any modules loaded */
|
|
|
|
if (WARN_ON_ONCE(call->mod))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ret = __trace_early_add_new_event(call, tr);
|
|
|
|
if (ret < 0)
|
|
|
|
pr_warning("Could not create early event %s\n",
|
|
|
|
call->name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-07 20:14:16 +00:00
|
|
|
/* Remove the event directory structure for a trace directory. */
|
|
|
|
static void
|
|
|
|
__trace_remove_event_dirs(struct trace_array *tr)
|
|
|
|
{
|
|
|
|
struct ftrace_event_file *file, *next;
|
|
|
|
|
2013-07-26 17:25:47 +00:00
|
|
|
list_for_each_entry_safe(file, next, &tr->events, list)
|
|
|
|
remove_event_file_dir(file);
|
2012-08-07 20:14:16 +00:00
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
static void
|
|
|
|
__add_event_to_tracers(struct ftrace_event_call *call,
|
|
|
|
struct ftrace_module_file_ops *file_ops)
|
|
|
|
{
|
|
|
|
struct trace_array *tr;
|
|
|
|
|
|
|
|
list_for_each_entry(tr, &ftrace_trace_arrays, list) {
|
|
|
|
if (file_ops)
|
2013-03-02 22:37:14 +00:00
|
|
|
__trace_add_new_mod_event(call, tr, file_ops);
|
2012-05-04 03:09:03 +00:00
|
|
|
else
|
|
|
|
__trace_add_new_event(call, tr,
|
|
|
|
&ftrace_event_id_fops,
|
|
|
|
&ftrace_enable_fops,
|
|
|
|
&ftrace_event_filter_fops,
|
|
|
|
&ftrace_event_format_fops);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-14 14:50:23 +00:00
|
|
|
static struct notifier_block trace_module_nb = {
|
2009-04-10 18:53:50 +00:00
|
|
|
.notifier_call = trace_module_notify,
|
|
|
|
.priority = 0,
|
|
|
|
};
|
|
|
|
|
tracing: Replace trace_event struct array with pointer array
Currently the trace_event structures are placed in the _ftrace_events
section, and at link time, the linker makes one large array of all
the trace_event structures. On boot up, this array is read (much like
the initcall sections) and the events are processed.
The problem is that there is no guarantee that gcc will place complex
structures nicely together in an array format. Two structures in the
same file may be placed awkwardly, because gcc has no clue that they
are suppose to be in an array.
A hack was used previous to force the alignment to 4, to pack the
structures together. But this caused alignment issues with other
architectures (sparc).
Instead of packing the structures into an array, the structures' addresses
are now put into the _ftrace_event section. As pointers are always the
natural alignment, gcc should always pack them tightly together
(otherwise initcall, extable, etc would also fail).
By having the pointers to the structures in the section, we can still
iterate the trace_events without causing unnecessary alignment problems
with other architectures, or depending on the current behaviour of
gcc that will likely change in the future just to tick us kernel developers
off a little more.
The _ftrace_event section is also moved into the .init.data section
as it is now only needed at boot up.
Suggested-by: David Miller <davem@davemloft.net>
Cc: Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
Acked-by: David S. Miller <davem@davemloft.net>
Signed-off-by: Steven Rostedt <rostedt@goodmis.org>
2011-01-27 14:15:30 +00:00
|
|
|
extern struct ftrace_event_call *__start_ftrace_events[];
|
|
|
|
extern struct ftrace_event_call *__stop_ftrace_events[];
|
2009-04-10 17:52:20 +00:00
|
|
|
|
2009-07-01 02:47:05 +00:00
|
|
|
static char bootup_event_buf[COMMAND_LINE_SIZE] __initdata;
|
|
|
|
|
|
|
|
static __init int setup_trace_event(char *str)
|
|
|
|
{
|
|
|
|
strlcpy(bootup_event_buf, str, COMMAND_LINE_SIZE);
|
2013-03-08 03:48:09 +00:00
|
|
|
ring_buffer_expanded = true;
|
|
|
|
tracing_selftest_disabled = true;
|
2009-07-01 02:47:05 +00:00
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
__setup("trace_event=", setup_trace_event);
|
|
|
|
|
2013-02-27 21:28:06 +00:00
|
|
|
/* Expects to have event_mutex held when called */
|
|
|
|
static int
|
|
|
|
create_event_toplevel_files(struct dentry *parent, struct trace_array *tr)
|
2012-05-04 03:09:03 +00:00
|
|
|
{
|
|
|
|
struct dentry *d_events;
|
|
|
|
struct dentry *entry;
|
|
|
|
|
|
|
|
entry = debugfs_create_file("set_event", 0644, parent,
|
|
|
|
tr, &ftrace_set_event_fops);
|
|
|
|
if (!entry) {
|
|
|
|
pr_warning("Could not create debugfs 'set_event' entry\n");
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
d_events = debugfs_create_dir("events", parent);
|
2012-08-03 20:10:49 +00:00
|
|
|
if (!d_events) {
|
2012-05-04 03:09:03 +00:00
|
|
|
pr_warning("Could not create debugfs 'events' directory\n");
|
2012-08-03 20:10:49 +00:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2012-05-04 03:09:03 +00:00
|
|
|
|
|
|
|
/* ring buffer internal formats */
|
|
|
|
trace_create_file("header_page", 0444, d_events,
|
|
|
|
ring_buffer_print_page_header,
|
|
|
|
&ftrace_show_header_fops);
|
|
|
|
|
|
|
|
trace_create_file("header_event", 0444, d_events,
|
|
|
|
ring_buffer_print_entry_header,
|
|
|
|
&ftrace_show_header_fops);
|
|
|
|
|
|
|
|
trace_create_file("enable", 0644, d_events,
|
|
|
|
tr, &ftrace_tr_enable_fops);
|
|
|
|
|
|
|
|
tr->event_dir = d_events;
|
2013-02-27 21:28:06 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* event_trace_add_tracer - add a instance of a trace_array to events
|
|
|
|
* @parent: The parent dentry to place the files/directories for events in
|
|
|
|
* @tr: The trace array associated with these events
|
|
|
|
*
|
|
|
|
* When a new instance is created, it needs to set up its events
|
|
|
|
* directory, as well as other files associated with events. It also
|
|
|
|
* creates the event hierachry in the @parent/events directory.
|
|
|
|
*
|
|
|
|
* Returns 0 on success.
|
|
|
|
*/
|
|
|
|
int event_trace_add_tracer(struct dentry *parent, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
|
|
|
|
ret = create_event_toplevel_files(parent, tr);
|
|
|
|
if (ret)
|
|
|
|
goto out_unlock;
|
|
|
|
|
2013-03-11 07:14:03 +00:00
|
|
|
down_write(&trace_event_sem);
|
2012-05-04 03:09:03 +00:00
|
|
|
__trace_add_event_dirs(tr);
|
2013-03-11 07:14:03 +00:00
|
|
|
up_write(&trace_event_sem);
|
2012-08-03 20:10:49 +00:00
|
|
|
|
2013-02-27 21:28:06 +00:00
|
|
|
out_unlock:
|
2012-08-03 20:10:49 +00:00
|
|
|
mutex_unlock(&event_mutex);
|
2012-05-04 03:09:03 +00:00
|
|
|
|
2013-02-27 21:28:06 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The top trace array already had its file descriptors created.
|
|
|
|
* Now the files themselves need to be created.
|
|
|
|
*/
|
|
|
|
static __init int
|
|
|
|
early_event_add_tracer(struct dentry *parent, struct trace_array *tr)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
|
|
|
|
ret = create_event_toplevel_files(parent, tr);
|
|
|
|
if (ret)
|
|
|
|
goto out_unlock;
|
|
|
|
|
2013-03-11 07:14:03 +00:00
|
|
|
down_write(&trace_event_sem);
|
2013-02-27 21:28:06 +00:00
|
|
|
__trace_early_add_event_dirs(tr);
|
2013-03-11 07:14:03 +00:00
|
|
|
up_write(&trace_event_sem);
|
2013-02-27 21:28:06 +00:00
|
|
|
|
|
|
|
out_unlock:
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
|
|
|
|
return ret;
|
2012-05-04 03:09:03 +00:00
|
|
|
}
|
|
|
|
|
2012-08-07 20:14:16 +00:00
|
|
|
int event_trace_del_tracer(struct trace_array *tr)
|
|
|
|
{
|
|
|
|
mutex_lock(&event_mutex);
|
|
|
|
|
2013-07-02 18:48:23 +00:00
|
|
|
/* Disable any running events */
|
|
|
|
__ftrace_set_clr_event_nolock(tr, NULL, NULL, NULL, 0);
|
|
|
|
|
2013-03-11 07:14:03 +00:00
|
|
|
down_write(&trace_event_sem);
|
2012-08-07 20:14:16 +00:00
|
|
|
__trace_remove_event_dirs(tr);
|
|
|
|
debugfs_remove_recursive(tr->event_dir);
|
2013-03-11 07:14:03 +00:00
|
|
|
up_write(&trace_event_sem);
|
2012-08-07 20:14:16 +00:00
|
|
|
|
|
|
|
tr->event_dir = NULL;
|
|
|
|
|
|
|
|
mutex_unlock(&event_mutex);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-02-28 01:23:57 +00:00
|
|
|
static __init int event_trace_memsetup(void)
|
|
|
|
{
|
|
|
|
field_cachep = KMEM_CACHE(ftrace_event_field, SLAB_PANIC);
|
|
|
|
file_cachep = KMEM_CACHE(ftrace_event_file, SLAB_PANIC);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-09-12 14:47:57 +00:00
|
|
|
static __init int event_trace_enable(void)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct trace_array *tr = top_trace_array();
|
2012-09-12 14:47:57 +00:00
|
|
|
struct ftrace_event_call **iter, *call;
|
|
|
|
char *buf = bootup_event_buf;
|
|
|
|
char *token;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
for_each_event(iter, __start_ftrace_events, __stop_ftrace_events) {
|
|
|
|
|
|
|
|
call = *iter;
|
|
|
|
ret = event_init(call);
|
|
|
|
if (!ret)
|
|
|
|
list_add(&call->list, &ftrace_events);
|
|
|
|
}
|
|
|
|
|
2013-02-27 21:28:06 +00:00
|
|
|
/*
|
|
|
|
* We need the top trace array to have a working set of trace
|
|
|
|
* points at early init, before the debug files and directories
|
|
|
|
* are created. Create the file entries now, and attach them
|
|
|
|
* to the actual file dentries later.
|
|
|
|
*/
|
|
|
|
__trace_early_add_events(tr);
|
|
|
|
|
2012-09-12 14:47:57 +00:00
|
|
|
while (true) {
|
|
|
|
token = strsep(&buf, ",");
|
|
|
|
|
|
|
|
if (!token)
|
|
|
|
break;
|
|
|
|
if (!*token)
|
|
|
|
continue;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = ftrace_set_clr_event(tr, token, 1);
|
2012-09-12 14:47:57 +00:00
|
|
|
if (ret)
|
|
|
|
pr_warn("Failed to enable trace event: %s\n", token);
|
|
|
|
}
|
2012-10-11 14:15:05 +00:00
|
|
|
|
|
|
|
trace_printk_start_comm();
|
|
|
|
|
2013-03-12 23:35:13 +00:00
|
|
|
register_event_cmds();
|
|
|
|
|
2012-09-12 14:47:57 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-02-24 15:21:36 +00:00
|
|
|
static __init int event_trace_init(void)
|
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct trace_array *tr;
|
2009-02-24 15:21:36 +00:00
|
|
|
struct dentry *d_tracer;
|
|
|
|
struct dentry *entry;
|
2009-04-10 18:53:50 +00:00
|
|
|
int ret;
|
2009-02-24 15:21:36 +00:00
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
tr = top_trace_array();
|
|
|
|
|
2009-02-24 15:21:36 +00:00
|
|
|
d_tracer = tracing_init_dentry();
|
|
|
|
if (!d_tracer)
|
|
|
|
return 0;
|
|
|
|
|
2009-03-10 16:04:02 +00:00
|
|
|
entry = debugfs_create_file("available_events", 0444, d_tracer,
|
2012-05-04 03:09:03 +00:00
|
|
|
tr, &ftrace_avail_fops);
|
2009-03-10 16:04:02 +00:00
|
|
|
if (!entry)
|
|
|
|
pr_warning("Could not create debugfs "
|
|
|
|
"'available_events' entry\n");
|
|
|
|
|
2010-05-24 08:22:49 +00:00
|
|
|
if (trace_define_common_fields())
|
|
|
|
pr_warning("tracing: Failed to allocate common fields");
|
|
|
|
|
2013-02-27 21:28:06 +00:00
|
|
|
ret = early_event_add_tracer(d_tracer, tr);
|
2012-05-04 03:09:03 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
2009-07-01 02:47:05 +00:00
|
|
|
|
2009-04-10 18:53:50 +00:00
|
|
|
ret = register_module_notifier(&trace_module_nb);
|
2009-05-18 15:04:46 +00:00
|
|
|
if (ret)
|
2009-04-10 18:53:50 +00:00
|
|
|
pr_warning("Failed to register trace events module notifier\n");
|
|
|
|
|
2009-02-24 15:21:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2013-02-28 01:23:57 +00:00
|
|
|
early_initcall(event_trace_memsetup);
|
2012-09-12 14:47:57 +00:00
|
|
|
core_initcall(event_trace_enable);
|
2009-02-24 15:21:36 +00:00
|
|
|
fs_initcall(event_trace_init);
|
2009-04-15 17:36:40 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_FTRACE_STARTUP_TEST
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(test_spinlock);
|
|
|
|
static DEFINE_SPINLOCK(test_spinlock_irq);
|
|
|
|
static DEFINE_MUTEX(test_mutex);
|
|
|
|
|
|
|
|
static __init void test_work(struct work_struct *dummy)
|
|
|
|
{
|
|
|
|
spin_lock(&test_spinlock);
|
|
|
|
spin_lock_irq(&test_spinlock_irq);
|
|
|
|
udelay(1);
|
|
|
|
spin_unlock_irq(&test_spinlock_irq);
|
|
|
|
spin_unlock(&test_spinlock);
|
|
|
|
|
|
|
|
mutex_lock(&test_mutex);
|
|
|
|
msleep(1);
|
|
|
|
mutex_unlock(&test_mutex);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __init int event_test_thread(void *unused)
|
|
|
|
{
|
|
|
|
void *test_malloc;
|
|
|
|
|
|
|
|
test_malloc = kmalloc(1234, GFP_KERNEL);
|
|
|
|
if (!test_malloc)
|
|
|
|
pr_info("failed to kmalloc\n");
|
|
|
|
|
|
|
|
schedule_on_each_cpu(test_work);
|
|
|
|
|
|
|
|
kfree(test_malloc);
|
|
|
|
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
while (!kthread_should_stop())
|
|
|
|
schedule();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do various things that may trigger events.
|
|
|
|
*/
|
|
|
|
static __init void event_test_stuff(void)
|
|
|
|
{
|
|
|
|
struct task_struct *test_thread;
|
|
|
|
|
|
|
|
test_thread = kthread_run(event_test_thread, NULL, "test-events");
|
|
|
|
msleep(1);
|
|
|
|
kthread_stop(test_thread);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For every trace event defined, we will test each trace point separately,
|
|
|
|
* and then by groups, and finally all trace points.
|
|
|
|
*/
|
2009-04-16 16:15:44 +00:00
|
|
|
static __init void event_trace_self_tests(void)
|
2009-04-15 17:36:40 +00:00
|
|
|
{
|
2012-05-04 03:09:03 +00:00
|
|
|
struct ftrace_subsystem_dir *dir;
|
|
|
|
struct ftrace_event_file *file;
|
2009-04-15 17:36:40 +00:00
|
|
|
struct ftrace_event_call *call;
|
|
|
|
struct event_subsystem *system;
|
2012-05-04 03:09:03 +00:00
|
|
|
struct trace_array *tr;
|
2009-04-15 17:36:40 +00:00
|
|
|
int ret;
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
tr = top_trace_array();
|
|
|
|
|
2009-04-15 17:36:40 +00:00
|
|
|
pr_info("Running tests on trace events:\n");
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry(file, &tr->events, list) {
|
|
|
|
|
|
|
|
call = file->event_call;
|
2009-04-15 17:36:40 +00:00
|
|
|
|
2010-04-21 16:27:06 +00:00
|
|
|
/* Only test those that have a probe */
|
|
|
|
if (!call->class || !call->class->probe)
|
2009-04-15 17:36:40 +00:00
|
|
|
continue;
|
|
|
|
|
2009-09-14 15:58:24 +00:00
|
|
|
/*
|
|
|
|
* Testing syscall events here is pretty useless, but
|
|
|
|
* we still do it if configured. But this is time consuming.
|
|
|
|
* What we really need is a user thread to perform the
|
|
|
|
* syscalls as we test.
|
|
|
|
*/
|
|
|
|
#ifndef CONFIG_EVENT_TRACE_TEST_SYSCALLS
|
2010-04-20 14:47:33 +00:00
|
|
|
if (call->class->system &&
|
|
|
|
strcmp(call->class->system, "syscalls") == 0)
|
2009-09-14 15:58:24 +00:00
|
|
|
continue;
|
|
|
|
#endif
|
|
|
|
|
2009-04-15 17:36:40 +00:00
|
|
|
pr_info("Testing event %s: ", call->name);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If an event is already enabled, someone is using
|
|
|
|
* it and the self test should not be on.
|
|
|
|
*/
|
2012-05-04 03:09:03 +00:00
|
|
|
if (file->flags & FTRACE_EVENT_FL_ENABLED) {
|
2009-04-15 17:36:40 +00:00
|
|
|
pr_warning("Enabled event during self test!\n");
|
|
|
|
WARN_ON_ONCE(1);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ftrace_event_enable_disable(file, 1);
|
2009-04-15 17:36:40 +00:00
|
|
|
event_test_stuff();
|
2012-05-04 03:09:03 +00:00
|
|
|
ftrace_event_enable_disable(file, 0);
|
2009-04-15 17:36:40 +00:00
|
|
|
|
|
|
|
pr_cont("OK\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now test at the sub system level */
|
|
|
|
|
|
|
|
pr_info("Running tests on trace event systems:\n");
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
list_for_each_entry(dir, &tr->systems, list) {
|
|
|
|
|
|
|
|
system = dir->subsystem;
|
2009-04-15 17:36:40 +00:00
|
|
|
|
|
|
|
/* the ftrace system is special, skip it */
|
|
|
|
if (strcmp(system->name, "ftrace") == 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
pr_info("Testing event system %s: ", system->name);
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = __ftrace_set_clr_event(tr, NULL, system->name, NULL, 1);
|
2009-04-15 17:36:40 +00:00
|
|
|
if (WARN_ON_ONCE(ret)) {
|
|
|
|
pr_warning("error enabling system %s\n",
|
|
|
|
system->name);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
event_test_stuff();
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = __ftrace_set_clr_event(tr, NULL, system->name, NULL, 0);
|
2012-08-27 07:13:45 +00:00
|
|
|
if (WARN_ON_ONCE(ret)) {
|
2009-04-15 17:36:40 +00:00
|
|
|
pr_warning("error disabling system %s\n",
|
|
|
|
system->name);
|
2012-08-27 07:13:45 +00:00
|
|
|
continue;
|
|
|
|
}
|
2009-04-15 17:36:40 +00:00
|
|
|
|
|
|
|
pr_cont("OK\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Test with all events enabled */
|
|
|
|
|
|
|
|
pr_info("Running tests on all trace events:\n");
|
|
|
|
pr_info("Testing all events: ");
|
|
|
|
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = __ftrace_set_clr_event(tr, NULL, NULL, NULL, 1);
|
2009-04-15 17:36:40 +00:00
|
|
|
if (WARN_ON_ONCE(ret)) {
|
|
|
|
pr_warning("error enabling all events\n");
|
2009-04-16 16:15:44 +00:00
|
|
|
return;
|
2009-04-15 17:36:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
event_test_stuff();
|
|
|
|
|
|
|
|
/* reset sysname */
|
2012-05-04 03:09:03 +00:00
|
|
|
ret = __ftrace_set_clr_event(tr, NULL, NULL, NULL, 0);
|
2009-04-15 17:36:40 +00:00
|
|
|
if (WARN_ON_ONCE(ret)) {
|
|
|
|
pr_warning("error disabling all events\n");
|
2009-04-16 16:15:44 +00:00
|
|
|
return;
|
2009-04-15 17:36:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
pr_cont("OK\n");
|
2009-04-16 16:15:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_FUNCTION_TRACER
|
|
|
|
|
2009-06-24 06:13:48 +00:00
|
|
|
static DEFINE_PER_CPU(atomic_t, ftrace_test_event_disable);
|
2009-04-16 16:15:44 +00:00
|
|
|
|
|
|
|
static void
|
2011-08-08 20:57:47 +00:00
|
|
|
function_test_events_call(unsigned long ip, unsigned long parent_ip,
|
2011-08-09 16:50:46 +00:00
|
|
|
struct ftrace_ops *op, struct pt_regs *pt_regs)
|
2009-04-16 16:15:44 +00:00
|
|
|
{
|
|
|
|
struct ring_buffer_event *event;
|
2009-09-02 18:17:06 +00:00
|
|
|
struct ring_buffer *buffer;
|
2009-04-16 16:15:44 +00:00
|
|
|
struct ftrace_entry *entry;
|
|
|
|
unsigned long flags;
|
|
|
|
long disabled;
|
|
|
|
int cpu;
|
|
|
|
int pc;
|
|
|
|
|
|
|
|
pc = preempt_count();
|
2010-06-03 13:36:50 +00:00
|
|
|
preempt_disable_notrace();
|
2009-04-16 16:15:44 +00:00
|
|
|
cpu = raw_smp_processor_id();
|
2009-06-24 06:13:48 +00:00
|
|
|
disabled = atomic_inc_return(&per_cpu(ftrace_test_event_disable, cpu));
|
2009-04-16 16:15:44 +00:00
|
|
|
|
|
|
|
if (disabled != 1)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
local_save_flags(flags);
|
|
|
|
|
2009-09-02 18:17:06 +00:00
|
|
|
event = trace_current_buffer_lock_reserve(&buffer,
|
|
|
|
TRACE_FN, sizeof(*entry),
|
2009-04-16 16:15:44 +00:00
|
|
|
flags, pc);
|
|
|
|
if (!event)
|
|
|
|
goto out;
|
|
|
|
entry = ring_buffer_event_data(event);
|
|
|
|
entry->ip = ip;
|
|
|
|
entry->parent_ip = parent_ip;
|
|
|
|
|
2012-11-02 00:54:21 +00:00
|
|
|
trace_buffer_unlock_commit(buffer, event, flags, pc);
|
2009-04-16 16:15:44 +00:00
|
|
|
|
|
|
|
out:
|
2009-06-24 06:13:48 +00:00
|
|
|
atomic_dec(&per_cpu(ftrace_test_event_disable, cpu));
|
2010-06-03 13:36:50 +00:00
|
|
|
preempt_enable_notrace();
|
2009-04-16 16:15:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct ftrace_ops trace_ops __initdata =
|
|
|
|
{
|
|
|
|
.func = function_test_events_call,
|
2012-07-20 15:04:44 +00:00
|
|
|
.flags = FTRACE_OPS_FL_RECURSION_SAFE,
|
2009-04-16 16:15:44 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static __init void event_trace_self_test_with_function(void)
|
|
|
|
{
|
2011-05-23 19:27:46 +00:00
|
|
|
int ret;
|
|
|
|
ret = register_ftrace_function(&trace_ops);
|
|
|
|
if (WARN_ON(ret < 0)) {
|
|
|
|
pr_info("Failed to enable function tracer for event tests\n");
|
|
|
|
return;
|
|
|
|
}
|
2009-04-16 16:15:44 +00:00
|
|
|
pr_info("Running tests again, along with the function tracer\n");
|
|
|
|
event_trace_self_tests();
|
|
|
|
unregister_ftrace_function(&trace_ops);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
static __init void event_trace_self_test_with_function(void)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static __init int event_trace_self_tests_init(void)
|
|
|
|
{
|
2009-07-01 02:47:05 +00:00
|
|
|
if (!tracing_selftest_disabled) {
|
|
|
|
event_trace_self_tests();
|
|
|
|
event_trace_self_test_with_function();
|
|
|
|
}
|
2009-04-15 17:36:40 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-04-20 16:12:44 +00:00
|
|
|
late_initcall(event_trace_self_tests_init);
|
2009-04-15 17:36:40 +00:00
|
|
|
|
|
|
|
#endif
|