Home
last modified time | relevance | path

Searched refs:pair (Results 1 – 25 of 37) sorted by relevance

12

/tools/perf/tests/
A Dvmlinux-kallsyms.c133 if (pair) { in test__vmlinux_matches_kallsyms_cb1()
134 map__set_priv(pair); in test__vmlinux_matches_kallsyms_cb1()
135 map__put(pair); in test__vmlinux_matches_kallsyms_cb1()
149 struct map *pair; in test__vmlinux_matches_kallsyms_cb2() local
155 if (pair != NULL && !map__priv(pair) && map__start(pair) == mem_start) { in test__vmlinux_matches_kallsyms_cb2()
167 map__start(pair), map__end(pair), map__pgoff(pair)); in test__vmlinux_matches_kallsyms_cb2()
169 map__set_priv(pair); in test__vmlinux_matches_kallsyms_cb2()
171 map__put(pair); in test__vmlinux_matches_kallsyms_cb2()
301 pair = first_pair; in test__vmlinux_matches_kallsyms()
303 if (pair && UM(pair->start) == mem_start) { in test__vmlinux_matches_kallsyms()
[all …]
A Dcpumap.c253 struct perf_cpu_map *pair = perf_cpu_map__new("1-2"); in test__cpu_map_equal() local
255 struct perf_cpu_map **maps[] = {&empty, &any, &one, &two, &pair}; in test__cpu_map_equal()
270 TEST_ASSERT_VAL("pair", perf_cpu_map__equal(pair, two)); in test__cpu_map_equal()
272 tmp = perf_cpu_map__intersect(pair, one); in test__cpu_map_equal()
/tools/testing/selftests/riscv/vector/
A Dv_helpers.c13 struct riscv_hwprobe pair; in is_xtheadvector_supported() local
15 pair.key = RISCV_HWPROBE_KEY_VENDOR_EXT_THEAD_0; in is_xtheadvector_supported()
16 riscv_hwprobe(&pair, 1, 0, NULL, 0); in is_xtheadvector_supported()
17 return pair.value & RISCV_HWPROBE_VENDOR_EXT_XTHEADVECTOR; in is_xtheadvector_supported()
22 struct riscv_hwprobe pair; in is_vector_supported() local
24 pair.key = RISCV_HWPROBE_KEY_IMA_EXT_0; in is_vector_supported()
25 riscv_hwprobe(&pair, 1, 0, NULL, 0); in is_vector_supported()
26 return pair.value & RISCV_HWPROBE_EXT_ZVE32X; in is_vector_supported()
/tools/testing/selftests/riscv/hwprobe/
A Dcbo.c90 struct riscv_hwprobe pair = { in test_zicbom() local
98 block_size = pair.value; in test_zicbom()
114 struct riscv_hwprobe pair = { in test_zicboz() local
123 block_size = pair.value; in test_zicboz()
162 struct riscv_hwprobe pair = { in check_no_zicbo_cpus() local
182 if (pair.value & cbo) in check_no_zicbo_cpus()
217 struct riscv_hwprobe pair; in main() local
236 pair.key = RISCV_HWPROBE_KEY_IMA_EXT_0; in main()
240 assert(rc == 0 && pair.key == RISCV_HWPROBE_KEY_IMA_EXT_0); in main()
242 if (pair.value & RISCV_HWPROBE_EXT_ZICBOZ) { in main()
[all …]
/tools/perf/
A Dbuiltin-diff.c283 double new_percent = period_percent(pair, pair->stat.period); in compute_delta()
309 return pair->diff.wdiff; in compute_wdiff()
510 struct hist_entry *pair; in get_pair_data() local
514 return pair; in get_pair_data()
626 pair->diff.cycles = in compute_cycles_diff()
627 pair->block_info->cycles_aggr / pair->block_info->num_aggr - in compute_cycles_diff()
665 if (pair) { in block_hists_match()
700 if (!pair) in hists__precompute()
1394 if (!pair) { in __hpp__color_compare()
1516 if (!pair) { in hpp__color_cycles_hist()
[all …]
/tools/perf/scripts/python/
A Dcompaction-times.py54 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/
A Dlock.cat17 * 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 *)
88 (* Utility macro to convert a single pair to a single-edge relation *)
89 let pair-to-relation p = p ++ 0
105 map pair-to-relation (possible-rfe-noncrit-lf e)
126 map pair-to-relation (possible-rf-ru e)
/tools/testing/kunit/
A Dkunit_config.py68 pair = (KconfigEntry(name, value), KconfigEntry(name, b))
69 diff.append(pair)
/tools/memory-model/litmus-tests/
A DREADME27 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
67 Does a unlock+lock pair provides ordering guarantee between a
75 in one process, and use an acquire load followed by a pair of
80 acquire load followed by a pair of spin_is_locked() calls
98 Does a unlock+lock pair provides ordering guarantee between a
182 For example, if the one process writes to a pair of variables, and
213 interleaving descriptions of the relation between a pair of consecutive
214 accesses with descriptions of the second access in the pair.
A DLB+poacquireonce+pooncerelease.litmus6 * Does a release-acquire pair suffice for the load-buffering litmus
A DZ6.0+pooncelock+pooncelock+pombonce.litmus6 * This example demonstrates that a pair of accesses made by different
A DIRIW+poonceonces+OnceOnce.litmus9 * of a pair of writes, where each write is to a different variable by a
A DIRIW+fencembonceonces+OnceOnce.litmus8 * cause two different reading processes to agree on the order of a pair
/tools/testing/selftests/drivers/net/lib/py/
A Denv.py45 pair = line.split('=', maxsplit=1)
46 if len(pair) != 2:
48 env[pair[0]] = pair[1]
/tools/perf/ui/
A Dhist.c83 struct hist_entry *pair; in __hpp__fmt() local
88 list_for_each_entry(pair, &he->pairs.head, pairs.node) { in __hpp__fmt()
90 if (values[i].hists != pair->hists) in __hpp__fmt()
93 values[i].val = get_field(pair); in __hpp__fmt()
94 values[i].samples = pair->stat.nr_events; in __hpp__fmt()
212 struct hist_entry *pair; in hist_entry__new_pair() local
217 list_for_each_entry(pair, &a->pairs.head, pairs.node) { in hist_entry__new_pair()
218 struct evsel *evsel = hists_to_evsel(pair->hists); in hist_entry__new_pair()
219 fa[evsel__group_idx(evsel)] = get_field(pair); in hist_entry__new_pair()
223 struct evsel *evsel = hists_to_evsel(pair->hists); in hist_entry__new_pair()
[all …]
/tools/perf/util/
A Dstream.c267 struct evsel_streams *es, bool pair) in print_stream_callchain() argument
280 if (pair) { in print_stream_callchain()
292 if (pair) in print_stream_callchain()
A Dhist.c2544 struct hist_entry *pair) in hists__add_dummy_entry() argument
2577 he = hist_entry__new(pair, true); in hists__add_dummy_entry()
2594 struct hist_entry *pair) in add_dummy_hierarchy_entry() argument
2619 he = hist_entry__new(pair, true); in add_dummy_hierarchy_entry()
2684 struct hist_entry *pos, *pair; in hists__match_hierarchy() local
2690 if (pair) { in hists__match_hierarchy()
2691 hist_entry__add_pair(pair, pos); in hists__match_hierarchy()
2704 struct hist_entry *pos, *pair; in hists__match() local
2721 if (pair) in hists__match()
2779 struct hist_entry *pos, *pair; in hists__link() local
[all …]
/tools/memory-model/Documentation/
A Drecipes.txt74 consider the following pair of code fragments:
125 These examples show only a single pair of CPUs, but the effects of the
207 The MP pattern has one CPU execute a pair of stores to a pair of variables
208 and another CPU execute a pair of loads from this same pair of variables,
568 between each successive pair of non-write-to-read links. This
A Dglossary.txt69 Cycle: Memory-barrier pairing is restricted to a pair of CPUs, as the
70 name suggests. And in a great many cases, a pair of CPUs is all
83 each pair of memory accesses, the outcome where r0, r1, and r2
A Dcontrol-dependencies.txt39 Control dependencies can pair with each other and with other types
208 The control dependencies would then extend only to the pair of cmov
251 (*) Control dependencies pair normally with other types of barriers.
A Dlocking.txt29 pair of code fragments:
86 These examples show only a single pair of CPUs, but the effects of the
/tools/testing/selftests/tc-testing/
A DREADME16 * The kernel must have veth support available, as a veth pair is created
57 network namespace and creates a veth pair which may be used in those test
59 to tdc when starting a test run; the veth pair will still be created
/tools/testing/selftests/devices/probe/boards/
A Dgoogle,spherion.yaml31 # denoting the device (identified by device-function pair) at each level in the
/tools/perf/Documentation/
A Dintel-bts.txt13 code is still needed to pair up calls and returns correctly, consequently much
A Dperf-diff.txt193 the command line are searched for the baseline sample pair. If the pair
206 x - computation takes place for pair

Completed in 42 milliseconds

12