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