server.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697
  1. /* AFS server record management
  2. *
  3. * Copyright (C) 2002, 2007 Red Hat, Inc. All Rights Reserved.
  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. #include <linux/sched.h>
  12. #include <linux/slab.h>
  13. #include "afs_fs.h"
  14. #include "internal.h"
  15. static unsigned afs_server_gc_delay = 10; /* Server record timeout in seconds */
  16. static unsigned afs_server_update_delay = 30; /* Time till VLDB recheck in secs */
  17. static void afs_inc_servers_outstanding(struct afs_net *net)
  18. {
  19. atomic_inc(&net->servers_outstanding);
  20. }
  21. static void afs_dec_servers_outstanding(struct afs_net *net)
  22. {
  23. if (atomic_dec_and_test(&net->servers_outstanding))
  24. wake_up_var(&net->servers_outstanding);
  25. }
  26. /*
  27. * Find a server by one of its addresses.
  28. */
  29. struct afs_server *afs_find_server(struct afs_net *net,
  30. const struct sockaddr_rxrpc *srx)
  31. {
  32. const struct sockaddr_in6 *a = &srx->transport.sin6, *b;
  33. const struct afs_addr_list *alist;
  34. struct afs_server *server = NULL;
  35. unsigned int i;
  36. bool ipv6 = true;
  37. int seq = 0, diff;
  38. if (srx->transport.sin6.sin6_addr.s6_addr32[0] == 0 ||
  39. srx->transport.sin6.sin6_addr.s6_addr32[1] == 0 ||
  40. srx->transport.sin6.sin6_addr.s6_addr32[2] == htonl(0xffff))
  41. ipv6 = false;
  42. rcu_read_lock();
  43. do {
  44. if (server)
  45. afs_put_server(net, server);
  46. server = NULL;
  47. read_seqbegin_or_lock(&net->fs_addr_lock, &seq);
  48. if (ipv6) {
  49. hlist_for_each_entry_rcu(server, &net->fs_addresses6, addr6_link) {
  50. alist = rcu_dereference(server->addresses);
  51. for (i = alist->nr_ipv4; i < alist->nr_addrs; i++) {
  52. b = &alist->addrs[i].transport.sin6;
  53. diff = ((u16 __force)a->sin6_port -
  54. (u16 __force)b->sin6_port);
  55. if (diff == 0)
  56. diff = memcmp(&a->sin6_addr,
  57. &b->sin6_addr,
  58. sizeof(struct in6_addr));
  59. if (diff == 0)
  60. goto found;
  61. }
  62. }
  63. } else {
  64. hlist_for_each_entry_rcu(server, &net->fs_addresses4, addr4_link) {
  65. alist = rcu_dereference(server->addresses);
  66. for (i = 0; i < alist->nr_ipv4; i++) {
  67. b = &alist->addrs[i].transport.sin6;
  68. diff = ((u16 __force)a->sin6_port -
  69. (u16 __force)b->sin6_port);
  70. if (diff == 0)
  71. diff = ((u32 __force)a->sin6_addr.s6_addr32[3] -
  72. (u32 __force)b->sin6_addr.s6_addr32[3]);
  73. if (diff == 0)
  74. goto found;
  75. }
  76. }
  77. }
  78. server = NULL;
  79. found:
  80. if (server && !atomic_inc_not_zero(&server->usage))
  81. server = NULL;
  82. } while (need_seqretry(&net->fs_addr_lock, seq));
  83. done_seqretry(&net->fs_addr_lock, seq);
  84. rcu_read_unlock();
  85. return server;
  86. }
  87. /*
  88. * Look up a server by its UUID
  89. */
  90. struct afs_server *afs_find_server_by_uuid(struct afs_net *net, const uuid_t *uuid)
  91. {
  92. struct afs_server *server = NULL;
  93. struct rb_node *p;
  94. int diff, seq = 0;
  95. _enter("%pU", uuid);
  96. do {
  97. /* Unfortunately, rbtree walking doesn't give reliable results
  98. * under just the RCU read lock, so we have to check for
  99. * changes.
  100. */
  101. if (server)
  102. afs_put_server(net, server);
  103. server = NULL;
  104. read_seqbegin_or_lock(&net->fs_lock, &seq);
  105. p = net->fs_servers.rb_node;
  106. while (p) {
  107. server = rb_entry(p, struct afs_server, uuid_rb);
  108. diff = memcmp(uuid, &server->uuid, sizeof(*uuid));
  109. if (diff < 0) {
  110. p = p->rb_left;
  111. } else if (diff > 0) {
  112. p = p->rb_right;
  113. } else {
  114. afs_get_server(server);
  115. break;
  116. }
  117. server = NULL;
  118. }
  119. } while (need_seqretry(&net->fs_lock, seq));
  120. done_seqretry(&net->fs_lock, seq);
  121. _leave(" = %p", server);
  122. return server;
  123. }
  124. /*
  125. * Install a server record in the namespace tree
  126. */
  127. static struct afs_server *afs_install_server(struct afs_net *net,
  128. struct afs_server *candidate)
  129. {
  130. const struct afs_addr_list *alist;
  131. struct afs_server *server;
  132. struct rb_node **pp, *p;
  133. int ret = -EEXIST, diff;
  134. _enter("%p", candidate);
  135. write_seqlock(&net->fs_lock);
  136. /* Firstly install the server in the UUID lookup tree */
  137. pp = &net->fs_servers.rb_node;
  138. p = NULL;
  139. while (*pp) {
  140. p = *pp;
  141. _debug("- consider %p", p);
  142. server = rb_entry(p, struct afs_server, uuid_rb);
  143. diff = memcmp(&candidate->uuid, &server->uuid, sizeof(uuid_t));
  144. if (diff < 0)
  145. pp = &(*pp)->rb_left;
  146. else if (diff > 0)
  147. pp = &(*pp)->rb_right;
  148. else
  149. goto exists;
  150. }
  151. server = candidate;
  152. rb_link_node(&server->uuid_rb, p, pp);
  153. rb_insert_color(&server->uuid_rb, &net->fs_servers);
  154. hlist_add_head_rcu(&server->proc_link, &net->fs_proc);
  155. write_seqlock(&net->fs_addr_lock);
  156. alist = rcu_dereference_protected(server->addresses,
  157. lockdep_is_held(&net->fs_addr_lock.lock));
  158. /* Secondly, if the server has any IPv4 and/or IPv6 addresses, install
  159. * it in the IPv4 and/or IPv6 reverse-map lists.
  160. *
  161. * TODO: For speed we want to use something other than a flat list
  162. * here; even sorting the list in terms of lowest address would help a
  163. * bit, but anything we might want to do gets messy and memory
  164. * intensive.
  165. */
  166. if (alist->nr_ipv4 > 0)
  167. hlist_add_head_rcu(&server->addr4_link, &net->fs_addresses4);
  168. if (alist->nr_addrs > alist->nr_ipv4)
  169. hlist_add_head_rcu(&server->addr6_link, &net->fs_addresses6);
  170. write_sequnlock(&net->fs_addr_lock);
  171. ret = 0;
  172. exists:
  173. afs_get_server(server);
  174. write_sequnlock(&net->fs_lock);
  175. return server;
  176. }
  177. /*
  178. * allocate a new server record
  179. */
  180. static struct afs_server *afs_alloc_server(struct afs_net *net,
  181. const uuid_t *uuid,
  182. struct afs_addr_list *alist)
  183. {
  184. struct afs_server *server;
  185. _enter("");
  186. server = kzalloc(sizeof(struct afs_server), GFP_KERNEL);
  187. if (!server)
  188. goto enomem;
  189. atomic_set(&server->usage, 1);
  190. RCU_INIT_POINTER(server->addresses, alist);
  191. server->addr_version = alist->version;
  192. server->uuid = *uuid;
  193. server->flags = (1UL << AFS_SERVER_FL_NEW);
  194. server->update_at = ktime_get_real_seconds() + afs_server_update_delay;
  195. rwlock_init(&server->fs_lock);
  196. INIT_HLIST_HEAD(&server->cb_volumes);
  197. rwlock_init(&server->cb_break_lock);
  198. afs_inc_servers_outstanding(net);
  199. _leave(" = %p", server);
  200. return server;
  201. enomem:
  202. _leave(" = NULL [nomem]");
  203. return NULL;
  204. }
  205. /*
  206. * Look up an address record for a server
  207. */
  208. static struct afs_addr_list *afs_vl_lookup_addrs(struct afs_cell *cell,
  209. struct key *key, const uuid_t *uuid)
  210. {
  211. struct afs_addr_cursor ac;
  212. struct afs_addr_list *alist;
  213. int ret;
  214. ret = afs_set_vl_cursor(&ac, cell);
  215. if (ret < 0)
  216. return ERR_PTR(ret);
  217. while (afs_iterate_addresses(&ac)) {
  218. if (test_bit(ac.index, &ac.alist->yfs))
  219. alist = afs_yfsvl_get_endpoints(cell->net, &ac, key, uuid);
  220. else
  221. alist = afs_vl_get_addrs_u(cell->net, &ac, key, uuid);
  222. switch (ac.error) {
  223. case 0:
  224. afs_end_cursor(&ac);
  225. return alist;
  226. case -ECONNABORTED:
  227. ac.error = afs_abort_to_error(ac.abort_code);
  228. goto error;
  229. case -ENOMEM:
  230. case -ENONET:
  231. goto error;
  232. case -ENETUNREACH:
  233. case -EHOSTUNREACH:
  234. case -ECONNREFUSED:
  235. break;
  236. default:
  237. ac.error = -EIO;
  238. goto error;
  239. }
  240. }
  241. error:
  242. return ERR_PTR(afs_end_cursor(&ac));
  243. }
  244. /*
  245. * Get or create a fileserver record.
  246. */
  247. struct afs_server *afs_lookup_server(struct afs_cell *cell, struct key *key,
  248. const uuid_t *uuid)
  249. {
  250. struct afs_addr_list *alist;
  251. struct afs_server *server, *candidate;
  252. _enter("%p,%pU", cell->net, uuid);
  253. server = afs_find_server_by_uuid(cell->net, uuid);
  254. if (server)
  255. return server;
  256. alist = afs_vl_lookup_addrs(cell, key, uuid);
  257. if (IS_ERR(alist))
  258. return ERR_CAST(alist);
  259. candidate = afs_alloc_server(cell->net, uuid, alist);
  260. if (!candidate) {
  261. afs_put_addrlist(alist);
  262. return ERR_PTR(-ENOMEM);
  263. }
  264. server = afs_install_server(cell->net, candidate);
  265. if (server != candidate) {
  266. afs_put_addrlist(alist);
  267. kfree(candidate);
  268. }
  269. _leave(" = %p{%d}", server, atomic_read(&server->usage));
  270. return server;
  271. }
  272. /*
  273. * Set the server timer to fire after a given delay, assuming it's not already
  274. * set for an earlier time.
  275. */
  276. static void afs_set_server_timer(struct afs_net *net, time64_t delay)
  277. {
  278. if (net->live) {
  279. afs_inc_servers_outstanding(net);
  280. if (timer_reduce(&net->fs_timer, jiffies + delay * HZ))
  281. afs_dec_servers_outstanding(net);
  282. }
  283. }
  284. /*
  285. * Server management timer. We have an increment on fs_outstanding that we
  286. * need to pass along to the work item.
  287. */
  288. void afs_servers_timer(struct timer_list *timer)
  289. {
  290. struct afs_net *net = container_of(timer, struct afs_net, fs_timer);
  291. _enter("");
  292. if (!queue_work(afs_wq, &net->fs_manager))
  293. afs_dec_servers_outstanding(net);
  294. }
  295. /*
  296. * Release a reference on a server record.
  297. */
  298. void afs_put_server(struct afs_net *net, struct afs_server *server)
  299. {
  300. unsigned int usage;
  301. if (!server)
  302. return;
  303. server->put_time = ktime_get_real_seconds();
  304. usage = atomic_dec_return(&server->usage);
  305. _enter("{%u}", usage);
  306. if (likely(usage > 0))
  307. return;
  308. afs_set_server_timer(net, afs_server_gc_delay);
  309. }
  310. static void afs_server_rcu(struct rcu_head *rcu)
  311. {
  312. struct afs_server *server = container_of(rcu, struct afs_server, rcu);
  313. afs_put_addrlist(rcu_access_pointer(server->addresses));
  314. kfree(server);
  315. }
  316. /*
  317. * destroy a dead server
  318. */
  319. static void afs_destroy_server(struct afs_net *net, struct afs_server *server)
  320. {
  321. struct afs_addr_list *alist = rcu_access_pointer(server->addresses);
  322. struct afs_addr_cursor ac = {
  323. .alist = alist,
  324. .start = alist->index,
  325. .index = 0,
  326. .addr = &alist->addrs[alist->index],
  327. .error = 0,
  328. };
  329. _enter("%p", server);
  330. if (test_bit(AFS_SERVER_FL_MAY_HAVE_CB, &server->flags))
  331. afs_fs_give_up_all_callbacks(net, server, &ac, NULL);
  332. call_rcu(&server->rcu, afs_server_rcu);
  333. afs_dec_servers_outstanding(net);
  334. }
  335. /*
  336. * Garbage collect any expired servers.
  337. */
  338. static void afs_gc_servers(struct afs_net *net, struct afs_server *gc_list)
  339. {
  340. struct afs_server *server;
  341. bool deleted;
  342. int usage;
  343. while ((server = gc_list)) {
  344. gc_list = server->gc_next;
  345. write_seqlock(&net->fs_lock);
  346. usage = 1;
  347. deleted = atomic_try_cmpxchg(&server->usage, &usage, 0);
  348. if (deleted) {
  349. rb_erase(&server->uuid_rb, &net->fs_servers);
  350. hlist_del_rcu(&server->proc_link);
  351. }
  352. write_sequnlock(&net->fs_lock);
  353. if (deleted) {
  354. write_seqlock(&net->fs_addr_lock);
  355. if (!hlist_unhashed(&server->addr4_link))
  356. hlist_del_rcu(&server->addr4_link);
  357. if (!hlist_unhashed(&server->addr6_link))
  358. hlist_del_rcu(&server->addr6_link);
  359. write_sequnlock(&net->fs_addr_lock);
  360. afs_destroy_server(net, server);
  361. }
  362. }
  363. }
  364. /*
  365. * Manage the records of servers known to be within a network namespace. This
  366. * includes garbage collecting unused servers.
  367. *
  368. * Note also that we were given an increment on net->servers_outstanding by
  369. * whoever queued us that we need to deal with before returning.
  370. */
  371. void afs_manage_servers(struct work_struct *work)
  372. {
  373. struct afs_net *net = container_of(work, struct afs_net, fs_manager);
  374. struct afs_server *gc_list = NULL;
  375. struct rb_node *cursor;
  376. time64_t now = ktime_get_real_seconds(), next_manage = TIME64_MAX;
  377. bool purging = !net->live;
  378. _enter("");
  379. /* Trawl the server list looking for servers that have expired from
  380. * lack of use.
  381. */
  382. read_seqlock_excl(&net->fs_lock);
  383. for (cursor = rb_first(&net->fs_servers); cursor; cursor = rb_next(cursor)) {
  384. struct afs_server *server =
  385. rb_entry(cursor, struct afs_server, uuid_rb);
  386. int usage = atomic_read(&server->usage);
  387. _debug("manage %pU %u", &server->uuid, usage);
  388. ASSERTCMP(usage, >=, 1);
  389. ASSERTIFCMP(purging, usage, ==, 1);
  390. if (usage == 1) {
  391. time64_t expire_at = server->put_time;
  392. if (!test_bit(AFS_SERVER_FL_VL_FAIL, &server->flags) &&
  393. !test_bit(AFS_SERVER_FL_NOT_FOUND, &server->flags))
  394. expire_at += afs_server_gc_delay;
  395. if (purging || expire_at <= now) {
  396. server->gc_next = gc_list;
  397. gc_list = server;
  398. } else if (expire_at < next_manage) {
  399. next_manage = expire_at;
  400. }
  401. }
  402. }
  403. read_sequnlock_excl(&net->fs_lock);
  404. /* Update the timer on the way out. We have to pass an increment on
  405. * servers_outstanding in the namespace that we are in to the timer or
  406. * the work scheduler.
  407. */
  408. if (!purging && next_manage < TIME64_MAX) {
  409. now = ktime_get_real_seconds();
  410. if (next_manage - now <= 0) {
  411. if (queue_work(afs_wq, &net->fs_manager))
  412. afs_inc_servers_outstanding(net);
  413. } else {
  414. afs_set_server_timer(net, next_manage - now);
  415. }
  416. }
  417. afs_gc_servers(net, gc_list);
  418. afs_dec_servers_outstanding(net);
  419. _leave(" [%d]", atomic_read(&net->servers_outstanding));
  420. }
  421. static void afs_queue_server_manager(struct afs_net *net)
  422. {
  423. afs_inc_servers_outstanding(net);
  424. if (!queue_work(afs_wq, &net->fs_manager))
  425. afs_dec_servers_outstanding(net);
  426. }
  427. /*
  428. * Purge list of servers.
  429. */
  430. void afs_purge_servers(struct afs_net *net)
  431. {
  432. _enter("");
  433. if (del_timer_sync(&net->fs_timer))
  434. atomic_dec(&net->servers_outstanding);
  435. afs_queue_server_manager(net);
  436. _debug("wait");
  437. wait_var_event(&net->servers_outstanding,
  438. !atomic_read(&net->servers_outstanding));
  439. _leave("");
  440. }
  441. /*
  442. * Probe a fileserver to find its capabilities.
  443. *
  444. * TODO: Try service upgrade.
  445. */
  446. static bool afs_do_probe_fileserver(struct afs_fs_cursor *fc)
  447. {
  448. _enter("");
  449. fc->ac.addr = NULL;
  450. fc->ac.start = READ_ONCE(fc->ac.alist->index);
  451. fc->ac.index = fc->ac.start;
  452. fc->ac.error = 0;
  453. fc->ac.begun = false;
  454. while (afs_iterate_addresses(&fc->ac)) {
  455. afs_fs_get_capabilities(afs_v2net(fc->vnode), fc->cbi->server,
  456. &fc->ac, fc->key);
  457. switch (fc->ac.error) {
  458. case 0:
  459. afs_end_cursor(&fc->ac);
  460. set_bit(AFS_SERVER_FL_PROBED, &fc->cbi->server->flags);
  461. return true;
  462. case -ECONNABORTED:
  463. fc->ac.error = afs_abort_to_error(fc->ac.abort_code);
  464. goto error;
  465. case -ENOMEM:
  466. case -ENONET:
  467. goto error;
  468. case -ENETUNREACH:
  469. case -EHOSTUNREACH:
  470. case -ECONNREFUSED:
  471. case -ETIMEDOUT:
  472. case -ETIME:
  473. break;
  474. default:
  475. fc->ac.error = -EIO;
  476. goto error;
  477. }
  478. }
  479. error:
  480. afs_end_cursor(&fc->ac);
  481. return false;
  482. }
  483. /*
  484. * If we haven't already, try probing the fileserver to get its capabilities.
  485. * We try not to instigate parallel probes, but it's possible that the parallel
  486. * probes will fail due to authentication failure when ours would succeed.
  487. *
  488. * TODO: Try sending an anonymous probe if an authenticated probe fails.
  489. */
  490. bool afs_probe_fileserver(struct afs_fs_cursor *fc)
  491. {
  492. bool success;
  493. int ret, retries = 0;
  494. _enter("");
  495. retry:
  496. if (test_bit(AFS_SERVER_FL_PROBED, &fc->cbi->server->flags)) {
  497. _leave(" = t");
  498. return true;
  499. }
  500. if (!test_and_set_bit_lock(AFS_SERVER_FL_PROBING, &fc->cbi->server->flags)) {
  501. success = afs_do_probe_fileserver(fc);
  502. clear_bit_unlock(AFS_SERVER_FL_PROBING, &fc->cbi->server->flags);
  503. wake_up_bit(&fc->cbi->server->flags, AFS_SERVER_FL_PROBING);
  504. _leave(" = t");
  505. return success;
  506. }
  507. _debug("wait");
  508. ret = wait_on_bit(&fc->cbi->server->flags, AFS_SERVER_FL_PROBING,
  509. TASK_INTERRUPTIBLE);
  510. if (ret == -ERESTARTSYS) {
  511. fc->ac.error = ret;
  512. _leave(" = f [%d]", ret);
  513. return false;
  514. }
  515. retries++;
  516. if (retries == 4) {
  517. fc->ac.error = -ESTALE;
  518. _leave(" = f [stale]");
  519. return false;
  520. }
  521. _debug("retry");
  522. goto retry;
  523. }
  524. /*
  525. * Get an update for a server's address list.
  526. */
  527. static noinline bool afs_update_server_record(struct afs_fs_cursor *fc, struct afs_server *server)
  528. {
  529. struct afs_addr_list *alist, *discard;
  530. _enter("");
  531. alist = afs_vl_lookup_addrs(fc->vnode->volume->cell, fc->key,
  532. &server->uuid);
  533. if (IS_ERR(alist)) {
  534. fc->ac.error = PTR_ERR(alist);
  535. _leave(" = f [%d]", fc->ac.error);
  536. return false;
  537. }
  538. discard = alist;
  539. if (server->addr_version != alist->version) {
  540. write_lock(&server->fs_lock);
  541. discard = rcu_dereference_protected(server->addresses,
  542. lockdep_is_held(&server->fs_lock));
  543. rcu_assign_pointer(server->addresses, alist);
  544. server->addr_version = alist->version;
  545. write_unlock(&server->fs_lock);
  546. }
  547. server->update_at = ktime_get_real_seconds() + afs_server_update_delay;
  548. afs_put_addrlist(discard);
  549. _leave(" = t");
  550. return true;
  551. }
  552. /*
  553. * See if a server's address list needs updating.
  554. */
  555. bool afs_check_server_record(struct afs_fs_cursor *fc, struct afs_server *server)
  556. {
  557. time64_t now = ktime_get_real_seconds();
  558. long diff;
  559. bool success;
  560. int ret, retries = 0;
  561. _enter("");
  562. ASSERT(server);
  563. retry:
  564. diff = READ_ONCE(server->update_at) - now;
  565. if (diff > 0) {
  566. _leave(" = t [not now %ld]", diff);
  567. return true;
  568. }
  569. if (!test_and_set_bit_lock(AFS_SERVER_FL_UPDATING, &server->flags)) {
  570. success = afs_update_server_record(fc, server);
  571. clear_bit_unlock(AFS_SERVER_FL_UPDATING, &server->flags);
  572. wake_up_bit(&server->flags, AFS_SERVER_FL_UPDATING);
  573. _leave(" = %d", success);
  574. return success;
  575. }
  576. ret = wait_on_bit(&server->flags, AFS_SERVER_FL_UPDATING,
  577. TASK_INTERRUPTIBLE);
  578. if (ret == -ERESTARTSYS) {
  579. fc->ac.error = ret;
  580. _leave(" = f [intr]");
  581. return false;
  582. }
  583. retries++;
  584. if (retries == 4) {
  585. _leave(" = f [stale]");
  586. ret = -ESTALE;
  587. return false;
  588. }
  589. goto retry;
  590. }