| /linux/net/ipv4/ |
| H A D | tcp_recovery.c | 10 /* If reordering has not been observed, be aggressive during in tcp_rack_reo_wnd() 16 if (tp->sacked_out >= tp->reordering && in tcp_rack_reo_wnd() 22 /* To be more reordering resilient, allow min_rtt/4 settling delay. in tcp_rack_reo_wnd() 23 * Use min_rtt instead of the smoothed RTT because reordering is in tcp_rack_reo_wnd() 50 * is being more resilient to reordering by simply allowing some 82 * the recent RTT plus the reordering window. in tcp_rack_detect_loss() 114 /* We have waited long enough to accommodate reordering. Mark the expired 147 if ((state < TCP_CA_Recovery && tp->sacked_out >= tp->reordering) ||
|
| H A D | tcp_metrics.c | 450 if (val < tp->reordering && in tcp_update_metrics() 451 tp->reordering != in tcp_update_metrics() 454 tp->reordering); in tcp_update_metrics() 498 if (val && tp->reordering != val) in tcp_init_metrics() 499 tp->reordering = val; in tcp_init_metrics()
|
| H A D | tcp_input.c | 623 nr_segs = max_t(u32, nr_segs, tp->reordering + 1); in tcp_sndbuf_expand() 1288 if ((metric > tp->reordering * mss) && mss) { in tcp_check_sack_reordering() 1292 tp->reordering, in tcp_check_sack_reordering() 1297 tp->reordering = min_t(u32, (metric + mss - 1) / mss, in tcp_check_sack_reordering() 2443 tp->reordering = min_t(u32, tp->packets_out + addend, in tcp_check_reno_reordering() 2559 u8 reordering; in tcp_enter_loss() local 2580 reordering = READ_ONCE(net->ipv4.sysctl_tcp_reordering); in tcp_enter_loss() 2582 tp->sacked_out >= reordering) in tcp_enter_loss() 2583 tp->reordering = min_t(unsigned int, tp->reordering, in tcp_enter_loss() 2584 reordering); in tcp_enter_loss() [all …]
|
| H A D | tcp.c | 470 tp->reordering = READ_ONCE(sock_net(sk)->ipv4.sysctl_tcp_reordering); in tcp_init_sock() 4271 info->tcpi_reordering = tp->reordering; in tcp_get_info() 4477 nla_put_u32(stats, TCP_NLA_REORDERING, tp->reordering); in tcp_get_timestamping_opt_stats() 5176 CACHELINE_ASSERT_GROUP_MEMBER(struct tcp_sock, tcp_sock_read_tx, reordering); in tcp_struct_check()
|
| /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/drivers/platform/x86/amd/ |
| H A D | Kconfig | 16 that alters CPU core reordering. This bias prefers cores with higher
|
| /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/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/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 | 490 below). perf record guarantees that there is no reordering over a 549 No event reordering over this header. No payload.
|
| H A D | perf-sched.txt | 92 Note: The tool will not give correct results if there is topological reordering or
|
| /linux/Documentation/networking/ |
| H A D | xsk-tx-metadata.rst | 81 packet reordering, a packet with a launch time request will block other
|
| 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
|
| H A D | ip-sysctl.rst | 282 common IP source address. Note that reordering of packets is 296 reordering of packets occurs, which could lead to poor application 750 reordering. currently, setting this bit to 0 has no 754 RACK: 0x2 makes RACK's reordering window static (min_rtt/4). 777 Initial reordering level of packets in a TCP stream. 778 TCP stack can then dynamically adjust flow reordering level 784 Maximal reordering level of packets in a TCP stream.
|
| /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 | 101 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/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::
|