2021-10-18 19:14:03 +02:00
|
|
|
/*-
|
|
|
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
|
*
|
|
|
|
|
* Copyright (c) 1982, 1986, 1990, 1993
|
|
|
|
|
* The Regents of the University of California.
|
|
|
|
|
* Copyright (c) 2010-2011 Juniper Networks, Inc.
|
|
|
|
|
* All rights reserved.
|
|
|
|
|
*
|
|
|
|
|
* Portions of this software were developed by Robert N. M. Watson under
|
|
|
|
|
* contract to Juniper Networks, Inc.
|
|
|
|
|
*
|
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
|
* are met:
|
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
|
* without specific prior written permission.
|
|
|
|
|
*
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef _NETINET_IN_PCB_VAR_H_
|
|
|
|
|
#define _NETINET_IN_PCB_VAR_H_
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Definitions shared between netinet/in_pcb.c and netinet6/in6_pcb.c
|
|
|
|
|
*/
|
|
|
|
|
|
2021-12-26 19:47:28 +01:00
|
|
|
VNET_DECLARE(uint32_t, in_pcbhashseed);
|
|
|
|
|
#define V_in_pcbhashseed VNET(in_pcbhashseed)
|
|
|
|
|
|
inpcb: Avoid inp_cred dereferences in SMR-protected lookup
The SMR-protected inpcb lookup algorithm currently has to check whether
a matching inpcb belongs to a jail, in order to prioritize jailed
bound sockets. To do this it has to maintain a ucred reference, and for
this to be safe, the reference can't be released until the UMA
destructor is called, and this will not happen within any bounded time
period.
Changing SMR to periodically recycle garbage is not trivial. Instead,
let's implement SMR-synchronized lookup without needing to dereference
inp_cred. This will allow the inpcb code to free the inp_cred reference
immediately when a PCB is freed, ensuring that ucred (and thus jail)
references are released promptly.
Commit 220d89212943 ("inpcb: immediately return matching pcb on lookup")
gets us part of the way there. This patch goes further to handle
lookups of unconnected sockets. Here, the strategy is to maintain a
well-defined order of items within a hash chain so that a wild lookup
can simply return the first match and preserve existing semantics. This
makes insertion of listening sockets more complicated in order to make
lookup simpler, which seems like the right tradeoff anyway given that
bind() is already a fairly expensive operation and lookups are more
common.
In particular, when inserting an unconnected socket, in_pcbinhash() now
keeps the following ordering:
- jailed sockets before non-jailed sockets,
- specified local addresses before unspecified local addresses.
Most of the change adds a separate SMR-based lookup path for inpcb hash
lookups. When a match is found, we try to lock the inpcb and
re-validate its connection info. In the common case, this works well
and we can simply return the inpcb. If this fails, typically because
something is concurrently modifying the inpcb, we go to the slow path,
which performs a serialized lookup.
Note, I did not touch lbgroup lookup, since there the credential
reference is formally synchronized by net_epoch, not SMR. In
particular, lbgroups are rarely allocated or freed.
I think it is possible to simplify in_pcblookup_hash_wild_locked() now,
but I didn't do it in this patch.
Discussed with: glebius
Tested by: glebius
Sponsored by: Klara, Inc.
Sponsored by: Modirum MDPay
Differential Revision: https://reviews.freebsd.org/D38572
2023-04-20 17:48:19 +02:00
|
|
|
void inp_lock(struct inpcb *inp, const inp_lookup_t lock);
|
|
|
|
|
void inp_unlock(struct inpcb *inp, const inp_lookup_t lock);
|
|
|
|
|
int inp_trylock(struct inpcb *inp, const inp_lookup_t lock);
|
2021-12-02 23:45:04 +01:00
|
|
|
bool inp_smr_lock(struct inpcb *, const inp_lookup_t);
|
2021-10-18 19:14:03 +02:00
|
|
|
int in_pcb_lport(struct inpcb *, struct in_addr *, u_short *,
|
|
|
|
|
struct ucred *, int);
|
|
|
|
|
int in_pcb_lport_dest(struct inpcb *inp, struct sockaddr *lsa,
|
|
|
|
|
u_short *lportp, struct sockaddr *fsa, u_short fport,
|
|
|
|
|
struct ucred *cred, int lookupflags);
|
|
|
|
|
struct inpcb * in_pcblookup_local(struct inpcbinfo *, struct in_addr, u_short,
|
|
|
|
|
int, struct ucred *);
|
|
|
|
|
|
2021-12-02 23:45:04 +01:00
|
|
|
struct inpcbport {
|
|
|
|
|
struct inpcbhead phd_pcblist;
|
|
|
|
|
CK_LIST_ENTRY(inpcbport) phd_hash;
|
|
|
|
|
u_short phd_port;
|
|
|
|
|
};
|
|
|
|
|
|
2021-10-18 19:14:03 +02:00
|
|
|
#endif /* !_NETINET_IN_PCB_VAR_H_ */
|