1*13796bf9SAndy Grover /* 2*13796bf9SAndy Grover * Copyright (c) 2006 Oracle. All rights reserved. 3*13796bf9SAndy Grover * 4*13796bf9SAndy Grover * This software is available to you under a choice of one of two 5*13796bf9SAndy Grover * licenses. You may choose to be licensed under the terms of the GNU 6*13796bf9SAndy Grover * General Public License (GPL) Version 2, available from the file 7*13796bf9SAndy Grover * COPYING in the main directory of this source tree, or the 8*13796bf9SAndy Grover * OpenIB.org BSD license below: 9*13796bf9SAndy Grover * 10*13796bf9SAndy Grover * Redistribution and use in source and binary forms, with or 11*13796bf9SAndy Grover * without modification, are permitted provided that the following 12*13796bf9SAndy Grover * conditions are met: 13*13796bf9SAndy Grover * 14*13796bf9SAndy Grover * - Redistributions of source code must retain the above 15*13796bf9SAndy Grover * copyright notice, this list of conditions and the following 16*13796bf9SAndy Grover * disclaimer. 17*13796bf9SAndy Grover * 18*13796bf9SAndy Grover * - Redistributions in binary form must reproduce the above 19*13796bf9SAndy Grover * copyright notice, this list of conditions and the following 20*13796bf9SAndy Grover * disclaimer in the documentation and/or other materials 21*13796bf9SAndy Grover * provided with the distribution. 22*13796bf9SAndy Grover * 23*13796bf9SAndy Grover * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 24*13796bf9SAndy Grover * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 25*13796bf9SAndy Grover * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 26*13796bf9SAndy Grover * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 27*13796bf9SAndy Grover * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 28*13796bf9SAndy Grover * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN 29*13796bf9SAndy Grover * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 30*13796bf9SAndy Grover * SOFTWARE. 31*13796bf9SAndy Grover * 32*13796bf9SAndy Grover */ 33*13796bf9SAndy Grover #include <linux/kernel.h> 34*13796bf9SAndy Grover #include <linux/in.h> 35*13796bf9SAndy Grover 36*13796bf9SAndy Grover #include "rds.h" 37*13796bf9SAndy Grover #include "loop.h" 38*13796bf9SAndy Grover 39*13796bf9SAndy Grover static DEFINE_SPINLOCK(loop_conns_lock); 40*13796bf9SAndy Grover static LIST_HEAD(loop_conns); 41*13796bf9SAndy Grover 42*13796bf9SAndy Grover /* 43*13796bf9SAndy Grover * This 'loopback' transport is a special case for flows that originate 44*13796bf9SAndy Grover * and terminate on the same machine. 45*13796bf9SAndy Grover * 46*13796bf9SAndy Grover * Connection build-up notices if the destination address is thought of 47*13796bf9SAndy Grover * as a local address by a transport. At that time it decides to use the 48*13796bf9SAndy Grover * loopback transport instead of the bound transport of the sending socket. 49*13796bf9SAndy Grover * 50*13796bf9SAndy Grover * The loopback transport's sending path just hands the sent rds_message 51*13796bf9SAndy Grover * straight to the receiving path via an embedded rds_incoming. 52*13796bf9SAndy Grover */ 53*13796bf9SAndy Grover 54*13796bf9SAndy Grover /* 55*13796bf9SAndy Grover * Usually a message transits both the sender and receiver's conns as it 56*13796bf9SAndy Grover * flows to the receiver. In the loopback case, though, the receive path 57*13796bf9SAndy Grover * is handed the sending conn so the sense of the addresses is reversed. 58*13796bf9SAndy Grover */ 59*13796bf9SAndy Grover static int rds_loop_xmit(struct rds_connection *conn, struct rds_message *rm, 60*13796bf9SAndy Grover unsigned int hdr_off, unsigned int sg, 61*13796bf9SAndy Grover unsigned int off) 62*13796bf9SAndy Grover { 63*13796bf9SAndy Grover BUG_ON(hdr_off || sg || off); 64*13796bf9SAndy Grover 65*13796bf9SAndy Grover rds_inc_init(&rm->m_inc, conn, conn->c_laddr); 66*13796bf9SAndy Grover rds_message_addref(rm); /* for the inc */ 67*13796bf9SAndy Grover 68*13796bf9SAndy Grover rds_recv_incoming(conn, conn->c_laddr, conn->c_faddr, &rm->m_inc, 69*13796bf9SAndy Grover GFP_KERNEL, KM_USER0); 70*13796bf9SAndy Grover 71*13796bf9SAndy Grover rds_send_drop_acked(conn, be64_to_cpu(rm->m_inc.i_hdr.h_sequence), 72*13796bf9SAndy Grover NULL); 73*13796bf9SAndy Grover 74*13796bf9SAndy Grover rds_inc_put(&rm->m_inc); 75*13796bf9SAndy Grover 76*13796bf9SAndy Grover return sizeof(struct rds_header) + be32_to_cpu(rm->m_inc.i_hdr.h_len); 77*13796bf9SAndy Grover } 78*13796bf9SAndy Grover 79*13796bf9SAndy Grover static int rds_loop_xmit_cong_map(struct rds_connection *conn, 80*13796bf9SAndy Grover struct rds_cong_map *map, 81*13796bf9SAndy Grover unsigned long offset) 82*13796bf9SAndy Grover { 83*13796bf9SAndy Grover unsigned long i; 84*13796bf9SAndy Grover 85*13796bf9SAndy Grover BUG_ON(offset); 86*13796bf9SAndy Grover BUG_ON(map != conn->c_lcong); 87*13796bf9SAndy Grover 88*13796bf9SAndy Grover for (i = 0; i < RDS_CONG_MAP_PAGES; i++) { 89*13796bf9SAndy Grover memcpy((void *)conn->c_fcong->m_page_addrs[i], 90*13796bf9SAndy Grover (void *)map->m_page_addrs[i], PAGE_SIZE); 91*13796bf9SAndy Grover } 92*13796bf9SAndy Grover 93*13796bf9SAndy Grover rds_cong_map_updated(conn->c_fcong, ~(u64) 0); 94*13796bf9SAndy Grover 95*13796bf9SAndy Grover return sizeof(struct rds_header) + RDS_CONG_MAP_BYTES; 96*13796bf9SAndy Grover } 97*13796bf9SAndy Grover 98*13796bf9SAndy Grover /* we need to at least give the thread something to succeed */ 99*13796bf9SAndy Grover static int rds_loop_recv(struct rds_connection *conn) 100*13796bf9SAndy Grover { 101*13796bf9SAndy Grover return 0; 102*13796bf9SAndy Grover } 103*13796bf9SAndy Grover 104*13796bf9SAndy Grover struct rds_loop_connection { 105*13796bf9SAndy Grover struct list_head loop_node; 106*13796bf9SAndy Grover struct rds_connection *conn; 107*13796bf9SAndy Grover }; 108*13796bf9SAndy Grover 109*13796bf9SAndy Grover /* 110*13796bf9SAndy Grover * Even the loopback transport needs to keep track of its connections, 111*13796bf9SAndy Grover * so it can call rds_conn_destroy() on them on exit. N.B. there are 112*13796bf9SAndy Grover * 1+ loopback addresses (127.*.*.*) so it's not a bug to have 113*13796bf9SAndy Grover * multiple loopback conns allocated, although rather useless. 114*13796bf9SAndy Grover */ 115*13796bf9SAndy Grover static int rds_loop_conn_alloc(struct rds_connection *conn, gfp_t gfp) 116*13796bf9SAndy Grover { 117*13796bf9SAndy Grover struct rds_loop_connection *lc; 118*13796bf9SAndy Grover unsigned long flags; 119*13796bf9SAndy Grover 120*13796bf9SAndy Grover lc = kzalloc(sizeof(struct rds_loop_connection), GFP_KERNEL); 121*13796bf9SAndy Grover if (lc == NULL) 122*13796bf9SAndy Grover return -ENOMEM; 123*13796bf9SAndy Grover 124*13796bf9SAndy Grover INIT_LIST_HEAD(&lc->loop_node); 125*13796bf9SAndy Grover lc->conn = conn; 126*13796bf9SAndy Grover conn->c_transport_data = lc; 127*13796bf9SAndy Grover 128*13796bf9SAndy Grover spin_lock_irqsave(&loop_conns_lock, flags); 129*13796bf9SAndy Grover list_add_tail(&lc->loop_node, &loop_conns); 130*13796bf9SAndy Grover spin_unlock_irqrestore(&loop_conns_lock, flags); 131*13796bf9SAndy Grover 132*13796bf9SAndy Grover return 0; 133*13796bf9SAndy Grover } 134*13796bf9SAndy Grover 135*13796bf9SAndy Grover static void rds_loop_conn_free(void *arg) 136*13796bf9SAndy Grover { 137*13796bf9SAndy Grover struct rds_loop_connection *lc = arg; 138*13796bf9SAndy Grover rdsdebug("lc %p\n", lc); 139*13796bf9SAndy Grover list_del(&lc->loop_node); 140*13796bf9SAndy Grover kfree(lc); 141*13796bf9SAndy Grover } 142*13796bf9SAndy Grover 143*13796bf9SAndy Grover static int rds_loop_conn_connect(struct rds_connection *conn) 144*13796bf9SAndy Grover { 145*13796bf9SAndy Grover rds_connect_complete(conn); 146*13796bf9SAndy Grover return 0; 147*13796bf9SAndy Grover } 148*13796bf9SAndy Grover 149*13796bf9SAndy Grover static void rds_loop_conn_shutdown(struct rds_connection *conn) 150*13796bf9SAndy Grover { 151*13796bf9SAndy Grover } 152*13796bf9SAndy Grover 153*13796bf9SAndy Grover void rds_loop_exit(void) 154*13796bf9SAndy Grover { 155*13796bf9SAndy Grover struct rds_loop_connection *lc, *_lc; 156*13796bf9SAndy Grover LIST_HEAD(tmp_list); 157*13796bf9SAndy Grover 158*13796bf9SAndy Grover /* avoid calling conn_destroy with irqs off */ 159*13796bf9SAndy Grover spin_lock_irq(&loop_conns_lock); 160*13796bf9SAndy Grover list_splice(&loop_conns, &tmp_list); 161*13796bf9SAndy Grover INIT_LIST_HEAD(&loop_conns); 162*13796bf9SAndy Grover spin_unlock_irq(&loop_conns_lock); 163*13796bf9SAndy Grover 164*13796bf9SAndy Grover list_for_each_entry_safe(lc, _lc, &tmp_list, loop_node) { 165*13796bf9SAndy Grover WARN_ON(lc->conn->c_passive); 166*13796bf9SAndy Grover rds_conn_destroy(lc->conn); 167*13796bf9SAndy Grover } 168*13796bf9SAndy Grover } 169*13796bf9SAndy Grover 170*13796bf9SAndy Grover /* 171*13796bf9SAndy Grover * This is missing .xmit_* because loop doesn't go through generic 172*13796bf9SAndy Grover * rds_send_xmit() and doesn't call rds_recv_incoming(). .listen_stop and 173*13796bf9SAndy Grover * .laddr_check are missing because transport.c doesn't iterate over 174*13796bf9SAndy Grover * rds_loop_transport. 175*13796bf9SAndy Grover */ 176*13796bf9SAndy Grover struct rds_transport rds_loop_transport = { 177*13796bf9SAndy Grover .xmit = rds_loop_xmit, 178*13796bf9SAndy Grover .xmit_cong_map = rds_loop_xmit_cong_map, 179*13796bf9SAndy Grover .recv = rds_loop_recv, 180*13796bf9SAndy Grover .conn_alloc = rds_loop_conn_alloc, 181*13796bf9SAndy Grover .conn_free = rds_loop_conn_free, 182*13796bf9SAndy Grover .conn_connect = rds_loop_conn_connect, 183*13796bf9SAndy Grover .conn_shutdown = rds_loop_conn_shutdown, 184*13796bf9SAndy Grover .inc_copy_to_user = rds_message_inc_copy_to_user, 185*13796bf9SAndy Grover .inc_purge = rds_message_inc_purge, 186*13796bf9SAndy Grover .inc_free = rds_message_inc_free, 187*13796bf9SAndy Grover .t_name = "loopback", 188*13796bf9SAndy Grover }; 189