1*4882a593Smuzhiyun /*
2*4882a593Smuzhiyun * Copyright (c) 2006, 2017 Oracle and/or its affiliates. All rights reserved.
3*4882a593Smuzhiyun *
4*4882a593Smuzhiyun * This software is available to you under a choice of one of two
5*4882a593Smuzhiyun * licenses. You may choose to be licensed under the terms of the GNU
6*4882a593Smuzhiyun * General Public License (GPL) Version 2, available from the file
7*4882a593Smuzhiyun * COPYING in the main directory of this source tree, or the
8*4882a593Smuzhiyun * OpenIB.org BSD license below:
9*4882a593Smuzhiyun *
10*4882a593Smuzhiyun * Redistribution and use in source and binary forms, with or
11*4882a593Smuzhiyun * without modification, are permitted provided that the following
12*4882a593Smuzhiyun * conditions are met:
13*4882a593Smuzhiyun *
14*4882a593Smuzhiyun * - Redistributions of source code must retain the above
15*4882a593Smuzhiyun * copyright notice, this list of conditions and the following
16*4882a593Smuzhiyun * disclaimer.
17*4882a593Smuzhiyun *
18*4882a593Smuzhiyun * - Redistributions in binary form must reproduce the above
19*4882a593Smuzhiyun * copyright notice, this list of conditions and the following
20*4882a593Smuzhiyun * disclaimer in the documentation and/or other materials
21*4882a593Smuzhiyun * provided with the distribution.
22*4882a593Smuzhiyun *
23*4882a593Smuzhiyun * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24*4882a593Smuzhiyun * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25*4882a593Smuzhiyun * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26*4882a593Smuzhiyun * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27*4882a593Smuzhiyun * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28*4882a593Smuzhiyun * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29*4882a593Smuzhiyun * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30*4882a593Smuzhiyun * SOFTWARE.
31*4882a593Smuzhiyun *
32*4882a593Smuzhiyun */
33*4882a593Smuzhiyun #include <linux/kernel.h>
34*4882a593Smuzhiyun #include <linux/module.h>
35*4882a593Smuzhiyun #include <linux/in.h>
36*4882a593Smuzhiyun #include <linux/ipv6.h>
37*4882a593Smuzhiyun
38*4882a593Smuzhiyun #include "rds.h"
39*4882a593Smuzhiyun #include "loop.h"
40*4882a593Smuzhiyun
41*4882a593Smuzhiyun static char * const rds_trans_modules[] = {
42*4882a593Smuzhiyun [RDS_TRANS_IB] = "rds_rdma",
43*4882a593Smuzhiyun [RDS_TRANS_GAP] = NULL,
44*4882a593Smuzhiyun [RDS_TRANS_TCP] = "rds_tcp",
45*4882a593Smuzhiyun };
46*4882a593Smuzhiyun
47*4882a593Smuzhiyun static struct rds_transport *transports[RDS_TRANS_COUNT];
48*4882a593Smuzhiyun static DECLARE_RWSEM(rds_trans_sem);
49*4882a593Smuzhiyun
rds_trans_register(struct rds_transport * trans)50*4882a593Smuzhiyun void rds_trans_register(struct rds_transport *trans)
51*4882a593Smuzhiyun {
52*4882a593Smuzhiyun BUG_ON(strlen(trans->t_name) + 1 > TRANSNAMSIZ);
53*4882a593Smuzhiyun
54*4882a593Smuzhiyun down_write(&rds_trans_sem);
55*4882a593Smuzhiyun
56*4882a593Smuzhiyun if (transports[trans->t_type])
57*4882a593Smuzhiyun printk(KERN_ERR "RDS Transport type %d already registered\n",
58*4882a593Smuzhiyun trans->t_type);
59*4882a593Smuzhiyun else {
60*4882a593Smuzhiyun transports[trans->t_type] = trans;
61*4882a593Smuzhiyun printk(KERN_INFO "Registered RDS/%s transport\n", trans->t_name);
62*4882a593Smuzhiyun }
63*4882a593Smuzhiyun
64*4882a593Smuzhiyun up_write(&rds_trans_sem);
65*4882a593Smuzhiyun }
66*4882a593Smuzhiyun EXPORT_SYMBOL_GPL(rds_trans_register);
67*4882a593Smuzhiyun
rds_trans_unregister(struct rds_transport * trans)68*4882a593Smuzhiyun void rds_trans_unregister(struct rds_transport *trans)
69*4882a593Smuzhiyun {
70*4882a593Smuzhiyun down_write(&rds_trans_sem);
71*4882a593Smuzhiyun
72*4882a593Smuzhiyun transports[trans->t_type] = NULL;
73*4882a593Smuzhiyun printk(KERN_INFO "Unregistered RDS/%s transport\n", trans->t_name);
74*4882a593Smuzhiyun
75*4882a593Smuzhiyun up_write(&rds_trans_sem);
76*4882a593Smuzhiyun }
77*4882a593Smuzhiyun EXPORT_SYMBOL_GPL(rds_trans_unregister);
78*4882a593Smuzhiyun
rds_trans_put(struct rds_transport * trans)79*4882a593Smuzhiyun void rds_trans_put(struct rds_transport *trans)
80*4882a593Smuzhiyun {
81*4882a593Smuzhiyun if (trans)
82*4882a593Smuzhiyun module_put(trans->t_owner);
83*4882a593Smuzhiyun }
84*4882a593Smuzhiyun
rds_trans_get_preferred(struct net * net,const struct in6_addr * addr,__u32 scope_id)85*4882a593Smuzhiyun struct rds_transport *rds_trans_get_preferred(struct net *net,
86*4882a593Smuzhiyun const struct in6_addr *addr,
87*4882a593Smuzhiyun __u32 scope_id)
88*4882a593Smuzhiyun {
89*4882a593Smuzhiyun struct rds_transport *ret = NULL;
90*4882a593Smuzhiyun struct rds_transport *trans;
91*4882a593Smuzhiyun unsigned int i;
92*4882a593Smuzhiyun
93*4882a593Smuzhiyun if (ipv6_addr_v4mapped(addr)) {
94*4882a593Smuzhiyun if (*(u_int8_t *)&addr->s6_addr32[3] == IN_LOOPBACKNET)
95*4882a593Smuzhiyun return &rds_loop_transport;
96*4882a593Smuzhiyun } else if (ipv6_addr_loopback(addr)) {
97*4882a593Smuzhiyun return &rds_loop_transport;
98*4882a593Smuzhiyun }
99*4882a593Smuzhiyun
100*4882a593Smuzhiyun down_read(&rds_trans_sem);
101*4882a593Smuzhiyun for (i = 0; i < RDS_TRANS_COUNT; i++) {
102*4882a593Smuzhiyun trans = transports[i];
103*4882a593Smuzhiyun
104*4882a593Smuzhiyun if (trans && (trans->laddr_check(net, addr, scope_id) == 0) &&
105*4882a593Smuzhiyun (!trans->t_owner || try_module_get(trans->t_owner))) {
106*4882a593Smuzhiyun ret = trans;
107*4882a593Smuzhiyun break;
108*4882a593Smuzhiyun }
109*4882a593Smuzhiyun }
110*4882a593Smuzhiyun up_read(&rds_trans_sem);
111*4882a593Smuzhiyun
112*4882a593Smuzhiyun return ret;
113*4882a593Smuzhiyun }
114*4882a593Smuzhiyun
rds_trans_get(int t_type)115*4882a593Smuzhiyun struct rds_transport *rds_trans_get(int t_type)
116*4882a593Smuzhiyun {
117*4882a593Smuzhiyun struct rds_transport *ret = NULL;
118*4882a593Smuzhiyun struct rds_transport *trans;
119*4882a593Smuzhiyun
120*4882a593Smuzhiyun down_read(&rds_trans_sem);
121*4882a593Smuzhiyun trans = transports[t_type];
122*4882a593Smuzhiyun if (!trans) {
123*4882a593Smuzhiyun up_read(&rds_trans_sem);
124*4882a593Smuzhiyun if (rds_trans_modules[t_type])
125*4882a593Smuzhiyun request_module(rds_trans_modules[t_type]);
126*4882a593Smuzhiyun down_read(&rds_trans_sem);
127*4882a593Smuzhiyun trans = transports[t_type];
128*4882a593Smuzhiyun }
129*4882a593Smuzhiyun if (trans && trans->t_type == t_type &&
130*4882a593Smuzhiyun (!trans->t_owner || try_module_get(trans->t_owner)))
131*4882a593Smuzhiyun ret = trans;
132*4882a593Smuzhiyun
133*4882a593Smuzhiyun up_read(&rds_trans_sem);
134*4882a593Smuzhiyun
135*4882a593Smuzhiyun return ret;
136*4882a593Smuzhiyun }
137*4882a593Smuzhiyun
138*4882a593Smuzhiyun /*
139*4882a593Smuzhiyun * This returns the number of stats entries in the snapshot and only
140*4882a593Smuzhiyun * copies them using the iter if there is enough space for them. The
141*4882a593Smuzhiyun * caller passes in the global stats so that we can size and copy while
142*4882a593Smuzhiyun * holding the lock.
143*4882a593Smuzhiyun */
rds_trans_stats_info_copy(struct rds_info_iterator * iter,unsigned int avail)144*4882a593Smuzhiyun unsigned int rds_trans_stats_info_copy(struct rds_info_iterator *iter,
145*4882a593Smuzhiyun unsigned int avail)
146*4882a593Smuzhiyun
147*4882a593Smuzhiyun {
148*4882a593Smuzhiyun struct rds_transport *trans;
149*4882a593Smuzhiyun unsigned int total = 0;
150*4882a593Smuzhiyun unsigned int part;
151*4882a593Smuzhiyun int i;
152*4882a593Smuzhiyun
153*4882a593Smuzhiyun rds_info_iter_unmap(iter);
154*4882a593Smuzhiyun down_read(&rds_trans_sem);
155*4882a593Smuzhiyun
156*4882a593Smuzhiyun for (i = 0; i < RDS_TRANS_COUNT; i++) {
157*4882a593Smuzhiyun trans = transports[i];
158*4882a593Smuzhiyun if (!trans || !trans->stats_info_copy)
159*4882a593Smuzhiyun continue;
160*4882a593Smuzhiyun
161*4882a593Smuzhiyun part = trans->stats_info_copy(iter, avail);
162*4882a593Smuzhiyun avail -= min(avail, part);
163*4882a593Smuzhiyun total += part;
164*4882a593Smuzhiyun }
165*4882a593Smuzhiyun
166*4882a593Smuzhiyun up_read(&rds_trans_sem);
167*4882a593Smuzhiyun
168*4882a593Smuzhiyun return total;
169*4882a593Smuzhiyun }
170