|
@@ -22,119 +22,297 @@
|
|
|
#include <linux/uaccess.h>
|
|
|
#include <linux/module.h>
|
|
|
#include <linux/ctype.h>
|
|
|
+#include <linux/mutex.h>
|
|
|
|
|
|
#include "trace.h"
|
|
|
#include "trace_output.h"
|
|
|
|
|
|
-static int filter_pred_64(struct filter_pred *pred, void *event)
|
|
|
+static DEFINE_MUTEX(filter_mutex);
|
|
|
+
|
|
|
+enum filter_op_ids
|
|
|
+{
|
|
|
+ OP_OR,
|
|
|
+ OP_AND,
|
|
|
+ OP_NE,
|
|
|
+ OP_EQ,
|
|
|
+ OP_LT,
|
|
|
+ OP_LE,
|
|
|
+ OP_GT,
|
|
|
+ OP_GE,
|
|
|
+ OP_NONE,
|
|
|
+ OP_OPEN_PAREN,
|
|
|
+};
|
|
|
+
|
|
|
+struct filter_op {
|
|
|
+ int id;
|
|
|
+ char *string;
|
|
|
+ int precedence;
|
|
|
+};
|
|
|
+
|
|
|
+static struct filter_op filter_ops[] = {
|
|
|
+ { OP_OR, "||", 1 },
|
|
|
+ { OP_AND, "&&", 2 },
|
|
|
+ { OP_NE, "!=", 4 },
|
|
|
+ { OP_EQ, "==", 4 },
|
|
|
+ { OP_LT, "<", 5 },
|
|
|
+ { OP_LE, "<=", 5 },
|
|
|
+ { OP_GT, ">", 5 },
|
|
|
+ { OP_GE, ">=", 5 },
|
|
|
+ { OP_NONE, "OP_NONE", 0 },
|
|
|
+ { OP_OPEN_PAREN, "(", 0 },
|
|
|
+};
|
|
|
+
|
|
|
+enum {
|
|
|
+ FILT_ERR_NONE,
|
|
|
+ FILT_ERR_INVALID_OP,
|
|
|
+ FILT_ERR_UNBALANCED_PAREN,
|
|
|
+ FILT_ERR_TOO_MANY_OPERANDS,
|
|
|
+ FILT_ERR_OPERAND_TOO_LONG,
|
|
|
+ FILT_ERR_FIELD_NOT_FOUND,
|
|
|
+ FILT_ERR_ILLEGAL_FIELD_OP,
|
|
|
+ FILT_ERR_ILLEGAL_INTVAL,
|
|
|
+ FILT_ERR_BAD_SUBSYS_FILTER,
|
|
|
+ FILT_ERR_TOO_MANY_PREDS,
|
|
|
+ FILT_ERR_MISSING_FIELD,
|
|
|
+ FILT_ERR_INVALID_FILTER,
|
|
|
+};
|
|
|
+
|
|
|
+static char *err_text[] = {
|
|
|
+ "No error",
|
|
|
+ "Invalid operator",
|
|
|
+ "Unbalanced parens",
|
|
|
+ "Too many operands",
|
|
|
+ "Operand too long",
|
|
|
+ "Field not found",
|
|
|
+ "Illegal operation for field type",
|
|
|
+ "Illegal integer value",
|
|
|
+ "Couldn't find or set field in one of a subsystem's events",
|
|
|
+ "Too many terms in predicate expression",
|
|
|
+ "Missing field name and/or value",
|
|
|
+ "Meaningless filter expression",
|
|
|
+};
|
|
|
+
|
|
|
+struct opstack_op {
|
|
|
+ int op;
|
|
|
+ struct list_head list;
|
|
|
+};
|
|
|
+
|
|
|
+struct postfix_elt {
|
|
|
+ int op;
|
|
|
+ char *operand;
|
|
|
+ struct list_head list;
|
|
|
+};
|
|
|
+
|
|
|
+struct filter_parse_state {
|
|
|
+ struct filter_op *ops;
|
|
|
+ struct list_head opstack;
|
|
|
+ struct list_head postfix;
|
|
|
+ int lasterr;
|
|
|
+ int lasterr_pos;
|
|
|
+
|
|
|
+ struct {
|
|
|
+ char *string;
|
|
|
+ unsigned int cnt;
|
|
|
+ unsigned int tail;
|
|
|
+ } infix;
|
|
|
+
|
|
|
+ struct {
|
|
|
+ char string[MAX_FILTER_STR_VAL];
|
|
|
+ int pos;
|
|
|
+ unsigned int tail;
|
|
|
+ } operand;
|
|
|
+};
|
|
|
+
|
|
|
+DEFINE_COMPARISON_PRED(s64);
|
|
|
+DEFINE_COMPARISON_PRED(u64);
|
|
|
+DEFINE_COMPARISON_PRED(s32);
|
|
|
+DEFINE_COMPARISON_PRED(u32);
|
|
|
+DEFINE_COMPARISON_PRED(s16);
|
|
|
+DEFINE_COMPARISON_PRED(u16);
|
|
|
+DEFINE_COMPARISON_PRED(s8);
|
|
|
+DEFINE_COMPARISON_PRED(u8);
|
|
|
+
|
|
|
+DEFINE_EQUALITY_PRED(64);
|
|
|
+DEFINE_EQUALITY_PRED(32);
|
|
|
+DEFINE_EQUALITY_PRED(16);
|
|
|
+DEFINE_EQUALITY_PRED(8);
|
|
|
+
|
|
|
+static int filter_pred_and(struct filter_pred *pred __attribute((unused)),
|
|
|
+ void *event __attribute((unused)),
|
|
|
+ int val1, int val2)
|
|
|
+{
|
|
|
+ return val1 && val2;
|
|
|
+}
|
|
|
+
|
|
|
+static int filter_pred_or(struct filter_pred *pred __attribute((unused)),
|
|
|
+ void *event __attribute((unused)),
|
|
|
+ int val1, int val2)
|
|
|
+{
|
|
|
+ return val1 || val2;
|
|
|
+}
|
|
|
+
|
|
|
+/* Filter predicate for fixed sized arrays of characters */
|
|
|
+static int filter_pred_string(struct filter_pred *pred, void *event,
|
|
|
+ int val1, int val2)
|
|
|
{
|
|
|
- u64 *addr = (u64 *)(event + pred->offset);
|
|
|
- u64 val = (u64)pred->val;
|
|
|
- int match;
|
|
|
+ char *addr = (char *)(event + pred->offset);
|
|
|
+ int cmp, match;
|
|
|
+
|
|
|
+ cmp = strncmp(addr, pred->str_val, pred->str_len);
|
|
|
|
|
|
- match = (val == *addr) ^ pred->not;
|
|
|
+ match = (!cmp) ^ pred->not;
|
|
|
|
|
|
return match;
|
|
|
}
|
|
|
|
|
|
-static int filter_pred_32(struct filter_pred *pred, void *event)
|
|
|
+/*
|
|
|
+ * Filter predicate for dynamic sized arrays of characters.
|
|
|
+ * These are implemented through a list of strings at the end
|
|
|
+ * of the entry.
|
|
|
+ * Also each of these strings have a field in the entry which
|
|
|
+ * contains its offset from the beginning of the entry.
|
|
|
+ * We have then first to get this field, dereference it
|
|
|
+ * and add it to the address of the entry, and at last we have
|
|
|
+ * the address of the string.
|
|
|
+ */
|
|
|
+static int filter_pred_strloc(struct filter_pred *pred, void *event,
|
|
|
+ int val1, int val2)
|
|
|
{
|
|
|
- u32 *addr = (u32 *)(event + pred->offset);
|
|
|
- u32 val = (u32)pred->val;
|
|
|
- int match;
|
|
|
+ int str_loc = *(int *)(event + pred->offset);
|
|
|
+ char *addr = (char *)(event + str_loc);
|
|
|
+ int cmp, match;
|
|
|
+
|
|
|
+ cmp = strncmp(addr, pred->str_val, pred->str_len);
|
|
|
|
|
|
- match = (val == *addr) ^ pred->not;
|
|
|
+ match = (!cmp) ^ pred->not;
|
|
|
|
|
|
return match;
|
|
|
}
|
|
|
|
|
|
-static int filter_pred_16(struct filter_pred *pred, void *event)
|
|
|
+static int filter_pred_none(struct filter_pred *pred, void *event,
|
|
|
+ int val1, int val2)
|
|
|
+{
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+/* return 1 if event matches, 0 otherwise (discard) */
|
|
|
+int filter_match_preds(struct ftrace_event_call *call, void *rec)
|
|
|
{
|
|
|
- u16 *addr = (u16 *)(event + pred->offset);
|
|
|
- u16 val = (u16)pred->val;
|
|
|
- int match;
|
|
|
+ struct event_filter *filter = call->filter;
|
|
|
+ int match, top = 0, val1 = 0, val2 = 0;
|
|
|
+ int stack[MAX_FILTER_PRED];
|
|
|
+ struct filter_pred *pred;
|
|
|
+ int i;
|
|
|
+
|
|
|
+ for (i = 0; i < filter->n_preds; i++) {
|
|
|
+ pred = filter->preds[i];
|
|
|
+ if (!pred->pop_n) {
|
|
|
+ match = pred->fn(pred, rec, val1, val2);
|
|
|
+ stack[top++] = match;
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+ if (pred->pop_n > top) {
|
|
|
+ WARN_ON_ONCE(1);
|
|
|
+ return 0;
|
|
|
+ }
|
|
|
+ val1 = stack[--top];
|
|
|
+ val2 = stack[--top];
|
|
|
+ match = pred->fn(pred, rec, val1, val2);
|
|
|
+ stack[top++] = match;
|
|
|
+ }
|
|
|
|
|
|
- match = (val == *addr) ^ pred->not;
|
|
|
+ return stack[--top];
|
|
|
+}
|
|
|
+EXPORT_SYMBOL_GPL(filter_match_preds);
|
|
|
|
|
|
- return match;
|
|
|
+static void parse_error(struct filter_parse_state *ps, int err, int pos)
|
|
|
+{
|
|
|
+ ps->lasterr = err;
|
|
|
+ ps->lasterr_pos = pos;
|
|
|
}
|
|
|
|
|
|
-static int filter_pred_8(struct filter_pred *pred, void *event)
|
|
|
+static void remove_filter_string(struct event_filter *filter)
|
|
|
{
|
|
|
- u8 *addr = (u8 *)(event + pred->offset);
|
|
|
- u8 val = (u8)pred->val;
|
|
|
- int match;
|
|
|
+ kfree(filter->filter_string);
|
|
|
+ filter->filter_string = NULL;
|
|
|
+}
|
|
|
|
|
|
- match = (val == *addr) ^ pred->not;
|
|
|
+static int replace_filter_string(struct event_filter *filter,
|
|
|
+ char *filter_string)
|
|
|
+{
|
|
|
+ kfree(filter->filter_string);
|
|
|
+ filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
|
|
|
+ if (!filter->filter_string)
|
|
|
+ return -ENOMEM;
|
|
|
|
|
|
- return match;
|
|
|
+ return 0;
|
|
|
}
|
|
|
|
|
|
-static int filter_pred_string(struct filter_pred *pred, void *event)
|
|
|
+static int append_filter_string(struct event_filter *filter,
|
|
|
+ char *string)
|
|
|
{
|
|
|
- char *addr = (char *)(event + pred->offset);
|
|
|
- int cmp, match;
|
|
|
+ int newlen;
|
|
|
+ char *new_filter_string;
|
|
|
|
|
|
- cmp = strncmp(addr, pred->str_val, pred->str_len);
|
|
|
+ BUG_ON(!filter->filter_string);
|
|
|
+ newlen = strlen(filter->filter_string) + strlen(string) + 1;
|
|
|
+ new_filter_string = kmalloc(newlen, GFP_KERNEL);
|
|
|
+ if (!new_filter_string)
|
|
|
+ return -ENOMEM;
|
|
|
|
|
|
- match = (!cmp) ^ pred->not;
|
|
|
+ strcpy(new_filter_string, filter->filter_string);
|
|
|
+ strcat(new_filter_string, string);
|
|
|
+ kfree(filter->filter_string);
|
|
|
+ filter->filter_string = new_filter_string;
|
|
|
|
|
|
- return match;
|
|
|
+ return 0;
|
|
|
}
|
|
|
|
|
|
-/* return 1 if event matches, 0 otherwise (discard) */
|
|
|
-int filter_match_preds(struct ftrace_event_call *call, void *rec)
|
|
|
+static void append_filter_err(struct filter_parse_state *ps,
|
|
|
+ struct event_filter *filter)
|
|
|
{
|
|
|
- int i, matched, and_failed = 0;
|
|
|
- struct filter_pred *pred;
|
|
|
+ int pos = ps->lasterr_pos;
|
|
|
+ char *buf, *pbuf;
|
|
|
|
|
|
- for (i = 0; i < MAX_FILTER_PRED; i++) {
|
|
|
- if (call->preds[i]) {
|
|
|
- pred = call->preds[i];
|
|
|
- if (and_failed && !pred->or)
|
|
|
- continue;
|
|
|
- matched = pred->fn(pred, rec);
|
|
|
- if (!matched && !pred->or) {
|
|
|
- and_failed = 1;
|
|
|
- continue;
|
|
|
- } else if (matched && pred->or)
|
|
|
- return 1;
|
|
|
- } else
|
|
|
- break;
|
|
|
- }
|
|
|
+ buf = (char *)__get_free_page(GFP_TEMPORARY);
|
|
|
+ if (!buf)
|
|
|
+ return;
|
|
|
|
|
|
- if (and_failed)
|
|
|
- return 0;
|
|
|
+ append_filter_string(filter, "\n");
|
|
|
+ memset(buf, ' ', PAGE_SIZE);
|
|
|
+ if (pos > PAGE_SIZE - 128)
|
|
|
+ pos = 0;
|
|
|
+ buf[pos] = '^';
|
|
|
+ pbuf = &buf[pos] + 1;
|
|
|
|
|
|
- return 1;
|
|
|
+ sprintf(pbuf, "\nparse_error: %s\n", err_text[ps->lasterr]);
|
|
|
+ append_filter_string(filter, buf);
|
|
|
+ free_page((unsigned long) buf);
|
|
|
}
|
|
|
|
|
|
-void filter_print_preds(struct filter_pred **preds, struct trace_seq *s)
|
|
|
+void print_event_filter(struct ftrace_event_call *call, struct trace_seq *s)
|
|
|
{
|
|
|
- char *field_name;
|
|
|
- struct filter_pred *pred;
|
|
|
- int i;
|
|
|
+ struct event_filter *filter = call->filter;
|
|
|
|
|
|
- if (!preds) {
|
|
|
+ mutex_lock(&filter_mutex);
|
|
|
+ if (filter->filter_string)
|
|
|
+ trace_seq_printf(s, "%s\n", filter->filter_string);
|
|
|
+ else
|
|
|
trace_seq_printf(s, "none\n");
|
|
|
- return;
|
|
|
- }
|
|
|
+ mutex_unlock(&filter_mutex);
|
|
|
+}
|
|
|
|
|
|
- for (i = 0; i < MAX_FILTER_PRED; i++) {
|
|
|
- if (preds[i]) {
|
|
|
- pred = preds[i];
|
|
|
- field_name = pred->field_name;
|
|
|
- if (i)
|
|
|
- trace_seq_printf(s, pred->or ? "|| " : "&& ");
|
|
|
- trace_seq_printf(s, "%s ", field_name);
|
|
|
- trace_seq_printf(s, pred->not ? "!= " : "== ");
|
|
|
- if (pred->str_val)
|
|
|
- trace_seq_printf(s, "%s\n", pred->str_val);
|
|
|
- else
|
|
|
- trace_seq_printf(s, "%llu\n", pred->val);
|
|
|
- } else
|
|
|
- break;
|
|
|
- }
|
|
|
+void print_subsystem_event_filter(struct event_subsystem *system,
|
|
|
+ struct trace_seq *s)
|
|
|
+{
|
|
|
+ struct event_filter *filter = system->filter;
|
|
|
+
|
|
|
+ mutex_lock(&filter_mutex);
|
|
|
+ if (filter->filter_string)
|
|
|
+ trace_seq_printf(s, "%s\n", filter->filter_string);
|
|
|
+ else
|
|
|
+ trace_seq_printf(s, "none\n");
|
|
|
+ mutex_unlock(&filter_mutex);
|
|
|
}
|
|
|
|
|
|
static struct ftrace_event_field *
|
|
@@ -150,284 +328,828 @@ find_event_field(struct ftrace_event_call *call, char *name)
|
|
|
return NULL;
|
|
|
}
|
|
|
|
|
|
-void filter_free_pred(struct filter_pred *pred)
|
|
|
+static void filter_free_pred(struct filter_pred *pred)
|
|
|
{
|
|
|
if (!pred)
|
|
|
return;
|
|
|
|
|
|
kfree(pred->field_name);
|
|
|
- kfree(pred->str_val);
|
|
|
kfree(pred);
|
|
|
}
|
|
|
|
|
|
-void filter_free_preds(struct ftrace_event_call *call)
|
|
|
+static void filter_clear_pred(struct filter_pred *pred)
|
|
|
{
|
|
|
- int i;
|
|
|
+ kfree(pred->field_name);
|
|
|
+ pred->field_name = NULL;
|
|
|
+ pred->str_len = 0;
|
|
|
+}
|
|
|
|
|
|
- if (call->preds) {
|
|
|
- for (i = 0; i < MAX_FILTER_PRED; i++)
|
|
|
- filter_free_pred(call->preds[i]);
|
|
|
- kfree(call->preds);
|
|
|
- call->preds = NULL;
|
|
|
+static int filter_set_pred(struct filter_pred *dest,
|
|
|
+ struct filter_pred *src,
|
|
|
+ filter_pred_fn_t fn)
|
|
|
+{
|
|
|
+ *dest = *src;
|
|
|
+ if (src->field_name) {
|
|
|
+ dest->field_name = kstrdup(src->field_name, GFP_KERNEL);
|
|
|
+ if (!dest->field_name)
|
|
|
+ return -ENOMEM;
|
|
|
}
|
|
|
+ dest->fn = fn;
|
|
|
+
|
|
|
+ return 0;
|
|
|
}
|
|
|
|
|
|
-void filter_free_subsystem_preds(struct event_subsystem *system)
|
|
|
+static void filter_disable_preds(struct ftrace_event_call *call)
|
|
|
{
|
|
|
- struct ftrace_event_call *call = __start_ftrace_events;
|
|
|
+ struct event_filter *filter = call->filter;
|
|
|
int i;
|
|
|
|
|
|
- if (system->preds) {
|
|
|
- for (i = 0; i < MAX_FILTER_PRED; i++)
|
|
|
- filter_free_pred(system->preds[i]);
|
|
|
- kfree(system->preds);
|
|
|
- system->preds = NULL;
|
|
|
- }
|
|
|
+ call->filter_active = 0;
|
|
|
+ filter->n_preds = 0;
|
|
|
|
|
|
- events_for_each(call) {
|
|
|
- if (!call->name || !call->regfunc)
|
|
|
- continue;
|
|
|
+ for (i = 0; i < MAX_FILTER_PRED; i++)
|
|
|
+ filter->preds[i]->fn = filter_pred_none;
|
|
|
+}
|
|
|
+
|
|
|
+void destroy_preds(struct ftrace_event_call *call)
|
|
|
+{
|
|
|
+ struct event_filter *filter = call->filter;
|
|
|
+ int i;
|
|
|
|
|
|
- if (!strcmp(call->system, system->name))
|
|
|
- filter_free_preds(call);
|
|
|
+ for (i = 0; i < MAX_FILTER_PRED; i++) {
|
|
|
+ if (filter->preds[i])
|
|
|
+ filter_free_pred(filter->preds[i]);
|
|
|
}
|
|
|
+ kfree(filter->preds);
|
|
|
+ kfree(filter);
|
|
|
+ call->filter = NULL;
|
|
|
}
|
|
|
|
|
|
-static int __filter_add_pred(struct ftrace_event_call *call,
|
|
|
- struct filter_pred *pred)
|
|
|
+int init_preds(struct ftrace_event_call *call)
|
|
|
{
|
|
|
+ struct event_filter *filter;
|
|
|
+ struct filter_pred *pred;
|
|
|
int i;
|
|
|
|
|
|
- if (call->preds && !pred->compound)
|
|
|
- filter_free_preds(call);
|
|
|
+ filter = call->filter = kzalloc(sizeof(*filter), GFP_KERNEL);
|
|
|
+ if (!call->filter)
|
|
|
+ return -ENOMEM;
|
|
|
|
|
|
- if (!call->preds) {
|
|
|
- call->preds = kzalloc(MAX_FILTER_PRED * sizeof(pred),
|
|
|
- GFP_KERNEL);
|
|
|
- if (!call->preds)
|
|
|
- return -ENOMEM;
|
|
|
- }
|
|
|
+ call->filter_active = 0;
|
|
|
+ filter->n_preds = 0;
|
|
|
+
|
|
|
+ filter->preds = kzalloc(MAX_FILTER_PRED * sizeof(pred), GFP_KERNEL);
|
|
|
+ if (!filter->preds)
|
|
|
+ goto oom;
|
|
|
|
|
|
for (i = 0; i < MAX_FILTER_PRED; i++) {
|
|
|
- if (!call->preds[i]) {
|
|
|
- call->preds[i] = pred;
|
|
|
- return 0;
|
|
|
+ pred = kzalloc(sizeof(*pred), GFP_KERNEL);
|
|
|
+ if (!pred)
|
|
|
+ goto oom;
|
|
|
+ pred->fn = filter_pred_none;
|
|
|
+ filter->preds[i] = pred;
|
|
|
+ }
|
|
|
+
|
|
|
+ return 0;
|
|
|
+
|
|
|
+oom:
|
|
|
+ destroy_preds(call);
|
|
|
+
|
|
|
+ return -ENOMEM;
|
|
|
+}
|
|
|
+EXPORT_SYMBOL_GPL(init_preds);
|
|
|
+
|
|
|
+static void filter_free_subsystem_preds(struct event_subsystem *system)
|
|
|
+{
|
|
|
+ struct event_filter *filter = system->filter;
|
|
|
+ struct ftrace_event_call *call;
|
|
|
+ int i;
|
|
|
+
|
|
|
+ if (filter->n_preds) {
|
|
|
+ for (i = 0; i < filter->n_preds; i++)
|
|
|
+ filter_free_pred(filter->preds[i]);
|
|
|
+ kfree(filter->preds);
|
|
|
+ filter->preds = NULL;
|
|
|
+ filter->n_preds = 0;
|
|
|
+ }
|
|
|
+
|
|
|
+ mutex_lock(&event_mutex);
|
|
|
+ list_for_each_entry(call, &ftrace_events, list) {
|
|
|
+ if (!call->define_fields)
|
|
|
+ continue;
|
|
|
+
|
|
|
+ if (!strcmp(call->system, system->name)) {
|
|
|
+ filter_disable_preds(call);
|
|
|
+ remove_filter_string(call->filter);
|
|
|
}
|
|
|
}
|
|
|
+ mutex_unlock(&event_mutex);
|
|
|
+}
|
|
|
+
|
|
|
+static int filter_add_pred_fn(struct filter_parse_state *ps,
|
|
|
+ struct ftrace_event_call *call,
|
|
|
+ struct filter_pred *pred,
|
|
|
+ filter_pred_fn_t fn)
|
|
|
+{
|
|
|
+ struct event_filter *filter = call->filter;
|
|
|
+ int idx, err;
|
|
|
+
|
|
|
+ if (filter->n_preds == MAX_FILTER_PRED) {
|
|
|
+ parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
|
|
|
+ return -ENOSPC;
|
|
|
+ }
|
|
|
+
|
|
|
+ idx = filter->n_preds;
|
|
|
+ filter_clear_pred(filter->preds[idx]);
|
|
|
+ err = filter_set_pred(filter->preds[idx], pred, fn);
|
|
|
+ if (err)
|
|
|
+ return err;
|
|
|
|
|
|
- return -ENOSPC;
|
|
|
+ filter->n_preds++;
|
|
|
+ call->filter_active = 1;
|
|
|
+
|
|
|
+ return 0;
|
|
|
}
|
|
|
|
|
|
+enum {
|
|
|
+ FILTER_STATIC_STRING = 1,
|
|
|
+ FILTER_DYN_STRING
|
|
|
+};
|
|
|
+
|
|
|
static int is_string_field(const char *type)
|
|
|
{
|
|
|
+ if (strstr(type, "__data_loc") && strstr(type, "char"))
|
|
|
+ return FILTER_DYN_STRING;
|
|
|
+
|
|
|
if (strchr(type, '[') && strstr(type, "char"))
|
|
|
- return 1;
|
|
|
+ return FILTER_STATIC_STRING;
|
|
|
|
|
|
return 0;
|
|
|
}
|
|
|
|
|
|
-int filter_add_pred(struct ftrace_event_call *call, struct filter_pred *pred)
|
|
|
+static int is_legal_op(struct ftrace_event_field *field, int op)
|
|
|
{
|
|
|
- struct ftrace_event_field *field;
|
|
|
-
|
|
|
- field = find_event_field(call, pred->field_name);
|
|
|
- if (!field)
|
|
|
- return -EINVAL;
|
|
|
+ if (is_string_field(field->type) && (op != OP_EQ && op != OP_NE))
|
|
|
+ return 0;
|
|
|
|
|
|
- pred->offset = field->offset;
|
|
|
+ return 1;
|
|
|
+}
|
|
|
|
|
|
- if (is_string_field(field->type)) {
|
|
|
- if (!pred->str_val)
|
|
|
- return -EINVAL;
|
|
|
- pred->fn = filter_pred_string;
|
|
|
- pred->str_len = field->size;
|
|
|
- return __filter_add_pred(call, pred);
|
|
|
- } else {
|
|
|
- if (pred->str_val)
|
|
|
- return -EINVAL;
|
|
|
- }
|
|
|
+static filter_pred_fn_t select_comparison_fn(int op, int field_size,
|
|
|
+ int field_is_signed)
|
|
|
+{
|
|
|
+ filter_pred_fn_t fn = NULL;
|
|
|
|
|
|
- switch (field->size) {
|
|
|
+ switch (field_size) {
|
|
|
case 8:
|
|
|
- pred->fn = filter_pred_64;
|
|
|
+ if (op == OP_EQ || op == OP_NE)
|
|
|
+ fn = filter_pred_64;
|
|
|
+ else if (field_is_signed)
|
|
|
+ fn = filter_pred_s64;
|
|
|
+ else
|
|
|
+ fn = filter_pred_u64;
|
|
|
break;
|
|
|
case 4:
|
|
|
- pred->fn = filter_pred_32;
|
|
|
+ if (op == OP_EQ || op == OP_NE)
|
|
|
+ fn = filter_pred_32;
|
|
|
+ else if (field_is_signed)
|
|
|
+ fn = filter_pred_s32;
|
|
|
+ else
|
|
|
+ fn = filter_pred_u32;
|
|
|
break;
|
|
|
case 2:
|
|
|
- pred->fn = filter_pred_16;
|
|
|
+ if (op == OP_EQ || op == OP_NE)
|
|
|
+ fn = filter_pred_16;
|
|
|
+ else if (field_is_signed)
|
|
|
+ fn = filter_pred_s16;
|
|
|
+ else
|
|
|
+ fn = filter_pred_u16;
|
|
|
break;
|
|
|
case 1:
|
|
|
- pred->fn = filter_pred_8;
|
|
|
+ if (op == OP_EQ || op == OP_NE)
|
|
|
+ fn = filter_pred_8;
|
|
|
+ else if (field_is_signed)
|
|
|
+ fn = filter_pred_s8;
|
|
|
+ else
|
|
|
+ fn = filter_pred_u8;
|
|
|
break;
|
|
|
- default:
|
|
|
- return -EINVAL;
|
|
|
}
|
|
|
|
|
|
- return __filter_add_pred(call, pred);
|
|
|
+ return fn;
|
|
|
}
|
|
|
|
|
|
-static struct filter_pred *copy_pred(struct filter_pred *pred)
|
|
|
+static int filter_add_pred(struct filter_parse_state *ps,
|
|
|
+ struct ftrace_event_call *call,
|
|
|
+ struct filter_pred *pred)
|
|
|
{
|
|
|
- struct filter_pred *new_pred = kmalloc(sizeof(*pred), GFP_KERNEL);
|
|
|
- if (!new_pred)
|
|
|
- return NULL;
|
|
|
+ struct ftrace_event_field *field;
|
|
|
+ filter_pred_fn_t fn;
|
|
|
+ unsigned long long val;
|
|
|
+ int string_type;
|
|
|
+
|
|
|
+ pred->fn = filter_pred_none;
|
|
|
+
|
|
|
+ if (pred->op == OP_AND) {
|
|
|
+ pred->pop_n = 2;
|
|
|
+ return filter_add_pred_fn(ps, call, pred, filter_pred_and);
|
|
|
+ } else if (pred->op == OP_OR) {
|
|
|
+ pred->pop_n = 2;
|
|
|
+ return filter_add_pred_fn(ps, call, pred, filter_pred_or);
|
|
|
+ }
|
|
|
+
|
|
|
+ field = find_event_field(call, pred->field_name);
|
|
|
+ if (!field) {
|
|
|
+ parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
|
|
|
+ return -EINVAL;
|
|
|
+ }
|
|
|
|
|
|
- memcpy(new_pred, pred, sizeof(*pred));
|
|
|
+ pred->offset = field->offset;
|
|
|
|
|
|
- if (pred->field_name) {
|
|
|
- new_pred->field_name = kstrdup(pred->field_name, GFP_KERNEL);
|
|
|
- if (!new_pred->field_name) {
|
|
|
- kfree(new_pred);
|
|
|
- return NULL;
|
|
|
- }
|
|
|
+ if (!is_legal_op(field, pred->op)) {
|
|
|
+ parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
|
|
|
+ return -EINVAL;
|
|
|
}
|
|
|
|
|
|
- if (pred->str_val) {
|
|
|
- new_pred->str_val = kstrdup(pred->str_val, GFP_KERNEL);
|
|
|
- if (!new_pred->str_val) {
|
|
|
- filter_free_pred(new_pred);
|
|
|
- return NULL;
|
|
|
+ string_type = is_string_field(field->type);
|
|
|
+ if (string_type) {
|
|
|
+ if (string_type == FILTER_STATIC_STRING)
|
|
|
+ fn = filter_pred_string;
|
|
|
+ else
|
|
|
+ fn = filter_pred_strloc;
|
|
|
+ pred->str_len = field->size;
|
|
|
+ if (pred->op == OP_NE)
|
|
|
+ pred->not = 1;
|
|
|
+ return filter_add_pred_fn(ps, call, pred, fn);
|
|
|
+ } else {
|
|
|
+ if (strict_strtoull(pred->str_val, 0, &val)) {
|
|
|
+ parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
|
|
|
+ return -EINVAL;
|
|
|
}
|
|
|
+ pred->val = val;
|
|
|
+ }
|
|
|
+
|
|
|
+ fn = select_comparison_fn(pred->op, field->size, field->is_signed);
|
|
|
+ if (!fn) {
|
|
|
+ parse_error(ps, FILT_ERR_INVALID_OP, 0);
|
|
|
+ return -EINVAL;
|
|
|
}
|
|
|
|
|
|
- return new_pred;
|
|
|
+ if (pred->op == OP_NE)
|
|
|
+ pred->not = 1;
|
|
|
+
|
|
|
+ return filter_add_pred_fn(ps, call, pred, fn);
|
|
|
}
|
|
|
|
|
|
-int filter_add_subsystem_pred(struct event_subsystem *system,
|
|
|
- struct filter_pred *pred)
|
|
|
+static int filter_add_subsystem_pred(struct filter_parse_state *ps,
|
|
|
+ struct event_subsystem *system,
|
|
|
+ struct filter_pred *pred,
|
|
|
+ char *filter_string)
|
|
|
{
|
|
|
- struct ftrace_event_call *call = __start_ftrace_events;
|
|
|
- struct filter_pred *event_pred;
|
|
|
- int i;
|
|
|
-
|
|
|
- if (system->preds && !pred->compound)
|
|
|
- filter_free_subsystem_preds(system);
|
|
|
+ struct event_filter *filter = system->filter;
|
|
|
+ struct ftrace_event_call *call;
|
|
|
+ int err = 0;
|
|
|
|
|
|
- if (!system->preds) {
|
|
|
- system->preds = kzalloc(MAX_FILTER_PRED * sizeof(pred),
|
|
|
+ if (!filter->preds) {
|
|
|
+ filter->preds = kzalloc(MAX_FILTER_PRED * sizeof(pred),
|
|
|
GFP_KERNEL);
|
|
|
- if (!system->preds)
|
|
|
+
|
|
|
+ if (!filter->preds)
|
|
|
return -ENOMEM;
|
|
|
}
|
|
|
|
|
|
- for (i = 0; i < MAX_FILTER_PRED; i++) {
|
|
|
- if (!system->preds[i]) {
|
|
|
- system->preds[i] = pred;
|
|
|
- break;
|
|
|
- }
|
|
|
+ if (filter->n_preds == MAX_FILTER_PRED) {
|
|
|
+ parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
|
|
|
+ return -ENOSPC;
|
|
|
}
|
|
|
|
|
|
- if (i == MAX_FILTER_PRED)
|
|
|
- return -ENOSPC;
|
|
|
+ filter->preds[filter->n_preds] = pred;
|
|
|
+ filter->n_preds++;
|
|
|
|
|
|
- events_for_each(call) {
|
|
|
- int err;
|
|
|
+ mutex_lock(&event_mutex);
|
|
|
+ list_for_each_entry(call, &ftrace_events, list) {
|
|
|
|
|
|
- if (!call->name || !call->regfunc)
|
|
|
+ if (!call->define_fields)
|
|
|
continue;
|
|
|
|
|
|
if (strcmp(call->system, system->name))
|
|
|
continue;
|
|
|
|
|
|
- if (!find_event_field(call, pred->field_name))
|
|
|
- continue;
|
|
|
+ err = filter_add_pred(ps, call, pred);
|
|
|
+ if (err) {
|
|
|
+ mutex_unlock(&event_mutex);
|
|
|
+ filter_free_subsystem_preds(system);
|
|
|
+ parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
|
|
|
+ goto out;
|
|
|
+ }
|
|
|
+ replace_filter_string(call->filter, filter_string);
|
|
|
+ }
|
|
|
+ mutex_unlock(&event_mutex);
|
|
|
+out:
|
|
|
+ return err;
|
|
|
+}
|
|
|
|
|
|
- event_pred = copy_pred(pred);
|
|
|
- if (!event_pred)
|
|
|
- goto oom;
|
|
|
+static void parse_init(struct filter_parse_state *ps,
|
|
|
+ struct filter_op *ops,
|
|
|
+ char *infix_string)
|
|
|
+{
|
|
|
+ memset(ps, '\0', sizeof(*ps));
|
|
|
|
|
|
- err = filter_add_pred(call, event_pred);
|
|
|
- if (err)
|
|
|
- filter_free_pred(event_pred);
|
|
|
- if (err == -ENOMEM)
|
|
|
- goto oom;
|
|
|
+ ps->infix.string = infix_string;
|
|
|
+ ps->infix.cnt = strlen(infix_string);
|
|
|
+ ps->ops = ops;
|
|
|
+
|
|
|
+ INIT_LIST_HEAD(&ps->opstack);
|
|
|
+ INIT_LIST_HEAD(&ps->postfix);
|
|
|
+}
|
|
|
+
|
|
|
+static char infix_next(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ ps->infix.cnt--;
|
|
|
+
|
|
|
+ return ps->infix.string[ps->infix.tail++];
|
|
|
+}
|
|
|
+
|
|
|
+static char infix_peek(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ if (ps->infix.tail == strlen(ps->infix.string))
|
|
|
+ return 0;
|
|
|
+
|
|
|
+ return ps->infix.string[ps->infix.tail];
|
|
|
+}
|
|
|
+
|
|
|
+static void infix_advance(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ ps->infix.cnt--;
|
|
|
+ ps->infix.tail++;
|
|
|
+}
|
|
|
+
|
|
|
+static inline int is_precedence_lower(struct filter_parse_state *ps,
|
|
|
+ int a, int b)
|
|
|
+{
|
|
|
+ return ps->ops[a].precedence < ps->ops[b].precedence;
|
|
|
+}
|
|
|
+
|
|
|
+static inline int is_op_char(struct filter_parse_state *ps, char c)
|
|
|
+{
|
|
|
+ int i;
|
|
|
+
|
|
|
+ for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
|
|
|
+ if (ps->ops[i].string[0] == c)
|
|
|
+ return 1;
|
|
|
}
|
|
|
|
|
|
return 0;
|
|
|
+}
|
|
|
|
|
|
-oom:
|
|
|
- system->preds[i] = NULL;
|
|
|
- return -ENOMEM;
|
|
|
+static int infix_get_op(struct filter_parse_state *ps, char firstc)
|
|
|
+{
|
|
|
+ char nextc = infix_peek(ps);
|
|
|
+ char opstr[3];
|
|
|
+ int i;
|
|
|
+
|
|
|
+ opstr[0] = firstc;
|
|
|
+ opstr[1] = nextc;
|
|
|
+ opstr[2] = '\0';
|
|
|
+
|
|
|
+ for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
|
|
|
+ if (!strcmp(opstr, ps->ops[i].string)) {
|
|
|
+ infix_advance(ps);
|
|
|
+ return ps->ops[i].id;
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ opstr[1] = '\0';
|
|
|
+
|
|
|
+ for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
|
|
|
+ if (!strcmp(opstr, ps->ops[i].string))
|
|
|
+ return ps->ops[i].id;
|
|
|
+ }
|
|
|
+
|
|
|
+ return OP_NONE;
|
|
|
}
|
|
|
|
|
|
-int filter_parse(char **pbuf, struct filter_pred *pred)
|
|
|
+static inline void clear_operand_string(struct filter_parse_state *ps)
|
|
|
{
|
|
|
- char *tmp, *tok, *val_str = NULL;
|
|
|
- int tok_n = 0;
|
|
|
+ memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
|
|
|
+ ps->operand.tail = 0;
|
|
|
+}
|
|
|
|
|
|
- /* field ==/!= number, or/and field ==/!= number, number */
|
|
|
- while ((tok = strsep(pbuf, " \n"))) {
|
|
|
- if (tok_n == 0) {
|
|
|
- if (!strcmp(tok, "0")) {
|
|
|
- pred->clear = 1;
|
|
|
- return 0;
|
|
|
- } else if (!strcmp(tok, "&&")) {
|
|
|
- pred->or = 0;
|
|
|
- pred->compound = 1;
|
|
|
- } else if (!strcmp(tok, "||")) {
|
|
|
- pred->or = 1;
|
|
|
- pred->compound = 1;
|
|
|
- } else
|
|
|
- pred->field_name = tok;
|
|
|
- tok_n = 1;
|
|
|
+static inline int append_operand_char(struct filter_parse_state *ps, char c)
|
|
|
+{
|
|
|
+ if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
|
|
|
+ return -EINVAL;
|
|
|
+
|
|
|
+ ps->operand.string[ps->operand.tail++] = c;
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+static int filter_opstack_push(struct filter_parse_state *ps, int op)
|
|
|
+{
|
|
|
+ struct opstack_op *opstack_op;
|
|
|
+
|
|
|
+ opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
|
|
|
+ if (!opstack_op)
|
|
|
+ return -ENOMEM;
|
|
|
+
|
|
|
+ opstack_op->op = op;
|
|
|
+ list_add(&opstack_op->list, &ps->opstack);
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+static int filter_opstack_empty(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ return list_empty(&ps->opstack);
|
|
|
+}
|
|
|
+
|
|
|
+static int filter_opstack_top(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ struct opstack_op *opstack_op;
|
|
|
+
|
|
|
+ if (filter_opstack_empty(ps))
|
|
|
+ return OP_NONE;
|
|
|
+
|
|
|
+ opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
|
|
|
+
|
|
|
+ return opstack_op->op;
|
|
|
+}
|
|
|
+
|
|
|
+static int filter_opstack_pop(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ struct opstack_op *opstack_op;
|
|
|
+ int op;
|
|
|
+
|
|
|
+ if (filter_opstack_empty(ps))
|
|
|
+ return OP_NONE;
|
|
|
+
|
|
|
+ opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
|
|
|
+ op = opstack_op->op;
|
|
|
+ list_del(&opstack_op->list);
|
|
|
+
|
|
|
+ kfree(opstack_op);
|
|
|
+
|
|
|
+ return op;
|
|
|
+}
|
|
|
+
|
|
|
+static void filter_opstack_clear(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ while (!filter_opstack_empty(ps))
|
|
|
+ filter_opstack_pop(ps);
|
|
|
+}
|
|
|
+
|
|
|
+static char *curr_operand(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ return ps->operand.string;
|
|
|
+}
|
|
|
+
|
|
|
+static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
|
|
|
+{
|
|
|
+ struct postfix_elt *elt;
|
|
|
+
|
|
|
+ elt = kmalloc(sizeof(*elt), GFP_KERNEL);
|
|
|
+ if (!elt)
|
|
|
+ return -ENOMEM;
|
|
|
+
|
|
|
+ elt->op = OP_NONE;
|
|
|
+ elt->operand = kstrdup(operand, GFP_KERNEL);
|
|
|
+ if (!elt->operand) {
|
|
|
+ kfree(elt);
|
|
|
+ return -ENOMEM;
|
|
|
+ }
|
|
|
+
|
|
|
+ list_add_tail(&elt->list, &ps->postfix);
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+static int postfix_append_op(struct filter_parse_state *ps, int op)
|
|
|
+{
|
|
|
+ struct postfix_elt *elt;
|
|
|
+
|
|
|
+ elt = kmalloc(sizeof(*elt), GFP_KERNEL);
|
|
|
+ if (!elt)
|
|
|
+ return -ENOMEM;
|
|
|
+
|
|
|
+ elt->op = op;
|
|
|
+ elt->operand = NULL;
|
|
|
+
|
|
|
+ list_add_tail(&elt->list, &ps->postfix);
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+static void postfix_clear(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ struct postfix_elt *elt;
|
|
|
+
|
|
|
+ while (!list_empty(&ps->postfix)) {
|
|
|
+ elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
|
|
|
+ kfree(elt->operand);
|
|
|
+ list_del(&elt->list);
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+static int filter_parse(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ int in_string = 0;
|
|
|
+ int op, top_op;
|
|
|
+ char ch;
|
|
|
+
|
|
|
+ while ((ch = infix_next(ps))) {
|
|
|
+ if (ch == '"') {
|
|
|
+ in_string ^= 1;
|
|
|
continue;
|
|
|
}
|
|
|
- if (tok_n == 1) {
|
|
|
- if (!pred->field_name)
|
|
|
- pred->field_name = tok;
|
|
|
- else if (!strcmp(tok, "!="))
|
|
|
- pred->not = 1;
|
|
|
- else if (!strcmp(tok, "=="))
|
|
|
- pred->not = 0;
|
|
|
- else {
|
|
|
- pred->field_name = NULL;
|
|
|
+
|
|
|
+ if (in_string)
|
|
|
+ goto parse_operand;
|
|
|
+
|
|
|
+ if (isspace(ch))
|
|
|
+ continue;
|
|
|
+
|
|
|
+ if (is_op_char(ps, ch)) {
|
|
|
+ op = infix_get_op(ps, ch);
|
|
|
+ if (op == OP_NONE) {
|
|
|
+ parse_error(ps, FILT_ERR_INVALID_OP, 0);
|
|
|
return -EINVAL;
|
|
|
}
|
|
|
- tok_n = 2;
|
|
|
+
|
|
|
+ if (strlen(curr_operand(ps))) {
|
|
|
+ postfix_append_operand(ps, curr_operand(ps));
|
|
|
+ clear_operand_string(ps);
|
|
|
+ }
|
|
|
+
|
|
|
+ while (!filter_opstack_empty(ps)) {
|
|
|
+ top_op = filter_opstack_top(ps);
|
|
|
+ if (!is_precedence_lower(ps, top_op, op)) {
|
|
|
+ top_op = filter_opstack_pop(ps);
|
|
|
+ postfix_append_op(ps, top_op);
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+ break;
|
|
|
+ }
|
|
|
+
|
|
|
+ filter_opstack_push(ps, op);
|
|
|
continue;
|
|
|
}
|
|
|
- if (tok_n == 2) {
|
|
|
- if (pred->compound) {
|
|
|
- if (!strcmp(tok, "!="))
|
|
|
- pred->not = 1;
|
|
|
- else if (!strcmp(tok, "=="))
|
|
|
- pred->not = 0;
|
|
|
- else {
|
|
|
- pred->field_name = NULL;
|
|
|
- return -EINVAL;
|
|
|
- }
|
|
|
- } else {
|
|
|
- val_str = tok;
|
|
|
- break; /* done */
|
|
|
+
|
|
|
+ if (ch == '(') {
|
|
|
+ filter_opstack_push(ps, OP_OPEN_PAREN);
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+
|
|
|
+ if (ch == ')') {
|
|
|
+ if (strlen(curr_operand(ps))) {
|
|
|
+ postfix_append_operand(ps, curr_operand(ps));
|
|
|
+ clear_operand_string(ps);
|
|
|
+ }
|
|
|
+
|
|
|
+ top_op = filter_opstack_pop(ps);
|
|
|
+ while (top_op != OP_NONE) {
|
|
|
+ if (top_op == OP_OPEN_PAREN)
|
|
|
+ break;
|
|
|
+ postfix_append_op(ps, top_op);
|
|
|
+ top_op = filter_opstack_pop(ps);
|
|
|
+ }
|
|
|
+ if (top_op == OP_NONE) {
|
|
|
+ parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
|
|
|
+ return -EINVAL;
|
|
|
}
|
|
|
- tok_n = 3;
|
|
|
continue;
|
|
|
}
|
|
|
- if (tok_n == 3) {
|
|
|
- val_str = tok;
|
|
|
- break; /* done */
|
|
|
+parse_operand:
|
|
|
+ if (append_operand_char(ps, ch)) {
|
|
|
+ parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
|
|
|
+ return -EINVAL;
|
|
|
}
|
|
|
}
|
|
|
|
|
|
- if (!val_str) {
|
|
|
- pred->field_name = NULL;
|
|
|
- return -EINVAL;
|
|
|
+ if (strlen(curr_operand(ps)))
|
|
|
+ postfix_append_operand(ps, curr_operand(ps));
|
|
|
+
|
|
|
+ while (!filter_opstack_empty(ps)) {
|
|
|
+ top_op = filter_opstack_pop(ps);
|
|
|
+ if (top_op == OP_NONE)
|
|
|
+ break;
|
|
|
+ if (top_op == OP_OPEN_PAREN) {
|
|
|
+ parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
|
|
|
+ return -EINVAL;
|
|
|
+ }
|
|
|
+ postfix_append_op(ps, top_op);
|
|
|
}
|
|
|
|
|
|
- pred->field_name = kstrdup(pred->field_name, GFP_KERNEL);
|
|
|
- if (!pred->field_name)
|
|
|
- return -ENOMEM;
|
|
|
+ return 0;
|
|
|
+}
|
|
|
|
|
|
- pred->val = simple_strtoull(val_str, &tmp, 0);
|
|
|
- if (tmp == val_str) {
|
|
|
- pred->str_val = kstrdup(val_str, GFP_KERNEL);
|
|
|
- if (!pred->str_val)
|
|
|
- return -ENOMEM;
|
|
|
- } else if (*tmp != '\0')
|
|
|
+static struct filter_pred *create_pred(int op, char *operand1, char *operand2)
|
|
|
+{
|
|
|
+ struct filter_pred *pred;
|
|
|
+
|
|
|
+ pred = kzalloc(sizeof(*pred), GFP_KERNEL);
|
|
|
+ if (!pred)
|
|
|
+ return NULL;
|
|
|
+
|
|
|
+ pred->field_name = kstrdup(operand1, GFP_KERNEL);
|
|
|
+ if (!pred->field_name) {
|
|
|
+ kfree(pred);
|
|
|
+ return NULL;
|
|
|
+ }
|
|
|
+
|
|
|
+ strcpy(pred->str_val, operand2);
|
|
|
+ pred->str_len = strlen(operand2);
|
|
|
+
|
|
|
+ pred->op = op;
|
|
|
+
|
|
|
+ return pred;
|
|
|
+}
|
|
|
+
|
|
|
+static struct filter_pred *create_logical_pred(int op)
|
|
|
+{
|
|
|
+ struct filter_pred *pred;
|
|
|
+
|
|
|
+ pred = kzalloc(sizeof(*pred), GFP_KERNEL);
|
|
|
+ if (!pred)
|
|
|
+ return NULL;
|
|
|
+
|
|
|
+ pred->op = op;
|
|
|
+
|
|
|
+ return pred;
|
|
|
+}
|
|
|
+
|
|
|
+static int check_preds(struct filter_parse_state *ps)
|
|
|
+{
|
|
|
+ int n_normal_preds = 0, n_logical_preds = 0;
|
|
|
+ struct postfix_elt *elt;
|
|
|
+
|
|
|
+ list_for_each_entry(elt, &ps->postfix, list) {
|
|
|
+ if (elt->op == OP_NONE)
|
|
|
+ continue;
|
|
|
+
|
|
|
+ if (elt->op == OP_AND || elt->op == OP_OR) {
|
|
|
+ n_logical_preds++;
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+ n_normal_preds++;
|
|
|
+ }
|
|
|
+
|
|
|
+ if (!n_normal_preds || n_logical_preds >= n_normal_preds) {
|
|
|
+ parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
|
|
|
return -EINVAL;
|
|
|
+ }
|
|
|
|
|
|
return 0;
|
|
|
}
|
|
|
|
|
|
+static int replace_preds(struct event_subsystem *system,
|
|
|
+ struct ftrace_event_call *call,
|
|
|
+ struct filter_parse_state *ps,
|
|
|
+ char *filter_string)
|
|
|
+{
|
|
|
+ char *operand1 = NULL, *operand2 = NULL;
|
|
|
+ struct filter_pred *pred;
|
|
|
+ struct postfix_elt *elt;
|
|
|
+ int err;
|
|
|
+
|
|
|
+ err = check_preds(ps);
|
|
|
+ if (err)
|
|
|
+ return err;
|
|
|
+
|
|
|
+ list_for_each_entry(elt, &ps->postfix, list) {
|
|
|
+ if (elt->op == OP_NONE) {
|
|
|
+ if (!operand1)
|
|
|
+ operand1 = elt->operand;
|
|
|
+ else if (!operand2)
|
|
|
+ operand2 = elt->operand;
|
|
|
+ else {
|
|
|
+ parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
|
|
|
+ return -EINVAL;
|
|
|
+ }
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+
|
|
|
+ if (elt->op == OP_AND || elt->op == OP_OR) {
|
|
|
+ pred = create_logical_pred(elt->op);
|
|
|
+ if (call) {
|
|
|
+ err = filter_add_pred(ps, call, pred);
|
|
|
+ filter_free_pred(pred);
|
|
|
+ } else
|
|
|
+ err = filter_add_subsystem_pred(ps, system,
|
|
|
+ pred, filter_string);
|
|
|
+ if (err)
|
|
|
+ return err;
|
|
|
+
|
|
|
+ operand1 = operand2 = NULL;
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+
|
|
|
+ if (!operand1 || !operand2) {
|
|
|
+ parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
|
|
|
+ return -EINVAL;
|
|
|
+ }
|
|
|
+
|
|
|
+ pred = create_pred(elt->op, operand1, operand2);
|
|
|
+ if (call) {
|
|
|
+ err = filter_add_pred(ps, call, pred);
|
|
|
+ filter_free_pred(pred);
|
|
|
+ } else
|
|
|
+ err = filter_add_subsystem_pred(ps, system, pred,
|
|
|
+ filter_string);
|
|
|
+ if (err)
|
|
|
+ return err;
|
|
|
+
|
|
|
+ operand1 = operand2 = NULL;
|
|
|
+ }
|
|
|
+
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+int apply_event_filter(struct ftrace_event_call *call, char *filter_string)
|
|
|
+{
|
|
|
+ int err;
|
|
|
+
|
|
|
+ struct filter_parse_state *ps;
|
|
|
+
|
|
|
+ mutex_lock(&filter_mutex);
|
|
|
+
|
|
|
+ if (!strcmp(strstrip(filter_string), "0")) {
|
|
|
+ filter_disable_preds(call);
|
|
|
+ remove_filter_string(call->filter);
|
|
|
+ mutex_unlock(&filter_mutex);
|
|
|
+ return 0;
|
|
|
+ }
|
|
|
+
|
|
|
+ err = -ENOMEM;
|
|
|
+ ps = kzalloc(sizeof(*ps), GFP_KERNEL);
|
|
|
+ if (!ps)
|
|
|
+ goto out_unlock;
|
|
|
+
|
|
|
+ filter_disable_preds(call);
|
|
|
+ replace_filter_string(call->filter, filter_string);
|
|
|
+
|
|
|
+ parse_init(ps, filter_ops, filter_string);
|
|
|
+ err = filter_parse(ps);
|
|
|
+ if (err) {
|
|
|
+ append_filter_err(ps, call->filter);
|
|
|
+ goto out;
|
|
|
+ }
|
|
|
+
|
|
|
+ err = replace_preds(NULL, call, ps, filter_string);
|
|
|
+ if (err)
|
|
|
+ append_filter_err(ps, call->filter);
|
|
|
+
|
|
|
+out:
|
|
|
+ filter_opstack_clear(ps);
|
|
|
+ postfix_clear(ps);
|
|
|
+ kfree(ps);
|
|
|
+out_unlock:
|
|
|
+ mutex_unlock(&filter_mutex);
|
|
|
+
|
|
|
+ return err;
|
|
|
+}
|
|
|
+
|
|
|
+int apply_subsystem_event_filter(struct event_subsystem *system,
|
|
|
+ char *filter_string)
|
|
|
+{
|
|
|
+ int err;
|
|
|
+
|
|
|
+ struct filter_parse_state *ps;
|
|
|
+
|
|
|
+ mutex_lock(&filter_mutex);
|
|
|
+
|
|
|
+ if (!strcmp(strstrip(filter_string), "0")) {
|
|
|
+ filter_free_subsystem_preds(system);
|
|
|
+ remove_filter_string(system->filter);
|
|
|
+ mutex_unlock(&filter_mutex);
|
|
|
+ return 0;
|
|
|
+ }
|
|
|
+
|
|
|
+ err = -ENOMEM;
|
|
|
+ ps = kzalloc(sizeof(*ps), GFP_KERNEL);
|
|
|
+ if (!ps)
|
|
|
+ goto out_unlock;
|
|
|
+
|
|
|
+ filter_free_subsystem_preds(system);
|
|
|
+ replace_filter_string(system->filter, filter_string);
|
|
|
+
|
|
|
+ parse_init(ps, filter_ops, filter_string);
|
|
|
+ err = filter_parse(ps);
|
|
|
+ if (err) {
|
|
|
+ append_filter_err(ps, system->filter);
|
|
|
+ goto out;
|
|
|
+ }
|
|
|
+
|
|
|
+ err = replace_preds(system, NULL, ps, filter_string);
|
|
|
+ if (err)
|
|
|
+ append_filter_err(ps, system->filter);
|
|
|
+
|
|
|
+out:
|
|
|
+ filter_opstack_clear(ps);
|
|
|
+ postfix_clear(ps);
|
|
|
+ kfree(ps);
|
|
|
+out_unlock:
|
|
|
+ mutex_unlock(&filter_mutex);
|
|
|
+
|
|
|
+ return err;
|
|
|
+}
|
|
|
|