/kernel/trace/ |
D | trace_events_filter_test.h | 11 TP_PROTO(int a, int b, int c, int d, int e, int f, int g, int h), 13 TP_ARGS(a, b, c, d, e, f, g, h), 20 __field(int, e) 31 __entry->e = e; 39 __entry->e, __entry->f, __entry->g, __entry->h)
|
D | trace_output.c | 634 struct trace_event *e; in trace_search_list() local 646 list_for_each_entry(e, &ftrace_event_list, list) { in trace_search_list() 647 if (e->type != last + 1) in trace_search_list() 656 *list = &e->list; in trace_search_list()
|
D | Kconfig | 290 ftrace interface, e.g.: 436 Tracing also is possible using the ftrace interface, e.g.: 608 However, it should be safe to use on e.g. unused portion of VRAM.
|
D | trace_events_filter.c | 2278 .e = ve, .f = vf, .g = vg, .h = vh }, \
|
/kernel/ |
D | auditfilter.c | 92 static inline void audit_free_rule(struct audit_entry *e) in audit_free_rule() argument 95 struct audit_krule *erule = &e->rule; in audit_free_rule() 105 kfree(e); in audit_free_rule() 110 struct audit_entry *e = container_of(head, struct audit_entry, rcu); in audit_free_rule_rcu() local 111 audit_free_rule(e); in audit_free_rule_rcu() 865 struct audit_entry *e, *found = NULL; in audit_find_rule() local 876 list_for_each_entry(e, list, list) in audit_find_rule() 877 if (!audit_compare_rule(&entry->rule, &e->rule)) { in audit_find_rule() 878 found = e; in audit_find_rule() 887 list_for_each_entry(e, list, list) in audit_find_rule() [all …]
|
D | extable.c | 53 const struct exception_table_entry *e; in search_exception_tables() local 55 e = search_extable(__start___ex_table, __stop___ex_table-1, addr); in search_exception_tables() 56 if (!e) in search_exception_tables() 57 e = search_module_extables(addr); in search_exception_tables() 58 return e; in search_exception_tables()
|
D | audit_watch.c | 341 struct audit_entry *e; in audit_remove_parent_watches() local 346 e = container_of(r, struct audit_entry, rule); in audit_remove_parent_watches() 348 if (e->rule.exe) in audit_remove_parent_watches() 349 audit_remove_mark(e->rule.exe); in audit_remove_parent_watches() 352 list_del_rcu(&e->list); in audit_remove_parent_watches() 353 call_rcu(&e->rcu, audit_free_rule_rcu); in audit_remove_parent_watches()
|
D | auditsc.c | 715 struct audit_entry *e; in audit_filter_task() local 719 list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_TASK], list) { in audit_filter_task() 720 if (audit_filter_rules(tsk, &e->rule, NULL, NULL, in audit_filter_task() 723 *key = kstrdup(e->rule.filterkey, GFP_ATOMIC); in audit_filter_task() 757 struct audit_entry *e; in audit_filter_syscall() local 765 list_for_each_entry_rcu(e, list, list) { in audit_filter_syscall() 766 if (audit_in_mask(&e->rule, ctx->major) && in audit_filter_syscall() 767 audit_filter_rules(tsk, &e->rule, ctx, NULL, in audit_filter_syscall() 788 struct audit_entry *e; in audit_filter_inode_name() local 794 list_for_each_entry_rcu(e, list, list) { in audit_filter_inode_name() [all …]
|
D | module.c | 4202 const struct exception_table_entry *e = NULL; in search_module_extables() local 4212 e = search_extable(mod->extable, in search_module_extables() 4215 if (e) in search_module_extables() 4222 return e; in search_module_extables()
|
/kernel/bpf/ |
D | cgroup.c | 50 struct bpf_prog *e; in cgroup_bpf_inherit() local 52 e = rcu_dereference_protected(parent->bpf.effective[type], in cgroup_bpf_inherit() 54 rcu_assign_pointer(cgrp->bpf.effective[type], e); in cgroup_bpf_inherit()
|
D | verifier.c | 2499 static int push_insn(int t, int w, int e, struct bpf_verifier_env *env) in push_insn() argument 2501 if (e == FALLTHROUGH && insn_state[t] >= (DISCOVERED | FALLTHROUGH)) in push_insn() 2504 if (e == BRANCH && insn_state[t] >= (DISCOVERED | BRANCH)) in push_insn() 2512 if (e == BRANCH) in push_insn() 2518 insn_state[t] = DISCOVERED | e; in push_insn() 2529 insn_state[t] = DISCOVERED | e; in push_insn()
|
/kernel/gcov/ |
D | Kconfig | 9 This option enables gcov-based code profiling (e.g. for code coverage 19 For a single file (e.g. main.o):
|
/kernel/printk/ |
D | printk.c | 639 static void append_char(char **pp, char *e, char c) in append_char() argument 641 if (*pp < e) in append_char() 673 char *p = buf, *e = buf + size; in msg_print_ext_body() local 681 p += scnprintf(p, e - p, "\\x%02x", c); in msg_print_ext_body() 683 append_char(&p, e, c); in msg_print_ext_body() 685 append_char(&p, e, '\n'); in msg_print_ext_body() 694 append_char(&p, e, ' '); in msg_print_ext_body() 699 append_char(&p, e, '\n'); in msg_print_ext_body() 705 p += scnprintf(p, e - p, "\\x%02x", c); in msg_print_ext_body() 709 append_char(&p, e, c); in msg_print_ext_body() [all …]
|
/kernel/debug/kdb/ |
D | kdb_main.c | 234 char *e = *ep++; in kdbgetenv() local 236 if (!e) in kdbgetenv() 239 if ((strncmp(match, e, matchlen) == 0) in kdbgetenv() 240 && ((e[matchlen] == '\0') in kdbgetenv() 241 || (e[matchlen] == '='))) { in kdbgetenv() 242 char *cp = strchr(e, '='); in kdbgetenv()
|
/kernel/power/ |
D | Kconfig | 9 suspend-to-RAM state (e.g. the ACPI S3 state). 246 notification of APM "events" (e.g. battery status change).
|
/kernel/sched/ |
D | core.c | 6499 const struct sched_group_energy * const e = fn(i); in check_sched_energy_data() local 6502 BUG_ON(e->nr_idle_states != sge->nr_idle_states); in check_sched_energy_data() 6504 for (y = 0; y < (e->nr_idle_states); y++) { in check_sched_energy_data() 6505 BUG_ON(e->idle_states[y].power != in check_sched_energy_data() 6509 BUG_ON(e->nr_cap_states != sge->nr_cap_states); in check_sched_energy_data() 6511 for (y = 0; y < (e->nr_cap_states); y++) { in check_sched_energy_data() 6512 BUG_ON(e->cap_states[y].cap != sge->cap_states[y].cap); in check_sched_energy_data() 6513 BUG_ON(e->cap_states[y].power != in check_sched_energy_data()
|