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"
30 #define DEFAULT_SYS_FILTER_MESSAGE \
31 "### global filter ###\n" \
32 "# Use this to set filters for multiple events.\n" \
33 "# Only events with the given fields will be affected.\n" \
34 "# If no events are modified, an error message will be displayed here"
58 /* Order must be the same as enum filter_op_ids above */
59 static struct filter_op filter_ops[] = {
70 { OP_NONE, "OP_NONE", 0 },
71 { OP_OPEN_PAREN, "(", 0 },
77 FILT_ERR_UNBALANCED_PAREN,
78 FILT_ERR_TOO_MANY_OPERANDS,
79 FILT_ERR_OPERAND_TOO_LONG,
80 FILT_ERR_FIELD_NOT_FOUND,
81 FILT_ERR_ILLEGAL_FIELD_OP,
82 FILT_ERR_ILLEGAL_INTVAL,
83 FILT_ERR_BAD_SUBSYS_FILTER,
84 FILT_ERR_TOO_MANY_PREDS,
85 FILT_ERR_MISSING_FIELD,
86 FILT_ERR_INVALID_FILTER,
87 FILT_ERR_IP_FIELD_ONLY,
90 static char *err_text[] = {
97 "Illegal operation for field type",
98 "Illegal integer value",
99 "Couldn't find or set field in one of a subsystem's events",
100 "Too many terms in predicate expression",
101 "Missing field name and/or value",
102 "Meaningless filter expression",
103 "Only 'ip' field is supported for function trace",
108 struct list_head list;
114 struct list_head list;
117 struct filter_parse_state {
118 struct filter_op *ops;
119 struct list_head opstack;
120 struct list_head postfix;
131 char string[MAX_FILTER_STR_VAL];
138 struct filter_pred **preds;
142 #define DEFINE_COMPARISON_PRED(type) \
143 static int filter_pred_##type(struct filter_pred *pred, void *event) \
145 type *addr = (type *)(event + pred->offset); \
146 type val = (type)pred->val; \
149 switch (pred->op) { \
151 match = (*addr < val); \
154 match = (*addr <= val); \
157 match = (*addr > val); \
160 match = (*addr >= val); \
163 match = (*addr & val); \
172 #define DEFINE_EQUALITY_PRED(size) \
173 static int filter_pred_##size(struct filter_pred *pred, void *event) \
175 u##size *addr = (u##size *)(event + pred->offset); \
176 u##size val = (u##size)pred->val; \
179 match = (val == *addr) ^ pred->not; \
184 DEFINE_COMPARISON_PRED(s64);
185 DEFINE_COMPARISON_PRED(u64);
186 DEFINE_COMPARISON_PRED(s32);
187 DEFINE_COMPARISON_PRED(u32);
188 DEFINE_COMPARISON_PRED(s16);
189 DEFINE_COMPARISON_PRED(u16);
190 DEFINE_COMPARISON_PRED(s8);
191 DEFINE_COMPARISON_PRED(u8);
193 DEFINE_EQUALITY_PRED(64);
194 DEFINE_EQUALITY_PRED(32);
195 DEFINE_EQUALITY_PRED(16);
196 DEFINE_EQUALITY_PRED(8);
198 /* Filter predicate for fixed sized arrays of characters */
199 static int filter_pred_string(struct filter_pred *pred, void *event)
201 char *addr = (char *)(event + pred->offset);
204 cmp = pred->regex.match(addr, &pred->regex, pred->regex.field_len);
206 match = cmp ^ pred->not;
211 /* Filter predicate for char * pointers */
212 static int filter_pred_pchar(struct filter_pred *pred, void *event)
214 char **addr = (char **)(event + pred->offset);
216 int len = strlen(*addr) + 1; /* including tailing '\0' */
218 cmp = pred->regex.match(*addr, &pred->regex, len);
220 match = cmp ^ pred->not;
226 * Filter predicate for dynamic sized arrays of characters.
227 * These are implemented through a list of strings at the end
229 * Also each of these strings have a field in the entry which
230 * contains its offset from the beginning of the entry.
231 * We have then first to get this field, dereference it
232 * and add it to the address of the entry, and at last we have
233 * the address of the string.
235 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)
256 * regex_match_foo - Basic regex callbacks
258 * @str: the string to be searched
259 * @r: the regex structure containing the pattern string
260 * @len: the length of the string to be searched (including '\0')
263 * - @str might not be NULL-terminated if it's of type DYN_STRING
267 static int regex_match_full(char *str, struct regex *r, int len)
269 if (strncmp(str, r->pattern, len) == 0)
274 static int regex_match_front(char *str, struct regex *r, int len)
276 if (strncmp(str, r->pattern, r->len) == 0)
281 static int regex_match_middle(char *str, struct regex *r, int len)
283 if (strnstr(str, r->pattern, len))
288 static int regex_match_end(char *str, struct regex *r, int len)
290 int strlen = len - 1;
292 if (strlen >= r->len &&
293 memcmp(str + strlen - r->len, r->pattern, r->len) == 0)
299 * filter_parse_regex - parse a basic regex
300 * @buff: the raw regex
301 * @len: length of the regex
302 * @search: will point to the beginning of the string to compare
303 * @not: tell whether the match will have to be inverted
305 * This passes in a buffer containing a regex and this function will
306 * set search to point to the search part of the buffer and
307 * return the type of search it is (see enum above).
308 * This does modify buff.
311 * search returns the pointer to use for comparison.
312 * not returns 1 if buff started with a '!'
315 enum regex_type filter_parse_regex(char *buff, int len, char **search, int *not)
317 int type = MATCH_FULL;
320 if (buff[0] == '!') {
329 for (i = 0; i < len; i++) {
330 if (buff[i] == '*') {
333 type = MATCH_END_ONLY;
335 if (type == MATCH_END_ONLY)
336 type = MATCH_MIDDLE_ONLY;
338 type = MATCH_FRONT_ONLY;
348 static void filter_build_regex(struct filter_pred *pred)
350 struct regex *r = &pred->regex;
352 enum regex_type type = MATCH_FULL;
355 if (pred->op == OP_GLOB) {
356 type = filter_parse_regex(r->pattern, r->len, &search, ¬);
357 r->len = strlen(search);
358 memmove(r->pattern, search, r->len+1);
363 r->match = regex_match_full;
365 case MATCH_FRONT_ONLY:
366 r->match = regex_match_front;
368 case MATCH_MIDDLE_ONLY:
369 r->match = regex_match_middle;
372 r->match = regex_match_end;
385 static struct filter_pred *
386 get_pred_parent(struct filter_pred *pred, struct filter_pred *preds,
387 int index, enum move_type *move)
389 if (pred->parent & FILTER_PRED_IS_RIGHT)
390 *move = MOVE_UP_FROM_RIGHT;
392 *move = MOVE_UP_FROM_LEFT;
393 pred = &preds[pred->parent & ~FILTER_PRED_IS_RIGHT];
404 typedef int (*filter_pred_walkcb_t) (enum move_type move,
405 struct filter_pred *pred,
406 int *err, void *data);
408 static int walk_pred_tree(struct filter_pred *preds,
409 struct filter_pred *root,
410 filter_pred_walkcb_t cb, void *data)
412 struct filter_pred *pred = root;
413 enum move_type move = MOVE_DOWN;
422 ret = cb(move, pred, &err, data);
423 if (ret == WALK_PRED_ABORT)
425 if (ret == WALK_PRED_PARENT)
430 if (pred->left != FILTER_PRED_INVALID) {
431 pred = &preds[pred->left];
435 case MOVE_UP_FROM_LEFT:
436 pred = &preds[pred->right];
439 case MOVE_UP_FROM_RIGHT:
443 pred = get_pred_parent(pred, preds,
456 * A series of AND or ORs where found together. Instead of
457 * climbing up and down the tree branches, an array of the
458 * ops were made in order of checks. We can just move across
459 * the array and short circuit if needed.
461 static int process_ops(struct filter_pred *preds,
462 struct filter_pred *op, void *rec)
464 struct filter_pred *pred;
470 * Micro-optimization: We set type to true if op
471 * is an OR and false otherwise (AND). Then we
472 * just need to test if the match is equal to
473 * the type, and if it is, we can short circuit the
474 * rest of the checks:
476 * if ((match && op->op == OP_OR) ||
477 * (!match && op->op == OP_AND))
480 type = op->op == OP_OR;
482 for (i = 0; i < op->val; i++) {
483 pred = &preds[op->ops[i]];
484 if (!WARN_ON_ONCE(!pred->fn))
485 match = pred->fn(pred, rec);
492 struct filter_match_preds_data {
493 struct filter_pred *preds;
498 static int filter_match_preds_cb(enum move_type move, struct filter_pred *pred,
499 int *err, void *data)
501 struct filter_match_preds_data *d = data;
506 /* only AND and OR have children */
507 if (pred->left != FILTER_PRED_INVALID) {
508 /* If ops is set, then it was folded. */
510 return WALK_PRED_DEFAULT;
511 /* We can treat folded ops as a leaf node */
512 d->match = process_ops(d->preds, pred, d->rec);
514 if (!WARN_ON_ONCE(!pred->fn))
515 d->match = pred->fn(pred, d->rec);
518 return WALK_PRED_PARENT;
519 case MOVE_UP_FROM_LEFT:
521 * Check for short circuits.
523 * Optimization: !!match == (pred->op == OP_OR)
525 * if ((match && pred->op == OP_OR) ||
526 * (!match && pred->op == OP_AND))
528 if (!!d->match == (pred->op == OP_OR))
529 return WALK_PRED_PARENT;
531 case MOVE_UP_FROM_RIGHT:
535 return WALK_PRED_DEFAULT;
538 /* return 1 if event matches, 0 otherwise (discard) */
539 int filter_match_preds(struct event_filter *filter, void *rec)
541 struct filter_pred *preds;
542 struct filter_pred *root;
543 struct filter_match_preds_data data = {
544 /* match is currently meaningless */
550 /* no filter is considered a match */
554 n_preds = filter->n_preds;
559 * n_preds, root and filter->preds are protect with preemption disabled.
561 root = rcu_dereference_sched(filter->root);
565 data.preds = preds = rcu_dereference_sched(filter->preds);
566 ret = walk_pred_tree(preds, root, filter_match_preds_cb, &data);
570 EXPORT_SYMBOL_GPL(filter_match_preds);
572 static void parse_error(struct filter_parse_state *ps, int err, int pos)
575 ps->lasterr_pos = pos;
578 static void remove_filter_string(struct event_filter *filter)
583 kfree(filter->filter_string);
584 filter->filter_string = NULL;
587 static int replace_filter_string(struct event_filter *filter,
590 kfree(filter->filter_string);
591 filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
592 if (!filter->filter_string)
598 static int append_filter_string(struct event_filter *filter,
602 char *new_filter_string;
604 BUG_ON(!filter->filter_string);
605 newlen = strlen(filter->filter_string) + strlen(string) + 1;
606 new_filter_string = kmalloc(newlen, GFP_KERNEL);
607 if (!new_filter_string)
610 strcpy(new_filter_string, filter->filter_string);
611 strcat(new_filter_string, string);
612 kfree(filter->filter_string);
613 filter->filter_string = new_filter_string;
618 static void append_filter_err(struct filter_parse_state *ps,
619 struct event_filter *filter)
621 int pos = ps->lasterr_pos;
624 buf = (char *)__get_free_page(GFP_TEMPORARY);
628 append_filter_string(filter, "\n");
629 memset(buf, ' ', PAGE_SIZE);
630 if (pos > PAGE_SIZE - 128)
633 pbuf = &buf[pos] + 1;
635 sprintf(pbuf, "\nparse_error: %s\n", err_text[ps->lasterr]);
636 append_filter_string(filter, buf);
637 free_page((unsigned long) buf);
640 void print_event_filter(struct ftrace_event_call *call, struct trace_seq *s)
642 struct event_filter *filter;
644 mutex_lock(&event_mutex);
645 filter = call->filter;
646 if (filter && filter->filter_string)
647 trace_seq_printf(s, "%s\n", filter->filter_string);
649 trace_seq_puts(s, "none\n");
650 mutex_unlock(&event_mutex);
653 void print_subsystem_event_filter(struct event_subsystem *system,
656 struct event_filter *filter;
658 mutex_lock(&event_mutex);
659 filter = system->filter;
660 if (filter && filter->filter_string)
661 trace_seq_printf(s, "%s\n", filter->filter_string);
663 trace_seq_puts(s, DEFAULT_SYS_FILTER_MESSAGE "\n");
664 mutex_unlock(&event_mutex);
667 static int __alloc_pred_stack(struct pred_stack *stack, int n_preds)
669 stack->preds = kcalloc(n_preds + 1, sizeof(*stack->preds), GFP_KERNEL);
672 stack->index = n_preds;
676 static void __free_pred_stack(struct pred_stack *stack)
682 static int __push_pred_stack(struct pred_stack *stack,
683 struct filter_pred *pred)
685 int index = stack->index;
687 if (WARN_ON(index == 0))
690 stack->preds[--index] = pred;
691 stack->index = index;
695 static struct filter_pred *
696 __pop_pred_stack(struct pred_stack *stack)
698 struct filter_pred *pred;
699 int index = stack->index;
701 pred = stack->preds[index++];
705 stack->index = index;
709 static int filter_set_pred(struct event_filter *filter,
711 struct pred_stack *stack,
712 struct filter_pred *src)
714 struct filter_pred *dest = &filter->preds[idx];
715 struct filter_pred *left;
716 struct filter_pred *right;
721 if (dest->op == OP_OR || dest->op == OP_AND) {
722 right = __pop_pred_stack(stack);
723 left = __pop_pred_stack(stack);
727 * If both children can be folded
728 * and they are the same op as this op or a leaf,
729 * then this op can be folded.
731 if (left->index & FILTER_PRED_FOLD &&
732 (left->op == dest->op ||
733 left->left == FILTER_PRED_INVALID) &&
734 right->index & FILTER_PRED_FOLD &&
735 (right->op == dest->op ||
736 right->left == FILTER_PRED_INVALID))
737 dest->index |= FILTER_PRED_FOLD;
739 dest->left = left->index & ~FILTER_PRED_FOLD;
740 dest->right = right->index & ~FILTER_PRED_FOLD;
741 left->parent = dest->index & ~FILTER_PRED_FOLD;
742 right->parent = dest->index | FILTER_PRED_IS_RIGHT;
745 * Make dest->left invalid to be used as a quick
746 * way to know this is a leaf node.
748 dest->left = FILTER_PRED_INVALID;
750 /* All leafs allow folding the parent ops. */
751 dest->index |= FILTER_PRED_FOLD;
754 return __push_pred_stack(stack, dest);
757 static void __free_preds(struct event_filter *filter)
762 for (i = 0; i < filter->n_preds; i++)
763 kfree(filter->preds[i].ops);
764 kfree(filter->preds);
765 filter->preds = NULL;
771 static void filter_disable(struct ftrace_event_call *call)
773 call->flags &= ~TRACE_EVENT_FL_FILTERED;
776 static void __free_filter(struct event_filter *filter)
781 __free_preds(filter);
782 kfree(filter->filter_string);
787 * Called when destroying the ftrace_event_call.
788 * The call is being freed, so we do not need to worry about
789 * the call being currently used. This is for module code removing
790 * the tracepoints from within it.
792 void destroy_preds(struct ftrace_event_call *call)
794 __free_filter(call->filter);
798 static struct event_filter *__alloc_filter(void)
800 struct event_filter *filter;
802 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
806 static int __alloc_preds(struct event_filter *filter, int n_preds)
808 struct filter_pred *pred;
812 __free_preds(filter);
814 filter->preds = kcalloc(n_preds, sizeof(*filter->preds), GFP_KERNEL);
819 filter->a_preds = n_preds;
822 for (i = 0; i < n_preds; i++) {
823 pred = &filter->preds[i];
824 pred->fn = filter_pred_none;
830 static void filter_free_subsystem_preds(struct event_subsystem *system)
832 struct ftrace_event_call *call;
834 list_for_each_entry(call, &ftrace_events, list) {
835 if (strcmp(call->class->system, system->name) != 0)
838 filter_disable(call);
839 remove_filter_string(call->filter);
843 static void filter_free_subsystem_filters(struct event_subsystem *system)
845 struct ftrace_event_call *call;
847 list_for_each_entry(call, &ftrace_events, list) {
848 if (strcmp(call->class->system, system->name) != 0)
850 __free_filter(call->filter);
855 static int filter_add_pred(struct filter_parse_state *ps,
856 struct event_filter *filter,
857 struct filter_pred *pred,
858 struct pred_stack *stack)
862 if (WARN_ON(filter->n_preds == filter->a_preds)) {
863 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
867 err = filter_set_pred(filter, filter->n_preds, stack, pred);
876 int filter_assign_type(const char *type)
878 if (strstr(type, "__data_loc") && strstr(type, "char"))
879 return FILTER_DYN_STRING;
881 if (strchr(type, '[') && strstr(type, "char"))
882 return FILTER_STATIC_STRING;
887 static bool is_function_field(struct ftrace_event_field *field)
889 return field->filter_type == FILTER_TRACE_FN;
892 static bool is_string_field(struct ftrace_event_field *field)
894 return field->filter_type == FILTER_DYN_STRING ||
895 field->filter_type == FILTER_STATIC_STRING ||
896 field->filter_type == FILTER_PTR_STRING;
899 static int is_legal_op(struct ftrace_event_field *field, int op)
901 if (is_string_field(field) &&
902 (op != OP_EQ && op != OP_NE && op != OP_GLOB))
904 if (!is_string_field(field) && op == OP_GLOB)
910 static filter_pred_fn_t select_comparison_fn(int op, int field_size,
913 filter_pred_fn_t fn = NULL;
915 switch (field_size) {
917 if (op == OP_EQ || op == OP_NE)
919 else if (field_is_signed)
920 fn = filter_pred_s64;
922 fn = filter_pred_u64;
925 if (op == OP_EQ || op == OP_NE)
927 else if (field_is_signed)
928 fn = filter_pred_s32;
930 fn = filter_pred_u32;
933 if (op == OP_EQ || op == OP_NE)
935 else if (field_is_signed)
936 fn = filter_pred_s16;
938 fn = filter_pred_u16;
941 if (op == OP_EQ || op == OP_NE)
943 else if (field_is_signed)
953 static int init_pred(struct filter_parse_state *ps,
954 struct ftrace_event_field *field,
955 struct filter_pred *pred)
958 filter_pred_fn_t fn = filter_pred_none;
959 unsigned long long val;
962 pred->offset = field->offset;
964 if (!is_legal_op(field, pred->op)) {
965 parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
969 if (is_string_field(field)) {
970 filter_build_regex(pred);
972 if (field->filter_type == FILTER_STATIC_STRING) {
973 fn = filter_pred_string;
974 pred->regex.field_len = field->size;
975 } else if (field->filter_type == FILTER_DYN_STRING)
976 fn = filter_pred_strloc;
978 fn = filter_pred_pchar;
979 } else if (is_function_field(field)) {
980 if (strcmp(field->name, "ip")) {
981 parse_error(ps, FILT_ERR_IP_FIELD_ONLY, 0);
985 if (field->is_signed)
986 ret = kstrtoll(pred->regex.pattern, 0, &val);
988 ret = kstrtoull(pred->regex.pattern, 0, &val);
990 parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
995 fn = select_comparison_fn(pred->op, field->size,
998 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1003 if (pred->op == OP_NE)
1010 static void parse_init(struct filter_parse_state *ps,
1011 struct filter_op *ops,
1014 memset(ps, '\0', sizeof(*ps));
1016 ps->infix.string = infix_string;
1017 ps->infix.cnt = strlen(infix_string);
1020 INIT_LIST_HEAD(&ps->opstack);
1021 INIT_LIST_HEAD(&ps->postfix);
1024 static char infix_next(struct filter_parse_state *ps)
1028 return ps->infix.string[ps->infix.tail++];
1031 static char infix_peek(struct filter_parse_state *ps)
1033 if (ps->infix.tail == strlen(ps->infix.string))
1036 return ps->infix.string[ps->infix.tail];
1039 static void infix_advance(struct filter_parse_state *ps)
1045 static inline int is_precedence_lower(struct filter_parse_state *ps,
1048 return ps->ops[a].precedence < ps->ops[b].precedence;
1051 static inline int is_op_char(struct filter_parse_state *ps, char c)
1055 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1056 if (ps->ops[i].string[0] == c)
1063 static int infix_get_op(struct filter_parse_state *ps, char firstc)
1065 char nextc = infix_peek(ps);
1073 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1074 if (!strcmp(opstr, ps->ops[i].string)) {
1076 return ps->ops[i].id;
1082 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1083 if (!strcmp(opstr, ps->ops[i].string))
1084 return ps->ops[i].id;
1090 static inline void clear_operand_string(struct filter_parse_state *ps)
1092 memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
1093 ps->operand.tail = 0;
1096 static inline int append_operand_char(struct filter_parse_state *ps, char c)
1098 if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
1101 ps->operand.string[ps->operand.tail++] = c;
1106 static int filter_opstack_push(struct filter_parse_state *ps, int op)
1108 struct opstack_op *opstack_op;
1110 opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
1114 opstack_op->op = op;
1115 list_add(&opstack_op->list, &ps->opstack);
1120 static int filter_opstack_empty(struct filter_parse_state *ps)
1122 return list_empty(&ps->opstack);
1125 static int filter_opstack_top(struct filter_parse_state *ps)
1127 struct opstack_op *opstack_op;
1129 if (filter_opstack_empty(ps))
1132 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1134 return opstack_op->op;
1137 static int filter_opstack_pop(struct filter_parse_state *ps)
1139 struct opstack_op *opstack_op;
1142 if (filter_opstack_empty(ps))
1145 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1146 op = opstack_op->op;
1147 list_del(&opstack_op->list);
1154 static void filter_opstack_clear(struct filter_parse_state *ps)
1156 while (!filter_opstack_empty(ps))
1157 filter_opstack_pop(ps);
1160 static char *curr_operand(struct filter_parse_state *ps)
1162 return ps->operand.string;
1165 static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
1167 struct postfix_elt *elt;
1169 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1174 elt->operand = kstrdup(operand, GFP_KERNEL);
1175 if (!elt->operand) {
1180 list_add_tail(&elt->list, &ps->postfix);
1185 static int postfix_append_op(struct filter_parse_state *ps, int op)
1187 struct postfix_elt *elt;
1189 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1194 elt->operand = NULL;
1196 list_add_tail(&elt->list, &ps->postfix);
1201 static void postfix_clear(struct filter_parse_state *ps)
1203 struct postfix_elt *elt;
1205 while (!list_empty(&ps->postfix)) {
1206 elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
1207 list_del(&elt->list);
1208 kfree(elt->operand);
1213 static int filter_parse(struct filter_parse_state *ps)
1219 while ((ch = infix_next(ps))) {
1231 if (is_op_char(ps, ch)) {
1232 op = infix_get_op(ps, ch);
1233 if (op == OP_NONE) {
1234 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1238 if (strlen(curr_operand(ps))) {
1239 postfix_append_operand(ps, curr_operand(ps));
1240 clear_operand_string(ps);
1243 while (!filter_opstack_empty(ps)) {
1244 top_op = filter_opstack_top(ps);
1245 if (!is_precedence_lower(ps, top_op, op)) {
1246 top_op = filter_opstack_pop(ps);
1247 postfix_append_op(ps, top_op);
1253 filter_opstack_push(ps, op);
1258 filter_opstack_push(ps, OP_OPEN_PAREN);
1263 if (strlen(curr_operand(ps))) {
1264 postfix_append_operand(ps, curr_operand(ps));
1265 clear_operand_string(ps);
1268 top_op = filter_opstack_pop(ps);
1269 while (top_op != OP_NONE) {
1270 if (top_op == OP_OPEN_PAREN)
1272 postfix_append_op(ps, top_op);
1273 top_op = filter_opstack_pop(ps);
1275 if (top_op == OP_NONE) {
1276 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1282 if (append_operand_char(ps, ch)) {
1283 parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
1288 if (strlen(curr_operand(ps)))
1289 postfix_append_operand(ps, curr_operand(ps));
1291 while (!filter_opstack_empty(ps)) {
1292 top_op = filter_opstack_pop(ps);
1293 if (top_op == OP_NONE)
1295 if (top_op == OP_OPEN_PAREN) {
1296 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1299 postfix_append_op(ps, top_op);
1305 static struct filter_pred *create_pred(struct filter_parse_state *ps,
1306 struct ftrace_event_call *call,
1307 int op, char *operand1, char *operand2)
1309 struct ftrace_event_field *field;
1310 static struct filter_pred pred;
1312 memset(&pred, 0, sizeof(pred));
1315 if (op == OP_AND || op == OP_OR)
1318 if (!operand1 || !operand2) {
1319 parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
1323 field = trace_find_event_field(call, operand1);
1325 parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
1329 strcpy(pred.regex.pattern, operand2);
1330 pred.regex.len = strlen(pred.regex.pattern);
1332 return init_pred(ps, field, &pred) ? NULL : &pred;
1335 static int check_preds(struct filter_parse_state *ps)
1337 int n_normal_preds = 0, n_logical_preds = 0;
1338 struct postfix_elt *elt;
1340 list_for_each_entry(elt, &ps->postfix, list) {
1341 if (elt->op == OP_NONE)
1344 if (elt->op == OP_AND || elt->op == OP_OR) {
1351 if (!n_normal_preds || n_logical_preds >= n_normal_preds) {
1352 parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
1359 static int count_preds(struct filter_parse_state *ps)
1361 struct postfix_elt *elt;
1364 list_for_each_entry(elt, &ps->postfix, list) {
1365 if (elt->op == OP_NONE)
1373 struct check_pred_data {
1378 static int check_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1379 int *err, void *data)
1381 struct check_pred_data *d = data;
1383 if (WARN_ON(d->count++ > d->max)) {
1385 return WALK_PRED_ABORT;
1387 return WALK_PRED_DEFAULT;
1391 * The tree is walked at filtering of an event. If the tree is not correctly
1392 * built, it may cause an infinite loop. Check here that the tree does
1395 static int check_pred_tree(struct event_filter *filter,
1396 struct filter_pred *root)
1398 struct check_pred_data data = {
1400 * The max that we can hit a node is three times.
1401 * Once going down, once coming up from left, and
1402 * once coming up from right. This is more than enough
1403 * since leafs are only hit a single time.
1405 .max = 3 * filter->n_preds,
1409 return walk_pred_tree(filter->preds, root,
1410 check_pred_tree_cb, &data);
1413 static int count_leafs_cb(enum move_type move, struct filter_pred *pred,
1414 int *err, void *data)
1418 if ((move == MOVE_DOWN) &&
1419 (pred->left == FILTER_PRED_INVALID))
1422 return WALK_PRED_DEFAULT;
1425 static int count_leafs(struct filter_pred *preds, struct filter_pred *root)
1429 ret = walk_pred_tree(preds, root, count_leafs_cb, &count);
1434 struct fold_pred_data {
1435 struct filter_pred *root;
1440 static int fold_pred_cb(enum move_type move, struct filter_pred *pred,
1441 int *err, void *data)
1443 struct fold_pred_data *d = data;
1444 struct filter_pred *root = d->root;
1446 if (move != MOVE_DOWN)
1447 return WALK_PRED_DEFAULT;
1448 if (pred->left != FILTER_PRED_INVALID)
1449 return WALK_PRED_DEFAULT;
1451 if (WARN_ON(d->count == d->children)) {
1453 return WALK_PRED_ABORT;
1456 pred->index &= ~FILTER_PRED_FOLD;
1457 root->ops[d->count++] = pred->index;
1458 return WALK_PRED_DEFAULT;
1461 static int fold_pred(struct filter_pred *preds, struct filter_pred *root)
1463 struct fold_pred_data data = {
1469 /* No need to keep the fold flag */
1470 root->index &= ~FILTER_PRED_FOLD;
1472 /* If the root is a leaf then do nothing */
1473 if (root->left == FILTER_PRED_INVALID)
1476 /* count the children */
1477 children = count_leafs(preds, &preds[root->left]);
1478 children += count_leafs(preds, &preds[root->right]);
1480 root->ops = kcalloc(children, sizeof(*root->ops), GFP_KERNEL);
1484 root->val = children;
1485 data.children = children;
1486 return walk_pred_tree(preds, root, fold_pred_cb, &data);
1489 static int fold_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1490 int *err, void *data)
1492 struct filter_pred *preds = data;
1494 if (move != MOVE_DOWN)
1495 return WALK_PRED_DEFAULT;
1496 if (!(pred->index & FILTER_PRED_FOLD))
1497 return WALK_PRED_DEFAULT;
1499 *err = fold_pred(preds, pred);
1501 return WALK_PRED_ABORT;
1503 /* eveyrhing below is folded, continue with parent */
1504 return WALK_PRED_PARENT;
1508 * To optimize the processing of the ops, if we have several "ors" or
1509 * "ands" together, we can put them in an array and process them all
1510 * together speeding up the filter logic.
1512 static int fold_pred_tree(struct event_filter *filter,
1513 struct filter_pred *root)
1515 return walk_pred_tree(filter->preds, root, fold_pred_tree_cb,
1519 static int replace_preds(struct ftrace_event_call *call,
1520 struct event_filter *filter,
1521 struct filter_parse_state *ps,
1522 char *filter_string,
1525 char *operand1 = NULL, *operand2 = NULL;
1526 struct filter_pred *pred;
1527 struct filter_pred *root;
1528 struct postfix_elt *elt;
1529 struct pred_stack stack = { }; /* init to NULL */
1533 n_preds = count_preds(ps);
1534 if (n_preds >= MAX_FILTER_PRED) {
1535 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1539 err = check_preds(ps);
1544 err = __alloc_pred_stack(&stack, n_preds);
1547 err = __alloc_preds(filter, n_preds);
1553 list_for_each_entry(elt, &ps->postfix, list) {
1554 if (elt->op == OP_NONE) {
1556 operand1 = elt->operand;
1558 operand2 = elt->operand;
1560 parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
1567 if (WARN_ON(n_preds++ == MAX_FILTER_PRED)) {
1568 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1573 pred = create_pred(ps, call, elt->op, operand1, operand2);
1580 err = filter_add_pred(ps, filter, pred, &stack);
1585 operand1 = operand2 = NULL;
1589 /* We should have one item left on the stack */
1590 pred = __pop_pred_stack(&stack);
1593 /* This item is where we start from in matching */
1595 /* Make sure the stack is empty */
1596 pred = __pop_pred_stack(&stack);
1597 if (WARN_ON(pred)) {
1599 filter->root = NULL;
1602 err = check_pred_tree(filter, root);
1606 /* Optimize the tree */
1607 err = fold_pred_tree(filter, root);
1611 /* We don't set root until we know it works */
1613 filter->root = root;
1618 __free_pred_stack(&stack);
1622 struct filter_list {
1623 struct list_head list;
1624 struct event_filter *filter;
1627 static int replace_system_preds(struct event_subsystem *system,
1628 struct filter_parse_state *ps,
1629 char *filter_string)
1631 struct ftrace_event_call *call;
1632 struct filter_list *filter_item;
1633 struct filter_list *tmp;
1634 LIST_HEAD(filter_list);
1638 list_for_each_entry(call, &ftrace_events, list) {
1640 if (strcmp(call->class->system, system->name) != 0)
1644 * Try to see if the filter can be applied
1645 * (filter arg is ignored on dry_run)
1647 err = replace_preds(call, NULL, ps, filter_string, true);
1649 call->flags |= TRACE_EVENT_FL_NO_SET_FILTER;
1651 call->flags &= ~TRACE_EVENT_FL_NO_SET_FILTER;
1654 list_for_each_entry(call, &ftrace_events, list) {
1655 struct event_filter *filter;
1657 if (strcmp(call->class->system, system->name) != 0)
1660 if (call->flags & TRACE_EVENT_FL_NO_SET_FILTER)
1663 filter_item = kzalloc(sizeof(*filter_item), GFP_KERNEL);
1667 list_add_tail(&filter_item->list, &filter_list);
1669 filter_item->filter = __alloc_filter();
1670 if (!filter_item->filter)
1672 filter = filter_item->filter;
1674 /* Can only fail on no memory */
1675 err = replace_filter_string(filter, filter_string);
1679 err = replace_preds(call, filter, ps, filter_string, false);
1681 filter_disable(call);
1682 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1683 append_filter_err(ps, filter);
1685 call->flags |= TRACE_EVENT_FL_FILTERED;
1687 * Regardless of if this returned an error, we still
1688 * replace the filter for the call.
1690 filter = call->filter;
1691 rcu_assign_pointer(call->filter, filter_item->filter);
1692 filter_item->filter = filter;
1701 * The calls can still be using the old filters.
1702 * Do a synchronize_sched() to ensure all calls are
1703 * done with them before we free them.
1705 synchronize_sched();
1706 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1707 __free_filter(filter_item->filter);
1708 list_del(&filter_item->list);
1713 /* No call succeeded */
1714 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1715 list_del(&filter_item->list);
1718 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1721 /* If any call succeeded, we still need to sync */
1723 synchronize_sched();
1724 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1725 __free_filter(filter_item->filter);
1726 list_del(&filter_item->list);
1732 static int create_filter_start(char *filter_str, bool set_str,
1733 struct filter_parse_state **psp,
1734 struct event_filter **filterp)
1736 struct event_filter *filter;
1737 struct filter_parse_state *ps = NULL;
1740 WARN_ON_ONCE(*psp || *filterp);
1742 /* allocate everything, and if any fails, free all and fail */
1743 filter = __alloc_filter();
1744 if (filter && set_str)
1745 err = replace_filter_string(filter, filter_str);
1747 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1749 if (!filter || !ps || err) {
1751 __free_filter(filter);
1755 /* we're committed to creating a new filter */
1759 parse_init(ps, filter_ops, filter_str);
1760 err = filter_parse(ps);
1762 append_filter_err(ps, filter);
1766 static void create_filter_finish(struct filter_parse_state *ps)
1769 filter_opstack_clear(ps);
1776 * create_filter - create a filter for a ftrace_event_call
1777 * @call: ftrace_event_call to create a filter for
1778 * @filter_str: filter string
1779 * @set_str: remember @filter_str and enable detailed error in filter
1780 * @filterp: out param for created filter (always updated on return)
1782 * Creates a filter for @call with @filter_str. If @set_str is %true,
1783 * @filter_str is copied and recorded in the new filter.
1785 * On success, returns 0 and *@filterp points to the new filter. On
1786 * failure, returns -errno and *@filterp may point to %NULL or to a new
1787 * filter. In the latter case, the returned filter contains error
1788 * information if @set_str is %true and the caller is responsible for
1791 static int create_filter(struct ftrace_event_call *call,
1792 char *filter_str, bool set_str,
1793 struct event_filter **filterp)
1795 struct event_filter *filter = NULL;
1796 struct filter_parse_state *ps = NULL;
1799 err = create_filter_start(filter_str, set_str, &ps, &filter);
1801 err = replace_preds(call, filter, ps, filter_str, false);
1803 append_filter_err(ps, filter);
1805 create_filter_finish(ps);
1812 * create_system_filter - create a filter for an event_subsystem
1813 * @system: event_subsystem to create a filter for
1814 * @filter_str: filter string
1815 * @filterp: out param for created filter (always updated on return)
1817 * Identical to create_filter() except that it creates a subsystem filter
1818 * and always remembers @filter_str.
1820 static int create_system_filter(struct event_subsystem *system,
1821 char *filter_str, struct event_filter **filterp)
1823 struct event_filter *filter = NULL;
1824 struct filter_parse_state *ps = NULL;
1827 err = create_filter_start(filter_str, true, &ps, &filter);
1829 err = replace_system_preds(system, ps, filter_str);
1831 /* System filters just show a default message */
1832 kfree(filter->filter_string);
1833 filter->filter_string = NULL;
1835 append_filter_err(ps, filter);
1838 create_filter_finish(ps);
1844 int apply_event_filter(struct ftrace_event_call *call, char *filter_string)
1846 struct event_filter *filter;
1849 mutex_lock(&event_mutex);
1851 if (!strcmp(strstrip(filter_string), "0")) {
1852 filter_disable(call);
1853 filter = call->filter;
1856 RCU_INIT_POINTER(call->filter, NULL);
1857 /* Make sure the filter is not being used */
1858 synchronize_sched();
1859 __free_filter(filter);
1863 err = create_filter(call, filter_string, true, &filter);
1866 * Always swap the call filter with the new filter
1867 * even if there was an error. If there was an error
1868 * in the filter, we disable the filter and show the error
1872 struct event_filter *tmp = call->filter;
1875 call->flags |= TRACE_EVENT_FL_FILTERED;
1877 filter_disable(call);
1879 rcu_assign_pointer(call->filter, filter);
1882 /* Make sure the call is done with the filter */
1883 synchronize_sched();
1888 mutex_unlock(&event_mutex);
1893 int apply_subsystem_event_filter(struct ftrace_subsystem_dir *dir,
1894 char *filter_string)
1896 struct event_subsystem *system = dir->subsystem;
1897 struct event_filter *filter;
1900 mutex_lock(&event_mutex);
1902 /* Make sure the system still has events */
1903 if (!dir->nr_events) {
1908 if (!strcmp(strstrip(filter_string), "0")) {
1909 filter_free_subsystem_preds(system);
1910 remove_filter_string(system->filter);
1911 filter = system->filter;
1912 system->filter = NULL;
1913 /* Ensure all filters are no longer used */
1914 synchronize_sched();
1915 filter_free_subsystem_filters(system);
1916 __free_filter(filter);
1920 err = create_system_filter(system, filter_string, &filter);
1923 * No event actually uses the system filter
1924 * we can free it without synchronize_sched().
1926 __free_filter(system->filter);
1927 system->filter = filter;
1930 mutex_unlock(&event_mutex);
1935 #ifdef CONFIG_PERF_EVENTS
1937 void ftrace_profile_free_filter(struct perf_event *event)
1939 struct event_filter *filter = event->filter;
1941 event->filter = NULL;
1942 __free_filter(filter);
1945 struct function_filter_data {
1946 struct ftrace_ops *ops;
1951 #ifdef CONFIG_FUNCTION_TRACER
1953 ftrace_function_filter_re(char *buf, int len, int *count)
1955 char *str, *sep, **re;
1957 str = kstrndup(buf, len, GFP_KERNEL);
1962 * The argv_split function takes white space
1963 * as a separator, so convert ',' into spaces.
1965 while ((sep = strchr(str, ',')))
1968 re = argv_split(GFP_KERNEL, str, count);
1973 static int ftrace_function_set_regexp(struct ftrace_ops *ops, int filter,
1974 int reset, char *re, int len)
1979 ret = ftrace_set_filter(ops, re, len, reset);
1981 ret = ftrace_set_notrace(ops, re, len, reset);
1986 static int __ftrace_function_set_filter(int filter, char *buf, int len,
1987 struct function_filter_data *data)
1989 int i, re_cnt, ret = -EINVAL;
1993 reset = filter ? &data->first_filter : &data->first_notrace;
1996 * The 'ip' field could have multiple filters set, separated
1997 * either by space or comma. We first cut the filter and apply
1998 * all pieces separatelly.
2000 re = ftrace_function_filter_re(buf, len, &re_cnt);
2004 for (i = 0; i < re_cnt; i++) {
2005 ret = ftrace_function_set_regexp(data->ops, filter, *reset,
2006 re[i], strlen(re[i]));
2018 static int ftrace_function_check_pred(struct filter_pred *pred, int leaf)
2020 struct ftrace_event_field *field = pred->field;
2024 * Check the leaf predicate for function trace, verify:
2025 * - only '==' and '!=' is used
2026 * - the 'ip' field is used
2028 if ((pred->op != OP_EQ) && (pred->op != OP_NE))
2031 if (strcmp(field->name, "ip"))
2035 * Check the non leaf predicate for function trace, verify:
2036 * - only '||' is used
2038 if (pred->op != OP_OR)
2045 static int ftrace_function_set_filter_cb(enum move_type move,
2046 struct filter_pred *pred,
2047 int *err, void *data)
2049 /* Checking the node is valid for function trace. */
2050 if ((move != MOVE_DOWN) ||
2051 (pred->left != FILTER_PRED_INVALID)) {
2052 *err = ftrace_function_check_pred(pred, 0);
2054 *err = ftrace_function_check_pred(pred, 1);
2056 return WALK_PRED_ABORT;
2058 *err = __ftrace_function_set_filter(pred->op == OP_EQ,
2059 pred->regex.pattern,
2064 return (*err) ? WALK_PRED_ABORT : WALK_PRED_DEFAULT;
2067 static int ftrace_function_set_filter(struct perf_event *event,
2068 struct event_filter *filter)
2070 struct function_filter_data data = {
2073 .ops = &event->ftrace_ops,
2076 return walk_pred_tree(filter->preds, filter->root,
2077 ftrace_function_set_filter_cb, &data);
2080 static int ftrace_function_set_filter(struct perf_event *event,
2081 struct event_filter *filter)
2085 #endif /* CONFIG_FUNCTION_TRACER */
2087 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
2091 struct event_filter *filter;
2092 struct ftrace_event_call *call;
2094 mutex_lock(&event_mutex);
2096 call = event->tp_event;
2106 err = create_filter(call, filter_str, false, &filter);
2110 if (ftrace_event_is_function(call))
2111 err = ftrace_function_set_filter(event, filter);
2113 event->filter = filter;
2116 if (err || ftrace_event_is_function(call))
2117 __free_filter(filter);
2120 mutex_unlock(&event_mutex);
2125 #endif /* CONFIG_PERF_EVENTS */
2127 #ifdef CONFIG_FTRACE_STARTUP_TEST
2129 #include <linux/types.h>
2130 #include <linux/tracepoint.h>
2132 #define CREATE_TRACE_POINTS
2133 #include "trace_events_filter_test.h"
2135 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2138 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2139 .e = ve, .f = vf, .g = vg, .h = vh }, \
2141 .not_visited = nvisit, \
2146 static struct test_filter_data_t {
2148 struct ftrace_raw_ftrace_test_filter rec;
2151 } test_filter_data[] = {
2152 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2153 "e == 1 && f == 1 && g == 1 && h == 1"
2154 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2155 DATA_REC(NO, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2156 DATA_REC(NO, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2158 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2159 "e == 1 || f == 1 || g == 1 || h == 1"
2160 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2161 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2162 DATA_REC(YES, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
2164 #define FILTER "(a == 1 || b == 1) && (c == 1 || d == 1) && " \
2165 "(e == 1 || f == 1) && (g == 1 || h == 1)"
2166 DATA_REC(NO, 0, 0, 1, 1, 1, 1, 1, 1, "dfh"),
2167 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2168 DATA_REC(YES, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2169 DATA_REC(NO, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2171 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2172 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2173 DATA_REC(YES, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2174 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2175 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2177 #define FILTER "(a == 1 && b == 1) && (c == 1 && d == 1) && " \
2178 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2179 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 0, "gh"),
2180 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2181 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, ""),
2183 #define FILTER "((a == 1 || b == 1) || (c == 1 || d == 1) || " \
2184 "(e == 1 || f == 1)) && (g == 1 || h == 1)"
2185 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 1, "bcdef"),
2186 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2187 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
2189 #define FILTER "((((((((a == 1) && (b == 1)) || (c == 1)) && (d == 1)) || " \
2190 "(e == 1)) && (f == 1)) || (g == 1)) && (h == 1))"
2191 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "ceg"),
2192 DATA_REC(NO, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2193 DATA_REC(NO, 1, 0, 1, 0, 1, 0, 1, 0, ""),
2195 #define FILTER "((((((((a == 1) || (b == 1)) && (c == 1)) || (d == 1)) && " \
2196 "(e == 1)) || (f == 1)) && (g == 1)) || (h == 1))"
2197 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "bdfh"),
2198 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2199 DATA_REC(YES, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2207 #define DATA_CNT (sizeof(test_filter_data)/sizeof(struct test_filter_data_t))
2209 static int test_pred_visited;
2211 static int test_pred_visited_fn(struct filter_pred *pred, void *event)
2213 struct ftrace_event_field *field = pred->field;
2215 test_pred_visited = 1;
2216 printk(KERN_INFO "\npred visited %s\n", field->name);
2220 static int test_walk_pred_cb(enum move_type move, struct filter_pred *pred,
2221 int *err, void *data)
2223 char *fields = data;
2225 if ((move == MOVE_DOWN) &&
2226 (pred->left == FILTER_PRED_INVALID)) {
2227 struct ftrace_event_field *field = pred->field;
2230 WARN(1, "all leafs should have field defined");
2231 return WALK_PRED_DEFAULT;
2233 if (!strchr(fields, *field->name))
2234 return WALK_PRED_DEFAULT;
2237 pred->fn = test_pred_visited_fn;
2239 return WALK_PRED_DEFAULT;
2242 static __init int ftrace_test_event_filter(void)
2246 printk(KERN_INFO "Testing ftrace filter: ");
2248 for (i = 0; i < DATA_CNT; i++) {
2249 struct event_filter *filter = NULL;
2250 struct test_filter_data_t *d = &test_filter_data[i];
2253 err = create_filter(&event_ftrace_test_filter, d->filter,
2257 "Failed to get filter for '%s', err %d\n",
2259 __free_filter(filter);
2264 * The preemption disabling is not really needed for self
2265 * tests, but the rcu dereference will complain without it.
2268 if (*d->not_visited)
2269 walk_pred_tree(filter->preds, filter->root,
2273 test_pred_visited = 0;
2274 err = filter_match_preds(filter, &d->rec);
2277 __free_filter(filter);
2279 if (test_pred_visited) {
2281 "Failed, unwanted pred visited for filter %s\n",
2286 if (err != d->match) {
2288 "Failed to match filter '%s', expected %d\n",
2289 d->filter, d->match);
2295 printk(KERN_CONT "OK\n");
2300 late_initcall(ftrace_test_event_filter);
2302 #endif /* CONFIG_FTRACE_STARTUP_TEST */