2009-02-24 23:30:24 +08:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 Oracle. All rights reserved.
|
|
|
|
*
|
|
|
|
* This software is available to you under a choice of one of two
|
|
|
|
* licenses. You may choose to be licensed under the terms of the GNU
|
|
|
|
* General Public License (GPL) Version 2, available from the file
|
|
|
|
* COPYING in the main directory of this source tree, or the
|
|
|
|
* OpenIB.org BSD license below:
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or
|
|
|
|
* without modification, are permitted provided that the following
|
|
|
|
* conditions are met:
|
|
|
|
*
|
|
|
|
* - Redistributions of source code must retain the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer.
|
|
|
|
*
|
|
|
|
* - 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.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#include <linux/kernel.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 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2009-02-24 23:30:24 +08:00
|
|
|
#include <linux/in.h>
|
2018-06-25 21:41:25 +08:00
|
|
|
#include <net/net_namespace.h>
|
|
|
|
#include <net/netns/generic.h>
|
2009-02-24 23:30:24 +08:00
|
|
|
|
2016-06-14 00:44:26 +08:00
|
|
|
#include "rds_single_path.h"
|
2009-02-24 23:30:24 +08:00
|
|
|
#include "rds.h"
|
|
|
|
#include "loop.h"
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(loop_conns_lock);
|
|
|
|
static LIST_HEAD(loop_conns);
|
2018-06-25 21:41:25 +08:00
|
|
|
static atomic_t rds_loop_unloading = ATOMIC_INIT(0);
|
|
|
|
|
|
|
|
static void rds_loop_set_unloading(void)
|
|
|
|
{
|
|
|
|
atomic_set(&rds_loop_unloading, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool rds_loop_is_unloading(struct rds_connection *conn)
|
|
|
|
{
|
|
|
|
return atomic_read(&rds_loop_unloading) != 0;
|
|
|
|
}
|
2009-02-24 23:30:24 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This 'loopback' transport is a special case for flows that originate
|
|
|
|
* and terminate on the same machine.
|
|
|
|
*
|
|
|
|
* Connection build-up notices if the destination address is thought of
|
|
|
|
* as a local address by a transport. At that time it decides to use the
|
|
|
|
* loopback transport instead of the bound transport of the sending socket.
|
|
|
|
*
|
|
|
|
* The loopback transport's sending path just hands the sent rds_message
|
|
|
|
* straight to the receiving path via an embedded rds_incoming.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Usually a message transits both the sender and receiver's conns as it
|
|
|
|
* flows to the receiver. In the loopback case, though, the receive path
|
|
|
|
* is handed the sending conn so the sense of the addresses is reversed.
|
|
|
|
*/
|
|
|
|
static int rds_loop_xmit(struct rds_connection *conn, struct rds_message *rm,
|
|
|
|
unsigned int hdr_off, unsigned int sg,
|
|
|
|
unsigned int off)
|
|
|
|
{
|
2011-03-02 14:28:22 +08:00
|
|
|
struct scatterlist *sgp = &rm->data.op_sg[sg];
|
|
|
|
int ret = sizeof(struct rds_header) +
|
|
|
|
be32_to_cpu(rm->m_inc.i_hdr.h_len);
|
|
|
|
|
2010-03-23 06:22:04 +08:00
|
|
|
/* Do not send cong updates to loopback */
|
|
|
|
if (rm->m_inc.i_hdr.h_flags & RDS_FLAG_CONG_BITMAP) {
|
|
|
|
rds_cong_map_updated(conn->c_fcong, ~(u64) 0);
|
2011-03-02 14:28:22 +08:00
|
|
|
ret = min_t(int, ret, sgp->length - conn->c_xmit_data_off);
|
|
|
|
goto out;
|
2010-03-23 06:22:04 +08:00
|
|
|
}
|
|
|
|
|
2009-02-24 23:30:24 +08:00
|
|
|
BUG_ON(hdr_off || sg || off);
|
|
|
|
|
|
|
|
rds_inc_init(&rm->m_inc, conn, conn->c_laddr);
|
2010-01-20 10:14:56 +08:00
|
|
|
/* For the embedded inc. Matching put is in loop_inc_free() */
|
|
|
|
rds_message_addref(rm);
|
2009-02-24 23:30:24 +08:00
|
|
|
|
|
|
|
rds_recv_incoming(conn, conn->c_laddr, conn->c_faddr, &rm->m_inc,
|
2011-11-25 23:14:40 +08:00
|
|
|
GFP_KERNEL);
|
2009-02-24 23:30:24 +08:00
|
|
|
|
|
|
|
rds_send_drop_acked(conn, be64_to_cpu(rm->m_inc.i_hdr.h_sequence),
|
|
|
|
NULL);
|
|
|
|
|
|
|
|
rds_inc_put(&rm->m_inc);
|
2011-03-02 14:28:22 +08:00
|
|
|
out:
|
|
|
|
return ret;
|
2009-02-24 23:30:24 +08:00
|
|
|
}
|
|
|
|
|
2010-01-20 10:14:56 +08:00
|
|
|
/*
|
|
|
|
* See rds_loop_xmit(). Since our inc is embedded in the rm, we
|
|
|
|
* make sure the rm lives at least until the inc is done.
|
|
|
|
*/
|
|
|
|
static void rds_loop_inc_free(struct rds_incoming *inc)
|
|
|
|
{
|
2016-06-18 23:46:31 +08:00
|
|
|
struct rds_message *rm = container_of(inc, struct rds_message, m_inc);
|
|
|
|
|
|
|
|
rds_message_put(rm);
|
2010-01-20 10:14:56 +08:00
|
|
|
}
|
|
|
|
|
2009-02-24 23:30:24 +08:00
|
|
|
/* we need to at least give the thread something to succeed */
|
2016-07-01 07:11:15 +08:00
|
|
|
static int rds_loop_recv_path(struct rds_conn_path *cp)
|
2009-02-24 23:30:24 +08:00
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct rds_loop_connection {
|
|
|
|
struct list_head loop_node;
|
|
|
|
struct rds_connection *conn;
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Even the loopback transport needs to keep track of its connections,
|
|
|
|
* so it can call rds_conn_destroy() on them on exit. N.B. there are
|
|
|
|
* 1+ loopback addresses (127.*.*.*) so it's not a bug to have
|
|
|
|
* multiple loopback conns allocated, although rather useless.
|
|
|
|
*/
|
|
|
|
static int rds_loop_conn_alloc(struct rds_connection *conn, gfp_t gfp)
|
|
|
|
{
|
|
|
|
struct rds_loop_connection *lc;
|
|
|
|
unsigned long flags;
|
|
|
|
|
2012-03-22 04:44:09 +08:00
|
|
|
lc = kzalloc(sizeof(struct rds_loop_connection), gfp);
|
2010-01-13 03:56:44 +08:00
|
|
|
if (!lc)
|
2009-02-24 23:30:24 +08:00
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&lc->loop_node);
|
|
|
|
lc->conn = conn;
|
|
|
|
conn->c_transport_data = lc;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&loop_conns_lock, flags);
|
|
|
|
list_add_tail(&lc->loop_node, &loop_conns);
|
|
|
|
spin_unlock_irqrestore(&loop_conns_lock, flags);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void rds_loop_conn_free(void *arg)
|
|
|
|
{
|
|
|
|
struct rds_loop_connection *lc = arg;
|
2010-11-02 09:52:05 +08:00
|
|
|
unsigned long flags;
|
|
|
|
|
2009-02-24 23:30:24 +08:00
|
|
|
rdsdebug("lc %p\n", lc);
|
2010-11-02 09:52:05 +08:00
|
|
|
spin_lock_irqsave(&loop_conns_lock, flags);
|
2009-02-24 23:30:24 +08:00
|
|
|
list_del(&lc->loop_node);
|
2010-11-02 09:52:05 +08:00
|
|
|
spin_unlock_irqrestore(&loop_conns_lock, flags);
|
2009-02-24 23:30:24 +08:00
|
|
|
kfree(lc);
|
|
|
|
}
|
|
|
|
|
2016-07-01 07:11:16 +08:00
|
|
|
static int rds_loop_conn_path_connect(struct rds_conn_path *cp)
|
2009-02-24 23:30:24 +08:00
|
|
|
{
|
2016-07-01 07:11:16 +08:00
|
|
|
rds_connect_complete(cp->cp_conn);
|
2009-02-24 23:30:24 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-07-01 07:11:10 +08:00
|
|
|
static void rds_loop_conn_path_shutdown(struct rds_conn_path *cp)
|
2009-02-24 23:30:24 +08:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void rds_loop_exit(void)
|
|
|
|
{
|
|
|
|
struct rds_loop_connection *lc, *_lc;
|
|
|
|
LIST_HEAD(tmp_list);
|
|
|
|
|
2018-06-25 21:41:25 +08:00
|
|
|
rds_loop_set_unloading();
|
|
|
|
synchronize_rcu();
|
2009-02-24 23:30:24 +08:00
|
|
|
/* avoid calling conn_destroy with irqs off */
|
|
|
|
spin_lock_irq(&loop_conns_lock);
|
|
|
|
list_splice(&loop_conns, &tmp_list);
|
|
|
|
INIT_LIST_HEAD(&loop_conns);
|
|
|
|
spin_unlock_irq(&loop_conns_lock);
|
|
|
|
|
|
|
|
list_for_each_entry_safe(lc, _lc, &tmp_list, loop_node) {
|
|
|
|
WARN_ON(lc->conn->c_passive);
|
|
|
|
rds_conn_destroy(lc->conn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-06-25 21:41:25 +08:00
|
|
|
static void rds_loop_kill_conns(struct net *net)
|
|
|
|
{
|
|
|
|
struct rds_loop_connection *lc, *_lc;
|
|
|
|
LIST_HEAD(tmp_list);
|
|
|
|
|
|
|
|
spin_lock_irq(&loop_conns_lock);
|
|
|
|
list_for_each_entry_safe(lc, _lc, &loop_conns, loop_node) {
|
|
|
|
struct net *c_net = read_pnet(&lc->conn->c_net);
|
|
|
|
|
|
|
|
if (net != c_net)
|
|
|
|
continue;
|
|
|
|
list_move_tail(&lc->loop_node, &tmp_list);
|
|
|
|
}
|
|
|
|
spin_unlock_irq(&loop_conns_lock);
|
|
|
|
|
|
|
|
list_for_each_entry_safe(lc, _lc, &tmp_list, loop_node) {
|
|
|
|
WARN_ON(lc->conn->c_passive);
|
|
|
|
rds_conn_destroy(lc->conn);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __net_exit rds_loop_exit_net(struct net *net)
|
|
|
|
{
|
|
|
|
rds_loop_kill_conns(net);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct pernet_operations rds_loop_net_ops = {
|
|
|
|
.exit = rds_loop_exit_net,
|
|
|
|
};
|
|
|
|
|
|
|
|
int rds_loop_net_init(void)
|
|
|
|
{
|
|
|
|
return register_pernet_device(&rds_loop_net_ops);
|
|
|
|
}
|
|
|
|
|
|
|
|
void rds_loop_net_exit(void)
|
|
|
|
{
|
|
|
|
unregister_pernet_device(&rds_loop_net_ops);
|
|
|
|
}
|
|
|
|
|
2009-02-24 23:30:24 +08:00
|
|
|
/*
|
|
|
|
* This is missing .xmit_* because loop doesn't go through generic
|
|
|
|
* rds_send_xmit() and doesn't call rds_recv_incoming(). .listen_stop and
|
|
|
|
* .laddr_check are missing because transport.c doesn't iterate over
|
|
|
|
* rds_loop_transport.
|
|
|
|
*/
|
|
|
|
struct rds_transport rds_loop_transport = {
|
|
|
|
.xmit = rds_loop_xmit,
|
2016-07-01 07:11:15 +08:00
|
|
|
.recv_path = rds_loop_recv_path,
|
2009-02-24 23:30:24 +08:00
|
|
|
.conn_alloc = rds_loop_conn_alloc,
|
|
|
|
.conn_free = rds_loop_conn_free,
|
2016-07-01 07:11:16 +08:00
|
|
|
.conn_path_connect = rds_loop_conn_path_connect,
|
2016-07-01 07:11:10 +08:00
|
|
|
.conn_path_shutdown = rds_loop_conn_path_shutdown,
|
2009-02-24 23:30:24 +08:00
|
|
|
.inc_copy_to_user = rds_message_inc_copy_to_user,
|
2010-01-20 10:14:56 +08:00
|
|
|
.inc_free = rds_loop_inc_free,
|
2009-02-24 23:30:24 +08:00
|
|
|
.t_name = "loopback",
|
2018-06-15 02:52:34 +08:00
|
|
|
.t_type = RDS_TRANS_LOOP,
|
2018-06-25 21:41:25 +08:00
|
|
|
.t_unloading = rds_loop_is_unloading,
|
2009-02-24 23:30:24 +08:00
|
|
|
};
|