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)
325 if (strncmp(str, r->pattern, r->len) == 0)
330 static int regex_match_middle(char *str, struct regex *r, int len)
332 if (strnstr(str, r->pattern, len))
337 static int regex_match_end(char *str, struct regex *r, int len)
339 int strlen = len - 1;
341 if (strlen >= r->len &&
342 memcmp(str + strlen - r->len, r->pattern, r->len) == 0)
348 * filter_parse_regex - parse a basic regex
349 * @buff: the raw regex
350 * @len: length of the regex
351 * @search: will point to the beginning of the string to compare
352 * @not: tell whether the match will have to be inverted
354 * This passes in a buffer containing a regex and this function will
355 * set search to point to the search part of the buffer and
356 * return the type of search it is (see enum above).
357 * This does modify buff.
360 * search returns the pointer to use for comparison.
361 * not returns 1 if buff started with a '!'
364 enum regex_type filter_parse_regex(char *buff, int len, char **search, int *not)
366 int type = MATCH_FULL;
369 if (buff[0] == '!') {
378 for (i = 0; i < len; i++) {
379 if (buff[i] == '*') {
382 type = MATCH_END_ONLY;
384 if (type == MATCH_END_ONLY)
385 type = MATCH_MIDDLE_ONLY;
387 type = MATCH_FRONT_ONLY;
397 static void filter_build_regex(struct filter_pred *pred)
399 struct regex *r = &pred->regex;
401 enum regex_type type = MATCH_FULL;
404 if (pred->op == OP_GLOB) {
405 type = filter_parse_regex(r->pattern, r->len, &search, ¬);
406 r->len = strlen(search);
407 memmove(r->pattern, search, r->len+1);
412 r->match = regex_match_full;
414 case MATCH_FRONT_ONLY:
415 r->match = regex_match_front;
417 case MATCH_MIDDLE_ONLY:
418 r->match = regex_match_middle;
421 r->match = regex_match_end;
434 static struct filter_pred *
435 get_pred_parent(struct filter_pred *pred, struct filter_pred *preds,
436 int index, enum move_type *move)
438 if (pred->parent & FILTER_PRED_IS_RIGHT)
439 *move = MOVE_UP_FROM_RIGHT;
441 *move = MOVE_UP_FROM_LEFT;
442 pred = &preds[pred->parent & ~FILTER_PRED_IS_RIGHT];
453 typedef int (*filter_pred_walkcb_t) (enum move_type move,
454 struct filter_pred *pred,
455 int *err, void *data);
457 static int walk_pred_tree(struct filter_pred *preds,
458 struct filter_pred *root,
459 filter_pred_walkcb_t cb, void *data)
461 struct filter_pred *pred = root;
462 enum move_type move = MOVE_DOWN;
471 ret = cb(move, pred, &err, data);
472 if (ret == WALK_PRED_ABORT)
474 if (ret == WALK_PRED_PARENT)
479 if (pred->left != FILTER_PRED_INVALID) {
480 pred = &preds[pred->left];
484 case MOVE_UP_FROM_LEFT:
485 pred = &preds[pred->right];
488 case MOVE_UP_FROM_RIGHT:
492 pred = get_pred_parent(pred, preds,
505 * A series of AND or ORs where found together. Instead of
506 * climbing up and down the tree branches, an array of the
507 * ops were made in order of checks. We can just move across
508 * the array and short circuit if needed.
510 static int process_ops(struct filter_pred *preds,
511 struct filter_pred *op, void *rec)
513 struct filter_pred *pred;
519 * Micro-optimization: We set type to true if op
520 * is an OR and false otherwise (AND). Then we
521 * just need to test if the match is equal to
522 * the type, and if it is, we can short circuit the
523 * rest of the checks:
525 * if ((match && op->op == OP_OR) ||
526 * (!match && op->op == OP_AND))
529 type = op->op == OP_OR;
531 for (i = 0; i < op->val; i++) {
532 pred = &preds[op->ops[i]];
533 if (!WARN_ON_ONCE(!pred->fn))
534 match = pred->fn(pred, rec);
538 /* If not of not match is equal to not of not, then it is a match */
539 return !!match == !op->not;
542 struct filter_match_preds_data {
543 struct filter_pred *preds;
548 static int filter_match_preds_cb(enum move_type move, struct filter_pred *pred,
549 int *err, void *data)
551 struct filter_match_preds_data *d = data;
556 /* only AND and OR have children */
557 if (pred->left != FILTER_PRED_INVALID) {
558 /* If ops is set, then it was folded. */
560 return WALK_PRED_DEFAULT;
561 /* We can treat folded ops as a leaf node */
562 d->match = process_ops(d->preds, pred, d->rec);
564 if (!WARN_ON_ONCE(!pred->fn))
565 d->match = pred->fn(pred, d->rec);
568 return WALK_PRED_PARENT;
569 case MOVE_UP_FROM_LEFT:
571 * Check for short circuits.
573 * Optimization: !!match == (pred->op == OP_OR)
575 * if ((match && pred->op == OP_OR) ||
576 * (!match && pred->op == OP_AND))
578 if (!!d->match == (pred->op == OP_OR))
579 return WALK_PRED_PARENT;
581 case MOVE_UP_FROM_RIGHT:
585 return WALK_PRED_DEFAULT;
588 /* return 1 if event matches, 0 otherwise (discard) */
589 int filter_match_preds(struct event_filter *filter, void *rec)
591 struct filter_pred *preds;
592 struct filter_pred *root;
593 struct filter_match_preds_data data = {
594 /* match is currently meaningless */
600 /* no filter is considered a match */
604 n_preds = filter->n_preds;
609 * n_preds, root and filter->preds are protect with preemption disabled.
611 root = rcu_dereference_sched(filter->root);
615 data.preds = preds = rcu_dereference_sched(filter->preds);
616 ret = walk_pred_tree(preds, root, filter_match_preds_cb, &data);
620 EXPORT_SYMBOL_GPL(filter_match_preds);
622 static void parse_error(struct filter_parse_state *ps, int err, int pos)
625 ps->lasterr_pos = pos;
628 static void remove_filter_string(struct event_filter *filter)
633 kfree(filter->filter_string);
634 filter->filter_string = NULL;
637 static int replace_filter_string(struct event_filter *filter,
640 kfree(filter->filter_string);
641 filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
642 if (!filter->filter_string)
648 static int append_filter_string(struct event_filter *filter,
652 char *new_filter_string;
654 BUG_ON(!filter->filter_string);
655 newlen = strlen(filter->filter_string) + strlen(string) + 1;
656 new_filter_string = kmalloc(newlen, GFP_KERNEL);
657 if (!new_filter_string)
660 strcpy(new_filter_string, filter->filter_string);
661 strcat(new_filter_string, string);
662 kfree(filter->filter_string);
663 filter->filter_string = new_filter_string;
668 static void append_filter_err(struct filter_parse_state *ps,
669 struct event_filter *filter)
671 int pos = ps->lasterr_pos;
674 buf = (char *)__get_free_page(GFP_TEMPORARY);
678 append_filter_string(filter, "\n");
679 memset(buf, ' ', PAGE_SIZE);
680 if (pos > PAGE_SIZE - 128)
683 pbuf = &buf[pos] + 1;
685 sprintf(pbuf, "\nparse_error: %s\n", err_text[ps->lasterr]);
686 append_filter_string(filter, buf);
687 free_page((unsigned long) buf);
690 static inline struct event_filter *event_filter(struct trace_event_file *file)
695 /* caller must hold event_mutex */
696 void print_event_filter(struct trace_event_file *file, struct trace_seq *s)
698 struct event_filter *filter = event_filter(file);
700 if (filter && filter->filter_string)
701 trace_seq_printf(s, "%s\n", filter->filter_string);
703 trace_seq_puts(s, "none\n");
706 void print_subsystem_event_filter(struct event_subsystem *system,
709 struct event_filter *filter;
711 mutex_lock(&event_mutex);
712 filter = system->filter;
713 if (filter && filter->filter_string)
714 trace_seq_printf(s, "%s\n", filter->filter_string);
716 trace_seq_puts(s, DEFAULT_SYS_FILTER_MESSAGE "\n");
717 mutex_unlock(&event_mutex);
720 static int __alloc_pred_stack(struct pred_stack *stack, int n_preds)
722 stack->preds = kcalloc(n_preds + 1, sizeof(*stack->preds), GFP_KERNEL);
725 stack->index = n_preds;
729 static void __free_pred_stack(struct pred_stack *stack)
735 static int __push_pred_stack(struct pred_stack *stack,
736 struct filter_pred *pred)
738 int index = stack->index;
740 if (WARN_ON(index == 0))
743 stack->preds[--index] = pred;
744 stack->index = index;
748 static struct filter_pred *
749 __pop_pred_stack(struct pred_stack *stack)
751 struct filter_pred *pred;
752 int index = stack->index;
754 pred = stack->preds[index++];
758 stack->index = index;
762 static int filter_set_pred(struct event_filter *filter,
764 struct pred_stack *stack,
765 struct filter_pred *src)
767 struct filter_pred *dest = &filter->preds[idx];
768 struct filter_pred *left;
769 struct filter_pred *right;
774 if (dest->op == OP_OR || dest->op == OP_AND) {
775 right = __pop_pred_stack(stack);
776 left = __pop_pred_stack(stack);
780 * If both children can be folded
781 * and they are the same op as this op or a leaf,
782 * then this op can be folded.
784 if (left->index & FILTER_PRED_FOLD &&
785 ((left->op == dest->op && !left->not) ||
786 left->left == FILTER_PRED_INVALID) &&
787 right->index & FILTER_PRED_FOLD &&
788 ((right->op == dest->op && !right->not) ||
789 right->left == FILTER_PRED_INVALID))
790 dest->index |= FILTER_PRED_FOLD;
792 dest->left = left->index & ~FILTER_PRED_FOLD;
793 dest->right = right->index & ~FILTER_PRED_FOLD;
794 left->parent = dest->index & ~FILTER_PRED_FOLD;
795 right->parent = dest->index | FILTER_PRED_IS_RIGHT;
798 * Make dest->left invalid to be used as a quick
799 * way to know this is a leaf node.
801 dest->left = FILTER_PRED_INVALID;
803 /* All leafs allow folding the parent ops. */
804 dest->index |= FILTER_PRED_FOLD;
807 return __push_pred_stack(stack, dest);
810 static void __free_preds(struct event_filter *filter)
815 for (i = 0; i < filter->n_preds; i++)
816 kfree(filter->preds[i].ops);
817 kfree(filter->preds);
818 filter->preds = NULL;
824 static void filter_disable(struct trace_event_file *file)
826 unsigned long old_flags = file->flags;
828 file->flags &= ~EVENT_FILE_FL_FILTERED;
830 if (old_flags != file->flags)
831 trace_buffered_event_disable();
834 static void __free_filter(struct event_filter *filter)
839 __free_preds(filter);
840 kfree(filter->filter_string);
844 void free_event_filter(struct event_filter *filter)
846 __free_filter(filter);
849 static struct event_filter *__alloc_filter(void)
851 struct event_filter *filter;
853 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
857 static int __alloc_preds(struct event_filter *filter, int n_preds)
859 struct filter_pred *pred;
863 __free_preds(filter);
865 filter->preds = kcalloc(n_preds, sizeof(*filter->preds), GFP_KERNEL);
870 filter->a_preds = n_preds;
873 for (i = 0; i < n_preds; i++) {
874 pred = &filter->preds[i];
875 pred->fn = filter_pred_none;
881 static inline void __remove_filter(struct trace_event_file *file)
883 filter_disable(file);
884 remove_filter_string(file->filter);
887 static void filter_free_subsystem_preds(struct trace_subsystem_dir *dir,
888 struct trace_array *tr)
890 struct trace_event_file *file;
892 list_for_each_entry(file, &tr->events, list) {
893 if (file->system != dir)
895 __remove_filter(file);
899 static inline void __free_subsystem_filter(struct trace_event_file *file)
901 __free_filter(file->filter);
905 static void filter_free_subsystem_filters(struct trace_subsystem_dir *dir,
906 struct trace_array *tr)
908 struct trace_event_file *file;
910 list_for_each_entry(file, &tr->events, list) {
911 if (file->system != dir)
913 __free_subsystem_filter(file);
917 static int filter_add_pred(struct filter_parse_state *ps,
918 struct event_filter *filter,
919 struct filter_pred *pred,
920 struct pred_stack *stack)
924 if (WARN_ON(filter->n_preds == filter->a_preds)) {
925 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
929 err = filter_set_pred(filter, filter->n_preds, stack, pred);
938 int filter_assign_type(const char *type)
940 if (strstr(type, "__data_loc") && strstr(type, "char"))
941 return FILTER_DYN_STRING;
943 if (strchr(type, '[') && strstr(type, "char"))
944 return FILTER_STATIC_STRING;
949 static bool is_legal_op(struct ftrace_event_field *field, int op)
951 if (is_string_field(field) &&
952 (op != OP_EQ && op != OP_NE && op != OP_GLOB))
954 if (!is_string_field(field) && op == OP_GLOB)
960 static filter_pred_fn_t select_comparison_fn(int op, int field_size,
963 filter_pred_fn_t fn = NULL;
965 switch (field_size) {
967 if (op == OP_EQ || op == OP_NE)
969 else if (field_is_signed)
970 fn = filter_pred_s64;
972 fn = filter_pred_u64;
975 if (op == OP_EQ || op == OP_NE)
977 else if (field_is_signed)
978 fn = filter_pred_s32;
980 fn = filter_pred_u32;
983 if (op == OP_EQ || op == OP_NE)
985 else if (field_is_signed)
986 fn = filter_pred_s16;
988 fn = filter_pred_u16;
991 if (op == OP_EQ || op == OP_NE)
993 else if (field_is_signed)
1003 static int init_pred(struct filter_parse_state *ps,
1004 struct ftrace_event_field *field,
1005 struct filter_pred *pred)
1008 filter_pred_fn_t fn = filter_pred_none;
1009 unsigned long long val;
1012 pred->offset = field->offset;
1014 if (!is_legal_op(field, pred->op)) {
1015 parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
1019 if (field->filter_type == FILTER_COMM) {
1020 filter_build_regex(pred);
1021 fn = filter_pred_comm;
1022 pred->regex.field_len = TASK_COMM_LEN;
1023 } else if (is_string_field(field)) {
1024 filter_build_regex(pred);
1026 if (field->filter_type == FILTER_STATIC_STRING) {
1027 fn = filter_pred_string;
1028 pred->regex.field_len = field->size;
1029 } else if (field->filter_type == FILTER_DYN_STRING)
1030 fn = filter_pred_strloc;
1032 fn = filter_pred_pchar;
1033 } else if (is_function_field(field)) {
1034 if (strcmp(field->name, "ip")) {
1035 parse_error(ps, FILT_ERR_IP_FIELD_ONLY, 0);
1039 if (field->is_signed)
1040 ret = kstrtoll(pred->regex.pattern, 0, &val);
1042 ret = kstrtoull(pred->regex.pattern, 0, &val);
1044 parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
1049 if (field->filter_type == FILTER_CPU)
1050 fn = filter_pred_cpu;
1052 fn = select_comparison_fn(pred->op, field->size,
1055 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1060 if (pred->op == OP_NE)
1067 static void parse_init(struct filter_parse_state *ps,
1068 struct filter_op *ops,
1071 memset(ps, '\0', sizeof(*ps));
1073 ps->infix.string = infix_string;
1074 ps->infix.cnt = strlen(infix_string);
1077 INIT_LIST_HEAD(&ps->opstack);
1078 INIT_LIST_HEAD(&ps->postfix);
1081 static char infix_next(struct filter_parse_state *ps)
1088 return ps->infix.string[ps->infix.tail++];
1091 static char infix_peek(struct filter_parse_state *ps)
1093 if (ps->infix.tail == strlen(ps->infix.string))
1096 return ps->infix.string[ps->infix.tail];
1099 static void infix_advance(struct filter_parse_state *ps)
1108 static inline int is_precedence_lower(struct filter_parse_state *ps,
1111 return ps->ops[a].precedence < ps->ops[b].precedence;
1114 static inline int is_op_char(struct filter_parse_state *ps, char c)
1118 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1119 if (ps->ops[i].string[0] == c)
1126 static int infix_get_op(struct filter_parse_state *ps, char firstc)
1128 char nextc = infix_peek(ps);
1136 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1137 if (!strcmp(opstr, ps->ops[i].string)) {
1139 return ps->ops[i].id;
1145 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1146 if (!strcmp(opstr, ps->ops[i].string))
1147 return ps->ops[i].id;
1153 static inline void clear_operand_string(struct filter_parse_state *ps)
1155 memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
1156 ps->operand.tail = 0;
1159 static inline int append_operand_char(struct filter_parse_state *ps, char c)
1161 if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
1164 ps->operand.string[ps->operand.tail++] = c;
1169 static int filter_opstack_push(struct filter_parse_state *ps, int op)
1171 struct opstack_op *opstack_op;
1173 opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
1177 opstack_op->op = op;
1178 list_add(&opstack_op->list, &ps->opstack);
1183 static int filter_opstack_empty(struct filter_parse_state *ps)
1185 return list_empty(&ps->opstack);
1188 static int filter_opstack_top(struct filter_parse_state *ps)
1190 struct opstack_op *opstack_op;
1192 if (filter_opstack_empty(ps))
1195 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1197 return opstack_op->op;
1200 static int filter_opstack_pop(struct filter_parse_state *ps)
1202 struct opstack_op *opstack_op;
1205 if (filter_opstack_empty(ps))
1208 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1209 op = opstack_op->op;
1210 list_del(&opstack_op->list);
1217 static void filter_opstack_clear(struct filter_parse_state *ps)
1219 while (!filter_opstack_empty(ps))
1220 filter_opstack_pop(ps);
1223 static char *curr_operand(struct filter_parse_state *ps)
1225 return ps->operand.string;
1228 static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
1230 struct postfix_elt *elt;
1232 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1237 elt->operand = kstrdup(operand, GFP_KERNEL);
1238 if (!elt->operand) {
1243 list_add_tail(&elt->list, &ps->postfix);
1248 static int postfix_append_op(struct filter_parse_state *ps, int op)
1250 struct postfix_elt *elt;
1252 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1257 elt->operand = NULL;
1259 list_add_tail(&elt->list, &ps->postfix);
1264 static void postfix_clear(struct filter_parse_state *ps)
1266 struct postfix_elt *elt;
1268 while (!list_empty(&ps->postfix)) {
1269 elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
1270 list_del(&elt->list);
1271 kfree(elt->operand);
1276 static int filter_parse(struct filter_parse_state *ps)
1282 while ((ch = infix_next(ps))) {
1294 if (is_op_char(ps, ch)) {
1295 op = infix_get_op(ps, ch);
1296 if (op == OP_NONE) {
1297 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1301 if (strlen(curr_operand(ps))) {
1302 postfix_append_operand(ps, curr_operand(ps));
1303 clear_operand_string(ps);
1306 while (!filter_opstack_empty(ps)) {
1307 top_op = filter_opstack_top(ps);
1308 if (!is_precedence_lower(ps, top_op, op)) {
1309 top_op = filter_opstack_pop(ps);
1310 postfix_append_op(ps, top_op);
1316 filter_opstack_push(ps, op);
1321 filter_opstack_push(ps, OP_OPEN_PAREN);
1326 if (strlen(curr_operand(ps))) {
1327 postfix_append_operand(ps, curr_operand(ps));
1328 clear_operand_string(ps);
1331 top_op = filter_opstack_pop(ps);
1332 while (top_op != OP_NONE) {
1333 if (top_op == OP_OPEN_PAREN)
1335 postfix_append_op(ps, top_op);
1336 top_op = filter_opstack_pop(ps);
1338 if (top_op == OP_NONE) {
1339 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1345 if (append_operand_char(ps, ch)) {
1346 parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
1351 if (strlen(curr_operand(ps)))
1352 postfix_append_operand(ps, curr_operand(ps));
1354 while (!filter_opstack_empty(ps)) {
1355 top_op = filter_opstack_pop(ps);
1356 if (top_op == OP_NONE)
1358 if (top_op == OP_OPEN_PAREN) {
1359 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1362 postfix_append_op(ps, top_op);
1368 static struct filter_pred *create_pred(struct filter_parse_state *ps,
1369 struct trace_event_call *call,
1370 int op, char *operand1, char *operand2)
1372 struct ftrace_event_field *field;
1373 static struct filter_pred pred;
1375 memset(&pred, 0, sizeof(pred));
1378 if (op == OP_AND || op == OP_OR)
1381 if (!operand1 || !operand2) {
1382 parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
1386 field = trace_find_event_field(call, operand1);
1388 parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
1392 strcpy(pred.regex.pattern, operand2);
1393 pred.regex.len = strlen(pred.regex.pattern);
1395 return init_pred(ps, field, &pred) ? NULL : &pred;
1398 static int check_preds(struct filter_parse_state *ps)
1400 int n_normal_preds = 0, n_logical_preds = 0;
1401 struct postfix_elt *elt;
1404 list_for_each_entry(elt, &ps->postfix, list) {
1405 if (elt->op == OP_NONE) {
1410 if (elt->op == OP_AND || elt->op == OP_OR) {
1415 if (elt->op != OP_NOT)
1418 /* all ops should have operands */
1423 if (cnt != 1 || !n_normal_preds || n_logical_preds >= n_normal_preds) {
1424 parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
1431 static int count_preds(struct filter_parse_state *ps)
1433 struct postfix_elt *elt;
1436 list_for_each_entry(elt, &ps->postfix, list) {
1437 if (elt->op == OP_NONE)
1445 struct check_pred_data {
1450 static int check_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1451 int *err, void *data)
1453 struct check_pred_data *d = data;
1455 if (WARN_ON(d->count++ > d->max)) {
1457 return WALK_PRED_ABORT;
1459 return WALK_PRED_DEFAULT;
1463 * The tree is walked at filtering of an event. If the tree is not correctly
1464 * built, it may cause an infinite loop. Check here that the tree does
1467 static int check_pred_tree(struct event_filter *filter,
1468 struct filter_pred *root)
1470 struct check_pred_data data = {
1472 * The max that we can hit a node is three times.
1473 * Once going down, once coming up from left, and
1474 * once coming up from right. This is more than enough
1475 * since leafs are only hit a single time.
1477 .max = 3 * filter->n_preds,
1481 return walk_pred_tree(filter->preds, root,
1482 check_pred_tree_cb, &data);
1485 static int count_leafs_cb(enum move_type move, struct filter_pred *pred,
1486 int *err, void *data)
1490 if ((move == MOVE_DOWN) &&
1491 (pred->left == FILTER_PRED_INVALID))
1494 return WALK_PRED_DEFAULT;
1497 static int count_leafs(struct filter_pred *preds, struct filter_pred *root)
1501 ret = walk_pred_tree(preds, root, count_leafs_cb, &count);
1506 struct fold_pred_data {
1507 struct filter_pred *root;
1512 static int fold_pred_cb(enum move_type move, struct filter_pred *pred,
1513 int *err, void *data)
1515 struct fold_pred_data *d = data;
1516 struct filter_pred *root = d->root;
1518 if (move != MOVE_DOWN)
1519 return WALK_PRED_DEFAULT;
1520 if (pred->left != FILTER_PRED_INVALID)
1521 return WALK_PRED_DEFAULT;
1523 if (WARN_ON(d->count == d->children)) {
1525 return WALK_PRED_ABORT;
1528 pred->index &= ~FILTER_PRED_FOLD;
1529 root->ops[d->count++] = pred->index;
1530 return WALK_PRED_DEFAULT;
1533 static int fold_pred(struct filter_pred *preds, struct filter_pred *root)
1535 struct fold_pred_data data = {
1541 /* No need to keep the fold flag */
1542 root->index &= ~FILTER_PRED_FOLD;
1544 /* If the root is a leaf then do nothing */
1545 if (root->left == FILTER_PRED_INVALID)
1548 /* count the children */
1549 children = count_leafs(preds, &preds[root->left]);
1550 children += count_leafs(preds, &preds[root->right]);
1552 root->ops = kcalloc(children, sizeof(*root->ops), GFP_KERNEL);
1556 root->val = children;
1557 data.children = children;
1558 return walk_pred_tree(preds, root, fold_pred_cb, &data);
1561 static int fold_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1562 int *err, void *data)
1564 struct filter_pred *preds = data;
1566 if (move != MOVE_DOWN)
1567 return WALK_PRED_DEFAULT;
1568 if (!(pred->index & FILTER_PRED_FOLD))
1569 return WALK_PRED_DEFAULT;
1571 *err = fold_pred(preds, pred);
1573 return WALK_PRED_ABORT;
1575 /* eveyrhing below is folded, continue with parent */
1576 return WALK_PRED_PARENT;
1580 * To optimize the processing of the ops, if we have several "ors" or
1581 * "ands" together, we can put them in an array and process them all
1582 * together speeding up the filter logic.
1584 static int fold_pred_tree(struct event_filter *filter,
1585 struct filter_pred *root)
1587 return walk_pred_tree(filter->preds, root, fold_pred_tree_cb,
1591 static int replace_preds(struct trace_event_call *call,
1592 struct event_filter *filter,
1593 struct filter_parse_state *ps,
1596 char *operand1 = NULL, *operand2 = NULL;
1597 struct filter_pred *pred;
1598 struct filter_pred *root;
1599 struct postfix_elt *elt;
1600 struct pred_stack stack = { }; /* init to NULL */
1604 n_preds = count_preds(ps);
1605 if (n_preds >= MAX_FILTER_PRED) {
1606 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1610 err = check_preds(ps);
1615 err = __alloc_pred_stack(&stack, n_preds);
1618 err = __alloc_preds(filter, n_preds);
1624 list_for_each_entry(elt, &ps->postfix, list) {
1625 if (elt->op == OP_NONE) {
1627 operand1 = elt->operand;
1629 operand2 = elt->operand;
1631 parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
1638 if (elt->op == OP_NOT) {
1639 if (!n_preds || operand1 || operand2) {
1640 parse_error(ps, FILT_ERR_ILLEGAL_NOT_OP, 0);
1645 filter->preds[n_preds - 1].not ^= 1;
1649 if (WARN_ON(n_preds++ == MAX_FILTER_PRED)) {
1650 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1655 pred = create_pred(ps, call, elt->op, operand1, operand2);
1662 err = filter_add_pred(ps, filter, pred, &stack);
1667 operand1 = operand2 = NULL;
1671 /* We should have one item left on the stack */
1672 pred = __pop_pred_stack(&stack);
1675 /* This item is where we start from in matching */
1677 /* Make sure the stack is empty */
1678 pred = __pop_pred_stack(&stack);
1679 if (WARN_ON(pred)) {
1681 filter->root = NULL;
1684 err = check_pred_tree(filter, root);
1688 /* Optimize the tree */
1689 err = fold_pred_tree(filter, root);
1693 /* We don't set root until we know it works */
1695 filter->root = root;
1700 __free_pred_stack(&stack);
1704 static inline void event_set_filtered_flag(struct trace_event_file *file)
1706 unsigned long old_flags = file->flags;
1708 file->flags |= EVENT_FILE_FL_FILTERED;
1710 if (old_flags != file->flags)
1711 trace_buffered_event_enable();
1714 static inline void event_set_filter(struct trace_event_file *file,
1715 struct event_filter *filter)
1717 rcu_assign_pointer(file->filter, filter);
1720 static inline void event_clear_filter(struct trace_event_file *file)
1722 RCU_INIT_POINTER(file->filter, NULL);
1726 event_set_no_set_filter_flag(struct trace_event_file *file)
1728 file->flags |= EVENT_FILE_FL_NO_SET_FILTER;
1732 event_clear_no_set_filter_flag(struct trace_event_file *file)
1734 file->flags &= ~EVENT_FILE_FL_NO_SET_FILTER;
1738 event_no_set_filter_flag(struct trace_event_file *file)
1740 if (file->flags & EVENT_FILE_FL_NO_SET_FILTER)
1746 struct filter_list {
1747 struct list_head list;
1748 struct event_filter *filter;
1751 static int replace_system_preds(struct trace_subsystem_dir *dir,
1752 struct trace_array *tr,
1753 struct filter_parse_state *ps,
1754 char *filter_string)
1756 struct trace_event_file *file;
1757 struct filter_list *filter_item;
1758 struct filter_list *tmp;
1759 LIST_HEAD(filter_list);
1763 list_for_each_entry(file, &tr->events, list) {
1764 if (file->system != dir)
1768 * Try to see if the filter can be applied
1769 * (filter arg is ignored on dry_run)
1771 err = replace_preds(file->event_call, NULL, ps, true);
1773 event_set_no_set_filter_flag(file);
1775 event_clear_no_set_filter_flag(file);
1778 list_for_each_entry(file, &tr->events, list) {
1779 struct event_filter *filter;
1781 if (file->system != dir)
1784 if (event_no_set_filter_flag(file))
1787 filter_item = kzalloc(sizeof(*filter_item), GFP_KERNEL);
1791 list_add_tail(&filter_item->list, &filter_list);
1793 filter_item->filter = __alloc_filter();
1794 if (!filter_item->filter)
1796 filter = filter_item->filter;
1798 /* Can only fail on no memory */
1799 err = replace_filter_string(filter, filter_string);
1803 err = replace_preds(file->event_call, filter, ps, false);
1805 filter_disable(file);
1806 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1807 append_filter_err(ps, filter);
1809 event_set_filtered_flag(file);
1811 * Regardless of if this returned an error, we still
1812 * replace the filter for the call.
1814 filter = event_filter(file);
1815 event_set_filter(file, filter_item->filter);
1816 filter_item->filter = filter;
1825 * The calls can still be using the old filters.
1826 * Do a synchronize_sched() to ensure all calls are
1827 * done with them before we free them.
1829 synchronize_sched();
1830 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1831 __free_filter(filter_item->filter);
1832 list_del(&filter_item->list);
1837 /* No call succeeded */
1838 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1839 list_del(&filter_item->list);
1842 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1845 /* If any call succeeded, we still need to sync */
1847 synchronize_sched();
1848 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1849 __free_filter(filter_item->filter);
1850 list_del(&filter_item->list);
1856 static int create_filter_start(char *filter_str, bool set_str,
1857 struct filter_parse_state **psp,
1858 struct event_filter **filterp)
1860 struct event_filter *filter;
1861 struct filter_parse_state *ps = NULL;
1864 WARN_ON_ONCE(*psp || *filterp);
1866 /* allocate everything, and if any fails, free all and fail */
1867 filter = __alloc_filter();
1868 if (filter && set_str)
1869 err = replace_filter_string(filter, filter_str);
1871 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1873 if (!filter || !ps || err) {
1875 __free_filter(filter);
1879 /* we're committed to creating a new filter */
1883 parse_init(ps, filter_ops, filter_str);
1884 err = filter_parse(ps);
1886 append_filter_err(ps, filter);
1890 static void create_filter_finish(struct filter_parse_state *ps)
1893 filter_opstack_clear(ps);
1900 * create_filter - create a filter for a trace_event_call
1901 * @call: trace_event_call to create a filter for
1902 * @filter_str: filter string
1903 * @set_str: remember @filter_str and enable detailed error in filter
1904 * @filterp: out param for created filter (always updated on return)
1906 * Creates a filter for @call with @filter_str. If @set_str is %true,
1907 * @filter_str is copied and recorded in the new filter.
1909 * On success, returns 0 and *@filterp points to the new filter. On
1910 * failure, returns -errno and *@filterp may point to %NULL or to a new
1911 * filter. In the latter case, the returned filter contains error
1912 * information if @set_str is %true and the caller is responsible for
1915 static int create_filter(struct trace_event_call *call,
1916 char *filter_str, bool set_str,
1917 struct event_filter **filterp)
1919 struct event_filter *filter = NULL;
1920 struct filter_parse_state *ps = NULL;
1923 err = create_filter_start(filter_str, set_str, &ps, &filter);
1925 err = replace_preds(call, filter, ps, false);
1927 append_filter_err(ps, filter);
1929 create_filter_finish(ps);
1935 int create_event_filter(struct trace_event_call *call,
1936 char *filter_str, bool set_str,
1937 struct event_filter **filterp)
1939 return create_filter(call, filter_str, set_str, filterp);
1943 * create_system_filter - create a filter for an event_subsystem
1944 * @system: event_subsystem to create a filter for
1945 * @filter_str: filter string
1946 * @filterp: out param for created filter (always updated on return)
1948 * Identical to create_filter() except that it creates a subsystem filter
1949 * and always remembers @filter_str.
1951 static int create_system_filter(struct trace_subsystem_dir *dir,
1952 struct trace_array *tr,
1953 char *filter_str, struct event_filter **filterp)
1955 struct event_filter *filter = NULL;
1956 struct filter_parse_state *ps = NULL;
1959 err = create_filter_start(filter_str, true, &ps, &filter);
1961 err = replace_system_preds(dir, tr, ps, filter_str);
1963 /* System filters just show a default message */
1964 kfree(filter->filter_string);
1965 filter->filter_string = NULL;
1967 append_filter_err(ps, filter);
1970 create_filter_finish(ps);
1976 /* caller must hold event_mutex */
1977 int apply_event_filter(struct trace_event_file *file, char *filter_string)
1979 struct trace_event_call *call = file->event_call;
1980 struct event_filter *filter;
1983 if (!strcmp(strstrip(filter_string), "0")) {
1984 filter_disable(file);
1985 filter = event_filter(file);
1990 event_clear_filter(file);
1992 /* Make sure the filter is not being used */
1993 synchronize_sched();
1994 __free_filter(filter);
1999 err = create_filter(call, filter_string, true, &filter);
2002 * Always swap the call filter with the new filter
2003 * even if there was an error. If there was an error
2004 * in the filter, we disable the filter and show the error
2008 struct event_filter *tmp;
2010 tmp = event_filter(file);
2012 event_set_filtered_flag(file);
2014 filter_disable(file);
2016 event_set_filter(file, filter);
2019 /* Make sure the call is done with the filter */
2020 synchronize_sched();
2028 int apply_subsystem_event_filter(struct trace_subsystem_dir *dir,
2029 char *filter_string)
2031 struct event_subsystem *system = dir->subsystem;
2032 struct trace_array *tr = dir->tr;
2033 struct event_filter *filter;
2036 mutex_lock(&event_mutex);
2038 /* Make sure the system still has events */
2039 if (!dir->nr_events) {
2044 if (!strcmp(strstrip(filter_string), "0")) {
2045 filter_free_subsystem_preds(dir, tr);
2046 remove_filter_string(system->filter);
2047 filter = system->filter;
2048 system->filter = NULL;
2049 /* Ensure all filters are no longer used */
2050 synchronize_sched();
2051 filter_free_subsystem_filters(dir, tr);
2052 __free_filter(filter);
2056 err = create_system_filter(dir, tr, filter_string, &filter);
2059 * No event actually uses the system filter
2060 * we can free it without synchronize_sched().
2062 __free_filter(system->filter);
2063 system->filter = filter;
2066 mutex_unlock(&event_mutex);
2071 #ifdef CONFIG_PERF_EVENTS
2073 void ftrace_profile_free_filter(struct perf_event *event)
2075 struct event_filter *filter = event->filter;
2077 event->filter = NULL;
2078 __free_filter(filter);
2081 struct function_filter_data {
2082 struct ftrace_ops *ops;
2087 #ifdef CONFIG_FUNCTION_TRACER
2089 ftrace_function_filter_re(char *buf, int len, int *count)
2093 str = kstrndup(buf, len, GFP_KERNEL);
2098 * The argv_split function takes white space
2099 * as a separator, so convert ',' into spaces.
2101 strreplace(str, ',', ' ');
2103 re = argv_split(GFP_KERNEL, str, count);
2108 static int ftrace_function_set_regexp(struct ftrace_ops *ops, int filter,
2109 int reset, char *re, int len)
2114 ret = ftrace_set_filter(ops, re, len, reset);
2116 ret = ftrace_set_notrace(ops, re, len, reset);
2121 static int __ftrace_function_set_filter(int filter, char *buf, int len,
2122 struct function_filter_data *data)
2124 int i, re_cnt, ret = -EINVAL;
2128 reset = filter ? &data->first_filter : &data->first_notrace;
2131 * The 'ip' field could have multiple filters set, separated
2132 * either by space or comma. We first cut the filter and apply
2133 * all pieces separatelly.
2135 re = ftrace_function_filter_re(buf, len, &re_cnt);
2139 for (i = 0; i < re_cnt; i++) {
2140 ret = ftrace_function_set_regexp(data->ops, filter, *reset,
2141 re[i], strlen(re[i]));
2153 static int ftrace_function_check_pred(struct filter_pred *pred, int leaf)
2155 struct ftrace_event_field *field = pred->field;
2159 * Check the leaf predicate for function trace, verify:
2160 * - only '==' and '!=' is used
2161 * - the 'ip' field is used
2163 if ((pred->op != OP_EQ) && (pred->op != OP_NE))
2166 if (strcmp(field->name, "ip"))
2170 * Check the non leaf predicate for function trace, verify:
2171 * - only '||' is used
2173 if (pred->op != OP_OR)
2180 static int ftrace_function_set_filter_cb(enum move_type move,
2181 struct filter_pred *pred,
2182 int *err, void *data)
2184 /* Checking the node is valid for function trace. */
2185 if ((move != MOVE_DOWN) ||
2186 (pred->left != FILTER_PRED_INVALID)) {
2187 *err = ftrace_function_check_pred(pred, 0);
2189 *err = ftrace_function_check_pred(pred, 1);
2191 return WALK_PRED_ABORT;
2193 *err = __ftrace_function_set_filter(pred->op == OP_EQ,
2194 pred->regex.pattern,
2199 return (*err) ? WALK_PRED_ABORT : WALK_PRED_DEFAULT;
2202 static int ftrace_function_set_filter(struct perf_event *event,
2203 struct event_filter *filter)
2205 struct function_filter_data data = {
2208 .ops = &event->ftrace_ops,
2211 return walk_pred_tree(filter->preds, filter->root,
2212 ftrace_function_set_filter_cb, &data);
2215 static int ftrace_function_set_filter(struct perf_event *event,
2216 struct event_filter *filter)
2220 #endif /* CONFIG_FUNCTION_TRACER */
2222 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
2226 struct event_filter *filter;
2227 struct trace_event_call *call;
2229 mutex_lock(&event_mutex);
2231 call = event->tp_event;
2241 err = create_filter(call, filter_str, false, &filter);
2245 if (ftrace_event_is_function(call))
2246 err = ftrace_function_set_filter(event, filter);
2248 event->filter = filter;
2251 if (err || ftrace_event_is_function(call))
2252 __free_filter(filter);
2255 mutex_unlock(&event_mutex);
2260 #endif /* CONFIG_PERF_EVENTS */
2262 #ifdef CONFIG_FTRACE_STARTUP_TEST
2264 #include <linux/types.h>
2265 #include <linux/tracepoint.h>
2267 #define CREATE_TRACE_POINTS
2268 #include "trace_events_filter_test.h"
2270 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2273 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2274 .e = ve, .f = vf, .g = vg, .h = vh }, \
2276 .not_visited = nvisit, \
2281 static struct test_filter_data_t {
2283 struct trace_event_raw_ftrace_test_filter rec;
2286 } test_filter_data[] = {
2287 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2288 "e == 1 && f == 1 && g == 1 && h == 1"
2289 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2290 DATA_REC(NO, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2291 DATA_REC(NO, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2293 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2294 "e == 1 || f == 1 || g == 1 || h == 1"
2295 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2296 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2297 DATA_REC(YES, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
2299 #define FILTER "(a == 1 || b == 1) && (c == 1 || d == 1) && " \
2300 "(e == 1 || f == 1) && (g == 1 || h == 1)"
2301 DATA_REC(NO, 0, 0, 1, 1, 1, 1, 1, 1, "dfh"),
2302 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2303 DATA_REC(YES, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2304 DATA_REC(NO, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2306 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2307 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2308 DATA_REC(YES, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2309 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2310 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2312 #define FILTER "(a == 1 && b == 1) && (c == 1 && d == 1) && " \
2313 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2314 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 0, "gh"),
2315 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2316 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, ""),
2318 #define FILTER "((a == 1 || b == 1) || (c == 1 || d == 1) || " \
2319 "(e == 1 || f == 1)) && (g == 1 || h == 1)"
2320 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 1, "bcdef"),
2321 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2322 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
2324 #define FILTER "((((((((a == 1) && (b == 1)) || (c == 1)) && (d == 1)) || " \
2325 "(e == 1)) && (f == 1)) || (g == 1)) && (h == 1))"
2326 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "ceg"),
2327 DATA_REC(NO, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2328 DATA_REC(NO, 1, 0, 1, 0, 1, 0, 1, 0, ""),
2330 #define FILTER "((((((((a == 1) || (b == 1)) && (c == 1)) || (d == 1)) && " \
2331 "(e == 1)) || (f == 1)) && (g == 1)) || (h == 1))"
2332 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "bdfh"),
2333 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2334 DATA_REC(YES, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2342 #define DATA_CNT (sizeof(test_filter_data)/sizeof(struct test_filter_data_t))
2344 static int test_pred_visited;
2346 static int test_pred_visited_fn(struct filter_pred *pred, void *event)
2348 struct ftrace_event_field *field = pred->field;
2350 test_pred_visited = 1;
2351 printk(KERN_INFO "\npred visited %s\n", field->name);
2355 static int test_walk_pred_cb(enum move_type move, struct filter_pred *pred,
2356 int *err, void *data)
2358 char *fields = data;
2360 if ((move == MOVE_DOWN) &&
2361 (pred->left == FILTER_PRED_INVALID)) {
2362 struct ftrace_event_field *field = pred->field;
2365 WARN(1, "all leafs should have field defined");
2366 return WALK_PRED_DEFAULT;
2368 if (!strchr(fields, *field->name))
2369 return WALK_PRED_DEFAULT;
2372 pred->fn = test_pred_visited_fn;
2374 return WALK_PRED_DEFAULT;
2377 static __init int ftrace_test_event_filter(void)
2381 printk(KERN_INFO "Testing ftrace filter: ");
2383 for (i = 0; i < DATA_CNT; i++) {
2384 struct event_filter *filter = NULL;
2385 struct test_filter_data_t *d = &test_filter_data[i];
2388 err = create_filter(&event_ftrace_test_filter, d->filter,
2392 "Failed to get filter for '%s', err %d\n",
2394 __free_filter(filter);
2399 * The preemption disabling is not really needed for self
2400 * tests, but the rcu dereference will complain without it.
2403 if (*d->not_visited)
2404 walk_pred_tree(filter->preds, filter->root,
2408 test_pred_visited = 0;
2409 err = filter_match_preds(filter, &d->rec);
2412 __free_filter(filter);
2414 if (test_pred_visited) {
2416 "Failed, unwanted pred visited for filter %s\n",
2421 if (err != d->match) {
2423 "Failed to match filter '%s', expected %d\n",
2424 d->filter, d->match);
2430 printk(KERN_CONT "OK\n");
2435 late_initcall(ftrace_test_event_filter);
2437 #endif /* CONFIG_FTRACE_STARTUP_TEST */