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;
47 /* FIXME: This should probably become more elegant than a global linked list */
48 static struct list_head g_uuid_list;
49 static spinlock_t g_uuid_lock;
51 void class_init_uuidlist(void)
53 INIT_LIST_HEAD(&g_uuid_list);
54 spin_lock_init(&g_uuid_lock);
57 void class_exit_uuidlist(void)
63 int lustre_uuid_to_peer(char *uuid, __u32 *peer_nal, ptl_nid_t *peer_nid)
65 struct list_head *tmp;
67 spin_lock (&g_uuid_lock);
69 list_for_each(tmp, &g_uuid_list) {
70 struct uuid_nid_data *data =
71 list_entry(tmp, struct uuid_nid_data, head);
73 if (strcmp(data->uuid, uuid) == 0) {
74 *peer_nid = data->nid;
75 *peer_nal = data->nal;
77 spin_unlock (&g_uuid_lock);
82 spin_unlock (&g_uuid_lock);
86 int class_add_uuid(char *uuid, __u64 nid, __u32 nal)
88 struct uuid_nid_data *data;
90 int nob = strnlen (uuid, PAGE_SIZE) + 1;
96 OBD_ALLOC(data, sizeof(*data));
100 OBD_ALLOC(data->uuid, nob);
102 OBD_FREE(data, sizeof(*data));
106 CDEBUG(D_INFO, "add uuid %s "LPX64" %x\n", uuid, nid, nal);
107 memcpy(data->uuid, uuid, nob);
111 spin_lock (&g_uuid_lock);
113 list_add(&data->head, &g_uuid_list);
115 spin_unlock (&g_uuid_lock);
120 /* delete only one entry if uuid is specified, otherwise delete all */
121 int class_del_uuid (char *uuid)
123 struct list_head deathrow;
124 struct list_head *tmp;
126 struct uuid_nid_data *data;
128 INIT_LIST_HEAD (&deathrow);
130 spin_lock (&g_uuid_lock);
132 list_for_each_safe(tmp, n, &g_uuid_list) {
133 data = list_entry(tmp, struct uuid_nid_data, head);
135 if (uuid == NULL || strcmp(data->uuid, uuid) == 0) {
136 list_del (&data->head);
137 list_add (&data->head, &deathrow);
143 spin_unlock (&g_uuid_lock);
145 if (list_empty (&deathrow)) {
147 CERROR("del non-existed uuid %s\n", uuid);
152 data = list_entry(deathrow.next, struct uuid_nid_data, head);
154 list_del (&data->head);
156 OBD_FREE(data->uuid, strlen(data->uuid) + 1);
157 OBD_FREE(data, sizeof(*data));
158 } while (!list_empty (&deathrow));