1 // SPDX-License-Identifier: GPL-2.0
3 * trace_events_filter - generic event filtering
5 * Copyright (C) 2009 Tom Zanussi <tzanussi@gmail.com>
8 #include <linux/module.h>
9 #include <linux/ctype.h>
10 #include <linux/mutex.h>
11 #include <linux/perf_event.h>
12 #include <linux/slab.h>
15 #include "trace_output.h"
17 #define DEFAULT_SYS_FILTER_MESSAGE \
18 "### global filter ###\n" \
19 "# Use this to set filters for multiple events.\n" \
20 "# Only events with the given fields will be affected.\n" \
21 "# If no events are modified, an error message will be displayed here"
23 /* Due to token parsing '<=' must be before '<' and '>=' must be before '>' */
38 enum filter_op_ids { OPS };
43 static const char * ops[] = { OPS };
46 * pred functions are OP_LE, OP_LT, OP_GE, OP_GT, and OP_BAND
47 * pred_funcs_##type below must match the order of them above.
49 #define PRED_FUNC_START OP_LE
50 #define PRED_FUNC_MAX (OP_BAND - PRED_FUNC_START)
53 C(NONE, "No error"), \
54 C(INVALID_OP, "Invalid operator"), \
55 C(TOO_MANY_OPEN, "Too many '('"), \
56 C(TOO_MANY_CLOSE, "Too few '('"), \
57 C(MISSING_QUOTE, "Missing matching quote"), \
58 C(OPERAND_TOO_LONG, "Operand too long"), \
59 C(EXPECT_STRING, "Expecting string field"), \
60 C(EXPECT_DIGIT, "Expecting numeric field"), \
61 C(ILLEGAL_FIELD_OP, "Illegal operation for field type"), \
62 C(FIELD_NOT_FOUND, "Field not found"), \
63 C(ILLEGAL_INTVAL, "Illegal integer value"), \
64 C(BAD_SUBSYS_FILTER, "Couldn't find or set field in one of a subsystem's events"), \
65 C(TOO_MANY_PREDS, "Too many terms in predicate expression"), \
66 C(INVALID_FILTER, "Meaningless filter expression"), \
67 C(IP_FIELD_ONLY, "Only 'ip' field is supported for function trace"), \
68 C(INVALID_VALUE, "Invalid value (did you forget quotes)?"), \
69 C(NO_FILTER, "No filter found"),
72 #define C(a, b) FILT_ERR_##a
79 static char *err_text[] = { ERRORS };
81 /* Called after a '!' character but "!=" and "!~" are not "not"s */
82 static bool is_not(const char *str)
93 * prog_entry - a singe entry in the filter program
94 * @target: Index to jump to on a branch (actually one minus the index)
95 * @when_to_branch: The value of the result of the predicate to do a branch
96 * @pred: The predicate to execute.
101 struct filter_pred *pred;
105 * update_preds- assign a program entry a label target
106 * @prog: The program array
107 * @N: The index of the current entry in @prog
108 * @when_to_branch: What to assign a program entry for its branch condition
110 * The program entry at @N has a target that points to the index of a program
111 * entry that can have its target and when_to_branch fields updated.
112 * Update the current program entry denoted by index @N target field to be
113 * that of the updated entry. This will denote the entry to update if
114 * we are processing an "||" after an "&&"
116 static void update_preds(struct prog_entry *prog, int N, int invert)
122 prog[t].when_to_branch = invert;
127 struct filter_parse_error {
132 static void parse_error(struct filter_parse_error *pe, int err, int pos)
135 pe->lasterr_pos = pos;
138 typedef int (*parse_pred_fn)(const char *str, void *data, int pos,
139 struct filter_parse_error *pe,
140 struct filter_pred **pred);
149 * Without going into a formal proof, this explains the method that is used in
150 * parsing the logical expressions.
152 * For example, if we have: "a && !(!b || (c && g)) || d || e && !f"
153 * The first pass will convert it into the following program:
155 * n1: r=a; l1: if (!r) goto l4;
156 * n2: r=b; l2: if (!r) goto l4;
157 * n3: r=c; r=!r; l3: if (r) goto l4;
158 * n4: r=g; r=!r; l4: if (r) goto l5;
159 * n5: r=d; l5: if (r) goto T
160 * n6: r=e; l6: if (!r) goto l7;
161 * n7: r=f; r=!r; l7: if (!r) goto F
165 * To do this, we use a data structure to represent each of the above
166 * predicate and conditions that has:
168 * predicate, when_to_branch, invert, target
170 * The "predicate" will hold the function to determine the result "r".
171 * The "when_to_branch" denotes what "r" should be if a branch is to be taken
172 * "&&" would contain "!r" or (0) and "||" would contain "r" or (1).
173 * The "invert" holds whether the value should be reversed before testing.
174 * The "target" contains the label "l#" to jump to.
176 * A stack is created to hold values when parentheses are used.
178 * To simplify the logic, the labels will start at 0 and not 1.
180 * The possible invert values are 1 and 0. The number of "!"s that are in scope
181 * before the predicate determines the invert value, if the number is odd then
182 * the invert value is 1 and 0 otherwise. This means the invert value only
183 * needs to be toggled when a new "!" is introduced compared to what is stored
184 * on the stack, where parentheses were used.
186 * The top of the stack and "invert" are initialized to zero.
190 * #1 A loop through all the tokens is done:
192 * #2 If the token is an "(", the stack is push, and the current stack value
193 * gets the current invert value, and the loop continues to the next token.
194 * The top of the stack saves the "invert" value to keep track of what
195 * the current inversion is. As "!(a && !b || c)" would require all
196 * predicates being affected separately by the "!" before the parentheses.
197 * And that would end up being equivalent to "(!a || b) && !c"
199 * #3 If the token is an "!", the current "invert" value gets inverted, and
200 * the loop continues. Note, if the next token is a predicate, then
201 * this "invert" value is only valid for the current program entry,
202 * and does not affect other predicates later on.
204 * The only other acceptable token is the predicate string.
206 * #4 A new entry into the program is added saving: the predicate and the
207 * current value of "invert". The target is currently assigned to the
208 * previous program index (this will not be its final value).
210 * #5 We now enter another loop and look at the next token. The only valid
211 * tokens are ")", "&&", "||" or end of the input string "\0".
213 * #6 The invert variable is reset to the current value saved on the top of
216 * #7 The top of the stack holds not only the current invert value, but also
217 * if a "&&" or "||" needs to be processed. Note, the "&&" takes higher
218 * precedence than "||". That is "a && b || c && d" is equivalent to
219 * "(a && b) || (c && d)". Thus the first thing to do is to see if "&&" needs
220 * to be processed. This is the case if an "&&" was the last token. If it was
221 * then we call update_preds(). This takes the program, the current index in
222 * the program, and the current value of "invert". More will be described
223 * below about this function.
225 * #8 If the next token is "&&" then we set a flag in the top of the stack
226 * that denotes that "&&" needs to be processed, break out of this loop
227 * and continue with the outer loop.
229 * #9 Otherwise, if a "||" needs to be processed then update_preds() is called.
230 * This is called with the program, the current index in the program, but
231 * this time with an inverted value of "invert" (that is !invert). This is
232 * because the value taken will become the "when_to_branch" value of the
234 * Note, this is called when the next token is not an "&&". As stated before,
235 * "&&" takes higher precedence, and "||" should not be processed yet if the
236 * next logical operation is "&&".
238 * #10 If the next token is "||" then we set a flag in the top of the stack
239 * that denotes that "||" needs to be processed, break out of this loop
240 * and continue with the outer loop.
242 * #11 If this is the end of the input string "\0" then we break out of both
245 * #12 Otherwise, the next token is ")", where we pop the stack and continue
248 * Now to discuss the update_pred() function, as that is key to the setting up
249 * of the program. Remember the "target" of the program is initialized to the
250 * previous index and not the "l" label. The target holds the index into the
251 * program that gets affected by the operand. Thus if we have something like
252 * "a || b && c", when we process "a" the target will be "-1" (undefined).
253 * When we process "b", its target is "0", which is the index of "a", as that's
254 * the predicate that is affected by "||". But because the next token after "b"
255 * is "&&" we don't call update_preds(). Instead continue to "c". As the
256 * next token after "c" is not "&&" but the end of input, we first process the
257 * "&&" by calling update_preds() for the "&&" then we process the "||" by
258 * callin updates_preds() with the values for processing "||".
260 * What does that mean? What update_preds() does is to first save the "target"
261 * of the program entry indexed by the current program entry's "target"
262 * (remember the "target" is initialized to previous program entry), and then
263 * sets that "target" to the current index which represents the label "l#".
264 * That entry's "when_to_branch" is set to the value passed in (the "invert"
265 * or "!invert"). Then it sets the current program entry's target to the saved
266 * "target" value (the old value of the program that had its "target" updated
269 * Looking back at "a || b && c", we have the following steps:
270 * "a" - prog[0] = { "a", X, -1 } // pred, when_to_branch, target
271 * "||" - flag that we need to process "||"; continue outer loop
272 * "b" - prog[1] = { "b", X, 0 }
273 * "&&" - flag that we need to process "&&"; continue outer loop
274 * (Notice we did not process "||")
275 * "c" - prog[2] = { "c", X, 1 }
276 * update_preds(prog, 2, 0); // invert = 0 as we are processing "&&"
277 * t = prog[2].target; // t = 1
278 * s = prog[t].target; // s = 0
279 * prog[t].target = 2; // Set target to "l2"
280 * prog[t].when_to_branch = 0;
281 * prog[2].target = s;
282 * update_preds(prog, 2, 1); // invert = 1 as we are now processing "||"
283 * t = prog[2].target; // t = 0
284 * s = prog[t].target; // s = -1
285 * prog[t].target = 2; // Set target to "l2"
286 * prog[t].when_to_branch = 1;
287 * prog[2].target = s;
289 * #13 Which brings us to the final step of the first pass, which is to set
290 * the last program entry's when_to_branch and target, which will be
291 * when_to_branch = 0; target = N; ( the label after the program entry after
292 * the last program entry processed above).
294 * If we denote "TRUE" to be the entry after the last program entry processed,
295 * and "FALSE" the program entry after that, we are now done with the first
298 * Making the above "a || b && c" have a progam of:
299 * prog[0] = { "a", 1, 2 }
300 * prog[1] = { "b", 0, 2 }
301 * prog[2] = { "c", 0, 3 }
303 * Which translates into:
304 * n0: r = a; l0: if (r) goto l2;
305 * n1: r = b; l1: if (!r) goto l2;
306 * n2: r = c; l2: if (!r) goto l3; // Which is the same as "goto F;"
307 * T: return TRUE; l3:
310 * Although, after the first pass, the program is correct, it is
311 * inefficient. The simple sample of "a || b && c" could be easily been
313 * n0: r = a; if (r) goto T
314 * n1: r = b; if (!r) goto F
315 * n2: r = c; if (!r) goto F
319 * The First Pass is over the input string. The next too passes are over
320 * the program itself.
324 * Which brings us to the second pass. If a jump to a label has the
325 * same condition as that label, it can instead jump to its target.
326 * The original example of "a && !(!b || (c && g)) || d || e && !f"
327 * where the first pass gives us:
329 * n1: r=a; l1: if (!r) goto l4;
330 * n2: r=b; l2: if (!r) goto l4;
331 * n3: r=c; r=!r; l3: if (r) goto l4;
332 * n4: r=g; r=!r; l4: if (r) goto l5;
333 * n5: r=d; l5: if (r) goto T
334 * n6: r=e; l6: if (!r) goto l7;
335 * n7: r=f; r=!r; l7: if (!r) goto F:
339 * We can see that "l3: if (r) goto l4;" and at l4, we have "if (r) goto l5;".
340 * And "l5: if (r) goto T", we could optimize this by converting l3 and l4
341 * to go directly to T. To accomplish this, we start from the last
342 * entry in the program and work our way back. If the target of the entry
343 * has the same "when_to_branch" then we could use that entry's target.
344 * Doing this, the above would end up as:
346 * n1: r=a; l1: if (!r) goto l4;
347 * n2: r=b; l2: if (!r) goto l4;
348 * n3: r=c; r=!r; l3: if (r) goto T;
349 * n4: r=g; r=!r; l4: if (r) goto T;
350 * n5: r=d; l5: if (r) goto T;
351 * n6: r=e; l6: if (!r) goto F;
352 * n7: r=f; r=!r; l7: if (!r) goto F;
356 * In that same pass, if the "when_to_branch" doesn't match, we can simply
357 * go to the program entry after the label. That is, "l2: if (!r) goto l4;"
358 * where "l4: if (r) goto T;", then we can convert l2 to be:
359 * "l2: if (!r) goto n5;".
361 * This will have the second pass give us:
362 * n1: r=a; l1: if (!r) goto n5;
363 * n2: r=b; l2: if (!r) goto n5;
364 * n3: r=c; r=!r; l3: if (r) goto T;
365 * n4: r=g; r=!r; l4: if (r) goto T;
366 * n5: r=d; l5: if (r) goto T
367 * n6: r=e; l6: if (!r) goto F;
368 * n7: r=f; r=!r; l7: if (!r) goto F
372 * Notice, all the "l#" labels are no longer used, and they can now
377 * For the third pass we deal with the inverts. As they simply just
378 * make the "when_to_branch" get inverted, a simple loop over the
379 * program to that does: "when_to_branch ^= invert;" will do the
380 * job, leaving us with:
381 * n1: r=a; if (!r) goto n5;
382 * n2: r=b; if (!r) goto n5;
383 * n3: r=c: if (!r) goto T;
384 * n4: r=g; if (!r) goto T;
385 * n5: r=d; if (r) goto T
386 * n6: r=e; if (!r) goto F;
387 * n7: r=f; if (r) goto F
391 * As "r = a; if (!r) goto n5;" is obviously the same as
392 * "if (!a) goto n5;" without doing anything we can interperate the
394 * n1: if (!a) goto n5;
395 * n2: if (!b) goto n5;
396 * n3: if (!c) goto T;
397 * n4: if (!g) goto T;
399 * n6: if (!e) goto F;
404 * Since the inverts are discarded at the end, there's no reason to store
405 * them in the program array (and waste memory). A separate array to hold
406 * the inverts is used and freed at the end.
408 static struct prog_entry *
409 predicate_parse(const char *str, int nr_parens, int nr_preds,
410 parse_pred_fn parse_pred, void *data,
411 struct filter_parse_error *pe)
413 struct prog_entry *prog_stack;
414 struct prog_entry *prog;
415 const char *ptr = str;
416 char *inverts = NULL;
425 nr_preds += 2; /* For TRUE and FALSE */
427 op_stack = kmalloc_array(nr_parens, sizeof(*op_stack), GFP_KERNEL);
429 return ERR_PTR(-ENOMEM);
430 prog_stack = kcalloc(nr_preds, sizeof(*prog_stack), GFP_KERNEL);
432 parse_error(pe, -ENOMEM, 0);
435 inverts = kmalloc_array(nr_preds, sizeof(*inverts), GFP_KERNEL);
437 parse_error(pe, -ENOMEM, 0);
446 while (*ptr) { /* #1 */
447 const char *next = ptr++;
454 if (top - op_stack > nr_parens) {
468 parse_error(pe, FILT_ERR_TOO_MANY_PREDS, next - str);
472 inverts[N] = invert; /* #4 */
473 prog[N].target = N-1;
475 len = parse_pred(next, data, ptr - str, pe, &prog[N].pred);
496 if (next[1] == next[0]) {
501 parse_error(pe, FILT_ERR_TOO_MANY_PREDS,
506 invert = *top & INVERT;
508 if (*top & PROCESS_AND) { /* #7 */
509 update_preds(prog, N - 1, invert);
510 *top &= ~PROCESS_AND;
512 if (*next == '&') { /* #8 */
516 if (*top & PROCESS_OR) { /* #9 */
517 update_preds(prog, N - 1, !invert);
520 if (*next == '|') { /* #10 */
524 if (!*next) /* #11 */
527 if (top == op_stack) {
530 parse_error(pe, FILT_ERR_TOO_MANY_CLOSE, ptr - str);
537 if (top != op_stack) {
539 parse_error(pe, FILT_ERR_TOO_MANY_OPEN, ptr - str);
546 parse_error(pe, FILT_ERR_NO_FILTER, ptr - str);
550 prog[N].pred = NULL; /* #13 */
551 prog[N].target = 1; /* TRUE */
552 prog[N+1].pred = NULL;
553 prog[N+1].target = 0; /* FALSE */
554 prog[N-1].target = N;
555 prog[N-1].when_to_branch = false;
558 for (i = N-1 ; i--; ) {
559 int target = prog[i].target;
560 if (prog[i].when_to_branch == prog[target].when_to_branch)
561 prog[i].target = prog[target].target;
565 for (i = 0; i < N; i++) {
566 invert = inverts[i] ^ prog[i].when_to_branch;
567 prog[i].when_to_branch = invert;
568 /* Make sure the program always moves forward */
569 if (WARN_ON(prog[i].target <= i)) {
582 for (i = 0; prog_stack[i].pred; i++)
583 kfree(prog_stack[i].pred);
589 #define DEFINE_COMPARISON_PRED(type) \
590 static int filter_pred_LT_##type(struct filter_pred *pred, void *event) \
592 type *addr = (type *)(event + pred->offset); \
593 type val = (type)pred->val; \
594 return *addr < val; \
596 static int filter_pred_LE_##type(struct filter_pred *pred, void *event) \
598 type *addr = (type *)(event + pred->offset); \
599 type val = (type)pred->val; \
600 return *addr <= val; \
602 static int filter_pred_GT_##type(struct filter_pred *pred, void *event) \
604 type *addr = (type *)(event + pred->offset); \
605 type val = (type)pred->val; \
606 return *addr > val; \
608 static int filter_pred_GE_##type(struct filter_pred *pred, void *event) \
610 type *addr = (type *)(event + pred->offset); \
611 type val = (type)pred->val; \
612 return *addr >= val; \
614 static int filter_pred_BAND_##type(struct filter_pred *pred, void *event) \
616 type *addr = (type *)(event + pred->offset); \
617 type val = (type)pred->val; \
618 return !!(*addr & val); \
620 static const filter_pred_fn_t pred_funcs_##type[] = { \
621 filter_pred_LE_##type, \
622 filter_pred_LT_##type, \
623 filter_pred_GE_##type, \
624 filter_pred_GT_##type, \
625 filter_pred_BAND_##type, \
628 #define DEFINE_EQUALITY_PRED(size) \
629 static int filter_pred_##size(struct filter_pred *pred, void *event) \
631 u##size *addr = (u##size *)(event + pred->offset); \
632 u##size val = (u##size)pred->val; \
635 match = (val == *addr) ^ pred->not; \
640 DEFINE_COMPARISON_PRED(s64);
641 DEFINE_COMPARISON_PRED(u64);
642 DEFINE_COMPARISON_PRED(s32);
643 DEFINE_COMPARISON_PRED(u32);
644 DEFINE_COMPARISON_PRED(s16);
645 DEFINE_COMPARISON_PRED(u16);
646 DEFINE_COMPARISON_PRED(s8);
647 DEFINE_COMPARISON_PRED(u8);
649 DEFINE_EQUALITY_PRED(64);
650 DEFINE_EQUALITY_PRED(32);
651 DEFINE_EQUALITY_PRED(16);
652 DEFINE_EQUALITY_PRED(8);
654 /* Filter predicate for fixed sized arrays of characters */
655 static int filter_pred_string(struct filter_pred *pred, void *event)
657 char *addr = (char *)(event + pred->offset);
660 cmp = pred->regex.match(addr, &pred->regex, pred->regex.field_len);
662 match = cmp ^ pred->not;
667 /* Filter predicate for char * pointers */
668 static int filter_pred_pchar(struct filter_pred *pred, void *event)
670 char **addr = (char **)(event + pred->offset);
672 int len = strlen(*addr) + 1; /* including tailing '\0' */
674 cmp = pred->regex.match(*addr, &pred->regex, len);
676 match = cmp ^ pred->not;
682 * Filter predicate for dynamic sized arrays of characters.
683 * These are implemented through a list of strings at the end
685 * Also each of these strings have a field in the entry which
686 * contains its offset from the beginning of the entry.
687 * We have then first to get this field, dereference it
688 * and add it to the address of the entry, and at last we have
689 * the address of the string.
691 static int filter_pred_strloc(struct filter_pred *pred, void *event)
693 u32 str_item = *(u32 *)(event + pred->offset);
694 int str_loc = str_item & 0xffff;
695 int str_len = str_item >> 16;
696 char *addr = (char *)(event + str_loc);
699 cmp = pred->regex.match(addr, &pred->regex, str_len);
701 match = cmp ^ pred->not;
706 /* Filter predicate for CPUs. */
707 static int filter_pred_cpu(struct filter_pred *pred, void *event)
711 cpu = raw_smp_processor_id();
732 /* Filter predicate for COMM. */
733 static int filter_pred_comm(struct filter_pred *pred, void *event)
737 cmp = pred->regex.match(current->comm, &pred->regex,
739 return cmp ^ pred->not;
742 static int filter_pred_none(struct filter_pred *pred, void *event)
748 * regex_match_foo - Basic regex callbacks
750 * @str: the string to be searched
751 * @r: the regex structure containing the pattern string
752 * @len: the length of the string to be searched (including '\0')
755 * - @str might not be NULL-terminated if it's of type DYN_STRING
756 * or STATIC_STRING, unless @len is zero.
759 static int regex_match_full(char *str, struct regex *r, int len)
761 /* len of zero means str is dynamic and ends with '\0' */
763 return strcmp(str, r->pattern) == 0;
765 return strncmp(str, r->pattern, len) == 0;
768 static int regex_match_front(char *str, struct regex *r, int len)
770 if (len && len < r->len)
773 return strncmp(str, r->pattern, r->len) == 0;
776 static int regex_match_middle(char *str, struct regex *r, int len)
779 return strstr(str, r->pattern) != NULL;
781 return strnstr(str, r->pattern, len) != NULL;
784 static int regex_match_end(char *str, struct regex *r, int len)
786 int strlen = len - 1;
788 if (strlen >= r->len &&
789 memcmp(str + strlen - r->len, r->pattern, r->len) == 0)
794 static int regex_match_glob(char *str, struct regex *r, int len __maybe_unused)
796 if (glob_match(r->pattern, str))
802 * filter_parse_regex - parse a basic regex
803 * @buff: the raw regex
804 * @len: length of the regex
805 * @search: will point to the beginning of the string to compare
806 * @not: tell whether the match will have to be inverted
808 * This passes in a buffer containing a regex and this function will
809 * set search to point to the search part of the buffer and
810 * return the type of search it is (see enum above).
811 * This does modify buff.
814 * search returns the pointer to use for comparison.
815 * not returns 1 if buff started with a '!'
818 enum regex_type filter_parse_regex(char *buff, int len, char **search, int *not)
820 int type = MATCH_FULL;
823 if (buff[0] == '!') {
832 for (i = 0; i < len; i++) {
833 if (buff[i] == '*') {
835 type = MATCH_END_ONLY;
836 } else if (i == len - 1) {
837 if (type == MATCH_END_ONLY)
838 type = MATCH_MIDDLE_ONLY;
840 type = MATCH_FRONT_ONLY;
843 } else { /* pattern continues, use full glob */
846 } else if (strchr("[?\\", buff[i])) {
856 static void filter_build_regex(struct filter_pred *pred)
858 struct regex *r = &pred->regex;
860 enum regex_type type = MATCH_FULL;
862 if (pred->op == OP_GLOB) {
863 type = filter_parse_regex(r->pattern, r->len, &search, &pred->not);
864 r->len = strlen(search);
865 memmove(r->pattern, search, r->len+1);
870 r->match = regex_match_full;
872 case MATCH_FRONT_ONLY:
873 r->match = regex_match_front;
875 case MATCH_MIDDLE_ONLY:
876 r->match = regex_match_middle;
879 r->match = regex_match_end;
882 r->match = regex_match_glob;
887 /* return 1 if event matches, 0 otherwise (discard) */
888 int filter_match_preds(struct event_filter *filter, void *rec)
890 struct prog_entry *prog;
893 /* no filter is considered a match */
897 /* Protected by either SRCU(tracepoint_srcu) or preempt_disable */
898 prog = rcu_dereference_raw(filter->prog);
902 for (i = 0; prog[i].pred; i++) {
903 struct filter_pred *pred = prog[i].pred;
904 int match = pred->fn(pred, rec);
905 if (match == prog[i].when_to_branch)
908 return prog[i].target;
910 EXPORT_SYMBOL_GPL(filter_match_preds);
912 static void remove_filter_string(struct event_filter *filter)
917 kfree(filter->filter_string);
918 filter->filter_string = NULL;
921 static void append_filter_err(struct filter_parse_error *pe,
922 struct event_filter *filter)
925 int pos = pe->lasterr_pos;
929 if (WARN_ON(!filter->filter_string))
932 s = kmalloc(sizeof(*s), GFP_KERNEL);
937 len = strlen(filter->filter_string);
941 /* indexing is off by one */
945 trace_seq_puts(s, filter->filter_string);
946 if (pe->lasterr > 0) {
947 trace_seq_printf(s, "\n%*s", pos, "^");
948 trace_seq_printf(s, "\nparse_error: %s\n", err_text[pe->lasterr]);
950 trace_seq_printf(s, "\nError: (%d)\n", pe->lasterr);
952 trace_seq_putc(s, 0);
953 buf = kmemdup_nul(s->buffer, s->seq.len, GFP_KERNEL);
955 kfree(filter->filter_string);
956 filter->filter_string = buf;
961 static inline struct event_filter *event_filter(struct trace_event_file *file)
966 /* caller must hold event_mutex */
967 void print_event_filter(struct trace_event_file *file, struct trace_seq *s)
969 struct event_filter *filter = event_filter(file);
971 if (filter && filter->filter_string)
972 trace_seq_printf(s, "%s\n", filter->filter_string);
974 trace_seq_puts(s, "none\n");
977 void print_subsystem_event_filter(struct event_subsystem *system,
980 struct event_filter *filter;
982 mutex_lock(&event_mutex);
983 filter = system->filter;
984 if (filter && filter->filter_string)
985 trace_seq_printf(s, "%s\n", filter->filter_string);
987 trace_seq_puts(s, DEFAULT_SYS_FILTER_MESSAGE "\n");
988 mutex_unlock(&event_mutex);
991 static void free_prog(struct event_filter *filter)
993 struct prog_entry *prog;
996 prog = rcu_access_pointer(filter->prog);
1000 for (i = 0; prog[i].pred; i++)
1001 kfree(prog[i].pred);
1005 static void filter_disable(struct trace_event_file *file)
1007 unsigned long old_flags = file->flags;
1009 file->flags &= ~EVENT_FILE_FL_FILTERED;
1011 if (old_flags != file->flags)
1012 trace_buffered_event_disable();
1015 static void __free_filter(struct event_filter *filter)
1021 kfree(filter->filter_string);
1025 void free_event_filter(struct event_filter *filter)
1027 __free_filter(filter);
1030 static inline void __remove_filter(struct trace_event_file *file)
1032 filter_disable(file);
1033 remove_filter_string(file->filter);
1036 static void filter_free_subsystem_preds(struct trace_subsystem_dir *dir,
1037 struct trace_array *tr)
1039 struct trace_event_file *file;
1041 list_for_each_entry(file, &tr->events, list) {
1042 if (file->system != dir)
1044 __remove_filter(file);
1048 static inline void __free_subsystem_filter(struct trace_event_file *file)
1050 __free_filter(file->filter);
1051 file->filter = NULL;
1054 static void filter_free_subsystem_filters(struct trace_subsystem_dir *dir,
1055 struct trace_array *tr)
1057 struct trace_event_file *file;
1059 list_for_each_entry(file, &tr->events, list) {
1060 if (file->system != dir)
1062 __free_subsystem_filter(file);
1066 int filter_assign_type(const char *type)
1068 if (strstr(type, "__data_loc") && strstr(type, "char"))
1069 return FILTER_DYN_STRING;
1071 if (strchr(type, '[') && strstr(type, "char"))
1072 return FILTER_STATIC_STRING;
1074 return FILTER_OTHER;
1077 static filter_pred_fn_t select_comparison_fn(enum filter_op_ids op,
1078 int field_size, int field_is_signed)
1080 filter_pred_fn_t fn = NULL;
1081 int pred_func_index = -1;
1088 if (WARN_ON_ONCE(op < PRED_FUNC_START))
1090 pred_func_index = op - PRED_FUNC_START;
1091 if (WARN_ON_ONCE(pred_func_index > PRED_FUNC_MAX))
1095 switch (field_size) {
1097 if (pred_func_index < 0)
1098 fn = filter_pred_64;
1099 else if (field_is_signed)
1100 fn = pred_funcs_s64[pred_func_index];
1102 fn = pred_funcs_u64[pred_func_index];
1105 if (pred_func_index < 0)
1106 fn = filter_pred_32;
1107 else if (field_is_signed)
1108 fn = pred_funcs_s32[pred_func_index];
1110 fn = pred_funcs_u32[pred_func_index];
1113 if (pred_func_index < 0)
1114 fn = filter_pred_16;
1115 else if (field_is_signed)
1116 fn = pred_funcs_s16[pred_func_index];
1118 fn = pred_funcs_u16[pred_func_index];
1121 if (pred_func_index < 0)
1123 else if (field_is_signed)
1124 fn = pred_funcs_s8[pred_func_index];
1126 fn = pred_funcs_u8[pred_func_index];
1133 /* Called when a predicate is encountered by predicate_parse() */
1134 static int parse_pred(const char *str, void *data,
1135 int pos, struct filter_parse_error *pe,
1136 struct filter_pred **pred_ptr)
1138 struct trace_event_call *call = data;
1139 struct ftrace_event_field *field;
1140 struct filter_pred *pred = NULL;
1141 char num_buf[24]; /* Big enough to hold an address */
1151 /* First find the field to associate to */
1152 while (isspace(str[i]))
1156 while (isalnum(str[i]) || str[i] == '_')
1164 field_name = kmemdup_nul(str + s, len, GFP_KERNEL);
1168 /* Make sure that the field exists */
1170 field = trace_find_event_field(call, field_name);
1173 parse_error(pe, FILT_ERR_FIELD_NOT_FOUND, pos + i);
1177 while (isspace(str[i]))
1180 /* Make sure this op is supported */
1181 for (op = 0; ops[op]; op++) {
1182 /* This is why '<=' must come before '<' in ops[] */
1183 if (strncmp(str + i, ops[op], strlen(ops[op])) == 0)
1188 parse_error(pe, FILT_ERR_INVALID_OP, pos + i);
1192 i += strlen(ops[op]);
1194 while (isspace(str[i]))
1199 pred = kzalloc(sizeof(*pred), GFP_KERNEL);
1203 pred->field = field;
1204 pred->offset = field->offset;
1207 if (ftrace_event_is_function(call)) {
1209 * Perf does things different with function events.
1210 * It only allows an "ip" field, and expects a string.
1211 * But the string does not need to be surrounded by quotes.
1212 * If it is a string, the assigned function as a nop,
1213 * (perf doesn't use it) and grab everything.
1215 if (strcmp(field->name, "ip") != 0) {
1216 parse_error(pe, FILT_ERR_IP_FIELD_ONLY, pos + i);
1219 pred->fn = filter_pred_none;
1222 * Quotes are not required, but if they exist then we need
1223 * to read them till we hit a matching one.
1225 if (str[i] == '\'' || str[i] == '"')
1230 for (i++; str[i]; i++) {
1231 if (q && str[i] == q)
1233 if (!q && (str[i] == ')' || str[i] == '&' ||
1241 if (len >= MAX_FILTER_STR_VAL) {
1242 parse_error(pe, FILT_ERR_OPERAND_TOO_LONG, pos + i);
1246 pred->regex.len = len;
1247 strncpy(pred->regex.pattern, str + s, len);
1248 pred->regex.pattern[len] = 0;
1250 /* This is either a string, or an integer */
1251 } else if (str[i] == '\'' || str[i] == '"') {
1254 /* Make sure the op is OK for strings */
1263 parse_error(pe, FILT_ERR_ILLEGAL_FIELD_OP, pos + i);
1267 /* Make sure the field is OK for strings */
1268 if (!is_string_field(field)) {
1269 parse_error(pe, FILT_ERR_EXPECT_DIGIT, pos + i);
1273 for (i++; str[i]; i++) {
1278 parse_error(pe, FILT_ERR_MISSING_QUOTE, pos + i);
1285 if (len >= MAX_FILTER_STR_VAL) {
1286 parse_error(pe, FILT_ERR_OPERAND_TOO_LONG, pos + i);
1290 pred->regex.len = len;
1291 strncpy(pred->regex.pattern, str + s, len);
1292 pred->regex.pattern[len] = 0;
1294 filter_build_regex(pred);
1296 if (field->filter_type == FILTER_COMM) {
1297 pred->fn = filter_pred_comm;
1299 } else if (field->filter_type == FILTER_STATIC_STRING) {
1300 pred->fn = filter_pred_string;
1301 pred->regex.field_len = field->size;
1303 } else if (field->filter_type == FILTER_DYN_STRING)
1304 pred->fn = filter_pred_strloc;
1306 pred->fn = filter_pred_pchar;
1307 /* go past the last quote */
1310 } else if (isdigit(str[i]) || str[i] == '-') {
1312 /* Make sure the field is not a string */
1313 if (is_string_field(field)) {
1314 parse_error(pe, FILT_ERR_EXPECT_STRING, pos + i);
1318 if (op == OP_GLOB) {
1319 parse_error(pe, FILT_ERR_ILLEGAL_FIELD_OP, pos + i);
1326 /* We allow 0xDEADBEEF */
1327 while (isalnum(str[i]))
1331 /* 0xfeedfacedeadbeef is 18 chars max */
1332 if (len >= sizeof(num_buf)) {
1333 parse_error(pe, FILT_ERR_OPERAND_TOO_LONG, pos + i);
1337 strncpy(num_buf, str + s, len);
1340 /* Make sure it is a value */
1341 if (field->is_signed)
1342 ret = kstrtoll(num_buf, 0, &val);
1344 ret = kstrtoull(num_buf, 0, &val);
1346 parse_error(pe, FILT_ERR_ILLEGAL_INTVAL, pos + s);
1352 if (field->filter_type == FILTER_CPU)
1353 pred->fn = filter_pred_cpu;
1355 pred->fn = select_comparison_fn(pred->op, field->size,
1357 if (pred->op == OP_NE)
1362 parse_error(pe, FILT_ERR_INVALID_VALUE, pos + i);
1375 TOO_MANY_CLOSE = -1,
1381 * Read the filter string once to calculate the number of predicates
1382 * as well as how deep the parentheses go.
1385 * 0 - everything is fine (err is undefined)
1388 * -3 - No matching quote
1390 static int calc_stack(const char *str, int *parens, int *preds, int *err)
1392 bool is_pred = false;
1394 int open = 1; /* Count the expression as "(E)" */
1402 for (i = 0; str[i]; i++) {
1403 if (isspace(str[i]))
1406 if (str[i] == quote)
1419 if (str[i+1] != str[i])
1426 if (open > max_open)
1433 return TOO_MANY_CLOSE;
1446 return MISSING_QUOTE;
1452 /* find the bad open */
1455 if (str[i] == quote)
1461 if (level == open) {
1463 return TOO_MANY_OPEN;
1476 /* First character is the '(' with missing ')' */
1478 return TOO_MANY_OPEN;
1481 /* Set the size of the required stacks */
1487 static int process_preds(struct trace_event_call *call,
1488 const char *filter_string,
1489 struct event_filter *filter,
1490 struct filter_parse_error *pe)
1492 struct prog_entry *prog;
1498 ret = calc_stack(filter_string, &nr_parens, &nr_preds, &index);
1502 parse_error(pe, FILT_ERR_MISSING_QUOTE, index);
1505 parse_error(pe, FILT_ERR_TOO_MANY_OPEN, index);
1508 parse_error(pe, FILT_ERR_TOO_MANY_CLOSE, index);
1516 prog = predicate_parse(filter_string, nr_parens, nr_preds,
1517 parse_pred, call, pe);
1519 return PTR_ERR(prog);
1521 rcu_assign_pointer(filter->prog, prog);
1525 static inline void event_set_filtered_flag(struct trace_event_file *file)
1527 unsigned long old_flags = file->flags;
1529 file->flags |= EVENT_FILE_FL_FILTERED;
1531 if (old_flags != file->flags)
1532 trace_buffered_event_enable();
1535 static inline void event_set_filter(struct trace_event_file *file,
1536 struct event_filter *filter)
1538 rcu_assign_pointer(file->filter, filter);
1541 static inline void event_clear_filter(struct trace_event_file *file)
1543 RCU_INIT_POINTER(file->filter, NULL);
1547 event_set_no_set_filter_flag(struct trace_event_file *file)
1549 file->flags |= EVENT_FILE_FL_NO_SET_FILTER;
1553 event_clear_no_set_filter_flag(struct trace_event_file *file)
1555 file->flags &= ~EVENT_FILE_FL_NO_SET_FILTER;
1559 event_no_set_filter_flag(struct trace_event_file *file)
1561 if (file->flags & EVENT_FILE_FL_NO_SET_FILTER)
1567 struct filter_list {
1568 struct list_head list;
1569 struct event_filter *filter;
1572 static int process_system_preds(struct trace_subsystem_dir *dir,
1573 struct trace_array *tr,
1574 struct filter_parse_error *pe,
1575 char *filter_string)
1577 struct trace_event_file *file;
1578 struct filter_list *filter_item;
1579 struct event_filter *filter = NULL;
1580 struct filter_list *tmp;
1581 LIST_HEAD(filter_list);
1585 list_for_each_entry(file, &tr->events, list) {
1587 if (file->system != dir)
1590 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
1594 filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
1595 if (!filter->filter_string)
1598 err = process_preds(file->event_call, filter_string, filter, pe);
1600 filter_disable(file);
1601 parse_error(pe, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1602 append_filter_err(pe, filter);
1604 event_set_filtered_flag(file);
1607 filter_item = kzalloc(sizeof(*filter_item), GFP_KERNEL);
1611 list_add_tail(&filter_item->list, &filter_list);
1613 * Regardless of if this returned an error, we still
1614 * replace the filter for the call.
1616 filter_item->filter = event_filter(file);
1617 event_set_filter(file, filter);
1627 * The calls can still be using the old filters.
1628 * Do a synchronize_sched() and to ensure all calls are
1629 * done with them before we free them.
1631 tracepoint_synchronize_unregister();
1632 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1633 __free_filter(filter_item->filter);
1634 list_del(&filter_item->list);
1639 /* No call succeeded */
1640 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1641 list_del(&filter_item->list);
1644 parse_error(pe, FILT_ERR_BAD_SUBSYS_FILTER, 0);
1647 __free_filter(filter);
1648 /* If any call succeeded, we still need to sync */
1650 tracepoint_synchronize_unregister();
1651 list_for_each_entry_safe(filter_item, tmp, &filter_list, list) {
1652 __free_filter(filter_item->filter);
1653 list_del(&filter_item->list);
1659 static int create_filter_start(char *filter_string, bool set_str,
1660 struct filter_parse_error **pse,
1661 struct event_filter **filterp)
1663 struct event_filter *filter;
1664 struct filter_parse_error *pe = NULL;
1667 if (WARN_ON_ONCE(*pse || *filterp))
1670 filter = kzalloc(sizeof(*filter), GFP_KERNEL);
1671 if (filter && set_str) {
1672 filter->filter_string = kstrdup(filter_string, GFP_KERNEL);
1673 if (!filter->filter_string)
1677 pe = kzalloc(sizeof(*pe), GFP_KERNEL);
1679 if (!filter || !pe || err) {
1681 __free_filter(filter);
1685 /* we're committed to creating a new filter */
1692 static void create_filter_finish(struct filter_parse_error *pe)
1698 * create_filter - create a filter for a trace_event_call
1699 * @call: trace_event_call to create a filter for
1700 * @filter_str: filter string
1701 * @set_str: remember @filter_str and enable detailed error in filter
1702 * @filterp: out param for created filter (always updated on return)
1703 * Must be a pointer that references a NULL pointer.
1705 * Creates a filter for @call with @filter_str. If @set_str is %true,
1706 * @filter_str is copied and recorded in the new filter.
1708 * On success, returns 0 and *@filterp points to the new filter. On
1709 * failure, returns -errno and *@filterp may point to %NULL or to a new
1710 * filter. In the latter case, the returned filter contains error
1711 * information if @set_str is %true and the caller is responsible for
1714 static int create_filter(struct trace_event_call *call,
1715 char *filter_string, bool set_str,
1716 struct event_filter **filterp)
1718 struct filter_parse_error *pe = NULL;
1721 /* filterp must point to NULL */
1722 if (WARN_ON(*filterp))
1725 err = create_filter_start(filter_string, set_str, &pe, filterp);
1729 err = process_preds(call, filter_string, *filterp, pe);
1731 append_filter_err(pe, *filterp);
1732 create_filter_finish(pe);
1737 int create_event_filter(struct trace_event_call *call,
1738 char *filter_str, bool set_str,
1739 struct event_filter **filterp)
1741 return create_filter(call, filter_str, set_str, filterp);
1745 * create_system_filter - create a filter for an event_subsystem
1746 * @system: event_subsystem to create a filter for
1747 * @filter_str: filter string
1748 * @filterp: out param for created filter (always updated on return)
1750 * Identical to create_filter() except that it creates a subsystem filter
1751 * and always remembers @filter_str.
1753 static int create_system_filter(struct trace_subsystem_dir *dir,
1754 struct trace_array *tr,
1755 char *filter_str, struct event_filter **filterp)
1757 struct filter_parse_error *pe = NULL;
1760 err = create_filter_start(filter_str, true, &pe, filterp);
1762 err = process_system_preds(dir, tr, pe, filter_str);
1764 /* System filters just show a default message */
1765 kfree((*filterp)->filter_string);
1766 (*filterp)->filter_string = NULL;
1768 append_filter_err(pe, *filterp);
1771 create_filter_finish(pe);
1776 /* caller must hold event_mutex */
1777 int apply_event_filter(struct trace_event_file *file, char *filter_string)
1779 struct trace_event_call *call = file->event_call;
1780 struct event_filter *filter = NULL;
1783 if (!strcmp(strstrip(filter_string), "0")) {
1784 filter_disable(file);
1785 filter = event_filter(file);
1790 event_clear_filter(file);
1792 /* Make sure the filter is not being used */
1793 tracepoint_synchronize_unregister();
1794 __free_filter(filter);
1799 err = create_filter(call, filter_string, true, &filter);
1802 * Always swap the call filter with the new filter
1803 * even if there was an error. If there was an error
1804 * in the filter, we disable the filter and show the error
1808 struct event_filter *tmp;
1810 tmp = event_filter(file);
1812 event_set_filtered_flag(file);
1814 filter_disable(file);
1816 event_set_filter(file, filter);
1819 /* Make sure the call is done with the filter */
1820 tracepoint_synchronize_unregister();
1828 int apply_subsystem_event_filter(struct trace_subsystem_dir *dir,
1829 char *filter_string)
1831 struct event_subsystem *system = dir->subsystem;
1832 struct trace_array *tr = dir->tr;
1833 struct event_filter *filter = NULL;
1836 mutex_lock(&event_mutex);
1838 /* Make sure the system still has events */
1839 if (!dir->nr_events) {
1844 if (!strcmp(strstrip(filter_string), "0")) {
1845 filter_free_subsystem_preds(dir, tr);
1846 remove_filter_string(system->filter);
1847 filter = system->filter;
1848 system->filter = NULL;
1849 /* Ensure all filters are no longer used */
1850 tracepoint_synchronize_unregister();
1851 filter_free_subsystem_filters(dir, tr);
1852 __free_filter(filter);
1856 err = create_system_filter(dir, tr, filter_string, &filter);
1859 * No event actually uses the system filter
1860 * we can free it without synchronize_sched().
1862 __free_filter(system->filter);
1863 system->filter = filter;
1866 mutex_unlock(&event_mutex);
1871 #ifdef CONFIG_PERF_EVENTS
1873 void ftrace_profile_free_filter(struct perf_event *event)
1875 struct event_filter *filter = event->filter;
1877 event->filter = NULL;
1878 __free_filter(filter);
1881 struct function_filter_data {
1882 struct ftrace_ops *ops;
1887 #ifdef CONFIG_FUNCTION_TRACER
1889 ftrace_function_filter_re(char *buf, int len, int *count)
1893 str = kstrndup(buf, len, GFP_KERNEL);
1898 * The argv_split function takes white space
1899 * as a separator, so convert ',' into spaces.
1901 strreplace(str, ',', ' ');
1903 re = argv_split(GFP_KERNEL, str, count);
1908 static int ftrace_function_set_regexp(struct ftrace_ops *ops, int filter,
1909 int reset, char *re, int len)
1914 ret = ftrace_set_filter(ops, re, len, reset);
1916 ret = ftrace_set_notrace(ops, re, len, reset);
1921 static int __ftrace_function_set_filter(int filter, char *buf, int len,
1922 struct function_filter_data *data)
1924 int i, re_cnt, ret = -EINVAL;
1928 reset = filter ? &data->first_filter : &data->first_notrace;
1931 * The 'ip' field could have multiple filters set, separated
1932 * either by space or comma. We first cut the filter and apply
1933 * all pieces separatelly.
1935 re = ftrace_function_filter_re(buf, len, &re_cnt);
1939 for (i = 0; i < re_cnt; i++) {
1940 ret = ftrace_function_set_regexp(data->ops, filter, *reset,
1941 re[i], strlen(re[i]));
1953 static int ftrace_function_check_pred(struct filter_pred *pred)
1955 struct ftrace_event_field *field = pred->field;
1958 * Check the predicate for function trace, verify:
1959 * - only '==' and '!=' is used
1960 * - the 'ip' field is used
1962 if ((pred->op != OP_EQ) && (pred->op != OP_NE))
1965 if (strcmp(field->name, "ip"))
1971 static int ftrace_function_set_filter_pred(struct filter_pred *pred,
1972 struct function_filter_data *data)
1976 /* Checking the node is valid for function trace. */
1977 ret = ftrace_function_check_pred(pred);
1981 return __ftrace_function_set_filter(pred->op == OP_EQ,
1982 pred->regex.pattern,
1987 static bool is_or(struct prog_entry *prog, int i)
1992 * Only "||" is allowed for function events, thus,
1993 * all true branches should jump to true, and any
1994 * false branch should jump to false.
1996 target = prog[i].target + 1;
1997 /* True and false have NULL preds (all prog entries should jump to one */
1998 if (prog[target].pred)
2001 /* prog[target].target is 1 for TRUE, 0 for FALSE */
2002 return prog[i].when_to_branch == prog[target].target;
2005 static int ftrace_function_set_filter(struct perf_event *event,
2006 struct event_filter *filter)
2008 struct prog_entry *prog = rcu_dereference_protected(filter->prog,
2009 lockdep_is_held(&event_mutex));
2010 struct function_filter_data data = {
2013 .ops = &event->ftrace_ops,
2017 for (i = 0; prog[i].pred; i++) {
2018 struct filter_pred *pred = prog[i].pred;
2020 if (!is_or(prog, i))
2023 if (ftrace_function_set_filter_pred(pred, &data) < 0)
2029 static int ftrace_function_set_filter(struct perf_event *event,
2030 struct event_filter *filter)
2034 #endif /* CONFIG_FUNCTION_TRACER */
2036 int ftrace_profile_set_filter(struct perf_event *event, int event_id,
2040 struct event_filter *filter = NULL;
2041 struct trace_event_call *call;
2043 mutex_lock(&event_mutex);
2045 call = event->tp_event;
2055 err = create_filter(call, filter_str, false, &filter);
2059 if (ftrace_event_is_function(call))
2060 err = ftrace_function_set_filter(event, filter);
2062 event->filter = filter;
2065 if (err || ftrace_event_is_function(call))
2066 __free_filter(filter);
2069 mutex_unlock(&event_mutex);
2074 #endif /* CONFIG_PERF_EVENTS */
2076 #ifdef CONFIG_FTRACE_STARTUP_TEST
2078 #include <linux/types.h>
2079 #include <linux/tracepoint.h>
2081 #define CREATE_TRACE_POINTS
2082 #include "trace_events_filter_test.h"
2084 #define DATA_REC(m, va, vb, vc, vd, ve, vf, vg, vh, nvisit) \
2087 .rec = { .a = va, .b = vb, .c = vc, .d = vd, \
2088 .e = ve, .f = vf, .g = vg, .h = vh }, \
2090 .not_visited = nvisit, \
2095 static struct test_filter_data_t {
2097 struct trace_event_raw_ftrace_test_filter rec;
2100 } test_filter_data[] = {
2101 #define FILTER "a == 1 && b == 1 && c == 1 && d == 1 && " \
2102 "e == 1 && f == 1 && g == 1 && h == 1"
2103 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, ""),
2104 DATA_REC(NO, 0, 1, 1, 1, 1, 1, 1, 1, "bcdefgh"),
2105 DATA_REC(NO, 1, 1, 1, 1, 1, 1, 1, 0, ""),
2107 #define FILTER "a == 1 || b == 1 || c == 1 || d == 1 || " \
2108 "e == 1 || f == 1 || g == 1 || h == 1"
2109 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2110 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2111 DATA_REC(YES, 1, 0, 0, 0, 0, 0, 0, 0, "bcdefgh"),
2113 #define FILTER "(a == 1 || b == 1) && (c == 1 || d == 1) && " \
2114 "(e == 1 || f == 1) && (g == 1 || h == 1)"
2115 DATA_REC(NO, 0, 0, 1, 1, 1, 1, 1, 1, "dfh"),
2116 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2117 DATA_REC(YES, 1, 0, 1, 0, 0, 1, 0, 1, "bd"),
2118 DATA_REC(NO, 1, 0, 1, 0, 0, 1, 0, 0, "bd"),
2120 #define FILTER "(a == 1 && b == 1) || (c == 1 && d == 1) || " \
2121 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2122 DATA_REC(YES, 1, 0, 1, 1, 1, 1, 1, 1, "efgh"),
2123 DATA_REC(YES, 0, 0, 0, 0, 0, 0, 1, 1, ""),
2124 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2126 #define FILTER "(a == 1 && b == 1) && (c == 1 && d == 1) && " \
2127 "(e == 1 && f == 1) || (g == 1 && h == 1)"
2128 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 0, "gh"),
2129 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 1, ""),
2130 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, ""),
2132 #define FILTER "((a == 1 || b == 1) || (c == 1 || d == 1) || " \
2133 "(e == 1 || f == 1)) && (g == 1 || h == 1)"
2134 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 0, 1, "bcdef"),
2135 DATA_REC(NO, 0, 0, 0, 0, 0, 0, 0, 0, ""),
2136 DATA_REC(YES, 1, 1, 1, 1, 1, 0, 1, 1, "h"),
2138 #define FILTER "((((((((a == 1) && (b == 1)) || (c == 1)) && (d == 1)) || " \
2139 "(e == 1)) && (f == 1)) || (g == 1)) && (h == 1))"
2140 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "ceg"),
2141 DATA_REC(NO, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2142 DATA_REC(NO, 1, 0, 1, 0, 1, 0, 1, 0, ""),
2144 #define FILTER "((((((((a == 1) || (b == 1)) && (c == 1)) || (d == 1)) && " \
2145 "(e == 1)) || (f == 1)) && (g == 1)) || (h == 1))"
2146 DATA_REC(YES, 1, 1, 1, 1, 1, 1, 1, 1, "bdfh"),
2147 DATA_REC(YES, 0, 1, 0, 1, 0, 1, 0, 1, ""),
2148 DATA_REC(YES, 1, 0, 1, 0, 1, 0, 1, 0, "bdfh"),
2156 #define DATA_CNT ARRAY_SIZE(test_filter_data)
2158 static int test_pred_visited;
2160 static int test_pred_visited_fn(struct filter_pred *pred, void *event)
2162 struct ftrace_event_field *field = pred->field;
2164 test_pred_visited = 1;
2165 printk(KERN_INFO "\npred visited %s\n", field->name);
2169 static void update_pred_fn(struct event_filter *filter, char *fields)
2171 struct prog_entry *prog = rcu_dereference_protected(filter->prog,
2172 lockdep_is_held(&event_mutex));
2175 for (i = 0; prog[i].pred; i++) {
2176 struct filter_pred *pred = prog[i].pred;
2177 struct ftrace_event_field *field = pred->field;
2179 WARN_ON_ONCE(!pred->fn);
2182 WARN_ONCE(1, "all leafs should have field defined %d", i);
2186 if (!strchr(fields, *field->name))
2189 pred->fn = test_pred_visited_fn;
2193 static __init int ftrace_test_event_filter(void)
2197 printk(KERN_INFO "Testing ftrace filter: ");
2199 for (i = 0; i < DATA_CNT; i++) {
2200 struct event_filter *filter = NULL;
2201 struct test_filter_data_t *d = &test_filter_data[i];
2204 err = create_filter(&event_ftrace_test_filter, d->filter,
2208 "Failed to get filter for '%s', err %d\n",
2210 __free_filter(filter);
2214 /* Needed to dereference filter->prog */
2215 mutex_lock(&event_mutex);
2217 * The preemption disabling is not really needed for self
2218 * tests, but the rcu dereference will complain without it.
2221 if (*d->not_visited)
2222 update_pred_fn(filter, d->not_visited);
2224 test_pred_visited = 0;
2225 err = filter_match_preds(filter, &d->rec);
2228 mutex_unlock(&event_mutex);
2230 __free_filter(filter);
2232 if (test_pred_visited) {
2234 "Failed, unwanted pred visited for filter %s\n",
2239 if (err != d->match) {
2241 "Failed to match filter '%s', expected %d\n",
2242 d->filter, d->match);
2248 printk(KERN_CONT "OK\n");
2253 late_initcall(ftrace_test_event_filter);
2255 #endif /* CONFIG_FTRACE_STARTUP_TEST */