2008-01-11 07:57:09 -07:00
|
|
|
/* SCTP kernel implementation
|
2005-04-16 16:20:36 -06:00
|
|
|
* (C) Copyright IBM Corp. 2001, 2003
|
|
|
|
* Copyright (c) Cisco 1999,2000
|
|
|
|
* Copyright (c) Motorola 1999,2000,2001
|
|
|
|
* Copyright (c) La Monte H.P. Yarroll 2001
|
|
|
|
*
|
2008-01-11 07:57:09 -07:00
|
|
|
* This file is part of the SCTP kernel implementation.
|
2005-04-16 16:20:36 -06:00
|
|
|
*
|
|
|
|
* A collection class to handle the storage of transport addresses.
|
|
|
|
*
|
2008-01-11 07:57:09 -07:00
|
|
|
* This SCTP implementation is free software;
|
2005-04-16 16:20:36 -06:00
|
|
|
* you can redistribute it and/or modify it under the terms of
|
|
|
|
* the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
* any later version.
|
|
|
|
*
|
2008-01-11 07:57:09 -07:00
|
|
|
* This SCTP implementation is distributed in the hope that it
|
2005-04-16 16:20:36 -06:00
|
|
|
* will be useful, but WITHOUT ANY WARRANTY; without even the implied
|
|
|
|
* ************************
|
|
|
|
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
* See the GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with GNU CC; see the file COPYING. If not, write to
|
|
|
|
* the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
|
|
* Boston, MA 02111-1307, USA.
|
|
|
|
*
|
|
|
|
* Please send any bug reports or fixes you make to the
|
|
|
|
* email address(es):
|
|
|
|
* lksctp developers <lksctp-developers@lists.sourceforge.net>
|
|
|
|
*
|
|
|
|
* Or submit a bug report through the following website:
|
|
|
|
* http://www.sf.net/projects/lksctp
|
|
|
|
*
|
|
|
|
* Written or modified by:
|
|
|
|
* La Monte H.P. Yarroll <piggy@acm.org>
|
|
|
|
* Karl Knutson <karl@athena.chicago.il.us>
|
|
|
|
* Jon Grimm <jgrimm@us.ibm.com>
|
|
|
|
* Daisy Chang <daisyc@us.ibm.com>
|
|
|
|
*
|
|
|
|
* Any bugs reported given to us we will try to fix... any fixes shared will
|
|
|
|
* be incorporated into the next SCTP release.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 02:04:11 -06:00
|
|
|
#include <linux/slab.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/in.h>
|
|
|
|
#include <net/sock.h>
|
|
|
|
#include <net/ipv6.h>
|
|
|
|
#include <net/if_inet6.h>
|
|
|
|
#include <net/sctp/sctp.h>
|
|
|
|
#include <net/sctp/sm.h>
|
|
|
|
|
|
|
|
/* Forward declarations for internal helpers. */
|
|
|
|
static int sctp_copy_one_addr(struct sctp_bind_addr *, union sctp_addr *,
|
2005-10-07 00:46:04 -06:00
|
|
|
sctp_scope_t scope, gfp_t gfp,
|
2005-07-11 21:57:47 -06:00
|
|
|
int flags);
|
2005-04-16 16:20:36 -06:00
|
|
|
static void sctp_bind_addr_clean(struct sctp_bind_addr *);
|
|
|
|
|
|
|
|
/* First Level Abstractions. */
|
|
|
|
|
|
|
|
/* Copy 'src' to 'dest' taking 'scope' into account. Omit addresses
|
|
|
|
* in 'src' which have a broader scope than 'scope'.
|
|
|
|
*/
|
2007-02-09 07:25:18 -07:00
|
|
|
int sctp_bind_addr_copy(struct sctp_bind_addr *dest,
|
2005-04-16 16:20:36 -06:00
|
|
|
const struct sctp_bind_addr *src,
|
2005-10-07 00:46:04 -06:00
|
|
|
sctp_scope_t scope, gfp_t gfp,
|
2005-07-11 21:57:47 -06:00
|
|
|
int flags)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
struct sctp_sockaddr_entry *addr;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
/* All addresses share the same port. */
|
|
|
|
dest->port = src->port;
|
|
|
|
|
|
|
|
/* Extract the addresses which are relevant for this scope. */
|
2008-04-12 19:54:24 -06:00
|
|
|
list_for_each_entry(addr, &src->address_list, list) {
|
2006-11-20 18:12:07 -07:00
|
|
|
error = sctp_copy_one_addr(dest, &addr->a, scope,
|
2005-04-16 16:20:36 -06:00
|
|
|
gfp, flags);
|
|
|
|
if (error < 0)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If there are no addresses matching the scope and
|
|
|
|
* this is global scope, try to get a link scope address, with
|
|
|
|
* the assumption that we must be sitting behind a NAT.
|
|
|
|
*/
|
|
|
|
if (list_empty(&dest->address_list) && (SCTP_SCOPE_GLOBAL == scope)) {
|
2008-04-12 19:54:24 -06:00
|
|
|
list_for_each_entry(addr, &src->address_list, list) {
|
2006-11-20 18:12:07 -07:00
|
|
|
error = sctp_copy_one_addr(dest, &addr->a,
|
2005-04-16 16:20:36 -06:00
|
|
|
SCTP_SCOPE_LINK, gfp,
|
|
|
|
flags);
|
|
|
|
if (error < 0)
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
|
|
|
if (error)
|
|
|
|
sctp_bind_addr_clean(dest);
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2007-12-06 23:50:54 -07:00
|
|
|
/* Exactly duplicate the address lists. This is necessary when doing
|
|
|
|
* peer-offs and accepts. We don't want to put all the current system
|
|
|
|
* addresses into the endpoint. That's useless. But we do want duplicat
|
|
|
|
* the list of bound addresses that the older endpoint used.
|
|
|
|
*/
|
|
|
|
int sctp_bind_addr_dup(struct sctp_bind_addr *dest,
|
|
|
|
const struct sctp_bind_addr *src,
|
|
|
|
gfp_t gfp)
|
|
|
|
{
|
|
|
|
struct sctp_sockaddr_entry *addr;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
/* All addresses share the same port. */
|
|
|
|
dest->port = src->port;
|
|
|
|
|
2008-04-12 19:54:24 -06:00
|
|
|
list_for_each_entry(addr, &src->address_list, list) {
|
2007-12-06 23:50:54 -07:00
|
|
|
error = sctp_add_bind_addr(dest, &addr->a, 1, gfp);
|
|
|
|
if (error < 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/* Initialize the SCTP_bind_addr structure for either an endpoint or
|
|
|
|
* an association.
|
|
|
|
*/
|
|
|
|
void sctp_bind_addr_init(struct sctp_bind_addr *bp, __u16 port)
|
|
|
|
{
|
|
|
|
bp->malloced = 0;
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&bp->address_list);
|
|
|
|
bp->port = port;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Dispose of the address list. */
|
|
|
|
static void sctp_bind_addr_clean(struct sctp_bind_addr *bp)
|
|
|
|
{
|
2011-05-19 03:55:13 -06:00
|
|
|
struct sctp_sockaddr_entry *addr, *temp;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* Empty the bind address list. */
|
2011-05-19 03:55:13 -06:00
|
|
|
list_for_each_entry_safe(addr, temp, &bp->address_list, list) {
|
|
|
|
list_del_rcu(&addr->list);
|
2011-05-21 00:10:23 -06:00
|
|
|
kfree_rcu(addr, rcu);
|
2005-04-16 16:20:36 -06:00
|
|
|
SCTP_DBG_OBJCNT_DEC(addr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Dispose of an SCTP_bind_addr structure */
|
|
|
|
void sctp_bind_addr_free(struct sctp_bind_addr *bp)
|
|
|
|
{
|
|
|
|
/* Empty the bind address list. */
|
|
|
|
sctp_bind_addr_clean(bp);
|
|
|
|
|
|
|
|
if (bp->malloced) {
|
|
|
|
kfree(bp);
|
|
|
|
SCTP_DBG_OBJCNT_DEC(bind_addr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add an address to the bind address list in the SCTP_bind_addr structure. */
|
|
|
|
int sctp_add_bind_addr(struct sctp_bind_addr *bp, union sctp_addr *new,
|
2007-12-20 15:12:24 -07:00
|
|
|
__u8 addr_state, gfp_t gfp)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
struct sctp_sockaddr_entry *addr;
|
|
|
|
|
|
|
|
/* Add the address to the bind address list. */
|
|
|
|
addr = t_new(struct sctp_sockaddr_entry, gfp);
|
|
|
|
if (!addr)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2006-11-20 18:10:38 -07:00
|
|
|
memcpy(&addr->a, new, sizeof(*new));
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* Fix up the port if it has not yet been set.
|
|
|
|
* Both v4 and v6 have the port at the same offset.
|
|
|
|
*/
|
2006-11-20 18:10:38 -07:00
|
|
|
if (!addr->a.v4.sin_port)
|
|
|
|
addr->a.v4.sin_port = htons(bp->port);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-12-20 15:12:24 -07:00
|
|
|
addr->state = addr_state;
|
2007-09-16 17:02:12 -06:00
|
|
|
addr->valid = 1;
|
2006-07-21 15:49:25 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
INIT_LIST_HEAD(&addr->list);
|
2007-09-16 17:03:28 -06:00
|
|
|
|
|
|
|
/* We always hold a socket lock when calling this function,
|
|
|
|
* and that acts as a writer synchronizing lock.
|
|
|
|
*/
|
|
|
|
list_add_tail_rcu(&addr->list, &bp->address_list);
|
2005-04-16 16:20:36 -06:00
|
|
|
SCTP_DBG_OBJCNT_INC(addr);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Delete an address from the bind address list in the SCTP_bind_addr
|
|
|
|
* structure.
|
|
|
|
*/
|
2007-10-24 14:10:00 -06:00
|
|
|
int sctp_del_bind_addr(struct sctp_bind_addr *bp, union sctp_addr *del_addr)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2007-09-16 17:03:28 -06:00
|
|
|
struct sctp_sockaddr_entry *addr, *temp;
|
2008-03-11 19:05:02 -06:00
|
|
|
int found = 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-09-16 17:03:28 -06:00
|
|
|
/* We hold the socket lock when calling this function,
|
|
|
|
* and that acts as a writer synchronizing lock.
|
|
|
|
*/
|
|
|
|
list_for_each_entry_safe(addr, temp, &bp->address_list, list) {
|
2006-11-20 18:07:48 -07:00
|
|
|
if (sctp_cmp_addr_exact(&addr->a, del_addr)) {
|
2005-04-16 16:20:36 -06:00
|
|
|
/* Found the exact match. */
|
2008-03-11 19:05:02 -06:00
|
|
|
found = 1;
|
2007-09-16 17:03:28 -06:00
|
|
|
addr->valid = 0;
|
|
|
|
list_del_rcu(&addr->list);
|
|
|
|
break;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-03-11 19:05:02 -06:00
|
|
|
if (found) {
|
2011-03-15 04:05:02 -06:00
|
|
|
kfree_rcu(addr, rcu);
|
2007-09-16 17:03:28 -06:00
|
|
|
SCTP_DBG_OBJCNT_DEC(addr);
|
2007-10-24 14:10:00 -06:00
|
|
|
return 0;
|
2007-09-16 17:03:28 -06:00
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Create a network byte-order representation of all the addresses
|
|
|
|
* formated as SCTP parameters.
|
|
|
|
*
|
|
|
|
* The second argument is the return value for the length.
|
|
|
|
*/
|
|
|
|
union sctp_params sctp_bind_addrs_to_raw(const struct sctp_bind_addr *bp,
|
2005-07-11 21:57:47 -06:00
|
|
|
int *addrs_len,
|
2005-10-07 00:46:04 -06:00
|
|
|
gfp_t gfp)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
union sctp_params addrparms;
|
|
|
|
union sctp_params retval;
|
|
|
|
int addrparms_len;
|
|
|
|
union sctp_addr_param rawaddr;
|
|
|
|
int len;
|
|
|
|
struct sctp_sockaddr_entry *addr;
|
|
|
|
struct list_head *pos;
|
|
|
|
struct sctp_af *af;
|
|
|
|
|
|
|
|
addrparms_len = 0;
|
|
|
|
len = 0;
|
|
|
|
|
|
|
|
/* Allocate enough memory at once. */
|
|
|
|
list_for_each(pos, &bp->address_list) {
|
|
|
|
len += sizeof(union sctp_addr_param);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Don't even bother embedding an address if there
|
|
|
|
* is only one.
|
|
|
|
*/
|
|
|
|
if (len == sizeof(union sctp_addr_param)) {
|
|
|
|
retval.v = NULL;
|
|
|
|
goto end_raw;
|
|
|
|
}
|
|
|
|
|
|
|
|
retval.v = kmalloc(len, gfp);
|
|
|
|
if (!retval.v)
|
|
|
|
goto end_raw;
|
|
|
|
|
|
|
|
addrparms = retval;
|
|
|
|
|
2008-04-12 19:54:24 -06:00
|
|
|
list_for_each_entry(addr, &bp->address_list, list) {
|
2006-11-20 18:21:44 -07:00
|
|
|
af = sctp_get_af_specific(addr->a.v4.sin_family);
|
|
|
|
len = af->to_addr_param(&addr->a, &rawaddr);
|
2005-04-16 16:20:36 -06:00
|
|
|
memcpy(addrparms.v, &rawaddr, len);
|
|
|
|
addrparms.v += len;
|
|
|
|
addrparms_len += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
end_raw:
|
|
|
|
*addrs_len = addrparms_len;
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create an address list out of the raw address list format (IPv4 and IPv6
|
|
|
|
* address parameters).
|
|
|
|
*/
|
|
|
|
int sctp_raw_to_bind_addrs(struct sctp_bind_addr *bp, __u8 *raw_addr_list,
|
2005-10-07 00:46:04 -06:00
|
|
|
int addrs_len, __u16 port, gfp_t gfp)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
union sctp_addr_param *rawaddr;
|
|
|
|
struct sctp_paramhdr *param;
|
|
|
|
union sctp_addr addr;
|
|
|
|
int retval = 0;
|
|
|
|
int len;
|
|
|
|
struct sctp_af *af;
|
|
|
|
|
|
|
|
/* Convert the raw address to standard address format */
|
|
|
|
while (addrs_len) {
|
|
|
|
param = (struct sctp_paramhdr *)raw_addr_list;
|
|
|
|
rawaddr = (union sctp_addr_param *)raw_addr_list;
|
|
|
|
|
|
|
|
af = sctp_get_af_specific(param_type2af(param->type));
|
|
|
|
if (unlikely(!af)) {
|
|
|
|
retval = -EINVAL;
|
|
|
|
sctp_bind_addr_clean(bp);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2006-11-20 18:11:13 -07:00
|
|
|
af->from_addr_param(&addr, rawaddr, htons(port), 0);
|
2007-12-20 15:12:24 -07:00
|
|
|
retval = sctp_add_bind_addr(bp, &addr, SCTP_ADDR_SRC, gfp);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (retval) {
|
|
|
|
/* Can't finish building the list, clean up. */
|
|
|
|
sctp_bind_addr_clean(bp);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
len = ntohs(param->length);
|
|
|
|
addrs_len -= len;
|
|
|
|
raw_addr_list += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
/********************************************************************
|
|
|
|
* 2nd Level Abstractions
|
|
|
|
********************************************************************/
|
|
|
|
|
|
|
|
/* Does this contain a specified address? Allow wildcarding. */
|
2007-02-09 07:25:18 -07:00
|
|
|
int sctp_bind_addr_match(struct sctp_bind_addr *bp,
|
2005-04-16 16:20:36 -06:00
|
|
|
const union sctp_addr *addr,
|
|
|
|
struct sctp_sock *opt)
|
|
|
|
{
|
|
|
|
struct sctp_sockaddr_entry *laddr;
|
2007-09-16 17:03:28 -06:00
|
|
|
int match = 0;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(laddr, &bp->address_list, list) {
|
|
|
|
if (!laddr->valid)
|
|
|
|
continue;
|
|
|
|
if (opt->pf->cmp_addr(&laddr->a, addr, opt)) {
|
|
|
|
match = 1;
|
|
|
|
break;
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2007-09-16 17:03:28 -06:00
|
|
|
rcu_read_unlock();
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-09-16 17:03:28 -06:00
|
|
|
return match;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2008-07-19 00:05:40 -06:00
|
|
|
/* Does the address 'addr' conflict with any addresses in
|
|
|
|
* the bp.
|
|
|
|
*/
|
|
|
|
int sctp_bind_addr_conflict(struct sctp_bind_addr *bp,
|
|
|
|
const union sctp_addr *addr,
|
|
|
|
struct sctp_sock *bp_sp,
|
|
|
|
struct sctp_sock *addr_sp)
|
|
|
|
{
|
|
|
|
struct sctp_sockaddr_entry *laddr;
|
|
|
|
int conflict = 0;
|
|
|
|
struct sctp_sock *sp;
|
|
|
|
|
|
|
|
/* Pick the IPv6 socket as the basis of comparison
|
|
|
|
* since it's usually a superset of the IPv4.
|
|
|
|
* If there is no IPv6 socket, then default to bind_addr.
|
|
|
|
*/
|
|
|
|
if (sctp_opt2sk(bp_sp)->sk_family == AF_INET6)
|
|
|
|
sp = bp_sp;
|
|
|
|
else if (sctp_opt2sk(addr_sp)->sk_family == AF_INET6)
|
|
|
|
sp = addr_sp;
|
|
|
|
else
|
|
|
|
sp = bp_sp;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(laddr, &bp->address_list, list) {
|
|
|
|
if (!laddr->valid)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
conflict = sp->pf->cmp_addr(&laddr->a, addr, sp);
|
|
|
|
if (conflict)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return conflict;
|
|
|
|
}
|
|
|
|
|
2007-12-20 15:12:59 -07:00
|
|
|
/* Get the state of the entry in the bind_addr_list */
|
|
|
|
int sctp_bind_addr_state(const struct sctp_bind_addr *bp,
|
|
|
|
const union sctp_addr *addr)
|
|
|
|
{
|
|
|
|
struct sctp_sockaddr_entry *laddr;
|
|
|
|
struct sctp_af *af;
|
|
|
|
int state = -1;
|
|
|
|
|
|
|
|
af = sctp_get_af_specific(addr->sa.sa_family);
|
|
|
|
if (unlikely(!af))
|
|
|
|
return state;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(laddr, &bp->address_list, list) {
|
|
|
|
if (!laddr->valid)
|
|
|
|
continue;
|
|
|
|
if (af->cmp_addr(&laddr->a, addr)) {
|
|
|
|
state = laddr->state;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return state;
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/* Find the first address in the bind address list that is not present in
|
|
|
|
* the addrs packed array.
|
|
|
|
*/
|
|
|
|
union sctp_addr *sctp_find_unmatch_addr(struct sctp_bind_addr *bp,
|
|
|
|
const union sctp_addr *addrs,
|
|
|
|
int addrcnt,
|
|
|
|
struct sctp_sock *opt)
|
|
|
|
{
|
|
|
|
struct sctp_sockaddr_entry *laddr;
|
|
|
|
union sctp_addr *addr;
|
|
|
|
void *addr_buf;
|
|
|
|
struct sctp_af *af;
|
|
|
|
int i;
|
|
|
|
|
2007-09-16 17:03:28 -06:00
|
|
|
/* This is only called sctp_send_asconf_del_ip() and we hold
|
|
|
|
* the socket lock in that code patch, so that address list
|
|
|
|
* can't change.
|
|
|
|
*/
|
|
|
|
list_for_each_entry(laddr, &bp->address_list, list) {
|
2005-04-16 16:20:36 -06:00
|
|
|
addr_buf = (union sctp_addr *)addrs;
|
|
|
|
for (i = 0; i < addrcnt; i++) {
|
|
|
|
addr = (union sctp_addr *)addr_buf;
|
|
|
|
af = sctp_get_af_specific(addr->v4.sin_family);
|
2007-02-09 07:25:18 -07:00
|
|
|
if (!af)
|
2007-09-16 17:03:28 -06:00
|
|
|
break;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-11-20 18:05:23 -07:00
|
|
|
if (opt->pf->cmp_addr(&laddr->a, addr, opt))
|
2005-04-16 16:20:36 -06:00
|
|
|
break;
|
|
|
|
|
|
|
|
addr_buf += af->sockaddr_len;
|
|
|
|
}
|
|
|
|
if (i == addrcnt)
|
2006-11-20 18:22:08 -07:00
|
|
|
return &laddr->a;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Copy out addresses from the global local address list. */
|
2007-02-09 07:25:18 -07:00
|
|
|
static int sctp_copy_one_addr(struct sctp_bind_addr *dest,
|
2005-04-16 16:20:36 -06:00
|
|
|
union sctp_addr *addr,
|
2005-10-07 00:46:04 -06:00
|
|
|
sctp_scope_t scope, gfp_t gfp,
|
2005-07-11 21:57:47 -06:00
|
|
|
int flags)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
int error = 0;
|
|
|
|
|
2008-08-18 08:34:34 -06:00
|
|
|
if (sctp_is_any(NULL, addr)) {
|
2005-04-16 16:20:36 -06:00
|
|
|
error = sctp_copy_local_addr_list(dest, scope, gfp, flags);
|
|
|
|
} else if (sctp_in_scope(addr, scope)) {
|
|
|
|
/* Now that the address is in scope, check to see if
|
|
|
|
* the address type is supported by local sock as
|
|
|
|
* well as the remote peer.
|
|
|
|
*/
|
|
|
|
if ((((AF_INET == addr->sa.sa_family) &&
|
|
|
|
(flags & SCTP_ADDR4_PEERSUPP))) ||
|
|
|
|
(((AF_INET6 == addr->sa.sa_family) &&
|
|
|
|
(flags & SCTP_ADDR6_ALLOWED) &&
|
|
|
|
(flags & SCTP_ADDR6_PEERSUPP))))
|
2007-12-20 15:12:24 -07:00
|
|
|
error = sctp_add_bind_addr(dest, addr, SCTP_ADDR_SRC,
|
|
|
|
gfp);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Is this a wildcard address? */
|
2008-08-18 08:34:34 -06:00
|
|
|
int sctp_is_any(struct sock *sk, const union sctp_addr *addr)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2008-08-18 08:34:34 -06:00
|
|
|
unsigned short fam = 0;
|
|
|
|
struct sctp_af *af;
|
|
|
|
|
|
|
|
/* Try to get the right address family */
|
|
|
|
if (addr->sa.sa_family != AF_UNSPEC)
|
|
|
|
fam = addr->sa.sa_family;
|
|
|
|
else if (sk)
|
|
|
|
fam = sk->sk_family;
|
|
|
|
|
|
|
|
af = sctp_get_af_specific(fam);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (!af)
|
|
|
|
return 0;
|
2008-08-18 08:34:34 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
return af->is_any(addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Is 'addr' valid for 'scope'? */
|
|
|
|
int sctp_in_scope(const union sctp_addr *addr, sctp_scope_t scope)
|
|
|
|
{
|
|
|
|
sctp_scope_t addr_scope = sctp_scope(addr);
|
|
|
|
|
|
|
|
/* The unusable SCTP addresses will not be considered with
|
|
|
|
* any defined scopes.
|
|
|
|
*/
|
|
|
|
if (SCTP_SCOPE_UNUSABLE == addr_scope)
|
|
|
|
return 0;
|
|
|
|
/*
|
|
|
|
* For INIT and INIT-ACK address list, let L be the level of
|
|
|
|
* of requested destination address, sender and receiver
|
|
|
|
* SHOULD include all of its addresses with level greater
|
|
|
|
* than or equal to L.
|
2009-09-03 05:55:47 -06:00
|
|
|
*
|
|
|
|
* Address scoping can be selectively controlled via sysctl
|
|
|
|
* option
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2009-09-03 05:55:47 -06:00
|
|
|
switch (sctp_scope_policy) {
|
|
|
|
case SCTP_SCOPE_POLICY_DISABLE:
|
2005-04-16 16:20:36 -06:00
|
|
|
return 1;
|
2009-09-03 05:55:47 -06:00
|
|
|
case SCTP_SCOPE_POLICY_ENABLE:
|
|
|
|
if (addr_scope <= scope)
|
|
|
|
return 1;
|
|
|
|
break;
|
|
|
|
case SCTP_SCOPE_POLICY_PRIVATE:
|
|
|
|
if (addr_scope <= scope || SCTP_SCOPE_PRIVATE == addr_scope)
|
|
|
|
return 1;
|
|
|
|
break;
|
|
|
|
case SCTP_SCOPE_POLICY_LINK:
|
|
|
|
if (addr_scope <= scope || SCTP_SCOPE_LINK == addr_scope)
|
|
|
|
return 1;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/********************************************************************
|
|
|
|
* 3rd Level Abstractions
|
|
|
|
********************************************************************/
|
|
|
|
|
|
|
|
/* What is the scope of 'addr'? */
|
|
|
|
sctp_scope_t sctp_scope(const union sctp_addr *addr)
|
|
|
|
{
|
|
|
|
struct sctp_af *af;
|
|
|
|
|
|
|
|
af = sctp_get_af_specific(addr->sa.sa_family);
|
|
|
|
if (!af)
|
|
|
|
return SCTP_SCOPE_UNUSABLE;
|
|
|
|
|
|
|
|
return af->scope((union sctp_addr *)addr);
|
|
|
|
}
|