/tools/testing/selftests/rcutorture/doc/ |
D | TREE_RCU-kconfig.txt | 8 CONFIG_DEBUG_OBJECTS_RCU_HEAD -- Do one. 10 CONFIG_HZ_PERIODIC -- Do one. 12 CONFIG_NO_HZ_FULL -- Do two, one with partial CPU enablement. 16 CONFIG_RCU_BOOST -- one of PREEMPT_RCU. 18 CONFIG_RCU_FANOUT_LEAF -- Do one non-default. 19 CONFIG_RCU_FAST_NO_HZ -- Do one, but not with all nohz_full CPUs. 20 CONFIG_RCU_NOCB_CPU -- Do three, one with no rcu_nocbs CPUs, one with 21 rcu_nocbs=0, and one with all rcu_nocbs CPUs. 23 CONFIG_SMP -- Need one !SMP for PREEMPT_RCU. 25 CONFIG_RCU_EQS_DEBUG -- Do at least one for CONFIG_NO_HZ_FULL and not. [all …]
|
/tools/testing/selftests/net/ |
D | tcp_inq.c | 99 int c, one = 1, inq = -1; in main() local 129 &one, sizeof(one)) != 0) in main() 146 if (setsockopt(fd, SOL_TCP, TCP_INQ, &one, sizeof(one)) != 0) in main()
|
D | nettest.c | 345 int one = 1; in set_pktinfo_v4() local 348 rc = setsockopt(sd, SOL_IP, IP_PKTINFO, &one, sizeof(one)); in set_pktinfo_v4() 357 int one = 1; in set_recvpktinfo_v6() local 360 rc = setsockopt(sd, SOL_IPV6, IPV6_RECVPKTINFO, &one, sizeof(one)); in set_recvpktinfo_v6() 369 int one = 1; in set_recverr_v4() local 372 rc = setsockopt(sd, SOL_IP, IP_RECVERR, &one, sizeof(one)); in set_recverr_v4() 381 int one = 1; in set_recverr_v6() local 384 rc = setsockopt(sd, SOL_IPV6, IPV6_RECVERR, &one, sizeof(one)); in set_recverr_v6() 448 unsigned int one = 1; in set_broadcast() local 451 if (setsockopt(sd, SOL_SOCKET, SO_BROADCAST, &one, sizeof(one)) != 0) { in set_broadcast() [all …]
|
D | psock_snd.c | 220 const int one = 1; in do_tx() local 231 setsockopt(fd, SOL_PACKET, PACKET_QDISC_BYPASS, &one, sizeof(one))) in do_tx() 235 setsockopt(fd, SOL_PACKET, PACKET_VNET_HDR, &one, sizeof(one))) in do_tx()
|
D | ipv6_flowlabel.c | 186 const int one = 1; in main() local 206 if (setsockopt(fdr, SOL_IPV6, IPV6_FLOWINFO, &one, sizeof(one))) in main()
|
/tools/perf/util/ |
D | expr.y | 187 static bool already_seen(const char *val, const char *one, const char **other, 192 if (one && !strcasecmp(one, val)) 200 int expr__find_other(const char *p, const char *one, const char ***other, 219 if (tok == ID && !already_seen(val.id, one, *other, num_other)) {
|
D | expr.h | 23 int expr__find_other(const char *p, const char *one, const char ***other,
|
/tools/memory-model/litmus-tests/ |
D | Z6.0+pooncerelease+poacquirerelease+fencembonceonce.litmus | 7 * when there is but one non-reads-from (AKA non-rf) link, does not suffice 8 * if there is more than one. Of the three processes, only P1() reads from 12 * When there are two or more non-rf links, you typically will need one
|
D | ISA2+pooncerelease+poacquirerelease+poacquireonce.litmus | 8 * that the release-acquire chain suffices is because in all but one 10 * write. In memory-model-speak, there is only one non-reads-from
|
D | R+poonceonces.litmus | 6 * This is the unordered (thus lacking smp_mb()) version of one of the
|
D | LB+poacquireonce+pooncerelease.litmus | 7 * test, where each process reads from one of two variables then writes
|
D | R+fencembonceonces.litmus | 6 * This is the fully ordered (via smp_mb()) version of one of the classic
|
D | README | 54 load-buffering litmus test, where each process reads from one 59 litmus test, where each process reads from one of two variables then 71 in one process, and use an acquire load followed by a pair of 75 Protect the access with a lock in one process, and use an 95 the loads) suffice for the message-passing litmus test, where one 101 This is the fully ordered (via smp_mb()) version of one of 168 sign ("+"), and one string for each process, separated by plus signs. 174 For example, if the one process writes to a pair of variables, and 177 left-hand end of the second row of tests on page one of test6.pdf.
|
/tools/testing/selftests/bpf/ |
D | test_sockmap_kern.h | 177 int *bytes, zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5; in bpf_prog4() local 187 end = bpf_map_lookup_elem(&sock_bytes, &one); in bpf_prog4() 204 int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5; in bpf_prog5() local 217 end = bpf_map_lookup_elem(&sock_bytes, &one); in bpf_prog5() 270 int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5, key = 0; in bpf_prog6() local 282 end = bpf_map_lookup_elem(&sock_bytes, &one); in bpf_prog6() 312 int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5; in bpf_prog7() local 327 end = bpf_map_lookup_elem(&sock_bytes, &one); in bpf_prog7() 426 int zero = 0, one = 1, two = 2, three = 3, four = 4, five = 5; in bpf_prog10() local 435 end = bpf_map_lookup_elem(&sock_bytes, &one); in bpf_prog10()
|
/tools/kvm/kvm_stat/ |
D | kvm_stat.txt | 65 run in batch mode for one second 85 limit statistics to one virtual machine (pid) 89 limit statistics to one virtual machine (guest name)
|
/tools/perf/tests/ |
D | sample-parsing.c | 72 COMP(read.one.value); in samples_same() 82 COMP(read.one.id); in samples_same() 240 sample.read.one.value = 0x08789faeb786aa87ULL; in do_test() 241 sample.read.one.id = 99; in do_test()
|
/tools/testing/selftests/net/forwarding/ |
D | README | 4 One of the nice things about network namespaces is that they allow one 38 not always available. With the VRF-based approach one merely needs to
|
/tools/memory-model/scripts/ |
D | README | 34 with the absolute pathnames of the tests to run provided one 64 Run the litmus tests whose absolute pathnames are provided one
|
/tools/memory-model/Documentation/ |
D | recipes.txt | 15 there is only one CPU or only one memory location is accessed, and the 22 If there is only one CPU on the one hand or only one variable 38 3. If there is only one variable but multiple CPUs, that variable 203 The MP pattern has one CPU execute a pair of stores to a pair of variables 216 Use of smp_store_release() and smp_load_acquire() is one way to force 353 The LB pattern has one CPU load from one variable and then store to a 475 that one CPU first stores to one variable and then loads from a second, 558 o If all but one of the links are write-to-read links, then a 562 o If more than one of the links are something other than
|
/tools/lib/bpf/ |
D | README.rst | 11 All types and functions provided by libbpf API should have one of the 20 and map one-on-one to corresponding commands. 84 non-static libbpf symbols should have one of the prefixes mentioned in
|
D | netlink.c | 34 int one = 1, ret; in libbpf_netlink_open() local 45 &one, sizeof(one)) < 0) { in libbpf_netlink_open()
|
/tools/perf/ |
D | design.txt | 19 There's one file descriptor per virtual counter used. 123 A counter of type PERF_TYPE_SOFTWARE will count one of the available 150 counters. A "counting" counter is one that is used for counting the 169 Using these additional values one can establish the overcommit ratio for a 170 particular counter allowing one to take the round-robin scheduling effect 174 A "sampling" counter is one that is set up to generate an interrupt 266 counter group has one counter which is the group "leader". The leader 405 Normally a notification is generated for every page filled, however one can 406 additionally set perf_event_attr.wakeup_events to generate one every
|
/tools/bpf/bpftool/Documentation/ |
D | bpftool-cgroup.rst | 65 *ATTACH_FLAGS* can be one of: **override** if a sub-cgroup installs 71 Only one program is allowed to be attached to a cgroup with 73 program will release old program and attach the new one.
|
/tools/testing/selftests/livepatch/ |
D | README | 40 "test_klp" strings, so tests be sure to include one of those strings for
|
/tools/usb/usbip/ |
D | INSTALL | 21 It may also create one or more `.h' files containing system-dependent 91 You can compile the package for more than one kind of computer at the 98 With a non-GNU `make', it is safer to compile the package for one 100 installed the package for one architecture, use `make distclean' before 154 where SYSTEM can have one of these forms:
|