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 /* caller must hold event_mutex */
641 void print_event_filter(struct ftrace_event_call *call, struct trace_seq *s)
643 struct event_filter *filter = call->filter;
645 if (filter && filter->filter_string)
646 trace_seq_printf(s, "%s\n", filter->filter_string);
648 trace_seq_puts(s, "none\n");
651 void print_subsystem_event_filter(struct event_subsystem *system,
654 struct event_filter *filter;
656 mutex_lock(&event_mutex);
657 filter = system->filter;
658 if (filter && filter->filter_string)
659 trace_seq_printf(s, "%s\n", filter->filter_string);
661 trace_seq_puts(s, DEFAULT_SYS_FILTER_MESSAGE "\n");
662 mutex_unlock(&event_mutex);
665 static int __alloc_pred_stack(struct pred_stack *stack, int n_preds)
667 stack->preds = kcalloc(n_preds + 1, sizeof(*stack->preds), GFP_KERNEL);
670 stack->index = n_preds;
674 static void __free_pred_stack(struct pred_stack *stack)
680 static int __push_pred_stack(struct pred_stack *stack,
681 struct filter_pred *pred)
683 int index = stack->index;
685 if (WARN_ON(index == 0))
688 stack->preds[--index] = pred;
689 stack->index = index;
693 static struct filter_pred *
694 __pop_pred_stack(struct pred_stack *stack)
696 struct filter_pred *pred;
697 int index = stack->index;
699 pred = stack->preds[index++];
703 stack->index = index;
707 static int filter_set_pred(struct event_filter *filter,
709 struct pred_stack *stack,
710 struct filter_pred *src)
712 struct filter_pred *dest = &filter->preds[idx];
713 struct filter_pred *left;
714 struct filter_pred *right;
719 if (dest->op == OP_OR || dest->op == OP_AND) {
720 right = __pop_pred_stack(stack);
721 left = __pop_pred_stack(stack);
725 * If both children can be folded
726 * and they are the same op as this op or a leaf,
727 * then this op can be folded.
729 if (left->index & FILTER_PRED_FOLD &&
730 (left->op == dest->op ||
731 left->left == FILTER_PRED_INVALID) &&
732 right->index & FILTER_PRED_FOLD &&
733 (right->op == dest->op ||
734 right->left == FILTER_PRED_INVALID))
735 dest->index |= FILTER_PRED_FOLD;
737 dest->left = left->index & ~FILTER_PRED_FOLD;
738 dest->right = right->index & ~FILTER_PRED_FOLD;
739 left->parent = dest->index & ~FILTER_PRED_FOLD;
740 right->parent = dest->index | FILTER_PRED_IS_RIGHT;
743 * Make dest->left invalid to be used as a quick
744 * way to know this is a leaf node.
746 dest->left = FILTER_PRED_INVALID;
748 /* All leafs allow folding the parent ops. */
749 dest->index |= FILTER_PRED_FOLD;
752 return __push_pred_stack(stack, dest);
755 static void __free_preds(struct event_filter *filter)
760 for (i = 0; i < filter->n_preds; i++)
761 kfree(filter->preds[i].ops);
762 kfree(filter->preds);
763 filter->preds = NULL;
769 static void filter_disable(struct ftrace_event_call *call)
771 call->flags &= ~TRACE_EVENT_FL_FILTERED;
774 static void __free_filter(struct event_filter *filter)
779 __free_preds(filter);
780 kfree(filter->filter_string);
785 * Called when destroying the ftrace_event_call.
786 * The call is being freed, so we do not need to worry about
787 * the call being currently used. This is for module code removing
788 * the tracepoints from within it.
790 void destroy_preds(struct ftrace_event_call *call)
792 __free_filter(call->filter);
796 static struct event_filter *__alloc_filter(void)
798 struct event_filter *filter;
800 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
804 static int __alloc_preds(struct event_filter *filter, int n_preds)
806 struct filter_pred *pred;
810 __free_preds(filter);
812 filter->preds = kcalloc(n_preds, sizeof(*filter->preds), GFP_KERNEL);
817 filter->a_preds = n_preds;
820 for (i = 0; i < n_preds; i++) {
821 pred = &filter->preds[i];
822 pred->fn = filter_pred_none;
828 static void filter_free_subsystem_preds(struct event_subsystem *system)
830 struct ftrace_event_call *call;
832 list_for_each_entry(call, &ftrace_events, list) {
833 if (strcmp(call->class->system, system->name) != 0)
836 filter_disable(call);
837 remove_filter_string(call->filter);
841 static void filter_free_subsystem_filters(struct event_subsystem *system)
843 struct ftrace_event_call *call;
845 list_for_each_entry(call, &ftrace_events, list) {
846 if (strcmp(call->class->system, system->name) != 0)
848 __free_filter(call->filter);
853 static int filter_add_pred(struct filter_parse_state *ps,
854 struct event_filter *filter,
855 struct filter_pred *pred,
856 struct pred_stack *stack)
860 if (WARN_ON(filter->n_preds == filter->a_preds)) {
861 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
865 err = filter_set_pred(filter, filter->n_preds, stack, pred);
874 int filter_assign_type(const char *type)
876 if (strstr(type, "__data_loc") && strstr(type, "char"))
877 return FILTER_DYN_STRING;
879 if (strchr(type, '[') && strstr(type, "char"))
880 return FILTER_STATIC_STRING;
885 static bool is_function_field(struct ftrace_event_field *field)
887 return field->filter_type == FILTER_TRACE_FN;
890 static bool is_string_field(struct ftrace_event_field *field)
892 return field->filter_type == FILTER_DYN_STRING ||
893 field->filter_type == FILTER_STATIC_STRING ||
894 field->filter_type == FILTER_PTR_STRING;
897 static int is_legal_op(struct ftrace_event_field *field, int op)
899 if (is_string_field(field) &&
900 (op != OP_EQ && op != OP_NE && op != OP_GLOB))
902 if (!is_string_field(field) && op == OP_GLOB)
908 static filter_pred_fn_t select_comparison_fn(int op, int field_size,
911 filter_pred_fn_t fn = NULL;
913 switch (field_size) {
915 if (op == OP_EQ || op == OP_NE)
917 else if (field_is_signed)
918 fn = filter_pred_s64;
920 fn = filter_pred_u64;
923 if (op == OP_EQ || op == OP_NE)
925 else if (field_is_signed)
926 fn = filter_pred_s32;
928 fn = filter_pred_u32;
931 if (op == OP_EQ || op == OP_NE)
933 else if (field_is_signed)
934 fn = filter_pred_s16;
936 fn = filter_pred_u16;
939 if (op == OP_EQ || op == OP_NE)
941 else if (field_is_signed)
951 static int init_pred(struct filter_parse_state *ps,
952 struct ftrace_event_field *field,
953 struct filter_pred *pred)
956 filter_pred_fn_t fn = filter_pred_none;
957 unsigned long long val;
960 pred->offset = field->offset;
962 if (!is_legal_op(field, pred->op)) {
963 parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
967 if (is_string_field(field)) {
968 filter_build_regex(pred);
970 if (field->filter_type == FILTER_STATIC_STRING) {
971 fn = filter_pred_string;
972 pred->regex.field_len = field->size;
973 } else if (field->filter_type == FILTER_DYN_STRING)
974 fn = filter_pred_strloc;
976 fn = filter_pred_pchar;
977 } else if (is_function_field(field)) {
978 if (strcmp(field->name, "ip")) {
979 parse_error(ps, FILT_ERR_IP_FIELD_ONLY, 0);
983 if (field->is_signed)
984 ret = kstrtoll(pred->regex.pattern, 0, &val);
986 ret = kstrtoull(pred->regex.pattern, 0, &val);
988 parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
993 fn = select_comparison_fn(pred->op, field->size,
996 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1001 if (pred->op == OP_NE)
1008 static void parse_init(struct filter_parse_state *ps,
1009 struct filter_op *ops,
1012 memset(ps, '\0', sizeof(*ps));
1014 ps->infix.string = infix_string;
1015 ps->infix.cnt = strlen(infix_string);
1018 INIT_LIST_HEAD(&ps->opstack);
1019 INIT_LIST_HEAD(&ps->postfix);
1022 static char infix_next(struct filter_parse_state *ps)
1026 return ps->infix.string[ps->infix.tail++];
1029 static char infix_peek(struct filter_parse_state *ps)
1031 if (ps->infix.tail == strlen(ps->infix.string))
1034 return ps->infix.string[ps->infix.tail];
1037 static void infix_advance(struct filter_parse_state *ps)
1043 static inline int is_precedence_lower(struct filter_parse_state *ps,
1046 return ps->ops[a].precedence < ps->ops[b].precedence;
1049 static inline int is_op_char(struct filter_parse_state *ps, char c)
1053 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1054 if (ps->ops[i].string[0] == c)
1061 static int infix_get_op(struct filter_parse_state *ps, char firstc)
1063 char nextc = infix_peek(ps);
1071 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1072 if (!strcmp(opstr, ps->ops[i].string)) {
1074 return ps->ops[i].id;
1080 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1081 if (!strcmp(opstr, ps->ops[i].string))
1082 return ps->ops[i].id;
1088 static inline void clear_operand_string(struct filter_parse_state *ps)
1090 memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
1091 ps->operand.tail = 0;
1094 static inline int append_operand_char(struct filter_parse_state *ps, char c)
1096 if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
1099 ps->operand.string[ps->operand.tail++] = c;
1104 static int filter_opstack_push(struct filter_parse_state *ps, int op)
1106 struct opstack_op *opstack_op;
1108 opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
1112 opstack_op->op = op;
1113 list_add(&opstack_op->list, &ps->opstack);
1118 static int filter_opstack_empty(struct filter_parse_state *ps)
1120 return list_empty(&ps->opstack);
1123 static int filter_opstack_top(struct filter_parse_state *ps)
1125 struct opstack_op *opstack_op;
1127 if (filter_opstack_empty(ps))
1130 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1132 return opstack_op->op;
1135 static int filter_opstack_pop(struct filter_parse_state *ps)
1137 struct opstack_op *opstack_op;
1140 if (filter_opstack_empty(ps))
1143 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1144 op = opstack_op->op;
1145 list_del(&opstack_op->list);
1152 static void filter_opstack_clear(struct filter_parse_state *ps)
1154 while (!filter_opstack_empty(ps))
1155 filter_opstack_pop(ps);
1158 static char *curr_operand(struct filter_parse_state *ps)
1160 return ps->operand.string;
1163 static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
1165 struct postfix_elt *elt;
1167 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1172 elt->operand = kstrdup(operand, GFP_KERNEL);
1173 if (!elt->operand) {
1178 list_add_tail(&elt->list, &ps->postfix);
1183 static int postfix_append_op(struct filter_parse_state *ps, int op)
1185 struct postfix_elt *elt;
1187 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1192 elt->operand = NULL;
1194 list_add_tail(&elt->list, &ps->postfix);
1199 static void postfix_clear(struct filter_parse_state *ps)
1201 struct postfix_elt *elt;
1203 while (!list_empty(&ps->postfix)) {
1204 elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
1205 list_del(&elt->list);
1206 kfree(elt->operand);
1211 static int filter_parse(struct filter_parse_state *ps)
1217 while ((ch = infix_next(ps))) {
1229 if (is_op_char(ps, ch)) {
1230 op = infix_get_op(ps, ch);
1231 if (op == OP_NONE) {
1232 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1236 if (strlen(curr_operand(ps))) {
1237 postfix_append_operand(ps, curr_operand(ps));
1238 clear_operand_string(ps);
1241 while (!filter_opstack_empty(ps)) {
1242 top_op = filter_opstack_top(ps);
1243 if (!is_precedence_lower(ps, top_op, op)) {
1244 top_op = filter_opstack_pop(ps);
1245 postfix_append_op(ps, top_op);
1251 filter_opstack_push(ps, op);
1256 filter_opstack_push(ps, OP_OPEN_PAREN);
1261 if (strlen(curr_operand(ps))) {
1262 postfix_append_operand(ps, curr_operand(ps));
1263 clear_operand_string(ps);
1266 top_op = filter_opstack_pop(ps);
1267 while (top_op != OP_NONE) {
1268 if (top_op == OP_OPEN_PAREN)
1270 postfix_append_op(ps, top_op);
1271 top_op = filter_opstack_pop(ps);
1273 if (top_op == OP_NONE) {
1274 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1280 if (append_operand_char(ps, ch)) {
1281 parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
1286 if (strlen(curr_operand(ps)))
1287 postfix_append_operand(ps, curr_operand(ps));
1289 while (!filter_opstack_empty(ps)) {
1290 top_op = filter_opstack_pop(ps);
1291 if (top_op == OP_NONE)
1293 if (top_op == OP_OPEN_PAREN) {
1294 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1297 postfix_append_op(ps, top_op);
1303 static struct filter_pred *create_pred(struct filter_parse_state *ps,
1304 struct ftrace_event_call *call,
1305 int op, char *operand1, char *operand2)
1307 struct ftrace_event_field *field;
1308 static struct filter_pred pred;
1310 memset(&pred, 0, sizeof(pred));
1313 if (op == OP_AND || op == OP_OR)
1316 if (!operand1 || !operand2) {
1317 parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
1321 field = trace_find_event_field(call, operand1);
1323 parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
1327 strcpy(pred.regex.pattern, operand2);
1328 pred.regex.len = strlen(pred.regex.pattern);
1330 return init_pred(ps, field, &pred) ? NULL : &pred;
1333 static int check_preds(struct filter_parse_state *ps)
1335 int n_normal_preds = 0, n_logical_preds = 0;
1336 struct postfix_elt *elt;
1338 list_for_each_entry(elt, &ps->postfix, list) {
1339 if (elt->op == OP_NONE)
1342 if (elt->op == OP_AND || elt->op == OP_OR) {
1349 if (!n_normal_preds || n_logical_preds >= n_normal_preds) {
1350 parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
1357 static int count_preds(struct filter_parse_state *ps)
1359 struct postfix_elt *elt;
1362 list_for_each_entry(elt, &ps->postfix, list) {
1363 if (elt->op == OP_NONE)
1371 struct check_pred_data {
1376 static int check_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1377 int *err, void *data)
1379 struct check_pred_data *d = data;
1381 if (WARN_ON(d->count++ > d->max)) {
1383 return WALK_PRED_ABORT;
1385 return WALK_PRED_DEFAULT;
1389 * The tree is walked at filtering of an event. If the tree is not correctly
1390 * built, it may cause an infinite loop. Check here that the tree does
1393 static int check_pred_tree(struct event_filter *filter,
1394 struct filter_pred *root)
1396 struct check_pred_data data = {
1398 * The max that we can hit a node is three times.
1399 * Once going down, once coming up from left, and
1400 * once coming up from right. This is more than enough
1401 * since leafs are only hit a single time.
1403 .max = 3 * filter->n_preds,
1407 return walk_pred_tree(filter->preds, root,
1408 check_pred_tree_cb, &data);
1411 static int count_leafs_cb(enum move_type move, struct filter_pred *pred,
1412 int *err, void *data)
1416 if ((move == MOVE_DOWN) &&
1417 (pred->left == FILTER_PRED_INVALID))
1420 return WALK_PRED_DEFAULT;
1423 static int count_leafs(struct filter_pred *preds, struct filter_pred *root)
1427 ret = walk_pred_tree(preds, root, count_leafs_cb, &count);
1432 struct fold_pred_data {
1433 struct filter_pred *root;
1438 static int fold_pred_cb(enum move_type move, struct filter_pred *pred,
1439 int *err, void *data)
1441 struct fold_pred_data *d = data;
1442 struct filter_pred *root = d->root;
1444 if (move != MOVE_DOWN)
1445 return WALK_PRED_DEFAULT;
1446 if (pred->left != FILTER_PRED_INVALID)
1447 return WALK_PRED_DEFAULT;
1449 if (WARN_ON(d->count == d->children)) {
1451 return WALK_PRED_ABORT;
1454 pred->index &= ~FILTER_PRED_FOLD;
1455 root->ops[d->count++] = pred->index;
1456 return WALK_PRED_DEFAULT;
1459 static int fold_pred(struct filter_pred *preds, struct filter_pred *root)
1461 struct fold_pred_data data = {
1467 /* No need to keep the fold flag */
1468 root->index &= ~FILTER_PRED_FOLD;
1470 /* If the root is a leaf then do nothing */
1471 if (root->left == FILTER_PRED_INVALID)
1474 /* count the children */
1475 children = count_leafs(preds, &preds[root->left]);
1476 children += count_leafs(preds, &preds[root->right]);
1478 root->ops = kcalloc(children, sizeof(*root->ops), GFP_KERNEL);
1482 root->val = children;
1483 data.children = children;
1484 return walk_pred_tree(preds, root, fold_pred_cb, &data);
1487 static int fold_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1488 int *err, void *data)
1490 struct filter_pred *preds = data;
1492 if (move != MOVE_DOWN)
1493 return WALK_PRED_DEFAULT;
1494 if (!(pred->index & FILTER_PRED_FOLD))
1495 return WALK_PRED_DEFAULT;
1497 *err = fold_pred(preds, pred);
1499 return WALK_PRED_ABORT;
1501 /* eveyrhing below is folded, continue with parent */
1502 return WALK_PRED_PARENT;
1506 * To optimize the processing of the ops, if we have several "ors" or
1507 * "ands" together, we can put them in an array and process them all
1508 * together speeding up the filter logic.
1510 static int fold_pred_tree(struct event_filter *filter,
1511 struct filter_pred *root)
1513 return walk_pred_tree(filter->preds, root, fold_pred_tree_cb,
1517 static int replace_preds(struct ftrace_event_call *call,
1518 struct event_filter *filter,
1519 struct filter_parse_state *ps,
1520 char *filter_string,
1523 char *operand1 = NULL, *operand2 = NULL;
1524 struct filter_pred *pred;
1525 struct filter_pred *root;
1526 struct postfix_elt *elt;
1527 struct pred_stack stack = { }; /* init to NULL */
1531 n_preds = count_preds(ps);
1532 if (n_preds >= MAX_FILTER_PRED) {
1533 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1537 err = check_preds(ps);
1542 err = __alloc_pred_stack(&stack, n_preds);
1545 err = __alloc_preds(filter, n_preds);
1551 list_for_each_entry(elt, &ps->postfix, list) {
1552 if (elt->op == OP_NONE) {
1554 operand1 = elt->operand;
1556 operand2 = elt->operand;
1558 parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
1565 if (WARN_ON(n_preds++ == MAX_FILTER_PRED)) {
1566 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1571 pred = create_pred(ps, call, elt->op, operand1, operand2);
1578 err = filter_add_pred(ps, filter, pred, &stack);
1583 operand1 = operand2 = NULL;
1587 /* We should have one item left on the stack */
1588 pred = __pop_pred_stack(&stack);
1591 /* This item is where we start from in matching */
1593 /* Make sure the stack is empty */
1594 pred = __pop_pred_stack(&stack);
1595 if (WARN_ON(pred)) {
1597 filter->root = NULL;
1600 err = check_pred_tree(filter, root);
1604 /* Optimize the tree */
1605 err = fold_pred_tree(filter, root);
1609 /* We don't set root until we know it works */
1611 filter->root = root;
1616 __free_pred_stack(&stack);
1620 struct filter_list {
1621 struct list_head list;
1622 struct event_filter *filter;
1625 static int replace_system_preds(struct event_subsystem *system,
1626 struct filter_parse_state *ps,
1627 char *filter_string)
1629 struct ftrace_event_call *call;
1630 struct filter_list *filter_item;
1631 struct filter_list *tmp;
1632 LIST_HEAD(filter_list);
1636 list_for_each_entry(call, &ftrace_events, list) {
1638 if (strcmp(call->class->system, system->name) != 0)
1642 * Try to see if the filter can be applied
1643 * (filter arg is ignored on dry_run)
1645 err = replace_preds(call, NULL, ps, filter_string, true);
1647 call->flags |= TRACE_EVENT_FL_NO_SET_FILTER;
1649 call->flags &= ~TRACE_EVENT_FL_NO_SET_FILTER;
1652 list_for_each_entry(call, &ftrace_events, list) {
1653 struct event_filter *filter;
1655 if (strcmp(call->class->system, system->name) != 0)
1658 if (call->flags & TRACE_EVENT_FL_NO_SET_FILTER)
1661 filter_item = kzalloc(sizeof(*filter_item), GFP_KERNEL);
1665 list_add_tail(&filter_item->list, &filter_list);
1667 filter_item->filter = __alloc_filter();
1668 if (!filter_item->filter)
1670 filter = filter_item->filter;
1672 /* Can only fail on no memory */
1673 err = replace_filter_string(filter, filter_string);
1677 err = replace_preds(call, filter, ps, filter_string, false);
1679 filter_disable(call);
1680 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1681 append_filter_err(ps, filter);
1683 call->flags |= TRACE_EVENT_FL_FILTERED;
1685 * Regardless of if this returned an error, we still
1686 * replace the filter for the call.
1688 filter = call->filter;
1689 rcu_assign_pointer(call->filter, filter_item->filter);
1690 filter_item->filter = filter;
1699 * The calls can still be using the old filters.
1700 * Do a synchronize_sched() to ensure all calls are
1701 * done with them before we free them.
1703 synchronize_sched();
1704 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1705 __free_filter(filter_item->filter);
1706 list_del(&filter_item->list);
1711 /* No call succeeded */
1712 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1713 list_del(&filter_item->list);
1716 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1719 /* If any call succeeded, we still need to sync */
1721 synchronize_sched();
1722 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1723 __free_filter(filter_item->filter);
1724 list_del(&filter_item->list);
1730 static int create_filter_start(char *filter_str, bool set_str,
1731 struct filter_parse_state **psp,
1732 struct event_filter **filterp)
1734 struct event_filter *filter;
1735 struct filter_parse_state *ps = NULL;
1738 WARN_ON_ONCE(*psp || *filterp);
1740 /* allocate everything, and if any fails, free all and fail */
1741 filter = __alloc_filter();
1742 if (filter && set_str)
1743 err = replace_filter_string(filter, filter_str);
1745 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1747 if (!filter || !ps || err) {
1749 __free_filter(filter);
1753 /* we're committed to creating a new filter */
1757 parse_init(ps, filter_ops, filter_str);
1758 err = filter_parse(ps);
1760 append_filter_err(ps, filter);
1764 static void create_filter_finish(struct filter_parse_state *ps)
1767 filter_opstack_clear(ps);
1774 * create_filter - create a filter for a ftrace_event_call
1775 * @call: ftrace_event_call to create a filter for
1776 * @filter_str: filter string
1777 * @set_str: remember @filter_str and enable detailed error in filter
1778 * @filterp: out param for created filter (always updated on return)
1780 * Creates a filter for @call with @filter_str. If @set_str is %true,
1781 * @filter_str is copied and recorded in the new filter.
1783 * On success, returns 0 and *@filterp points to the new filter. On
1784 * failure, returns -errno and *@filterp may point to %NULL or to a new
1785 * filter. In the latter case, the returned filter contains error
1786 * information if @set_str is %true and the caller is responsible for
1789 static int create_filter(struct ftrace_event_call *call,
1790 char *filter_str, bool set_str,
1791 struct event_filter **filterp)
1793 struct event_filter *filter = NULL;
1794 struct filter_parse_state *ps = NULL;
1797 err = create_filter_start(filter_str, set_str, &ps, &filter);
1799 err = replace_preds(call, filter, ps, filter_str, false);
1801 append_filter_err(ps, filter);
1803 create_filter_finish(ps);
1810 * create_system_filter - create a filter for an event_subsystem
1811 * @system: event_subsystem to create a filter for
1812 * @filter_str: filter string
1813 * @filterp: out param for created filter (always updated on return)
1815 * Identical to create_filter() except that it creates a subsystem filter
1816 * and always remembers @filter_str.
1818 static int create_system_filter(struct event_subsystem *system,
1819 char *filter_str, struct event_filter **filterp)
1821 struct event_filter *filter = NULL;
1822 struct filter_parse_state *ps = NULL;
1825 err = create_filter_start(filter_str, true, &ps, &filter);
1827 err = replace_system_preds(system, ps, filter_str);
1829 /* System filters just show a default message */
1830 kfree(filter->filter_string);
1831 filter->filter_string = NULL;
1833 append_filter_err(ps, filter);
1836 create_filter_finish(ps);
1842 /* caller must hold event_mutex */
1843 int apply_event_filter(struct ftrace_event_call *call, char *filter_string)
1845 struct event_filter *filter;
1848 if (!strcmp(strstrip(filter_string), "0")) {
1849 filter_disable(call);
1850 filter = call->filter;
1853 RCU_INIT_POINTER(call->filter, NULL);
1854 /* Make sure the filter is not being used */
1855 synchronize_sched();
1856 __free_filter(filter);
1860 err = create_filter(call, filter_string, true, &filter);
1863 * Always swap the call filter with the new filter
1864 * even if there was an error. If there was an error
1865 * in the filter, we disable the filter and show the error
1869 struct event_filter *tmp = call->filter;
1872 call->flags |= TRACE_EVENT_FL_FILTERED;
1874 filter_disable(call);
1876 rcu_assign_pointer(call->filter, filter);
1879 /* Make sure the call is done with the filter */
1880 synchronize_sched();
1888 int apply_subsystem_event_filter(struct ftrace_subsystem_dir *dir,
1889 char *filter_string)
1891 struct event_subsystem *system = dir->subsystem;
1892 struct event_filter *filter;
1895 mutex_lock(&event_mutex);
1897 /* Make sure the system still has events */
1898 if (!dir->nr_events) {
1903 if (!strcmp(strstrip(filter_string), "0")) {
1904 filter_free_subsystem_preds(system);
1905 remove_filter_string(system->filter);
1906 filter = system->filter;
1907 system->filter = NULL;
1908 /* Ensure all filters are no longer used */
1909 synchronize_sched();
1910 filter_free_subsystem_filters(system);
1911 __free_filter(filter);
1915 err = create_system_filter(system, filter_string, &filter);
1918 * No event actually uses the system filter
1919 * we can free it without synchronize_sched().
1921 __free_filter(system->filter);
1922 system->filter = filter;
1925 mutex_unlock(&event_mutex);
1930 #ifdef CONFIG_PERF_EVENTS
1932 void ftrace_profile_free_filter(struct perf_event *event)
1934 struct event_filter *filter = event->filter;
1936 event->filter = NULL;
1937 __free_filter(filter);
1940 struct function_filter_data {
1941 struct ftrace_ops *ops;
1946 #ifdef CONFIG_FUNCTION_TRACER
1948 ftrace_function_filter_re(char *buf, int len, int *count)
1950 char *str, *sep, **re;
1952 str = kstrndup(buf, len, GFP_KERNEL);
1957 * The argv_split function takes white space
1958 * as a separator, so convert ',' into spaces.
1960 while ((sep = strchr(str, ',')))
1963 re = argv_split(GFP_KERNEL, str, count);
1968 static int ftrace_function_set_regexp(struct ftrace_ops *ops, int filter,
1969 int reset, char *re, int len)
1974 ret = ftrace_set_filter(ops, re, len, reset);
1976 ret = ftrace_set_notrace(ops, re, len, reset);
1981 static int __ftrace_function_set_filter(int filter, char *buf, int len,
1982 struct function_filter_data *data)
1984 int i, re_cnt, ret = -EINVAL;
1988 reset = filter ? &data->first_filter : &data->first_notrace;
1991 * The 'ip' field could have multiple filters set, separated
1992 * either by space or comma. We first cut the filter and apply
1993 * all pieces separatelly.
1995 re = ftrace_function_filter_re(buf, len, &re_cnt);
1999 for (i = 0; i < re_cnt; i++) {
2000 ret = ftrace_function_set_regexp(data->ops, filter, *reset,
2001 re[i], strlen(re[i]));
2013 static int ftrace_function_check_pred(struct filter_pred *pred, int leaf)
2015 struct ftrace_event_field *field = pred->field;
2019 * Check the leaf predicate for function trace, verify:
2020 * - only '==' and '!=' is used
2021 * - the 'ip' field is used
2023 if ((pred->op != OP_EQ) && (pred->op != OP_NE))
2026 if (strcmp(field->name, "ip"))
2030 * Check the non leaf predicate for function trace, verify:
2031 * - only '||' is used
2033 if (pred->op != OP_OR)
2040 static int ftrace_function_set_filter_cb(enum move_type move,
2041 struct filter_pred *pred,
2042 int *err, void *data)
2044 /* Checking the node is valid for function trace. */
2045 if ((move != MOVE_DOWN) ||
2046 (pred->left != FILTER_PRED_INVALID)) {
2047 *err = ftrace_function_check_pred(pred, 0);
2049 *err = ftrace_function_check_pred(pred, 1);
2051 return WALK_PRED_ABORT;
2053 *err = __ftrace_function_set_filter(pred->op == OP_EQ,
2054 pred->regex.pattern,
2059 return (*err) ? WALK_PRED_ABORT : WALK_PRED_DEFAULT;
2062 static int ftrace_function_set_filter(struct perf_event *event,
2063 struct event_filter *filter)
2065 struct function_filter_data data = {
2068 .ops = &event->ftrace_ops,
2071 return walk_pred_tree(filter->preds, filter->root,
2072 ftrace_function_set_filter_cb, &data);
2075 static int ftrace_function_set_filter(struct perf_event *event,
2076 struct event_filter *filter)
2080 #endif /* CONFIG_FUNCTION_TRACER */
2082 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
2086 struct event_filter *filter;
2087 struct ftrace_event_call *call;
2089 mutex_lock(&event_mutex);
2091 call = event->tp_event;
2101 err = create_filter(call, filter_str, false, &filter);
2105 if (ftrace_event_is_function(call))
2106 err = ftrace_function_set_filter(event, filter);
2108 event->filter = filter;
2111 if (err || ftrace_event_is_function(call))
2112 __free_filter(filter);
2115 mutex_unlock(&event_mutex);
2120 #endif /* CONFIG_PERF_EVENTS */
2122 #ifdef CONFIG_FTRACE_STARTUP_TEST
2124 #include <linux/types.h>
2125 #include <linux/tracepoint.h>
2127 #define CREATE_TRACE_POINTS
2128 #include "trace_events_filter_test.h"
2130 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2133 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2134 .e = ve, .f = vf, .g = vg, .h = vh }, \
2136 .not_visited = nvisit, \
2141 static struct test_filter_data_t {
2143 struct ftrace_raw_ftrace_test_filter rec;
2146 } test_filter_data[] = {
2147 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2148 "e == 1 && f == 1 && g == 1 && h == 1"
2149 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2150 DATA_REC(NO, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2151 DATA_REC(NO, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2153 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2154 "e == 1 || f == 1 || g == 1 || h == 1"
2155 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2156 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2157 DATA_REC(YES, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
2159 #define FILTER "(a == 1 || b == 1) && (c == 1 || d == 1) && " \
2160 "(e == 1 || f == 1) && (g == 1 || h == 1)"
2161 DATA_REC(NO, 0, 0, 1, 1, 1, 1, 1, 1, "dfh"),
2162 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2163 DATA_REC(YES, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2164 DATA_REC(NO, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2166 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2167 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2168 DATA_REC(YES, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2169 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2170 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2172 #define FILTER "(a == 1 && b == 1) && (c == 1 && d == 1) && " \
2173 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2174 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 0, "gh"),
2175 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2176 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, ""),
2178 #define FILTER "((a == 1 || b == 1) || (c == 1 || d == 1) || " \
2179 "(e == 1 || f == 1)) && (g == 1 || h == 1)"
2180 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 1, "bcdef"),
2181 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2182 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
2184 #define FILTER "((((((((a == 1) && (b == 1)) || (c == 1)) && (d == 1)) || " \
2185 "(e == 1)) && (f == 1)) || (g == 1)) && (h == 1))"
2186 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "ceg"),
2187 DATA_REC(NO, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2188 DATA_REC(NO, 1, 0, 1, 0, 1, 0, 1, 0, ""),
2190 #define FILTER "((((((((a == 1) || (b == 1)) && (c == 1)) || (d == 1)) && " \
2191 "(e == 1)) || (f == 1)) && (g == 1)) || (h == 1))"
2192 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "bdfh"),
2193 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2194 DATA_REC(YES, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2202 #define DATA_CNT (sizeof(test_filter_data)/sizeof(struct test_filter_data_t))
2204 static int test_pred_visited;
2206 static int test_pred_visited_fn(struct filter_pred *pred, void *event)
2208 struct ftrace_event_field *field = pred->field;
2210 test_pred_visited = 1;
2211 printk(KERN_INFO "\npred visited %s\n", field->name);
2215 static int test_walk_pred_cb(enum move_type move, struct filter_pred *pred,
2216 int *err, void *data)
2218 char *fields = data;
2220 if ((move == MOVE_DOWN) &&
2221 (pred->left == FILTER_PRED_INVALID)) {
2222 struct ftrace_event_field *field = pred->field;
2225 WARN(1, "all leafs should have field defined");
2226 return WALK_PRED_DEFAULT;
2228 if (!strchr(fields, *field->name))
2229 return WALK_PRED_DEFAULT;
2232 pred->fn = test_pred_visited_fn;
2234 return WALK_PRED_DEFAULT;
2237 static __init int ftrace_test_event_filter(void)
2241 printk(KERN_INFO "Testing ftrace filter: ");
2243 for (i = 0; i < DATA_CNT; i++) {
2244 struct event_filter *filter = NULL;
2245 struct test_filter_data_t *d = &test_filter_data[i];
2248 err = create_filter(&event_ftrace_test_filter, d->filter,
2252 "Failed to get filter for '%s', err %d\n",
2254 __free_filter(filter);
2259 * The preemption disabling is not really needed for self
2260 * tests, but the rcu dereference will complain without it.
2263 if (*d->not_visited)
2264 walk_pred_tree(filter->preds, filter->root,
2268 test_pred_visited = 0;
2269 err = filter_match_preds(filter, &d->rec);
2272 __free_filter(filter);
2274 if (test_pred_visited) {
2276 "Failed, unwanted pred visited for filter %s\n",
2281 if (err != d->match) {
2283 "Failed to match filter '%s', expected %d\n",
2284 d->filter, d->match);
2290 printk(KERN_CONT "OK\n");
2295 late_initcall(ftrace_test_event_filter);
2297 #endif /* CONFIG_FTRACE_STARTUP_TEST */