2 * trace_events_filter - generic event filtering
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 * Copyright (C) 2009 Tom Zanussi <tzanussi@gmail.com>
21 #include <linux/module.h>
22 #include <linux/ctype.h>
23 #include <linux/mutex.h>
24 #include <linux/perf_event.h>
25 #include <linux/slab.h>
28 #include "trace_output.h"
30 #define DEFAULT_SYS_FILTER_MESSAGE \
31 "### global filter ###\n" \
32 "# Use this to set filters for multiple events.\n" \
33 "# Only events with the given fields will be affected.\n" \
34 "# If no events are modified, an error message will be displayed here"
58 /* Order must be the same as enum filter_op_ids above */
59 static struct filter_op filter_ops
[] = {
70 { OP_NONE
, "OP_NONE", 0 },
71 { OP_OPEN_PAREN
, "(", 0 },
77 FILT_ERR_UNBALANCED_PAREN
,
78 FILT_ERR_TOO_MANY_OPERANDS
,
79 FILT_ERR_OPERAND_TOO_LONG
,
80 FILT_ERR_FIELD_NOT_FOUND
,
81 FILT_ERR_ILLEGAL_FIELD_OP
,
82 FILT_ERR_ILLEGAL_INTVAL
,
83 FILT_ERR_BAD_SUBSYS_FILTER
,
84 FILT_ERR_TOO_MANY_PREDS
,
85 FILT_ERR_MISSING_FIELD
,
86 FILT_ERR_INVALID_FILTER
,
87 FILT_ERR_IP_FIELD_ONLY
,
90 static char *err_text
[] = {
97 "Illegal operation for field type",
98 "Illegal integer value",
99 "Couldn't find or set field in one of a subsystem's events",
100 "Too many terms in predicate expression",
101 "Missing field name and/or value",
102 "Meaningless filter expression",
103 "Only 'ip' field is supported for function trace",
108 struct list_head list
;
114 struct list_head list
;
117 struct filter_parse_state
{
118 struct filter_op
*ops
;
119 struct list_head opstack
;
120 struct list_head postfix
;
131 char string
[MAX_FILTER_STR_VAL
];
138 struct filter_pred
**preds
;
142 #define DEFINE_COMPARISON_PRED(type) \
143 static int filter_pred_##type(struct filter_pred *pred, void *event) \
145 type *addr = (type *)(event + pred->offset); \
146 type val = (type)pred->val; \
149 switch (pred->op) { \
151 match = (*addr < val); \
154 match = (*addr <= val); \
157 match = (*addr > val); \
160 match = (*addr >= val); \
163 match = (*addr & val); \
172 #define DEFINE_EQUALITY_PRED(size) \
173 static int filter_pred_##size(struct filter_pred *pred, void *event) \
175 u##size *addr = (u##size *)(event + pred->offset); \
176 u##size val = (u##size)pred->val; \
179 match = (val == *addr) ^ pred->not; \
184 DEFINE_COMPARISON_PRED(s64
);
185 DEFINE_COMPARISON_PRED(u64
);
186 DEFINE_COMPARISON_PRED(s32
);
187 DEFINE_COMPARISON_PRED(u32
);
188 DEFINE_COMPARISON_PRED(s16
);
189 DEFINE_COMPARISON_PRED(u16
);
190 DEFINE_COMPARISON_PRED(s8
);
191 DEFINE_COMPARISON_PRED(u8
);
193 DEFINE_EQUALITY_PRED(64);
194 DEFINE_EQUALITY_PRED(32);
195 DEFINE_EQUALITY_PRED(16);
196 DEFINE_EQUALITY_PRED(8);
198 /* Filter predicate for fixed sized arrays of characters */
199 static int filter_pred_string(struct filter_pred
*pred
, void *event
)
201 char *addr
= (char *)(event
+ pred
->offset
);
204 cmp
= pred
->regex
.match(addr
, &pred
->regex
, pred
->regex
.field_len
);
206 match
= cmp
^ pred
->not;
211 /* Filter predicate for char * pointers */
212 static int filter_pred_pchar(struct filter_pred
*pred
, void *event
)
214 char **addr
= (char **)(event
+ pred
->offset
);
216 int len
= strlen(*addr
) + 1; /* including tailing '\0' */
218 cmp
= pred
->regex
.match(*addr
, &pred
->regex
, len
);
220 match
= cmp
^ pred
->not;
226 * Filter predicate for dynamic sized arrays of characters.
227 * These are implemented through a list of strings at the end
229 * Also each of these strings have a field in the entry which
230 * contains its offset from the beginning of the entry.
231 * We have then first to get this field, dereference it
232 * and add it to the address of the entry, and at last we have
233 * the address of the string.
235 static int filter_pred_strloc(struct filter_pred
*pred
, void *event
)
237 u32 str_item
= *(u32
*)(event
+ pred
->offset
);
238 int str_loc
= str_item
& 0xffff;
239 int str_len
= str_item
>> 16;
240 char *addr
= (char *)(event
+ str_loc
);
243 cmp
= pred
->regex
.match(addr
, &pred
->regex
, str_len
);
245 match
= cmp
^ pred
->not;
250 static int filter_pred_none(struct filter_pred
*pred
, void *event
)
256 * regex_match_foo - Basic regex callbacks
258 * @str: the string to be searched
259 * @r: the regex structure containing the pattern string
260 * @len: the length of the string to be searched (including '\0')
263 * - @str might not be NULL-terminated if it's of type DYN_STRING
267 static int regex_match_full(char *str
, struct regex
*r
, int len
)
269 if (strncmp(str
, r
->pattern
, len
) == 0)
274 static int regex_match_front(char *str
, struct regex
*r
, int len
)
276 if (strncmp(str
, r
->pattern
, r
->len
) == 0)
281 static int regex_match_middle(char *str
, struct regex
*r
, int len
)
283 if (strnstr(str
, r
->pattern
, len
))
288 static int regex_match_end(char *str
, struct regex
*r
, int len
)
290 int strlen
= len
- 1;
292 if (strlen
>= r
->len
&&
293 memcmp(str
+ strlen
- r
->len
, r
->pattern
, r
->len
) == 0)
299 * filter_parse_regex - parse a basic regex
300 * @buff: the raw regex
301 * @len: length of the regex
302 * @search: will point to the beginning of the string to compare
303 * @not: tell whether the match will have to be inverted
305 * This passes in a buffer containing a regex and this function will
306 * set search to point to the search part of the buffer and
307 * return the type of search it is (see enum above).
308 * This does modify buff.
311 * search returns the pointer to use for comparison.
312 * not returns 1 if buff started with a '!'
315 enum regex_type
filter_parse_regex(char *buff
, int len
, char **search
, int *not)
317 int type
= MATCH_FULL
;
320 if (buff
[0] == '!') {
329 for (i
= 0; i
< len
; i
++) {
330 if (buff
[i
] == '*') {
333 type
= MATCH_END_ONLY
;
335 if (type
== MATCH_END_ONLY
)
336 type
= MATCH_MIDDLE_ONLY
;
338 type
= MATCH_FRONT_ONLY
;
348 static void filter_build_regex(struct filter_pred
*pred
)
350 struct regex
*r
= &pred
->regex
;
352 enum regex_type type
= MATCH_FULL
;
355 if (pred
->op
== OP_GLOB
) {
356 type
= filter_parse_regex(r
->pattern
, r
->len
, &search
, ¬);
357 r
->len
= strlen(search
);
358 memmove(r
->pattern
, search
, r
->len
+1);
363 r
->match
= regex_match_full
;
365 case MATCH_FRONT_ONLY
:
366 r
->match
= regex_match_front
;
368 case MATCH_MIDDLE_ONLY
:
369 r
->match
= regex_match_middle
;
372 r
->match
= regex_match_end
;
385 static struct filter_pred
*
386 get_pred_parent(struct filter_pred
*pred
, struct filter_pred
*preds
,
387 int index
, enum move_type
*move
)
389 if (pred
->parent
& FILTER_PRED_IS_RIGHT
)
390 *move
= MOVE_UP_FROM_RIGHT
;
392 *move
= MOVE_UP_FROM_LEFT
;
393 pred
= &preds
[pred
->parent
& ~FILTER_PRED_IS_RIGHT
];
404 typedef int (*filter_pred_walkcb_t
) (enum move_type move
,
405 struct filter_pred
*pred
,
406 int *err
, void *data
);
408 static int walk_pred_tree(struct filter_pred
*preds
,
409 struct filter_pred
*root
,
410 filter_pred_walkcb_t cb
, void *data
)
412 struct filter_pred
*pred
= root
;
413 enum move_type move
= MOVE_DOWN
;
422 ret
= cb(move
, pred
, &err
, data
);
423 if (ret
== WALK_PRED_ABORT
)
425 if (ret
== WALK_PRED_PARENT
)
430 if (pred
->left
!= FILTER_PRED_INVALID
) {
431 pred
= &preds
[pred
->left
];
435 case MOVE_UP_FROM_LEFT
:
436 pred
= &preds
[pred
->right
];
439 case MOVE_UP_FROM_RIGHT
:
443 pred
= get_pred_parent(pred
, preds
,
456 * A series of AND or ORs where found together. Instead of
457 * climbing up and down the tree branches, an array of the
458 * ops were made in order of checks. We can just move across
459 * the array and short circuit if needed.
461 static int process_ops(struct filter_pred
*preds
,
462 struct filter_pred
*op
, void *rec
)
464 struct filter_pred
*pred
;
470 * Micro-optimization: We set type to true if op
471 * is an OR and false otherwise (AND). Then we
472 * just need to test if the match is equal to
473 * the type, and if it is, we can short circuit the
474 * rest of the checks:
476 * if ((match && op->op == OP_OR) ||
477 * (!match && op->op == OP_AND))
480 type
= op
->op
== OP_OR
;
482 for (i
= 0; i
< op
->val
; i
++) {
483 pred
= &preds
[op
->ops
[i
]];
484 if (!WARN_ON_ONCE(!pred
->fn
))
485 match
= pred
->fn(pred
, rec
);
492 struct filter_match_preds_data
{
493 struct filter_pred
*preds
;
498 static int filter_match_preds_cb(enum move_type move
, struct filter_pred
*pred
,
499 int *err
, void *data
)
501 struct filter_match_preds_data
*d
= data
;
506 /* only AND and OR have children */
507 if (pred
->left
!= FILTER_PRED_INVALID
) {
508 /* If ops is set, then it was folded. */
510 return WALK_PRED_DEFAULT
;
511 /* We can treat folded ops as a leaf node */
512 d
->match
= process_ops(d
->preds
, pred
, d
->rec
);
514 if (!WARN_ON_ONCE(!pred
->fn
))
515 d
->match
= pred
->fn(pred
, d
->rec
);
518 return WALK_PRED_PARENT
;
519 case MOVE_UP_FROM_LEFT
:
521 * Check for short circuits.
523 * Optimization: !!match == (pred->op == OP_OR)
525 * if ((match && pred->op == OP_OR) ||
526 * (!match && pred->op == OP_AND))
528 if (!!d
->match
== (pred
->op
== OP_OR
))
529 return WALK_PRED_PARENT
;
531 case MOVE_UP_FROM_RIGHT
:
535 return WALK_PRED_DEFAULT
;
538 /* return 1 if event matches, 0 otherwise (discard) */
539 int filter_match_preds(struct event_filter
*filter
, void *rec
)
541 struct filter_pred
*preds
;
542 struct filter_pred
*root
;
543 struct filter_match_preds_data data
= {
544 /* match is currently meaningless */
550 /* no filter is considered a match */
554 n_preds
= filter
->n_preds
;
559 * n_preds, root and filter->preds are protect with preemption disabled.
561 root
= rcu_dereference_sched(filter
->root
);
565 data
.preds
= preds
= rcu_dereference_sched(filter
->preds
);
566 ret
= walk_pred_tree(preds
, root
, filter_match_preds_cb
, &data
);
570 EXPORT_SYMBOL_GPL(filter_match_preds
);
572 static void parse_error(struct filter_parse_state
*ps
, int err
, int pos
)
575 ps
->lasterr_pos
= pos
;
578 static void remove_filter_string(struct event_filter
*filter
)
583 kfree(filter
->filter_string
);
584 filter
->filter_string
= NULL
;
587 static int replace_filter_string(struct event_filter
*filter
,
590 kfree(filter
->filter_string
);
591 filter
->filter_string
= kstrdup(filter_string
, GFP_KERNEL
);
592 if (!filter
->filter_string
)
598 static int append_filter_string(struct event_filter
*filter
,
602 char *new_filter_string
;
604 BUG_ON(!filter
->filter_string
);
605 newlen
= strlen(filter
->filter_string
) + strlen(string
) + 1;
606 new_filter_string
= kmalloc(newlen
, GFP_KERNEL
);
607 if (!new_filter_string
)
610 strcpy(new_filter_string
, filter
->filter_string
);
611 strcat(new_filter_string
, string
);
612 kfree(filter
->filter_string
);
613 filter
->filter_string
= new_filter_string
;
618 static void append_filter_err(struct filter_parse_state
*ps
,
619 struct event_filter
*filter
)
621 int pos
= ps
->lasterr_pos
;
624 buf
= (char *)__get_free_page(GFP_TEMPORARY
);
628 append_filter_string(filter
, "\n");
629 memset(buf
, ' ', PAGE_SIZE
);
630 if (pos
> PAGE_SIZE
- 128)
633 pbuf
= &buf
[pos
] + 1;
635 sprintf(pbuf
, "\nparse_error: %s\n", err_text
[ps
->lasterr
]);
636 append_filter_string(filter
, buf
);
637 free_page((unsigned long) buf
);
640 static inline struct event_filter
*event_filter(struct ftrace_event_file
*file
)
642 if (file
->event_call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
643 return file
->event_call
->filter
;
648 /* caller must hold event_mutex */
649 void print_event_filter(struct ftrace_event_file
*file
, struct trace_seq
*s
)
651 struct event_filter
*filter
= event_filter(file
);
653 if (filter
&& filter
->filter_string
)
654 trace_seq_printf(s
, "%s\n", filter
->filter_string
);
656 trace_seq_puts(s
, "none\n");
659 void print_subsystem_event_filter(struct event_subsystem
*system
,
662 struct event_filter
*filter
;
664 mutex_lock(&event_mutex
);
665 filter
= system
->filter
;
666 if (filter
&& filter
->filter_string
)
667 trace_seq_printf(s
, "%s\n", filter
->filter_string
);
669 trace_seq_puts(s
, DEFAULT_SYS_FILTER_MESSAGE
"\n");
670 mutex_unlock(&event_mutex
);
673 static int __alloc_pred_stack(struct pred_stack
*stack
, int n_preds
)
675 stack
->preds
= kcalloc(n_preds
+ 1, sizeof(*stack
->preds
), GFP_KERNEL
);
678 stack
->index
= n_preds
;
682 static void __free_pred_stack(struct pred_stack
*stack
)
688 static int __push_pred_stack(struct pred_stack
*stack
,
689 struct filter_pred
*pred
)
691 int index
= stack
->index
;
693 if (WARN_ON(index
== 0))
696 stack
->preds
[--index
] = pred
;
697 stack
->index
= index
;
701 static struct filter_pred
*
702 __pop_pred_stack(struct pred_stack
*stack
)
704 struct filter_pred
*pred
;
705 int index
= stack
->index
;
707 pred
= stack
->preds
[index
++];
711 stack
->index
= index
;
715 static int filter_set_pred(struct event_filter
*filter
,
717 struct pred_stack
*stack
,
718 struct filter_pred
*src
)
720 struct filter_pred
*dest
= &filter
->preds
[idx
];
721 struct filter_pred
*left
;
722 struct filter_pred
*right
;
727 if (dest
->op
== OP_OR
|| dest
->op
== OP_AND
) {
728 right
= __pop_pred_stack(stack
);
729 left
= __pop_pred_stack(stack
);
733 * If both children can be folded
734 * and they are the same op as this op or a leaf,
735 * then this op can be folded.
737 if (left
->index
& FILTER_PRED_FOLD
&&
738 (left
->op
== dest
->op
||
739 left
->left
== FILTER_PRED_INVALID
) &&
740 right
->index
& FILTER_PRED_FOLD
&&
741 (right
->op
== dest
->op
||
742 right
->left
== FILTER_PRED_INVALID
))
743 dest
->index
|= FILTER_PRED_FOLD
;
745 dest
->left
= left
->index
& ~FILTER_PRED_FOLD
;
746 dest
->right
= right
->index
& ~FILTER_PRED_FOLD
;
747 left
->parent
= dest
->index
& ~FILTER_PRED_FOLD
;
748 right
->parent
= dest
->index
| FILTER_PRED_IS_RIGHT
;
751 * Make dest->left invalid to be used as a quick
752 * way to know this is a leaf node.
754 dest
->left
= FILTER_PRED_INVALID
;
756 /* All leafs allow folding the parent ops. */
757 dest
->index
|= FILTER_PRED_FOLD
;
760 return __push_pred_stack(stack
, dest
);
763 static void __free_preds(struct event_filter
*filter
)
768 for (i
= 0; i
< filter
->n_preds
; i
++)
769 kfree(filter
->preds
[i
].ops
);
770 kfree(filter
->preds
);
771 filter
->preds
= NULL
;
777 static void filter_disable(struct ftrace_event_file
*file
)
779 struct ftrace_event_call
*call
= file
->event_call
;
781 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
782 call
->flags
&= ~TRACE_EVENT_FL_FILTERED
;
784 file
->flags
&= ~FTRACE_EVENT_FL_FILTERED
;
787 static void __free_filter(struct event_filter
*filter
)
792 __free_preds(filter
);
793 kfree(filter
->filter_string
);
797 void free_event_filter(struct event_filter
*filter
)
799 __free_filter(filter
);
802 static struct event_filter
*__alloc_filter(void)
804 struct event_filter
*filter
;
806 filter
= kzalloc(sizeof(*filter
), GFP_KERNEL
);
810 static int __alloc_preds(struct event_filter
*filter
, int n_preds
)
812 struct filter_pred
*pred
;
816 __free_preds(filter
);
818 filter
->preds
= kcalloc(n_preds
, sizeof(*filter
->preds
), GFP_KERNEL
);
823 filter
->a_preds
= n_preds
;
826 for (i
= 0; i
< n_preds
; i
++) {
827 pred
= &filter
->preds
[i
];
828 pred
->fn
= filter_pred_none
;
834 static inline void __remove_filter(struct ftrace_event_file
*file
)
836 struct ftrace_event_call
*call
= file
->event_call
;
838 filter_disable(file
);
839 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
840 remove_filter_string(call
->filter
);
842 remove_filter_string(file
->filter
);
845 static void filter_free_subsystem_preds(struct ftrace_subsystem_dir
*dir
,
846 struct trace_array
*tr
)
848 struct ftrace_event_file
*file
;
850 list_for_each_entry(file
, &tr
->events
, list
) {
851 if (file
->system
!= dir
)
853 __remove_filter(file
);
857 static inline void __free_subsystem_filter(struct ftrace_event_file
*file
)
859 struct ftrace_event_call
*call
= file
->event_call
;
861 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
) {
862 __free_filter(call
->filter
);
865 __free_filter(file
->filter
);
870 static void filter_free_subsystem_filters(struct ftrace_subsystem_dir
*dir
,
871 struct trace_array
*tr
)
873 struct ftrace_event_file
*file
;
875 list_for_each_entry(file
, &tr
->events
, list
) {
876 if (file
->system
!= dir
)
878 __free_subsystem_filter(file
);
882 static int filter_add_pred(struct filter_parse_state
*ps
,
883 struct event_filter
*filter
,
884 struct filter_pred
*pred
,
885 struct pred_stack
*stack
)
889 if (WARN_ON(filter
->n_preds
== filter
->a_preds
)) {
890 parse_error(ps
, FILT_ERR_TOO_MANY_PREDS
, 0);
894 err
= filter_set_pred(filter
, filter
->n_preds
, stack
, pred
);
903 int filter_assign_type(const char *type
)
905 if (strstr(type
, "__data_loc") && strstr(type
, "char"))
906 return FILTER_DYN_STRING
;
908 if (strchr(type
, '[') && strstr(type
, "char"))
909 return FILTER_STATIC_STRING
;
914 static bool is_function_field(struct ftrace_event_field
*field
)
916 return field
->filter_type
== FILTER_TRACE_FN
;
919 static bool is_string_field(struct ftrace_event_field
*field
)
921 return field
->filter_type
== FILTER_DYN_STRING
||
922 field
->filter_type
== FILTER_STATIC_STRING
||
923 field
->filter_type
== FILTER_PTR_STRING
;
926 static int is_legal_op(struct ftrace_event_field
*field
, int op
)
928 if (is_string_field(field
) &&
929 (op
!= OP_EQ
&& op
!= OP_NE
&& op
!= OP_GLOB
))
931 if (!is_string_field(field
) && op
== OP_GLOB
)
937 static filter_pred_fn_t
select_comparison_fn(int op
, int field_size
,
940 filter_pred_fn_t fn
= NULL
;
942 switch (field_size
) {
944 if (op
== OP_EQ
|| op
== OP_NE
)
946 else if (field_is_signed
)
947 fn
= filter_pred_s64
;
949 fn
= filter_pred_u64
;
952 if (op
== OP_EQ
|| op
== OP_NE
)
954 else if (field_is_signed
)
955 fn
= filter_pred_s32
;
957 fn
= filter_pred_u32
;
960 if (op
== OP_EQ
|| op
== OP_NE
)
962 else if (field_is_signed
)
963 fn
= filter_pred_s16
;
965 fn
= filter_pred_u16
;
968 if (op
== OP_EQ
|| op
== OP_NE
)
970 else if (field_is_signed
)
980 static int init_pred(struct filter_parse_state
*ps
,
981 struct ftrace_event_field
*field
,
982 struct filter_pred
*pred
)
985 filter_pred_fn_t fn
= filter_pred_none
;
986 unsigned long long val
;
989 pred
->offset
= field
->offset
;
991 if (!is_legal_op(field
, pred
->op
)) {
992 parse_error(ps
, FILT_ERR_ILLEGAL_FIELD_OP
, 0);
996 if (is_string_field(field
)) {
997 filter_build_regex(pred
);
999 if (field
->filter_type
== FILTER_STATIC_STRING
) {
1000 fn
= filter_pred_string
;
1001 pred
->regex
.field_len
= field
->size
;
1002 } else if (field
->filter_type
== FILTER_DYN_STRING
)
1003 fn
= filter_pred_strloc
;
1005 fn
= filter_pred_pchar
;
1006 } else if (is_function_field(field
)) {
1007 if (strcmp(field
->name
, "ip")) {
1008 parse_error(ps
, FILT_ERR_IP_FIELD_ONLY
, 0);
1012 if (field
->is_signed
)
1013 ret
= kstrtoll(pred
->regex
.pattern
, 0, &val
);
1015 ret
= kstrtoull(pred
->regex
.pattern
, 0, &val
);
1017 parse_error(ps
, FILT_ERR_ILLEGAL_INTVAL
, 0);
1022 fn
= select_comparison_fn(pred
->op
, field
->size
,
1025 parse_error(ps
, FILT_ERR_INVALID_OP
, 0);
1030 if (pred
->op
== OP_NE
)
1037 static void parse_init(struct filter_parse_state
*ps
,
1038 struct filter_op
*ops
,
1041 memset(ps
, '\0', sizeof(*ps
));
1043 ps
->infix
.string
= infix_string
;
1044 ps
->infix
.cnt
= strlen(infix_string
);
1047 INIT_LIST_HEAD(&ps
->opstack
);
1048 INIT_LIST_HEAD(&ps
->postfix
);
1051 static char infix_next(struct filter_parse_state
*ps
)
1055 return ps
->infix
.string
[ps
->infix
.tail
++];
1058 static char infix_peek(struct filter_parse_state
*ps
)
1060 if (ps
->infix
.tail
== strlen(ps
->infix
.string
))
1063 return ps
->infix
.string
[ps
->infix
.tail
];
1066 static void infix_advance(struct filter_parse_state
*ps
)
1072 static inline int is_precedence_lower(struct filter_parse_state
*ps
,
1075 return ps
->ops
[a
].precedence
< ps
->ops
[b
].precedence
;
1078 static inline int is_op_char(struct filter_parse_state
*ps
, char c
)
1082 for (i
= 0; strcmp(ps
->ops
[i
].string
, "OP_NONE"); i
++) {
1083 if (ps
->ops
[i
].string
[0] == c
)
1090 static int infix_get_op(struct filter_parse_state
*ps
, char firstc
)
1092 char nextc
= infix_peek(ps
);
1100 for (i
= 0; strcmp(ps
->ops
[i
].string
, "OP_NONE"); i
++) {
1101 if (!strcmp(opstr
, ps
->ops
[i
].string
)) {
1103 return ps
->ops
[i
].id
;
1109 for (i
= 0; strcmp(ps
->ops
[i
].string
, "OP_NONE"); i
++) {
1110 if (!strcmp(opstr
, ps
->ops
[i
].string
))
1111 return ps
->ops
[i
].id
;
1117 static inline void clear_operand_string(struct filter_parse_state
*ps
)
1119 memset(ps
->operand
.string
, '\0', MAX_FILTER_STR_VAL
);
1120 ps
->operand
.tail
= 0;
1123 static inline int append_operand_char(struct filter_parse_state
*ps
, char c
)
1125 if (ps
->operand
.tail
== MAX_FILTER_STR_VAL
- 1)
1128 ps
->operand
.string
[ps
->operand
.tail
++] = c
;
1133 static int filter_opstack_push(struct filter_parse_state
*ps
, int op
)
1135 struct opstack_op
*opstack_op
;
1137 opstack_op
= kmalloc(sizeof(*opstack_op
), GFP_KERNEL
);
1141 opstack_op
->op
= op
;
1142 list_add(&opstack_op
->list
, &ps
->opstack
);
1147 static int filter_opstack_empty(struct filter_parse_state
*ps
)
1149 return list_empty(&ps
->opstack
);
1152 static int filter_opstack_top(struct filter_parse_state
*ps
)
1154 struct opstack_op
*opstack_op
;
1156 if (filter_opstack_empty(ps
))
1159 opstack_op
= list_first_entry(&ps
->opstack
, struct opstack_op
, list
);
1161 return opstack_op
->op
;
1164 static int filter_opstack_pop(struct filter_parse_state
*ps
)
1166 struct opstack_op
*opstack_op
;
1169 if (filter_opstack_empty(ps
))
1172 opstack_op
= list_first_entry(&ps
->opstack
, struct opstack_op
, list
);
1173 op
= opstack_op
->op
;
1174 list_del(&opstack_op
->list
);
1181 static void filter_opstack_clear(struct filter_parse_state
*ps
)
1183 while (!filter_opstack_empty(ps
))
1184 filter_opstack_pop(ps
);
1187 static char *curr_operand(struct filter_parse_state
*ps
)
1189 return ps
->operand
.string
;
1192 static int postfix_append_operand(struct filter_parse_state
*ps
, char *operand
)
1194 struct postfix_elt
*elt
;
1196 elt
= kmalloc(sizeof(*elt
), GFP_KERNEL
);
1201 elt
->operand
= kstrdup(operand
, GFP_KERNEL
);
1202 if (!elt
->operand
) {
1207 list_add_tail(&elt
->list
, &ps
->postfix
);
1212 static int postfix_append_op(struct filter_parse_state
*ps
, int op
)
1214 struct postfix_elt
*elt
;
1216 elt
= kmalloc(sizeof(*elt
), GFP_KERNEL
);
1221 elt
->operand
= NULL
;
1223 list_add_tail(&elt
->list
, &ps
->postfix
);
1228 static void postfix_clear(struct filter_parse_state
*ps
)
1230 struct postfix_elt
*elt
;
1232 while (!list_empty(&ps
->postfix
)) {
1233 elt
= list_first_entry(&ps
->postfix
, struct postfix_elt
, list
);
1234 list_del(&elt
->list
);
1235 kfree(elt
->operand
);
1240 static int filter_parse(struct filter_parse_state
*ps
)
1246 while ((ch
= infix_next(ps
))) {
1258 if (is_op_char(ps
, ch
)) {
1259 op
= infix_get_op(ps
, ch
);
1260 if (op
== OP_NONE
) {
1261 parse_error(ps
, FILT_ERR_INVALID_OP
, 0);
1265 if (strlen(curr_operand(ps
))) {
1266 postfix_append_operand(ps
, curr_operand(ps
));
1267 clear_operand_string(ps
);
1270 while (!filter_opstack_empty(ps
)) {
1271 top_op
= filter_opstack_top(ps
);
1272 if (!is_precedence_lower(ps
, top_op
, op
)) {
1273 top_op
= filter_opstack_pop(ps
);
1274 postfix_append_op(ps
, top_op
);
1280 filter_opstack_push(ps
, op
);
1285 filter_opstack_push(ps
, OP_OPEN_PAREN
);
1290 if (strlen(curr_operand(ps
))) {
1291 postfix_append_operand(ps
, curr_operand(ps
));
1292 clear_operand_string(ps
);
1295 top_op
= filter_opstack_pop(ps
);
1296 while (top_op
!= OP_NONE
) {
1297 if (top_op
== OP_OPEN_PAREN
)
1299 postfix_append_op(ps
, top_op
);
1300 top_op
= filter_opstack_pop(ps
);
1302 if (top_op
== OP_NONE
) {
1303 parse_error(ps
, FILT_ERR_UNBALANCED_PAREN
, 0);
1309 if (append_operand_char(ps
, ch
)) {
1310 parse_error(ps
, FILT_ERR_OPERAND_TOO_LONG
, 0);
1315 if (strlen(curr_operand(ps
)))
1316 postfix_append_operand(ps
, curr_operand(ps
));
1318 while (!filter_opstack_empty(ps
)) {
1319 top_op
= filter_opstack_pop(ps
);
1320 if (top_op
== OP_NONE
)
1322 if (top_op
== OP_OPEN_PAREN
) {
1323 parse_error(ps
, FILT_ERR_UNBALANCED_PAREN
, 0);
1326 postfix_append_op(ps
, top_op
);
1332 static struct filter_pred
*create_pred(struct filter_parse_state
*ps
,
1333 struct ftrace_event_call
*call
,
1334 int op
, char *operand1
, char *operand2
)
1336 struct ftrace_event_field
*field
;
1337 static struct filter_pred pred
;
1339 memset(&pred
, 0, sizeof(pred
));
1342 if (op
== OP_AND
|| op
== OP_OR
)
1345 if (!operand1
|| !operand2
) {
1346 parse_error(ps
, FILT_ERR_MISSING_FIELD
, 0);
1350 field
= trace_find_event_field(call
, operand1
);
1352 parse_error(ps
, FILT_ERR_FIELD_NOT_FOUND
, 0);
1356 strcpy(pred
.regex
.pattern
, operand2
);
1357 pred
.regex
.len
= strlen(pred
.regex
.pattern
);
1359 return init_pred(ps
, field
, &pred
) ? NULL
: &pred
;
1362 static int check_preds(struct filter_parse_state
*ps
)
1364 int n_normal_preds
= 0, n_logical_preds
= 0;
1365 struct postfix_elt
*elt
;
1367 list_for_each_entry(elt
, &ps
->postfix
, list
) {
1368 if (elt
->op
== OP_NONE
)
1371 if (elt
->op
== OP_AND
|| elt
->op
== OP_OR
) {
1378 if (!n_normal_preds
|| n_logical_preds
>= n_normal_preds
) {
1379 parse_error(ps
, FILT_ERR_INVALID_FILTER
, 0);
1386 static int count_preds(struct filter_parse_state
*ps
)
1388 struct postfix_elt
*elt
;
1391 list_for_each_entry(elt
, &ps
->postfix
, list
) {
1392 if (elt
->op
== OP_NONE
)
1400 struct check_pred_data
{
1405 static int check_pred_tree_cb(enum move_type move
, struct filter_pred
*pred
,
1406 int *err
, void *data
)
1408 struct check_pred_data
*d
= data
;
1410 if (WARN_ON(d
->count
++ > d
->max
)) {
1412 return WALK_PRED_ABORT
;
1414 return WALK_PRED_DEFAULT
;
1418 * The tree is walked at filtering of an event. If the tree is not correctly
1419 * built, it may cause an infinite loop. Check here that the tree does
1422 static int check_pred_tree(struct event_filter
*filter
,
1423 struct filter_pred
*root
)
1425 struct check_pred_data data
= {
1427 * The max that we can hit a node is three times.
1428 * Once going down, once coming up from left, and
1429 * once coming up from right. This is more than enough
1430 * since leafs are only hit a single time.
1432 .max
= 3 * filter
->n_preds
,
1436 return walk_pred_tree(filter
->preds
, root
,
1437 check_pred_tree_cb
, &data
);
1440 static int count_leafs_cb(enum move_type move
, struct filter_pred
*pred
,
1441 int *err
, void *data
)
1445 if ((move
== MOVE_DOWN
) &&
1446 (pred
->left
== FILTER_PRED_INVALID
))
1449 return WALK_PRED_DEFAULT
;
1452 static int count_leafs(struct filter_pred
*preds
, struct filter_pred
*root
)
1456 ret
= walk_pred_tree(preds
, root
, count_leafs_cb
, &count
);
1461 struct fold_pred_data
{
1462 struct filter_pred
*root
;
1467 static int fold_pred_cb(enum move_type move
, struct filter_pred
*pred
,
1468 int *err
, void *data
)
1470 struct fold_pred_data
*d
= data
;
1471 struct filter_pred
*root
= d
->root
;
1473 if (move
!= MOVE_DOWN
)
1474 return WALK_PRED_DEFAULT
;
1475 if (pred
->left
!= FILTER_PRED_INVALID
)
1476 return WALK_PRED_DEFAULT
;
1478 if (WARN_ON(d
->count
== d
->children
)) {
1480 return WALK_PRED_ABORT
;
1483 pred
->index
&= ~FILTER_PRED_FOLD
;
1484 root
->ops
[d
->count
++] = pred
->index
;
1485 return WALK_PRED_DEFAULT
;
1488 static int fold_pred(struct filter_pred
*preds
, struct filter_pred
*root
)
1490 struct fold_pred_data data
= {
1496 /* No need to keep the fold flag */
1497 root
->index
&= ~FILTER_PRED_FOLD
;
1499 /* If the root is a leaf then do nothing */
1500 if (root
->left
== FILTER_PRED_INVALID
)
1503 /* count the children */
1504 children
= count_leafs(preds
, &preds
[root
->left
]);
1505 children
+= count_leafs(preds
, &preds
[root
->right
]);
1507 root
->ops
= kcalloc(children
, sizeof(*root
->ops
), GFP_KERNEL
);
1511 root
->val
= children
;
1512 data
.children
= children
;
1513 return walk_pred_tree(preds
, root
, fold_pred_cb
, &data
);
1516 static int fold_pred_tree_cb(enum move_type move
, struct filter_pred
*pred
,
1517 int *err
, void *data
)
1519 struct filter_pred
*preds
= data
;
1521 if (move
!= MOVE_DOWN
)
1522 return WALK_PRED_DEFAULT
;
1523 if (!(pred
->index
& FILTER_PRED_FOLD
))
1524 return WALK_PRED_DEFAULT
;
1526 *err
= fold_pred(preds
, pred
);
1528 return WALK_PRED_ABORT
;
1530 /* eveyrhing below is folded, continue with parent */
1531 return WALK_PRED_PARENT
;
1535 * To optimize the processing of the ops, if we have several "ors" or
1536 * "ands" together, we can put them in an array and process them all
1537 * together speeding up the filter logic.
1539 static int fold_pred_tree(struct event_filter
*filter
,
1540 struct filter_pred
*root
)
1542 return walk_pred_tree(filter
->preds
, root
, fold_pred_tree_cb
,
1546 static int replace_preds(struct ftrace_event_call
*call
,
1547 struct event_filter
*filter
,
1548 struct filter_parse_state
*ps
,
1551 char *operand1
= NULL
, *operand2
= NULL
;
1552 struct filter_pred
*pred
;
1553 struct filter_pred
*root
;
1554 struct postfix_elt
*elt
;
1555 struct pred_stack stack
= { }; /* init to NULL */
1559 n_preds
= count_preds(ps
);
1560 if (n_preds
>= MAX_FILTER_PRED
) {
1561 parse_error(ps
, FILT_ERR_TOO_MANY_PREDS
, 0);
1565 err
= check_preds(ps
);
1570 err
= __alloc_pred_stack(&stack
, n_preds
);
1573 err
= __alloc_preds(filter
, n_preds
);
1579 list_for_each_entry(elt
, &ps
->postfix
, list
) {
1580 if (elt
->op
== OP_NONE
) {
1582 operand1
= elt
->operand
;
1584 operand2
= elt
->operand
;
1586 parse_error(ps
, FILT_ERR_TOO_MANY_OPERANDS
, 0);
1593 if (WARN_ON(n_preds
++ == MAX_FILTER_PRED
)) {
1594 parse_error(ps
, FILT_ERR_TOO_MANY_PREDS
, 0);
1599 pred
= create_pred(ps
, call
, elt
->op
, operand1
, operand2
);
1606 err
= filter_add_pred(ps
, filter
, pred
, &stack
);
1611 operand1
= operand2
= NULL
;
1615 /* We should have one item left on the stack */
1616 pred
= __pop_pred_stack(&stack
);
1619 /* This item is where we start from in matching */
1621 /* Make sure the stack is empty */
1622 pred
= __pop_pred_stack(&stack
);
1623 if (WARN_ON(pred
)) {
1625 filter
->root
= NULL
;
1628 err
= check_pred_tree(filter
, root
);
1632 /* Optimize the tree */
1633 err
= fold_pred_tree(filter
, root
);
1637 /* We don't set root until we know it works */
1639 filter
->root
= root
;
1644 __free_pred_stack(&stack
);
1648 static inline void event_set_filtered_flag(struct ftrace_event_file
*file
)
1650 struct ftrace_event_call
*call
= file
->event_call
;
1652 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
1653 call
->flags
|= TRACE_EVENT_FL_FILTERED
;
1655 file
->flags
|= FTRACE_EVENT_FL_FILTERED
;
1658 static inline void event_set_filter(struct ftrace_event_file
*file
,
1659 struct event_filter
*filter
)
1661 struct ftrace_event_call
*call
= file
->event_call
;
1663 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
1664 rcu_assign_pointer(call
->filter
, filter
);
1666 rcu_assign_pointer(file
->filter
, filter
);
1669 static inline void event_clear_filter(struct ftrace_event_file
*file
)
1671 struct ftrace_event_call
*call
= file
->event_call
;
1673 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
1674 RCU_INIT_POINTER(call
->filter
, NULL
);
1676 RCU_INIT_POINTER(file
->filter
, NULL
);
1680 event_set_no_set_filter_flag(struct ftrace_event_file
*file
)
1682 struct ftrace_event_call
*call
= file
->event_call
;
1684 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
1685 call
->flags
|= TRACE_EVENT_FL_NO_SET_FILTER
;
1687 file
->flags
|= FTRACE_EVENT_FL_NO_SET_FILTER
;
1691 event_clear_no_set_filter_flag(struct ftrace_event_file
*file
)
1693 struct ftrace_event_call
*call
= file
->event_call
;
1695 if (call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
)
1696 call
->flags
&= ~TRACE_EVENT_FL_NO_SET_FILTER
;
1698 file
->flags
&= ~FTRACE_EVENT_FL_NO_SET_FILTER
;
1702 event_no_set_filter_flag(struct ftrace_event_file
*file
)
1704 struct ftrace_event_call
*call
= file
->event_call
;
1706 if (file
->flags
& FTRACE_EVENT_FL_NO_SET_FILTER
)
1709 if ((call
->flags
& TRACE_EVENT_FL_USE_CALL_FILTER
) &&
1710 (call
->flags
& TRACE_EVENT_FL_NO_SET_FILTER
))
1716 struct filter_list
{
1717 struct list_head list
;
1718 struct event_filter
*filter
;
1721 static int replace_system_preds(struct ftrace_subsystem_dir
*dir
,
1722 struct trace_array
*tr
,
1723 struct filter_parse_state
*ps
,
1724 char *filter_string
)
1726 struct ftrace_event_file
*file
;
1727 struct filter_list
*filter_item
;
1728 struct filter_list
*tmp
;
1729 LIST_HEAD(filter_list
);
1733 list_for_each_entry(file
, &tr
->events
, list
) {
1734 if (file
->system
!= dir
)
1738 * Try to see if the filter can be applied
1739 * (filter arg is ignored on dry_run)
1741 err
= replace_preds(file
->event_call
, NULL
, ps
, true);
1743 event_set_no_set_filter_flag(file
);
1745 event_clear_no_set_filter_flag(file
);
1748 list_for_each_entry(file
, &tr
->events
, list
) {
1749 struct event_filter
*filter
;
1751 if (file
->system
!= dir
)
1754 if (event_no_set_filter_flag(file
))
1757 filter_item
= kzalloc(sizeof(*filter_item
), GFP_KERNEL
);
1761 list_add_tail(&filter_item
->list
, &filter_list
);
1763 filter_item
->filter
= __alloc_filter();
1764 if (!filter_item
->filter
)
1766 filter
= filter_item
->filter
;
1768 /* Can only fail on no memory */
1769 err
= replace_filter_string(filter
, filter_string
);
1773 err
= replace_preds(file
->event_call
, filter
, ps
, false);
1775 filter_disable(file
);
1776 parse_error(ps
, FILT_ERR_BAD_SUBSYS_FILTER
, 0);
1777 append_filter_err(ps
, filter
);
1779 event_set_filtered_flag(file
);
1781 * Regardless of if this returned an error, we still
1782 * replace the filter for the call.
1784 filter
= event_filter(file
);
1785 event_set_filter(file
, filter_item
->filter
);
1786 filter_item
->filter
= filter
;
1795 * The calls can still be using the old filters.
1796 * Do a synchronize_sched() to ensure all calls are
1797 * done with them before we free them.
1799 synchronize_sched();
1800 list_for_each_entry_safe(filter_item
, tmp
, &filter_list
, list
) {
1801 __free_filter(filter_item
->filter
);
1802 list_del(&filter_item
->list
);
1807 /* No call succeeded */
1808 list_for_each_entry_safe(filter_item
, tmp
, &filter_list
, list
) {
1809 list_del(&filter_item
->list
);
1812 parse_error(ps
, FILT_ERR_BAD_SUBSYS_FILTER
, 0);
1815 /* If any call succeeded, we still need to sync */
1817 synchronize_sched();
1818 list_for_each_entry_safe(filter_item
, tmp
, &filter_list
, list
) {
1819 __free_filter(filter_item
->filter
);
1820 list_del(&filter_item
->list
);
1826 static int create_filter_start(char *filter_str
, bool set_str
,
1827 struct filter_parse_state
**psp
,
1828 struct event_filter
**filterp
)
1830 struct event_filter
*filter
;
1831 struct filter_parse_state
*ps
= NULL
;
1834 WARN_ON_ONCE(*psp
|| *filterp
);
1836 /* allocate everything, and if any fails, free all and fail */
1837 filter
= __alloc_filter();
1838 if (filter
&& set_str
)
1839 err
= replace_filter_string(filter
, filter_str
);
1841 ps
= kzalloc(sizeof(*ps
), GFP_KERNEL
);
1843 if (!filter
|| !ps
|| err
) {
1845 __free_filter(filter
);
1849 /* we're committed to creating a new filter */
1853 parse_init(ps
, filter_ops
, filter_str
);
1854 err
= filter_parse(ps
);
1856 append_filter_err(ps
, filter
);
1860 static void create_filter_finish(struct filter_parse_state
*ps
)
1863 filter_opstack_clear(ps
);
1870 * create_filter - create a filter for a ftrace_event_call
1871 * @call: ftrace_event_call to create a filter for
1872 * @filter_str: filter string
1873 * @set_str: remember @filter_str and enable detailed error in filter
1874 * @filterp: out param for created filter (always updated on return)
1876 * Creates a filter for @call with @filter_str. If @set_str is %true,
1877 * @filter_str is copied and recorded in the new filter.
1879 * On success, returns 0 and *@filterp points to the new filter. On
1880 * failure, returns -errno and *@filterp may point to %NULL or to a new
1881 * filter. In the latter case, the returned filter contains error
1882 * information if @set_str is %true and the caller is responsible for
1885 static int create_filter(struct ftrace_event_call
*call
,
1886 char *filter_str
, bool set_str
,
1887 struct event_filter
**filterp
)
1889 struct event_filter
*filter
= NULL
;
1890 struct filter_parse_state
*ps
= NULL
;
1893 err
= create_filter_start(filter_str
, set_str
, &ps
, &filter
);
1895 err
= replace_preds(call
, filter
, ps
, false);
1897 append_filter_err(ps
, filter
);
1899 create_filter_finish(ps
);
1905 int create_event_filter(struct ftrace_event_call
*call
,
1906 char *filter_str
, bool set_str
,
1907 struct event_filter
**filterp
)
1909 return create_filter(call
, filter_str
, set_str
, filterp
);
1913 * create_system_filter - create a filter for an event_subsystem
1914 * @system: event_subsystem to create a filter for
1915 * @filter_str: filter string
1916 * @filterp: out param for created filter (always updated on return)
1918 * Identical to create_filter() except that it creates a subsystem filter
1919 * and always remembers @filter_str.
1921 static int create_system_filter(struct ftrace_subsystem_dir
*dir
,
1922 struct trace_array
*tr
,
1923 char *filter_str
, struct event_filter
**filterp
)
1925 struct event_filter
*filter
= NULL
;
1926 struct filter_parse_state
*ps
= NULL
;
1929 err
= create_filter_start(filter_str
, true, &ps
, &filter
);
1931 err
= replace_system_preds(dir
, tr
, ps
, filter_str
);
1933 /* System filters just show a default message */
1934 kfree(filter
->filter_string
);
1935 filter
->filter_string
= NULL
;
1937 append_filter_err(ps
, filter
);
1940 create_filter_finish(ps
);
1946 /* caller must hold event_mutex */
1947 int apply_event_filter(struct ftrace_event_file
*file
, char *filter_string
)
1949 struct ftrace_event_call
*call
= file
->event_call
;
1950 struct event_filter
*filter
;
1953 if (!strcmp(strstrip(filter_string
), "0")) {
1954 filter_disable(file
);
1955 filter
= event_filter(file
);
1960 event_clear_filter(file
);
1962 /* Make sure the filter is not being used */
1963 synchronize_sched();
1964 __free_filter(filter
);
1969 err
= create_filter(call
, filter_string
, true, &filter
);
1972 * Always swap the call filter with the new filter
1973 * even if there was an error. If there was an error
1974 * in the filter, we disable the filter and show the error
1978 struct event_filter
*tmp
;
1980 tmp
= event_filter(file
);
1982 event_set_filtered_flag(file
);
1984 filter_disable(file
);
1986 event_set_filter(file
, filter
);
1989 /* Make sure the call is done with the filter */
1990 synchronize_sched();
1998 int apply_subsystem_event_filter(struct ftrace_subsystem_dir
*dir
,
1999 char *filter_string
)
2001 struct event_subsystem
*system
= dir
->subsystem
;
2002 struct trace_array
*tr
= dir
->tr
;
2003 struct event_filter
*filter
;
2006 mutex_lock(&event_mutex
);
2008 /* Make sure the system still has events */
2009 if (!dir
->nr_events
) {
2014 if (!strcmp(strstrip(filter_string
), "0")) {
2015 filter_free_subsystem_preds(dir
, tr
);
2016 remove_filter_string(system
->filter
);
2017 filter
= system
->filter
;
2018 system
->filter
= NULL
;
2019 /* Ensure all filters are no longer used */
2020 synchronize_sched();
2021 filter_free_subsystem_filters(dir
, tr
);
2022 __free_filter(filter
);
2026 err
= create_system_filter(dir
, tr
, filter_string
, &filter
);
2029 * No event actually uses the system filter
2030 * we can free it without synchronize_sched().
2032 __free_filter(system
->filter
);
2033 system
->filter
= filter
;
2036 mutex_unlock(&event_mutex
);
2041 #ifdef CONFIG_PERF_EVENTS
2043 void ftrace_profile_free_filter(struct perf_event
*event
)
2045 struct event_filter
*filter
= event
->filter
;
2047 event
->filter
= NULL
;
2048 __free_filter(filter
);
2051 struct function_filter_data
{
2052 struct ftrace_ops
*ops
;
2057 #ifdef CONFIG_FUNCTION_TRACER
2059 ftrace_function_filter_re(char *buf
, int len
, int *count
)
2061 char *str
, *sep
, **re
;
2063 str
= kstrndup(buf
, len
, GFP_KERNEL
);
2068 * The argv_split function takes white space
2069 * as a separator, so convert ',' into spaces.
2071 while ((sep
= strchr(str
, ',')))
2074 re
= argv_split(GFP_KERNEL
, str
, count
);
2079 static int ftrace_function_set_regexp(struct ftrace_ops
*ops
, int filter
,
2080 int reset
, char *re
, int len
)
2085 ret
= ftrace_set_filter(ops
, re
, len
, reset
);
2087 ret
= ftrace_set_notrace(ops
, re
, len
, reset
);
2092 static int __ftrace_function_set_filter(int filter
, char *buf
, int len
,
2093 struct function_filter_data
*data
)
2095 int i
, re_cnt
, ret
= -EINVAL
;
2099 reset
= filter
? &data
->first_filter
: &data
->first_notrace
;
2102 * The 'ip' field could have multiple filters set, separated
2103 * either by space or comma. We first cut the filter and apply
2104 * all pieces separatelly.
2106 re
= ftrace_function_filter_re(buf
, len
, &re_cnt
);
2110 for (i
= 0; i
< re_cnt
; i
++) {
2111 ret
= ftrace_function_set_regexp(data
->ops
, filter
, *reset
,
2112 re
[i
], strlen(re
[i
]));
2124 static int ftrace_function_check_pred(struct filter_pred
*pred
, int leaf
)
2126 struct ftrace_event_field
*field
= pred
->field
;
2130 * Check the leaf predicate for function trace, verify:
2131 * - only '==' and '!=' is used
2132 * - the 'ip' field is used
2134 if ((pred
->op
!= OP_EQ
) && (pred
->op
!= OP_NE
))
2137 if (strcmp(field
->name
, "ip"))
2141 * Check the non leaf predicate for function trace, verify:
2142 * - only '||' is used
2144 if (pred
->op
!= OP_OR
)
2151 static int ftrace_function_set_filter_cb(enum move_type move
,
2152 struct filter_pred
*pred
,
2153 int *err
, void *data
)
2155 /* Checking the node is valid for function trace. */
2156 if ((move
!= MOVE_DOWN
) ||
2157 (pred
->left
!= FILTER_PRED_INVALID
)) {
2158 *err
= ftrace_function_check_pred(pred
, 0);
2160 *err
= ftrace_function_check_pred(pred
, 1);
2162 return WALK_PRED_ABORT
;
2164 *err
= __ftrace_function_set_filter(pred
->op
== OP_EQ
,
2165 pred
->regex
.pattern
,
2170 return (*err
) ? WALK_PRED_ABORT
: WALK_PRED_DEFAULT
;
2173 static int ftrace_function_set_filter(struct perf_event
*event
,
2174 struct event_filter
*filter
)
2176 struct function_filter_data data
= {
2179 .ops
= &event
->ftrace_ops
,
2182 return walk_pred_tree(filter
->preds
, filter
->root
,
2183 ftrace_function_set_filter_cb
, &data
);
2186 static int ftrace_function_set_filter(struct perf_event
*event
,
2187 struct event_filter
*filter
)
2191 #endif /* CONFIG_FUNCTION_TRACER */
2193 int ftrace_profile_set_filter(struct perf_event
*event
, int event_id
,
2197 struct event_filter
*filter
;
2198 struct ftrace_event_call
*call
;
2200 mutex_lock(&event_mutex
);
2202 call
= event
->tp_event
;
2212 err
= create_filter(call
, filter_str
, false, &filter
);
2216 if (ftrace_event_is_function(call
))
2217 err
= ftrace_function_set_filter(event
, filter
);
2219 event
->filter
= filter
;
2222 if (err
|| ftrace_event_is_function(call
))
2223 __free_filter(filter
);
2226 mutex_unlock(&event_mutex
);
2231 #endif /* CONFIG_PERF_EVENTS */
2233 #ifdef CONFIG_FTRACE_STARTUP_TEST
2235 #include <linux/types.h>
2236 #include <linux/tracepoint.h>
2238 #define CREATE_TRACE_POINTS
2239 #include "trace_events_filter_test.h"
2241 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2244 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2245 .e = ve, .f = vf, .g = vg, .h = vh }, \
2247 .not_visited = nvisit, \
2252 static struct test_filter_data_t
{
2254 struct ftrace_raw_ftrace_test_filter rec
;
2257 } test_filter_data
[] = {
2258 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2259 "e == 1 && f == 1 && g == 1 && h == 1"
2260 DATA_REC(YES
, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2261 DATA_REC(NO
, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2262 DATA_REC(NO
, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2264 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2265 "e == 1 || f == 1 || g == 1 || h == 1"
2266 DATA_REC(NO
, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2267 DATA_REC(YES
, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2268 DATA_REC(YES
, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
2270 #define FILTER "(a == 1 || b == 1) && (c == 1 || d == 1) && " \
2271 "(e == 1 || f == 1) && (g == 1 || h == 1)"
2272 DATA_REC(NO
, 0, 0, 1, 1, 1, 1, 1, 1, "dfh"),
2273 DATA_REC(YES
, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2274 DATA_REC(YES
, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2275 DATA_REC(NO
, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2277 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2278 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2279 DATA_REC(YES
, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2280 DATA_REC(YES
, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2281 DATA_REC(NO
, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2283 #define FILTER "(a == 1 && b == 1) && (c == 1 && d == 1) && " \
2284 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2285 DATA_REC(YES
, 1, 1, 1, 1, 1, 1, 0, 0, "gh"),
2286 DATA_REC(NO
, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2287 DATA_REC(YES
, 1, 1, 1, 1, 1, 0, 1, 1, ""),
2289 #define FILTER "((a == 1 || b == 1) || (c == 1 || d == 1) || " \
2290 "(e == 1 || f == 1)) && (g == 1 || h == 1)"
2291 DATA_REC(YES
, 1, 1, 1, 1, 1, 1, 0, 1, "bcdef"),
2292 DATA_REC(NO
, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2293 DATA_REC(YES
, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
2295 #define FILTER "((((((((a == 1) && (b == 1)) || (c == 1)) && (d == 1)) || " \
2296 "(e == 1)) && (f == 1)) || (g == 1)) && (h == 1))"
2297 DATA_REC(YES
, 1, 1, 1, 1, 1, 1, 1, 1, "ceg"),
2298 DATA_REC(NO
, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2299 DATA_REC(NO
, 1, 0, 1, 0, 1, 0, 1, 0, ""),
2301 #define FILTER "((((((((a == 1) || (b == 1)) && (c == 1)) || (d == 1)) && " \
2302 "(e == 1)) || (f == 1)) && (g == 1)) || (h == 1))"
2303 DATA_REC(YES
, 1, 1, 1, 1, 1, 1, 1, 1, "bdfh"),
2304 DATA_REC(YES
, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2305 DATA_REC(YES
, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2313 #define DATA_CNT (sizeof(test_filter_data)/sizeof(struct test_filter_data_t))
2315 static int test_pred_visited
;
2317 static int test_pred_visited_fn(struct filter_pred
*pred
, void *event
)
2319 struct ftrace_event_field
*field
= pred
->field
;
2321 test_pred_visited
= 1;
2322 printk(KERN_INFO
"\npred visited %s\n", field
->name
);
2326 static int test_walk_pred_cb(enum move_type move
, struct filter_pred
*pred
,
2327 int *err
, void *data
)
2329 char *fields
= data
;
2331 if ((move
== MOVE_DOWN
) &&
2332 (pred
->left
== FILTER_PRED_INVALID
)) {
2333 struct ftrace_event_field
*field
= pred
->field
;
2336 WARN(1, "all leafs should have field defined");
2337 return WALK_PRED_DEFAULT
;
2339 if (!strchr(fields
, *field
->name
))
2340 return WALK_PRED_DEFAULT
;
2343 pred
->fn
= test_pred_visited_fn
;
2345 return WALK_PRED_DEFAULT
;
2348 static __init
int ftrace_test_event_filter(void)
2352 printk(KERN_INFO
"Testing ftrace filter: ");
2354 for (i
= 0; i
< DATA_CNT
; i
++) {
2355 struct event_filter
*filter
= NULL
;
2356 struct test_filter_data_t
*d
= &test_filter_data
[i
];
2359 err
= create_filter(&event_ftrace_test_filter
, d
->filter
,
2363 "Failed to get filter for '%s', err %d\n",
2365 __free_filter(filter
);
2370 * The preemption disabling is not really needed for self
2371 * tests, but the rcu dereference will complain without it.
2374 if (*d
->not_visited
)
2375 walk_pred_tree(filter
->preds
, filter
->root
,
2379 test_pred_visited
= 0;
2380 err
= filter_match_preds(filter
, &d
->rec
);
2383 __free_filter(filter
);
2385 if (test_pred_visited
) {
2387 "Failed, unwanted pred visited for filter %s\n",
2392 if (err
!= d
->match
) {
2394 "Failed to match filter '%s', expected %d\n",
2395 d
->filter
, d
->match
);
2401 printk(KERN_CONT
"OK\n");
2406 late_initcall(ftrace_test_event_filter
);
2408 #endif /* CONFIG_FTRACE_STARTUP_TEST */