]>
Commit | Line | Data |
---|---|---|
00e0f34c AG |
1 | /* |
2 | * Copyright (c) 2006 Oracle. All rights reserved. | |
3 | * | |
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: | |
9 | * | |
10 | * Redistribution and use in source and binary forms, with or | |
11 | * without modification, are permitted provided that the following | |
12 | * conditions are met: | |
13 | * | |
14 | * - Redistributions of source code must retain the above | |
15 | * copyright notice, this list of conditions and the following | |
16 | * disclaimer. | |
17 | * | |
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. | |
22 | * | |
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 | |
30 | * SOFTWARE. | |
31 | * | |
32 | */ | |
33 | #include <linux/kernel.h> | |
34 | #include <linux/list.h> | |
5a0e3ad6 | 35 | #include <linux/slab.h> |
bc3b2d7f | 36 | #include <linux/export.h> |
00e0f34c AG |
37 | #include <net/inet_hashtables.h> |
38 | ||
0cb43965 | 39 | #include "rds_single_path.h" |
00e0f34c AG |
40 | #include "rds.h" |
41 | #include "loop.h" | |
00e0f34c AG |
42 | |
43 | #define RDS_CONNECTION_HASH_BITS 12 | |
44 | #define RDS_CONNECTION_HASH_ENTRIES (1 << RDS_CONNECTION_HASH_BITS) | |
45 | #define RDS_CONNECTION_HASH_MASK (RDS_CONNECTION_HASH_ENTRIES - 1) | |
46 | ||
47 | /* converting this to RCU is a chore for another day.. */ | |
48 | static DEFINE_SPINLOCK(rds_conn_lock); | |
49 | static unsigned long rds_conn_count; | |
50 | static struct hlist_head rds_conn_hash[RDS_CONNECTION_HASH_ENTRIES]; | |
51 | static struct kmem_cache *rds_conn_slab; | |
52 | ||
53 | static struct hlist_head *rds_conn_bucket(__be32 laddr, __be32 faddr) | |
54 | { | |
1bbdceef HFS |
55 | static u32 rds_hash_secret __read_mostly; |
56 | ||
57 | unsigned long hash; | |
58 | ||
59 | net_get_random_once(&rds_hash_secret, sizeof(rds_hash_secret)); | |
60 | ||
00e0f34c | 61 | /* Pass NULL, don't need struct net for hash */ |
1bbdceef HFS |
62 | hash = __inet_ehashfn(be32_to_cpu(laddr), 0, |
63 | be32_to_cpu(faddr), 0, | |
64 | rds_hash_secret); | |
00e0f34c AG |
65 | return &rds_conn_hash[hash & RDS_CONNECTION_HASH_MASK]; |
66 | } | |
67 | ||
68 | #define rds_conn_info_set(var, test, suffix) do { \ | |
69 | if (test) \ | |
70 | var |= RDS_INFO_CONNECTION_FLAG_##suffix; \ | |
71 | } while (0) | |
72 | ||
bcf50ef2 | 73 | /* rcu read lock must be held or the connection spinlock */ |
8f384c01 SV |
74 | static struct rds_connection *rds_conn_lookup(struct net *net, |
75 | struct hlist_head *head, | |
00e0f34c AG |
76 | __be32 laddr, __be32 faddr, |
77 | struct rds_transport *trans) | |
78 | { | |
79 | struct rds_connection *conn, *ret = NULL; | |
00e0f34c | 80 | |
b67bfe0d | 81 | hlist_for_each_entry_rcu(conn, head, c_hash_node) { |
00e0f34c | 82 | if (conn->c_faddr == faddr && conn->c_laddr == laddr && |
8f384c01 | 83 | conn->c_trans == trans && net == rds_conn_net(conn)) { |
00e0f34c AG |
84 | ret = conn; |
85 | break; | |
86 | } | |
87 | } | |
88 | rdsdebug("returning conn %p for %pI4 -> %pI4\n", ret, | |
89 | &laddr, &faddr); | |
90 | return ret; | |
91 | } | |
92 | ||
93 | /* | |
94 | * This is called by transports as they're bringing down a connection. | |
95 | * It clears partial message state so that the transport can start sending | |
96 | * and receiving over this connection again in the future. It is up to | |
97 | * the transport to have serialized this call with its send and recv. | |
98 | */ | |
ff51bf84 | 99 | static void rds_conn_reset(struct rds_connection *conn) |
00e0f34c AG |
100 | { |
101 | rdsdebug("connection %pI4 to %pI4 reset\n", | |
102 | &conn->c_laddr, &conn->c_faddr); | |
103 | ||
104 | rds_stats_inc(s_conn_reset); | |
105 | rds_send_reset(conn); | |
106 | conn->c_flags = 0; | |
107 | ||
108 | /* Do not clear next_rx_seq here, else we cannot distinguish | |
109 | * retransmitted packets from new packets, and will hand all | |
110 | * of them to the application. That is not consistent with the | |
111 | * reliability guarantees of RDS. */ | |
112 | } | |
113 | ||
114 | /* | |
115 | * There is only every one 'conn' for a given pair of addresses in the | |
116 | * system at a time. They contain messages to be retransmitted and so | |
117 | * span the lifetime of the actual underlying transport connections. | |
118 | * | |
119 | * For now they are not garbage collected once they're created. They | |
120 | * are torn down as the module is removed, if ever. | |
121 | */ | |
d5a8ac28 SV |
122 | static struct rds_connection *__rds_conn_create(struct net *net, |
123 | __be32 laddr, __be32 faddr, | |
00e0f34c AG |
124 | struct rds_transport *trans, gfp_t gfp, |
125 | int is_outgoing) | |
126 | { | |
cb24405e | 127 | struct rds_connection *conn, *parent = NULL; |
00e0f34c | 128 | struct hlist_head *head = rds_conn_bucket(laddr, faddr); |
5adb5bc6 | 129 | struct rds_transport *loop_trans; |
00e0f34c AG |
130 | unsigned long flags; |
131 | int ret; | |
132 | ||
bcf50ef2 | 133 | rcu_read_lock(); |
8f384c01 | 134 | conn = rds_conn_lookup(net, head, laddr, faddr, trans); |
f64f9e71 | 135 | if (conn && conn->c_loopback && conn->c_trans != &rds_loop_transport && |
1789b2c0 | 136 | laddr == faddr && !is_outgoing) { |
00e0f34c AG |
137 | /* This is a looped back IB connection, and we're |
138 | * called by the code handling the incoming connect. | |
139 | * We need a second connection object into which we | |
140 | * can stick the other QP. */ | |
141 | parent = conn; | |
142 | conn = parent->c_passive; | |
143 | } | |
bcf50ef2 | 144 | rcu_read_unlock(); |
00e0f34c AG |
145 | if (conn) |
146 | goto out; | |
147 | ||
05a178ec | 148 | conn = kmem_cache_zalloc(rds_conn_slab, gfp); |
8690bfa1 | 149 | if (!conn) { |
00e0f34c AG |
150 | conn = ERR_PTR(-ENOMEM); |
151 | goto out; | |
152 | } | |
153 | ||
00e0f34c | 154 | INIT_HLIST_NODE(&conn->c_hash_node); |
00e0f34c AG |
155 | conn->c_laddr = laddr; |
156 | conn->c_faddr = faddr; | |
157 | spin_lock_init(&conn->c_lock); | |
158 | conn->c_next_tx_seq = 1; | |
0cb43965 | 159 | conn->c_path[0].cp_conn = conn; |
d5a8ac28 | 160 | rds_conn_net_set(conn, net); |
00e0f34c | 161 | |
0f4b1c7e | 162 | init_waitqueue_head(&conn->c_waitq); |
00e0f34c AG |
163 | INIT_LIST_HEAD(&conn->c_send_queue); |
164 | INIT_LIST_HEAD(&conn->c_retrans); | |
165 | ||
166 | ret = rds_cong_get_maps(conn); | |
167 | if (ret) { | |
168 | kmem_cache_free(rds_conn_slab, conn); | |
169 | conn = ERR_PTR(ret); | |
170 | goto out; | |
171 | } | |
172 | ||
173 | /* | |
174 | * This is where a connection becomes loopback. If *any* RDS sockets | |
175 | * can bind to the destination address then we'd rather the messages | |
176 | * flow through loopback rather than either transport. | |
177 | */ | |
d5a8ac28 | 178 | loop_trans = rds_trans_get_preferred(net, faddr); |
5adb5bc6 ZB |
179 | if (loop_trans) { |
180 | rds_trans_put(loop_trans); | |
00e0f34c AG |
181 | conn->c_loopback = 1; |
182 | if (is_outgoing && trans->t_prefer_loopback) { | |
183 | /* "outgoing" connection - and the transport | |
184 | * says it wants the connection handled by the | |
185 | * loopback transport. This is what TCP does. | |
186 | */ | |
187 | trans = &rds_loop_transport; | |
188 | } | |
189 | } | |
190 | ||
191 | conn->c_trans = trans; | |
192 | ||
193 | ret = trans->conn_alloc(conn, gfp); | |
194 | if (ret) { | |
195 | kmem_cache_free(rds_conn_slab, conn); | |
196 | conn = ERR_PTR(ret); | |
197 | goto out; | |
198 | } | |
199 | ||
200 | atomic_set(&conn->c_state, RDS_CONN_DOWN); | |
443be0e5 | 201 | conn->c_send_gen = 0; |
0cb43965 | 202 | conn->c_path[0].cp_outgoing = (is_outgoing ? 1 : 0); |
00e0f34c AG |
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); | |
209 | conn->c_flags = 0; | |
210 | ||
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)" : ""); | |
215 | ||
cb24405e AG |
216 | /* |
217 | * Since we ran without holding the conn lock, someone could | |
218 | * have created the same conn (either normal or passive) in the | |
219 | * interim. We check while holding the lock. If we won, we complete | |
220 | * init and return our conn. If we lost, we rollback and return the | |
221 | * other one. | |
222 | */ | |
00e0f34c | 223 | spin_lock_irqsave(&rds_conn_lock, flags); |
cb24405e AG |
224 | if (parent) { |
225 | /* Creating passive conn */ | |
226 | if (parent->c_passive) { | |
227 | trans->conn_free(conn->c_transport_data); | |
228 | kmem_cache_free(rds_conn_slab, conn); | |
229 | conn = parent->c_passive; | |
230 | } else { | |
00e0f34c | 231 | parent->c_passive = conn; |
cb24405e AG |
232 | rds_cong_add_conn(conn); |
233 | rds_conn_count++; | |
234 | } | |
00e0f34c | 235 | } else { |
cb24405e AG |
236 | /* Creating normal conn */ |
237 | struct rds_connection *found; | |
238 | ||
3b20fc38 | 239 | found = rds_conn_lookup(net, head, laddr, faddr, trans); |
cb24405e AG |
240 | if (found) { |
241 | trans->conn_free(conn->c_transport_data); | |
242 | kmem_cache_free(rds_conn_slab, conn); | |
243 | conn = found; | |
244 | } else { | |
3b20fc38 | 245 | hlist_add_head_rcu(&conn->c_hash_node, head); |
cb24405e AG |
246 | rds_cong_add_conn(conn); |
247 | rds_conn_count++; | |
248 | } | |
00e0f34c | 249 | } |
00e0f34c AG |
250 | spin_unlock_irqrestore(&rds_conn_lock, flags); |
251 | ||
252 | out: | |
253 | return conn; | |
254 | } | |
255 | ||
d5a8ac28 SV |
256 | struct rds_connection *rds_conn_create(struct net *net, |
257 | __be32 laddr, __be32 faddr, | |
00e0f34c AG |
258 | struct rds_transport *trans, gfp_t gfp) |
259 | { | |
d5a8ac28 | 260 | return __rds_conn_create(net, laddr, faddr, trans, gfp, 0); |
00e0f34c | 261 | } |
616b757a | 262 | EXPORT_SYMBOL_GPL(rds_conn_create); |
00e0f34c | 263 | |
d5a8ac28 SV |
264 | struct rds_connection *rds_conn_create_outgoing(struct net *net, |
265 | __be32 laddr, __be32 faddr, | |
00e0f34c AG |
266 | struct rds_transport *trans, gfp_t gfp) |
267 | { | |
d5a8ac28 | 268 | return __rds_conn_create(net, laddr, faddr, trans, gfp, 1); |
00e0f34c | 269 | } |
616b757a | 270 | EXPORT_SYMBOL_GPL(rds_conn_create_outgoing); |
00e0f34c | 271 | |
2dc39357 AG |
272 | void rds_conn_shutdown(struct rds_connection *conn) |
273 | { | |
274 | /* shut it down unless it's down already */ | |
275 | if (!rds_conn_transition(conn, RDS_CONN_DOWN, RDS_CONN_DOWN)) { | |
276 | /* | |
277 | * Quiesce the connection mgmt handlers before we start tearing | |
278 | * things down. We don't hold the mutex for the entire | |
279 | * duration of the shutdown operation, else we may be | |
280 | * deadlocking with the CM handler. Instead, the CM event | |
281 | * handler is supposed to check for state DISCONNECTING | |
282 | */ | |
283 | mutex_lock(&conn->c_cm_lock); | |
284 | if (!rds_conn_transition(conn, RDS_CONN_UP, RDS_CONN_DISCONNECTING) | |
285 | && !rds_conn_transition(conn, RDS_CONN_ERROR, RDS_CONN_DISCONNECTING)) { | |
286 | rds_conn_error(conn, "shutdown called in state %d\n", | |
287 | atomic_read(&conn->c_state)); | |
288 | mutex_unlock(&conn->c_cm_lock); | |
289 | return; | |
290 | } | |
291 | mutex_unlock(&conn->c_cm_lock); | |
292 | ||
0f4b1c7e ZB |
293 | wait_event(conn->c_waitq, |
294 | !test_bit(RDS_IN_XMIT, &conn->c_flags)); | |
73ce4317 | 295 | wait_event(conn->c_waitq, |
296 | !test_bit(RDS_RECV_REFILL, &conn->c_flags)); | |
7e3f2952 | 297 | |
2dc39357 AG |
298 | conn->c_trans->conn_shutdown(conn); |
299 | rds_conn_reset(conn); | |
2dc39357 AG |
300 | |
301 | if (!rds_conn_transition(conn, RDS_CONN_DISCONNECTING, RDS_CONN_DOWN)) { | |
302 | /* This can happen - eg when we're in the middle of tearing | |
303 | * down the connection, and someone unloads the rds module. | |
304 | * Quite reproduceable with loopback connections. | |
305 | * Mostly harmless. | |
306 | */ | |
307 | rds_conn_error(conn, | |
308 | "%s: failed to transition to state DOWN, " | |
309 | "current state is %d\n", | |
310 | __func__, | |
311 | atomic_read(&conn->c_state)); | |
312 | return; | |
313 | } | |
314 | } | |
315 | ||
316 | /* Then reconnect if it's still live. | |
317 | * The passive side of an IB loopback connection is never added | |
318 | * to the conn hash, so we never trigger a reconnect on this | |
319 | * conn - the reconnect is always triggered by the active peer. */ | |
320 | cancel_delayed_work_sync(&conn->c_conn_w); | |
bcf50ef2 CM |
321 | rcu_read_lock(); |
322 | if (!hlist_unhashed(&conn->c_hash_node)) { | |
323 | rcu_read_unlock(); | |
3b20fc38 | 324 | if (conn->c_trans->t_type != RDS_TRANS_TCP || |
0cb43965 SV |
325 | conn->c_path[0].cp_outgoing == 1) |
326 | rds_queue_reconnect(&conn->c_path[0]); | |
bcf50ef2 CM |
327 | } else { |
328 | rcu_read_unlock(); | |
329 | } | |
2dc39357 AG |
330 | } |
331 | ||
332 | /* | |
333 | * Stop and free a connection. | |
ffcec0e1 ZB |
334 | * |
335 | * This can only be used in very limited circumstances. It assumes that once | |
336 | * the conn has been shutdown that no one else is referencing the connection. | |
337 | * We can only ensure this in the rmmod path in the current code. | |
2dc39357 | 338 | */ |
00e0f34c AG |
339 | void rds_conn_destroy(struct rds_connection *conn) |
340 | { | |
341 | struct rds_message *rm, *rtmp; | |
fe8ff6b5 | 342 | unsigned long flags; |
00e0f34c AG |
343 | |
344 | rdsdebug("freeing conn %p for %pI4 -> " | |
345 | "%pI4\n", conn, &conn->c_laddr, | |
346 | &conn->c_faddr); | |
347 | ||
abf45439 CM |
348 | /* Ensure conn will not be scheduled for reconnect */ |
349 | spin_lock_irq(&rds_conn_lock); | |
bcf50ef2 | 350 | hlist_del_init_rcu(&conn->c_hash_node); |
abf45439 | 351 | spin_unlock_irq(&rds_conn_lock); |
bcf50ef2 CM |
352 | synchronize_rcu(); |
353 | ||
ffcec0e1 ZB |
354 | /* shut the connection down */ |
355 | rds_conn_drop(conn); | |
356 | flush_work(&conn->c_down_w); | |
00e0f34c | 357 | |
4518071a ZB |
358 | /* make sure lingering queued work won't try to ref the conn */ |
359 | cancel_delayed_work_sync(&conn->c_send_w); | |
360 | cancel_delayed_work_sync(&conn->c_recv_w); | |
361 | ||
00e0f34c AG |
362 | /* tear down queued messages */ |
363 | list_for_each_entry_safe(rm, rtmp, | |
364 | &conn->c_send_queue, | |
365 | m_conn_item) { | |
366 | list_del_init(&rm->m_conn_item); | |
367 | BUG_ON(!list_empty(&rm->m_sock_item)); | |
368 | rds_message_put(rm); | |
369 | } | |
370 | if (conn->c_xmit_rm) | |
371 | rds_message_put(conn->c_xmit_rm); | |
372 | ||
373 | conn->c_trans->conn_free(conn->c_transport_data); | |
374 | ||
375 | /* | |
376 | * The congestion maps aren't freed up here. They're | |
377 | * freed by rds_cong_exit() after all the connections | |
378 | * have been freed. | |
379 | */ | |
380 | rds_cong_remove_conn(conn); | |
381 | ||
382 | BUG_ON(!list_empty(&conn->c_retrans)); | |
383 | kmem_cache_free(rds_conn_slab, conn); | |
384 | ||
fe8ff6b5 | 385 | spin_lock_irqsave(&rds_conn_lock, flags); |
00e0f34c | 386 | rds_conn_count--; |
fe8ff6b5 | 387 | spin_unlock_irqrestore(&rds_conn_lock, flags); |
00e0f34c | 388 | } |
616b757a | 389 | EXPORT_SYMBOL_GPL(rds_conn_destroy); |
00e0f34c AG |
390 | |
391 | static void rds_conn_message_info(struct socket *sock, unsigned int len, | |
392 | struct rds_info_iterator *iter, | |
393 | struct rds_info_lengths *lens, | |
394 | int want_send) | |
395 | { | |
396 | struct hlist_head *head; | |
00e0f34c AG |
397 | struct list_head *list; |
398 | struct rds_connection *conn; | |
399 | struct rds_message *rm; | |
00e0f34c | 400 | unsigned int total = 0; |
501dcccd | 401 | unsigned long flags; |
00e0f34c | 402 | size_t i; |
992c9ec5 | 403 | int j; |
00e0f34c AG |
404 | |
405 | len /= sizeof(struct rds_info_message); | |
406 | ||
bcf50ef2 | 407 | rcu_read_lock(); |
00e0f34c AG |
408 | |
409 | for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash); | |
410 | i++, head++) { | |
b67bfe0d | 411 | hlist_for_each_entry_rcu(conn, head, c_hash_node) { |
992c9ec5 SV |
412 | struct rds_conn_path *cp; |
413 | ||
414 | for (j = 0; j < RDS_MPATH_WORKERS; j++) { | |
415 | cp = &conn->c_path[j]; | |
416 | if (want_send) | |
417 | list = &cp->cp_send_queue; | |
418 | else | |
419 | list = &cp->cp_retrans; | |
420 | ||
421 | spin_lock_irqsave(&cp->cp_lock, flags); | |
422 | ||
423 | /* XXX too lazy to maintain counts.. */ | |
424 | list_for_each_entry(rm, list, m_conn_item) { | |
425 | total++; | |
426 | if (total <= len) | |
427 | rds_inc_info_copy(&rm->m_inc, | |
428 | iter, | |
429 | conn->c_laddr, | |
430 | conn->c_faddr, | |
431 | 0); | |
432 | } | |
433 | ||
434 | spin_unlock_irqrestore(&cp->cp_lock, flags); | |
435 | if (!conn->c_trans->t_mp_capable) | |
436 | break; | |
00e0f34c | 437 | } |
00e0f34c AG |
438 | } |
439 | } | |
bcf50ef2 | 440 | rcu_read_unlock(); |
00e0f34c AG |
441 | |
442 | lens->nr = total; | |
443 | lens->each = sizeof(struct rds_info_message); | |
444 | } | |
445 | ||
446 | static void rds_conn_message_info_send(struct socket *sock, unsigned int len, | |
447 | struct rds_info_iterator *iter, | |
448 | struct rds_info_lengths *lens) | |
449 | { | |
450 | rds_conn_message_info(sock, len, iter, lens, 1); | |
451 | } | |
452 | ||
453 | static void rds_conn_message_info_retrans(struct socket *sock, | |
454 | unsigned int len, | |
455 | struct rds_info_iterator *iter, | |
456 | struct rds_info_lengths *lens) | |
457 | { | |
458 | rds_conn_message_info(sock, len, iter, lens, 0); | |
459 | } | |
460 | ||
461 | void rds_for_each_conn_info(struct socket *sock, unsigned int len, | |
462 | struct rds_info_iterator *iter, | |
463 | struct rds_info_lengths *lens, | |
464 | int (*visitor)(struct rds_connection *, void *), | |
465 | size_t item_len) | |
466 | { | |
467 | uint64_t buffer[(item_len + 7) / 8]; | |
468 | struct hlist_head *head; | |
00e0f34c | 469 | struct rds_connection *conn; |
00e0f34c AG |
470 | size_t i; |
471 | ||
bcf50ef2 | 472 | rcu_read_lock(); |
00e0f34c AG |
473 | |
474 | lens->nr = 0; | |
475 | lens->each = item_len; | |
476 | ||
477 | for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash); | |
478 | i++, head++) { | |
b67bfe0d | 479 | hlist_for_each_entry_rcu(conn, head, c_hash_node) { |
00e0f34c AG |
480 | |
481 | /* XXX no c_lock usage.. */ | |
482 | if (!visitor(conn, buffer)) | |
483 | continue; | |
484 | ||
485 | /* We copy as much as we can fit in the buffer, | |
486 | * but we count all items so that the caller | |
487 | * can resize the buffer. */ | |
488 | if (len >= item_len) { | |
489 | rds_info_copy(iter, buffer, item_len); | |
490 | len -= item_len; | |
491 | } | |
492 | lens->nr++; | |
493 | } | |
494 | } | |
bcf50ef2 | 495 | rcu_read_unlock(); |
00e0f34c | 496 | } |
616b757a | 497 | EXPORT_SYMBOL_GPL(rds_for_each_conn_info); |
00e0f34c | 498 | |
992c9ec5 SV |
499 | void rds_walk_conn_path_info(struct socket *sock, unsigned int len, |
500 | struct rds_info_iterator *iter, | |
501 | struct rds_info_lengths *lens, | |
502 | int (*visitor)(struct rds_conn_path *, void *), | |
503 | size_t item_len) | |
504 | { | |
505 | u64 buffer[(item_len + 7) / 8]; | |
506 | struct hlist_head *head; | |
507 | struct rds_connection *conn; | |
508 | size_t i; | |
509 | int j; | |
510 | ||
511 | rcu_read_lock(); | |
512 | ||
513 | lens->nr = 0; | |
514 | lens->each = item_len; | |
515 | ||
516 | for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash); | |
517 | i++, head++) { | |
518 | hlist_for_each_entry_rcu(conn, head, c_hash_node) { | |
519 | struct rds_conn_path *cp; | |
520 | ||
521 | for (j = 0; j < RDS_MPATH_WORKERS; j++) { | |
522 | cp = &conn->c_path[j]; | |
523 | ||
524 | /* XXX no cp_lock usage.. */ | |
525 | if (!visitor(cp, buffer)) | |
526 | continue; | |
527 | if (!conn->c_trans->t_mp_capable) | |
528 | break; | |
529 | } | |
530 | ||
531 | /* We copy as much as we can fit in the buffer, | |
532 | * but we count all items so that the caller | |
533 | * can resize the buffer. | |
534 | */ | |
535 | if (len >= item_len) { | |
536 | rds_info_copy(iter, buffer, item_len); | |
537 | len -= item_len; | |
538 | } | |
539 | lens->nr++; | |
540 | } | |
541 | } | |
542 | rcu_read_unlock(); | |
543 | } | |
544 | ||
545 | static int rds_conn_info_visitor(struct rds_conn_path *cp, void *buffer) | |
00e0f34c AG |
546 | { |
547 | struct rds_info_connection *cinfo = buffer; | |
548 | ||
992c9ec5 SV |
549 | cinfo->next_tx_seq = cp->cp_next_tx_seq; |
550 | cinfo->next_rx_seq = cp->cp_next_rx_seq; | |
551 | cinfo->laddr = cp->cp_conn->c_laddr; | |
552 | cinfo->faddr = cp->cp_conn->c_faddr; | |
553 | strncpy(cinfo->transport, cp->cp_conn->c_trans->t_name, | |
00e0f34c AG |
554 | sizeof(cinfo->transport)); |
555 | cinfo->flags = 0; | |
556 | ||
992c9ec5 | 557 | rds_conn_info_set(cinfo->flags, test_bit(RDS_IN_XMIT, &cp->cp_flags), |
0f4b1c7e | 558 | SENDING); |
00e0f34c AG |
559 | /* XXX Future: return the state rather than these funky bits */ |
560 | rds_conn_info_set(cinfo->flags, | |
992c9ec5 | 561 | atomic_read(&cp->cp_state) == RDS_CONN_CONNECTING, |
00e0f34c AG |
562 | CONNECTING); |
563 | rds_conn_info_set(cinfo->flags, | |
992c9ec5 | 564 | atomic_read(&cp->cp_state) == RDS_CONN_UP, |
00e0f34c AG |
565 | CONNECTED); |
566 | return 1; | |
567 | } | |
568 | ||
569 | static void rds_conn_info(struct socket *sock, unsigned int len, | |
570 | struct rds_info_iterator *iter, | |
571 | struct rds_info_lengths *lens) | |
572 | { | |
992c9ec5 | 573 | rds_walk_conn_path_info(sock, len, iter, lens, |
00e0f34c AG |
574 | rds_conn_info_visitor, |
575 | sizeof(struct rds_info_connection)); | |
576 | } | |
577 | ||
ef87b7ea | 578 | int rds_conn_init(void) |
00e0f34c AG |
579 | { |
580 | rds_conn_slab = kmem_cache_create("rds_connection", | |
581 | sizeof(struct rds_connection), | |
582 | 0, 0, NULL); | |
8690bfa1 | 583 | if (!rds_conn_slab) |
00e0f34c AG |
584 | return -ENOMEM; |
585 | ||
586 | rds_info_register_func(RDS_INFO_CONNECTIONS, rds_conn_info); | |
587 | rds_info_register_func(RDS_INFO_SEND_MESSAGES, | |
588 | rds_conn_message_info_send); | |
589 | rds_info_register_func(RDS_INFO_RETRANS_MESSAGES, | |
590 | rds_conn_message_info_retrans); | |
591 | ||
592 | return 0; | |
593 | } | |
594 | ||
595 | void rds_conn_exit(void) | |
596 | { | |
597 | rds_loop_exit(); | |
598 | ||
599 | WARN_ON(!hlist_empty(rds_conn_hash)); | |
600 | ||
601 | kmem_cache_destroy(rds_conn_slab); | |
602 | ||
603 | rds_info_deregister_func(RDS_INFO_CONNECTIONS, rds_conn_info); | |
604 | rds_info_deregister_func(RDS_INFO_SEND_MESSAGES, | |
605 | rds_conn_message_info_send); | |
606 | rds_info_deregister_func(RDS_INFO_RETRANS_MESSAGES, | |
607 | rds_conn_message_info_retrans); | |
608 | } | |
609 | ||
610 | /* | |
611 | * Force a disconnect | |
612 | */ | |
0cb43965 SV |
613 | void rds_conn_path_drop(struct rds_conn_path *cp) |
614 | { | |
615 | atomic_set(&cp->cp_state, RDS_CONN_ERROR); | |
616 | queue_work(rds_wq, &cp->cp_down_w); | |
617 | } | |
618 | EXPORT_SYMBOL_GPL(rds_conn_path_drop); | |
619 | ||
00e0f34c AG |
620 | void rds_conn_drop(struct rds_connection *conn) |
621 | { | |
0cb43965 | 622 | rds_conn_path_drop(&conn->c_path[0]); |
00e0f34c | 623 | } |
616b757a | 624 | EXPORT_SYMBOL_GPL(rds_conn_drop); |
00e0f34c | 625 | |
f3c6808d ZB |
626 | /* |
627 | * If the connection is down, trigger a connect. We may have scheduled a | |
628 | * delayed reconnect however - in this case we should not interfere. | |
629 | */ | |
3c0a5900 SV |
630 | void rds_conn_path_connect_if_down(struct rds_conn_path *cp) |
631 | { | |
632 | if (rds_conn_path_state(cp) == RDS_CONN_DOWN && | |
633 | !test_and_set_bit(RDS_RECONNECT_PENDING, &cp->cp_flags)) | |
634 | queue_delayed_work(rds_wq, &cp->cp_conn_w, 0); | |
635 | } | |
636 | ||
f3c6808d ZB |
637 | void rds_conn_connect_if_down(struct rds_connection *conn) |
638 | { | |
3c0a5900 SV |
639 | WARN_ON(conn->c_trans->t_mp_capable); |
640 | rds_conn_path_connect_if_down(&conn->c_path[0]); | |
f3c6808d ZB |
641 | } |
642 | EXPORT_SYMBOL_GPL(rds_conn_connect_if_down); | |
643 | ||
00e0f34c AG |
644 | /* |
645 | * An error occurred on the connection | |
646 | */ | |
647 | void | |
648 | __rds_conn_error(struct rds_connection *conn, const char *fmt, ...) | |
649 | { | |
650 | va_list ap; | |
651 | ||
652 | va_start(ap, fmt); | |
653 | vprintk(fmt, ap); | |
654 | va_end(ap); | |
655 | ||
656 | rds_conn_drop(conn); | |
657 | } | |
fb1b3dc4 SV |
658 | |
659 | void | |
660 | __rds_conn_path_error(struct rds_conn_path *cp, const char *fmt, ...) | |
661 | { | |
662 | va_list ap; | |
663 | ||
664 | va_start(ap, fmt); | |
665 | vprintk(fmt, ap); | |
666 | va_end(ap); | |
667 | ||
668 | rds_conn_path_drop(cp); | |
669 | } |