fs/afs/server_list.c

   1 // SPDX-License-Identifier: GPL-2.0-or-later
   2 /* AFS fileserver list management.
   3  *
   4  * Copyright (C) 2017 Red Hat, Inc. All Rights Reserved.
   5  * Written by David Howells (dhowells@redhat.com)
   6  */
   7
   8 #include <linux/kernel.h>
   9 #include <linux/slab.h>
  10 #include "internal.h"
  11
  12 void afs_put_serverlist(struct afs_net *net, struct afs_server_list *slist)
  13 {
  14         int i;
  15
  16         if (slist && refcount_dec_and_test(&slist->usage)) {
  17                 for (i = 0; i < slist->nr_servers; i++) {
  18                         afs_put_cb_interest(net, slist->servers[i].cb_interest);
  19                         afs_unuse_server(net, slist->servers[i].server,
  20                                          afs_server_trace_put_slist);
  21                 }
  22                 kfree(slist);
  23         }
  24 }
  25
  26 /*
  27  * Build a server list from a VLDB record.
  28  */
  29 struct afs_server_list *afs_alloc_server_list(struct afs_cell *cell,
  30                                               struct key *key,
  31                                               struct afs_vldb_entry *vldb,
  32                                               u8 type_mask)
  33 {
  34         struct afs_server_list *slist;
  35         struct afs_server *server;
  36         int ret = -ENOMEM, nr_servers = 0, i, j;
  37
  38         for (i = 0; i < vldb->nr_servers; i++)
  39                 if (vldb->fs_mask[i] & type_mask)
  40                         nr_servers++;
  41
  42         slist = kzalloc(struct_size(slist, servers, nr_servers), GFP_KERNEL);
  43         if (!slist)
  44                 goto error;
  45
  46         refcount_set(&slist->usage, 1);
  47         rwlock_init(&slist->lock);
  48
  49         for (i = 0; i < AFS_MAXTYPES; i++)
  50                 slist->vids[i] = vldb->vid[i];
  51
  52         /* Make sure a records exists for each server in the list. */
  53         for (i = 0; i < vldb->nr_servers; i++) {
  54                 if (!(vldb->fs_mask[i] & type_mask))
  55                         continue;
  56
  57                 server = afs_lookup_server(cell, key, &vldb->fs_server[i],
  58                                            vldb->addr_version[i]);
  59                 if (IS_ERR(server)) {
  60                         ret = PTR_ERR(server);
  61                         if (ret == -ENOENT ||
  62                             ret == -ENOMEDIUM)
  63                                 continue;
  64                         goto error_2;
  65                 }
  66
  67                 /* Insertion-sort by UUID */
  68                 for (j = 0; j < slist->nr_servers; j++)
  69                         if (memcmp(&slist->servers[j].server->uuid,
  70                                    &server->uuid,
  71                                    sizeof(server->uuid)) >= 0)
  72                                 break;
  73                 if (j < slist->nr_servers) {
  74                         if (slist->servers[j].server == server) {
  75                                 afs_put_server(cell->net, server,
  76                                                afs_server_trace_put_slist_isort);
  77                                 continue;
  78                         }
  79
  80                         memmove(slist->servers + j + 1,
  81                                 slist->servers + j,
  82                                 (slist->nr_servers - j) * sizeof(struct afs_server_entry));
  83                 }
  84
  85                 slist->servers[j].server = server;
  86                 slist->nr_servers++;
  87         }
  88
  89         if (slist->nr_servers == 0) {
  90                 ret = -EDESTADDRREQ;
  91                 goto error_2;
  92         }
  93
  94         return slist;
  95
  96 error_2:
  97         afs_put_serverlist(cell->net, slist);
  98 error:
  99         return ERR_PTR(ret);
 100 }
 101
 102 /*
 103  * Copy the annotations from an old server list to its potential replacement.
 104  */
 105 bool afs_annotate_server_list(struct afs_server_list *new,
 106                               struct afs_server_list *old)
 107 {
 108         struct afs_server *cur;
 109         int i, j;
 110
 111         if (old->nr_servers != new->nr_servers)
 112                 goto changed;
 113
 114         for (i = 0; i < old->nr_servers; i++)
 115                 if (old->servers[i].server != new->servers[i].server)
 116                         goto changed;
 117
 118         return false;
 119
 120 changed:
 121         /* Maintain the same preferred server as before if possible. */
 122         cur = old->servers[old->preferred].server;
 123         for (j = 0; j < new->nr_servers; j++) {
 124                 if (new->servers[j].server == cur) {
 125                         new->preferred = j;
 126                         break;
 127                 }
 128         }
 129
 130         /* Keep the old callback interest records where possible so that we
 131          * maintain callback interception.
 132          */
 133         i = 0;
 134         j = 0;
 135         while (i < old->nr_servers && j < new->nr_servers) {
 136                 if (new->servers[j].server == old->servers[i].server) {
 137                         struct afs_cb_interest *cbi = old->servers[i].cb_interest;
 138                         if (cbi) {
 139                                 new->servers[j].cb_interest = cbi;
 140                                 refcount_inc(&cbi->usage);
 141                         }
 142                         i++;
 143                         j++;
 144                         continue;
 145                 }
 146
 147                 if (new->servers[j].server < old->servers[i].server) {
 148                         j++;
 149                         continue;
 150                 }
 151
 152                 i++;
 153                 continue;
 154         }
 155
 156         return true;
 157 }