2 * trace_events_filter - generic event filtering
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 * Copyright (C) 2009 Tom Zanussi <tzanussi@gmail.com>
21 #include <linux/module.h>
22 #include <linux/ctype.h>
23 #include <linux/mutex.h>
24 #include <linux/perf_event.h>
25 #include <linux/slab.h>
28 #include "trace_output.h"
51 static struct filter_op filter_ops[] = {
61 { OP_NONE, "OP_NONE", 0 },
62 { OP_OPEN_PAREN, "(", 0 },
68 FILT_ERR_UNBALANCED_PAREN,
69 FILT_ERR_TOO_MANY_OPERANDS,
70 FILT_ERR_OPERAND_TOO_LONG,
71 FILT_ERR_FIELD_NOT_FOUND,
72 FILT_ERR_ILLEGAL_FIELD_OP,
73 FILT_ERR_ILLEGAL_INTVAL,
74 FILT_ERR_BAD_SUBSYS_FILTER,
75 FILT_ERR_TOO_MANY_PREDS,
76 FILT_ERR_MISSING_FIELD,
77 FILT_ERR_INVALID_FILTER,
80 static char *err_text[] = {
87 "Illegal operation for field type",
88 "Illegal integer value",
89 "Couldn't find or set field in one of a subsystem's events",
90 "Too many terms in predicate expression",
91 "Missing field name and/or value",
92 "Meaningless filter expression",
97 struct list_head list;
103 struct list_head list;
106 struct filter_parse_state {
107 struct filter_op *ops;
108 struct list_head opstack;
109 struct list_head postfix;
120 char string[MAX_FILTER_STR_VAL];
126 #define DEFINE_COMPARISON_PRED(type) \
127 static int filter_pred_##type(struct filter_pred *pred, void *event, \
128 int val1, int val2) \
130 type *addr = (type *)(event + pred->offset); \
131 type val = (type)pred->val; \
134 switch (pred->op) { \
136 match = (*addr < val); \
139 match = (*addr <= val); \
142 match = (*addr > val); \
145 match = (*addr >= val); \
154 #define DEFINE_EQUALITY_PRED(size) \
155 static int filter_pred_##size(struct filter_pred *pred, void *event, \
156 int val1, int val2) \
158 u##size *addr = (u##size *)(event + pred->offset); \
159 u##size val = (u##size)pred->val; \
162 match = (val == *addr) ^ pred->not; \
167 DEFINE_COMPARISON_PRED(s64);
168 DEFINE_COMPARISON_PRED(u64);
169 DEFINE_COMPARISON_PRED(s32);
170 DEFINE_COMPARISON_PRED(u32);
171 DEFINE_COMPARISON_PRED(s16);
172 DEFINE_COMPARISON_PRED(u16);
173 DEFINE_COMPARISON_PRED(s8);
174 DEFINE_COMPARISON_PRED(u8);
176 DEFINE_EQUALITY_PRED(64);
177 DEFINE_EQUALITY_PRED(32);
178 DEFINE_EQUALITY_PRED(16);
179 DEFINE_EQUALITY_PRED(8);
181 static int filter_pred_and(struct filter_pred *pred __attribute((unused)),
182 void *event __attribute((unused)),
188 static int filter_pred_or(struct filter_pred *pred __attribute((unused)),
189 void *event __attribute((unused)),
195 /* Filter predicate for fixed sized arrays of characters */
196 static int filter_pred_string(struct filter_pred *pred, void *event,
199 char *addr = (char *)(event + pred->offset);
202 cmp = pred->regex.match(addr, &pred->regex, pred->regex.field_len);
204 match = cmp ^ pred->not;
209 /* Filter predicate for char * pointers */
210 static int filter_pred_pchar(struct filter_pred *pred, void *event,
213 char **addr = (char **)(event + pred->offset);
215 int len = strlen(*addr) + 1; /* including tailing '\0' */
217 cmp = pred->regex.match(*addr, &pred->regex, len);
219 match = cmp ^ pred->not;
225 * Filter predicate for dynamic sized arrays of characters.
226 * These are implemented through a list of strings at the end
228 * Also each of these strings have a field in the entry which
229 * contains its offset from the beginning of the entry.
230 * We have then first to get this field, dereference it
231 * and add it to the address of the entry, and at last we have
232 * the address of the string.
234 static int filter_pred_strloc(struct filter_pred *pred, void *event,
237 u32 str_item = *(u32 *)(event + pred->offset);
238 int str_loc = str_item & 0xffff;
239 int str_len = str_item >> 16;
240 char *addr = (char *)(event + str_loc);
243 cmp = pred->regex.match(addr, &pred->regex, str_len);
245 match = cmp ^ pred->not;
250 static int filter_pred_none(struct filter_pred *pred, void *event,
257 * regex_match_foo - Basic regex callbacks
259 * @str: the string to be searched
260 * @r: the regex structure containing the pattern string
261 * @len: the length of the string to be searched (including '\0')
264 * - @str might not be NULL-terminated if it's of type DYN_STRING
268 static int regex_match_full(char *str, struct regex *r, int len)
270 if (strncmp(str, r->pattern, len) == 0)
275 static int regex_match_front(char *str, struct regex *r, int len)
277 if (strncmp(str, r->pattern, r->len) == 0)
282 static int regex_match_middle(char *str, struct regex *r, int len)
284 if (strnstr(str, r->pattern, len))
289 static int regex_match_end(char *str, struct regex *r, int len)
291 int strlen = len - 1;
293 if (strlen >= r->len &&
294 memcmp(str + strlen - r->len, r->pattern, r->len) == 0)
300 * filter_parse_regex - parse a basic regex
301 * @buff: the raw regex
302 * @len: length of the regex
303 * @search: will point to the beginning of the string to compare
304 * @not: tell whether the match will have to be inverted
306 * This passes in a buffer containing a regex and this function will
307 * set search to point to the search part of the buffer and
308 * return the type of search it is (see enum above).
309 * This does modify buff.
312 * search returns the pointer to use for comparison.
313 * not returns 1 if buff started with a '!'
316 enum regex_type filter_parse_regex(char *buff, int len, char **search, int *not)
318 int type = MATCH_FULL;
321 if (buff[0] == '!') {
330 for (i = 0; i < len; i++) {
331 if (buff[i] == '*') {
334 type = MATCH_END_ONLY;
336 if (type == MATCH_END_ONLY)
337 type = MATCH_MIDDLE_ONLY;
339 type = MATCH_FRONT_ONLY;
349 static void filter_build_regex(struct filter_pred *pred)
351 struct regex *r = &pred->regex;
353 enum regex_type type = MATCH_FULL;
356 if (pred->op == OP_GLOB) {
357 type = filter_parse_regex(r->pattern, r->len, &search, ¬);
358 r->len = strlen(search);
359 memmove(r->pattern, search, r->len+1);
364 r->match = regex_match_full;
366 case MATCH_FRONT_ONLY:
367 r->match = regex_match_front;
369 case MATCH_MIDDLE_ONLY:
370 r->match = regex_match_middle;
373 r->match = regex_match_end;
380 /* return 1 if event matches, 0 otherwise (discard) */
381 int filter_match_preds(struct event_filter *filter, void *rec)
383 int match, top = 0, val1 = 0, val2 = 0;
384 int stack[MAX_FILTER_PRED];
385 struct filter_pred *pred;
388 for (i = 0; i < filter->n_preds; i++) {
389 pred = filter->preds[i];
391 match = pred->fn(pred, rec, val1, val2);
392 stack[top++] = match;
395 if (pred->pop_n > top) {
401 match = pred->fn(pred, rec, val1, val2);
402 stack[top++] = match;
407 EXPORT_SYMBOL_GPL(filter_match_preds);
409 static void parse_error(struct filter_parse_state *ps, int err, int pos)
412 ps->lasterr_pos = pos;
415 static void remove_filter_string(struct event_filter *filter)
417 kfree(filter->filter_string);
418 filter->filter_string = NULL;
421 static int replace_filter_string(struct event_filter *filter,
424 kfree(filter->filter_string);
425 filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
426 if (!filter->filter_string)
432 static int append_filter_string(struct event_filter *filter,
436 char *new_filter_string;
438 BUG_ON(!filter->filter_string);
439 newlen = strlen(filter->filter_string) + strlen(string) + 1;
440 new_filter_string = kmalloc(newlen, GFP_KERNEL);
441 if (!new_filter_string)
444 strcpy(new_filter_string, filter->filter_string);
445 strcat(new_filter_string, string);
446 kfree(filter->filter_string);
447 filter->filter_string = new_filter_string;
452 static void append_filter_err(struct filter_parse_state *ps,
453 struct event_filter *filter)
455 int pos = ps->lasterr_pos;
458 buf = (char *)__get_free_page(GFP_TEMPORARY);
462 append_filter_string(filter, "\n");
463 memset(buf, ' ', PAGE_SIZE);
464 if (pos > PAGE_SIZE - 128)
467 pbuf = &buf[pos] + 1;
469 sprintf(pbuf, "\nparse_error: %s\n", err_text[ps->lasterr]);
470 append_filter_string(filter, buf);
471 free_page((unsigned long) buf);
474 void print_event_filter(struct ftrace_event_call *call, struct trace_seq *s)
476 struct event_filter *filter = call->filter;
478 mutex_lock(&event_mutex);
479 if (filter && filter->filter_string)
480 trace_seq_printf(s, "%s\n", filter->filter_string);
482 trace_seq_printf(s, "none\n");
483 mutex_unlock(&event_mutex);
486 void print_subsystem_event_filter(struct event_subsystem *system,
489 struct event_filter *filter = system->filter;
491 mutex_lock(&event_mutex);
492 if (filter && filter->filter_string)
493 trace_seq_printf(s, "%s\n", filter->filter_string);
495 trace_seq_printf(s, "none\n");
496 mutex_unlock(&event_mutex);
499 static struct ftrace_event_field *
500 find_event_field(struct ftrace_event_call *call, char *name)
502 struct ftrace_event_field *field;
504 list_for_each_entry(field, &call->fields, link) {
505 if (!strcmp(field->name, name))
512 static void filter_free_pred(struct filter_pred *pred)
517 kfree(pred->field_name);
521 static void filter_clear_pred(struct filter_pred *pred)
523 kfree(pred->field_name);
524 pred->field_name = NULL;
528 static int filter_set_pred(struct filter_pred *dest,
529 struct filter_pred *src,
533 if (src->field_name) {
534 dest->field_name = kstrdup(src->field_name, GFP_KERNEL);
535 if (!dest->field_name)
543 static void filter_disable_preds(struct ftrace_event_call *call)
545 struct event_filter *filter = call->filter;
548 call->filter_active = 0;
551 for (i = 0; i < MAX_FILTER_PRED; i++)
552 filter->preds[i]->fn = filter_pred_none;
555 static void __free_preds(struct event_filter *filter)
562 for (i = 0; i < MAX_FILTER_PRED; i++) {
563 if (filter->preds[i])
564 filter_free_pred(filter->preds[i]);
566 kfree(filter->preds);
567 kfree(filter->filter_string);
571 void destroy_preds(struct ftrace_event_call *call)
573 __free_preds(call->filter);
575 call->filter_active = 0;
578 static struct event_filter *__alloc_preds(void)
580 struct event_filter *filter;
581 struct filter_pred *pred;
584 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
586 return ERR_PTR(-ENOMEM);
590 filter->preds = kzalloc(MAX_FILTER_PRED * sizeof(pred), GFP_KERNEL);
594 for (i = 0; i < MAX_FILTER_PRED; i++) {
595 pred = kzalloc(sizeof(*pred), GFP_KERNEL);
598 pred->fn = filter_pred_none;
599 filter->preds[i] = pred;
605 __free_preds(filter);
606 return ERR_PTR(-ENOMEM);
609 static int init_preds(struct ftrace_event_call *call)
614 call->filter_active = 0;
615 call->filter = __alloc_preds();
616 if (IS_ERR(call->filter))
617 return PTR_ERR(call->filter);
622 static int init_subsystem_preds(struct event_subsystem *system)
624 struct ftrace_event_call *call;
627 list_for_each_entry(call, &ftrace_events, list) {
628 if (!call->define_fields)
631 if (strcmp(call->system, system->name) != 0)
634 err = init_preds(call);
642 static void filter_free_subsystem_preds(struct event_subsystem *system)
644 struct ftrace_event_call *call;
646 list_for_each_entry(call, &ftrace_events, list) {
647 if (!call->define_fields)
650 if (strcmp(call->system, system->name) != 0)
653 filter_disable_preds(call);
654 remove_filter_string(call->filter);
658 static int filter_add_pred_fn(struct filter_parse_state *ps,
659 struct ftrace_event_call *call,
660 struct event_filter *filter,
661 struct filter_pred *pred,
666 if (filter->n_preds == MAX_FILTER_PRED) {
667 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
671 idx = filter->n_preds;
672 filter_clear_pred(filter->preds[idx]);
673 err = filter_set_pred(filter->preds[idx], pred, fn);
682 int filter_assign_type(const char *type)
684 if (strstr(type, "__data_loc") && strstr(type, "char"))
685 return FILTER_DYN_STRING;
687 if (strchr(type, '[') && strstr(type, "char"))
688 return FILTER_STATIC_STRING;
693 static bool is_string_field(struct ftrace_event_field *field)
695 return field->filter_type == FILTER_DYN_STRING ||
696 field->filter_type == FILTER_STATIC_STRING ||
697 field->filter_type == FILTER_PTR_STRING;
700 static int is_legal_op(struct ftrace_event_field *field, int op)
702 if (is_string_field(field) &&
703 (op != OP_EQ && op != OP_NE && op != OP_GLOB))
705 if (!is_string_field(field) && op == OP_GLOB)
711 static filter_pred_fn_t select_comparison_fn(int op, int field_size,
714 filter_pred_fn_t fn = NULL;
716 switch (field_size) {
718 if (op == OP_EQ || op == OP_NE)
720 else if (field_is_signed)
721 fn = filter_pred_s64;
723 fn = filter_pred_u64;
726 if (op == OP_EQ || op == OP_NE)
728 else if (field_is_signed)
729 fn = filter_pred_s32;
731 fn = filter_pred_u32;
734 if (op == OP_EQ || op == OP_NE)
736 else if (field_is_signed)
737 fn = filter_pred_s16;
739 fn = filter_pred_u16;
742 if (op == OP_EQ || op == OP_NE)
744 else if (field_is_signed)
754 static int filter_add_pred(struct filter_parse_state *ps,
755 struct ftrace_event_call *call,
756 struct event_filter *filter,
757 struct filter_pred *pred,
760 struct ftrace_event_field *field;
762 unsigned long long val;
765 pred->fn = filter_pred_none;
767 if (pred->op == OP_AND) {
769 fn = filter_pred_and;
771 } else if (pred->op == OP_OR) {
777 field = find_event_field(call, pred->field_name);
779 parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
783 pred->offset = field->offset;
785 if (!is_legal_op(field, pred->op)) {
786 parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
790 if (is_string_field(field)) {
791 filter_build_regex(pred);
793 if (field->filter_type == FILTER_STATIC_STRING) {
794 fn = filter_pred_string;
795 pred->regex.field_len = field->size;
796 } else if (field->filter_type == FILTER_DYN_STRING)
797 fn = filter_pred_strloc;
799 fn = filter_pred_pchar;
801 if (field->is_signed)
802 ret = strict_strtoll(pred->regex.pattern, 0, &val);
804 ret = strict_strtoull(pred->regex.pattern, 0, &val);
806 parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
811 fn = select_comparison_fn(pred->op, field->size,
814 parse_error(ps, FILT_ERR_INVALID_OP, 0);
819 if (pred->op == OP_NE)
824 return filter_add_pred_fn(ps, call, filter, pred, fn);
828 static void parse_init(struct filter_parse_state *ps,
829 struct filter_op *ops,
832 memset(ps, '\0', sizeof(*ps));
834 ps->infix.string = infix_string;
835 ps->infix.cnt = strlen(infix_string);
838 INIT_LIST_HEAD(&ps->opstack);
839 INIT_LIST_HEAD(&ps->postfix);
842 static char infix_next(struct filter_parse_state *ps)
846 return ps->infix.string[ps->infix.tail++];
849 static char infix_peek(struct filter_parse_state *ps)
851 if (ps->infix.tail == strlen(ps->infix.string))
854 return ps->infix.string[ps->infix.tail];
857 static void infix_advance(struct filter_parse_state *ps)
863 static inline int is_precedence_lower(struct filter_parse_state *ps,
866 return ps->ops[a].precedence < ps->ops[b].precedence;
869 static inline int is_op_char(struct filter_parse_state *ps, char c)
873 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
874 if (ps->ops[i].string[0] == c)
881 static int infix_get_op(struct filter_parse_state *ps, char firstc)
883 char nextc = infix_peek(ps);
891 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
892 if (!strcmp(opstr, ps->ops[i].string)) {
894 return ps->ops[i].id;
900 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
901 if (!strcmp(opstr, ps->ops[i].string))
902 return ps->ops[i].id;
908 static inline void clear_operand_string(struct filter_parse_state *ps)
910 memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
911 ps->operand.tail = 0;
914 static inline int append_operand_char(struct filter_parse_state *ps, char c)
916 if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
919 ps->operand.string[ps->operand.tail++] = c;
924 static int filter_opstack_push(struct filter_parse_state *ps, int op)
926 struct opstack_op *opstack_op;
928 opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
933 list_add(&opstack_op->list, &ps->opstack);
938 static int filter_opstack_empty(struct filter_parse_state *ps)
940 return list_empty(&ps->opstack);
943 static int filter_opstack_top(struct filter_parse_state *ps)
945 struct opstack_op *opstack_op;
947 if (filter_opstack_empty(ps))
950 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
952 return opstack_op->op;
955 static int filter_opstack_pop(struct filter_parse_state *ps)
957 struct opstack_op *opstack_op;
960 if (filter_opstack_empty(ps))
963 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
965 list_del(&opstack_op->list);
972 static void filter_opstack_clear(struct filter_parse_state *ps)
974 while (!filter_opstack_empty(ps))
975 filter_opstack_pop(ps);
978 static char *curr_operand(struct filter_parse_state *ps)
980 return ps->operand.string;
983 static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
985 struct postfix_elt *elt;
987 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
992 elt->operand = kstrdup(operand, GFP_KERNEL);
998 list_add_tail(&elt->list, &ps->postfix);
1003 static int postfix_append_op(struct filter_parse_state *ps, int op)
1005 struct postfix_elt *elt;
1007 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1012 elt->operand = NULL;
1014 list_add_tail(&elt->list, &ps->postfix);
1019 static void postfix_clear(struct filter_parse_state *ps)
1021 struct postfix_elt *elt;
1023 while (!list_empty(&ps->postfix)) {
1024 elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
1025 list_del(&elt->list);
1026 kfree(elt->operand);
1031 static int filter_parse(struct filter_parse_state *ps)
1037 while ((ch = infix_next(ps))) {
1049 if (is_op_char(ps, ch)) {
1050 op = infix_get_op(ps, ch);
1051 if (op == OP_NONE) {
1052 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1056 if (strlen(curr_operand(ps))) {
1057 postfix_append_operand(ps, curr_operand(ps));
1058 clear_operand_string(ps);
1061 while (!filter_opstack_empty(ps)) {
1062 top_op = filter_opstack_top(ps);
1063 if (!is_precedence_lower(ps, top_op, op)) {
1064 top_op = filter_opstack_pop(ps);
1065 postfix_append_op(ps, top_op);
1071 filter_opstack_push(ps, op);
1076 filter_opstack_push(ps, OP_OPEN_PAREN);
1081 if (strlen(curr_operand(ps))) {
1082 postfix_append_operand(ps, curr_operand(ps));
1083 clear_operand_string(ps);
1086 top_op = filter_opstack_pop(ps);
1087 while (top_op != OP_NONE) {
1088 if (top_op == OP_OPEN_PAREN)
1090 postfix_append_op(ps, top_op);
1091 top_op = filter_opstack_pop(ps);
1093 if (top_op == OP_NONE) {
1094 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1100 if (append_operand_char(ps, ch)) {
1101 parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
1106 if (strlen(curr_operand(ps)))
1107 postfix_append_operand(ps, curr_operand(ps));
1109 while (!filter_opstack_empty(ps)) {
1110 top_op = filter_opstack_pop(ps);
1111 if (top_op == OP_NONE)
1113 if (top_op == OP_OPEN_PAREN) {
1114 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1117 postfix_append_op(ps, top_op);
1123 static struct filter_pred *create_pred(int op, char *operand1, char *operand2)
1125 struct filter_pred *pred;
1127 pred = kzalloc(sizeof(*pred), GFP_KERNEL);
1131 pred->field_name = kstrdup(operand1, GFP_KERNEL);
1132 if (!pred->field_name) {
1137 strcpy(pred->regex.pattern, operand2);
1138 pred->regex.len = strlen(pred->regex.pattern);
1145 static struct filter_pred *create_logical_pred(int op)
1147 struct filter_pred *pred;
1149 pred = kzalloc(sizeof(*pred), GFP_KERNEL);
1158 static int check_preds(struct filter_parse_state *ps)
1160 int n_normal_preds = 0, n_logical_preds = 0;
1161 struct postfix_elt *elt;
1163 list_for_each_entry(elt, &ps->postfix, list) {
1164 if (elt->op == OP_NONE)
1167 if (elt->op == OP_AND || elt->op == OP_OR) {
1174 if (!n_normal_preds || n_logical_preds >= n_normal_preds) {
1175 parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
1182 static int replace_preds(struct ftrace_event_call *call,
1183 struct event_filter *filter,
1184 struct filter_parse_state *ps,
1185 char *filter_string,
1188 char *operand1 = NULL, *operand2 = NULL;
1189 struct filter_pred *pred;
1190 struct postfix_elt *elt;
1194 err = check_preds(ps);
1198 list_for_each_entry(elt, &ps->postfix, list) {
1199 if (elt->op == OP_NONE) {
1201 operand1 = elt->operand;
1203 operand2 = elt->operand;
1205 parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
1211 if (n_preds++ == MAX_FILTER_PRED) {
1212 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1216 if (elt->op == OP_AND || elt->op == OP_OR) {
1217 pred = create_logical_pred(elt->op);
1221 if (!operand1 || !operand2) {
1222 parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
1226 pred = create_pred(elt->op, operand1, operand2);
1230 err = filter_add_pred(ps, call, filter, pred, dry_run);
1231 filter_free_pred(pred);
1235 operand1 = operand2 = NULL;
1241 static int replace_system_preds(struct event_subsystem *system,
1242 struct filter_parse_state *ps,
1243 char *filter_string)
1245 struct ftrace_event_call *call;
1249 list_for_each_entry(call, &ftrace_events, list) {
1250 struct event_filter *filter = call->filter;
1252 if (!call->define_fields)
1255 if (strcmp(call->system, system->name) != 0)
1258 /* try to see if the filter can be applied */
1259 err = replace_preds(call, filter, ps, filter_string, true);
1263 /* really apply the filter */
1264 filter_disable_preds(call);
1265 err = replace_preds(call, filter, ps, filter_string, false);
1267 filter_disable_preds(call);
1269 call->filter_active = 1;
1270 replace_filter_string(filter, filter_string);
1276 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1282 int apply_event_filter(struct ftrace_event_call *call, char *filter_string)
1285 struct filter_parse_state *ps;
1287 mutex_lock(&event_mutex);
1289 err = init_preds(call);
1293 if (!strcmp(strstrip(filter_string), "0")) {
1294 filter_disable_preds(call);
1295 remove_filter_string(call->filter);
1300 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1304 filter_disable_preds(call);
1305 replace_filter_string(call->filter, filter_string);
1307 parse_init(ps, filter_ops, filter_string);
1308 err = filter_parse(ps);
1310 append_filter_err(ps, call->filter);
1314 err = replace_preds(call, call->filter, ps, filter_string, false);
1316 append_filter_err(ps, call->filter);
1318 call->filter_active = 1;
1320 filter_opstack_clear(ps);
1324 mutex_unlock(&event_mutex);
1329 int apply_subsystem_event_filter(struct event_subsystem *system,
1330 char *filter_string)
1333 struct filter_parse_state *ps;
1335 mutex_lock(&event_mutex);
1337 err = init_subsystem_preds(system);
1341 if (!strcmp(strstrip(filter_string), "0")) {
1342 filter_free_subsystem_preds(system);
1343 remove_filter_string(system->filter);
1348 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1352 replace_filter_string(system->filter, filter_string);
1354 parse_init(ps, filter_ops, filter_string);
1355 err = filter_parse(ps);
1357 append_filter_err(ps, system->filter);
1361 err = replace_system_preds(system, ps, filter_string);
1363 append_filter_err(ps, system->filter);
1366 filter_opstack_clear(ps);
1370 mutex_unlock(&event_mutex);
1375 #ifdef CONFIG_PERF_EVENTS
1377 void ftrace_profile_free_filter(struct perf_event *event)
1379 struct event_filter *filter = event->filter;
1381 event->filter = NULL;
1382 __free_preds(filter);
1385 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
1389 struct event_filter *filter;
1390 struct filter_parse_state *ps;
1391 struct ftrace_event_call *call = NULL;
1393 mutex_lock(&event_mutex);
1395 list_for_each_entry(call, &ftrace_events, list) {
1396 if (call->id == event_id)
1401 if (&call->list == &ftrace_events)
1408 filter = __alloc_preds();
1409 if (IS_ERR(filter)) {
1410 err = PTR_ERR(filter);
1415 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1419 parse_init(ps, filter_ops, filter_str);
1420 err = filter_parse(ps);
1424 err = replace_preds(call, filter, ps, filter_str, false);
1426 event->filter = filter;
1429 filter_opstack_clear(ps);
1435 __free_preds(filter);
1438 mutex_unlock(&event_mutex);
1443 #endif /* CONFIG_PERF_EVENTS */