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)
692 if (file->event_call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
693 return file->event_call->filter;
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 struct trace_event_call *call = file->event_call;
831 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
832 call->flags &= ~TRACE_EVENT_FL_FILTERED;
834 file->flags &= ~EVENT_FILE_FL_FILTERED;
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 struct trace_event_call *call = file->event_call;
888 filter_disable(file);
889 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
890 remove_filter_string(call->filter);
892 remove_filter_string(file->filter);
895 static void filter_free_subsystem_preds(struct trace_subsystem_dir *dir,
896 struct trace_array *tr)
898 struct trace_event_file *file;
900 list_for_each_entry(file, &tr->events, list) {
901 if (file->system != dir)
903 __remove_filter(file);
907 static inline void __free_subsystem_filter(struct trace_event_file *file)
909 struct trace_event_call *call = file->event_call;
911 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER) {
912 __free_filter(call->filter);
915 __free_filter(file->filter);
920 static void filter_free_subsystem_filters(struct trace_subsystem_dir *dir,
921 struct trace_array *tr)
923 struct trace_event_file *file;
925 list_for_each_entry(file, &tr->events, list) {
926 if (file->system != dir)
928 __free_subsystem_filter(file);
932 static int filter_add_pred(struct filter_parse_state *ps,
933 struct event_filter *filter,
934 struct filter_pred *pred,
935 struct pred_stack *stack)
939 if (WARN_ON(filter->n_preds == filter->a_preds)) {
940 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
944 err = filter_set_pred(filter, filter->n_preds, stack, pred);
953 int filter_assign_type(const char *type)
955 if (strstr(type, "__data_loc") && strstr(type, "char"))
956 return FILTER_DYN_STRING;
958 if (strchr(type, '[') && strstr(type, "char"))
959 return FILTER_STATIC_STRING;
964 static bool is_legal_op(struct ftrace_event_field *field, int op)
966 if (is_string_field(field) &&
967 (op != OP_EQ && op != OP_NE && op != OP_GLOB))
969 if (!is_string_field(field) && op == OP_GLOB)
975 static filter_pred_fn_t select_comparison_fn(int op, int field_size,
978 filter_pred_fn_t fn = NULL;
980 switch (field_size) {
982 if (op == OP_EQ || op == OP_NE)
984 else if (field_is_signed)
985 fn = filter_pred_s64;
987 fn = filter_pred_u64;
990 if (op == OP_EQ || op == OP_NE)
992 else if (field_is_signed)
993 fn = filter_pred_s32;
995 fn = filter_pred_u32;
998 if (op == OP_EQ || op == OP_NE)
1000 else if (field_is_signed)
1001 fn = filter_pred_s16;
1003 fn = filter_pred_u16;
1006 if (op == OP_EQ || op == OP_NE)
1008 else if (field_is_signed)
1009 fn = filter_pred_s8;
1011 fn = filter_pred_u8;
1018 static int init_pred(struct filter_parse_state *ps,
1019 struct ftrace_event_field *field,
1020 struct filter_pred *pred)
1023 filter_pred_fn_t fn = filter_pred_none;
1024 unsigned long long val;
1027 pred->offset = field->offset;
1029 if (!is_legal_op(field, pred->op)) {
1030 parse_error(ps, FILT_ERR_ILLEGAL_FIELD_OP, 0);
1034 if (field->filter_type == FILTER_COMM) {
1035 filter_build_regex(pred);
1036 fn = filter_pred_comm;
1037 pred->regex.field_len = TASK_COMM_LEN;
1038 } else if (is_string_field(field)) {
1039 filter_build_regex(pred);
1041 if (field->filter_type == FILTER_STATIC_STRING) {
1042 fn = filter_pred_string;
1043 pred->regex.field_len = field->size;
1044 } else if (field->filter_type == FILTER_DYN_STRING)
1045 fn = filter_pred_strloc;
1047 fn = filter_pred_pchar;
1048 } else if (is_function_field(field)) {
1049 if (strcmp(field->name, "ip")) {
1050 parse_error(ps, FILT_ERR_IP_FIELD_ONLY, 0);
1054 if (field->is_signed)
1055 ret = kstrtoll(pred->regex.pattern, 0, &val);
1057 ret = kstrtoull(pred->regex.pattern, 0, &val);
1059 parse_error(ps, FILT_ERR_ILLEGAL_INTVAL, 0);
1064 if (field->filter_type == FILTER_CPU)
1065 fn = filter_pred_cpu;
1067 fn = select_comparison_fn(pred->op, field->size,
1070 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1075 if (pred->op == OP_NE)
1082 static void parse_init(struct filter_parse_state *ps,
1083 struct filter_op *ops,
1086 memset(ps, '\0', sizeof(*ps));
1088 ps->infix.string = infix_string;
1089 ps->infix.cnt = strlen(infix_string);
1092 INIT_LIST_HEAD(&ps->opstack);
1093 INIT_LIST_HEAD(&ps->postfix);
1096 static char infix_next(struct filter_parse_state *ps)
1103 return ps->infix.string[ps->infix.tail++];
1106 static char infix_peek(struct filter_parse_state *ps)
1108 if (ps->infix.tail == strlen(ps->infix.string))
1111 return ps->infix.string[ps->infix.tail];
1114 static void infix_advance(struct filter_parse_state *ps)
1123 static inline int is_precedence_lower(struct filter_parse_state *ps,
1126 return ps->ops[a].precedence < ps->ops[b].precedence;
1129 static inline int is_op_char(struct filter_parse_state *ps, char c)
1133 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1134 if (ps->ops[i].string[0] == c)
1141 static int infix_get_op(struct filter_parse_state *ps, char firstc)
1143 char nextc = infix_peek(ps);
1151 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1152 if (!strcmp(opstr, ps->ops[i].string)) {
1154 return ps->ops[i].id;
1160 for (i = 0; strcmp(ps->ops[i].string, "OP_NONE"); i++) {
1161 if (!strcmp(opstr, ps->ops[i].string))
1162 return ps->ops[i].id;
1168 static inline void clear_operand_string(struct filter_parse_state *ps)
1170 memset(ps->operand.string, '\0', MAX_FILTER_STR_VAL);
1171 ps->operand.tail = 0;
1174 static inline int append_operand_char(struct filter_parse_state *ps, char c)
1176 if (ps->operand.tail == MAX_FILTER_STR_VAL - 1)
1179 ps->operand.string[ps->operand.tail++] = c;
1184 static int filter_opstack_push(struct filter_parse_state *ps, int op)
1186 struct opstack_op *opstack_op;
1188 opstack_op = kmalloc(sizeof(*opstack_op), GFP_KERNEL);
1192 opstack_op->op = op;
1193 list_add(&opstack_op->list, &ps->opstack);
1198 static int filter_opstack_empty(struct filter_parse_state *ps)
1200 return list_empty(&ps->opstack);
1203 static int filter_opstack_top(struct filter_parse_state *ps)
1205 struct opstack_op *opstack_op;
1207 if (filter_opstack_empty(ps))
1210 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1212 return opstack_op->op;
1215 static int filter_opstack_pop(struct filter_parse_state *ps)
1217 struct opstack_op *opstack_op;
1220 if (filter_opstack_empty(ps))
1223 opstack_op = list_first_entry(&ps->opstack, struct opstack_op, list);
1224 op = opstack_op->op;
1225 list_del(&opstack_op->list);
1232 static void filter_opstack_clear(struct filter_parse_state *ps)
1234 while (!filter_opstack_empty(ps))
1235 filter_opstack_pop(ps);
1238 static char *curr_operand(struct filter_parse_state *ps)
1240 return ps->operand.string;
1243 static int postfix_append_operand(struct filter_parse_state *ps, char *operand)
1245 struct postfix_elt *elt;
1247 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1252 elt->operand = kstrdup(operand, GFP_KERNEL);
1253 if (!elt->operand) {
1258 list_add_tail(&elt->list, &ps->postfix);
1263 static int postfix_append_op(struct filter_parse_state *ps, int op)
1265 struct postfix_elt *elt;
1267 elt = kmalloc(sizeof(*elt), GFP_KERNEL);
1272 elt->operand = NULL;
1274 list_add_tail(&elt->list, &ps->postfix);
1279 static void postfix_clear(struct filter_parse_state *ps)
1281 struct postfix_elt *elt;
1283 while (!list_empty(&ps->postfix)) {
1284 elt = list_first_entry(&ps->postfix, struct postfix_elt, list);
1285 list_del(&elt->list);
1286 kfree(elt->operand);
1291 static int filter_parse(struct filter_parse_state *ps)
1297 while ((ch = infix_next(ps))) {
1309 if (is_op_char(ps, ch)) {
1310 op = infix_get_op(ps, ch);
1311 if (op == OP_NONE) {
1312 parse_error(ps, FILT_ERR_INVALID_OP, 0);
1316 if (strlen(curr_operand(ps))) {
1317 postfix_append_operand(ps, curr_operand(ps));
1318 clear_operand_string(ps);
1321 while (!filter_opstack_empty(ps)) {
1322 top_op = filter_opstack_top(ps);
1323 if (!is_precedence_lower(ps, top_op, op)) {
1324 top_op = filter_opstack_pop(ps);
1325 postfix_append_op(ps, top_op);
1331 filter_opstack_push(ps, op);
1336 filter_opstack_push(ps, OP_OPEN_PAREN);
1341 if (strlen(curr_operand(ps))) {
1342 postfix_append_operand(ps, curr_operand(ps));
1343 clear_operand_string(ps);
1346 top_op = filter_opstack_pop(ps);
1347 while (top_op != OP_NONE) {
1348 if (top_op == OP_OPEN_PAREN)
1350 postfix_append_op(ps, top_op);
1351 top_op = filter_opstack_pop(ps);
1353 if (top_op == OP_NONE) {
1354 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1360 if (append_operand_char(ps, ch)) {
1361 parse_error(ps, FILT_ERR_OPERAND_TOO_LONG, 0);
1366 if (strlen(curr_operand(ps)))
1367 postfix_append_operand(ps, curr_operand(ps));
1369 while (!filter_opstack_empty(ps)) {
1370 top_op = filter_opstack_pop(ps);
1371 if (top_op == OP_NONE)
1373 if (top_op == OP_OPEN_PAREN) {
1374 parse_error(ps, FILT_ERR_UNBALANCED_PAREN, 0);
1377 postfix_append_op(ps, top_op);
1383 static struct filter_pred *create_pred(struct filter_parse_state *ps,
1384 struct trace_event_call *call,
1385 int op, char *operand1, char *operand2)
1387 struct ftrace_event_field *field;
1388 static struct filter_pred pred;
1390 memset(&pred, 0, sizeof(pred));
1393 if (op == OP_AND || op == OP_OR)
1396 if (!operand1 || !operand2) {
1397 parse_error(ps, FILT_ERR_MISSING_FIELD, 0);
1401 field = trace_find_event_field(call, operand1);
1403 parse_error(ps, FILT_ERR_FIELD_NOT_FOUND, 0);
1407 strcpy(pred.regex.pattern, operand2);
1408 pred.regex.len = strlen(pred.regex.pattern);
1410 return init_pred(ps, field, &pred) ? NULL : &pred;
1413 static int check_preds(struct filter_parse_state *ps)
1415 int n_normal_preds = 0, n_logical_preds = 0;
1416 struct postfix_elt *elt;
1419 list_for_each_entry(elt, &ps->postfix, list) {
1420 if (elt->op == OP_NONE) {
1425 if (elt->op == OP_AND || elt->op == OP_OR) {
1430 if (elt->op != OP_NOT)
1433 /* all ops should have operands */
1438 if (cnt != 1 || !n_normal_preds || n_logical_preds >= n_normal_preds) {
1439 parse_error(ps, FILT_ERR_INVALID_FILTER, 0);
1446 static int count_preds(struct filter_parse_state *ps)
1448 struct postfix_elt *elt;
1451 list_for_each_entry(elt, &ps->postfix, list) {
1452 if (elt->op == OP_NONE)
1460 struct check_pred_data {
1465 static int check_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1466 int *err, void *data)
1468 struct check_pred_data *d = data;
1470 if (WARN_ON(d->count++ > d->max)) {
1472 return WALK_PRED_ABORT;
1474 return WALK_PRED_DEFAULT;
1478 * The tree is walked at filtering of an event. If the tree is not correctly
1479 * built, it may cause an infinite loop. Check here that the tree does
1482 static int check_pred_tree(struct event_filter *filter,
1483 struct filter_pred *root)
1485 struct check_pred_data data = {
1487 * The max that we can hit a node is three times.
1488 * Once going down, once coming up from left, and
1489 * once coming up from right. This is more than enough
1490 * since leafs are only hit a single time.
1492 .max = 3 * filter->n_preds,
1496 return walk_pred_tree(filter->preds, root,
1497 check_pred_tree_cb, &data);
1500 static int count_leafs_cb(enum move_type move, struct filter_pred *pred,
1501 int *err, void *data)
1505 if ((move == MOVE_DOWN) &&
1506 (pred->left == FILTER_PRED_INVALID))
1509 return WALK_PRED_DEFAULT;
1512 static int count_leafs(struct filter_pred *preds, struct filter_pred *root)
1516 ret = walk_pred_tree(preds, root, count_leafs_cb, &count);
1521 struct fold_pred_data {
1522 struct filter_pred *root;
1527 static int fold_pred_cb(enum move_type move, struct filter_pred *pred,
1528 int *err, void *data)
1530 struct fold_pred_data *d = data;
1531 struct filter_pred *root = d->root;
1533 if (move != MOVE_DOWN)
1534 return WALK_PRED_DEFAULT;
1535 if (pred->left != FILTER_PRED_INVALID)
1536 return WALK_PRED_DEFAULT;
1538 if (WARN_ON(d->count == d->children)) {
1540 return WALK_PRED_ABORT;
1543 pred->index &= ~FILTER_PRED_FOLD;
1544 root->ops[d->count++] = pred->index;
1545 return WALK_PRED_DEFAULT;
1548 static int fold_pred(struct filter_pred *preds, struct filter_pred *root)
1550 struct fold_pred_data data = {
1556 /* No need to keep the fold flag */
1557 root->index &= ~FILTER_PRED_FOLD;
1559 /* If the root is a leaf then do nothing */
1560 if (root->left == FILTER_PRED_INVALID)
1563 /* count the children */
1564 children = count_leafs(preds, &preds[root->left]);
1565 children += count_leafs(preds, &preds[root->right]);
1567 root->ops = kcalloc(children, sizeof(*root->ops), GFP_KERNEL);
1571 root->val = children;
1572 data.children = children;
1573 return walk_pred_tree(preds, root, fold_pred_cb, &data);
1576 static int fold_pred_tree_cb(enum move_type move, struct filter_pred *pred,
1577 int *err, void *data)
1579 struct filter_pred *preds = data;
1581 if (move != MOVE_DOWN)
1582 return WALK_PRED_DEFAULT;
1583 if (!(pred->index & FILTER_PRED_FOLD))
1584 return WALK_PRED_DEFAULT;
1586 *err = fold_pred(preds, pred);
1588 return WALK_PRED_ABORT;
1590 /* eveyrhing below is folded, continue with parent */
1591 return WALK_PRED_PARENT;
1595 * To optimize the processing of the ops, if we have several "ors" or
1596 * "ands" together, we can put them in an array and process them all
1597 * together speeding up the filter logic.
1599 static int fold_pred_tree(struct event_filter *filter,
1600 struct filter_pred *root)
1602 return walk_pred_tree(filter->preds, root, fold_pred_tree_cb,
1606 static int replace_preds(struct trace_event_call *call,
1607 struct event_filter *filter,
1608 struct filter_parse_state *ps,
1611 char *operand1 = NULL, *operand2 = NULL;
1612 struct filter_pred *pred;
1613 struct filter_pred *root;
1614 struct postfix_elt *elt;
1615 struct pred_stack stack = { }; /* init to NULL */
1619 n_preds = count_preds(ps);
1620 if (n_preds >= MAX_FILTER_PRED) {
1621 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1625 err = check_preds(ps);
1630 err = __alloc_pred_stack(&stack, n_preds);
1633 err = __alloc_preds(filter, n_preds);
1639 list_for_each_entry(elt, &ps->postfix, list) {
1640 if (elt->op == OP_NONE) {
1642 operand1 = elt->operand;
1644 operand2 = elt->operand;
1646 parse_error(ps, FILT_ERR_TOO_MANY_OPERANDS, 0);
1653 if (elt->op == OP_NOT) {
1654 if (!n_preds || operand1 || operand2) {
1655 parse_error(ps, FILT_ERR_ILLEGAL_NOT_OP, 0);
1660 filter->preds[n_preds - 1].not ^= 1;
1664 if (WARN_ON(n_preds++ == MAX_FILTER_PRED)) {
1665 parse_error(ps, FILT_ERR_TOO_MANY_PREDS, 0);
1670 pred = create_pred(ps, call, elt->op, operand1, operand2);
1677 err = filter_add_pred(ps, filter, pred, &stack);
1682 operand1 = operand2 = NULL;
1686 /* We should have one item left on the stack */
1687 pred = __pop_pred_stack(&stack);
1690 /* This item is where we start from in matching */
1692 /* Make sure the stack is empty */
1693 pred = __pop_pred_stack(&stack);
1694 if (WARN_ON(pred)) {
1696 filter->root = NULL;
1699 err = check_pred_tree(filter, root);
1703 /* Optimize the tree */
1704 err = fold_pred_tree(filter, root);
1708 /* We don't set root until we know it works */
1710 filter->root = root;
1715 __free_pred_stack(&stack);
1719 static inline void event_set_filtered_flag(struct trace_event_file *file)
1721 struct trace_event_call *call = file->event_call;
1723 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
1724 call->flags |= TRACE_EVENT_FL_FILTERED;
1726 file->flags |= EVENT_FILE_FL_FILTERED;
1729 static inline void event_set_filter(struct trace_event_file *file,
1730 struct event_filter *filter)
1732 struct trace_event_call *call = file->event_call;
1734 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
1735 rcu_assign_pointer(call->filter, filter);
1737 rcu_assign_pointer(file->filter, filter);
1740 static inline void event_clear_filter(struct trace_event_file *file)
1742 struct trace_event_call *call = file->event_call;
1744 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
1745 RCU_INIT_POINTER(call->filter, NULL);
1747 RCU_INIT_POINTER(file->filter, NULL);
1751 event_set_no_set_filter_flag(struct trace_event_file *file)
1753 struct trace_event_call *call = file->event_call;
1755 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
1756 call->flags |= TRACE_EVENT_FL_NO_SET_FILTER;
1758 file->flags |= EVENT_FILE_FL_NO_SET_FILTER;
1762 event_clear_no_set_filter_flag(struct trace_event_file *file)
1764 struct trace_event_call *call = file->event_call;
1766 if (call->flags & TRACE_EVENT_FL_USE_CALL_FILTER)
1767 call->flags &= ~TRACE_EVENT_FL_NO_SET_FILTER;
1769 file->flags &= ~EVENT_FILE_FL_NO_SET_FILTER;
1773 event_no_set_filter_flag(struct trace_event_file *file)
1775 struct trace_event_call *call = file->event_call;
1777 if (file->flags & EVENT_FILE_FL_NO_SET_FILTER)
1780 if ((call->flags & TRACE_EVENT_FL_USE_CALL_FILTER) &&
1781 (call->flags & TRACE_EVENT_FL_NO_SET_FILTER))
1787 struct filter_list {
1788 struct list_head list;
1789 struct event_filter *filter;
1792 static int replace_system_preds(struct trace_subsystem_dir *dir,
1793 struct trace_array *tr,
1794 struct filter_parse_state *ps,
1795 char *filter_string)
1797 struct trace_event_file *file;
1798 struct filter_list *filter_item;
1799 struct filter_list *tmp;
1800 LIST_HEAD(filter_list);
1804 list_for_each_entry(file, &tr->events, list) {
1805 if (file->system != dir)
1809 * Try to see if the filter can be applied
1810 * (filter arg is ignored on dry_run)
1812 err = replace_preds(file->event_call, NULL, ps, true);
1814 event_set_no_set_filter_flag(file);
1816 event_clear_no_set_filter_flag(file);
1819 list_for_each_entry(file, &tr->events, list) {
1820 struct event_filter *filter;
1822 if (file->system != dir)
1825 if (event_no_set_filter_flag(file))
1828 filter_item = kzalloc(sizeof(*filter_item), GFP_KERNEL);
1832 list_add_tail(&filter_item->list, &filter_list);
1834 filter_item->filter = __alloc_filter();
1835 if (!filter_item->filter)
1837 filter = filter_item->filter;
1839 /* Can only fail on no memory */
1840 err = replace_filter_string(filter, filter_string);
1844 err = replace_preds(file->event_call, filter, ps, false);
1846 filter_disable(file);
1847 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1848 append_filter_err(ps, filter);
1850 event_set_filtered_flag(file);
1852 * Regardless of if this returned an error, we still
1853 * replace the filter for the call.
1855 filter = event_filter(file);
1856 event_set_filter(file, filter_item->filter);
1857 filter_item->filter = filter;
1866 * The calls can still be using the old filters.
1867 * Do a synchronize_sched() to ensure all calls are
1868 * done with them before we free them.
1870 synchronize_sched();
1871 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1872 __free_filter(filter_item->filter);
1873 list_del(&filter_item->list);
1878 /* No call succeeded */
1879 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1880 list_del(&filter_item->list);
1883 parse_error(ps, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1886 /* If any call succeeded, we still need to sync */
1888 synchronize_sched();
1889 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1890 __free_filter(filter_item->filter);
1891 list_del(&filter_item->list);
1897 static int create_filter_start(char *filter_str, bool set_str,
1898 struct filter_parse_state **psp,
1899 struct event_filter **filterp)
1901 struct event_filter *filter;
1902 struct filter_parse_state *ps = NULL;
1905 WARN_ON_ONCE(*psp || *filterp);
1907 /* allocate everything, and if any fails, free all and fail */
1908 filter = __alloc_filter();
1909 if (filter && set_str)
1910 err = replace_filter_string(filter, filter_str);
1912 ps = kzalloc(sizeof(*ps), GFP_KERNEL);
1914 if (!filter || !ps || err) {
1916 __free_filter(filter);
1920 /* we're committed to creating a new filter */
1924 parse_init(ps, filter_ops, filter_str);
1925 err = filter_parse(ps);
1927 append_filter_err(ps, filter);
1931 static void create_filter_finish(struct filter_parse_state *ps)
1934 filter_opstack_clear(ps);
1941 * create_filter - create a filter for a trace_event_call
1942 * @call: trace_event_call to create a filter for
1943 * @filter_str: filter string
1944 * @set_str: remember @filter_str and enable detailed error in filter
1945 * @filterp: out param for created filter (always updated on return)
1947 * Creates a filter for @call with @filter_str. If @set_str is %true,
1948 * @filter_str is copied and recorded in the new filter.
1950 * On success, returns 0 and *@filterp points to the new filter. On
1951 * failure, returns -errno and *@filterp may point to %NULL or to a new
1952 * filter. In the latter case, the returned filter contains error
1953 * information if @set_str is %true and the caller is responsible for
1956 static int create_filter(struct trace_event_call *call,
1957 char *filter_str, bool set_str,
1958 struct event_filter **filterp)
1960 struct event_filter *filter = NULL;
1961 struct filter_parse_state *ps = NULL;
1964 err = create_filter_start(filter_str, set_str, &ps, &filter);
1966 err = replace_preds(call, filter, ps, false);
1968 append_filter_err(ps, filter);
1970 create_filter_finish(ps);
1976 int create_event_filter(struct trace_event_call *call,
1977 char *filter_str, bool set_str,
1978 struct event_filter **filterp)
1980 return create_filter(call, filter_str, set_str, filterp);
1984 * create_system_filter - create a filter for an event_subsystem
1985 * @system: event_subsystem to create a filter for
1986 * @filter_str: filter string
1987 * @filterp: out param for created filter (always updated on return)
1989 * Identical to create_filter() except that it creates a subsystem filter
1990 * and always remembers @filter_str.
1992 static int create_system_filter(struct trace_subsystem_dir *dir,
1993 struct trace_array *tr,
1994 char *filter_str, struct event_filter **filterp)
1996 struct event_filter *filter = NULL;
1997 struct filter_parse_state *ps = NULL;
2000 err = create_filter_start(filter_str, true, &ps, &filter);
2002 err = replace_system_preds(dir, tr, ps, filter_str);
2004 /* System filters just show a default message */
2005 kfree(filter->filter_string);
2006 filter->filter_string = NULL;
2008 append_filter_err(ps, filter);
2011 create_filter_finish(ps);
2017 /* caller must hold event_mutex */
2018 int apply_event_filter(struct trace_event_file *file, char *filter_string)
2020 struct trace_event_call *call = file->event_call;
2021 struct event_filter *filter;
2024 if (!strcmp(strstrip(filter_string), "0")) {
2025 filter_disable(file);
2026 filter = event_filter(file);
2031 event_clear_filter(file);
2033 /* Make sure the filter is not being used */
2034 synchronize_sched();
2035 __free_filter(filter);
2040 err = create_filter(call, filter_string, true, &filter);
2043 * Always swap the call filter with the new filter
2044 * even if there was an error. If there was an error
2045 * in the filter, we disable the filter and show the error
2049 struct event_filter *tmp;
2051 tmp = event_filter(file);
2053 event_set_filtered_flag(file);
2055 filter_disable(file);
2057 event_set_filter(file, filter);
2060 /* Make sure the call is done with the filter */
2061 synchronize_sched();
2069 int apply_subsystem_event_filter(struct trace_subsystem_dir *dir,
2070 char *filter_string)
2072 struct event_subsystem *system = dir->subsystem;
2073 struct trace_array *tr = dir->tr;
2074 struct event_filter *filter;
2077 mutex_lock(&event_mutex);
2079 /* Make sure the system still has events */
2080 if (!dir->nr_events) {
2085 if (!strcmp(strstrip(filter_string), "0")) {
2086 filter_free_subsystem_preds(dir, tr);
2087 remove_filter_string(system->filter);
2088 filter = system->filter;
2089 system->filter = NULL;
2090 /* Ensure all filters are no longer used */
2091 synchronize_sched();
2092 filter_free_subsystem_filters(dir, tr);
2093 __free_filter(filter);
2097 err = create_system_filter(dir, tr, filter_string, &filter);
2100 * No event actually uses the system filter
2101 * we can free it without synchronize_sched().
2103 __free_filter(system->filter);
2104 system->filter = filter;
2107 mutex_unlock(&event_mutex);
2112 #ifdef CONFIG_PERF_EVENTS
2114 void ftrace_profile_free_filter(struct perf_event *event)
2116 struct event_filter *filter = event->filter;
2118 event->filter = NULL;
2119 __free_filter(filter);
2122 struct function_filter_data {
2123 struct ftrace_ops *ops;
2128 #ifdef CONFIG_FUNCTION_TRACER
2130 ftrace_function_filter_re(char *buf, int len, int *count)
2134 str = kstrndup(buf, len, GFP_KERNEL);
2139 * The argv_split function takes white space
2140 * as a separator, so convert ',' into spaces.
2142 strreplace(str, ',', ' ');
2144 re = argv_split(GFP_KERNEL, str, count);
2149 static int ftrace_function_set_regexp(struct ftrace_ops *ops, int filter,
2150 int reset, char *re, int len)
2155 ret = ftrace_set_filter(ops, re, len, reset);
2157 ret = ftrace_set_notrace(ops, re, len, reset);
2162 static int __ftrace_function_set_filter(int filter, char *buf, int len,
2163 struct function_filter_data *data)
2165 int i, re_cnt, ret = -EINVAL;
2169 reset = filter ? &data->first_filter : &data->first_notrace;
2172 * The 'ip' field could have multiple filters set, separated
2173 * either by space or comma. We first cut the filter and apply
2174 * all pieces separatelly.
2176 re = ftrace_function_filter_re(buf, len, &re_cnt);
2180 for (i = 0; i < re_cnt; i++) {
2181 ret = ftrace_function_set_regexp(data->ops, filter, *reset,
2182 re[i], strlen(re[i]));
2194 static int ftrace_function_check_pred(struct filter_pred *pred, int leaf)
2196 struct ftrace_event_field *field = pred->field;
2200 * Check the leaf predicate for function trace, verify:
2201 * - only '==' and '!=' is used
2202 * - the 'ip' field is used
2204 if ((pred->op != OP_EQ) && (pred->op != OP_NE))
2207 if (strcmp(field->name, "ip"))
2211 * Check the non leaf predicate for function trace, verify:
2212 * - only '||' is used
2214 if (pred->op != OP_OR)
2221 static int ftrace_function_set_filter_cb(enum move_type move,
2222 struct filter_pred *pred,
2223 int *err, void *data)
2225 /* Checking the node is valid for function trace. */
2226 if ((move != MOVE_DOWN) ||
2227 (pred->left != FILTER_PRED_INVALID)) {
2228 *err = ftrace_function_check_pred(pred, 0);
2230 *err = ftrace_function_check_pred(pred, 1);
2232 return WALK_PRED_ABORT;
2234 *err = __ftrace_function_set_filter(pred->op == OP_EQ,
2235 pred->regex.pattern,
2240 return (*err) ? WALK_PRED_ABORT : WALK_PRED_DEFAULT;
2243 static int ftrace_function_set_filter(struct perf_event *event,
2244 struct event_filter *filter)
2246 struct function_filter_data data = {
2249 .ops = &event->ftrace_ops,
2252 return walk_pred_tree(filter->preds, filter->root,
2253 ftrace_function_set_filter_cb, &data);
2256 static int ftrace_function_set_filter(struct perf_event *event,
2257 struct event_filter *filter)
2261 #endif /* CONFIG_FUNCTION_TRACER */
2263 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
2267 struct event_filter *filter;
2268 struct trace_event_call *call;
2270 mutex_lock(&event_mutex);
2272 call = event->tp_event;
2282 err = create_filter(call, filter_str, false, &filter);
2286 if (ftrace_event_is_function(call))
2287 err = ftrace_function_set_filter(event, filter);
2289 event->filter = filter;
2292 if (err || ftrace_event_is_function(call))
2293 __free_filter(filter);
2296 mutex_unlock(&event_mutex);
2301 #endif /* CONFIG_PERF_EVENTS */
2303 #ifdef CONFIG_FTRACE_STARTUP_TEST
2305 #include <linux/types.h>
2306 #include <linux/tracepoint.h>
2308 #define CREATE_TRACE_POINTS
2309 #include "trace_events_filter_test.h"
2311 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2314 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2315 .e = ve, .f = vf, .g = vg, .h = vh }, \
2317 .not_visited = nvisit, \
2322 static struct test_filter_data_t {
2324 struct trace_event_raw_ftrace_test_filter rec;
2327 } test_filter_data[] = {
2328 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2329 "e == 1 && f == 1 && g == 1 && h == 1"
2330 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2331 DATA_REC(NO, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2332 DATA_REC(NO, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2334 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2335 "e == 1 || f == 1 || g == 1 || h == 1"
2336 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2337 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2338 DATA_REC(YES, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
2340 #define FILTER "(a == 1 || b == 1) && (c == 1 || d == 1) && " \
2341 "(e == 1 || f == 1) && (g == 1 || h == 1)"
2342 DATA_REC(NO, 0, 0, 1, 1, 1, 1, 1, 1, "dfh"),
2343 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2344 DATA_REC(YES, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2345 DATA_REC(NO, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2347 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2348 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2349 DATA_REC(YES, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2350 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2351 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2353 #define FILTER "(a == 1 && b == 1) && (c == 1 && d == 1) && " \
2354 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2355 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 0, "gh"),
2356 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2357 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, ""),
2359 #define FILTER "((a == 1 || b == 1) || (c == 1 || d == 1) || " \
2360 "(e == 1 || f == 1)) && (g == 1 || h == 1)"
2361 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 1, "bcdef"),
2362 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2363 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
2365 #define FILTER "((((((((a == 1) && (b == 1)) || (c == 1)) && (d == 1)) || " \
2366 "(e == 1)) && (f == 1)) || (g == 1)) && (h == 1))"
2367 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "ceg"),
2368 DATA_REC(NO, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2369 DATA_REC(NO, 1, 0, 1, 0, 1, 0, 1, 0, ""),
2371 #define FILTER "((((((((a == 1) || (b == 1)) && (c == 1)) || (d == 1)) && " \
2372 "(e == 1)) || (f == 1)) && (g == 1)) || (h == 1))"
2373 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "bdfh"),
2374 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2375 DATA_REC(YES, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2383 #define DATA_CNT (sizeof(test_filter_data)/sizeof(struct test_filter_data_t))
2385 static int test_pred_visited;
2387 static int test_pred_visited_fn(struct filter_pred *pred, void *event)
2389 struct ftrace_event_field *field = pred->field;
2391 test_pred_visited = 1;
2392 printk(KERN_INFO "\npred visited %s\n", field->name);
2396 static int test_walk_pred_cb(enum move_type move, struct filter_pred *pred,
2397 int *err, void *data)
2399 char *fields = data;
2401 if ((move == MOVE_DOWN) &&
2402 (pred->left == FILTER_PRED_INVALID)) {
2403 struct ftrace_event_field *field = pred->field;
2406 WARN(1, "all leafs should have field defined");
2407 return WALK_PRED_DEFAULT;
2409 if (!strchr(fields, *field->name))
2410 return WALK_PRED_DEFAULT;
2413 pred->fn = test_pred_visited_fn;
2415 return WALK_PRED_DEFAULT;
2418 static __init int ftrace_test_event_filter(void)
2422 printk(KERN_INFO "Testing ftrace filter: ");
2424 for (i = 0; i < DATA_CNT; i++) {
2425 struct event_filter *filter = NULL;
2426 struct test_filter_data_t *d = &test_filter_data[i];
2429 err = create_filter(&event_ftrace_test_filter, d->filter,
2433 "Failed to get filter for '%s', err %d\n",
2435 __free_filter(filter);
2440 * The preemption disabling is not really needed for self
2441 * tests, but the rcu dereference will complain without it.
2444 if (*d->not_visited)
2445 walk_pred_tree(filter->preds, filter->root,
2449 test_pred_visited = 0;
2450 err = filter_match_preds(filter, &d->rec);
2453 __free_filter(filter);
2455 if (test_pred_visited) {
2457 "Failed, unwanted pred visited for filter %s\n",
2462 if (err != d->match) {
2464 "Failed to match filter '%s', expected %d\n",
2465 d->filter, d->match);
2471 printk(KERN_CONT "OK\n");
2476 late_initcall(ftrace_test_event_filter);
2478 #endif /* CONFIG_FTRACE_STARTUP_TEST */