b4d0d230cc
Based on 1 normalized pattern(s): this program is free software you can redistribute it and or modify it under the terms of the gnu general public licence as published by the free software foundation either version 2 of the licence or at your option any later version extracted by the scancode license scanner the SPDX license identifier GPL-2.0-or-later has been chosen to replace the boilerplate/reference in 114 file(s). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Allison Randal <allison@lohutok.net> Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Cc: linux-spdx@vger.kernel.org Link: https://lkml.kernel.org/r/20190520170857.552531963@linutronix.de Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
82 lines
2.4 KiB
C
82 lines
2.4 KiB
C
// SPDX-License-Identifier: GPL-2.0-or-later
|
|
/* Miscellaneous bits
|
|
*
|
|
* Copyright (C) 2016 Red Hat, Inc. All Rights Reserved.
|
|
* Written by David Howells (dhowells@redhat.com)
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
#include <net/sock.h>
|
|
#include <net/af_rxrpc.h>
|
|
#include "ar-internal.h"
|
|
|
|
/*
|
|
* The maximum listening backlog queue size that may be set on a socket by
|
|
* listen().
|
|
*/
|
|
unsigned int rxrpc_max_backlog __read_mostly = 10;
|
|
|
|
/*
|
|
* How long to wait before scheduling ACK generation after seeing a
|
|
* packet with RXRPC_REQUEST_ACK set (in jiffies).
|
|
*/
|
|
unsigned long rxrpc_requested_ack_delay = 1;
|
|
|
|
/*
|
|
* How long to wait before scheduling an ACK with subtype DELAY (in jiffies).
|
|
*
|
|
* We use this when we've received new data packets. If those packets aren't
|
|
* all consumed within this time we will send a DELAY ACK if an ACK was not
|
|
* requested to let the sender know it doesn't need to resend.
|
|
*/
|
|
unsigned long rxrpc_soft_ack_delay = HZ;
|
|
|
|
/*
|
|
* How long to wait before scheduling an ACK with subtype IDLE (in jiffies).
|
|
*
|
|
* We use this when we've consumed some previously soft-ACK'd packets when
|
|
* further packets aren't immediately received to decide when to send an IDLE
|
|
* ACK let the other end know that it can free up its Tx buffer space.
|
|
*/
|
|
unsigned long rxrpc_idle_ack_delay = HZ / 2;
|
|
|
|
/*
|
|
* Receive window size in packets. This indicates the maximum number of
|
|
* unconsumed received packets we're willing to retain in memory. Once this
|
|
* limit is hit, we should generate an EXCEEDS_WINDOW ACK and discard further
|
|
* packets.
|
|
*/
|
|
unsigned int rxrpc_rx_window_size = RXRPC_INIT_RX_WINDOW_SIZE;
|
|
#if (RXRPC_RXTX_BUFF_SIZE - 1) < RXRPC_INIT_RX_WINDOW_SIZE
|
|
#error Need to reduce RXRPC_INIT_RX_WINDOW_SIZE
|
|
#endif
|
|
|
|
/*
|
|
* Maximum Rx MTU size. This indicates to the sender the size of jumbo packet
|
|
* made by gluing normal packets together that we're willing to handle.
|
|
*/
|
|
unsigned int rxrpc_rx_mtu = 5692;
|
|
|
|
/*
|
|
* The maximum number of fragments in a received jumbo packet that we tell the
|
|
* sender that we're willing to handle.
|
|
*/
|
|
unsigned int rxrpc_rx_jumbo_max = 4;
|
|
|
|
/*
|
|
* Time till packet resend (in milliseconds).
|
|
*/
|
|
unsigned long rxrpc_resend_timeout = 4 * HZ;
|
|
|
|
const s8 rxrpc_ack_priority[] = {
|
|
[0] = 0,
|
|
[RXRPC_ACK_DELAY] = 1,
|
|
[RXRPC_ACK_REQUESTED] = 2,
|
|
[RXRPC_ACK_IDLE] = 3,
|
|
[RXRPC_ACK_DUPLICATE] = 4,
|
|
[RXRPC_ACK_OUT_OF_SEQUENCE] = 5,
|
|
[RXRPC_ACK_EXCEEDS_WINDOW] = 6,
|
|
[RXRPC_ACK_NOSPACE] = 7,
|
|
[RXRPC_ACK_PING_RESPONSE] = 8,
|
|
};
|