Home
last modified time | relevance | path

Searched refs:pairs (Results 1 – 23 of 23) sorted by relevance

/tools/testing/selftests/riscv/hwprobe/
A Dhwprobe.c7 struct riscv_hwprobe pairs[8]; in main() local
22 pairs[i].key = i; in main()
30 if ((i < 4) && (pairs[i].key != i)) in main()
40 ksft_exit_fail_msg("Unexpected pair: (%lld, %llu)\n", pairs[i].key, pairs[i].value); in main()
43 out = riscv_hwprobe(pairs, 8, 0, 0, 0); in main()
49 out = riscv_hwprobe(pairs, 8, 1, 0, 0); in main()
57 pairs[0].key = 0x5555; in main()
58 pairs[1].key = 1; in main()
59 pairs[1].value = 0xAAAA; in main()
60 out = riscv_hwprobe(pairs, 2, 0, 0, 0); in main()
[all …]
A Dwhich-cpus.c61 struct riscv_hwprobe *pairs; in do_which_cpus() local
66 pairs = malloc(nr_pairs * sizeof(struct riscv_hwprobe)); in do_which_cpus()
67 assert(pairs); in do_which_cpus()
71 pairs[i].key = strtol(start, &end, 0); in do_which_cpus()
74 pairs[i].value = strtoul(start, &end, 0); in do_which_cpus()
81 free(pairs); in do_which_cpus()
86 struct riscv_hwprobe pairs[2]; in main() local
106 rc = riscv_hwprobe(pairs, 1, 0, NULL, 0); in main()
111 rc = riscv_hwprobe(pairs, 1, 0, NULL, 0); in main()
113 ext0_all = pairs[0].value; in main()
[all …]
A Dhwprobe.h22 long riscv_hwprobe(struct riscv_hwprobe *pairs, size_t pair_count,
/tools/bpf/resolve_btfids/
A Dmain.c711 BUILD_BUG_ON((u32 *)set8->pairs != &set8->pairs[0].id); in sets_patch()
712 qsort(set8->pairs, set8->cnt, sizeof(set8->pairs[0]), cmp_id); in sets_patch()
727 set8->pairs[i].flags = in sets_patch()
728 bswap_32(set8->pairs[i].flags); in sets_patch()
/tools/memory-model/litmus-tests/
A DIRIW+poonceonces+OnceOnce.litmus7 * between each pairs of reads. In other words, is anything at all
A DIRIW+fencembonceonces+OnceOnce.litmus7 * between each pairs of reads. In other words, is smp_mb() sufficient to
A DREADME25 between each pairs of reads. In other words, is smp_mb()
33 between each pairs of reads. In other words, is anything at all
/tools/perf/util/
A Dhist.h244 } pairs; member
328 return !list_empty(&he->pairs.node); in hist_entry__has_pairs()
334 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node); in hist_entry__next_pair()
341 list_add_tail(&pair->pairs.node, &he->pairs.head); in hist_entry__add_pair()
A Dhist.c589 INIT_LIST_HEAD(&he->pairs.node); in hist_entry__init()
2740 list_for_each_entry(leader, &pos->pairs.head, pairs.node) { in hists__link_hierarchy()
2820 list_del_init(&pos->pairs.node); in hists__unlink()
A Dannotate-data.c1768 list_for_each_entry(pair, &he->pairs.head, pairs.node) in print_annotated_data_header()
/tools/memory-model/
A Dlinux-kernel.bell56 (* Compute matching pairs of nested Rcu-lock and Rcu-unlock *)
72 (* Compute matching pairs of nested Srcu-lock and Srcu-unlock *)
/tools/include/linux/
A Dbtf_ids.h19 } pairs[]; member
/tools/perf/Documentation/
A Dperf-inject.txt36 Override build-ids to inject using these comma-separated pairs of
37 build-id and path. Understands file://filename to read these pairs
A Dtips.txt47 Show current config key-value pairs: perf config --list
A Dperf-config.txt150 If you want to know multiple config key/value pairs, you can do like
/tools/perf/ui/
A Dhist.c88 list_for_each_entry(pair, &he->pairs.head, pairs.node) { in __hpp__fmt()
217 list_for_each_entry(pair, &a->pairs.head, pairs.node) { in hist_entry__new_pair()
222 list_for_each_entry(pair, &b->pairs.head, pairs.node) { in hist_entry__new_pair()
/tools/gpio/
A Dgpio-sloppy-logic-analyzer.sh44 -t|--trigger <str>: pattern to use as trigger. <str> consists of two-char pairs. First
47 These pairs can be combined with "+", so "1H+2F" triggers when probe 1
/tools/testing/selftests/net/forwarding/
A DREADME42 on any Linux box using veth pairs to emulate physical loopbacks.
/tools/memory-model/Documentation/
A Dglossary.txt135 Memory barriers thus tend to come in pairs, one executed by
138 smp_store_release() pairs with an smp_load_acquire() that reads
A Dlocking.txt144 The smp_store_release() pairs with the smp_load_acquire(), thus ensuring
A Drecipes.txt400 * Where A pairs with D, and B pairs with C.
A Dexplanation.txt1874 to pairs of critical sections and grace periods having the
1993 pairs (that is, a data link followed by an rf link) to occur between
/tools/perf/
A Dbuiltin-diff.c512 list_for_each_entry(pair, &he->pairs.head, pairs.node) in get_pair_data()

Completed in 41 milliseconds