lustre/obdclass/lustre_peer.c

   1 /*
   2  * GPL HEADER START
   3  *
   4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   5  *
   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.
   9  *
  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).
  15  *
  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
  19  *
  20  * GPL HEADER END
  21  */
  22 /*
  23  * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
  24  * Use is subject to license terms.
  25  *
  26  * Copyright (c) 2011, 2017, Intel Corporation.
  27  */
  28 /*
  29  * This file is part of Lustre, http://www.lustre.org/
  30  */
  31
  32 #define DEBUG_SUBSYSTEM S_RPC
  33
  34 #include <obd.h>
  35 #include <obd_support.h>
  36 #include <obd_class.h>
  37 #include <lustre_lib.h>
  38 #include <lustre_ha.h>
  39 #include <lustre_net.h>
  40 #include <lprocfs_status.h>
  41
  42 struct uuid_nid_data {
  43         struct list_head        un_list;
  44         struct obd_uuid         un_uuid;
  45         int                     un_nid_count;
  46         lnet_nid_t              un_nids[MTI_NIDS_MAX];
  47 };
  48
  49 /* FIXME: This should probably become more elegant than a global linked list */
  50 static LIST_HEAD(g_uuid_list);
  51 static DEFINE_SPINLOCK(g_uuid_lock);
  52
  53 int lustre_uuid_to_peer(const char *uuid, lnet_nid_t *peer_nid, int index)
  54 {
  55         struct uuid_nid_data *data;
  56         struct obd_uuid tmp;
  57         int rc = -ENOENT;
  58
  59         obd_str2uuid(&tmp, uuid);
  60         spin_lock(&g_uuid_lock);
  61         list_for_each_entry(data, &g_uuid_list, un_list) {
  62                 if (obd_uuid_equals(&data->un_uuid, &tmp)) {
  63                         if (index >= data->un_nid_count)
  64                                 break;
  65
  66                         rc = 0;
  67                         *peer_nid = data->un_nids[index];
  68                         break;
  69                 }
  70         }
  71         spin_unlock(&g_uuid_lock);
  72         return rc;
  73 }
  74 EXPORT_SYMBOL(lustre_uuid_to_peer);
  75
  76 /* Add a nid to a niduuid.  Multiple nids can be added to a single uuid;
  77    LNET will choose the best one. */
  78 int class_add_uuid(const char *uuid, __u64 nid)
  79 {
  80         struct uuid_nid_data *data, *entry;
  81         int found = 0;
  82
  83         LASSERT(nid != 0);  /* valid newconfig NID is never zero */
  84
  85         if (strlen(uuid) > UUID_MAX - 1)
  86                 return -EOVERFLOW;
  87
  88         OBD_ALLOC_PTR(data);
  89         if (data == NULL)
  90                 return -ENOMEM;
  91
  92         obd_str2uuid(&data->un_uuid, uuid);
  93         data->un_nids[0] = nid;
  94         data->un_nid_count = 1;
  95
  96         spin_lock(&g_uuid_lock);
  97         list_for_each_entry(entry, &g_uuid_list, un_list) {
  98                 if (obd_uuid_equals(&entry->un_uuid, &data->un_uuid)) {
  99                         int i;
 100
 101                         found = 1;
 102                         for (i = 0; i < entry->un_nid_count; i++)
 103                                 if (nid == entry->un_nids[i])
 104                                         break;
 105
 106                         if (i == entry->un_nid_count) {
 107                                 LASSERT(entry->un_nid_count < MTI_NIDS_MAX);
 108                                 entry->un_nids[entry->un_nid_count++] = nid;
 109                         }
 110                         break;
 111                 }
 112         }
 113         if (!found)
 114                 list_add(&data->un_list, &g_uuid_list);
 115         spin_unlock(&g_uuid_lock);
 116
 117         if (found) {
 118                 CDEBUG(D_INFO, "found uuid %s %s cnt=%d\n", uuid,
 119                        libcfs_nid2str(nid), entry->un_nid_count);
 120                 OBD_FREE(data, sizeof(*data));
 121         } else {
 122                 CDEBUG(D_INFO, "add uuid %s %s\n", uuid, libcfs_nid2str(nid));
 123         }
 124         return 0;
 125 }
 126 EXPORT_SYMBOL(class_add_uuid);
 127
 128 /* Delete the nids for one uuid if specified, otherwise delete all */
 129 int class_del_uuid(const char *uuid)
 130 {
 131         struct uuid_nid_data *data;
 132         LIST_HEAD(deathrow);
 133
 134         spin_lock(&g_uuid_lock);
 135         if (uuid != NULL) {
 136                 struct obd_uuid tmp;
 137
 138                 obd_str2uuid(&tmp, uuid);
 139                 list_for_each_entry(data, &g_uuid_list, un_list) {
 140                         if (obd_uuid_equals(&data->un_uuid, &tmp)) {
 141                                 list_move(&data->un_list, &deathrow);
 142                                 break;
 143                         }
 144                 }
 145         } else
 146                 list_splice_init(&g_uuid_list, &deathrow);
 147         spin_unlock(&g_uuid_lock);
 148
 149         if (uuid != NULL && list_empty(&deathrow)) {
 150                 CDEBUG(D_INFO, "Try to delete a non-existent uuid %s\n", uuid);
 151                 return -EINVAL;
 152         }
 153
 154         while (!list_empty(&deathrow)) {
 155                 data = list_entry(deathrow.next, struct uuid_nid_data,
 156                                   un_list);
 157                 list_del(&data->un_list);
 158
 159                 CDEBUG(D_INFO, "del uuid %s %s/%d\n",
 160                        obd_uuid2str(&data->un_uuid),
 161                        libcfs_nid2str(data->un_nids[0]),
 162                        data->un_nid_count);
 163
 164                 OBD_FREE(data, sizeof(*data));
 165         }
 166         return 0;
 167 }
 168
 169 int class_add_nids_to_uuid(struct obd_uuid *uuid, lnet_nid_t *nids,
 170                            int nid_count)
 171 {
 172         struct uuid_nid_data *entry;
 173         int i;
 174
 175         ENTRY;
 176
 177         if (nid_count >= MTI_NIDS_MAX) {
 178                 CDEBUG(D_NET, "too many NIDs (%d) for UUID '%s'\n",
 179                         nid_count, obd_uuid2str(uuid));
 180                 return -ENOSPC;
 181         }
 182
 183         spin_lock(&g_uuid_lock);
 184         list_for_each_entry(entry, &g_uuid_list, un_list) {
 185                 CDEBUG(D_NET, "Comparing %s with %s\n",
 186                        obd_uuid2str(uuid), obd_uuid2str(&entry->un_uuid));
 187
 188                 if (!obd_uuid_equals(&entry->un_uuid, uuid))
 189                         continue;
 190                 CDEBUG(D_NET, "Updating UUID '%s'\n", obd_uuid2str(uuid));
 191                 for (i = 0; i < nid_count; i++)
 192                         entry->un_nids[i] = nids[i];
 193                 entry->un_nid_count = nid_count;
 194                 break;
 195         }
 196         spin_unlock(&g_uuid_lock);
 197         RETURN(0);
 198 }
 199 EXPORT_SYMBOL(class_add_nids_to_uuid);
 200
 201 /* check if @nid exists in nid list of @uuid */
 202 int class_check_uuid(struct obd_uuid *uuid, __u64 nid)
 203 {
 204         struct uuid_nid_data *entry;
 205         int found = 0;
 206
 207         ENTRY;
 208
 209         CDEBUG(D_INFO, "check if uuid %s has %s.\n",
 210                obd_uuid2str(uuid), libcfs_nid2str(nid));
 211
 212         spin_lock(&g_uuid_lock);
 213         list_for_each_entry(entry, &g_uuid_list, un_list) {
 214                 int i;
 215
 216                 if (!obd_uuid_equals(&entry->un_uuid, uuid))
 217                         continue;
 218
 219                 /* found the uuid, check if it has @nid */
 220                 for (i = 0; i < entry->un_nid_count; i++) {
 221                         if (entry->un_nids[i] == nid) {
 222                                 found = 1;
 223                                 break;
 224                         }
 225                 }
 226                 break;
 227         }
 228         spin_unlock(&g_uuid_lock);
 229         RETURN(found);
 230 }
 231 EXPORT_SYMBOL(class_check_uuid);