4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
32 #define DEBUG_SUBSYSTEM S_RPC
34 #include <linux/delay.h>
35 #include <libcfs/linux/linux-hash.h>
36 #include <obd_support.h>
37 #include <obd_class.h>
38 #include <lustre_net.h>
40 #include "ptlrpc_internal.h"
42 static struct rhashtable conn_hash;
45 * struct lnet_process_id may contain unassigned bytes which might not
46 * be zero, so we cannot just hash and compare bytes.
49 static u32 lnet_process_id_hash(const void *data, u32 len, u32 seed)
51 const struct lnet_process_id *lpi = data;
53 seed = cfs_hash_32(seed ^ lpi->pid, 32);
54 seed ^= cfs_hash_64(lpi->nid, 32);
58 static int lnet_process_id_cmp(struct rhashtable_compare_arg *arg,
61 const struct lnet_process_id *lpi = arg->key;
62 const struct ptlrpc_connection *con = obj;
64 if (lpi->nid == con->c_peer.nid &&
65 lpi->pid == con->c_peer.pid)
70 static const struct rhashtable_params conn_hash_params = {
71 .key_len = 1, /* actually variable-length */
72 .key_offset = offsetof(struct ptlrpc_connection, c_peer),
73 .head_offset = offsetof(struct ptlrpc_connection, c_hash),
74 .hashfn = lnet_process_id_hash,
75 .obj_cmpfn = lnet_process_id_cmp,
78 struct ptlrpc_connection *
79 ptlrpc_connection_get(struct lnet_process_id peer, lnet_nid_t self,
80 struct obd_uuid *uuid)
82 struct ptlrpc_connection *conn, *conn2;
85 peer.nid = LNetPrimaryNID(peer.nid);
86 conn = rhashtable_lookup_fast(&conn_hash, &peer, conn_hash_params);
88 ptlrpc_connection_addref(conn);
98 atomic_set(&conn->c_refcount, 1);
100 obd_str2uuid(&conn->c_remote_uuid, uuid->uuid);
103 * Add the newly created conn to the hash, on key collision we
104 * lost a racing addition and must destroy our newly allocated
105 * connection. The object which exists in the hash will be
106 * returned,otherwise NULL is returned on success.
109 conn2 = rhashtable_lookup_get_insert_fast(&conn_hash, &conn->c_hash,
112 /* insertion failed */
115 /* hash table could be resizing. */
116 if (PTR_ERR(conn2) == -ENOMEM ||
117 PTR_ERR(conn2) == -EBUSY) {
124 ptlrpc_connection_addref(conn);
128 CDEBUG(D_INFO, "conn=%p refcount %d to %s\n",
129 conn, atomic_read(&conn->c_refcount),
130 libcfs_nid2str(conn->c_peer.nid));
134 struct ptlrpc_connection *
135 ptlrpc_connection_addref(struct ptlrpc_connection *conn)
139 atomic_inc(&conn->c_refcount);
140 CDEBUG(D_INFO, "conn=%p refcount %d to %s\n",
141 conn, atomic_read(&conn->c_refcount),
142 libcfs_nid2str(conn->c_peer.nid));
148 conn_exit(void *vconn, void *data)
150 struct ptlrpc_connection *conn = vconn;
153 * Nothing should be left. Connection user put it and
154 * connection also was deleted from table by this time
155 * so we should have 0 refs.
157 LASSERTF(atomic_read(&conn->c_refcount) == 0,
158 "Busy connection with %d refs\n",
159 atomic_read(&conn->c_refcount));
163 int ptlrpc_connection_init(void)
165 return rhashtable_init(&conn_hash, &conn_hash_params);
168 void ptlrpc_connection_fini(void)
170 rhashtable_free_and_destroy(&conn_hash, conn_exit, NULL);