| /tools/perf/tests/ |
| D | vmlinux-kallsyms.c | 113 struct symbol *pair, *first_pair; in test__vmlinux_matches_kallsyms() local
124 pair = first_pair; in test__vmlinux_matches_kallsyms()
126 if (pair && UM(pair->start) == mem_start) { in test__vmlinux_matches_kallsyms()
128 if (arch__compare_symbol_names(sym->name, pair->name) == 0) { in test__vmlinux_matches_kallsyms()
138 s64 skew = mem_end - UM(pair->end); in test__vmlinux_matches_kallsyms()
142 UM(pair->end)); in test__vmlinux_matches_kallsyms()
152 pair = machine__find_kernel_symbol_by_name(&kallsyms, sym->name, NULL); in test__vmlinux_matches_kallsyms()
153 if (pair) { in test__vmlinux_matches_kallsyms()
154 if (UM(pair->start) == mem_start) in test__vmlinux_matches_kallsyms()
158 mem_start, sym->name, pair->name); in test__vmlinux_matches_kallsyms()
[all …]
|
| /tools/perf/ |
| D | builtin-diff.c | 279 static double compute_delta(struct hist_entry *he, struct hist_entry *pair) in compute_delta() argument
282 double new_percent = period_percent(pair, pair->stat.period); in compute_delta()
284 pair->diff.period_ratio_delta = new_percent - old_percent; in compute_delta()
285 pair->diff.computed = true; in compute_delta()
286 return pair->diff.period_ratio_delta; in compute_delta()
289 static double compute_ratio(struct hist_entry *he, struct hist_entry *pair) in compute_ratio() argument
292 double new_period = pair->stat.period; in compute_ratio()
294 pair->diff.computed = true; in compute_ratio()
295 pair->diff.period_ratio = new_period / old_period; in compute_ratio()
296 return pair->diff.period_ratio; in compute_ratio()
[all …]
|
| D | builtin-trace.c | 3388 struct syscall *pair = trace__syscall_info(trace, NULL, id); local
3392 if (pair == NULL || pair == sc ||
3393 pair->bpf_prog.sys_enter == trace->syscalls.unaugmented_prog)
3396 for (field = sc->args, candidate_field = pair->args;
3434 pair_prog = pair->bpf_prog.sys_enter;
3445 …pair_prog = trace__find_syscall_bpf_prog(trace, pair, pair->fmt ? pair->fmt->bpf_prog_name.sys_ent…
3450 pr_debug("Reusing \"%s\" BPF sys_enter augmenter for \"%s\"\n", pair->name, sc->name);
|
| /tools/perf/scripts/python/ |
| D | compaction-times.py | 54 class pair: class
72 self.migrated = pair(0, 0, "moved", "failed")
73 self.fscan = pair(0,0, "scanned", "isolated")
74 self.mscan = pair(0,0, "scanned", "isolated")
216 pair(nr_migrated, nr_failed), None, None)
223 None, pair(nr_scanned, nr_taken), None)
230 None, None, pair(nr_scanned, nr_taken))
|
| /tools/memory-model/ |
| D | lock.cat | 17 * spin_trylock() read-modify-write event pair
19 * spin_trylock() RMW event pair
47 (* The litmus test is invalid if an LKR/LKW event is not part of an RMW pair *)
90 let pair-to-relation p = p ++ 0
91 in map pair-to-relation ((LKW * {r}) & loc & ext)
111 let pair-to-relation p = p ++ 0
112 in map pair-to-relation (((UL | IW) * {r}) & loc & ext)
|
| /tools/perf/ui/ |
| D | hist.c | 48 struct hist_entry *pair; in __hpp__fmt() local
53 list_for_each_entry(pair, &he->pairs.head, pairs.node) { in __hpp__fmt()
54 u64 period = get_field(pair); in __hpp__fmt()
55 u64 total = hists__total_period(pair->hists); in __hpp__fmt()
60 evsel = hists_to_evsel(pair->hists); in __hpp__fmt()
160 struct hist_entry *pair; in hist_entry__new_pair() local
165 list_for_each_entry(pair, &a->pairs.head, pairs.node) { in hist_entry__new_pair()
166 struct evsel *evsel = hists_to_evsel(pair->hists); in hist_entry__new_pair()
167 fa[evsel__group_idx(evsel)] = get_field(pair); in hist_entry__new_pair()
170 list_for_each_entry(pair, &b->pairs.head, pairs.node) { in hist_entry__new_pair()
[all …]
|
| /tools/memory-model/litmus-tests/ |
| D | LB+poacquireonce+pooncerelease.litmus | 6 * Does a release-acquire pair suffice for the load-buffering litmus
|
| D | Z6.0+pooncelock+pooncelock+pombonce.litmus | 6 * This example demonstrates that a pair of accesses made by different
|
| D | README | 27 the order of a pair of writes, where each write is to a different
35 order of a pair of writes, where each write is to a different
58 Does a release-acquire pair suffice for the load-buffering
71 in one process, and use an acquire load followed by a pair of
76 acquire load followed by a pair of spin_is_locked() calls
174 For example, if the one process writes to a pair of variables, and
205 interleaving descriptions of the relation between a pair of consecutive
206 accesses with descriptions of the second access in the pair.
|
| D | IRIW+poonceonces+OnceOnce.litmus | 9 * of a pair of writes, where each write is to a different variable by a
|
| D | IRIW+fencembonceonces+OnceOnce.litmus | 8 * cause two different reading processes to agree on the order of a pair
|
| /tools/perf/util/ |
| D | stream.c | 268 struct evsel_streams *es, bool pair) in print_stream_callchain() argument
281 if (pair) { in print_stream_callchain()
293 if (pair) in print_stream_callchain()
|
| D | sort.h | 182 static inline void hist_entry__add_pair(struct hist_entry *pair, in hist_entry__add_pair() argument
185 list_add_tail(&pair->pairs.node, &he->pairs.head); in hist_entry__add_pair()
|
| D | hist.c | 2324 struct hist_entry *pair) in hists__add_dummy_entry() argument
2344 cmp = hist_entry__collapse(he, pair); in hists__add_dummy_entry()
2357 he = hist_entry__new(pair, true); in hists__add_dummy_entry()
2374 struct hist_entry *pair) in add_dummy_hierarchy_entry() argument
2390 cmp = fmt->collapse(fmt, he, pair); in add_dummy_hierarchy_entry()
2405 he = hist_entry__new(pair, true); in add_dummy_hierarchy_entry()
2476 struct hist_entry *pos, *pair; in hists__match_hierarchy() local
2480 pair = hists__find_hierarchy_entry(other_root, pos); in hists__match_hierarchy()
2482 if (pair) { in hists__match_hierarchy()
2483 hist_entry__add_pair(pair, pos); in hists__match_hierarchy()
[all …]
|
| /tools/memory-model/Documentation/ |
| D | recipes.txt | 70 consider the following pair of code fragments:
121 These examples show only a single pair of CPUs, but the effects of the
203 The MP pattern has one CPU execute a pair of stores to a pair of variables
204 and another CPU execute a pair of loads from this same pair of variables,
564 between each successive pair of non-write-to-read links. This
|
| D | litmus-tests.txt | 1011 In contrast, LKMM will interpret this as a nested pair of
|
| /tools/perf/Documentation/ |
| D | intel-bts.txt | 13 code is still needed to pair up calls and returns correctly, consequently much
|
| D | perf-diff.txt | 193 the command line are searched for the baseline sample pair. If the pair
206 x - computation takes place for pair
|
| D | perf-script-perl.txt | 208 nsecs($secs, $nsecs) - returns total nsecs given secs/nsecs pair
|
| D | perf-script-python.txt | 607 nsecs(secs, nsecs) - returns total nsecs given secs/nsecs pair
|
| D | perf-record.txt | 114 - a group of events surrounded by a pair of brace ("{event1,event2,...}").
|
| /tools/testing/selftests/tc-testing/ |
| D | README | 17 * The kernel must have veth support available, as a veth pair is created
58 network namespace and creates a veth pair which may be used in those test
60 to tdc when starting a test run; the veth pair will still be created
|
| /tools/kvm/kvm_stat/ |
| D | kvm_stat | 1164 def sortkey(pair): argument
1166 v = pair[1]
1169 def sortkey(pair): argument
1171 v = pair[1]
|
| /tools/testing/selftests/tc-testing/creating-testcases/ |
| D | AddingTestCases.txt | 94 A pair of setup commands. The first can have exit code 0, 1 or 255, the
|
| /tools/bpf/bpftool/Documentation/ |
| D | bpftool-gen.rst | 99 This pair of functions allow to attach and detach,
|