xref: /linux-6.15/fs/afs/server.c (revision ca0e79a4)
1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* AFS server record management
3  *
4  * Copyright (C) 2002, 2007 Red Hat, Inc. All Rights Reserved.
5  * Written by David Howells ([email protected])
6  */
7 
8 #include <linux/sched.h>
9 #include <linux/slab.h>
10 #include "afs_fs.h"
11 #include "internal.h"
12 #include "protocol_yfs.h"
13 
14 static unsigned afs_server_gc_delay = 10;	/* Server record timeout in seconds */
15 static atomic_t afs_server_debug_id;
16 
17 static struct afs_server *afs_maybe_use_server(struct afs_server *,
18 					       enum afs_server_trace);
19 static void __afs_put_server(struct afs_net *, struct afs_server *);
20 
21 /*
22  * Find a server by one of its addresses.
23  */
24 struct afs_server *afs_find_server(struct afs_net *net, const struct rxrpc_peer *peer)
25 {
26 	const struct afs_endpoint_state *estate;
27 	const struct afs_addr_list *alist;
28 	struct afs_server *server = NULL;
29 	unsigned int i;
30 	int seq = 1;
31 
32 	rcu_read_lock();
33 
34 	do {
35 		if (server)
36 			afs_unuse_server_notime(net, server, afs_server_trace_put_find_rsq);
37 		server = NULL;
38 		seq++; /* 2 on the 1st/lockless path, otherwise odd */
39 		read_seqbegin_or_lock(&net->fs_addr_lock, &seq);
40 
41 		hlist_for_each_entry_rcu(server, &net->fs_addresses6, addr6_link) {
42 			estate = rcu_dereference(server->endpoint_state);
43 			alist = estate->addresses;
44 			for (i = 0; i < alist->nr_addrs; i++)
45 				if (alist->addrs[i].peer == peer)
46 					goto found;
47 		}
48 
49 		server = NULL;
50 		continue;
51 	found:
52 		server = afs_maybe_use_server(server, afs_server_trace_get_by_addr);
53 
54 	} while (need_seqretry(&net->fs_addr_lock, seq));
55 
56 	done_seqretry(&net->fs_addr_lock, seq);
57 
58 	rcu_read_unlock();
59 	return server;
60 }
61 
62 /*
63  * Look up a server by its UUID and mark it active.
64  */
65 struct afs_server *afs_find_server_by_uuid(struct afs_net *net, const uuid_t *uuid)
66 {
67 	struct afs_server *server = NULL;
68 	struct rb_node *p;
69 	int diff, seq = 1;
70 
71 	_enter("%pU", uuid);
72 
73 	do {
74 		/* Unfortunately, rbtree walking doesn't give reliable results
75 		 * under just the RCU read lock, so we have to check for
76 		 * changes.
77 		 */
78 		if (server)
79 			afs_unuse_server(net, server, afs_server_trace_put_uuid_rsq);
80 		server = NULL;
81 		seq++; /* 2 on the 1st/lockless path, otherwise odd */
82 		read_seqbegin_or_lock(&net->fs_lock, &seq);
83 
84 		p = net->fs_servers.rb_node;
85 		while (p) {
86 			server = rb_entry(p, struct afs_server, uuid_rb);
87 
88 			diff = memcmp(uuid, &server->uuid, sizeof(*uuid));
89 			if (diff < 0) {
90 				p = p->rb_left;
91 			} else if (diff > 0) {
92 				p = p->rb_right;
93 			} else {
94 				afs_use_server(server, afs_server_trace_get_by_uuid);
95 				break;
96 			}
97 
98 			server = NULL;
99 		}
100 	} while (need_seqretry(&net->fs_lock, seq));
101 
102 	done_seqretry(&net->fs_lock, seq);
103 
104 	_leave(" = %p", server);
105 	return server;
106 }
107 
108 /*
109  * Install a server record in the namespace tree.  If there's a clash, we stick
110  * it into a list anchored on whichever afs_server struct is actually in the
111  * tree.
112  */
113 static struct afs_server *afs_install_server(struct afs_cell *cell,
114 					     struct afs_server *candidate)
115 {
116 	const struct afs_endpoint_state *estate;
117 	const struct afs_addr_list *alist;
118 	struct afs_server *server, *next;
119 	struct afs_net *net = cell->net;
120 	struct rb_node **pp, *p;
121 	int diff;
122 
123 	_enter("%p", candidate);
124 
125 	write_seqlock(&net->fs_lock);
126 
127 	/* Firstly install the server in the UUID lookup tree */
128 	pp = &net->fs_servers.rb_node;
129 	p = NULL;
130 	while (*pp) {
131 		p = *pp;
132 		_debug("- consider %p", p);
133 		server = rb_entry(p, struct afs_server, uuid_rb);
134 		diff = memcmp(&candidate->uuid, &server->uuid, sizeof(uuid_t));
135 		if (diff < 0) {
136 			pp = &(*pp)->rb_left;
137 		} else if (diff > 0) {
138 			pp = &(*pp)->rb_right;
139 		} else {
140 			if (server->cell == cell)
141 				goto exists;
142 
143 			/* We have the same UUID representing servers in
144 			 * different cells.  Append the new server to the list.
145 			 */
146 			for (;;) {
147 				next = rcu_dereference_protected(
148 					server->uuid_next,
149 					lockdep_is_held(&net->fs_lock.lock));
150 				if (!next)
151 					break;
152 				server = next;
153 			}
154 			rcu_assign_pointer(server->uuid_next, candidate);
155 			candidate->uuid_prev = server;
156 			server = candidate;
157 			goto added_dup;
158 		}
159 	}
160 
161 	server = candidate;
162 	rb_link_node(&server->uuid_rb, p, pp);
163 	rb_insert_color(&server->uuid_rb, &net->fs_servers);
164 	hlist_add_head_rcu(&server->proc_link, &net->fs_proc);
165 
166 added_dup:
167 	write_seqlock(&net->fs_addr_lock);
168 	estate = rcu_dereference_protected(server->endpoint_state,
169 					   lockdep_is_held(&net->fs_addr_lock.lock));
170 	alist = estate->addresses;
171 
172 	/* Secondly, if the server has any IPv4 and/or IPv6 addresses, install
173 	 * it in the IPv4 and/or IPv6 reverse-map lists.
174 	 *
175 	 * TODO: For speed we want to use something other than a flat list
176 	 * here; even sorting the list in terms of lowest address would help a
177 	 * bit, but anything we might want to do gets messy and memory
178 	 * intensive.
179 	 */
180 	if (alist->nr_ipv4 > 0)
181 		hlist_add_head_rcu(&server->addr4_link, &net->fs_addresses4);
182 	if (alist->nr_addrs > alist->nr_ipv4)
183 		hlist_add_head_rcu(&server->addr6_link, &net->fs_addresses6);
184 
185 	write_sequnlock(&net->fs_addr_lock);
186 
187 exists:
188 	afs_get_server(server, afs_server_trace_get_install);
189 	write_sequnlock(&net->fs_lock);
190 	return server;
191 }
192 
193 /*
194  * Allocate a new server record and mark it active.
195  */
196 static struct afs_server *afs_alloc_server(struct afs_cell *cell,
197 					   const uuid_t *uuid,
198 					   struct afs_addr_list *alist)
199 {
200 	struct afs_endpoint_state *estate;
201 	struct afs_server *server;
202 	struct afs_net *net = cell->net;
203 
204 	_enter("");
205 
206 	server = kzalloc(sizeof(struct afs_server), GFP_KERNEL);
207 	if (!server)
208 		goto enomem;
209 
210 	estate = kzalloc(sizeof(struct afs_endpoint_state), GFP_KERNEL);
211 	if (!estate)
212 		goto enomem_server;
213 
214 	refcount_set(&server->ref, 1);
215 	atomic_set(&server->active, 1);
216 	server->debug_id = atomic_inc_return(&afs_server_debug_id);
217 	server->addr_version = alist->version;
218 	server->uuid = *uuid;
219 	rwlock_init(&server->fs_lock);
220 	INIT_LIST_HEAD(&server->volumes);
221 	INIT_WORK(&server->initcb_work, afs_server_init_callback_work);
222 	init_waitqueue_head(&server->probe_wq);
223 	INIT_LIST_HEAD(&server->probe_link);
224 	spin_lock_init(&server->probe_lock);
225 	server->cell = cell;
226 	server->rtt = UINT_MAX;
227 	server->service_id = FS_SERVICE;
228 
229 	server->probe_counter = 1;
230 	server->probed_at = jiffies - LONG_MAX / 2;
231 	refcount_set(&estate->ref, 1);
232 	estate->addresses = alist;
233 	estate->server_id = server->debug_id;
234 	estate->probe_seq = 1;
235 	rcu_assign_pointer(server->endpoint_state, estate);
236 
237 	afs_inc_servers_outstanding(net);
238 	trace_afs_server(server->debug_id, 1, 1, afs_server_trace_alloc);
239 	trace_afs_estate(estate->server_id, estate->probe_seq, refcount_read(&estate->ref),
240 			 afs_estate_trace_alloc_server);
241 	_leave(" = %p", server);
242 	return server;
243 
244 enomem_server:
245 	kfree(server);
246 enomem:
247 	_leave(" = NULL [nomem]");
248 	return NULL;
249 }
250 
251 /*
252  * Look up an address record for a server
253  */
254 static struct afs_addr_list *afs_vl_lookup_addrs(struct afs_cell *cell,
255 						 struct key *key, const uuid_t *uuid)
256 {
257 	struct afs_vl_cursor vc;
258 	struct afs_addr_list *alist = NULL;
259 	int ret;
260 
261 	ret = -ERESTARTSYS;
262 	if (afs_begin_vlserver_operation(&vc, cell, key)) {
263 		while (afs_select_vlserver(&vc)) {
264 			if (test_bit(AFS_VLSERVER_FL_IS_YFS, &vc.server->flags))
265 				alist = afs_yfsvl_get_endpoints(&vc, uuid);
266 			else
267 				alist = afs_vl_get_addrs_u(&vc, uuid);
268 		}
269 
270 		ret = afs_end_vlserver_operation(&vc);
271 	}
272 
273 	return ret < 0 ? ERR_PTR(ret) : alist;
274 }
275 
276 /*
277  * Get or create a fileserver record.
278  */
279 struct afs_server *afs_lookup_server(struct afs_cell *cell, struct key *key,
280 				     const uuid_t *uuid, u32 addr_version)
281 {
282 	struct afs_addr_list *alist;
283 	struct afs_server *server, *candidate;
284 
285 	_enter("%p,%pU", cell->net, uuid);
286 
287 	server = afs_find_server_by_uuid(cell->net, uuid);
288 	if (server) {
289 		if (server->addr_version != addr_version)
290 			set_bit(AFS_SERVER_FL_NEEDS_UPDATE, &server->flags);
291 		return server;
292 	}
293 
294 	alist = afs_vl_lookup_addrs(cell, key, uuid);
295 	if (IS_ERR(alist))
296 		return ERR_CAST(alist);
297 
298 	candidate = afs_alloc_server(cell, uuid, alist);
299 	if (!candidate) {
300 		afs_put_addrlist(alist, afs_alist_trace_put_server_oom);
301 		return ERR_PTR(-ENOMEM);
302 	}
303 
304 	server = afs_install_server(cell, candidate);
305 	if (server != candidate) {
306 		afs_put_addrlist(alist, afs_alist_trace_put_server_dup);
307 		kfree(candidate);
308 	} else {
309 		/* Immediately dispatch an asynchronous probe to each interface
310 		 * on the fileserver.  This will make sure the repeat-probing
311 		 * service is started.
312 		 */
313 		afs_fs_probe_fileserver(cell->net, server, alist, key);
314 	}
315 
316 	return server;
317 }
318 
319 /*
320  * Set the server timer to fire after a given delay, assuming it's not already
321  * set for an earlier time.
322  */
323 static void afs_set_server_timer(struct afs_net *net, time64_t delay)
324 {
325 	if (net->live) {
326 		afs_inc_servers_outstanding(net);
327 		if (timer_reduce(&net->fs_timer, jiffies + delay * HZ))
328 			afs_dec_servers_outstanding(net);
329 	}
330 }
331 
332 /*
333  * Server management timer.  We have an increment on fs_outstanding that we
334  * need to pass along to the work item.
335  */
336 void afs_servers_timer(struct timer_list *timer)
337 {
338 	struct afs_net *net = container_of(timer, struct afs_net, fs_timer);
339 
340 	_enter("");
341 	if (!queue_work(afs_wq, &net->fs_manager))
342 		afs_dec_servers_outstanding(net);
343 }
344 
345 /*
346  * Get a reference on a server object.
347  */
348 struct afs_server *afs_get_server(struct afs_server *server,
349 				  enum afs_server_trace reason)
350 {
351 	unsigned int a;
352 	int r;
353 
354 	__refcount_inc(&server->ref, &r);
355 	a = atomic_read(&server->active);
356 	trace_afs_server(server->debug_id, r + 1, a, reason);
357 	return server;
358 }
359 
360 /*
361  * Try to get a reference on a server object.
362  */
363 static struct afs_server *afs_maybe_use_server(struct afs_server *server,
364 					       enum afs_server_trace reason)
365 {
366 	unsigned int a;
367 	int r;
368 
369 	if (!__refcount_inc_not_zero(&server->ref, &r))
370 		return NULL;
371 
372 	a = atomic_inc_return(&server->active);
373 	trace_afs_server(server->debug_id, r + 1, a, reason);
374 	return server;
375 }
376 
377 /*
378  * Get an active count on a server object.
379  */
380 struct afs_server *afs_use_server(struct afs_server *server, enum afs_server_trace reason)
381 {
382 	unsigned int a;
383 	int r;
384 
385 	__refcount_inc(&server->ref, &r);
386 	a = atomic_inc_return(&server->active);
387 
388 	trace_afs_server(server->debug_id, r + 1, a, reason);
389 	return server;
390 }
391 
392 /*
393  * Release a reference on a server record.
394  */
395 void afs_put_server(struct afs_net *net, struct afs_server *server,
396 		    enum afs_server_trace reason)
397 {
398 	unsigned int a, debug_id = server->debug_id;
399 	bool zero;
400 	int r;
401 
402 	if (!server)
403 		return;
404 
405 	a = atomic_read(&server->active);
406 	zero = __refcount_dec_and_test(&server->ref, &r);
407 	trace_afs_server(debug_id, r - 1, a, reason);
408 	if (unlikely(zero))
409 		__afs_put_server(net, server);
410 }
411 
412 /*
413  * Drop an active count on a server object without updating the last-unused
414  * time.
415  */
416 void afs_unuse_server_notime(struct afs_net *net, struct afs_server *server,
417 			     enum afs_server_trace reason)
418 {
419 	if (server) {
420 		unsigned int active = atomic_dec_return(&server->active);
421 
422 		if (active == 0)
423 			afs_set_server_timer(net, afs_server_gc_delay);
424 		afs_put_server(net, server, reason);
425 	}
426 }
427 
428 /*
429  * Drop an active count on a server object.
430  */
431 void afs_unuse_server(struct afs_net *net, struct afs_server *server,
432 		      enum afs_server_trace reason)
433 {
434 	if (server) {
435 		server->unuse_time = ktime_get_real_seconds();
436 		afs_unuse_server_notime(net, server, reason);
437 	}
438 }
439 
440 static void afs_server_rcu(struct rcu_head *rcu)
441 {
442 	struct afs_server *server = container_of(rcu, struct afs_server, rcu);
443 
444 	trace_afs_server(server->debug_id, refcount_read(&server->ref),
445 			 atomic_read(&server->active), afs_server_trace_free);
446 	afs_put_endpoint_state(rcu_access_pointer(server->endpoint_state),
447 			       afs_estate_trace_put_server);
448 	kfree(server);
449 }
450 
451 static void __afs_put_server(struct afs_net *net, struct afs_server *server)
452 {
453 	call_rcu(&server->rcu, afs_server_rcu);
454 	afs_dec_servers_outstanding(net);
455 }
456 
457 static void afs_give_up_callbacks(struct afs_net *net, struct afs_server *server)
458 {
459 	struct afs_endpoint_state *estate = rcu_access_pointer(server->endpoint_state);
460 	struct afs_addr_list *alist = estate->addresses;
461 
462 	afs_fs_give_up_all_callbacks(net, server, &alist->addrs[alist->preferred], NULL);
463 }
464 
465 /*
466  * destroy a dead server
467  */
468 static void afs_destroy_server(struct afs_net *net, struct afs_server *server)
469 {
470 	if (test_bit(AFS_SERVER_FL_MAY_HAVE_CB, &server->flags))
471 		afs_give_up_callbacks(net, server);
472 
473 	flush_work(&server->initcb_work);
474 	afs_put_server(net, server, afs_server_trace_destroy);
475 }
476 
477 /*
478  * Garbage collect any expired servers.
479  */
480 static void afs_gc_servers(struct afs_net *net, struct afs_server *gc_list)
481 {
482 	struct afs_server *server, *next, *prev;
483 	int active;
484 
485 	while ((server = gc_list)) {
486 		gc_list = server->gc_next;
487 
488 		write_seqlock(&net->fs_lock);
489 
490 		active = atomic_read(&server->active);
491 		if (active == 0) {
492 			trace_afs_server(server->debug_id, refcount_read(&server->ref),
493 					 active, afs_server_trace_gc);
494 			next = rcu_dereference_protected(
495 				server->uuid_next, lockdep_is_held(&net->fs_lock.lock));
496 			prev = server->uuid_prev;
497 			if (!prev) {
498 				/* The one at the front is in the tree */
499 				if (!next) {
500 					rb_erase(&server->uuid_rb, &net->fs_servers);
501 				} else {
502 					rb_replace_node_rcu(&server->uuid_rb,
503 							    &next->uuid_rb,
504 							    &net->fs_servers);
505 					next->uuid_prev = NULL;
506 				}
507 			} else {
508 				/* This server is not at the front */
509 				rcu_assign_pointer(prev->uuid_next, next);
510 				if (next)
511 					next->uuid_prev = prev;
512 			}
513 
514 			list_del(&server->probe_link);
515 			hlist_del_rcu(&server->proc_link);
516 			if (!hlist_unhashed(&server->addr4_link))
517 				hlist_del_rcu(&server->addr4_link);
518 			if (!hlist_unhashed(&server->addr6_link))
519 				hlist_del_rcu(&server->addr6_link);
520 		}
521 		write_sequnlock(&net->fs_lock);
522 
523 		if (active == 0)
524 			afs_destroy_server(net, server);
525 	}
526 }
527 
528 /*
529  * Manage the records of servers known to be within a network namespace.  This
530  * includes garbage collecting unused servers.
531  *
532  * Note also that we were given an increment on net->servers_outstanding by
533  * whoever queued us that we need to deal with before returning.
534  */
535 void afs_manage_servers(struct work_struct *work)
536 {
537 	struct afs_net *net = container_of(work, struct afs_net, fs_manager);
538 	struct afs_server *gc_list = NULL;
539 	struct rb_node *cursor;
540 	time64_t now = ktime_get_real_seconds(), next_manage = TIME64_MAX;
541 	bool purging = !net->live;
542 
543 	_enter("");
544 
545 	/* Trawl the server list looking for servers that have expired from
546 	 * lack of use.
547 	 */
548 	read_seqlock_excl(&net->fs_lock);
549 
550 	for (cursor = rb_first(&net->fs_servers); cursor; cursor = rb_next(cursor)) {
551 		struct afs_server *server =
552 			rb_entry(cursor, struct afs_server, uuid_rb);
553 		int active = atomic_read(&server->active);
554 
555 		_debug("manage %pU %u", &server->uuid, active);
556 
557 		if (purging) {
558 			trace_afs_server(server->debug_id, refcount_read(&server->ref),
559 					 active, afs_server_trace_purging);
560 			if (active != 0)
561 				pr_notice("Can't purge s=%08x\n", server->debug_id);
562 		}
563 
564 		if (active == 0) {
565 			time64_t expire_at = server->unuse_time;
566 
567 			if (!test_bit(AFS_SERVER_FL_VL_FAIL, &server->flags) &&
568 			    !test_bit(AFS_SERVER_FL_NOT_FOUND, &server->flags))
569 				expire_at += afs_server_gc_delay;
570 			if (purging || expire_at <= now) {
571 				server->gc_next = gc_list;
572 				gc_list = server;
573 			} else if (expire_at < next_manage) {
574 				next_manage = expire_at;
575 			}
576 		}
577 	}
578 
579 	read_sequnlock_excl(&net->fs_lock);
580 
581 	/* Update the timer on the way out.  We have to pass an increment on
582 	 * servers_outstanding in the namespace that we are in to the timer or
583 	 * the work scheduler.
584 	 */
585 	if (!purging && next_manage < TIME64_MAX) {
586 		now = ktime_get_real_seconds();
587 
588 		if (next_manage - now <= 0) {
589 			if (queue_work(afs_wq, &net->fs_manager))
590 				afs_inc_servers_outstanding(net);
591 		} else {
592 			afs_set_server_timer(net, next_manage - now);
593 		}
594 	}
595 
596 	afs_gc_servers(net, gc_list);
597 
598 	afs_dec_servers_outstanding(net);
599 	_leave(" [%d]", atomic_read(&net->servers_outstanding));
600 }
601 
602 static void afs_queue_server_manager(struct afs_net *net)
603 {
604 	afs_inc_servers_outstanding(net);
605 	if (!queue_work(afs_wq, &net->fs_manager))
606 		afs_dec_servers_outstanding(net);
607 }
608 
609 /*
610  * Purge list of servers.
611  */
612 void afs_purge_servers(struct afs_net *net)
613 {
614 	_enter("");
615 
616 	if (del_timer_sync(&net->fs_timer))
617 		afs_dec_servers_outstanding(net);
618 
619 	afs_queue_server_manager(net);
620 
621 	_debug("wait");
622 	atomic_dec(&net->servers_outstanding);
623 	wait_var_event(&net->servers_outstanding,
624 		       !atomic_read(&net->servers_outstanding));
625 	_leave("");
626 }
627 
628 /*
629  * Get an update for a server's address list.
630  */
631 static noinline bool afs_update_server_record(struct afs_operation *op,
632 					      struct afs_server *server,
633 					      struct key *key)
634 {
635 	struct afs_endpoint_state *estate;
636 	struct afs_addr_list *alist;
637 	bool has_addrs;
638 
639 	_enter("");
640 
641 	trace_afs_server(server->debug_id, refcount_read(&server->ref),
642 			 atomic_read(&server->active),
643 			 afs_server_trace_update);
644 
645 	alist = afs_vl_lookup_addrs(op->volume->cell, op->key, &server->uuid);
646 	if (IS_ERR(alist)) {
647 		rcu_read_lock();
648 		estate = rcu_dereference(server->endpoint_state);
649 		has_addrs = estate->addresses;
650 		rcu_read_unlock();
651 
652 		if ((PTR_ERR(alist) == -ERESTARTSYS ||
653 		     PTR_ERR(alist) == -EINTR) &&
654 		    (op->flags & AFS_OPERATION_UNINTR) &&
655 		    has_addrs) {
656 			_leave(" = t [intr]");
657 			return true;
658 		}
659 		afs_op_set_error(op, PTR_ERR(alist));
660 		_leave(" = f [%d]", afs_op_error(op));
661 		return false;
662 	}
663 
664 	if (server->addr_version != alist->version)
665 		afs_fs_probe_fileserver(op->net, server, alist, key);
666 
667 	afs_put_addrlist(alist, afs_alist_trace_put_server_update);
668 	_leave(" = t");
669 	return true;
670 }
671 
672 /*
673  * See if a server's address list needs updating.
674  */
675 bool afs_check_server_record(struct afs_operation *op, struct afs_server *server,
676 			     struct key *key)
677 {
678 	bool success;
679 	int ret, retries = 0;
680 
681 	_enter("");
682 
683 	ASSERT(server);
684 
685 retry:
686 	if (test_bit(AFS_SERVER_FL_UPDATING, &server->flags))
687 		goto wait;
688 	if (test_bit(AFS_SERVER_FL_NEEDS_UPDATE, &server->flags))
689 		goto update;
690 	_leave(" = t [good]");
691 	return true;
692 
693 update:
694 	if (!test_and_set_bit_lock(AFS_SERVER_FL_UPDATING, &server->flags)) {
695 		clear_bit(AFS_SERVER_FL_NEEDS_UPDATE, &server->flags);
696 		success = afs_update_server_record(op, server, key);
697 		clear_bit_unlock(AFS_SERVER_FL_UPDATING, &server->flags);
698 		wake_up_bit(&server->flags, AFS_SERVER_FL_UPDATING);
699 		_leave(" = %d", success);
700 		return success;
701 	}
702 
703 wait:
704 	ret = wait_on_bit(&server->flags, AFS_SERVER_FL_UPDATING,
705 			  (op->flags & AFS_OPERATION_UNINTR) ?
706 			  TASK_UNINTERRUPTIBLE : TASK_INTERRUPTIBLE);
707 	if (ret == -ERESTARTSYS) {
708 		afs_op_set_error(op, ret);
709 		_leave(" = f [intr]");
710 		return false;
711 	}
712 
713 	retries++;
714 	if (retries == 4) {
715 		_leave(" = f [stale]");
716 		ret = -ESTALE;
717 		return false;
718 	}
719 	goto retry;
720 }
721