Searched refs:ordered (Results 1 – 19 of 19) sorted by relevance
| /tools/lib/subcmd/ |
| A D | parse-options.c | 811 struct option *opt, *ordered = NULL, *group; in options__order() local
823 group = realloc(ordered, len); in options__order()
826 ordered = group; in options__order()
832 memcpy(&ordered[nr_opts], o, sizeof(*o)); in options__order()
835 for (opt = group = ordered; opt->type != OPTION_END; opt++) { in options__order()
847 return ordered; in options__order()
885 struct option *ordered; in usage_with_options_internal() local
910 ordered = options__order(opts); in usage_with_options_internal()
911 if (ordered) in usage_with_options_internal()
912 opts = ordered; in usage_with_options_internal()
[all …]
|
| /tools/memory-model/litmus-tests/ |
| A D | CoWW+poonceonce.litmus | 7 * writes to the same variable are ordered.
|
| A D | CoRR+poonceonce+Once.litmus | 7 * reads from the same variable are ordered.
|
| A D | CoRW+poonceonce+Once.litmus | 7 * a given variable and a later write to that same variable are ordered.
|
| A D | CoWR+poonceonce+Once.litmus | 7 * given variable and a later read from that same variable are ordered.
|
| A D | R+fencembonceonces.litmus | 6 * This is the fully ordered (via smp_mb()) version of one of the classic
|
| A D | MP+polockmbonce+poacquiresilsil.litmus | 8 * state, ordered by acquire? Note that when the first spin_is_locked()
|
| A D | MP+polockonce+poacquiresilsil.litmus | 7 * to sense the lock-held state, ordered by acquire? Note that when the
|
| A D | Z6.0+pooncelock+pooncelock+pombonce.litmus | 8 * seen as ordered by a third process not holding that lock.
|
| A D | README | 7 successive reads from the same variable are ordered.
12 are ordered.
17 are ordered.
21 successive writes to the same variable are ordered.
109 This is the fully ordered (via smp_mb()) version of one of
117 This is the fully ordered (again, via smp_mb() version of store
|
| /tools/perf/Documentation/ |
| A D | perf.txt | 60 ordered-events - ordered events object debug messages
|
| /tools/memory-model/Documentation/ |
| A D | locking.txt | 141 be ordered before the READ_ONCE() from data, thus solving the first
143 ordered after the WRITE_ONCE() to "data", solving the second problem.
156 It is not necessarily the case that accesses ordered by locking will be
157 seen as ordered by CPUs not holding that lock. Consider this example:
|
| A D | control-dependencies.txt | 45 by a store, and this compiler-generated load would not be ordered by
210 ordered CPU would have no dependency of any sort between the load from
|
| A D | recipes.txt | 129 However, it is not necessarily the case that accesses ordered by
130 locking will be seen as ordered by CPUs not holding that lock.
442 It is tempting to assume that CPU0()'s store to x is globally ordered
|
| A D | simple.txt | 197 Lockless, fully ordered
206 accesses. Otherwise, use only fully ordered operations when accessing
|
| A D | ordering.txt | 245 The Linux kernel provides a wide variety of ordered memory accesses:
486 This category of operations can be efficiently ordered using
|
| A D | explanation.txt | 266 It's not possible to have X ordered before Y, Y ordered before Z, and
267 Z ordered before X, because this would mean that X is ordered before
277 In short, if a memory model requires certain accesses to be ordered,
538 accesses in the two examples above will be ordered. This is another
830 program order. Exactly which instructions are ordered depends on the
967 hold if the accesses to the fixed memory location can be ordered as
2454 marked access X such that R and X are ordered by a suitable fence and
2456 marked access Y such that X ->xb* Y, and Y and E are ordered by a
|
| /tools/bpf/bpftool/Documentation/ |
| A D | bpftool-net.rst | 55 tcx/netkit/tc programs are ordered based on ifindex number. If multiple bpf
|
| /tools/perf/util/ |
| A D | Build | 76 perf-util-y += ordered-events.o
|
Completed in 26 milliseconds