loop.c 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  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/slab.h>
  35. #include <linux/in.h>
  36. #include "rds.h"
  37. #include "loop.h"
  38. static DEFINE_SPINLOCK(loop_conns_lock);
  39. static LIST_HEAD(loop_conns);
  40. /*
  41. * This 'loopback' transport is a special case for flows that originate
  42. * and terminate on the same machine.
  43. *
  44. * Connection build-up notices if the destination address is thought of
  45. * as a local address by a transport. At that time it decides to use the
  46. * loopback transport instead of the bound transport of the sending socket.
  47. *
  48. * The loopback transport's sending path just hands the sent rds_message
  49. * straight to the receiving path via an embedded rds_incoming.
  50. */
  51. /*
  52. * Usually a message transits both the sender and receiver's conns as it
  53. * flows to the receiver. In the loopback case, though, the receive path
  54. * is handed the sending conn so the sense of the addresses is reversed.
  55. */
  56. static int rds_loop_xmit(struct rds_connection *conn, struct rds_message *rm,
  57. unsigned int hdr_off, unsigned int sg,
  58. unsigned int off)
  59. {
  60. BUG_ON(hdr_off || sg || off);
  61. rds_inc_init(&rm->m_inc, conn, conn->c_laddr);
  62. /* For the embedded inc. Matching put is in loop_inc_free() */
  63. rds_message_addref(rm);
  64. rds_recv_incoming(conn, conn->c_laddr, conn->c_faddr, &rm->m_inc,
  65. GFP_KERNEL, KM_USER0);
  66. rds_send_drop_acked(conn, be64_to_cpu(rm->m_inc.i_hdr.h_sequence),
  67. NULL);
  68. rds_inc_put(&rm->m_inc);
  69. return sizeof(struct rds_header) + be32_to_cpu(rm->m_inc.i_hdr.h_len);
  70. }
  71. /*
  72. * See rds_loop_xmit(). Since our inc is embedded in the rm, we
  73. * make sure the rm lives at least until the inc is done.
  74. */
  75. static void rds_loop_inc_free(struct rds_incoming *inc)
  76. {
  77. struct rds_message *rm = container_of(inc, struct rds_message, m_inc);
  78. rds_message_put(rm);
  79. }
  80. static int rds_loop_xmit_cong_map(struct rds_connection *conn,
  81. struct rds_cong_map *map,
  82. unsigned long offset)
  83. {
  84. BUG_ON(offset);
  85. BUG_ON(map != conn->c_lcong);
  86. rds_cong_map_updated(conn->c_fcong, ~(u64) 0);
  87. return sizeof(struct rds_header) + RDS_CONG_MAP_BYTES;
  88. }
  89. /* we need to at least give the thread something to succeed */
  90. static int rds_loop_recv(struct rds_connection *conn)
  91. {
  92. return 0;
  93. }
  94. struct rds_loop_connection {
  95. struct list_head loop_node;
  96. struct rds_connection *conn;
  97. };
  98. /*
  99. * Even the loopback transport needs to keep track of its connections,
  100. * so it can call rds_conn_destroy() on them on exit. N.B. there are
  101. * 1+ loopback addresses (127.*.*.*) so it's not a bug to have
  102. * multiple loopback conns allocated, although rather useless.
  103. */
  104. static int rds_loop_conn_alloc(struct rds_connection *conn, gfp_t gfp)
  105. {
  106. struct rds_loop_connection *lc;
  107. unsigned long flags;
  108. lc = kzalloc(sizeof(struct rds_loop_connection), GFP_KERNEL);
  109. if (!lc)
  110. return -ENOMEM;
  111. INIT_LIST_HEAD(&lc->loop_node);
  112. lc->conn = conn;
  113. conn->c_transport_data = lc;
  114. spin_lock_irqsave(&loop_conns_lock, flags);
  115. list_add_tail(&lc->loop_node, &loop_conns);
  116. spin_unlock_irqrestore(&loop_conns_lock, flags);
  117. return 0;
  118. }
  119. static void rds_loop_conn_free(void *arg)
  120. {
  121. struct rds_loop_connection *lc = arg;
  122. rdsdebug("lc %p\n", lc);
  123. list_del(&lc->loop_node);
  124. kfree(lc);
  125. }
  126. static int rds_loop_conn_connect(struct rds_connection *conn)
  127. {
  128. rds_connect_complete(conn);
  129. return 0;
  130. }
  131. static void rds_loop_conn_shutdown(struct rds_connection *conn)
  132. {
  133. }
  134. void rds_loop_exit(void)
  135. {
  136. struct rds_loop_connection *lc, *_lc;
  137. LIST_HEAD(tmp_list);
  138. /* avoid calling conn_destroy with irqs off */
  139. spin_lock_irq(&loop_conns_lock);
  140. list_splice(&loop_conns, &tmp_list);
  141. INIT_LIST_HEAD(&loop_conns);
  142. spin_unlock_irq(&loop_conns_lock);
  143. list_for_each_entry_safe(lc, _lc, &tmp_list, loop_node) {
  144. WARN_ON(lc->conn->c_passive);
  145. rds_conn_destroy(lc->conn);
  146. }
  147. }
  148. /*
  149. * This is missing .xmit_* because loop doesn't go through generic
  150. * rds_send_xmit() and doesn't call rds_recv_incoming(). .listen_stop and
  151. * .laddr_check are missing because transport.c doesn't iterate over
  152. * rds_loop_transport.
  153. */
  154. struct rds_transport rds_loop_transport = {
  155. .xmit = rds_loop_xmit,
  156. .xmit_cong_map = rds_loop_xmit_cong_map,
  157. .recv = rds_loop_recv,
  158. .conn_alloc = rds_loop_conn_alloc,
  159. .conn_free = rds_loop_conn_free,
  160. .conn_connect = rds_loop_conn_connect,
  161. .conn_shutdown = rds_loop_conn_shutdown,
  162. .inc_copy_to_user = rds_message_inc_copy_to_user,
  163. .inc_free = rds_loop_inc_free,
  164. .t_name = "loopback",
  165. };