fs_probe.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /* AFS fileserver probing
  3. *
  4. * Copyright (C) 2018, 2020 Red Hat, Inc. All Rights Reserved.
  5. * Written by David Howells (dhowells@redhat.com)
  6. */
  7. #include <linux/sched.h>
  8. #include <linux/slab.h>
  9. #include "afs_fs.h"
  10. #include "internal.h"
  11. #include "protocol_afs.h"
  12. #include "protocol_yfs.h"
  13. static unsigned int afs_fs_probe_fast_poll_interval = 30 * HZ;
  14. static unsigned int afs_fs_probe_slow_poll_interval = 5 * 60 * HZ;
  15. struct afs_endpoint_state *afs_get_endpoint_state(struct afs_endpoint_state *estate,
  16. enum afs_estate_trace where)
  17. {
  18. if (estate) {
  19. int r;
  20. __refcount_inc(&estate->ref, &r);
  21. trace_afs_estate(estate->server_id, estate->probe_seq, r, where);
  22. }
  23. return estate;
  24. }
  25. static void afs_endpoint_state_rcu(struct rcu_head *rcu)
  26. {
  27. struct afs_endpoint_state *estate = container_of(rcu, struct afs_endpoint_state, rcu);
  28. trace_afs_estate(estate->server_id, estate->probe_seq, refcount_read(&estate->ref),
  29. afs_estate_trace_free);
  30. afs_put_addrlist(estate->addresses, afs_alist_trace_put_estate);
  31. kfree(estate);
  32. }
  33. void afs_put_endpoint_state(struct afs_endpoint_state *estate, enum afs_estate_trace where)
  34. {
  35. if (estate) {
  36. unsigned int server_id = estate->server_id, probe_seq = estate->probe_seq;
  37. bool dead;
  38. int r;
  39. dead = __refcount_dec_and_test(&estate->ref, &r);
  40. trace_afs_estate(server_id, probe_seq, r, where);
  41. if (dead)
  42. call_rcu(&estate->rcu, afs_endpoint_state_rcu);
  43. }
  44. }
  45. /*
  46. * Start the probe polling timer. We have to supply it with an inc on the
  47. * outstanding server count.
  48. */
  49. static void afs_schedule_fs_probe(struct afs_net *net,
  50. struct afs_server *server, bool fast)
  51. {
  52. unsigned long atj;
  53. if (!net->live)
  54. return;
  55. atj = server->probed_at;
  56. atj += fast ? afs_fs_probe_fast_poll_interval : afs_fs_probe_slow_poll_interval;
  57. afs_inc_servers_outstanding(net);
  58. if (timer_reduce(&net->fs_probe_timer, atj))
  59. afs_dec_servers_outstanding(net);
  60. }
  61. /*
  62. * Handle the completion of a set of probes.
  63. */
  64. static void afs_finished_fs_probe(struct afs_net *net, struct afs_server *server,
  65. struct afs_endpoint_state *estate)
  66. {
  67. bool responded = test_bit(AFS_ESTATE_RESPONDED, &estate->flags);
  68. write_seqlock(&net->fs_lock);
  69. if (responded) {
  70. list_add_tail(&server->probe_link, &net->fs_probe_slow);
  71. } else {
  72. server->rtt = UINT_MAX;
  73. clear_bit(AFS_SERVER_FL_RESPONDING, &server->flags);
  74. list_add_tail(&server->probe_link, &net->fs_probe_fast);
  75. }
  76. write_sequnlock(&net->fs_lock);
  77. afs_schedule_fs_probe(net, server, !responded);
  78. }
  79. /*
  80. * Handle the completion of a probe.
  81. */
  82. static void afs_done_one_fs_probe(struct afs_net *net, struct afs_server *server,
  83. struct afs_endpoint_state *estate)
  84. {
  85. _enter("");
  86. if (atomic_dec_and_test(&estate->nr_probing))
  87. afs_finished_fs_probe(net, server, estate);
  88. wake_up_all(&server->probe_wq);
  89. }
  90. /*
  91. * Handle inability to send a probe due to ENOMEM when trying to allocate a
  92. * call struct.
  93. */
  94. static void afs_fs_probe_not_done(struct afs_net *net,
  95. struct afs_server *server,
  96. struct afs_endpoint_state *estate,
  97. int index)
  98. {
  99. _enter("");
  100. trace_afs_io_error(0, -ENOMEM, afs_io_error_fs_probe_fail);
  101. spin_lock(&server->probe_lock);
  102. set_bit(AFS_ESTATE_LOCAL_FAILURE, &estate->flags);
  103. if (estate->error == 0)
  104. estate->error = -ENOMEM;
  105. set_bit(index, &estate->failed_set);
  106. spin_unlock(&server->probe_lock);
  107. return afs_done_one_fs_probe(net, server, estate);
  108. }
  109. /*
  110. * Process the result of probing a fileserver. This is called after successful
  111. * or failed delivery of an FS.GetCapabilities operation.
  112. */
  113. void afs_fileserver_probe_result(struct afs_call *call)
  114. {
  115. struct afs_endpoint_state *estate = call->probe;
  116. struct afs_addr_list *alist = estate->addresses;
  117. struct afs_address *addr = &alist->addrs[call->probe_index];
  118. struct afs_server *server = call->server;
  119. unsigned int index = call->probe_index;
  120. unsigned int rtt_us = -1, cap0;
  121. int ret = call->error;
  122. _enter("%pU,%u", &server->uuid, index);
  123. WRITE_ONCE(addr->last_error, ret);
  124. spin_lock(&server->probe_lock);
  125. switch (ret) {
  126. case 0:
  127. estate->error = 0;
  128. goto responded;
  129. case -ECONNABORTED:
  130. if (!test_bit(AFS_ESTATE_RESPONDED, &estate->flags)) {
  131. estate->abort_code = call->abort_code;
  132. estate->error = ret;
  133. }
  134. goto responded;
  135. case -ENOMEM:
  136. case -ENONET:
  137. clear_bit(index, &estate->responsive_set);
  138. set_bit(AFS_ESTATE_LOCAL_FAILURE, &estate->flags);
  139. trace_afs_io_error(call->debug_id, ret, afs_io_error_fs_probe_fail);
  140. goto out;
  141. case -ECONNRESET: /* Responded, but call expired. */
  142. case -ERFKILL:
  143. case -EADDRNOTAVAIL:
  144. case -ENETUNREACH:
  145. case -EHOSTUNREACH:
  146. case -EHOSTDOWN:
  147. case -ECONNREFUSED:
  148. case -ETIMEDOUT:
  149. case -ETIME:
  150. default:
  151. clear_bit(index, &estate->responsive_set);
  152. set_bit(index, &estate->failed_set);
  153. if (!test_bit(AFS_ESTATE_RESPONDED, &estate->flags) &&
  154. (estate->error == 0 ||
  155. estate->error == -ETIMEDOUT ||
  156. estate->error == -ETIME))
  157. estate->error = ret;
  158. trace_afs_io_error(call->debug_id, ret, afs_io_error_fs_probe_fail);
  159. goto out;
  160. }
  161. responded:
  162. clear_bit(index, &estate->failed_set);
  163. if (call->service_id == YFS_FS_SERVICE) {
  164. set_bit(AFS_ESTATE_IS_YFS, &estate->flags);
  165. set_bit(AFS_SERVER_FL_IS_YFS, &server->flags);
  166. server->service_id = call->service_id;
  167. } else {
  168. set_bit(AFS_ESTATE_NOT_YFS, &estate->flags);
  169. if (!test_bit(AFS_ESTATE_IS_YFS, &estate->flags)) {
  170. clear_bit(AFS_SERVER_FL_IS_YFS, &server->flags);
  171. server->service_id = call->service_id;
  172. }
  173. cap0 = ntohl(call->tmp);
  174. if (cap0 & AFS3_VICED_CAPABILITY_64BITFILES)
  175. set_bit(AFS_SERVER_FL_HAS_FS64, &server->flags);
  176. else
  177. clear_bit(AFS_SERVER_FL_HAS_FS64, &server->flags);
  178. }
  179. rtt_us = rxrpc_kernel_get_srtt(addr->peer);
  180. if (rtt_us < estate->rtt) {
  181. estate->rtt = rtt_us;
  182. server->rtt = rtt_us;
  183. alist->preferred = index;
  184. }
  185. smp_wmb(); /* Set rtt before responded. */
  186. set_bit(AFS_ESTATE_RESPONDED, &estate->flags);
  187. set_bit(index, &estate->responsive_set);
  188. set_bit(AFS_SERVER_FL_RESPONDING, &server->flags);
  189. out:
  190. spin_unlock(&server->probe_lock);
  191. trace_afs_fs_probe(server, false, estate, index, call->error, call->abort_code, rtt_us);
  192. _debug("probe[%x] %pU [%u] %pISpc rtt=%d ret=%d",
  193. estate->probe_seq, &server->uuid, index,
  194. rxrpc_kernel_remote_addr(alist->addrs[index].peer),
  195. rtt_us, ret);
  196. return afs_done_one_fs_probe(call->net, server, estate);
  197. }
  198. /*
  199. * Probe all of a fileserver's addresses to find out the best route and to
  200. * query its capabilities.
  201. */
  202. int afs_fs_probe_fileserver(struct afs_net *net, struct afs_server *server,
  203. struct afs_addr_list *new_alist, struct key *key)
  204. {
  205. struct afs_endpoint_state *estate, *old;
  206. struct afs_addr_list *old_alist = NULL, *alist;
  207. unsigned long unprobed;
  208. _enter("%pU", &server->uuid);
  209. estate = kzalloc_obj(*estate);
  210. if (!estate)
  211. return -ENOMEM;
  212. refcount_set(&estate->ref, 2);
  213. estate->server_id = server->debug_id;
  214. estate->rtt = UINT_MAX;
  215. write_lock(&server->fs_lock);
  216. old = rcu_dereference_protected(server->endpoint_state,
  217. lockdep_is_held(&server->fs_lock));
  218. if (old) {
  219. estate->responsive_set = old->responsive_set;
  220. if (!new_alist)
  221. new_alist = old->addresses;
  222. }
  223. if (old_alist != new_alist)
  224. afs_set_peer_appdata(server, old_alist, new_alist);
  225. estate->addresses = afs_get_addrlist(new_alist, afs_alist_trace_get_estate);
  226. alist = estate->addresses;
  227. estate->probe_seq = ++server->probe_counter;
  228. atomic_set(&estate->nr_probing, alist->nr_addrs);
  229. if (new_alist)
  230. server->addr_version = new_alist->version;
  231. rcu_assign_pointer(server->endpoint_state, estate);
  232. write_unlock(&server->fs_lock);
  233. if (old)
  234. set_bit(AFS_ESTATE_SUPERSEDED, &old->flags);
  235. trace_afs_estate(estate->server_id, estate->probe_seq, refcount_read(&estate->ref),
  236. afs_estate_trace_alloc_probe);
  237. afs_get_address_preferences(net, new_alist);
  238. server->probed_at = jiffies;
  239. unprobed = (1UL << alist->nr_addrs) - 1;
  240. while (unprobed) {
  241. unsigned int index = 0, i;
  242. int best_prio = -1;
  243. for (i = 0; i < alist->nr_addrs; i++) {
  244. if (test_bit(i, &unprobed) &&
  245. alist->addrs[i].prio > best_prio) {
  246. index = i;
  247. best_prio = alist->addrs[i].prio;
  248. }
  249. }
  250. __clear_bit(index, &unprobed);
  251. trace_afs_fs_probe(server, true, estate, index, 0, 0, 0);
  252. if (!afs_fs_get_capabilities(net, server, estate, index, key))
  253. afs_fs_probe_not_done(net, server, estate, index);
  254. }
  255. afs_put_endpoint_state(old, afs_estate_trace_put_probe);
  256. afs_put_endpoint_state(estate, afs_estate_trace_put_probe);
  257. return 0;
  258. }
  259. /*
  260. * Wait for the first as-yet untried fileserver to respond, for the probe state
  261. * to be superseded or for all probes to finish.
  262. */
  263. int afs_wait_for_fs_probes(struct afs_operation *op, struct afs_server_state *states, bool intr)
  264. {
  265. struct afs_endpoint_state *estate;
  266. struct afs_server_list *slist = op->server_list;
  267. bool still_probing = true;
  268. int ret = 0, i;
  269. _enter("%u", slist->nr_servers);
  270. for (i = 0; i < slist->nr_servers; i++) {
  271. estate = states[i].endpoint_state;
  272. if (test_bit(AFS_ESTATE_SUPERSEDED, &estate->flags))
  273. return 2;
  274. if (atomic_read(&estate->nr_probing))
  275. still_probing = true;
  276. if (estate->responsive_set & states[i].untried_addrs)
  277. return 1;
  278. }
  279. if (!still_probing)
  280. return 0;
  281. for (i = 0; i < slist->nr_servers; i++)
  282. add_wait_queue(&slist->servers[i].server->probe_wq, &states[i].probe_waiter);
  283. for (;;) {
  284. still_probing = false;
  285. set_current_state(intr ? TASK_INTERRUPTIBLE : TASK_UNINTERRUPTIBLE);
  286. for (i = 0; i < slist->nr_servers; i++) {
  287. estate = states[i].endpoint_state;
  288. if (test_bit(AFS_ESTATE_SUPERSEDED, &estate->flags)) {
  289. ret = 2;
  290. goto stop;
  291. }
  292. if (atomic_read(&estate->nr_probing))
  293. still_probing = true;
  294. if (estate->responsive_set & states[i].untried_addrs) {
  295. ret = 1;
  296. goto stop;
  297. }
  298. }
  299. if (!still_probing || signal_pending(current))
  300. goto stop;
  301. schedule();
  302. }
  303. stop:
  304. set_current_state(TASK_RUNNING);
  305. for (i = 0; i < slist->nr_servers; i++)
  306. remove_wait_queue(&slist->servers[i].server->probe_wq, &states[i].probe_waiter);
  307. if (!ret && signal_pending(current))
  308. ret = -ERESTARTSYS;
  309. return ret;
  310. }
  311. /*
  312. * Probe timer. We have an increment on fs_outstanding that we need to pass
  313. * along to the work item.
  314. */
  315. void afs_fs_probe_timer(struct timer_list *timer)
  316. {
  317. struct afs_net *net = container_of(timer, struct afs_net, fs_probe_timer);
  318. if (!net->live || !queue_work(afs_wq, &net->fs_prober))
  319. afs_dec_servers_outstanding(net);
  320. }
  321. /*
  322. * Dispatch a probe to a server.
  323. */
  324. static void afs_dispatch_fs_probe(struct afs_net *net, struct afs_server *server)
  325. __releases(&net->fs_lock)
  326. {
  327. struct key *key = NULL;
  328. /* We remove it from the queues here - it will be added back to
  329. * one of the queues on the completion of the probe.
  330. */
  331. list_del_init(&server->probe_link);
  332. afs_get_server(server, afs_server_trace_get_probe);
  333. write_sequnlock(&net->fs_lock);
  334. afs_fs_probe_fileserver(net, server, NULL, key);
  335. afs_put_server(net, server, afs_server_trace_put_probe);
  336. }
  337. /*
  338. * Probe a server immediately without waiting for its due time to come
  339. * round. This is used when all of the addresses have been tried.
  340. */
  341. void afs_probe_fileserver(struct afs_net *net, struct afs_server *server)
  342. {
  343. write_seqlock(&net->fs_lock);
  344. if (!list_empty(&server->probe_link))
  345. return afs_dispatch_fs_probe(net, server);
  346. write_sequnlock(&net->fs_lock);
  347. }
  348. /*
  349. * Probe dispatcher to regularly dispatch probes to keep NAT alive.
  350. */
  351. void afs_fs_probe_dispatcher(struct work_struct *work)
  352. {
  353. struct afs_net *net = container_of(work, struct afs_net, fs_prober);
  354. struct afs_server *fast, *slow, *server;
  355. unsigned long nowj, timer_at, poll_at;
  356. bool first_pass = true, set_timer = false;
  357. if (!net->live) {
  358. afs_dec_servers_outstanding(net);
  359. return;
  360. }
  361. _enter("");
  362. if (list_empty(&net->fs_probe_fast) && list_empty(&net->fs_probe_slow)) {
  363. afs_dec_servers_outstanding(net);
  364. _leave(" [none]");
  365. return;
  366. }
  367. again:
  368. write_seqlock(&net->fs_lock);
  369. fast = slow = server = NULL;
  370. nowj = jiffies;
  371. timer_at = nowj + MAX_JIFFY_OFFSET;
  372. if (!list_empty(&net->fs_probe_fast)) {
  373. fast = list_first_entry(&net->fs_probe_fast, struct afs_server, probe_link);
  374. poll_at = fast->probed_at + afs_fs_probe_fast_poll_interval;
  375. if (time_before(nowj, poll_at)) {
  376. timer_at = poll_at;
  377. set_timer = true;
  378. fast = NULL;
  379. }
  380. }
  381. if (!list_empty(&net->fs_probe_slow)) {
  382. slow = list_first_entry(&net->fs_probe_slow, struct afs_server, probe_link);
  383. poll_at = slow->probed_at + afs_fs_probe_slow_poll_interval;
  384. if (time_before(nowj, poll_at)) {
  385. if (time_before(poll_at, timer_at))
  386. timer_at = poll_at;
  387. set_timer = true;
  388. slow = NULL;
  389. }
  390. }
  391. server = fast ?: slow;
  392. if (server)
  393. _debug("probe %pU", &server->uuid);
  394. if (server && (first_pass || !need_resched())) {
  395. afs_dispatch_fs_probe(net, server);
  396. first_pass = false;
  397. goto again;
  398. }
  399. write_sequnlock(&net->fs_lock);
  400. if (server) {
  401. if (!queue_work(afs_wq, &net->fs_prober))
  402. afs_dec_servers_outstanding(net);
  403. _leave(" [requeue]");
  404. } else if (set_timer) {
  405. if (timer_reduce(&net->fs_probe_timer, timer_at))
  406. afs_dec_servers_outstanding(net);
  407. _leave(" [timer]");
  408. } else {
  409. afs_dec_servers_outstanding(net);
  410. _leave(" [quiesce]");
  411. }
  412. }
  413. /*
  414. * Wait for a probe on a particular fileserver to complete for 2s.
  415. */
  416. int afs_wait_for_one_fs_probe(struct afs_server *server, struct afs_endpoint_state *estate,
  417. unsigned long exclude, bool is_intr)
  418. {
  419. struct wait_queue_entry wait;
  420. unsigned long timo = 2 * HZ;
  421. if (atomic_read(&estate->nr_probing) == 0)
  422. goto dont_wait;
  423. init_wait_entry(&wait, 0);
  424. for (;;) {
  425. prepare_to_wait_event(&server->probe_wq, &wait,
  426. is_intr ? TASK_INTERRUPTIBLE : TASK_UNINTERRUPTIBLE);
  427. if (timo == 0 ||
  428. test_bit(AFS_ESTATE_SUPERSEDED, &estate->flags) ||
  429. (estate->responsive_set & ~exclude) ||
  430. atomic_read(&estate->nr_probing) == 0 ||
  431. (is_intr && signal_pending(current)))
  432. break;
  433. timo = schedule_timeout(timo);
  434. }
  435. finish_wait(&server->probe_wq, &wait);
  436. dont_wait:
  437. if (test_bit(AFS_ESTATE_SUPERSEDED, &estate->flags))
  438. return 0;
  439. if (estate->responsive_set & ~exclude)
  440. return 1;
  441. if (is_intr && signal_pending(current))
  442. return -ERESTARTSYS;
  443. if (timo == 0)
  444. return -ETIME;
  445. return -EDESTADDRREQ;
  446. }
  447. /*
  448. * Clean up the probing when the namespace is killed off.
  449. */
  450. void afs_fs_probe_cleanup(struct afs_net *net)
  451. {
  452. if (timer_delete_sync(&net->fs_probe_timer))
  453. afs_dec_servers_outstanding(net);
  454. }