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"
57 static struct filter_op filter_ops[] = {
67 { OP_NONE, "OP_NONE", 0 },
68 { OP_OPEN_PAREN, "(", 0 },
74 FILT_ERR_UNBALANCED_PAREN,
75 FILT_ERR_TOO_MANY_OPERANDS,
76 FILT_ERR_OPERAND_TOO_LONG,
77 FILT_ERR_FIELD_NOT_FOUND,
78 FILT_ERR_ILLEGAL_FIELD_OP,
79 FILT_ERR_ILLEGAL_INTVAL,
80 FILT_ERR_BAD_SUBSYS_FILTER,
81 FILT_ERR_TOO_MANY_PREDS,
82 FILT_ERR_MISSING_FIELD,
83 FILT_ERR_INVALID_FILTER,
84 FILT_ERR_IP_FIELD_ONLY,
87 static char *err_text[] = {
94 "Illegal operation for field type",
95 "Illegal integer value",
96 "Couldn't find or set field in one of a subsystem's events",
97 "Too many terms in predicate expression",
98 "Missing field name and/or value",
99 "Meaningless filter expression",
100 "Only 'ip' field is supported for function trace",
105 struct list_head list;
111 struct list_head list;
114 struct filter_parse_state {
115 struct filter_op *ops;
116 struct list_head opstack;
117 struct list_head postfix;
128 char string[MAX_FILTER_STR_VAL];
135 struct filter_pred **preds;
139 #define DEFINE_COMPARISON_PRED(type) \
140 static int filter_pred_##type(struct filter_pred *pred, void *event) \
142 type *addr = (type *)(event + pred->offset); \
143 type val = (type)pred->val; \
146 switch (pred->op) { \
148 match = (*addr < val); \
151 match = (*addr <= val); \
154 match = (*addr > val); \
157 match = (*addr >= val); \
166 #define DEFINE_EQUALITY_PRED(size) \
167 static int filter_pred_##size(struct filter_pred *pred, void *event) \
169 u##size *addr = (u##size *)(event + pred->offset); \
170 u##size val = (u##size)pred->val; \
173 match = (val == *addr) ^ pred->not; \
178 DEFINE_COMPARISON_PRED(s64);
179 DEFINE_COMPARISON_PRED(u64);
180 DEFINE_COMPARISON_PRED(s32);
181 DEFINE_COMPARISON_PRED(u32);
182 DEFINE_COMPARISON_PRED(s16);
183 DEFINE_COMPARISON_PRED(u16);
184 DEFINE_COMPARISON_PRED(s8);
185 DEFINE_COMPARISON_PRED(u8);
187 DEFINE_EQUALITY_PRED(64);
188 DEFINE_EQUALITY_PRED(32);
189 DEFINE_EQUALITY_PRED(16);
190 DEFINE_EQUALITY_PRED(8);
192 /* Filter predicate for fixed sized arrays of characters */
193 static int filter_pred_string(struct filter_pred *pred, void *event)
195 char *addr = (char *)(event + pred->offset);
198 cmp = pred->regex.match(addr, &pred->regex, pred->regex.field_len);
200 match = cmp ^ pred->not;
205 /* Filter predicate for char * pointers */
206 static int filter_pred_pchar(struct filter_pred *pred, void *event)
208 char **addr = (char **)(event + pred->offset);
210 int len = strlen(*addr) + 1; /* including tailing '\0' */
212 cmp = pred->regex.match(*addr, &pred->regex, len);
214 match = cmp ^ pred->not;
220 * Filter predicate for dynamic sized arrays of characters.
221 * These are implemented through a list of strings at the end
223 * Also each of these strings have a field in the entry which
224 * contains its offset from the beginning of the entry.
225 * We have then first to get this field, dereference it
226 * and add it to the address of the entry, and at last we have
227 * the address of the string.
229 static int filter_pred_strloc(struct filter_pred *pred, void *event)
231 u32 str_item = *(u32 *)(event + pred->offset);
232 int str_loc = str_item & 0xffff;
233 int str_len = str_item >> 16;
234 char *addr = (char *)(event + str_loc);
237 cmp = pred->regex.match(addr, &pred->regex, str_len);
239 match = cmp ^ pred->not;
244 static int filter_pred_none(struct filter_pred *pred, void *event)
250 * regex_match_foo - Basic regex callbacks
252 * @str: the string to be searched
253 * @r: the regex structure containing the pattern string
254 * @len: the length of the string to be searched (including '\0')
257 * - @str might not be NULL-terminated if it's of type DYN_STRING
261 static int regex_match_full(char *str, struct regex *r, int len)
263 if (strncmp(str, r->pattern, len) == 0)
268 static int regex_match_front(char *str, struct regex *r, int len)
270 if (strncmp(str, r->pattern, r->len) == 0)
275 static int regex_match_middle(char *str, struct regex *r, int len)
277 if (strnstr(str, r->pattern, len))
282 static int regex_match_end(char *str, struct regex *r, int len)
284 int strlen = len - 1;
286 if (strlen >= r->len &&
287 memcmp(str + strlen - r->len, r->pattern, r->len) == 0)
293 * filter_parse_regex - parse a basic regex
294 * @buff: the raw regex
295 * @len: length of the regex
296 * @search: will point to the beginning of the string to compare
297 * @not: tell whether the match will have to be inverted
299 * This passes in a buffer containing a regex and this function will
300 * set search to point to the search part of the buffer and
301 * return the type of search it is (see enum above).
302 * This does modify buff.
305 * search returns the pointer to use for comparison.
306 * not returns 1 if buff started with a '!'
309 enum regex_type filter_parse_regex(char *buff, int len, char **search, int *not)
311 int type = MATCH_FULL;
314 if (buff[0] == '!') {
323 for (i = 0; i < len; i++) {
324 if (buff[i] == '*') {
327 type = MATCH_END_ONLY;
329 if (type == MATCH_END_ONLY)
330 type = MATCH_MIDDLE_ONLY;
332 type = MATCH_FRONT_ONLY;
342 static void filter_build_regex(struct filter_pred *pred)
344 struct regex *r = &pred->regex;
346 enum regex_type type = MATCH_FULL;
349 if (pred->op == OP_GLOB) {
350 type = filter_parse_regex(r->pattern, r->len, &search, ¬);
351 r->len = strlen(search);
352 memmove(r->pattern, search, r->len+1);
357 r->match = regex_match_full;
359 case MATCH_FRONT_ONLY:
360 r->match = regex_match_front;
362 case MATCH_MIDDLE_ONLY:
363 r->match = regex_match_middle;
366 r->match = regex_match_end;
379 static struct filter_pred *
380 get_pred_parent(struct filter_pred *pred, struct filter_pred *preds,
381 int index, enum move_type *move)
383 if (pred->parent & FILTER_PRED_IS_RIGHT)
384 *move = MOVE_UP_FROM_RIGHT;
386 *move = MOVE_UP_FROM_LEFT;
387 pred = &preds[pred->parent & ~FILTER_PRED_IS_RIGHT];
398 typedef int (*filter_pred_walkcb_t) (enum move_type move,
399 struct filter_pred *pred,
400 int *err, void *data);
402 static int walk_pred_tree(struct filter_pred *preds,
403 struct filter_pred *root,
404 filter_pred_walkcb_t cb, void *data)
406 struct filter_pred *pred = root;
407 enum move_type move = MOVE_DOWN;
416 ret = cb(move, pred, &err, data);
417 if (ret == WALK_PRED_ABORT)
419 if (ret == WALK_PRED_PARENT)
424 if (pred->left != FILTER_PRED_INVALID) {
425 pred = &preds[pred->left];
429 case MOVE_UP_FROM_LEFT:
430 pred = &preds[pred->right];
433 case MOVE_UP_FROM_RIGHT:
437 pred = get_pred_parent(pred, preds,
450 * A series of AND or ORs where found together. Instead of
451 * climbing up and down the tree branches, an array of the
452 * ops were made in order of checks. We can just move across
453 * the array and short circuit if needed.
455 static int process_ops(struct filter_pred *preds,
456 struct filter_pred *op, void *rec)
458 struct filter_pred *pred;
464 * Micro-optimization: We set type to true if op
465 * is an OR and false otherwise (AND). Then we
466 * just need to test if the match is equal to
467 * the type, and if it is, we can short circuit the
468 * rest of the checks:
470 * if ((match && op->op == OP_OR) ||
471 * (!match && op->op == OP_AND))
474 type = op->op == OP_OR;
476 for (i = 0; i < op->val; i++) {
477 pred = &preds[op->ops[i]];
478 if (!WARN_ON_ONCE(!pred->fn))
479 match = pred->fn(pred, rec);
486 struct filter_match_preds_data {
487 struct filter_pred *preds;
492 static int filter_match_preds_cb(enum move_type move, struct filter_pred *pred,
493 int *err, void *data)
495 struct filter_match_preds_data *d = data;
500 /* only AND and OR have children */
501 if (pred->left != FILTER_PRED_INVALID) {
502 /* If ops is set, then it was folded. */
504 return WALK_PRED_DEFAULT;
505 /* We can treat folded ops as a leaf node */
506 d->match = process_ops(d->preds, pred, d->rec);
508 if (!WARN_ON_ONCE(!pred->fn))
509 d->match = pred->fn(pred, d->rec);
512 return WALK_PRED_PARENT;
513 case MOVE_UP_FROM_LEFT:
515 * Check for short circuits.
517 * Optimization: !!match == (pred->op == OP_OR)
519 * if ((match && pred->op == OP_OR) ||
520 * (!match && pred->op == OP_AND))
522 if (!!d->match == (pred->op == OP_OR))
523 return WALK_PRED_PARENT;
525 case MOVE_UP_FROM_RIGHT:
529 return WALK_PRED_DEFAULT;
532 /* return 1 if event matches, 0 otherwise (discard) */
533 int filter_match_preds(struct event_filter *filter, void *rec)
535 struct filter_pred *preds;
536 struct filter_pred *root;
537 struct filter_match_preds_data data = {
538 /* match is currently meaningless */
544 /* no filter is considered a match */
548 n_preds = filter->n_preds;
553 * n_preds, root and filter->preds are protect with preemption disabled.
555 root = rcu_dereference_sched(filter->root);
559 data.preds = preds = rcu_dereference_sched(filter->preds);
560 ret = walk_pred_tree(preds, root, filter_match_preds_cb, &data);
564 EXPORT_SYMBOL_GPL(filter_match_preds);
566 static void parse_error(struct filter_parse_state *ps, int err, int pos)
569 ps->lasterr_pos = pos;
572 static void remove_filter_string(struct event_filter *filter)
577 kfree(filter->filter_string);
578 filter->filter_string = NULL;
581 static int replace_filter_string(struct event_filter *filter,
584 kfree(filter->filter_string);
585 filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
586 if (!filter->filter_string)
592 static int append_filter_string(struct event_filter *filter,
596 char *new_filter_string;
598 BUG_ON(!filter->filter_string);
599 newlen = strlen(filter->filter_string) + strlen(string) + 1;
600 new_filter_string = kmalloc(newlen, GFP_KERNEL);
601 if (!new_filter_string)
604 strcpy(new_filter_string, filter->filter_string);
605 strcat(new_filter_string, string);
606 kfree(filter->filter_string);
607 filter->filter_string = new_filter_string;
612 static void append_filter_err(struct filter_parse_state *ps,
613 struct event_filter *filter)
615 int pos = ps->lasterr_pos;
618 buf = (char *)__get_free_page(GFP_TEMPORARY);
622 append_filter_string(filter, "\n");
623 memset(buf, ' ', PAGE_SIZE);
624 if (pos > PAGE_SIZE - 128)
627 pbuf = &buf[pos] + 1;
629 sprintf(pbuf, "\nparse_error: %s\n", err_text[ps->lasterr]);
630 append_filter_string(filter, buf);
631 free_page((unsigned long) buf);
634 void print_event_filter(struct ftrace_event_call *call, struct trace_seq *s)
636 struct event_filter *filter;
638 mutex_lock(&event_mutex);
639 filter = call->filter;
640 if (filter && filter->filter_string)
641 trace_seq_printf(s, "%s\n", filter->filter_string);
643 trace_seq_printf(s, "none\n");
644 mutex_unlock(&event_mutex);
647 void print_subsystem_event_filter(struct event_subsystem *system,
650 struct event_filter *filter;
652 mutex_lock(&event_mutex);
653 filter = system->filter;
654 if (filter && filter->filter_string)
655 trace_seq_printf(s, "%s\n", filter->filter_string);
657 trace_seq_printf(s, DEFAULT_SYS_FILTER_MESSAGE "\n");
658 mutex_unlock(&event_mutex);
661 static int __alloc_pred_stack(struct pred_stack *stack, int n_preds)
663 stack->preds = kcalloc(n_preds + 1, sizeof(*stack->preds), GFP_KERNEL);
666 stack->index = n_preds;
670 static void __free_pred_stack(struct pred_stack *stack)
676 static int __push_pred_stack(struct pred_stack *stack,
677 struct filter_pred *pred)
679 int index = stack->index;
681 if (WARN_ON(index == 0))
684 stack->preds[--index] = pred;
685 stack->index = index;
689 static struct filter_pred *
690 __pop_pred_stack(struct pred_stack *stack)
692 struct filter_pred *pred;
693 int index = stack->index;
695 pred = stack->preds[index++];
699 stack->index = index;
703 static int filter_set_pred(struct event_filter *filter,
705 struct pred_stack *stack,
706 struct filter_pred *src)
708 struct filter_pred *dest = &filter->preds[idx];
709 struct filter_pred *left;
710 struct filter_pred *right;
715 if (dest->op == OP_OR || dest->op == OP_AND) {
716 right = __pop_pred_stack(stack);
717 left = __pop_pred_stack(stack);
721 * If both children can be folded
722 * and they are the same op as this op or a leaf,
723 * then this op can be folded.
725 if (left->index & FILTER_PRED_FOLD &&
726 (left->op == dest->op ||
727 left->left == FILTER_PRED_INVALID) &&
728 right->index & FILTER_PRED_FOLD &&
729 (right->op == dest->op ||
730 right->left == FILTER_PRED_INVALID))
731 dest->index |= FILTER_PRED_FOLD;
733 dest->left = left->index & ~FILTER_PRED_FOLD;
734 dest->right = right->index & ~FILTER_PRED_FOLD;
735 left->parent = dest->index & ~FILTER_PRED_FOLD;
736 right->parent = dest->index | FILTER_PRED_IS_RIGHT;
739 * Make dest->left invalid to be used as a quick
740 * way to know this is a leaf node.
742 dest->left = FILTER_PRED_INVALID;
744 /* All leafs allow folding the parent ops. */
745 dest->index |= FILTER_PRED_FOLD;
748 return __push_pred_stack(stack, dest);
751 static void __free_preds(struct event_filter *filter)
756 for (i = 0; i < filter->n_preds; i++)
757 kfree(filter->preds[i].ops);
758 kfree(filter->preds);
759 filter->preds = NULL;
765 static void filter_disable(struct ftrace_event_call *call)
767 call->flags &= ~TRACE_EVENT_FL_FILTERED;
770 static void __free_filter(struct event_filter *filter)
775 __free_preds(filter);
776 kfree(filter->filter_string);
781 * Called when destroying the ftrace_event_call.
782 * The call is being freed, so we do not need to worry about
783 * the call being currently used. This is for module code removing
784 * the tracepoints from within it.
786 void destroy_preds(struct ftrace_event_call *call)
788 __free_filter(call->filter);
792 static struct event_filter *__alloc_filter(void)
794 struct event_filter *filter;
796 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
800 static int __alloc_preds(struct event_filter *filter, int n_preds)
802 struct filter_pred *pred;
806 __free_preds(filter);
808 filter->preds = kcalloc(n_preds, sizeof(*filter->preds), GFP_KERNEL);
813 filter->a_preds = n_preds;
816 for (i = 0; i < n_preds; i++) {
817 pred = &filter->preds[i];
818 pred->fn = filter_pred_none;
824 static void filter_free_subsystem_preds(struct event_subsystem *system)
826 struct ftrace_event_call *call;
828 list_for_each_entry(call, &ftrace_events, list) {
829 if (strcmp(call->class->system, system->name) != 0)
832 filter_disable(call);
833 remove_filter_string(call->filter);
837 static void filter_free_subsystem_filters(struct event_subsystem *system)
839 struct ftrace_event_call *call;
841 list_for_each_entry(call, &ftrace_events, list) {
842 if (strcmp(call->class->system, system->name) != 0)
844 __free_filter(call->filter);
849 static int filter_add_pred(struct filter_parse_state *ps,
850 struct event_filter *filter,
851 struct filter_pred *pred,
852 struct pred_stack *stack)
856 if (WARN_ON(filter->n_preds == filter->a_preds)) {
857 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
861 err = filter_set_pred(filter, filter->n_preds, stack, pred);
870 int filter_assign_type(const char *type)
872 if (strstr(type, "__data_loc") && strstr(type, "char"))
873 return FILTER_DYN_STRING;
875 if (strchr(type, '[') && strstr(type, "char"))
876 return FILTER_STATIC_STRING;
881 static bool is_function_field(struct ftrace_event_field *field)
883 return field->filter_type == FILTER_TRACE_FN;
886 static bool is_string_field(struct ftrace_event_field *field)
888 return field->filter_type == FILTER_DYN_STRING ||
889 field->filter_type == FILTER_STATIC_STRING ||
890 field->filter_type == FILTER_PTR_STRING;
893 static int is_legal_op(struct ftrace_event_field *field, int op)
895 if (is_string_field(field) &&
896 (op != OP_EQ && op != OP_NE && op != OP_GLOB))
898 if (!is_string_field(field) && op == OP_GLOB)
904 static filter_pred_fn_t select_comparison_fn(int op, int field_size,
907 filter_pred_fn_t fn = NULL;
909 switch (field_size) {
911 if (op == OP_EQ || op == OP_NE)
913 else if (field_is_signed)
914 fn = filter_pred_s64;
916 fn = filter_pred_u64;
919 if (op == OP_EQ || op == OP_NE)
921 else if (field_is_signed)
922 fn = filter_pred_s32;
924 fn = filter_pred_u32;
927 if (op == OP_EQ || op == OP_NE)
929 else if (field_is_signed)
930 fn = filter_pred_s16;
932 fn = filter_pred_u16;
935 if (op == OP_EQ || op == OP_NE)
937 else if (field_is_signed)
947 static int init_pred(struct filter_parse_state *ps,
948 struct ftrace_event_field *field,
949 struct filter_pred *pred)
952 filter_pred_fn_t fn = filter_pred_none;
953 unsigned long long val;
956 pred->offset = field->offset;
958 if (!is_legal_op(field, pred->op)) {
959 parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
963 if (is_string_field(field)) {
964 filter_build_regex(pred);
966 if (field->filter_type == FILTER_STATIC_STRING) {
967 fn = filter_pred_string;
968 pred->regex.field_len = field->size;
969 } else if (field->filter_type == FILTER_DYN_STRING)
970 fn = filter_pred_strloc;
972 fn = filter_pred_pchar;
973 } else if (is_function_field(field)) {
974 if (strcmp(field->name, "ip")) {
975 parse_error(ps, FILT_ERR_IP_FIELD_ONLY, 0);
979 if (field->is_signed)
980 ret = kstrtoll(pred->regex.pattern, 0, &val);
982 ret = kstrtoull(pred->regex.pattern, 0, &val);
984 parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
989 fn = select_comparison_fn(pred->op, field->size,
992 parse_error(ps, FILT_ERR_INVALID_OP, 0);
997 if (pred->op == OP_NE)
1004 static void parse_init(struct filter_parse_state *ps,
1005 struct filter_op *ops,
1008 memset(ps, '\0', sizeof(*ps));
1010 ps->infix.string = infix_string;
1011 ps->infix.cnt = strlen(infix_string);
1014 INIT_LIST_HEAD(&ps->opstack);
1015 INIT_LIST_HEAD(&ps->postfix);
1018 static char infix_next(struct filter_parse_state *ps)
1022 return ps->infix.string[ps->infix.tail++];
1025 static char infix_peek(struct filter_parse_state *ps)
1027 if (ps->infix.tail == strlen(ps->infix.string))
1030 return ps->infix.string[ps->infix.tail];
1033 static void infix_advance(struct filter_parse_state *ps)
1039 static inline int is_precedence_lower(struct filter_parse_state *ps,
1042 return ps->ops[a].precedence < ps->ops[b].precedence;
1045 static inline int is_op_char(struct filter_parse_state *ps, char c)
1049 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1050 if (ps->ops[i].string[0] == c)
1057 static int infix_get_op(struct filter_parse_state *ps, char firstc)
1059 char nextc = infix_peek(ps);
1067 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1068 if (!strcmp(opstr, ps->ops[i].string)) {
1070 return ps->ops[i].id;
1076 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1077 if (!strcmp(opstr, ps->ops[i].string))
1078 return ps->ops[i].id;
1084 static inline void clear_operand_string(struct filter_parse_state *ps)
1086 memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
1087 ps->operand.tail = 0;
1090 static inline int append_operand_char(struct filter_parse_state *ps, char c)
1092 if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
1095 ps->operand.string[ps->operand.tail++] = c;
1100 static int filter_opstack_push(struct filter_parse_state *ps, int op)
1102 struct opstack_op *opstack_op;
1104 opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
1108 opstack_op->op = op;
1109 list_add(&opstack_op->list, &ps->opstack);
1114 static int filter_opstack_empty(struct filter_parse_state *ps)
1116 return list_empty(&ps->opstack);
1119 static int filter_opstack_top(struct filter_parse_state *ps)
1121 struct opstack_op *opstack_op;
1123 if (filter_opstack_empty(ps))
1126 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1128 return opstack_op->op;
1131 static int filter_opstack_pop(struct filter_parse_state *ps)
1133 struct opstack_op *opstack_op;
1136 if (filter_opstack_empty(ps))
1139 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1140 op = opstack_op->op;
1141 list_del(&opstack_op->list);
1148 static void filter_opstack_clear(struct filter_parse_state *ps)
1150 while (!filter_opstack_empty(ps))
1151 filter_opstack_pop(ps);
1154 static char *curr_operand(struct filter_parse_state *ps)
1156 return ps->operand.string;
1159 static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
1161 struct postfix_elt *elt;
1163 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1168 elt->operand = kstrdup(operand, GFP_KERNEL);
1169 if (!elt->operand) {
1174 list_add_tail(&elt->list, &ps->postfix);
1179 static int postfix_append_op(struct filter_parse_state *ps, int op)
1181 struct postfix_elt *elt;
1183 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1188 elt->operand = NULL;
1190 list_add_tail(&elt->list, &ps->postfix);
1195 static void postfix_clear(struct filter_parse_state *ps)
1197 struct postfix_elt *elt;
1199 while (!list_empty(&ps->postfix)) {
1200 elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
1201 list_del(&elt->list);
1202 kfree(elt->operand);
1207 static int filter_parse(struct filter_parse_state *ps)
1213 while ((ch = infix_next(ps))) {
1225 if (is_op_char(ps, ch)) {
1226 op = infix_get_op(ps, ch);
1227 if (op == OP_NONE) {
1228 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1232 if (strlen(curr_operand(ps))) {
1233 postfix_append_operand(ps, curr_operand(ps));
1234 clear_operand_string(ps);
1237 while (!filter_opstack_empty(ps)) {
1238 top_op = filter_opstack_top(ps);
1239 if (!is_precedence_lower(ps, top_op, op)) {
1240 top_op = filter_opstack_pop(ps);
1241 postfix_append_op(ps, top_op);
1247 filter_opstack_push(ps, op);
1252 filter_opstack_push(ps, OP_OPEN_PAREN);
1257 if (strlen(curr_operand(ps))) {
1258 postfix_append_operand(ps, curr_operand(ps));
1259 clear_operand_string(ps);
1262 top_op = filter_opstack_pop(ps);
1263 while (top_op != OP_NONE) {
1264 if (top_op == OP_OPEN_PAREN)
1266 postfix_append_op(ps, top_op);
1267 top_op = filter_opstack_pop(ps);
1269 if (top_op == OP_NONE) {
1270 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1276 if (append_operand_char(ps, ch)) {
1277 parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
1282 if (strlen(curr_operand(ps)))
1283 postfix_append_operand(ps, curr_operand(ps));
1285 while (!filter_opstack_empty(ps)) {
1286 top_op = filter_opstack_pop(ps);
1287 if (top_op == OP_NONE)
1289 if (top_op == OP_OPEN_PAREN) {
1290 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1293 postfix_append_op(ps, top_op);
1299 static struct filter_pred *create_pred(struct filter_parse_state *ps,
1300 struct ftrace_event_call *call,
1301 int op, char *operand1, char *operand2)
1303 struct ftrace_event_field *field;
1304 static struct filter_pred pred;
1306 memset(&pred, 0, sizeof(pred));
1309 if (op == OP_AND || op == OP_OR)
1312 if (!operand1 || !operand2) {
1313 parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
1317 field = trace_find_event_field(call, operand1);
1319 parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
1323 strcpy(pred.regex.pattern, operand2);
1324 pred.regex.len = strlen(pred.regex.pattern);
1326 return init_pred(ps, field, &pred) ? NULL : &pred;
1329 static int check_preds(struct filter_parse_state *ps)
1331 int n_normal_preds = 0, n_logical_preds = 0;
1332 struct postfix_elt *elt;
1334 list_for_each_entry(elt, &ps->postfix, list) {
1335 if (elt->op == OP_NONE)
1338 if (elt->op == OP_AND || elt->op == OP_OR) {
1345 if (!n_normal_preds || n_logical_preds >= n_normal_preds) {
1346 parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
1353 static int count_preds(struct filter_parse_state *ps)
1355 struct postfix_elt *elt;
1358 list_for_each_entry(elt, &ps->postfix, list) {
1359 if (elt->op == OP_NONE)
1367 struct check_pred_data {
1372 static int check_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1373 int *err, void *data)
1375 struct check_pred_data *d = data;
1377 if (WARN_ON(d->count++ > d->max)) {
1379 return WALK_PRED_ABORT;
1381 return WALK_PRED_DEFAULT;
1385 * The tree is walked at filtering of an event. If the tree is not correctly
1386 * built, it may cause an infinite loop. Check here that the tree does
1389 static int check_pred_tree(struct event_filter *filter,
1390 struct filter_pred *root)
1392 struct check_pred_data data = {
1394 * The max that we can hit a node is three times.
1395 * Once going down, once coming up from left, and
1396 * once coming up from right. This is more than enough
1397 * since leafs are only hit a single time.
1399 .max = 3 * filter->n_preds,
1403 return walk_pred_tree(filter->preds, root,
1404 check_pred_tree_cb, &data);
1407 static int count_leafs_cb(enum move_type move, struct filter_pred *pred,
1408 int *err, void *data)
1412 if ((move == MOVE_DOWN) &&
1413 (pred->left == FILTER_PRED_INVALID))
1416 return WALK_PRED_DEFAULT;
1419 static int count_leafs(struct filter_pred *preds, struct filter_pred *root)
1423 ret = walk_pred_tree(preds, root, count_leafs_cb, &count);
1428 struct fold_pred_data {
1429 struct filter_pred *root;
1434 static int fold_pred_cb(enum move_type move, struct filter_pred *pred,
1435 int *err, void *data)
1437 struct fold_pred_data *d = data;
1438 struct filter_pred *root = d->root;
1440 if (move != MOVE_DOWN)
1441 return WALK_PRED_DEFAULT;
1442 if (pred->left != FILTER_PRED_INVALID)
1443 return WALK_PRED_DEFAULT;
1445 if (WARN_ON(d->count == d->children)) {
1447 return WALK_PRED_ABORT;
1450 pred->index &= ~FILTER_PRED_FOLD;
1451 root->ops[d->count++] = pred->index;
1452 return WALK_PRED_DEFAULT;
1455 static int fold_pred(struct filter_pred *preds, struct filter_pred *root)
1457 struct fold_pred_data data = {
1463 /* No need to keep the fold flag */
1464 root->index &= ~FILTER_PRED_FOLD;
1466 /* If the root is a leaf then do nothing */
1467 if (root->left == FILTER_PRED_INVALID)
1470 /* count the children */
1471 children = count_leafs(preds, &preds[root->left]);
1472 children += count_leafs(preds, &preds[root->right]);
1474 root->ops = kcalloc(children, sizeof(*root->ops), GFP_KERNEL);
1478 root->val = children;
1479 data.children = children;
1480 return walk_pred_tree(preds, root, fold_pred_cb, &data);
1483 static int fold_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1484 int *err, void *data)
1486 struct filter_pred *preds = data;
1488 if (move != MOVE_DOWN)
1489 return WALK_PRED_DEFAULT;
1490 if (!(pred->index & FILTER_PRED_FOLD))
1491 return WALK_PRED_DEFAULT;
1493 *err = fold_pred(preds, pred);
1495 return WALK_PRED_ABORT;
1497 /* eveyrhing below is folded, continue with parent */
1498 return WALK_PRED_PARENT;
1502 * To optimize the processing of the ops, if we have several "ors" or
1503 * "ands" together, we can put them in an array and process them all
1504 * together speeding up the filter logic.
1506 static int fold_pred_tree(struct event_filter *filter,
1507 struct filter_pred *root)
1509 return walk_pred_tree(filter->preds, root, fold_pred_tree_cb,
1513 static int replace_preds(struct ftrace_event_call *call,
1514 struct event_filter *filter,
1515 struct filter_parse_state *ps,
1516 char *filter_string,
1519 char *operand1 = NULL, *operand2 = NULL;
1520 struct filter_pred *pred;
1521 struct filter_pred *root;
1522 struct postfix_elt *elt;
1523 struct pred_stack stack = { }; /* init to NULL */
1527 n_preds = count_preds(ps);
1528 if (n_preds >= MAX_FILTER_PRED) {
1529 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1533 err = check_preds(ps);
1538 err = __alloc_pred_stack(&stack, n_preds);
1541 err = __alloc_preds(filter, n_preds);
1547 list_for_each_entry(elt, &ps->postfix, list) {
1548 if (elt->op == OP_NONE) {
1550 operand1 = elt->operand;
1552 operand2 = elt->operand;
1554 parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
1561 if (WARN_ON(n_preds++ == MAX_FILTER_PRED)) {
1562 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1567 pred = create_pred(ps, call, elt->op, operand1, operand2);
1574 err = filter_add_pred(ps, filter, pred, &stack);
1579 operand1 = operand2 = NULL;
1583 /* We should have one item left on the stack */
1584 pred = __pop_pred_stack(&stack);
1587 /* This item is where we start from in matching */
1589 /* Make sure the stack is empty */
1590 pred = __pop_pred_stack(&stack);
1591 if (WARN_ON(pred)) {
1593 filter->root = NULL;
1596 err = check_pred_tree(filter, root);
1600 /* Optimize the tree */
1601 err = fold_pred_tree(filter, root);
1605 /* We don't set root until we know it works */
1607 filter->root = root;
1612 __free_pred_stack(&stack);
1616 struct filter_list {
1617 struct list_head list;
1618 struct event_filter *filter;
1621 static int replace_system_preds(struct event_subsystem *system,
1622 struct filter_parse_state *ps,
1623 char *filter_string)
1625 struct ftrace_event_call *call;
1626 struct filter_list *filter_item;
1627 struct filter_list *tmp;
1628 LIST_HEAD(filter_list);
1632 list_for_each_entry(call, &ftrace_events, list) {
1634 if (strcmp(call->class->system, system->name) != 0)
1638 * Try to see if the filter can be applied
1639 * (filter arg is ignored on dry_run)
1641 err = replace_preds(call, NULL, ps, filter_string, true);
1643 call->flags |= TRACE_EVENT_FL_NO_SET_FILTER;
1645 call->flags &= ~TRACE_EVENT_FL_NO_SET_FILTER;
1648 list_for_each_entry(call, &ftrace_events, list) {
1649 struct event_filter *filter;
1651 if (strcmp(call->class->system, system->name) != 0)
1654 if (call->flags & TRACE_EVENT_FL_NO_SET_FILTER)
1657 filter_item = kzalloc(sizeof(*filter_item), GFP_KERNEL);
1661 list_add_tail(&filter_item->list, &filter_list);
1663 filter_item->filter = __alloc_filter();
1664 if (!filter_item->filter)
1666 filter = filter_item->filter;
1668 /* Can only fail on no memory */
1669 err = replace_filter_string(filter, filter_string);
1673 err = replace_preds(call, filter, ps, filter_string, false);
1675 filter_disable(call);
1676 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1677 append_filter_err(ps, filter);
1679 call->flags |= TRACE_EVENT_FL_FILTERED;
1681 * Regardless of if this returned an error, we still
1682 * replace the filter for the call.
1684 filter = call->filter;
1685 rcu_assign_pointer(call->filter, filter_item->filter);
1686 filter_item->filter = filter;
1695 * The calls can still be using the old filters.
1696 * Do a synchronize_sched() to ensure all calls are
1697 * done with them before we free them.
1699 synchronize_sched();
1700 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1701 __free_filter(filter_item->filter);
1702 list_del(&filter_item->list);
1707 /* No call succeeded */
1708 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1709 list_del(&filter_item->list);
1712 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1715 /* If any call succeeded, we still need to sync */
1717 synchronize_sched();
1718 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1719 __free_filter(filter_item->filter);
1720 list_del(&filter_item->list);
1726 static int create_filter_start(char *filter_str, bool set_str,
1727 struct filter_parse_state **psp,
1728 struct event_filter **filterp)
1730 struct event_filter *filter;
1731 struct filter_parse_state *ps = NULL;
1734 WARN_ON_ONCE(*psp || *filterp);
1736 /* allocate everything, and if any fails, free all and fail */
1737 filter = __alloc_filter();
1738 if (filter && set_str)
1739 err = replace_filter_string(filter, filter_str);
1741 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1743 if (!filter || !ps || err) {
1745 __free_filter(filter);
1749 /* we're committed to creating a new filter */
1753 parse_init(ps, filter_ops, filter_str);
1754 err = filter_parse(ps);
1756 append_filter_err(ps, filter);
1760 static void create_filter_finish(struct filter_parse_state *ps)
1763 filter_opstack_clear(ps);
1770 * create_filter - create a filter for a ftrace_event_call
1771 * @call: ftrace_event_call to create a filter for
1772 * @filter_str: filter string
1773 * @set_str: remember @filter_str and enable detailed error in filter
1774 * @filterp: out param for created filter (always updated on return)
1776 * Creates a filter for @call with @filter_str. If @set_str is %true,
1777 * @filter_str is copied and recorded in the new filter.
1779 * On success, returns 0 and *@filterp points to the new filter. On
1780 * failure, returns -errno and *@filterp may point to %NULL or to a new
1781 * filter. In the latter case, the returned filter contains error
1782 * information if @set_str is %true and the caller is responsible for
1785 static int create_filter(struct ftrace_event_call *call,
1786 char *filter_str, bool set_str,
1787 struct event_filter **filterp)
1789 struct event_filter *filter = NULL;
1790 struct filter_parse_state *ps = NULL;
1793 err = create_filter_start(filter_str, set_str, &ps, &filter);
1795 err = replace_preds(call, filter, ps, filter_str, false);
1797 append_filter_err(ps, filter);
1799 create_filter_finish(ps);
1806 * create_system_filter - create a filter for an event_subsystem
1807 * @system: event_subsystem to create a filter for
1808 * @filter_str: filter string
1809 * @filterp: out param for created filter (always updated on return)
1811 * Identical to create_filter() except that it creates a subsystem filter
1812 * and always remembers @filter_str.
1814 static int create_system_filter(struct event_subsystem *system,
1815 char *filter_str, struct event_filter **filterp)
1817 struct event_filter *filter = NULL;
1818 struct filter_parse_state *ps = NULL;
1821 err = create_filter_start(filter_str, true, &ps, &filter);
1823 err = replace_system_preds(system, ps, filter_str);
1825 /* System filters just show a default message */
1826 kfree(filter->filter_string);
1827 filter->filter_string = NULL;
1829 append_filter_err(ps, filter);
1832 create_filter_finish(ps);
1838 int apply_event_filter(struct ftrace_event_call *call, char *filter_string)
1840 struct event_filter *filter;
1843 mutex_lock(&event_mutex);
1845 if (!strcmp(strstrip(filter_string), "0")) {
1846 filter_disable(call);
1847 filter = call->filter;
1850 RCU_INIT_POINTER(call->filter, NULL);
1851 /* Make sure the filter is not being used */
1852 synchronize_sched();
1853 __free_filter(filter);
1857 err = create_filter(call, filter_string, true, &filter);
1860 * Always swap the call filter with the new filter
1861 * even if there was an error. If there was an error
1862 * in the filter, we disable the filter and show the error
1866 struct event_filter *tmp = call->filter;
1869 call->flags |= TRACE_EVENT_FL_FILTERED;
1871 filter_disable(call);
1873 rcu_assign_pointer(call->filter, filter);
1876 /* Make sure the call is done with the filter */
1877 synchronize_sched();
1882 mutex_unlock(&event_mutex);
1887 int apply_subsystem_event_filter(struct ftrace_subsystem_dir *dir,
1888 char *filter_string)
1890 struct event_subsystem *system = dir->subsystem;
1891 struct event_filter *filter;
1894 mutex_lock(&event_mutex);
1896 /* Make sure the system still has events */
1897 if (!dir->nr_events) {
1902 if (!strcmp(strstrip(filter_string), "0")) {
1903 filter_free_subsystem_preds(system);
1904 remove_filter_string(system->filter);
1905 filter = system->filter;
1906 system->filter = NULL;
1907 /* Ensure all filters are no longer used */
1908 synchronize_sched();
1909 filter_free_subsystem_filters(system);
1910 __free_filter(filter);
1914 err = create_system_filter(system, filter_string, &filter);
1917 * No event actually uses the system filter
1918 * we can free it without synchronize_sched().
1920 __free_filter(system->filter);
1921 system->filter = filter;
1924 mutex_unlock(&event_mutex);
1929 #ifdef CONFIG_PERF_EVENTS
1931 void ftrace_profile_free_filter(struct perf_event *event)
1933 struct event_filter *filter = event->filter;
1935 event->filter = NULL;
1936 __free_filter(filter);
1939 struct function_filter_data {
1940 struct ftrace_ops *ops;
1945 #ifdef CONFIG_FUNCTION_TRACER
1947 ftrace_function_filter_re(char *buf, int len, int *count)
1949 char *str, *sep, **re;
1951 str = kstrndup(buf, len, GFP_KERNEL);
1956 * The argv_split function takes white space
1957 * as a separator, so convert ',' into spaces.
1959 while ((sep = strchr(str, ',')))
1962 re = argv_split(GFP_KERNEL, str, count);
1967 static int ftrace_function_set_regexp(struct ftrace_ops *ops, int filter,
1968 int reset, char *re, int len)
1973 ret = ftrace_set_filter(ops, re, len, reset);
1975 ret = ftrace_set_notrace(ops, re, len, reset);
1980 static int __ftrace_function_set_filter(int filter, char *buf, int len,
1981 struct function_filter_data *data)
1983 int i, re_cnt, ret = -EINVAL;
1987 reset = filter ? &data->first_filter : &data->first_notrace;
1990 * The 'ip' field could have multiple filters set, separated
1991 * either by space or comma. We first cut the filter and apply
1992 * all pieces separatelly.
1994 re = ftrace_function_filter_re(buf, len, &re_cnt);
1998 for (i = 0; i < re_cnt; i++) {
1999 ret = ftrace_function_set_regexp(data->ops, filter, *reset,
2000 re[i], strlen(re[i]));
2012 static int ftrace_function_check_pred(struct filter_pred *pred, int leaf)
2014 struct ftrace_event_field *field = pred->field;
2018 * Check the leaf predicate for function trace, verify:
2019 * - only '==' and '!=' is used
2020 * - the 'ip' field is used
2022 if ((pred->op != OP_EQ) && (pred->op != OP_NE))
2025 if (strcmp(field->name, "ip"))
2029 * Check the non leaf predicate for function trace, verify:
2030 * - only '||' is used
2032 if (pred->op != OP_OR)
2039 static int ftrace_function_set_filter_cb(enum move_type move,
2040 struct filter_pred *pred,
2041 int *err, void *data)
2043 /* Checking the node is valid for function trace. */
2044 if ((move != MOVE_DOWN) ||
2045 (pred->left != FILTER_PRED_INVALID)) {
2046 *err = ftrace_function_check_pred(pred, 0);
2048 *err = ftrace_function_check_pred(pred, 1);
2050 return WALK_PRED_ABORT;
2052 *err = __ftrace_function_set_filter(pred->op == OP_EQ,
2053 pred->regex.pattern,
2058 return (*err) ? WALK_PRED_ABORT : WALK_PRED_DEFAULT;
2061 static int ftrace_function_set_filter(struct perf_event *event,
2062 struct event_filter *filter)
2064 struct function_filter_data data = {
2067 .ops = &event->ftrace_ops,
2070 return walk_pred_tree(filter->preds, filter->root,
2071 ftrace_function_set_filter_cb, &data);
2074 static int ftrace_function_set_filter(struct perf_event *event,
2075 struct event_filter *filter)
2079 #endif /* CONFIG_FUNCTION_TRACER */
2081 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
2085 struct event_filter *filter;
2086 struct ftrace_event_call *call;
2088 mutex_lock(&event_mutex);
2090 call = event->tp_event;
2100 err = create_filter(call, filter_str, false, &filter);
2104 if (ftrace_event_is_function(call))
2105 err = ftrace_function_set_filter(event, filter);
2107 event->filter = filter;
2110 if (err || ftrace_event_is_function(call))
2111 __free_filter(filter);
2114 mutex_unlock(&event_mutex);
2119 #endif /* CONFIG_PERF_EVENTS */
2121 #ifdef CONFIG_FTRACE_STARTUP_TEST
2123 #include <linux/types.h>
2124 #include <linux/tracepoint.h>
2126 #define CREATE_TRACE_POINTS
2127 #include "trace_events_filter_test.h"
2129 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2132 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2133 .e = ve, .f = vf, .g = vg, .h = vh }, \
2135 .not_visited = nvisit, \
2140 static struct test_filter_data_t {
2142 struct ftrace_raw_ftrace_test_filter rec;
2145 } test_filter_data[] = {
2146 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2147 "e == 1 && f == 1 && g == 1 && h == 1"
2148 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2149 DATA_REC(NO, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2150 DATA_REC(NO, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2152 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2153 "e == 1 || f == 1 || g == 1 || h == 1"
2154 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2155 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2156 DATA_REC(YES, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
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, 1, 1, 1, 1, 1, 1, "dfh"),
2161 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2162 DATA_REC(YES, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2163 DATA_REC(NO, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2165 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2166 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2167 DATA_REC(YES, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2168 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2169 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
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, 1, 1, 1, 1, 1, 0, 0, "gh"),
2174 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2175 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 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, 1, "bcdef"),
2180 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2181 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
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, 1, 1, "ceg"),
2186 DATA_REC(NO, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2187 DATA_REC(NO, 1, 0, 1, 0, 1, 0, 1, 0, ""),
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, "bdfh"),
2192 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2193 DATA_REC(YES, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2201 #define DATA_CNT (sizeof(test_filter_data)/sizeof(struct test_filter_data_t))
2203 static int test_pred_visited;
2205 static int test_pred_visited_fn(struct filter_pred *pred, void *event)
2207 struct ftrace_event_field *field = pred->field;
2209 test_pred_visited = 1;
2210 printk(KERN_INFO "\npred visited %s\n", field->name);
2214 static int test_walk_pred_cb(enum move_type move, struct filter_pred *pred,
2215 int *err, void *data)
2217 char *fields = data;
2219 if ((move == MOVE_DOWN) &&
2220 (pred->left == FILTER_PRED_INVALID)) {
2221 struct ftrace_event_field *field = pred->field;
2224 WARN(1, "all leafs should have field defined");
2225 return WALK_PRED_DEFAULT;
2227 if (!strchr(fields, *field->name))
2228 return WALK_PRED_DEFAULT;
2231 pred->fn = test_pred_visited_fn;
2233 return WALK_PRED_DEFAULT;
2236 static __init int ftrace_test_event_filter(void)
2240 printk(KERN_INFO "Testing ftrace filter: ");
2242 for (i = 0; i < DATA_CNT; i++) {
2243 struct event_filter *filter = NULL;
2244 struct test_filter_data_t *d = &test_filter_data[i];
2247 err = create_filter(&event_ftrace_test_filter, d->filter,
2251 "Failed to get filter for '%s', err %d\n",
2253 __free_filter(filter);
2258 * The preemption disabling is not really needed for self
2259 * tests, but the rcu dereference will complain without it.
2262 if (*d->not_visited)
2263 walk_pred_tree(filter->preds, filter->root,
2267 test_pred_visited = 0;
2268 err = filter_match_preds(filter, &d->rec);
2271 __free_filter(filter);
2273 if (test_pred_visited) {
2275 "Failed, unwanted pred visited for filter %s\n",
2280 if (err != d->match) {
2282 "Failed to match filter '%s', expected %d\n",
2283 d->filter, d->match);
2289 printk(KERN_CONT "OK\n");
2294 late_initcall(ftrace_test_event_filter);
2296 #endif /* CONFIG_FTRACE_STARTUP_TEST */