Merge branch 'net-header-and-core-spelling-corrections'

Simon Horman says:

====================
net: header and core spelling corrections

This patchset addresses a number of spelling errors in comments in
Networking files under include/, and files in net/core/. Spelling
problems are as flagged by codespell.

It aims to provide patches that can be accepted directly into net-next.
And splits patches up based on maintainer boundaries: many things
feed directly into net-next. This is a complex process and I apologise
for any errors.

I also plan to address, via separate patches, spelling errors in other
files in the same directories, for files whose changes typically go
through trees other than net-next (which feed into net-next).
====================

Link: https://patch.msgid.link/20240822-net-spell-v1-0-3a98971ce2d2@kernel.org
Signed-off-by: Jakub Kicinski <kuba@kernel.org>
This commit is contained in:
Jakub Kicinski
2024-08-26 09:37:25 -07:00
43 changed files with 93 additions and 89 deletions
+1 -1
View File
@@ -645,7 +645,7 @@ static inline struct ethhdr *eth_skb_pull_mac(struct sk_buff *skb)
} }
/** /**
* eth_skb_pad - Pad buffer to mininum number of octets for Ethernet frame * eth_skb_pad - Pad buffer to minimum number of octets for Ethernet frame
* @skb: Buffer to pad * @skb: Buffer to pad
* *
* An Ethernet frame should have a minimum size of 60 bytes. This function * An Ethernet frame should have a minimum size of 60 bytes. This function
+1 -1
View File
@@ -42,7 +42,7 @@ struct rmnet_map_ul_csum_header {
/* csum_info field: /* csum_info field:
* OFFSET: where (offset in bytes) to insert computed checksum * OFFSET: where (offset in bytes) to insert computed checksum
* UDP: 1 = UDP checksum (zero checkum means no checksum) * UDP: 1 = UDP checksum (zero checksum means no checksum)
* ENABLED: 1 = checksum computation requested * ENABLED: 1 = checksum computation requested
*/ */
#define MAP_CSUM_UL_OFFSET_MASK GENMASK(13, 0) #define MAP_CSUM_UL_OFFSET_MASK GENMASK(13, 0)
+4 -4
View File
@@ -1237,7 +1237,7 @@ struct netdev_net_notifier {
* int (*ndo_fdb_del)(struct ndmsg *ndm, struct nlattr *tb[], * int (*ndo_fdb_del)(struct ndmsg *ndm, struct nlattr *tb[],
* struct net_device *dev, * struct net_device *dev,
* const unsigned char *addr, u16 vid) * const unsigned char *addr, u16 vid)
* Deletes the FDB entry from dev coresponding to addr. * Deletes the FDB entry from dev corresponding to addr.
* int (*ndo_fdb_del_bulk)(struct nlmsghdr *nlh, struct net_device *dev, * int (*ndo_fdb_del_bulk)(struct nlmsghdr *nlh, struct net_device *dev,
* struct netlink_ext_ack *extack); * struct netlink_ext_ack *extack);
* int (*ndo_fdb_dump)(struct sk_buff *skb, struct netlink_callback *cb, * int (*ndo_fdb_dump)(struct sk_buff *skb, struct netlink_callback *cb,
@@ -3514,7 +3514,7 @@ static inline void netdev_tx_completed_queue(struct netdev_queue *dev_queue,
dql_completed(&dev_queue->dql, bytes); dql_completed(&dev_queue->dql, bytes);
/* /*
* Without the memory barrier there is a small possiblity that * Without the memory barrier there is a small possibility that
* netdev_tx_sent_queue will miss the update and cause the queue to * netdev_tx_sent_queue will miss the update and cause the queue to
* be stopped forever * be stopped forever
*/ */
@@ -4583,7 +4583,7 @@ void dev_uc_flush(struct net_device *dev);
void dev_uc_init(struct net_device *dev); void dev_uc_init(struct net_device *dev);
/** /**
* __dev_uc_sync - Synchonize device's unicast list * __dev_uc_sync - Synchronize device's unicast list
* @dev: device to sync * @dev: device to sync
* @sync: function to call if address should be added * @sync: function to call if address should be added
* @unsync: function to call if address should be removed * @unsync: function to call if address should be removed
@@ -4627,7 +4627,7 @@ void dev_mc_flush(struct net_device *dev);
void dev_mc_init(struct net_device *dev); void dev_mc_init(struct net_device *dev);
/** /**
* __dev_mc_sync - Synchonize device's multicast list * __dev_mc_sync - Synchronize device's multicast list
* @dev: device to sync * @dev: device to sync
* @sync: function to call if address should be added * @sync: function to call if address should be added
* @unsync: function to call if address should be removed * @unsync: function to call if address should be removed
+1 -1
View File
@@ -333,7 +333,7 @@ static inline struct inet6_dev *__in6_dev_get(const struct net_device *dev)
/** /**
* __in6_dev_stats_get - get inet6_dev pointer for stats * __in6_dev_stats_get - get inet6_dev pointer for stats
* @dev: network device * @dev: network device
* @skb: skb for original incoming interface if neeeded * @skb: skb for original incoming interface if needed
* *
* Caller must hold rcu_read_lock or RTNL, because this function * Caller must hold rcu_read_lock or RTNL, because this function
* does not take a reference on the inet6_dev. * does not take a reference on the inet6_dev.
+4 -1
View File
@@ -231,7 +231,10 @@ typedef struct port {
mux_states_t sm_mux_state; /* state machine mux state */ mux_states_t sm_mux_state; /* state machine mux state */
u16 sm_mux_timer_counter; /* state machine mux timer counter */ u16 sm_mux_timer_counter; /* state machine mux timer counter */
tx_states_t sm_tx_state; /* state machine tx state */ tx_states_t sm_tx_state; /* state machine tx state */
u16 sm_tx_timer_counter; /* state machine tx timer counter(allways on - enter to transmit state 3 time per second) */ u16 sm_tx_timer_counter; /* state machine tx timer counter
* (always on - enter to transmit
* state 3 time per second)
*/
u16 sm_churn_actor_timer_counter; u16 sm_churn_actor_timer_counter;
u16 sm_churn_partner_timer_counter; u16 sm_churn_partner_timer_counter;
u32 churn_actor_count; u32 churn_actor_count;
+1 -1
View File
@@ -53,7 +53,7 @@ struct slave;
struct tlb_client_info { struct tlb_client_info {
struct slave *tx_slave; /* A pointer to slave used for transmiting struct slave *tx_slave; /* A pointer to slave used for transmitting
* packets to a Client that the Hash function * packets to a Client that the Hash function
* gave this entry index. * gave this entry index.
*/ */
+1 -1
View File
@@ -131,7 +131,7 @@ static inline void skb_mark_napi_id(struct sk_buff *skb,
#endif #endif
} }
/* used in the protocol hanlder to propagate the napi_id to the socket */ /* used in the protocol handler to propagate the napi_id to the socket */
static inline void sk_mark_napi_id(struct sock *sk, const struct sk_buff *skb) static inline void sk_mark_napi_id(struct sock *sk, const struct sk_buff *skb)
{ {
#ifdef CONFIG_NET_RX_BUSY_POLL #ifdef CONFIG_NET_RX_BUSY_POLL
+2 -2
View File
@@ -20,7 +20,7 @@ struct caif_payload_info;
* @assert: expression to evaluate. * @assert: expression to evaluate.
* *
* This function will print a error message and a do WARN_ON if the * This function will print a error message and a do WARN_ON if the
* assertion failes. Normally this will do a stack up at the current location. * assertion fails. Normally this will do a stack up at the current location.
*/ */
#define caif_assert(assert) \ #define caif_assert(assert) \
do { \ do { \
@@ -116,7 +116,7 @@ enum caif_direction {
* @dn: Pointer down to the layer below. * @dn: Pointer down to the layer below.
* @node: List node used when layer participate in a list. * @node: List node used when layer participate in a list.
* @receive: Packet receive function. * @receive: Packet receive function.
* @transmit: Packet transmit funciton. * @transmit: Packet transmit function.
* @ctrlcmd: Used for control signalling upwards in the stack. * @ctrlcmd: Used for control signalling upwards in the stack.
* @modemcmd: Used for control signaling downwards in the stack. * @modemcmd: Used for control signaling downwards in the stack.
* @id: The identity of this layer * @id: The identity of this layer
+1 -1
View File
@@ -18,7 +18,7 @@ struct cfpkt *cfpkt_create(u16 len);
/* /*
* Destroy a CAIF Packet. * Destroy a CAIF Packet.
* pkt Packet to be destoyed. * pkt Packet to be destroyed.
*/ */
void cfpkt_destroy(struct cfpkt *pkt); void cfpkt_destroy(struct cfpkt *pkt);
+3 -3
View File
@@ -155,8 +155,8 @@ enum skb_drop_reason {
/** @SKB_DROP_REASON_SOCKET_RCVBUFF: socket receive buff is full */ /** @SKB_DROP_REASON_SOCKET_RCVBUFF: socket receive buff is full */
SKB_DROP_REASON_SOCKET_RCVBUFF, SKB_DROP_REASON_SOCKET_RCVBUFF,
/** /**
* @SKB_DROP_REASON_PROTO_MEM: proto memory limition, such as udp packet * @SKB_DROP_REASON_PROTO_MEM: proto memory limitation, such as
* drop out of udp_memory_allocated. * udp packet drop out of udp_memory_allocated.
*/ */
SKB_DROP_REASON_PROTO_MEM, SKB_DROP_REASON_PROTO_MEM,
/** /**
@@ -217,7 +217,7 @@ enum skb_drop_reason {
*/ */
SKB_DROP_REASON_TCP_ZEROWINDOW, SKB_DROP_REASON_TCP_ZEROWINDOW,
/** /**
* @SKB_DROP_REASON_TCP_OLD_DATA: the TCP data reveived is already * @SKB_DROP_REASON_TCP_OLD_DATA: the TCP data received is already
* received before (spurious retrans may happened), see * received before (spurious retrans may happened), see
* LINUX_MIB_DELAYEDACKLOST * LINUX_MIB_DELAYEDACKLOST
*/ */
+1 -1
View File
@@ -341,7 +341,7 @@ static inline void __skb_tunnel_rx(struct sk_buff *skb, struct net_device *dev,
skb->dev = dev; skb->dev = dev;
/* /*
* Clear hash so that we can recalulate the hash for the * Clear hash so that we can recalculate the hash for the
* encapsulated packet, unless we have already determine the hash * encapsulated packet, unless we have already determine the hash
* over the L4 4-tuple. * over the L4 4-tuple.
*/ */
+1 -1
View File
@@ -102,7 +102,7 @@ int dst_cache_init(struct dst_cache *dst_cache, gfp_t gfp);
* @dst_cache: the cache * @dst_cache: the cache
* *
* No synchronization is enforced: it must be called only when the cache * No synchronization is enforced: it must be called only when the cache
* is unsed. * is unused.
*/ */
void dst_cache_destroy(struct dst_cache *dst_cache); void dst_cache_destroy(struct dst_cache *dst_cache);
+2 -2
View File
@@ -89,7 +89,7 @@ enum erspan_encap_type {
ERSPAN_ENCAP_NOVLAN = 0x0, /* originally without VLAN tag */ ERSPAN_ENCAP_NOVLAN = 0x0, /* originally without VLAN tag */
ERSPAN_ENCAP_ISL = 0x1, /* originally ISL encapsulated */ ERSPAN_ENCAP_ISL = 0x1, /* originally ISL encapsulated */
ERSPAN_ENCAP_8021Q = 0x2, /* originally 802.1Q encapsulated */ ERSPAN_ENCAP_8021Q = 0x2, /* originally 802.1Q encapsulated */
ERSPAN_ENCAP_INFRAME = 0x3, /* VLAN tag perserved in frame */ ERSPAN_ENCAP_INFRAME = 0x3, /* VLAN tag preserved in frame */
}; };
#define ERSPAN_V1_MDSIZE 4 #define ERSPAN_V1_MDSIZE 4
@@ -192,7 +192,7 @@ static inline void erspan_build_header(struct sk_buff *skb,
enc_type = ERSPAN_ENCAP_NOVLAN; enc_type = ERSPAN_ENCAP_NOVLAN;
/* If mirrored packet has vlan tag, extract tci and /* If mirrored packet has vlan tag, extract tci and
* perserve vlan header in the mirrored frame. * preserve vlan header in the mirrored frame.
*/ */
if (eth->h_proto == htons(ETH_P_8021Q)) { if (eth->h_proto == htons(ETH_P_8021Q)) {
qp = (struct qtag_prefix *)(skb->data + 2 * ETH_ALEN); qp = (struct qtag_prefix *)(skb->data + 2 * ETH_ALEN);
+2 -2
View File
@@ -11,9 +11,9 @@ struct hwbm_pool {
int frag_size; int frag_size;
/* Number of buffers currently used by this pool */ /* Number of buffers currently used by this pool */
int buf_num; int buf_num;
/* constructor called during alocation */ /* constructor called during allocation */
int (*construct)(struct hwbm_pool *bm_pool, void *buf); int (*construct)(struct hwbm_pool *bm_pool, void *buf);
/* protect acces to the buffer counter*/ /* protect access to the buffer counter*/
struct mutex buf_lock; struct mutex buf_lock;
/* private data */ /* private data */
void *priv; void *priv;
+1 -1
View File
@@ -573,7 +573,7 @@ static inline u8 ip_tunnel_get_ttl(const struct iphdr *iph,
return 0; return 0;
} }
/* Propogate ECN bits out */ /* Propagate ECN bits out */
static inline u8 ip_tunnel_ecn_encap(u8 tos, const struct iphdr *iph, static inline u8 ip_tunnel_ecn_encap(u8 tos, const struct iphdr *iph,
const struct sk_buff *skb) const struct sk_buff *skb)
{ {
+2 -2
View File
@@ -851,7 +851,7 @@ static inline int __ipv6_addr_diff32(const void *token1, const void *token2, int
* we should *never* get to this point since that * we should *never* get to this point since that
* would mean the addrs are equal * would mean the addrs are equal
* *
* However, we do get to it 8) And exacly, when * However, we do get to it 8) And exactly, when
* addresses are equal 8) * addresses are equal 8)
* *
* ip route add 1111::/128 via ... * ip route add 1111::/128 via ...
@@ -973,7 +973,7 @@ static inline __be32 ip6_make_flowlabel(struct net *net, struct sk_buff *skb,
hash = skb_get_hash_flowi6(skb, fl6); hash = skb_get_hash_flowi6(skb, fl6);
/* Since this is being sent on the wire obfuscate hash a bit /* Since this is being sent on the wire obfuscate hash a bit
* to minimize possbility that any useful information to an * to minimize possibility that any useful information to an
* attacker is leaked. Only lower 20 bits are relevant. * attacker is leaked. Only lower 20 bits are relevant.
*/ */
hash = rol32(hash, 16); hash = rol32(hash, 16);
+1 -1
View File
@@ -15,7 +15,7 @@
* To explore any of the IUCV functions, one must first register their * To explore any of the IUCV functions, one must first register their
* program using iucv_register(). Once your program has successfully * program using iucv_register(). Once your program has successfully
* completed a register, it can exploit the other functions. * completed a register, it can exploit the other functions.
* For furthur reference on all IUCV functionality, refer to the * For further reference on all IUCV functionality, refer to the
* CP Programming Services book, also available on the web thru * CP Programming Services book, also available on the web thru
* www.vm.ibm.com/pubs, manual # SC24-6084 * www.vm.ibm.com/pubs, manual # SC24-6084
* *
+1 -1
View File
@@ -254,7 +254,7 @@ static inline void llc_pdu_header_init(struct sk_buff *skb, u8 type,
} }
/** /**
* llc_pdu_decode_sa - extracs source address (MAC) of input frame * llc_pdu_decode_sa - extracts, source address (MAC) of input frame
* @skb: input skb that source address must be extracted from it. * @skb: input skb that source address must be extracted from it.
* @sa: pointer to source address (6 byte array). * @sa: pointer to source address (6 byte array).
* *
+1 -1
View File
@@ -30,7 +30,7 @@ struct calipso_doi;
/* /*
* NetLabel - A management interface for maintaining network packet label * NetLabel - A management interface for maintaining network packet label
* mapping tables for explicit packet labling protocols. * mapping tables for explicit packet labeling protocols.
* *
* Network protocols such as CIPSO and RIPSO require a label translation layer * Network protocols such as CIPSO and RIPSO require a label translation layer
* to convert the label on the packet into something meaningful on the host * to convert the label on the packet into something meaningful on the host
+8 -8
View File
@@ -827,7 +827,7 @@ nlmsg_parse_deprecated_strict(const struct nlmsghdr *nlh, int hdrlen,
/** /**
* nlmsg_find_attr - find a specific attribute in a netlink message * nlmsg_find_attr - find a specific attribute in a netlink message
* @nlh: netlink message header * @nlh: netlink message header
* @hdrlen: length of familiy specific header * @hdrlen: length of family specific header
* @attrtype: type of attribute to look for * @attrtype: type of attribute to look for
* *
* Returns the first attribute which matches the specified type. * Returns the first attribute which matches the specified type.
@@ -849,7 +849,7 @@ static inline struct nlattr *nlmsg_find_attr(const struct nlmsghdr *nlh,
* *
* Validates all attributes in the specified attribute stream against the * Validates all attributes in the specified attribute stream against the
* specified policy. Validation is done in liberal mode. * specified policy. Validation is done in liberal mode.
* See documenation of struct nla_policy for more details. * See documentation of struct nla_policy for more details.
* *
* Returns 0 on success or a negative error code. * Returns 0 on success or a negative error code.
*/ */
@@ -872,7 +872,7 @@ static inline int nla_validate_deprecated(const struct nlattr *head, int len,
* *
* Validates all attributes in the specified attribute stream against the * Validates all attributes in the specified attribute stream against the
* specified policy. Validation is done in strict mode. * specified policy. Validation is done in strict mode.
* See documenation of struct nla_policy for more details. * See documentation of struct nla_policy for more details.
* *
* Returns 0 on success or a negative error code. * Returns 0 on success or a negative error code.
*/ */
@@ -887,7 +887,7 @@ static inline int nla_validate(const struct nlattr *head, int len, int maxtype,
/** /**
* nlmsg_validate_deprecated - validate a netlink message including attributes * nlmsg_validate_deprecated - validate a netlink message including attributes
* @nlh: netlinket message header * @nlh: netlinket message header
* @hdrlen: length of familiy specific header * @hdrlen: length of family specific header
* @maxtype: maximum attribute type to be expected * @maxtype: maximum attribute type to be expected
* @policy: validation policy * @policy: validation policy
* @extack: extended ACK report struct * @extack: extended ACK report struct
@@ -933,7 +933,7 @@ static inline u32 nlmsg_seq(const struct nlmsghdr *nlh)
* nlmsg_for_each_attr - iterate over a stream of attributes * nlmsg_for_each_attr - iterate over a stream of attributes
* @pos: loop counter, set to current attribute * @pos: loop counter, set to current attribute
* @nlh: netlink message header * @nlh: netlink message header
* @hdrlen: length of familiy specific header * @hdrlen: length of family specific header
* @rem: initialized to len, holds bytes currently remaining in stream * @rem: initialized to len, holds bytes currently remaining in stream
*/ */
#define nlmsg_for_each_attr(pos, nlh, hdrlen, rem) \ #define nlmsg_for_each_attr(pos, nlh, hdrlen, rem) \
@@ -1034,7 +1034,7 @@ static inline struct sk_buff *nlmsg_new_large(size_t payload)
* @skb: socket buffer the message is stored in * @skb: socket buffer the message is stored in
* @nlh: netlink message header * @nlh: netlink message header
* *
* Corrects the netlink message header to include the appeneded * Corrects the netlink message header to include the appended
* attributes. Only necessary if attributes have been added to * attributes. Only necessary if attributes have been added to
* the message. * the message.
*/ */
@@ -1954,7 +1954,7 @@ static inline struct nlattr *nla_nest_start(struct sk_buff *skb, int attrtype)
* @start: container attribute * @start: container attribute
* *
* Corrects the container attribute header to include the all * Corrects the container attribute header to include the all
* appeneded attributes. * appended attributes.
* *
* Returns the total data length of the skb. * Returns the total data length of the skb.
*/ */
@@ -1987,7 +1987,7 @@ static inline void nla_nest_cancel(struct sk_buff *skb, struct nlattr *start)
* *
* Validates all attributes in the nested attribute stream against the * Validates all attributes in the nested attribute stream against the
* specified policy. Attributes with a type exceeding maxtype will be * specified policy. Attributes with a type exceeding maxtype will be
* ignored. See documenation of struct nla_policy for more details. * ignored. See documentation of struct nla_policy for more details.
* *
* Returns 0 on success or a negative error code. * Returns 0 on success or a negative error code.
*/ */
+2 -2
View File
@@ -125,14 +125,14 @@ struct netns_sctp {
int pf_expose; int pf_expose;
/* /*
* Policy for preforming sctp/socket accounting * Policy for performing sctp/socket accounting
* 0 - do socket level accounting, all assocs share sk_sndbuf * 0 - do socket level accounting, all assocs share sk_sndbuf
* 1 - do sctp accounting, each asoc may use sk_sndbuf bytes * 1 - do sctp accounting, each asoc may use sk_sndbuf bytes
*/ */
int sndbuf_policy; int sndbuf_policy;
/* /*
* Policy for preforming sctp/socket accounting * Policy for performing sctp/socket accounting
* 0 - do socket level accounting, all assocs share sk_rcvbuf * 0 - do socket level accounting, all assocs share sk_rcvbuf
* 1 - do sctp accounting, each asoc may use sk_rcvbuf bytes * 1 - do sctp accounting, each asoc may use sk_rcvbuf bytes
*/ */
+1 -1
View File
@@ -332,7 +332,7 @@ struct nci_core_init_rsp_1 {
__le32 nfcc_features; __le32 nfcc_features;
__u8 num_supported_rf_interfaces; __u8 num_supported_rf_interfaces;
__u8 supported_rf_interfaces[]; /* variable size array */ __u8 supported_rf_interfaces[]; /* variable size array */
/* continuted in nci_core_init_rsp_2 */ /* continued in nci_core_init_rsp_2 */
} __packed; } __packed;
struct nci_core_init_rsp_2 { struct nci_core_init_rsp_2 {
+4 -4
View File
@@ -80,7 +80,7 @@ struct nfc_ops {
#define NFC_ATR_REQ_GT_OFFSET 14 #define NFC_ATR_REQ_GT_OFFSET 14
/** /**
* struct nfc_target - NFC target descriptiom * struct nfc_target - NFC target description
* *
* @sens_res: 2 bytes describing the target SENS_RES response, if the target * @sens_res: 2 bytes describing the target SENS_RES response, if the target
* is a type A one. The %sens_res most significant byte must be byte 2 * is a type A one. The %sens_res most significant byte must be byte 2
@@ -230,10 +230,10 @@ static inline void nfc_set_parent_dev(struct nfc_dev *nfc_dev,
} }
/** /**
* nfc_set_drvdata - set driver specifc data * nfc_set_drvdata - set driver specific data
* *
* @dev: The nfc device * @dev: The nfc device
* @data: Pointer to driver specifc data * @data: Pointer to driver specific data
*/ */
static inline void nfc_set_drvdata(struct nfc_dev *dev, void *data) static inline void nfc_set_drvdata(struct nfc_dev *dev, void *data)
{ {
@@ -241,7 +241,7 @@ static inline void nfc_set_drvdata(struct nfc_dev *dev, void *data)
} }
/** /**
* nfc_get_drvdata - get driver specifc data * nfc_get_drvdata - get driver specific data
* *
* @dev: The nfc device * @dev: The nfc device
*/ */
+1 -1
View File
@@ -491,7 +491,7 @@ int __tcf_em_tree_match(struct sk_buff *, struct tcf_ematch_tree *,
struct tcf_pkt_info *); struct tcf_pkt_info *);
/** /**
* tcf_em_tree_match - evaulate an ematch tree * tcf_em_tree_match - evaluate an ematch tree
* *
* @skb: socket buffer of the packet in question * @skb: socket buffer of the packet in question
* @tree: ematch tree to be used for evaluation * @tree: ematch tree to be used for evaluation
+4 -4
View File
@@ -40,7 +40,7 @@
max_P should be small (not 1), usually 0.01..0.02 is good value. max_P should be small (not 1), usually 0.01..0.02 is good value.
max_P is chosen as a number, so that max_P/(th_max-th_min) max_P is chosen as a number, so that max_P/(th_max-th_min)
is a negative power of two in order arithmetics to contain is a negative power of two in order arithmetic to contain
only shifts. only shifts.
@@ -159,7 +159,7 @@ static inline u32 red_maxp(u8 Plog)
static inline void red_set_vars(struct red_vars *v) static inline void red_set_vars(struct red_vars *v)
{ {
/* Reset average queue length, the value is strictly bound /* Reset average queue length, the value is strictly bound
* to the parameters below, reseting hurts a bit but leaving * to the parameters below, resetting hurts a bit but leaving
* it might result in an unreasonable qavg for a while. --TGR * it might result in an unreasonable qavg for a while. --TGR
*/ */
v->qavg = 0; v->qavg = 0;
@@ -340,7 +340,7 @@ static inline unsigned long red_calc_qavg_no_idle_time(const struct red_parms *p
{ {
/* /*
* NOTE: v->qavg is fixed point number with point at Wlog. * NOTE: v->qavg is fixed point number with point at Wlog.
* The formula below is equvalent to floating point * The formula below is equivalent to floating point
* version: * version:
* *
* qavg = qavg*(1-W) + backlog*W; * qavg = qavg*(1-W) + backlog*W;
@@ -375,7 +375,7 @@ static inline int red_mark_probability(const struct red_parms *p,
OK. qR is random number in the interval OK. qR is random number in the interval
(0..1/max_P)*(qth_max-qth_min) (0..1/max_P)*(qth_max-qth_min)
i.e. 0..(2^Plog). If we used floating point i.e. 0..(2^Plog). If we used floating point
arithmetics, it would be: (2^Plog)*rnd_num, arithmetic, it would be: (2^Plog)*rnd_num,
where rnd_num is less 1. where rnd_num is less 1.
Taking into account, that qavg have fixed Taking into account, that qavg have fixed
+1 -1
View File
@@ -121,7 +121,7 @@ struct regulatory_request {
* @REGULATORY_DISABLE_BEACON_HINTS: enable this if your driver needs to * @REGULATORY_DISABLE_BEACON_HINTS: enable this if your driver needs to
* ensure that passive scan flags and beaconing flags may not be lifted by * ensure that passive scan flags and beaconing flags may not be lifted by
* cfg80211 due to regulatory beacon hints. For more information on beacon * cfg80211 due to regulatory beacon hints. For more information on beacon
* hints read the documenation for regulatory_hint_found_beacon() * hints read the documentation for regulatory_hint_found_beacon()
* @REGULATORY_COUNTRY_IE_FOLLOW_POWER: for devices that have a preference * @REGULATORY_COUNTRY_IE_FOLLOW_POWER: for devices that have a preference
* that even though they may have programmed their own custom power * that even though they may have programmed their own custom power
* setting prior to wiphy registration, they want to ensure their channel * setting prior to wiphy registration, they want to ensure their channel
+1 -1
View File
@@ -28,7 +28,7 @@
#define __net_sctp_h__ #define __net_sctp_h__
/* Header Strategy. /* Header Strategy.
* Start getting some control over the header file depencies: * Start getting some control over the header file dependencies:
* includes * includes
* constants * constants
* structs * structs
+10 -10
View File
@@ -521,7 +521,7 @@ struct sctp_datamsg {
refcount_t refcnt; refcount_t refcnt;
/* When is this message no longer interesting to the peer? */ /* When is this message no longer interesting to the peer? */
unsigned long expires_at; unsigned long expires_at;
/* Did the messenge fail to send? */ /* Did the message fail to send? */
int send_error; int send_error;
u8 send_failed:1, u8 send_failed:1,
can_delay:1, /* should this message be Nagle delayed */ can_delay:1, /* should this message be Nagle delayed */
@@ -792,7 +792,7 @@ struct sctp_transport {
*/ */
hb_sent:1, hb_sent:1,
/* Is the Path MTU update pending on this tranport */ /* Is the Path MTU update pending on this transport */
pmtu_pending:1, pmtu_pending:1,
dst_pending_confirm:1, /* need to confirm neighbour */ dst_pending_confirm:1, /* need to confirm neighbour */
@@ -1223,7 +1223,7 @@ enum sctp_endpoint_type {
}; };
/* /*
* A common base class to bridge the implmentation view of a * A common base class to bridge the implementation view of a
* socket (usually listening) endpoint versus an association's * socket (usually listening) endpoint versus an association's
* local endpoint. * local endpoint.
* This common structure is useful for several purposes: * This common structure is useful for several purposes:
@@ -1353,7 +1353,7 @@ struct sctp_endpoint {
struct rcu_head rcu; struct rcu_head rcu;
}; };
/* Recover the outter endpoint structure. */ /* Recover the outer endpoint structure. */
static inline struct sctp_endpoint *sctp_ep(struct sctp_ep_common *base) static inline struct sctp_endpoint *sctp_ep(struct sctp_ep_common *base)
{ {
struct sctp_endpoint *ep; struct sctp_endpoint *ep;
@@ -1906,7 +1906,7 @@ struct sctp_association {
__u32 rwnd_over; __u32 rwnd_over;
/* Keeps treack of rwnd pressure. This happens when we have /* Keeps treack of rwnd pressure. This happens when we have
* a window, but not recevie buffer (i.e small packets). This one * a window, but not receive buffer (i.e small packets). This one
* is releases slowly (1 PMTU at a time ). * is releases slowly (1 PMTU at a time ).
*/ */
__u32 rwnd_press; __u32 rwnd_press;
@@ -1994,7 +1994,7 @@ struct sctp_association {
/* ADDIP Section 5.2 Upon reception of an ASCONF Chunk. /* ADDIP Section 5.2 Upon reception of an ASCONF Chunk.
* *
* This is needed to implement itmes E1 - E4 of the updated * This is needed to implement items E1 - E4 of the updated
* spec. Here is the justification: * spec. Here is the justification:
* *
* Since the peer may bundle multiple ASCONF chunks toward us, * Since the peer may bundle multiple ASCONF chunks toward us,
@@ -2005,7 +2005,7 @@ struct sctp_association {
/* These ASCONF chunks are waiting to be sent. /* These ASCONF chunks are waiting to be sent.
* *
* These chunaks can't be pushed to outqueue until receiving * These chunks can't be pushed to outqueue until receiving
* ASCONF_ACK for the previous ASCONF indicated by * ASCONF_ACK for the previous ASCONF indicated by
* addip_last_asconf, so as to guarantee that only one ASCONF * addip_last_asconf, so as to guarantee that only one ASCONF
* is in flight at any time. * is in flight at any time.
@@ -2059,13 +2059,13 @@ struct sctp_association {
struct sctp_transport *new_transport; struct sctp_transport *new_transport;
/* SCTP AUTH: list of the endpoint shared keys. These /* SCTP AUTH: list of the endpoint shared keys. These
* keys are provided out of band by the user applicaton * keys are provided out of band by the user application
* and can't change during the lifetime of the association * and can't change during the lifetime of the association
*/ */
struct list_head endpoint_shared_keys; struct list_head endpoint_shared_keys;
/* SCTP AUTH: /* SCTP AUTH:
* The current generated assocaition shared key (secret) * The current generated association shared key (secret)
*/ */
struct sctp_auth_bytes *asoc_shared_key; struct sctp_auth_bytes *asoc_shared_key;
struct sctp_shared_key *shkey; struct sctp_shared_key *shkey;
@@ -2121,7 +2121,7 @@ enum {
SCTP_ASSOC_EYECATCHER = 0xa550c123, SCTP_ASSOC_EYECATCHER = 0xa550c123,
}; };
/* Recover the outter association structure. */ /* Recover the outer association structure. */
static inline struct sctp_association *sctp_assoc(struct sctp_ep_common *base) static inline struct sctp_association *sctp_assoc(struct sctp_ep_common *base)
{ {
struct sctp_association *asoc; struct sctp_association *asoc;
+2 -2
View File
@@ -1624,7 +1624,7 @@ bool __lock_sock_fast(struct sock *sk) __acquires(&sk->sk_lock.slock);
* lock_sock_fast - fast version of lock_sock * lock_sock_fast - fast version of lock_sock
* @sk: socket * @sk: socket
* *
* This version should be used for very small section, where process wont block * This version should be used for very small section, where process won't block
* return false if fast path is taken: * return false if fast path is taken:
* *
* sk_lock.slock locked, owned = 0, BH disabled * sk_lock.slock locked, owned = 0, BH disabled
@@ -2546,7 +2546,7 @@ struct sock_skb_cb {
/* Store sock_skb_cb at the end of skb->cb[] so protocol families /* Store sock_skb_cb at the end of skb->cb[] so protocol families
* using skb->cb[] would keep using it directly and utilize its * using skb->cb[] would keep using it directly and utilize its
* alignement guarantee. * alignment guarantee.
*/ */
#define SOCK_SKB_CB_OFFSET ((sizeof_field(struct sk_buff, cb) - \ #define SOCK_SKB_CB_OFFSET ((sizeof_field(struct sk_buff, cb) - \
sizeof(struct sock_skb_cb))) sizeof(struct sock_skb_cb)))
+1 -1
View File
@@ -232,7 +232,7 @@ static inline __be16 udp_flow_src_port(struct net *net, struct sk_buff *skb,
} }
/* Since this is being sent on the wire obfuscate hash a bit /* Since this is being sent on the wire obfuscate hash a bit
* to minimize possbility that any useful information to an * to minimize possibility that any useful information to an
* attacker is leaked. Only upper 16 bits are relevant in the * attacker is leaked. Only upper 16 bits are relevant in the
* computation for 16 bit port value. * computation for 16 bit port value.
*/ */
+1 -1
View File
@@ -81,7 +81,7 @@ enum {
#define X25_DEFAULT_WINDOW_SIZE 2 /* Default Window Size */ #define X25_DEFAULT_WINDOW_SIZE 2 /* Default Window Size */
#define X25_DEFAULT_PACKET_SIZE X25_PS128 /* Default Packet Size */ #define X25_DEFAULT_PACKET_SIZE X25_PS128 /* Default Packet Size */
#define X25_DEFAULT_THROUGHPUT 0x0A /* Deafult Throughput */ #define X25_DEFAULT_THROUGHPUT 0x0A /* Default Throughput */
#define X25_DEFAULT_REVERSE 0x00 /* Default Reverse Charging */ #define X25_DEFAULT_REVERSE 0x00 /* Default Reverse Charging */
#define X25_SMODULUS 8 #define X25_SMODULUS 8
+4 -3
View File
@@ -230,8 +230,8 @@ struct tpacket_hdr_v1 {
* ts_first_pkt: * ts_first_pkt:
* Is always the time-stamp when the block was opened. * Is always the time-stamp when the block was opened.
* Case a) ZERO packets * Case a) ZERO packets
* No packets to deal with but atleast you know the * No packets to deal with but at least you know
* time-interval of this block. * the time-interval of this block.
* Case b) Non-zero packets * Case b) Non-zero packets
* Use the ts of the first packet in the block. * Use the ts of the first packet in the block.
* *
@@ -265,7 +265,8 @@ enum tpacket_versions {
- struct tpacket_hdr - struct tpacket_hdr
- pad to TPACKET_ALIGNMENT=16 - pad to TPACKET_ALIGNMENT=16
- struct sockaddr_ll - struct sockaddr_ll
- Gap, chosen so that packet data (Start+tp_net) alignes to TPACKET_ALIGNMENT=16 - Gap, chosen so that packet data (Start+tp_net) aligns to
TPACKET_ALIGNMENT=16
- Start+tp_mac: [ Optional MAC header ] - Start+tp_mac: [ Optional MAC header ]
- Start+tp_net: Packet data, aligned to TPACKET_ALIGNMENT=16. - Start+tp_net: Packet data, aligned to TPACKET_ALIGNMENT=16.
- Pad to align to TPACKET_ALIGNMENT=16 - Pad to align to TPACKET_ALIGNMENT=16
+1 -1
View File
@@ -141,7 +141,7 @@ struct in_addr {
*/ */
#define IP_PMTUDISC_INTERFACE 4 #define IP_PMTUDISC_INTERFACE 4
/* weaker version of IP_PMTUDISC_INTERFACE, which allows packets to get /* weaker version of IP_PMTUDISC_INTERFACE, which allows packets to get
* fragmented if they exeed the interface mtu * fragmented if they exceed the interface mtu
*/ */
#define IP_PMTUDISC_OMIT 5 #define IP_PMTUDISC_OMIT 5
+1 -1
View File
@@ -143,7 +143,7 @@ enum {
INET_DIAG_SHUTDOWN, INET_DIAG_SHUTDOWN,
/* /*
* Next extenstions cannot be requested in struct inet_diag_req_v2: * Next extensions cannot be requested in struct inet_diag_req_v2:
* its field idiag_ext has only 8 bits. * its field idiag_ext has only 8 bits.
*/ */
+3 -3
View File
@@ -3707,7 +3707,7 @@ struct sk_buff *validate_xmit_skb_list(struct sk_buff *skb, struct net_device *d
next = skb->next; next = skb->next;
skb_mark_not_on_list(skb); skb_mark_not_on_list(skb);
/* in case skb wont be segmented, point to itself */ /* in case skb won't be segmented, point to itself */
skb->prev = skb; skb->prev = skb;
skb = validate_xmit_skb(skb, dev, again); skb = validate_xmit_skb(skb, dev, again);
@@ -11432,7 +11432,7 @@ void unregister_netdevice_many_notify(struct list_head *head,
* @head: list of devices * @head: list of devices
* *
* Note: As most callers use a stack allocated list_head, * Note: As most callers use a stack allocated list_head,
* we force a list_del() to make sure stack wont be corrupted later. * we force a list_del() to make sure stack won't be corrupted later.
*/ */
void unregister_netdevice_many(struct list_head *head) void unregister_netdevice_many(struct list_head *head)
{ {
@@ -11490,7 +11490,7 @@ int __dev_change_net_namespace(struct net_device *dev, struct net *net,
if (dev->features & NETIF_F_NETNS_LOCAL) if (dev->features & NETIF_F_NETNS_LOCAL)
goto out; goto out;
/* Ensure the device has been registrered */ /* Ensure the device has been registered */
if (dev->reg_state != NETREG_REGISTERED) if (dev->reg_state != NETREG_REGISTERED)
goto out; goto out;
+3 -3
View File
@@ -262,7 +262,7 @@ static int __hw_addr_sync_multiple(struct netdev_hw_addr_list *to_list,
} }
/* This function only works where there is a strict 1-1 relationship /* This function only works where there is a strict 1-1 relationship
* between source and destionation of they synch. If you ever need to * between source and destination of they synch. If you ever need to
* sync addresses to more then 1 destination, you need to use * sync addresses to more then 1 destination, you need to use
* __hw_addr_sync_multiple(). * __hw_addr_sync_multiple().
*/ */
@@ -299,8 +299,8 @@ void __hw_addr_unsync(struct netdev_hw_addr_list *to_list,
EXPORT_SYMBOL(__hw_addr_unsync); EXPORT_SYMBOL(__hw_addr_unsync);
/** /**
* __hw_addr_sync_dev - Synchonize device's multicast list * __hw_addr_sync_dev - Synchronize device's multicast list
* @list: address list to syncronize * @list: address list to synchronize
* @dev: device to sync * @dev: device to sync
* @sync: function to call if address should be added * @sync: function to call if address should be added
* @unsync: function to call if address should be removed * @unsync: function to call if address should be removed
+1 -1
View File
@@ -72,7 +72,7 @@ int fib_default_rule_add(struct fib_rules_ops *ops,
r->suppress_prefixlen = -1; r->suppress_prefixlen = -1;
r->suppress_ifgroup = -1; r->suppress_ifgroup = -1;
/* The lock is not required here, the list in unreacheable /* The lock is not required here, the list in unreachable
* at the moment this function is called */ * at the moment this function is called */
list_add_tail(&r->list, &ops->rules_list); list_add_tail(&r->list, &ops->rules_list);
return 0; return 0;
+1 -1
View File
@@ -374,7 +374,7 @@ static void gro_list_prepare(const struct list_head *head,
skb_mac_header(skb), skb_mac_header(skb),
maclen); maclen);
/* in most common scenarions 'slow_gro' is 0 /* in most common scenarios 'slow_gro' is 0
* otherwise we are already on some slower paths * otherwise we are already on some slower paths
* either skip all the infrequent tests altogether or * either skip all the infrequent tests altogether or
* avoid trying too hard to skip each of them individually * avoid trying too hard to skip each of them individually
+1 -1
View File
@@ -162,7 +162,7 @@ static void poll_one_napi(struct napi_struct *napi)
if (test_and_set_bit(NAPI_STATE_NPSVC, &napi->state)) if (test_and_set_bit(NAPI_STATE_NPSVC, &napi->state))
return; return;
/* We explicilty pass the polling call a budget of 0 to /* We explicitly pass the polling call a budget of 0 to
* indicate that we are clearing the Tx path only. * indicate that we are clearing the Tx path only.
*/ */
work = napi->poll(napi, 0); work = napi->poll(napi, 0);
+5 -5
View File
@@ -69,7 +69,7 @@
* *
* By design there should only be *one* "controlling" process. In practice * By design there should only be *one* "controlling" process. In practice
* multiple write accesses gives unpredictable result. Understood by "write" * multiple write accesses gives unpredictable result. Understood by "write"
* to /proc gives result code thats should be read be the "writer". * to /proc gives result code that should be read be the "writer".
* For practical use this should be no problem. * For practical use this should be no problem.
* *
* Note when adding devices to a specific CPU there good idea to also assign * Note when adding devices to a specific CPU there good idea to also assign
@@ -2371,11 +2371,11 @@ static void get_ipsec_sa(struct pktgen_dev *pkt_dev, int flow)
if (pkt_dev->spi) { if (pkt_dev->spi) {
/* We need as quick as possible to find the right SA /* We need as quick as possible to find the right SA
* Searching with minimum criteria to archieve this. * Searching with minimum criteria to achieve, this.
*/ */
x = xfrm_state_lookup_byspi(pn->net, htonl(pkt_dev->spi), AF_INET); x = xfrm_state_lookup_byspi(pn->net, htonl(pkt_dev->spi), AF_INET);
} else { } else {
/* slow path: we dont already have xfrm_state */ /* slow path: we don't already have xfrm_state */
x = xfrm_stateonly_find(pn->net, DUMMY_MARK, 0, x = xfrm_stateonly_find(pn->net, DUMMY_MARK, 0,
(xfrm_address_t *)&pkt_dev->cur_daddr, (xfrm_address_t *)&pkt_dev->cur_daddr,
(xfrm_address_t *)&pkt_dev->cur_saddr, (xfrm_address_t *)&pkt_dev->cur_saddr,
@@ -3838,8 +3838,8 @@ static int pktgen_add_device(struct pktgen_thread *t, const char *ifname)
pkt_dev->ipsmode = XFRM_MODE_TRANSPORT; pkt_dev->ipsmode = XFRM_MODE_TRANSPORT;
pkt_dev->ipsproto = IPPROTO_ESP; pkt_dev->ipsproto = IPPROTO_ESP;
/* xfrm tunnel mode needs additional dst to extract outter /* xfrm tunnel mode needs additional dst to extract outer
* ip header protocol/ttl/id field, here creat a phony one. * ip header protocol/ttl/id field, here create a phony one.
* instead of looking for a valid rt, which definitely hurting * instead of looking for a valid rt, which definitely hurting
* performance under such circumstance. * performance under such circumstance.
*/ */
+2 -2
View File
@@ -5163,7 +5163,7 @@ EXPORT_SYMBOL_GPL(skb_to_sgvec);
* 3. sg_unmark_end * 3. sg_unmark_end
* 4. skb_to_sgvec(payload2) * 4. skb_to_sgvec(payload2)
* *
* When mapping mutilple payload conditionally, skb_to_sgvec_nomark * When mapping multiple payload conditionally, skb_to_sgvec_nomark
* is more preferable. * is more preferable.
*/ */
int skb_to_sgvec_nomark(struct sk_buff *skb, struct scatterlist *sg, int skb_to_sgvec_nomark(struct sk_buff *skb, struct scatterlist *sg,
@@ -6021,7 +6021,7 @@ EXPORT_SYMBOL(skb_try_coalesce);
* @skb: buffer to clean * @skb: buffer to clean
* @xnet: packet is crossing netns * @xnet: packet is crossing netns
* *
* skb_scrub_packet can be used after encapsulating or decapsulting a packet * skb_scrub_packet can be used after encapsulating or decapsulating a packet
* into/from a tunnel. Some information have to be cleared during these * into/from a tunnel. Some information have to be cleared during these
* operations. * operations.
* skb_scrub_packet can also be used to clean a skb before injecting it in * skb_scrub_packet can also be used to clean a skb before injecting it in
+3 -3
View File
@@ -2048,7 +2048,7 @@ static inline void sock_lock_init(struct sock *sk)
/* /*
* Copy all fields from osk to nsk but nsk->sk_refcnt must not change yet, * Copy all fields from osk to nsk but nsk->sk_refcnt must not change yet,
* even temporarly, because of RCU lookups. sk_node should also be left as is. * even temporarily, because of RCU lookups. sk_node should also be left as is.
* We must not copy fields between sk_dontcopy_begin and sk_dontcopy_end * We must not copy fields between sk_dontcopy_begin and sk_dontcopy_end
*/ */
static void sock_copy(struct sock *nsk, const struct sock *osk) static void sock_copy(struct sock *nsk, const struct sock *osk)
@@ -2538,7 +2538,7 @@ void skb_set_owner_w(struct sk_buff *skb, struct sock *sk)
skb_set_hash_from_sk(skb, sk); skb_set_hash_from_sk(skb, sk);
/* /*
* We used to take a refcount on sk, but following operation * We used to take a refcount on sk, but following operation
* is enough to guarantee sk_free() wont free this sock until * is enough to guarantee sk_free() won't free this sock until
* all in-flight packets are completed * all in-flight packets are completed
*/ */
refcount_add(skb->truesize, &sk->sk_wmem_alloc); refcount_add(skb->truesize, &sk->sk_wmem_alloc);
@@ -3697,7 +3697,7 @@ EXPORT_SYMBOL(sock_recv_errqueue);
* *
* FIX: POSIX 1003.1g is very ambiguous here. It states that * FIX: POSIX 1003.1g is very ambiguous here. It states that
* asynchronous errors should be reported by getsockopt. We assume * asynchronous errors should be reported by getsockopt. We assume
* this means if you specify SO_ERROR (otherwise whats the point of it). * this means if you specify SO_ERROR (otherwise what is the point of it).
*/ */
int sock_common_getsockopt(struct socket *sock, int level, int optname, int sock_common_getsockopt(struct socket *sock, int level, int optname,
char __user *optval, int __user *optlen) char __user *optval, int __user *optlen)
+1 -1
View File
@@ -1,6 +1,6 @@
// SPDX-License-Identifier: GPL-2.0-or-later // SPDX-License-Identifier: GPL-2.0-or-later
/* /*
* Generic address resultion entity * Generic address resolution entity
* *
* Authors: * Authors:
* net_random Alan Cox * net_random Alan Cox