1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
4 * Copyright (c) 2002, 2003 Cluster File Systems, Inc.
6 * This file is part of Lustre, http://www.lustre.org.
8 * Lustre is free software; you can redistribute it and/or
9 * modify it under the terms of version 2 of the GNU General Public
10 * License as published by the Free Software Foundation.
12 * Lustre is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Lustre; if not, write to the Free Software
19 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
23 #define DEBUG_SUBSYSTEM S_RPC
26 # include <linux/module.h>
27 # include <linux/init.h>
28 # include <linux/list.h>
30 # include <liblustre.h>
32 #include <linux/obd.h>
33 #include <linux/obd_support.h>
34 #include <linux/obd_class.h>
35 #include <linux/lustre_lib.h>
36 #include <linux/lustre_ha.h>
37 #include <linux/lustre_net.h>
38 #include <linux/lprocfs_status.h>
40 struct uuid_nid_data {
41 struct list_head head;
48 /* FIXME: This should probably become more elegant than a global linked list */
49 static struct list_head g_uuid_list;
50 static spinlock_t g_uuid_lock;
52 void class_init_uuidlist(void)
54 INIT_LIST_HEAD(&g_uuid_list);
55 spin_lock_init(&g_uuid_lock);
58 void class_exit_uuidlist(void)
60 struct list_head *tmp, *n;
62 /* Module going => sole user => don't need to lock g_uuid_list */
63 list_for_each_safe(tmp, n, &g_uuid_list) {
64 struct uuid_nid_data *data =
65 list_entry(tmp, struct uuid_nid_data, head);
67 PORTAL_FREE(data->uuid, strlen(data->uuid) + 1);
68 PORTAL_FREE(data, sizeof(*data));
72 int lustre_uuid_to_peer(char *uuid, struct lustre_peer *peer)
74 struct list_head *tmp;
76 spin_lock (&g_uuid_lock);
78 list_for_each(tmp, &g_uuid_list) {
79 struct uuid_nid_data *data =
80 list_entry(tmp, struct uuid_nid_data, head);
82 if (strcmp(data->uuid, uuid) == 0) {
83 peer->peer_nid = data->nid;
84 peer->peer_ni = data->ni;
86 spin_unlock (&g_uuid_lock);
91 spin_unlock (&g_uuid_lock);
95 int class_add_uuid(char *uuid, __u64 nid, __u32 nal)
97 const ptl_handle_ni_t *nip;
98 struct uuid_nid_data *data;
100 int nob = strnlen (uuid, PAGE_SIZE) + 1;
105 nip = kportal_get_ni (nal);
107 CERROR("get_ni failed: is the NAL module loaded?\n");
112 PORTAL_ALLOC(data, sizeof(*data));
116 PORTAL_ALLOC(data->uuid, nob);
120 memcpy(data->uuid, uuid, nob);
125 spin_lock (&g_uuid_lock);
127 list_add(&data->head, &g_uuid_list);
129 spin_unlock (&g_uuid_lock);
134 PORTAL_FREE (data, sizeof (*data));
136 kportal_put_ni (nal);
140 /* delete only one entry if uuid is specified, otherwise delete all */
141 int class_del_uuid (char *uuid)
143 struct list_head deathrow;
144 struct list_head *tmp;
146 struct uuid_nid_data *data;
148 INIT_LIST_HEAD (&deathrow);
150 spin_lock (&g_uuid_lock);
152 list_for_each_safe(tmp, n, &g_uuid_list) {
153 data = list_entry(tmp, struct uuid_nid_data, head);
155 if (uuid == NULL || strcmp(data->uuid, uuid) == 0) {
156 list_del (&data->head);
157 list_add (&data->head, &deathrow);
163 spin_unlock (&g_uuid_lock);
165 if (list_empty (&deathrow))
169 data = list_entry(deathrow.next, struct uuid_nid_data, head);
171 list_del (&data->head);
173 kportal_put_ni (data->nal);
174 PORTAL_FREE(data->uuid, strlen(data->uuid) + 1);
175 PORTAL_FREE(data, sizeof(*data));
176 } while (!list_empty (&deathrow));