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"
59 /* Order must be the same as enum filter_op_ids above */
60 static struct filter_op filter_ops[] = {
72 { OP_NONE, "OP_NONE", 0 },
73 { OP_OPEN_PAREN, "(", 0 },
79 FILT_ERR_UNBALANCED_PAREN,
80 FILT_ERR_TOO_MANY_OPERANDS,
81 FILT_ERR_OPERAND_TOO_LONG,
82 FILT_ERR_FIELD_NOT_FOUND,
83 FILT_ERR_ILLEGAL_FIELD_OP,
84 FILT_ERR_ILLEGAL_INTVAL,
85 FILT_ERR_BAD_SUBSYS_FILTER,
86 FILT_ERR_TOO_MANY_PREDS,
87 FILT_ERR_MISSING_FIELD,
88 FILT_ERR_INVALID_FILTER,
89 FILT_ERR_IP_FIELD_ONLY,
90 FILT_ERR_ILLEGAL_NOT_OP,
93 static char *err_text[] = {
100 "Illegal operation for field type",
101 "Illegal integer value",
102 "Couldn't find or set field in one of a subsystem's events",
103 "Too many terms in predicate expression",
104 "Missing field name and/or value",
105 "Meaningless filter expression",
106 "Only 'ip' field is supported for function trace",
107 "Illegal use of '!'",
112 struct list_head list;
118 struct list_head list;
121 struct filter_parse_state {
122 struct filter_op *ops;
123 struct list_head opstack;
124 struct list_head postfix;
135 char string[MAX_FILTER_STR_VAL];
142 struct filter_pred **preds;
146 /* If not of not match is equal to not of not, then it is a match */
147 #define DEFINE_COMPARISON_PRED(type) \
148 static int filter_pred_##type(struct filter_pred *pred, void *event) \
150 type *addr = (type *)(event + pred->offset); \
151 type val = (type)pred->val; \
154 switch (pred->op) { \
156 match = (*addr < val); \
159 match = (*addr <= val); \
162 match = (*addr > val); \
165 match = (*addr >= val); \
168 match = (*addr & val); \
174 return !!match == !pred->not; \
177 #define DEFINE_EQUALITY_PRED(size) \
178 static int filter_pred_##size(struct filter_pred *pred, void *event) \
180 u##size *addr = (u##size *)(event + pred->offset); \
181 u##size val = (u##size)pred->val; \
184 match = (val == *addr) ^ pred->not; \
189 DEFINE_COMPARISON_PRED(s64);
190 DEFINE_COMPARISON_PRED(u64);
191 DEFINE_COMPARISON_PRED(s32);
192 DEFINE_COMPARISON_PRED(u32);
193 DEFINE_COMPARISON_PRED(s16);
194 DEFINE_COMPARISON_PRED(u16);
195 DEFINE_COMPARISON_PRED(s8);
196 DEFINE_COMPARISON_PRED(u8);
198 DEFINE_EQUALITY_PRED(64);
199 DEFINE_EQUALITY_PRED(32);
200 DEFINE_EQUALITY_PRED(16);
201 DEFINE_EQUALITY_PRED(8);
203 /* Filter predicate for fixed sized arrays of characters */
204 static int filter_pred_string(struct filter_pred *pred, void *event)
206 char *addr = (char *)(event + pred->offset);
209 cmp = pred->regex.match(addr, &pred->regex, pred->regex.field_len);
211 match = cmp ^ pred->not;
216 /* Filter predicate for char * pointers */
217 static int filter_pred_pchar(struct filter_pred *pred, void *event)
219 char **addr = (char **)(event + pred->offset);
221 int len = strlen(*addr) + 1; /* including tailing '\0' */
223 cmp = pred->regex.match(*addr, &pred->regex, len);
225 match = cmp ^ pred->not;
231 * Filter predicate for dynamic sized arrays of characters.
232 * These are implemented through a list of strings at the end
234 * Also each of these strings have a field in the entry which
235 * contains its offset from the beginning of the entry.
236 * We have then first to get this field, dereference it
237 * and add it to the address of the entry, and at last we have
238 * the address of the string.
240 static int filter_pred_strloc(struct filter_pred *pred, void *event)
242 u32 str_item = *(u32 *)(event + pred->offset);
243 int str_loc = str_item & 0xffff;
244 int str_len = str_item >> 16;
245 char *addr = (char *)(event + str_loc);
248 cmp = pred->regex.match(addr, &pred->regex, str_len);
250 match = cmp ^ pred->not;
255 /* Filter predicate for CPUs. */
256 static int filter_pred_cpu(struct filter_pred *pred, void *event)
261 cpu = raw_smp_processor_id();
284 return !!match == !pred->not;
287 /* Filter predicate for COMM. */
288 static int filter_pred_comm(struct filter_pred *pred, void *event)
292 cmp = pred->regex.match(current->comm, &pred->regex,
293 pred->regex.field_len);
294 match = cmp ^ pred->not;
299 static int filter_pred_none(struct filter_pred *pred, void *event)
305 * regex_match_foo - Basic regex callbacks
307 * @str: the string to be searched
308 * @r: the regex structure containing the pattern string
309 * @len: the length of the string to be searched (including '\0')
312 * - @str might not be NULL-terminated if it's of type DYN_STRING
316 static int regex_match_full(char *str, struct regex *r, int len)
318 if (strncmp(str, r->pattern, len) == 0)
323 static int regex_match_front(char *str, struct regex *r, int len)
328 if (strncmp(str, r->pattern, r->len) == 0)
333 static int regex_match_middle(char *str, struct regex *r, int len)
335 if (strnstr(str, r->pattern, len))
340 static int regex_match_end(char *str, struct regex *r, int len)
342 int strlen = len - 1;
344 if (strlen >= r->len &&
345 memcmp(str + strlen - r->len, r->pattern, r->len) == 0)
351 * filter_parse_regex - parse a basic regex
352 * @buff: the raw regex
353 * @len: length of the regex
354 * @search: will point to the beginning of the string to compare
355 * @not: tell whether the match will have to be inverted
357 * This passes in a buffer containing a regex and this function will
358 * set search to point to the search part of the buffer and
359 * return the type of search it is (see enum above).
360 * This does modify buff.
363 * search returns the pointer to use for comparison.
364 * not returns 1 if buff started with a '!'
367 enum regex_type filter_parse_regex(char *buff, int len, char **search, int *not)
369 int type = MATCH_FULL;
372 if (buff[0] == '!') {
381 for (i = 0; i < len; i++) {
382 if (buff[i] == '*') {
385 type = MATCH_END_ONLY;
387 if (type == MATCH_END_ONLY)
388 type = MATCH_MIDDLE_ONLY;
390 type = MATCH_FRONT_ONLY;
400 static void filter_build_regex(struct filter_pred *pred)
402 struct regex *r = &pred->regex;
404 enum regex_type type = MATCH_FULL;
407 if (pred->op == OP_GLOB) {
408 type = filter_parse_regex(r->pattern, r->len, &search, ¬);
409 r->len = strlen(search);
410 memmove(r->pattern, search, r->len+1);
415 r->match = regex_match_full;
417 case MATCH_FRONT_ONLY:
418 r->match = regex_match_front;
420 case MATCH_MIDDLE_ONLY:
421 r->match = regex_match_middle;
424 r->match = regex_match_end;
437 static struct filter_pred *
438 get_pred_parent(struct filter_pred *pred, struct filter_pred *preds,
439 int index, enum move_type *move)
441 if (pred->parent & FILTER_PRED_IS_RIGHT)
442 *move = MOVE_UP_FROM_RIGHT;
444 *move = MOVE_UP_FROM_LEFT;
445 pred = &preds[pred->parent & ~FILTER_PRED_IS_RIGHT];
456 typedef int (*filter_pred_walkcb_t) (enum move_type move,
457 struct filter_pred *pred,
458 int *err, void *data);
460 static int walk_pred_tree(struct filter_pred *preds,
461 struct filter_pred *root,
462 filter_pred_walkcb_t cb, void *data)
464 struct filter_pred *pred = root;
465 enum move_type move = MOVE_DOWN;
474 ret = cb(move, pred, &err, data);
475 if (ret == WALK_PRED_ABORT)
477 if (ret == WALK_PRED_PARENT)
482 if (pred->left != FILTER_PRED_INVALID) {
483 pred = &preds[pred->left];
487 case MOVE_UP_FROM_LEFT:
488 pred = &preds[pred->right];
491 case MOVE_UP_FROM_RIGHT:
495 pred = get_pred_parent(pred, preds,
508 * A series of AND or ORs where found together. Instead of
509 * climbing up and down the tree branches, an array of the
510 * ops were made in order of checks. We can just move across
511 * the array and short circuit if needed.
513 static int process_ops(struct filter_pred *preds,
514 struct filter_pred *op, void *rec)
516 struct filter_pred *pred;
522 * Micro-optimization: We set type to true if op
523 * is an OR and false otherwise (AND). Then we
524 * just need to test if the match is equal to
525 * the type, and if it is, we can short circuit the
526 * rest of the checks:
528 * if ((match && op->op == OP_OR) ||
529 * (!match && op->op == OP_AND))
532 type = op->op == OP_OR;
534 for (i = 0; i < op->val; i++) {
535 pred = &preds[op->ops[i]];
536 if (!WARN_ON_ONCE(!pred->fn))
537 match = pred->fn(pred, rec);
541 /* If not of not match is equal to not of not, then it is a match */
542 return !!match == !op->not;
545 struct filter_match_preds_data {
546 struct filter_pred *preds;
551 static int filter_match_preds_cb(enum move_type move, struct filter_pred *pred,
552 int *err, void *data)
554 struct filter_match_preds_data *d = data;
559 /* only AND and OR have children */
560 if (pred->left != FILTER_PRED_INVALID) {
561 /* If ops is set, then it was folded. */
563 return WALK_PRED_DEFAULT;
564 /* We can treat folded ops as a leaf node */
565 d->match = process_ops(d->preds, pred, d->rec);
567 if (!WARN_ON_ONCE(!pred->fn))
568 d->match = pred->fn(pred, d->rec);
571 return WALK_PRED_PARENT;
572 case MOVE_UP_FROM_LEFT:
574 * Check for short circuits.
576 * Optimization: !!match == (pred->op == OP_OR)
578 * if ((match && pred->op == OP_OR) ||
579 * (!match && pred->op == OP_AND))
581 if (!!d->match == (pred->op == OP_OR))
582 return WALK_PRED_PARENT;
584 case MOVE_UP_FROM_RIGHT:
588 return WALK_PRED_DEFAULT;
591 /* return 1 if event matches, 0 otherwise (discard) */
592 int filter_match_preds(struct event_filter *filter, void *rec)
594 struct filter_pred *preds;
595 struct filter_pred *root;
596 struct filter_match_preds_data data = {
597 /* match is currently meaningless */
603 /* no filter is considered a match */
607 n_preds = filter->n_preds;
612 * n_preds, root and filter->preds are protect with preemption disabled.
614 root = rcu_dereference_sched(filter->root);
618 data.preds = preds = rcu_dereference_sched(filter->preds);
619 ret = walk_pred_tree(preds, root, filter_match_preds_cb, &data);
623 EXPORT_SYMBOL_GPL(filter_match_preds);
625 static void parse_error(struct filter_parse_state *ps, int err, int pos)
628 ps->lasterr_pos = pos;
631 static void remove_filter_string(struct event_filter *filter)
636 kfree(filter->filter_string);
637 filter->filter_string = NULL;
640 static int replace_filter_string(struct event_filter *filter,
643 kfree(filter->filter_string);
644 filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
645 if (!filter->filter_string)
651 static int append_filter_string(struct event_filter *filter,
655 char *new_filter_string;
657 BUG_ON(!filter->filter_string);
658 newlen = strlen(filter->filter_string) + strlen(string) + 1;
659 new_filter_string = kmalloc(newlen, GFP_KERNEL);
660 if (!new_filter_string)
663 strcpy(new_filter_string, filter->filter_string);
664 strcat(new_filter_string, string);
665 kfree(filter->filter_string);
666 filter->filter_string = new_filter_string;
671 static void append_filter_err(struct filter_parse_state *ps,
672 struct event_filter *filter)
674 int pos = ps->lasterr_pos;
677 buf = (char *)__get_free_page(GFP_TEMPORARY);
681 append_filter_string(filter, "\n");
682 memset(buf, ' ', PAGE_SIZE);
683 if (pos > PAGE_SIZE - 128)
686 pbuf = &buf[pos] + 1;
688 sprintf(pbuf, "\nparse_error: %s\n", err_text[ps->lasterr]);
689 append_filter_string(filter, buf);
690 free_page((unsigned long) buf);
693 static inline struct event_filter *event_filter(struct trace_event_file *file)
698 /* caller must hold event_mutex */
699 void print_event_filter(struct trace_event_file *file, struct trace_seq *s)
701 struct event_filter *filter = event_filter(file);
703 if (filter && filter->filter_string)
704 trace_seq_printf(s, "%s\n", filter->filter_string);
706 trace_seq_puts(s, "none\n");
709 void print_subsystem_event_filter(struct event_subsystem *system,
712 struct event_filter *filter;
714 mutex_lock(&event_mutex);
715 filter = system->filter;
716 if (filter && filter->filter_string)
717 trace_seq_printf(s, "%s\n", filter->filter_string);
719 trace_seq_puts(s, DEFAULT_SYS_FILTER_MESSAGE "\n");
720 mutex_unlock(&event_mutex);
723 static int __alloc_pred_stack(struct pred_stack *stack, int n_preds)
725 stack->preds = kcalloc(n_preds + 1, sizeof(*stack->preds), GFP_KERNEL);
728 stack->index = n_preds;
732 static void __free_pred_stack(struct pred_stack *stack)
738 static int __push_pred_stack(struct pred_stack *stack,
739 struct filter_pred *pred)
741 int index = stack->index;
743 if (WARN_ON(index == 0))
746 stack->preds[--index] = pred;
747 stack->index = index;
751 static struct filter_pred *
752 __pop_pred_stack(struct pred_stack *stack)
754 struct filter_pred *pred;
755 int index = stack->index;
757 pred = stack->preds[index++];
761 stack->index = index;
765 static int filter_set_pred(struct event_filter *filter,
767 struct pred_stack *stack,
768 struct filter_pred *src)
770 struct filter_pred *dest = &filter->preds[idx];
771 struct filter_pred *left;
772 struct filter_pred *right;
777 if (dest->op == OP_OR || dest->op == OP_AND) {
778 right = __pop_pred_stack(stack);
779 left = __pop_pred_stack(stack);
783 * If both children can be folded
784 * and they are the same op as this op or a leaf,
785 * then this op can be folded.
787 if (left->index & FILTER_PRED_FOLD &&
788 ((left->op == dest->op && !left->not) ||
789 left->left == FILTER_PRED_INVALID) &&
790 right->index & FILTER_PRED_FOLD &&
791 ((right->op == dest->op && !right->not) ||
792 right->left == FILTER_PRED_INVALID))
793 dest->index |= FILTER_PRED_FOLD;
795 dest->left = left->index & ~FILTER_PRED_FOLD;
796 dest->right = right->index & ~FILTER_PRED_FOLD;
797 left->parent = dest->index & ~FILTER_PRED_FOLD;
798 right->parent = dest->index | FILTER_PRED_IS_RIGHT;
801 * Make dest->left invalid to be used as a quick
802 * way to know this is a leaf node.
804 dest->left = FILTER_PRED_INVALID;
806 /* All leafs allow folding the parent ops. */
807 dest->index |= FILTER_PRED_FOLD;
810 return __push_pred_stack(stack, dest);
813 static void __free_preds(struct event_filter *filter)
818 for (i = 0; i < filter->n_preds; i++)
819 kfree(filter->preds[i].ops);
820 kfree(filter->preds);
821 filter->preds = NULL;
827 static void filter_disable(struct trace_event_file *file)
829 unsigned long old_flags = file->flags;
831 file->flags &= ~EVENT_FILE_FL_FILTERED;
833 if (old_flags != file->flags)
834 trace_buffered_event_disable();
837 static void __free_filter(struct event_filter *filter)
842 __free_preds(filter);
843 kfree(filter->filter_string);
847 void free_event_filter(struct event_filter *filter)
849 __free_filter(filter);
852 static struct event_filter *__alloc_filter(void)
854 struct event_filter *filter;
856 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
860 static int __alloc_preds(struct event_filter *filter, int n_preds)
862 struct filter_pred *pred;
866 __free_preds(filter);
868 filter->preds = kcalloc(n_preds, sizeof(*filter->preds), GFP_KERNEL);
873 filter->a_preds = n_preds;
876 for (i = 0; i < n_preds; i++) {
877 pred = &filter->preds[i];
878 pred->fn = filter_pred_none;
884 static inline void __remove_filter(struct trace_event_file *file)
886 filter_disable(file);
887 remove_filter_string(file->filter);
890 static void filter_free_subsystem_preds(struct trace_subsystem_dir *dir,
891 struct trace_array *tr)
893 struct trace_event_file *file;
895 list_for_each_entry(file, &tr->events, list) {
896 if (file->system != dir)
898 __remove_filter(file);
902 static inline void __free_subsystem_filter(struct trace_event_file *file)
904 __free_filter(file->filter);
908 static void filter_free_subsystem_filters(struct trace_subsystem_dir *dir,
909 struct trace_array *tr)
911 struct trace_event_file *file;
913 list_for_each_entry(file, &tr->events, list) {
914 if (file->system != dir)
916 __free_subsystem_filter(file);
920 static int filter_add_pred(struct filter_parse_state *ps,
921 struct event_filter *filter,
922 struct filter_pred *pred,
923 struct pred_stack *stack)
927 if (WARN_ON(filter->n_preds == filter->a_preds)) {
928 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
932 err = filter_set_pred(filter, filter->n_preds, stack, pred);
941 int filter_assign_type(const char *type)
943 if (strstr(type, "__data_loc") && strstr(type, "char"))
944 return FILTER_DYN_STRING;
946 if (strchr(type, '[') && strstr(type, "char"))
947 return FILTER_STATIC_STRING;
952 static bool is_legal_op(struct ftrace_event_field *field, int op)
954 if (is_string_field(field) &&
955 (op != OP_EQ && op != OP_NE && op != OP_GLOB))
957 if (!is_string_field(field) && op == OP_GLOB)
963 static filter_pred_fn_t select_comparison_fn(int op, int field_size,
966 filter_pred_fn_t fn = NULL;
968 switch (field_size) {
970 if (op == OP_EQ || op == OP_NE)
972 else if (field_is_signed)
973 fn = filter_pred_s64;
975 fn = filter_pred_u64;
978 if (op == OP_EQ || op == OP_NE)
980 else if (field_is_signed)
981 fn = filter_pred_s32;
983 fn = filter_pred_u32;
986 if (op == OP_EQ || op == OP_NE)
988 else if (field_is_signed)
989 fn = filter_pred_s16;
991 fn = filter_pred_u16;
994 if (op == OP_EQ || op == OP_NE)
996 else if (field_is_signed)
1006 static int init_pred(struct filter_parse_state *ps,
1007 struct ftrace_event_field *field,
1008 struct filter_pred *pred)
1011 filter_pred_fn_t fn = filter_pred_none;
1012 unsigned long long val;
1015 pred->offset = field->offset;
1017 if (!is_legal_op(field, pred->op)) {
1018 parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
1022 if (field->filter_type == FILTER_COMM) {
1023 filter_build_regex(pred);
1024 fn = filter_pred_comm;
1025 pred->regex.field_len = TASK_COMM_LEN;
1026 } else if (is_string_field(field)) {
1027 filter_build_regex(pred);
1029 if (field->filter_type == FILTER_STATIC_STRING) {
1030 fn = filter_pred_string;
1031 pred->regex.field_len = field->size;
1032 } else if (field->filter_type == FILTER_DYN_STRING)
1033 fn = filter_pred_strloc;
1035 fn = filter_pred_pchar;
1036 } else if (is_function_field(field)) {
1037 if (strcmp(field->name, "ip")) {
1038 parse_error(ps, FILT_ERR_IP_FIELD_ONLY, 0);
1042 if (field->is_signed)
1043 ret = kstrtoll(pred->regex.pattern, 0, &val);
1045 ret = kstrtoull(pred->regex.pattern, 0, &val);
1047 parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
1052 if (field->filter_type == FILTER_CPU)
1053 fn = filter_pred_cpu;
1055 fn = select_comparison_fn(pred->op, field->size,
1058 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1063 if (pred->op == OP_NE)
1070 static void parse_init(struct filter_parse_state *ps,
1071 struct filter_op *ops,
1074 memset(ps, '\0', sizeof(*ps));
1076 ps->infix.string = infix_string;
1077 ps->infix.cnt = strlen(infix_string);
1080 INIT_LIST_HEAD(&ps->opstack);
1081 INIT_LIST_HEAD(&ps->postfix);
1084 static char infix_next(struct filter_parse_state *ps)
1091 return ps->infix.string[ps->infix.tail++];
1094 static char infix_peek(struct filter_parse_state *ps)
1096 if (ps->infix.tail == strlen(ps->infix.string))
1099 return ps->infix.string[ps->infix.tail];
1102 static void infix_advance(struct filter_parse_state *ps)
1111 static inline int is_precedence_lower(struct filter_parse_state *ps,
1114 return ps->ops[a].precedence < ps->ops[b].precedence;
1117 static inline int is_op_char(struct filter_parse_state *ps, char c)
1121 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1122 if (ps->ops[i].string[0] == c)
1129 static int infix_get_op(struct filter_parse_state *ps, char firstc)
1131 char nextc = infix_peek(ps);
1139 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1140 if (!strcmp(opstr, ps->ops[i].string)) {
1142 return ps->ops[i].id;
1148 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1149 if (!strcmp(opstr, ps->ops[i].string))
1150 return ps->ops[i].id;
1156 static inline void clear_operand_string(struct filter_parse_state *ps)
1158 memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
1159 ps->operand.tail = 0;
1162 static inline int append_operand_char(struct filter_parse_state *ps, char c)
1164 if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
1167 ps->operand.string[ps->operand.tail++] = c;
1172 static int filter_opstack_push(struct filter_parse_state *ps, int op)
1174 struct opstack_op *opstack_op;
1176 opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
1180 opstack_op->op = op;
1181 list_add(&opstack_op->list, &ps->opstack);
1186 static int filter_opstack_empty(struct filter_parse_state *ps)
1188 return list_empty(&ps->opstack);
1191 static int filter_opstack_top(struct filter_parse_state *ps)
1193 struct opstack_op *opstack_op;
1195 if (filter_opstack_empty(ps))
1198 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1200 return opstack_op->op;
1203 static int filter_opstack_pop(struct filter_parse_state *ps)
1205 struct opstack_op *opstack_op;
1208 if (filter_opstack_empty(ps))
1211 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1212 op = opstack_op->op;
1213 list_del(&opstack_op->list);
1220 static void filter_opstack_clear(struct filter_parse_state *ps)
1222 while (!filter_opstack_empty(ps))
1223 filter_opstack_pop(ps);
1226 static char *curr_operand(struct filter_parse_state *ps)
1228 return ps->operand.string;
1231 static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
1233 struct postfix_elt *elt;
1235 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1240 elt->operand = kstrdup(operand, GFP_KERNEL);
1241 if (!elt->operand) {
1246 list_add_tail(&elt->list, &ps->postfix);
1251 static int postfix_append_op(struct filter_parse_state *ps, int op)
1253 struct postfix_elt *elt;
1255 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1260 elt->operand = NULL;
1262 list_add_tail(&elt->list, &ps->postfix);
1267 static void postfix_clear(struct filter_parse_state *ps)
1269 struct postfix_elt *elt;
1271 while (!list_empty(&ps->postfix)) {
1272 elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
1273 list_del(&elt->list);
1274 kfree(elt->operand);
1279 static int filter_parse(struct filter_parse_state *ps)
1285 while ((ch = infix_next(ps))) {
1297 if (is_op_char(ps, ch)) {
1298 op = infix_get_op(ps, ch);
1299 if (op == OP_NONE) {
1300 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1304 if (strlen(curr_operand(ps))) {
1305 postfix_append_operand(ps, curr_operand(ps));
1306 clear_operand_string(ps);
1309 while (!filter_opstack_empty(ps)) {
1310 top_op = filter_opstack_top(ps);
1311 if (!is_precedence_lower(ps, top_op, op)) {
1312 top_op = filter_opstack_pop(ps);
1313 postfix_append_op(ps, top_op);
1319 filter_opstack_push(ps, op);
1324 filter_opstack_push(ps, OP_OPEN_PAREN);
1329 if (strlen(curr_operand(ps))) {
1330 postfix_append_operand(ps, curr_operand(ps));
1331 clear_operand_string(ps);
1334 top_op = filter_opstack_pop(ps);
1335 while (top_op != OP_NONE) {
1336 if (top_op == OP_OPEN_PAREN)
1338 postfix_append_op(ps, top_op);
1339 top_op = filter_opstack_pop(ps);
1341 if (top_op == OP_NONE) {
1342 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1348 if (append_operand_char(ps, ch)) {
1349 parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
1354 if (strlen(curr_operand(ps)))
1355 postfix_append_operand(ps, curr_operand(ps));
1357 while (!filter_opstack_empty(ps)) {
1358 top_op = filter_opstack_pop(ps);
1359 if (top_op == OP_NONE)
1361 if (top_op == OP_OPEN_PAREN) {
1362 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1365 postfix_append_op(ps, top_op);
1371 static struct filter_pred *create_pred(struct filter_parse_state *ps,
1372 struct trace_event_call *call,
1373 int op, char *operand1, char *operand2)
1375 struct ftrace_event_field *field;
1376 static struct filter_pred pred;
1378 memset(&pred, 0, sizeof(pred));
1381 if (op == OP_AND || op == OP_OR)
1384 if (!operand1 || !operand2) {
1385 parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
1389 field = trace_find_event_field(call, operand1);
1391 parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
1395 strcpy(pred.regex.pattern, operand2);
1396 pred.regex.len = strlen(pred.regex.pattern);
1398 return init_pred(ps, field, &pred) ? NULL : &pred;
1401 static int check_preds(struct filter_parse_state *ps)
1403 int n_normal_preds = 0, n_logical_preds = 0;
1404 struct postfix_elt *elt;
1407 list_for_each_entry(elt, &ps->postfix, list) {
1408 if (elt->op == OP_NONE) {
1413 if (elt->op == OP_AND || elt->op == OP_OR) {
1418 if (elt->op != OP_NOT)
1421 /* all ops should have operands */
1426 if (cnt != 1 || !n_normal_preds || n_logical_preds >= n_normal_preds) {
1427 parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
1434 static int count_preds(struct filter_parse_state *ps)
1436 struct postfix_elt *elt;
1439 list_for_each_entry(elt, &ps->postfix, list) {
1440 if (elt->op == OP_NONE)
1448 struct check_pred_data {
1453 static int check_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1454 int *err, void *data)
1456 struct check_pred_data *d = data;
1458 if (WARN_ON(d->count++ > d->max)) {
1460 return WALK_PRED_ABORT;
1462 return WALK_PRED_DEFAULT;
1466 * The tree is walked at filtering of an event. If the tree is not correctly
1467 * built, it may cause an infinite loop. Check here that the tree does
1470 static int check_pred_tree(struct event_filter *filter,
1471 struct filter_pred *root)
1473 struct check_pred_data data = {
1475 * The max that we can hit a node is three times.
1476 * Once going down, once coming up from left, and
1477 * once coming up from right. This is more than enough
1478 * since leafs are only hit a single time.
1480 .max = 3 * filter->n_preds,
1484 return walk_pred_tree(filter->preds, root,
1485 check_pred_tree_cb, &data);
1488 static int count_leafs_cb(enum move_type move, struct filter_pred *pred,
1489 int *err, void *data)
1493 if ((move == MOVE_DOWN) &&
1494 (pred->left == FILTER_PRED_INVALID))
1497 return WALK_PRED_DEFAULT;
1500 static int count_leafs(struct filter_pred *preds, struct filter_pred *root)
1504 ret = walk_pred_tree(preds, root, count_leafs_cb, &count);
1509 struct fold_pred_data {
1510 struct filter_pred *root;
1515 static int fold_pred_cb(enum move_type move, struct filter_pred *pred,
1516 int *err, void *data)
1518 struct fold_pred_data *d = data;
1519 struct filter_pred *root = d->root;
1521 if (move != MOVE_DOWN)
1522 return WALK_PRED_DEFAULT;
1523 if (pred->left != FILTER_PRED_INVALID)
1524 return WALK_PRED_DEFAULT;
1526 if (WARN_ON(d->count == d->children)) {
1528 return WALK_PRED_ABORT;
1531 pred->index &= ~FILTER_PRED_FOLD;
1532 root->ops[d->count++] = pred->index;
1533 return WALK_PRED_DEFAULT;
1536 static int fold_pred(struct filter_pred *preds, struct filter_pred *root)
1538 struct fold_pred_data data = {
1544 /* No need to keep the fold flag */
1545 root->index &= ~FILTER_PRED_FOLD;
1547 /* If the root is a leaf then do nothing */
1548 if (root->left == FILTER_PRED_INVALID)
1551 /* count the children */
1552 children = count_leafs(preds, &preds[root->left]);
1553 children += count_leafs(preds, &preds[root->right]);
1555 root->ops = kcalloc(children, sizeof(*root->ops), GFP_KERNEL);
1559 root->val = children;
1560 data.children = children;
1561 return walk_pred_tree(preds, root, fold_pred_cb, &data);
1564 static int fold_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1565 int *err, void *data)
1567 struct filter_pred *preds = data;
1569 if (move != MOVE_DOWN)
1570 return WALK_PRED_DEFAULT;
1571 if (!(pred->index & FILTER_PRED_FOLD))
1572 return WALK_PRED_DEFAULT;
1574 *err = fold_pred(preds, pred);
1576 return WALK_PRED_ABORT;
1578 /* eveyrhing below is folded, continue with parent */
1579 return WALK_PRED_PARENT;
1583 * To optimize the processing of the ops, if we have several "ors" or
1584 * "ands" together, we can put them in an array and process them all
1585 * together speeding up the filter logic.
1587 static int fold_pred_tree(struct event_filter *filter,
1588 struct filter_pred *root)
1590 return walk_pred_tree(filter->preds, root, fold_pred_tree_cb,
1594 static int replace_preds(struct trace_event_call *call,
1595 struct event_filter *filter,
1596 struct filter_parse_state *ps,
1599 char *operand1 = NULL, *operand2 = NULL;
1600 struct filter_pred *pred;
1601 struct filter_pred *root;
1602 struct postfix_elt *elt;
1603 struct pred_stack stack = { }; /* init to NULL */
1607 n_preds = count_preds(ps);
1608 if (n_preds >= MAX_FILTER_PRED) {
1609 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1613 err = check_preds(ps);
1618 err = __alloc_pred_stack(&stack, n_preds);
1621 err = __alloc_preds(filter, n_preds);
1627 list_for_each_entry(elt, &ps->postfix, list) {
1628 if (elt->op == OP_NONE) {
1630 operand1 = elt->operand;
1632 operand2 = elt->operand;
1634 parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
1641 if (elt->op == OP_NOT) {
1642 if (!n_preds || operand1 || operand2) {
1643 parse_error(ps, FILT_ERR_ILLEGAL_NOT_OP, 0);
1648 filter->preds[n_preds - 1].not ^= 1;
1652 if (WARN_ON(n_preds++ == MAX_FILTER_PRED)) {
1653 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1658 pred = create_pred(ps, call, elt->op, operand1, operand2);
1665 err = filter_add_pred(ps, filter, pred, &stack);
1670 operand1 = operand2 = NULL;
1674 /* We should have one item left on the stack */
1675 pred = __pop_pred_stack(&stack);
1678 /* This item is where we start from in matching */
1680 /* Make sure the stack is empty */
1681 pred = __pop_pred_stack(&stack);
1682 if (WARN_ON(pred)) {
1684 filter->root = NULL;
1687 err = check_pred_tree(filter, root);
1691 /* Optimize the tree */
1692 err = fold_pred_tree(filter, root);
1696 /* We don't set root until we know it works */
1698 filter->root = root;
1703 __free_pred_stack(&stack);
1707 static inline void event_set_filtered_flag(struct trace_event_file *file)
1709 unsigned long old_flags = file->flags;
1711 file->flags |= EVENT_FILE_FL_FILTERED;
1713 if (old_flags != file->flags)
1714 trace_buffered_event_enable();
1717 static inline void event_set_filter(struct trace_event_file *file,
1718 struct event_filter *filter)
1720 rcu_assign_pointer(file->filter, filter);
1723 static inline void event_clear_filter(struct trace_event_file *file)
1725 RCU_INIT_POINTER(file->filter, NULL);
1729 event_set_no_set_filter_flag(struct trace_event_file *file)
1731 file->flags |= EVENT_FILE_FL_NO_SET_FILTER;
1735 event_clear_no_set_filter_flag(struct trace_event_file *file)
1737 file->flags &= ~EVENT_FILE_FL_NO_SET_FILTER;
1741 event_no_set_filter_flag(struct trace_event_file *file)
1743 if (file->flags & EVENT_FILE_FL_NO_SET_FILTER)
1749 struct filter_list {
1750 struct list_head list;
1751 struct event_filter *filter;
1754 static int replace_system_preds(struct trace_subsystem_dir *dir,
1755 struct trace_array *tr,
1756 struct filter_parse_state *ps,
1757 char *filter_string)
1759 struct trace_event_file *file;
1760 struct filter_list *filter_item;
1761 struct filter_list *tmp;
1762 LIST_HEAD(filter_list);
1766 list_for_each_entry(file, &tr->events, list) {
1767 if (file->system != dir)
1771 * Try to see if the filter can be applied
1772 * (filter arg is ignored on dry_run)
1774 err = replace_preds(file->event_call, NULL, ps, true);
1776 event_set_no_set_filter_flag(file);
1778 event_clear_no_set_filter_flag(file);
1781 list_for_each_entry(file, &tr->events, list) {
1782 struct event_filter *filter;
1784 if (file->system != dir)
1787 if (event_no_set_filter_flag(file))
1790 filter_item = kzalloc(sizeof(*filter_item), GFP_KERNEL);
1794 list_add_tail(&filter_item->list, &filter_list);
1796 filter_item->filter = __alloc_filter();
1797 if (!filter_item->filter)
1799 filter = filter_item->filter;
1801 /* Can only fail on no memory */
1802 err = replace_filter_string(filter, filter_string);
1806 err = replace_preds(file->event_call, filter, ps, false);
1808 filter_disable(file);
1809 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1810 append_filter_err(ps, filter);
1812 event_set_filtered_flag(file);
1814 * Regardless of if this returned an error, we still
1815 * replace the filter for the call.
1817 filter = event_filter(file);
1818 event_set_filter(file, filter_item->filter);
1819 filter_item->filter = filter;
1828 * The calls can still be using the old filters.
1829 * Do a synchronize_sched() to ensure all calls are
1830 * done with them before we free them.
1832 synchronize_sched();
1833 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1834 __free_filter(filter_item->filter);
1835 list_del(&filter_item->list);
1840 /* No call succeeded */
1841 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1842 list_del(&filter_item->list);
1845 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1848 /* If any call succeeded, we still need to sync */
1850 synchronize_sched();
1851 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1852 __free_filter(filter_item->filter);
1853 list_del(&filter_item->list);
1859 static int create_filter_start(char *filter_str, bool set_str,
1860 struct filter_parse_state **psp,
1861 struct event_filter **filterp)
1863 struct event_filter *filter;
1864 struct filter_parse_state *ps = NULL;
1867 WARN_ON_ONCE(*psp || *filterp);
1869 /* allocate everything, and if any fails, free all and fail */
1870 filter = __alloc_filter();
1871 if (filter && set_str)
1872 err = replace_filter_string(filter, filter_str);
1874 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1876 if (!filter || !ps || err) {
1878 __free_filter(filter);
1882 /* we're committed to creating a new filter */
1886 parse_init(ps, filter_ops, filter_str);
1887 err = filter_parse(ps);
1889 append_filter_err(ps, filter);
1893 static void create_filter_finish(struct filter_parse_state *ps)
1896 filter_opstack_clear(ps);
1903 * create_filter - create a filter for a trace_event_call
1904 * @call: trace_event_call to create a filter for
1905 * @filter_str: filter string
1906 * @set_str: remember @filter_str and enable detailed error in filter
1907 * @filterp: out param for created filter (always updated on return)
1909 * Creates a filter for @call with @filter_str. If @set_str is %true,
1910 * @filter_str is copied and recorded in the new filter.
1912 * On success, returns 0 and *@filterp points to the new filter. On
1913 * failure, returns -errno and *@filterp may point to %NULL or to a new
1914 * filter. In the latter case, the returned filter contains error
1915 * information if @set_str is %true and the caller is responsible for
1918 static int create_filter(struct trace_event_call *call,
1919 char *filter_str, bool set_str,
1920 struct event_filter **filterp)
1922 struct event_filter *filter = NULL;
1923 struct filter_parse_state *ps = NULL;
1926 err = create_filter_start(filter_str, set_str, &ps, &filter);
1928 err = replace_preds(call, filter, ps, false);
1930 append_filter_err(ps, filter);
1932 if (err && !set_str) {
1933 free_event_filter(filter);
1936 create_filter_finish(ps);
1942 int create_event_filter(struct trace_event_call *call,
1943 char *filter_str, bool set_str,
1944 struct event_filter **filterp)
1946 return create_filter(call, filter_str, set_str, filterp);
1950 * create_system_filter - create a filter for an event_subsystem
1951 * @system: event_subsystem to create a filter for
1952 * @filter_str: filter string
1953 * @filterp: out param for created filter (always updated on return)
1955 * Identical to create_filter() except that it creates a subsystem filter
1956 * and always remembers @filter_str.
1958 static int create_system_filter(struct trace_subsystem_dir *dir,
1959 struct trace_array *tr,
1960 char *filter_str, struct event_filter **filterp)
1962 struct event_filter *filter = NULL;
1963 struct filter_parse_state *ps = NULL;
1966 err = create_filter_start(filter_str, true, &ps, &filter);
1968 err = replace_system_preds(dir, tr, ps, filter_str);
1970 /* System filters just show a default message */
1971 kfree(filter->filter_string);
1972 filter->filter_string = NULL;
1974 append_filter_err(ps, filter);
1977 create_filter_finish(ps);
1983 /* caller must hold event_mutex */
1984 int apply_event_filter(struct trace_event_file *file, char *filter_string)
1986 struct trace_event_call *call = file->event_call;
1987 struct event_filter *filter;
1990 if (!strcmp(strstrip(filter_string), "0")) {
1991 filter_disable(file);
1992 filter = event_filter(file);
1997 event_clear_filter(file);
1999 /* Make sure the filter is not being used */
2000 synchronize_sched();
2001 __free_filter(filter);
2006 err = create_filter(call, filter_string, true, &filter);
2009 * Always swap the call filter with the new filter
2010 * even if there was an error. If there was an error
2011 * in the filter, we disable the filter and show the error
2015 struct event_filter *tmp;
2017 tmp = event_filter(file);
2019 event_set_filtered_flag(file);
2021 filter_disable(file);
2023 event_set_filter(file, filter);
2026 /* Make sure the call is done with the filter */
2027 synchronize_sched();
2035 int apply_subsystem_event_filter(struct trace_subsystem_dir *dir,
2036 char *filter_string)
2038 struct event_subsystem *system = dir->subsystem;
2039 struct trace_array *tr = dir->tr;
2040 struct event_filter *filter;
2043 mutex_lock(&event_mutex);
2045 /* Make sure the system still has events */
2046 if (!dir->nr_events) {
2051 if (!strcmp(strstrip(filter_string), "0")) {
2052 filter_free_subsystem_preds(dir, tr);
2053 remove_filter_string(system->filter);
2054 filter = system->filter;
2055 system->filter = NULL;
2056 /* Ensure all filters are no longer used */
2057 synchronize_sched();
2058 filter_free_subsystem_filters(dir, tr);
2059 __free_filter(filter);
2063 err = create_system_filter(dir, tr, filter_string, &filter);
2066 * No event actually uses the system filter
2067 * we can free it without synchronize_sched().
2069 __free_filter(system->filter);
2070 system->filter = filter;
2073 mutex_unlock(&event_mutex);
2078 #ifdef CONFIG_PERF_EVENTS
2080 void ftrace_profile_free_filter(struct perf_event *event)
2082 struct event_filter *filter = event->filter;
2084 event->filter = NULL;
2085 __free_filter(filter);
2088 struct function_filter_data {
2089 struct ftrace_ops *ops;
2094 #ifdef CONFIG_FUNCTION_TRACER
2096 ftrace_function_filter_re(char *buf, int len, int *count)
2100 str = kstrndup(buf, len, GFP_KERNEL);
2105 * The argv_split function takes white space
2106 * as a separator, so convert ',' into spaces.
2108 strreplace(str, ',', ' ');
2110 re = argv_split(GFP_KERNEL, str, count);
2115 static int ftrace_function_set_regexp(struct ftrace_ops *ops, int filter,
2116 int reset, char *re, int len)
2121 ret = ftrace_set_filter(ops, re, len, reset);
2123 ret = ftrace_set_notrace(ops, re, len, reset);
2128 static int __ftrace_function_set_filter(int filter, char *buf, int len,
2129 struct function_filter_data *data)
2131 int i, re_cnt, ret = -EINVAL;
2135 reset = filter ? &data->first_filter : &data->first_notrace;
2138 * The 'ip' field could have multiple filters set, separated
2139 * either by space or comma. We first cut the filter and apply
2140 * all pieces separatelly.
2142 re = ftrace_function_filter_re(buf, len, &re_cnt);
2146 for (i = 0; i < re_cnt; i++) {
2147 ret = ftrace_function_set_regexp(data->ops, filter, *reset,
2148 re[i], strlen(re[i]));
2160 static int ftrace_function_check_pred(struct filter_pred *pred, int leaf)
2162 struct ftrace_event_field *field = pred->field;
2166 * Check the leaf predicate for function trace, verify:
2167 * - only '==' and '!=' is used
2168 * - the 'ip' field is used
2170 if ((pred->op != OP_EQ) && (pred->op != OP_NE))
2173 if (strcmp(field->name, "ip"))
2177 * Check the non leaf predicate for function trace, verify:
2178 * - only '||' is used
2180 if (pred->op != OP_OR)
2187 static int ftrace_function_set_filter_cb(enum move_type move,
2188 struct filter_pred *pred,
2189 int *err, void *data)
2191 /* Checking the node is valid for function trace. */
2192 if ((move != MOVE_DOWN) ||
2193 (pred->left != FILTER_PRED_INVALID)) {
2194 *err = ftrace_function_check_pred(pred, 0);
2196 *err = ftrace_function_check_pred(pred, 1);
2198 return WALK_PRED_ABORT;
2200 *err = __ftrace_function_set_filter(pred->op == OP_EQ,
2201 pred->regex.pattern,
2206 return (*err) ? WALK_PRED_ABORT : WALK_PRED_DEFAULT;
2209 static int ftrace_function_set_filter(struct perf_event *event,
2210 struct event_filter *filter)
2212 struct function_filter_data data = {
2215 .ops = &event->ftrace_ops,
2218 return walk_pred_tree(filter->preds, filter->root,
2219 ftrace_function_set_filter_cb, &data);
2222 static int ftrace_function_set_filter(struct perf_event *event,
2223 struct event_filter *filter)
2227 #endif /* CONFIG_FUNCTION_TRACER */
2229 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
2233 struct event_filter *filter;
2234 struct trace_event_call *call;
2236 mutex_lock(&event_mutex);
2238 call = event->tp_event;
2248 err = create_filter(call, filter_str, false, &filter);
2252 if (ftrace_event_is_function(call))
2253 err = ftrace_function_set_filter(event, filter);
2255 event->filter = filter;
2258 if (err || ftrace_event_is_function(call))
2259 __free_filter(filter);
2262 mutex_unlock(&event_mutex);
2267 #endif /* CONFIG_PERF_EVENTS */
2269 #ifdef CONFIG_FTRACE_STARTUP_TEST
2271 #include <linux/types.h>
2272 #include <linux/tracepoint.h>
2274 #define CREATE_TRACE_POINTS
2275 #include "trace_events_filter_test.h"
2277 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2280 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2281 .e = ve, .f = vf, .g = vg, .h = vh }, \
2283 .not_visited = nvisit, \
2288 static struct test_filter_data_t {
2290 struct trace_event_raw_ftrace_test_filter rec;
2293 } test_filter_data[] = {
2294 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2295 "e == 1 && f == 1 && g == 1 && h == 1"
2296 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2297 DATA_REC(NO, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2298 DATA_REC(NO, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2300 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2301 "e == 1 || f == 1 || g == 1 || h == 1"
2302 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2303 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2304 DATA_REC(YES, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
2306 #define FILTER "(a == 1 || b == 1) && (c == 1 || d == 1) && " \
2307 "(e == 1 || f == 1) && (g == 1 || h == 1)"
2308 DATA_REC(NO, 0, 0, 1, 1, 1, 1, 1, 1, "dfh"),
2309 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2310 DATA_REC(YES, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2311 DATA_REC(NO, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2313 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2314 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2315 DATA_REC(YES, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2316 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2317 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2319 #define FILTER "(a == 1 && b == 1) && (c == 1 && d == 1) && " \
2320 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2321 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 0, "gh"),
2322 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2323 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, ""),
2325 #define FILTER "((a == 1 || b == 1) || (c == 1 || d == 1) || " \
2326 "(e == 1 || f == 1)) && (g == 1 || h == 1)"
2327 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 1, "bcdef"),
2328 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2329 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
2331 #define FILTER "((((((((a == 1) && (b == 1)) || (c == 1)) && (d == 1)) || " \
2332 "(e == 1)) && (f == 1)) || (g == 1)) && (h == 1))"
2333 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "ceg"),
2334 DATA_REC(NO, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2335 DATA_REC(NO, 1, 0, 1, 0, 1, 0, 1, 0, ""),
2337 #define FILTER "((((((((a == 1) || (b == 1)) && (c == 1)) || (d == 1)) && " \
2338 "(e == 1)) || (f == 1)) && (g == 1)) || (h == 1))"
2339 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "bdfh"),
2340 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2341 DATA_REC(YES, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2349 #define DATA_CNT (sizeof(test_filter_data)/sizeof(struct test_filter_data_t))
2351 static int test_pred_visited;
2353 static int test_pred_visited_fn(struct filter_pred *pred, void *event)
2355 struct ftrace_event_field *field = pred->field;
2357 test_pred_visited = 1;
2358 printk(KERN_INFO "\npred visited %s\n", field->name);
2362 static int test_walk_pred_cb(enum move_type move, struct filter_pred *pred,
2363 int *err, void *data)
2365 char *fields = data;
2367 if ((move == MOVE_DOWN) &&
2368 (pred->left == FILTER_PRED_INVALID)) {
2369 struct ftrace_event_field *field = pred->field;
2372 WARN(1, "all leafs should have field defined");
2373 return WALK_PRED_DEFAULT;
2375 if (!strchr(fields, *field->name))
2376 return WALK_PRED_DEFAULT;
2379 pred->fn = test_pred_visited_fn;
2381 return WALK_PRED_DEFAULT;
2384 static __init int ftrace_test_event_filter(void)
2388 printk(KERN_INFO "Testing ftrace filter: ");
2390 for (i = 0; i < DATA_CNT; i++) {
2391 struct event_filter *filter = NULL;
2392 struct test_filter_data_t *d = &test_filter_data[i];
2395 err = create_filter(&event_ftrace_test_filter, d->filter,
2399 "Failed to get filter for '%s', err %d\n",
2401 __free_filter(filter);
2406 * The preemption disabling is not really needed for self
2407 * tests, but the rcu dereference will complain without it.
2410 if (*d->not_visited)
2411 walk_pred_tree(filter->preds, filter->root,
2415 test_pred_visited = 0;
2416 err = filter_match_preds(filter, &d->rec);
2419 __free_filter(filter);
2421 if (test_pred_visited) {
2423 "Failed, unwanted pred visited for filter %s\n",
2428 if (err != d->match) {
2430 "Failed to match filter '%s', expected %d\n",
2431 d->filter, d->match);
2437 printk(KERN_CONT "OK\n");
2442 late_initcall(ftrace_test_event_filter);
2444 #endif /* CONFIG_FTRACE_STARTUP_TEST */