afs: Split the usage count on struct afs_server
[linux-2.6-microblaze.git] / 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         /* Make sure a records exists for each server in the list. */
50         for (i = 0; i < vldb->nr_servers; i++) {
51                 if (!(vldb->fs_mask[i] & type_mask))
52                         continue;
53
54                 server = afs_lookup_server(cell, key, &vldb->fs_server[i],
55                                            vldb->addr_version[i]);
56                 if (IS_ERR(server)) {
57                         ret = PTR_ERR(server);
58                         if (ret == -ENOENT ||
59                             ret == -ENOMEDIUM)
60                                 continue;
61                         goto error_2;
62                 }
63
64                 /* Insertion-sort by UUID */
65                 for (j = 0; j < slist->nr_servers; j++)
66                         if (memcmp(&slist->servers[j].server->uuid,
67                                    &server->uuid,
68                                    sizeof(server->uuid)) >= 0)
69                                 break;
70                 if (j < slist->nr_servers) {
71                         if (slist->servers[j].server == server) {
72                                 afs_put_server(cell->net, server,
73                                                afs_server_trace_put_slist_isort);
74                                 continue;
75                         }
76
77                         memmove(slist->servers + j + 1,
78                                 slist->servers + j,
79                                 (slist->nr_servers - j) * sizeof(struct afs_server_entry));
80                 }
81
82                 slist->servers[j].server = server;
83                 slist->nr_servers++;
84         }
85
86         if (slist->nr_servers == 0) {
87                 ret = -EDESTADDRREQ;
88                 goto error_2;
89         }
90
91         return slist;
92
93 error_2:
94         afs_put_serverlist(cell->net, slist);
95 error:
96         return ERR_PTR(ret);
97 }
98
99 /*
100  * Copy the annotations from an old server list to its potential replacement.
101  */
102 bool afs_annotate_server_list(struct afs_server_list *new,
103                               struct afs_server_list *old)
104 {
105         struct afs_server *cur;
106         int i, j;
107
108         if (old->nr_servers != new->nr_servers)
109                 goto changed;
110
111         for (i = 0; i < old->nr_servers; i++)
112                 if (old->servers[i].server != new->servers[i].server)
113                         goto changed;
114
115         return false;
116
117 changed:
118         /* Maintain the same preferred server as before if possible. */
119         cur = old->servers[old->preferred].server;
120         for (j = 0; j < new->nr_servers; j++) {
121                 if (new->servers[j].server == cur) {
122                         new->preferred = j;
123                         break;
124                 }
125         }
126
127         /* Keep the old callback interest records where possible so that we
128          * maintain callback interception.
129          */
130         i = 0;
131         j = 0;
132         while (i < old->nr_servers && j < new->nr_servers) {
133                 if (new->servers[j].server == old->servers[i].server) {
134                         struct afs_cb_interest *cbi = old->servers[i].cb_interest;
135                         if (cbi) {
136                                 new->servers[j].cb_interest = cbi;
137                                 refcount_inc(&cbi->usage);
138                         }
139                         i++;
140                         j++;
141                         continue;
142                 }
143
144                 if (new->servers[j].server < old->servers[i].server) {
145                         j++;
146                         continue;
147                 }
148
149                 i++;
150                 continue;
151         }
152
153         return true;
154 }