2 * Copyright (c) 2006 Oracle. All rights reserved.
4 * This software is available to you under a choice of one of two
5 * licenses. You may choose to be licensed under the terms of the GNU
6 * General Public License (GPL) Version 2, available from the file
7 * COPYING in the main directory of this source tree, or the
8 * OpenIB.org BSD license below:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
18 * - Redistributions in binary form must reproduce the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer in the documentation and/or other materials
21 * provided with the distribution.
23 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
33 #include <linux/kernel.h>
34 #include <linux/list.h>
35 #include <net/inet_hashtables.h>
41 #define RDS_CONNECTION_HASH_BITS 12
42 #define RDS_CONNECTION_HASH_ENTRIES (1 << RDS_CONNECTION_HASH_BITS)
43 #define RDS_CONNECTION_HASH_MASK (RDS_CONNECTION_HASH_ENTRIES - 1)
45 /* converting this to RCU is a chore for another day.. */
46 static DEFINE_SPINLOCK(rds_conn_lock
);
47 static unsigned long rds_conn_count
;
48 static struct hlist_head rds_conn_hash
[RDS_CONNECTION_HASH_ENTRIES
];
49 static struct kmem_cache
*rds_conn_slab
;
51 static struct hlist_head
*rds_conn_bucket(__be32 laddr
, __be32 faddr
)
53 /* Pass NULL, don't need struct net for hash */
54 unsigned long hash
= inet_ehashfn(NULL
,
55 be32_to_cpu(laddr
), 0,
56 be32_to_cpu(faddr
), 0);
57 return &rds_conn_hash
[hash
& RDS_CONNECTION_HASH_MASK
];
60 #define rds_conn_info_set(var, test, suffix) do { \
62 var |= RDS_INFO_CONNECTION_FLAG_##suffix; \
65 static inline int rds_conn_is_sending(struct rds_connection
*conn
)
69 if (!mutex_trylock(&conn
->c_send_lock
))
72 mutex_unlock(&conn
->c_send_lock
);
77 static struct rds_connection
*rds_conn_lookup(struct hlist_head
*head
,
78 __be32 laddr
, __be32 faddr
,
79 struct rds_transport
*trans
)
81 struct rds_connection
*conn
, *ret
= NULL
;
82 struct hlist_node
*pos
;
84 hlist_for_each_entry(conn
, pos
, head
, c_hash_node
) {
85 if (conn
->c_faddr
== faddr
&& conn
->c_laddr
== laddr
&&
86 conn
->c_trans
== trans
) {
91 rdsdebug("returning conn %p for %pI4 -> %pI4\n", ret
,
97 * This is called by transports as they're bringing down a connection.
98 * It clears partial message state so that the transport can start sending
99 * and receiving over this connection again in the future. It is up to
100 * the transport to have serialized this call with its send and recv.
102 void rds_conn_reset(struct rds_connection
*conn
)
104 rdsdebug("connection %pI4 to %pI4 reset\n",
105 &conn
->c_laddr
, &conn
->c_faddr
);
107 rds_stats_inc(s_conn_reset
);
108 rds_send_reset(conn
);
111 /* Do not clear next_rx_seq here, else we cannot distinguish
112 * retransmitted packets from new packets, and will hand all
113 * of them to the application. That is not consistent with the
114 * reliability guarantees of RDS. */
118 * There is only every one 'conn' for a given pair of addresses in the
119 * system at a time. They contain messages to be retransmitted and so
120 * span the lifetime of the actual underlying transport connections.
122 * For now they are not garbage collected once they're created. They
123 * are torn down as the module is removed, if ever.
125 static struct rds_connection
*__rds_conn_create(__be32 laddr
, __be32 faddr
,
126 struct rds_transport
*trans
, gfp_t gfp
,
129 struct rds_connection
*conn
, *tmp
, *parent
= NULL
;
130 struct hlist_head
*head
= rds_conn_bucket(laddr
, faddr
);
134 spin_lock_irqsave(&rds_conn_lock
, flags
);
135 conn
= rds_conn_lookup(head
, laddr
, faddr
, trans
);
138 && conn
->c_trans
!= &rds_loop_transport
140 /* This is a looped back IB connection, and we're
141 * called by the code handling the incoming connect.
142 * We need a second connection object into which we
143 * can stick the other QP. */
145 conn
= parent
->c_passive
;
147 spin_unlock_irqrestore(&rds_conn_lock
, flags
);
151 conn
= kmem_cache_alloc(rds_conn_slab
, gfp
);
153 conn
= ERR_PTR(-ENOMEM
);
157 memset(conn
, 0, sizeof(*conn
));
159 INIT_HLIST_NODE(&conn
->c_hash_node
);
160 conn
->c_version
= RDS_PROTOCOL_3_0
;
161 conn
->c_laddr
= laddr
;
162 conn
->c_faddr
= faddr
;
163 spin_lock_init(&conn
->c_lock
);
164 conn
->c_next_tx_seq
= 1;
166 mutex_init(&conn
->c_send_lock
);
167 INIT_LIST_HEAD(&conn
->c_send_queue
);
168 INIT_LIST_HEAD(&conn
->c_retrans
);
170 ret
= rds_cong_get_maps(conn
);
172 kmem_cache_free(rds_conn_slab
, conn
);
178 * This is where a connection becomes loopback. If *any* RDS sockets
179 * can bind to the destination address then we'd rather the messages
180 * flow through loopback rather than either transport.
182 if (rds_trans_get_preferred(faddr
)) {
183 conn
->c_loopback
= 1;
184 if (is_outgoing
&& trans
->t_prefer_loopback
) {
185 /* "outgoing" connection - and the transport
186 * says it wants the connection handled by the
187 * loopback transport. This is what TCP does.
189 trans
= &rds_loop_transport
;
193 conn
->c_trans
= trans
;
195 ret
= trans
->conn_alloc(conn
, gfp
);
197 kmem_cache_free(rds_conn_slab
, conn
);
202 atomic_set(&conn
->c_state
, RDS_CONN_DOWN
);
203 conn
->c_reconnect_jiffies
= 0;
204 INIT_DELAYED_WORK(&conn
->c_send_w
, rds_send_worker
);
205 INIT_DELAYED_WORK(&conn
->c_recv_w
, rds_recv_worker
);
206 INIT_DELAYED_WORK(&conn
->c_conn_w
, rds_connect_worker
);
207 INIT_WORK(&conn
->c_down_w
, rds_shutdown_worker
);
208 mutex_init(&conn
->c_cm_lock
);
211 rdsdebug("allocated conn %p for %pI4 -> %pI4 over %s %s\n",
212 conn
, &laddr
, &faddr
,
213 trans
->t_name
? trans
->t_name
: "[unknown]",
214 is_outgoing
? "(outgoing)" : "");
216 spin_lock_irqsave(&rds_conn_lock
, flags
);
217 if (parent
== NULL
) {
218 tmp
= rds_conn_lookup(head
, laddr
, faddr
, trans
);
220 hlist_add_head(&conn
->c_hash_node
, head
);
222 tmp
= parent
->c_passive
;
224 parent
->c_passive
= conn
;
228 trans
->conn_free(conn
->c_transport_data
);
229 kmem_cache_free(rds_conn_slab
, conn
);
232 rds_cong_add_conn(conn
);
236 spin_unlock_irqrestore(&rds_conn_lock
, flags
);
242 struct rds_connection
*rds_conn_create(__be32 laddr
, __be32 faddr
,
243 struct rds_transport
*trans
, gfp_t gfp
)
245 return __rds_conn_create(laddr
, faddr
, trans
, gfp
, 0);
248 struct rds_connection
*rds_conn_create_outgoing(__be32 laddr
, __be32 faddr
,
249 struct rds_transport
*trans
, gfp_t gfp
)
251 return __rds_conn_create(laddr
, faddr
, trans
, gfp
, 1);
254 void rds_conn_destroy(struct rds_connection
*conn
)
256 struct rds_message
*rm
, *rtmp
;
258 rdsdebug("freeing conn %p for %pI4 -> "
259 "%pI4\n", conn
, &conn
->c_laddr
,
262 hlist_del_init(&conn
->c_hash_node
);
264 /* wait for the rds thread to shut it down */
265 atomic_set(&conn
->c_state
, RDS_CONN_ERROR
);
266 cancel_delayed_work(&conn
->c_conn_w
);
267 queue_work(rds_wq
, &conn
->c_down_w
);
268 flush_workqueue(rds_wq
);
270 /* tear down queued messages */
271 list_for_each_entry_safe(rm
, rtmp
,
274 list_del_init(&rm
->m_conn_item
);
275 BUG_ON(!list_empty(&rm
->m_sock_item
));
279 rds_message_put(conn
->c_xmit_rm
);
281 conn
->c_trans
->conn_free(conn
->c_transport_data
);
284 * The congestion maps aren't freed up here. They're
285 * freed by rds_cong_exit() after all the connections
288 rds_cong_remove_conn(conn
);
290 BUG_ON(!list_empty(&conn
->c_retrans
));
291 kmem_cache_free(rds_conn_slab
, conn
);
296 static void rds_conn_message_info(struct socket
*sock
, unsigned int len
,
297 struct rds_info_iterator
*iter
,
298 struct rds_info_lengths
*lens
,
301 struct hlist_head
*head
;
302 struct hlist_node
*pos
;
303 struct list_head
*list
;
304 struct rds_connection
*conn
;
305 struct rds_message
*rm
;
307 unsigned int total
= 0;
310 len
/= sizeof(struct rds_info_message
);
312 spin_lock_irqsave(&rds_conn_lock
, flags
);
314 for (i
= 0, head
= rds_conn_hash
; i
< ARRAY_SIZE(rds_conn_hash
);
316 hlist_for_each_entry(conn
, pos
, head
, c_hash_node
) {
318 list
= &conn
->c_send_queue
;
320 list
= &conn
->c_retrans
;
322 spin_lock(&conn
->c_lock
);
324 /* XXX too lazy to maintain counts.. */
325 list_for_each_entry(rm
, list
, m_conn_item
) {
328 rds_inc_info_copy(&rm
->m_inc
, iter
,
333 spin_unlock(&conn
->c_lock
);
337 spin_unlock_irqrestore(&rds_conn_lock
, flags
);
340 lens
->each
= sizeof(struct rds_info_message
);
343 static void rds_conn_message_info_send(struct socket
*sock
, unsigned int len
,
344 struct rds_info_iterator
*iter
,
345 struct rds_info_lengths
*lens
)
347 rds_conn_message_info(sock
, len
, iter
, lens
, 1);
350 static void rds_conn_message_info_retrans(struct socket
*sock
,
352 struct rds_info_iterator
*iter
,
353 struct rds_info_lengths
*lens
)
355 rds_conn_message_info(sock
, len
, iter
, lens
, 0);
358 void rds_for_each_conn_info(struct socket
*sock
, unsigned int len
,
359 struct rds_info_iterator
*iter
,
360 struct rds_info_lengths
*lens
,
361 int (*visitor
)(struct rds_connection
*, void *),
364 uint64_t buffer
[(item_len
+ 7) / 8];
365 struct hlist_head
*head
;
366 struct hlist_node
*pos
;
367 struct hlist_node
*tmp
;
368 struct rds_connection
*conn
;
372 spin_lock_irqsave(&rds_conn_lock
, flags
);
375 lens
->each
= item_len
;
377 for (i
= 0, head
= rds_conn_hash
; i
< ARRAY_SIZE(rds_conn_hash
);
379 hlist_for_each_entry_safe(conn
, pos
, tmp
, head
, c_hash_node
) {
381 /* XXX no c_lock usage.. */
382 if (!visitor(conn
, buffer
))
385 /* We copy as much as we can fit in the buffer,
386 * but we count all items so that the caller
387 * can resize the buffer. */
388 if (len
>= item_len
) {
389 rds_info_copy(iter
, buffer
, item_len
);
396 spin_unlock_irqrestore(&rds_conn_lock
, flags
);
399 static int rds_conn_info_visitor(struct rds_connection
*conn
,
402 struct rds_info_connection
*cinfo
= buffer
;
404 cinfo
->next_tx_seq
= conn
->c_next_tx_seq
;
405 cinfo
->next_rx_seq
= conn
->c_next_rx_seq
;
406 cinfo
->laddr
= conn
->c_laddr
;
407 cinfo
->faddr
= conn
->c_faddr
;
408 strncpy(cinfo
->transport
, conn
->c_trans
->t_name
,
409 sizeof(cinfo
->transport
));
412 rds_conn_info_set(cinfo
->flags
,
413 rds_conn_is_sending(conn
), SENDING
);
414 /* XXX Future: return the state rather than these funky bits */
415 rds_conn_info_set(cinfo
->flags
,
416 atomic_read(&conn
->c_state
) == RDS_CONN_CONNECTING
,
418 rds_conn_info_set(cinfo
->flags
,
419 atomic_read(&conn
->c_state
) == RDS_CONN_UP
,
424 static void rds_conn_info(struct socket
*sock
, unsigned int len
,
425 struct rds_info_iterator
*iter
,
426 struct rds_info_lengths
*lens
)
428 rds_for_each_conn_info(sock
, len
, iter
, lens
,
429 rds_conn_info_visitor
,
430 sizeof(struct rds_info_connection
));
433 int __init
rds_conn_init(void)
435 rds_conn_slab
= kmem_cache_create("rds_connection",
436 sizeof(struct rds_connection
),
438 if (rds_conn_slab
== NULL
)
441 rds_info_register_func(RDS_INFO_CONNECTIONS
, rds_conn_info
);
442 rds_info_register_func(RDS_INFO_SEND_MESSAGES
,
443 rds_conn_message_info_send
);
444 rds_info_register_func(RDS_INFO_RETRANS_MESSAGES
,
445 rds_conn_message_info_retrans
);
450 void rds_conn_exit(void)
454 WARN_ON(!hlist_empty(rds_conn_hash
));
456 kmem_cache_destroy(rds_conn_slab
);
458 rds_info_deregister_func(RDS_INFO_CONNECTIONS
, rds_conn_info
);
459 rds_info_deregister_func(RDS_INFO_SEND_MESSAGES
,
460 rds_conn_message_info_send
);
461 rds_info_deregister_func(RDS_INFO_RETRANS_MESSAGES
,
462 rds_conn_message_info_retrans
);
468 void rds_conn_drop(struct rds_connection
*conn
)
470 atomic_set(&conn
->c_state
, RDS_CONN_ERROR
);
471 queue_work(rds_wq
, &conn
->c_down_w
);
475 * An error occurred on the connection
478 __rds_conn_error(struct rds_connection
*conn
, const char *fmt
, ...)