| /linux/tools/memory-model/litmus-tests/ |
| H A D | LB+unlocklockonceonce+poacquireonce.litmus | 10 * the viewpoint of another CPU (the kind of reordering allowed by TSO).
|
| /linux/Documentation/devicetree/bindings/mtd/ |
| H A D | gpio-control-nand.txt | 23 location used to guard against bus reordering with regards to accesses to
|
| /linux/drivers/platform/x86/amd/ |
| H A D | Kconfig | 16 that alters CPU core reordering. This bias prefers cores with higher
|
| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | bpf_cc_cubic.c | 98 if (tcp_sk(sk)->reordering > TCP_REORDERING) in tcp_cwnd_reduction()
|
| /linux/Documentation/block/ |
| H A D | blk-mq.rst | 98 any reordering. When the device starts processing requests in the hardware 119 There is no reordering at this stage, and each software queue has a set of
|
| /linux/Documentation/userspace-api/ |
| H A D | rseq.rst | 201 barrier(); // Prevent compiler reordering 203 barrier(); // Prevent compiler reordering
|
| /linux/net/ipv4/ |
| H A D | tcp_input.c | 623 nr_segs = max_t(u32, nr_segs, tp->reordering + 1); in tcp_sndbuf_expand() 1287 if ((metric > tp->reordering * mss) && mss) { in tcp_check_sack_reordering() 1291 tp->reordering, in tcp_check_sack_reordering() 1296 WRITE_ONCE(tp->reordering, in tcp_check_sack_reordering() 2443 WRITE_ONCE(tp->reordering, in tcp_check_reno_reordering() 2560 u8 reordering; in tcp_enter_loss() local 2581 reordering = READ_ONCE(net->ipv4.sysctl_tcp_reordering); in tcp_enter_loss() 2583 tp->sacked_out >= reordering) in tcp_enter_loss() 2584 WRITE_ONCE(tp->reordering, in tcp_enter_loss() 2585 min_t(unsigned int, tp->reordering, reordering)); in tcp_enter_loss() [all …]
|
| /linux/include/linux/ |
| H A D | tcp.h | 210 u32 reordering; /* Packet reordering metric. */ member
|
| /linux/Documentation/arch/x86/ |
| H A D | amd-hfi.rst | 83 a reordering of the performance and efficiency ranking. Table updates happen
|
| /linux/tools/perf/Documentation/ |
| H A D | perf.data-file-format.txt | 504 below). perf record guarantees that there is no reordering over a 563 No event reordering over this header. No payload.
|
| H A D | perf-sched.txt | 98 Note: The tool will not give correct results if there is topological reordering or
|
| /linux/Documentation/core-api/ |
| H A D | padata.rst | 13 decryption on large numbers of packets without reordering those packets. This
|
| /linux/Documentation/admin-guide/blockdev/ |
| H A D | zoned_loop.rst | 105 ordered_zone_append Enable zloop mitigation of zone append reordering.
|
| /linux/Documentation/ |
| H A D | memory-barriers.txt | 367 can use a variety of tricks to improve performance, including reordering, 919 (*) Control dependencies require that the compiler avoid reordering the 1547 (*) Prevents the compiler from reordering accesses following the 1875 compiler and the CPU from reordering them. 2059 respectively, this same reordering can occur if the lock's ACQUIRE and 2078 It might appear that this reordering could introduce a deadlock. 2085 the reordering, not the compiler. If the compiler (or, for 2352 Under normal operation, memory operation reordering is generally not going to 2355 circumstances in which reordering definitely _could_ be a problem: 2879 and st.rel instructions (respectively) that prevent such reordering.
|
| /linux/Documentation/filesystems/ |
| H A D | romfs.rst | 179 from the filesystem. It might be resolved by reordering file data to
|
| /linux/Documentation/networking/device_drivers/ethernet/freescale/ |
| H A D | dpaa.rst | 199 This ensures a very low rate of frame reordering. A drawback of this
|
| /linux/tools/memory-model/Documentation/ |
| H A D | control-dependencies.txt | 242 (*) Control dependencies require that the compiler avoid reordering the
|
| H A D | simple.txt | 25 In single-threaded code, there is no reordering, at least assuming
|
| /linux/Documentation/networking/ |
| H A D | nexthop-group-resilient.rst | 42 the same server, the issue is that different latencies and reordering along
|
| H A D | l2tp.rst | 192 RECV_TIMEOUT N Timeout to wait when reordering received 237 RECV_TIMEOUT N Timeout to wait when reordering received
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | dev-encoder.rst | 463 e.g. frame reordering. 477 reordering is used,
|
| /linux/Documentation/locking/ |
| H A D | ww-mutex-design.rst | 185 list-reordering allows for a bit more idiomatic code::
|
| /linux/Documentation/RCU/ |
| H A D | rcu_dereference.rst | 277 to some reordering from the compiler and CPUs is beside the point.
|
| /linux/Documentation/scsi/ |
| H A D | ChangeLog.megaraid | 404 i. Function reordering so that inline functions are defined before they
|
| /linux/Documentation/RCU/Design/Requirements/ |
| H A D | Requirements.rst | 185 | Without that extra grace period, memory reordering could result in | 250 to prevent the compiler and the CPU from reordering in this manner, 300 | initialized. So reordering the assignments to ``p->a`` and ``p->b`` | 736 within its rights to do significant reordering. This is by design: Any 747 | prevent the compiler from reordering in this particular case. |
|