| /linux-5.19.10/Documentation/dev-tools/ |
| D | kcsan.rst | 215 memory operation from reordering before the barrier. Developers should
275 based on modeling access reordering (with ``CONFIG_KCSAN_WEAK_MEMORY=y``).
277 simulated reordering within the scope of its function (at most 1 in-flight
280 Once an access has been selected for reordering, it is checked along every
283 reordering.
302 simulated reordering. After the write of ``flag``, ``x`` is again checked for
305 would not be considered for reordering after the proper release of ``flag``,
313 accesses, and the only access type for which KCSAN simulates reordering. This
314 means reordering of marked accesses is not modeled.
|
| /linux-5.19.10/net/ipv4/ |
| D | tcp_recovery.c | 16 if (tp->sacked_out >= tp->reordering && in tcp_rack_reo_wnd()
222 if ((state < TCP_CA_Recovery && tp->sacked_out >= tp->reordering) || in tcp_newreno_mark_lost()
|
| D | tcp_metrics.c | 430 if (val < tp->reordering && in tcp_update_metrics()
431 tp->reordering != in tcp_update_metrics()
434 tp->reordering); in tcp_update_metrics()
479 if (val && tp->reordering != val) in tcp_init_metrics()
480 tp->reordering = val; in tcp_init_metrics()
|
| D | tcp_input.c | 418 nr_segs = max_t(u32, nr_segs, tp->reordering + 1); in tcp_sndbuf_expand()
1045 if ((metric > tp->reordering * mss) && mss) { in tcp_check_sack_reordering()
1049 tp->reordering, in tcp_check_sack_reordering()
1054 tp->reordering = min_t(u32, (metric + mss - 1) / mss, in tcp_check_sack_reordering()
2033 tp->reordering = min_t(u32, tp->packets_out + addend, in tcp_check_reno_reordering()
2144 u8 reordering; in tcp_enter_loss() local
2165 reordering = READ_ONCE(net->ipv4.sysctl_tcp_reordering); in tcp_enter_loss()
2167 tp->sacked_out >= reordering) in tcp_enter_loss()
2168 tp->reordering = min_t(unsigned int, tp->reordering, in tcp_enter_loss()
2169 reordering); in tcp_enter_loss()
[all …]
|
| D | tcp.c | 444 tp->reordering = READ_ONCE(sock_net(sk)->ipv4.sysctl_tcp_reordering); in tcp_init_sock()
3753 info->tcpi_reordering = tp->reordering; in tcp_get_info()
3926 nla_put_u32(stats, TCP_NLA_REORDERING, tp->reordering); in tcp_get_timestamping_opt_stats()
|
| /linux-5.19.10/tools/memory-model/litmus-tests/ |
| D | LB+unlocklockonceonce+poacquireonce.litmus | 10 * the viewpoint of another CPU (the kind of reordering allowed by TSO).
|
| /linux-5.19.10/Documentation/devicetree/bindings/display/bridge/ |
| D | ti,sn65dsi86.yaml | 120 reordering but only on physical ports 0 and 1.
134 reordering in any way.
|
| /linux-5.19.10/Documentation/devicetree/bindings/mtd/ |
| D | gpio-control-nand.txt | 23 location used to guard against bus reordering with regards to accesses to
|
| /linux-5.19.10/Documentation/block/ |
| 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-5.19.10/include/linux/ |
| D | tcp.h | 273 u32 reordering; /* Packet reordering metric. */ member
|
| /linux-5.19.10/tools/perf/Documentation/ |
| D | perf.data-file-format.txt | 461 below). perf record guarantees that there is no reordering over a
520 No event reordering over this header. No payload.
|
| /linux-5.19.10/Documentation/devicetree/bindings/media/ |
| D | video-interfaces.yaml | 170 support lane reordering, monotonically incremented values shall be used
|
| /linux-5.19.10/Documentation/core-api/ |
| D | padata.rst | 13 decryption on large numbers of packets without reordering those packets. This
|
| /linux-5.19.10/Documentation/admin-guide/media/ |
| D | imx.rst | 54 along with block reordering, in coordination with vertical flip.
208 pixel reordering within the same colorspace can be carried out by the
324 de-interlace without motion compensation, and pixel reordering.
|
| /linux-5.19.10/Documentation/ |
| D | memory-barriers.txt | 368 can use a variety of tricks to improve performance, including reordering,
900 (*) Control dependencies require that the compiler avoid reordering the
1528 (*) Prevents the compiler from reordering accesses following the
1856 compiler and the CPU from reordering them.
2039 respectively, this same reordering can occur if the lock's ACQUIRE and
2058 It might appear that this reordering could introduce a deadlock.
2065 the reordering, not the compiler. If the compiler (or, for
2330 Under normal operation, memory operation reordering is generally not going to
2333 circumstances in which reordering definitely _could_ be a problem:
2856 and st.rel instructions (respectively) that prevent such reordering.
|
| /linux-5.19.10/Documentation/filesystems/ |
| D | romfs.rst | 179 from the filesystem. It might be resolved by reordering file data to
|
| /linux-5.19.10/Documentation/networking/device_drivers/ethernet/freescale/ |
| D | dpaa.rst | 199 This ensures a very low rate of frame reordering. A drawback of this
|
| /linux-5.19.10/tools/memory-model/Documentation/ |
| D | control-dependencies.txt | 242 (*) Control dependencies require that the compiler avoid reordering the
|
| D | simple.txt | 25 In single-threaded code, there is no reordering, at least assuming
|
| /linux-5.19.10/Documentation/networking/ |
| D | nexthop-group-resilient.rst | 42 the same server, the issue is that different latencies and reordering along
|
| D | tls-offload.rst | 194 In presence of packet drops or network packet reordering, the device may lose
496 A device is permitted to perform packet reordering for consecutive
|
| D | l2tp.rst | 192 RECV_TIMEOUT N Timeout to wait when reordering received
237 RECV_TIMEOUT N Timeout to wait when reordering received
|
| /linux-5.19.10/Documentation/userspace-api/media/v4l/ |
| D | dev-decoder.rst | 83 coded format includes a feature of frame reordering; for decoders,
716 format, e.g. frame reordering.
734 reordering is used,
|
| D | dev-encoder.rst | 462 e.g. frame reordering.
476 reordering is used,
|
| /linux-5.19.10/Documentation/locking/ |
| D | ww-mutex-design.rst | 185 list-reordering allows for a bit more idiomatic code::
|