]> bbs.cooldavid.org Git - net-next-2.6.git/blame - fs/afs/server.c
[AFS]: Implement the CB.InitCallBackState3 operation.
[net-next-2.6.git] / fs / afs / server.c
CommitLineData
ec26815a 1/* AFS server record management
1da177e4 2 *
08e0e7c8 3 * Copyright (C) 2002, 2007 Red Hat, Inc. All Rights Reserved.
1da177e4
LT
4 * Written by David Howells (dhowells@redhat.com)
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 */
11
12#include <linux/sched.h>
13#include <linux/slab.h>
1da177e4
LT
14#include "internal.h"
15
08e0e7c8 16unsigned afs_server_timeout = 10; /* server timeout in seconds */
1da177e4 17
08e0e7c8 18static void afs_reap_server(struct work_struct *);
1da177e4 19
08e0e7c8
DH
20/* tree of all the servers, indexed by IP address */
21static struct rb_root afs_servers = RB_ROOT;
22static DEFINE_RWLOCK(afs_servers_lock);
23
24/* LRU list of all the servers not currently in use */
25static LIST_HEAD(afs_server_graveyard);
26static DEFINE_SPINLOCK(afs_server_graveyard_lock);
27static DECLARE_DELAYED_WORK(afs_server_reaper, afs_reap_server);
28
29/*
30 * install a server record in the master tree
31 */
32static int afs_install_server(struct afs_server *server)
1da177e4 33{
08e0e7c8
DH
34 struct afs_server *xserver;
35 struct rb_node **pp, *p;
36 int ret;
37
38 _enter("%p", server);
1da177e4 39
08e0e7c8
DH
40 write_lock(&afs_servers_lock);
41
42 ret = -EEXIST;
43 pp = &afs_servers.rb_node;
44 p = NULL;
45 while (*pp) {
46 p = *pp;
47 _debug("- consider %p", p);
48 xserver = rb_entry(p, struct afs_server, master_rb);
49 if (server->addr.s_addr < xserver->addr.s_addr)
50 pp = &(*pp)->rb_left;
51 else if (server->addr.s_addr > xserver->addr.s_addr)
52 pp = &(*pp)->rb_right;
53 else
54 goto error;
55 }
1da177e4 56
08e0e7c8
DH
57 rb_link_node(&server->master_rb, p, pp);
58 rb_insert_color(&server->master_rb, &afs_servers);
59 ret = 0;
1da177e4 60
08e0e7c8
DH
61error:
62 write_unlock(&afs_servers_lock);
63 return ret;
64}
1da177e4 65
1da177e4 66/*
08e0e7c8 67 * allocate a new server record
1da177e4 68 */
08e0e7c8
DH
69static struct afs_server *afs_alloc_server(struct afs_cell *cell,
70 const struct in_addr *addr)
1da177e4 71{
08e0e7c8 72 struct afs_server *server;
1da177e4 73
08e0e7c8 74 _enter("");
1da177e4 75
b593e48d 76 server = kzalloc(sizeof(struct afs_server), GFP_KERNEL);
08e0e7c8
DH
77 if (server) {
78 atomic_set(&server->usage, 1);
79 server->cell = cell;
80
81 INIT_LIST_HEAD(&server->link);
82 INIT_LIST_HEAD(&server->grave);
83 init_rwsem(&server->sem);
84 spin_lock_init(&server->fs_lock);
85 server->fs_vnodes = RB_ROOT;
86 server->cb_promises = RB_ROOT;
87 spin_lock_init(&server->cb_lock);
88 init_waitqueue_head(&server->cb_break_waitq);
89 INIT_DELAYED_WORK(&server->cb_break_work,
90 afs_dispatch_give_up_callbacks);
91
92 memcpy(&server->addr, addr, sizeof(struct in_addr));
93 server->addr.s_addr = addr->s_addr;
1da177e4
LT
94 }
95
08e0e7c8
DH
96 _leave(" = %p{%d}", server, atomic_read(&server->usage));
97 return server;
98}
1da177e4 99
08e0e7c8
DH
100/*
101 * get an FS-server record for a cell
102 */
103struct afs_server *afs_lookup_server(struct afs_cell *cell,
104 const struct in_addr *addr)
105{
106 struct afs_server *server, *candidate;
1da177e4 107
08e0e7c8 108 _enter("%p,"NIPQUAD_FMT, cell, NIPQUAD(addr->s_addr));
1da177e4 109
08e0e7c8
DH
110 /* quick scan of the list to see if we already have the server */
111 read_lock(&cell->servers_lock);
1da177e4 112
08e0e7c8
DH
113 list_for_each_entry(server, &cell->servers, link) {
114 if (server->addr.s_addr == addr->s_addr)
115 goto found_server_quickly;
1da177e4 116 }
08e0e7c8 117 read_unlock(&cell->servers_lock);
1da177e4 118
08e0e7c8
DH
119 candidate = afs_alloc_server(cell, addr);
120 if (!candidate) {
121 _leave(" = -ENOMEM");
122 return ERR_PTR(-ENOMEM);
1da177e4 123 }
1da177e4 124
08e0e7c8 125 write_lock(&cell->servers_lock);
1da177e4 126
08e0e7c8
DH
127 /* check the cell's server list again */
128 list_for_each_entry(server, &cell->servers, link) {
129 if (server->addr.s_addr == addr->s_addr)
130 goto found_server;
131 }
132
133 _debug("new");
134 server = candidate;
135 if (afs_install_server(server) < 0)
136 goto server_in_two_cells;
1da177e4 137
08e0e7c8
DH
138 afs_get_cell(cell);
139 list_add_tail(&server->link, &cell->servers);
140
141 write_unlock(&cell->servers_lock);
142 _leave(" = %p{%d}", server, atomic_read(&server->usage));
143 return server;
144
145 /* found a matching server quickly */
146found_server_quickly:
147 _debug("found quickly");
148 afs_get_server(server);
149 read_unlock(&cell->servers_lock);
150no_longer_unused:
151 if (!list_empty(&server->grave)) {
152 spin_lock(&afs_server_graveyard_lock);
153 list_del_init(&server->grave);
154 spin_unlock(&afs_server_graveyard_lock);
155 }
156 _leave(" = %p{%d}", server, atomic_read(&server->usage));
157 return server;
158
159 /* found a matching server on the second pass */
160found_server:
161 _debug("found");
162 afs_get_server(server);
163 write_unlock(&cell->servers_lock);
164 kfree(candidate);
165 goto no_longer_unused;
166
167 /* found a server that seems to be in two cells */
168server_in_two_cells:
169 write_unlock(&cell->servers_lock);
170 kfree(candidate);
171 printk(KERN_NOTICE "kAFS:"
172 " Server "NIPQUAD_FMT" appears to be in two cells\n",
173 NIPQUAD(*addr));
174 _leave(" = -EEXIST");
175 return ERR_PTR(-EEXIST);
176}
1da177e4 177
08e0e7c8
DH
178/*
179 * look up a server by its IP address
180 */
181struct afs_server *afs_find_server(const struct in_addr *_addr)
182{
183 struct afs_server *server = NULL;
184 struct rb_node *p;
185 struct in_addr addr = *_addr;
1da177e4 186
08e0e7c8 187 _enter(NIPQUAD_FMT, NIPQUAD(addr.s_addr));
1da177e4 188
08e0e7c8 189 read_lock(&afs_servers_lock);
1da177e4 190
08e0e7c8
DH
191 p = afs_servers.rb_node;
192 while (p) {
193 server = rb_entry(p, struct afs_server, master_rb);
1da177e4 194
08e0e7c8 195 _debug("- consider %p", p);
1da177e4 196
08e0e7c8
DH
197 if (addr.s_addr < server->addr.s_addr) {
198 p = p->rb_left;
199 } else if (addr.s_addr > server->addr.s_addr) {
200 p = p->rb_right;
201 } else {
202 afs_get_server(server);
203 goto found;
204 }
205 }
1da177e4 206
08e0e7c8
DH
207 server = NULL;
208found:
209 read_unlock(&afs_servers_lock);
210 ASSERTIFCMP(server, server->addr.s_addr, ==, addr.s_addr);
211 _leave(" = %p", server);
212 return server;
ec26815a 213}
1da177e4 214
1da177e4
LT
215/*
216 * destroy a server record
217 * - removes from the cell list
218 */
219void afs_put_server(struct afs_server *server)
220{
1da177e4
LT
221 if (!server)
222 return;
223
08e0e7c8 224 _enter("%p{%d}", server, atomic_read(&server->usage));
1da177e4 225
08e0e7c8 226 ASSERTCMP(atomic_read(&server->usage), >, 0);
1da177e4
LT
227
228 if (likely(!atomic_dec_and_test(&server->usage))) {
1da177e4
LT
229 _leave("");
230 return;
231 }
232
08e0e7c8 233 afs_flush_callback_breaks(server);
1da177e4 234
08e0e7c8
DH
235 spin_lock(&afs_server_graveyard_lock);
236 if (atomic_read(&server->usage) == 0) {
237 list_move_tail(&server->grave, &afs_server_graveyard);
238 server->time_of_death = get_seconds();
239 schedule_delayed_work(&afs_server_reaper,
240 afs_server_timeout * HZ);
241 }
242 spin_unlock(&afs_server_graveyard_lock);
243 _leave(" [dead]");
ec26815a 244}
1da177e4 245
1da177e4 246/*
08e0e7c8 247 * destroy a dead server
1da177e4 248 */
08e0e7c8 249static void afs_destroy_server(struct afs_server *server)
1da177e4 250{
1da177e4
LT
251 _enter("%p", server);
252
08e0e7c8
DH
253 ASSERTCMP(server->fs_vnodes.rb_node, ==, NULL);
254 ASSERTCMP(server->cb_promises.rb_node, ==, NULL);
255 ASSERTCMP(server->cb_break_head, ==, server->cb_break_tail);
256 ASSERTCMP(atomic_read(&server->cb_break_n), ==, 0);
1da177e4 257
08e0e7c8 258 afs_put_cell(server->cell);
1da177e4 259 kfree(server);
ec26815a 260}
1da177e4 261
1da177e4 262/*
08e0e7c8 263 * reap dead server records
1da177e4 264 */
08e0e7c8 265static void afs_reap_server(struct work_struct *work)
1da177e4 266{
08e0e7c8
DH
267 LIST_HEAD(corpses);
268 struct afs_server *server;
269 unsigned long delay, expiry;
270 time_t now;
271
272 now = get_seconds();
273 spin_lock(&afs_server_graveyard_lock);
274
275 while (!list_empty(&afs_server_graveyard)) {
276 server = list_entry(afs_server_graveyard.next,
277 struct afs_server, grave);
278
279 /* the queue is ordered most dead first */
280 expiry = server->time_of_death + afs_server_timeout;
281 if (expiry > now) {
282 delay = (expiry - now) * HZ;
283 if (!schedule_delayed_work(&afs_server_reaper, delay)) {
284 cancel_delayed_work(&afs_server_reaper);
285 schedule_delayed_work(&afs_server_reaper,
286 delay);
287 }
288 break;
1da177e4
LT
289 }
290
08e0e7c8
DH
291 write_lock(&server->cell->servers_lock);
292 write_lock(&afs_servers_lock);
293 if (atomic_read(&server->usage) > 0) {
294 list_del_init(&server->grave);
295 } else {
296 list_move_tail(&server->grave, &corpses);
297 list_del_init(&server->link);
298 rb_erase(&server->master_rb, &afs_servers);
1da177e4 299 }
08e0e7c8
DH
300 write_unlock(&afs_servers_lock);
301 write_unlock(&server->cell->servers_lock);
1da177e4
LT
302 }
303
08e0e7c8 304 spin_unlock(&afs_server_graveyard_lock);
1da177e4 305
08e0e7c8
DH
306 /* now reap the corpses we've extracted */
307 while (!list_empty(&corpses)) {
308 server = list_entry(corpses.next, struct afs_server, grave);
309 list_del(&server->grave);
310 afs_destroy_server(server);
1da177e4 311 }
ec26815a 312}
1da177e4 313
1da177e4 314/*
08e0e7c8 315 * discard all the server records for rmmod
1da177e4 316 */
08e0e7c8 317void __exit afs_purge_servers(void)
1da177e4 318{
08e0e7c8
DH
319 afs_server_timeout = 0;
320 cancel_delayed_work(&afs_server_reaper);
321 schedule_delayed_work(&afs_server_reaper, 0);
ec26815a 322}