1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
5 * Start up the internal library and clear all structures
6 * Called by the NAL when it initializes. Safe to call multiple times.
8 * Copyright (c) 2001-2003 Cluster File Systems, Inc.
9 * Copyright (c) 2001-2002 Sandia National Laboratories
11 * This file is part of Lustre, http://www.sf.net/projects/lustre/
13 * Lustre is free software; you can redistribute it and/or
14 * modify it under the terms of version 2 of the GNU General Public
15 * License as published by the Free Software Foundation.
17 * Lustre is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
22 * You should have received a copy of the GNU General Public License
23 * along with Lustre; if not, write to the Free Software
24 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
27 # define DEBUG_SUBSYSTEM S_PORTALS
28 #include <portals/lib-p30.h>
31 # include <linux/string.h> /* for memset() */
32 # include <linux/kp30.h>
33 # ifdef KERNEL_ADDR_CACHE
34 # include <compute/OS/addrCache/cache.h>
38 # include <sys/time.h>
41 #ifndef PTL_USE_LIB_FREELIST
44 kportal_descriptor_setup (nal_cb_t *nal)
50 kportal_descriptor_cleanup (nal_cb_t *nal)
56 lib_freelist_init (nal_cb_t *nal, lib_freelist_t *fl, int n, int size)
62 size += offsetof (lib_freeobj_t, fo_contents);
64 space = nal->cb_malloc (nal, n * size);
66 return (PTL_NO_SPACE);
68 INIT_LIST_HEAD (&fl->fl_list);
71 fl->fl_objsize = size;
75 memset (space, 0, size);
76 list_add ((struct list_head *)space, &fl->fl_list);
84 lib_freelist_fini (nal_cb_t *nal, lib_freelist_t *fl)
89 if (fl->fl_nobjs == 0)
93 for (el = fl->fl_list.next; el != &fl->fl_list; el = el->next)
96 LASSERT (count == fl->fl_nobjs);
98 nal->cb_free (nal, fl->fl_objs, fl->fl_nobjs * fl->fl_objsize);
99 memset (fl, 0, sizeof (fl));
103 kportal_descriptor_setup (nal_cb_t *nal)
105 /* NB on failure caller must still call kportal_descriptor_cleanup */
109 memset (&nal->ni.ni_free_mes, 0, sizeof (nal->ni.ni_free_mes));
110 memset (&nal->ni.ni_free_msgs, 0, sizeof (nal->ni.ni_free_msgs));
111 memset (&nal->ni.ni_free_mds, 0, sizeof (nal->ni.ni_free_mds));
112 memset (&nal->ni.ni_free_eqs, 0, sizeof (nal->ni.ni_free_eqs));
114 rc = lib_freelist_init (nal, &nal->ni.ni_free_mes,
115 MAX_MES, sizeof (lib_me_t));
119 rc = lib_freelist_init (nal, &nal->ni.ni_free_msgs,
120 MAX_MSGS, sizeof (lib_msg_t));
124 rc = lib_freelist_init (nal, &nal->ni.ni_free_mds,
125 MAX_MDS, sizeof (lib_md_t));
129 rc = lib_freelist_init (nal, &nal->ni.ni_free_eqs,
130 MAX_EQS, sizeof (lib_eq_t));
135 kportal_descriptor_cleanup (nal_cb_t *nal)
137 lib_freelist_fini (nal, &nal->ni.ni_free_mes);
138 lib_freelist_fini (nal, &nal->ni.ni_free_msgs);
139 lib_freelist_fini (nal, &nal->ni.ni_free_mds);
140 lib_freelist_fini (nal, &nal->ni.ni_free_eqs);
146 lib_create_interface_cookie (nal_cb_t *nal)
148 /* NB the interface cookie in wire handles guards against delayed
149 * replies and ACKs appearing valid in a new instance of the same
150 * interface. Initialisation time, even if it's only implemented
151 * to millisecond resolution is probably easily good enough. */
155 int rc = gettimeofday (&tv, NULL);
158 do_gettimeofday(&tv);
162 cookie += tv.tv_usec;
167 lib_setup_handle_hash (nal_cb_t *nal)
169 lib_ni_t *ni = &nal->ni;
172 /* Arbitrary choice of hash table size */
174 ni->ni_lh_hash_size = PAGE_SIZE / sizeof (struct list_head);
176 ni->ni_lh_hash_size = (MAX_MES + MAX_MDS + MAX_EQS)/4;
178 ni->ni_lh_hash_table =
179 (struct list_head *)nal->cb_malloc (nal, ni->ni_lh_hash_size
180 * sizeof (struct list_head));
181 if (ni->ni_lh_hash_table == NULL)
182 return (PTL_NO_SPACE);
184 for (i = 0; i < ni->ni_lh_hash_size; i++)
185 INIT_LIST_HEAD (&ni->ni_lh_hash_table[i]);
187 ni->ni_next_object_cookie = PTL_COOKIE_TYPES;
193 lib_cleanup_handle_hash (nal_cb_t *nal)
195 lib_ni_t *ni = &nal->ni;
197 if (ni->ni_lh_hash_table == NULL)
200 nal->cb_free (nal, ni->ni_lh_hash_table,
201 ni->ni_lh_hash_size * sizeof (struct list_head));
205 lib_lookup_cookie (nal_cb_t *nal, __u64 cookie, int type)
207 /* ALWAYS called with statelock held */
208 lib_ni_t *ni = &nal->ni;
209 struct list_head *list;
210 struct list_head *el;
213 if ((cookie & (PTL_COOKIE_TYPES - 1)) != type)
216 hash = ((unsigned int)cookie) % ni->ni_lh_hash_size;
217 list = &ni->ni_lh_hash_table[hash];
219 list_for_each (el, list) {
220 lib_handle_t *lh = list_entry (el, lib_handle_t, lh_hash_chain);
222 if (lh->lh_cookie == cookie)
230 lib_initialise_handle (nal_cb_t *nal, lib_handle_t *lh, int type)
232 /* ALWAYS called with statelock held */
233 lib_ni_t *ni = &nal->ni;
236 LASSERT (type >= 0 && type < PTL_COOKIE_TYPES);
237 lh->lh_cookie = ni->ni_next_object_cookie | type;
238 ni->ni_next_object_cookie += PTL_COOKIE_TYPES;
240 hash = ((unsigned int)lh->lh_cookie) % ni->ni_lh_hash_size;
241 list_add (&lh->lh_hash_chain, &ni->ni_lh_hash_table[hash]);
245 lib_invalidate_handle (nal_cb_t *nal, lib_handle_t *lh)
247 list_del (&lh->lh_hash_chain);
251 lib_init(nal_cb_t * nal, ptl_nid_t nid, ptl_pid_t pid, int gsize,
252 ptl_pt_index_t ptl_size, ptl_ac_index_t acl_size)
255 lib_ni_t *ni = &nal->ni;
259 /* NB serialised in PtlNIInit() */
261 if (ni->refcnt != 0) { /* already initialised */
266 lib_assert_wire_constants ();
269 * Allocate the portal table for this interface
270 * and all per-interface objects.
272 memset(&ni->counters, 0, sizeof(lib_counters_t));
274 rc = kportal_descriptor_setup (nal);
278 INIT_LIST_HEAD (&ni->ni_active_msgs);
279 INIT_LIST_HEAD (&ni->ni_active_mds);
280 INIT_LIST_HEAD (&ni->ni_active_eqs);
282 INIT_LIST_HEAD (&ni->ni_test_peers);
284 ni->ni_interface_cookie = lib_create_interface_cookie (nal);
285 ni->ni_next_object_cookie = 0;
286 rc = lib_setup_handle_hash (nal);
293 ni->num_nodes = gsize;
294 ni->tbl.size = ptl_size;
296 ni->tbl.tbl = nal->cb_malloc(nal, sizeof(struct list_head) * ptl_size);
297 if (ni->tbl.tbl == NULL) {
302 for (i = 0; i < ptl_size; i++)
303 INIT_LIST_HEAD(&(ni->tbl.tbl[i]));
305 ni->debug = PTL_DEBUG_NONE;
311 lib_cleanup_handle_hash (nal);
312 kportal_descriptor_cleanup (nal);
319 lib_fini(nal_cb_t * nal)
321 lib_ni_t *ni = &nal->ni;
329 /* NB no stat_lock() since this is the last reference. The NAL
330 * should have shut down already, so it should be safe to unlink
331 * and free all descriptors, even those that appear committed to a
332 * network op (eg MD with non-zero pending count)
335 for (idx = 0; idx < ni->tbl.size; idx++)
336 while (!list_empty (&ni->tbl.tbl[idx])) {
337 lib_me_t *me = list_entry (ni->tbl.tbl[idx].next,
340 CERROR ("Active me %p on exit\n", me);
341 list_del (&me->me_list);
342 lib_me_free (nal, me);
345 while (!list_empty (&ni->ni_active_mds)) {
346 lib_md_t *md = list_entry (ni->ni_active_mds.next,
349 CERROR ("Active md %p on exit\n", md);
350 list_del (&md->md_list);
351 lib_md_free (nal, md);
354 while (!list_empty (&ni->ni_active_eqs)) {
355 lib_eq_t *eq = list_entry (ni->ni_active_eqs.next,
358 CERROR ("Active eq %p on exit\n", eq);
359 list_del (&eq->eq_list);
360 lib_eq_free (nal, eq);
363 while (!list_empty (&ni->ni_active_msgs)) {
364 lib_msg_t *msg = list_entry (ni->ni_active_msgs.next,
365 lib_msg_t, msg_list);
367 CERROR ("Active msg %p on exit\n", msg);
368 list_del (&msg->msg_list);
369 lib_msg_free (nal, msg);
372 nal->cb_free(nal, ni->tbl.tbl, sizeof(struct list_head) * ni->tbl.size);
375 lib_cleanup_handle_hash (nal);
376 kportal_descriptor_cleanup (nal);