vl_probe.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /* AFS vlserver probing
  3. *
  4. * Copyright (C) 2018 Red Hat, Inc. All Rights Reserved.
  5. * Written by David Howells ([email protected])
  6. */
  7. #include <linux/sched.h>
  8. #include <linux/slab.h>
  9. #include "afs_fs.h"
  10. #include "internal.h"
  11. #include "protocol_yfs.h"
  12. /*
  13. * Handle the completion of a set of probes.
  14. */
  15. static void afs_finished_vl_probe(struct afs_vlserver *server)
  16. {
  17. if (!(server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED)) {
  18. server->rtt = UINT_MAX;
  19. clear_bit(AFS_VLSERVER_FL_RESPONDING, &server->flags);
  20. }
  21. clear_bit_unlock(AFS_VLSERVER_FL_PROBING, &server->flags);
  22. wake_up_bit(&server->flags, AFS_VLSERVER_FL_PROBING);
  23. }
  24. /*
  25. * Handle the completion of a probe RPC call.
  26. */
  27. static void afs_done_one_vl_probe(struct afs_vlserver *server, bool wake_up)
  28. {
  29. if (atomic_dec_and_test(&server->probe_outstanding)) {
  30. afs_finished_vl_probe(server);
  31. wake_up = true;
  32. }
  33. if (wake_up)
  34. wake_up_all(&server->probe_wq);
  35. }
  36. /*
  37. * Process the result of probing a vlserver. This is called after successful
  38. * or failed delivery of an VL.GetCapabilities operation.
  39. */
  40. void afs_vlserver_probe_result(struct afs_call *call)
  41. {
  42. struct afs_addr_list *alist = call->alist;
  43. struct afs_vlserver *server = call->vlserver;
  44. unsigned int server_index = call->server_index;
  45. unsigned int rtt_us = 0;
  46. unsigned int index = call->addr_ix;
  47. bool have_result = false;
  48. int ret = call->error;
  49. _enter("%s,%u,%u,%d,%d", server->name, server_index, index, ret, call->abort_code);
  50. spin_lock(&server->probe_lock);
  51. switch (ret) {
  52. case 0:
  53. server->probe.error = 0;
  54. goto responded;
  55. case -ECONNABORTED:
  56. if (!(server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED)) {
  57. server->probe.abort_code = call->abort_code;
  58. server->probe.error = ret;
  59. }
  60. goto responded;
  61. case -ENOMEM:
  62. case -ENONET:
  63. case -EKEYEXPIRED:
  64. case -EKEYREVOKED:
  65. case -EKEYREJECTED:
  66. server->probe.flags |= AFS_VLSERVER_PROBE_LOCAL_FAILURE;
  67. if (server->probe.error == 0)
  68. server->probe.error = ret;
  69. trace_afs_io_error(call->debug_id, ret, afs_io_error_vl_probe_fail);
  70. goto out;
  71. case -ECONNRESET: /* Responded, but call expired. */
  72. case -ERFKILL:
  73. case -EADDRNOTAVAIL:
  74. case -ENETUNREACH:
  75. case -EHOSTUNREACH:
  76. case -EHOSTDOWN:
  77. case -ECONNREFUSED:
  78. case -ETIMEDOUT:
  79. case -ETIME:
  80. default:
  81. clear_bit(index, &alist->responded);
  82. set_bit(index, &alist->failed);
  83. if (!(server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED) &&
  84. (server->probe.error == 0 ||
  85. server->probe.error == -ETIMEDOUT ||
  86. server->probe.error == -ETIME))
  87. server->probe.error = ret;
  88. trace_afs_io_error(call->debug_id, ret, afs_io_error_vl_probe_fail);
  89. goto out;
  90. }
  91. responded:
  92. set_bit(index, &alist->responded);
  93. clear_bit(index, &alist->failed);
  94. if (call->service_id == YFS_VL_SERVICE) {
  95. server->probe.flags |= AFS_VLSERVER_PROBE_IS_YFS;
  96. set_bit(AFS_VLSERVER_FL_IS_YFS, &server->flags);
  97. alist->addrs[index].srx_service = call->service_id;
  98. } else {
  99. server->probe.flags |= AFS_VLSERVER_PROBE_NOT_YFS;
  100. if (!(server->probe.flags & AFS_VLSERVER_PROBE_IS_YFS)) {
  101. clear_bit(AFS_VLSERVER_FL_IS_YFS, &server->flags);
  102. alist->addrs[index].srx_service = call->service_id;
  103. }
  104. }
  105. rxrpc_kernel_get_srtt(call->net->socket, call->rxcall, &rtt_us);
  106. if (rtt_us < server->probe.rtt) {
  107. server->probe.rtt = rtt_us;
  108. server->rtt = rtt_us;
  109. alist->preferred = index;
  110. }
  111. smp_wmb(); /* Set rtt before responded. */
  112. server->probe.flags |= AFS_VLSERVER_PROBE_RESPONDED;
  113. set_bit(AFS_VLSERVER_FL_PROBED, &server->flags);
  114. set_bit(AFS_VLSERVER_FL_RESPONDING, &server->flags);
  115. have_result = true;
  116. out:
  117. spin_unlock(&server->probe_lock);
  118. _debug("probe [%u][%u] %pISpc rtt=%u ret=%d",
  119. server_index, index, &alist->addrs[index].transport, rtt_us, ret);
  120. afs_done_one_vl_probe(server, have_result);
  121. }
  122. /*
  123. * Probe all of a vlserver's addresses to find out the best route and to
  124. * query its capabilities.
  125. */
  126. static bool afs_do_probe_vlserver(struct afs_net *net,
  127. struct afs_vlserver *server,
  128. struct key *key,
  129. unsigned int server_index,
  130. struct afs_error *_e)
  131. {
  132. struct afs_addr_cursor ac = {
  133. .index = 0,
  134. };
  135. struct afs_call *call;
  136. bool in_progress = false;
  137. _enter("%s", server->name);
  138. read_lock(&server->lock);
  139. ac.alist = rcu_dereference_protected(server->addresses,
  140. lockdep_is_held(&server->lock));
  141. read_unlock(&server->lock);
  142. atomic_set(&server->probe_outstanding, ac.alist->nr_addrs);
  143. memset(&server->probe, 0, sizeof(server->probe));
  144. server->probe.rtt = UINT_MAX;
  145. for (ac.index = 0; ac.index < ac.alist->nr_addrs; ac.index++) {
  146. call = afs_vl_get_capabilities(net, &ac, key, server,
  147. server_index);
  148. if (!IS_ERR(call)) {
  149. afs_put_call(call);
  150. in_progress = true;
  151. } else {
  152. afs_prioritise_error(_e, PTR_ERR(call), ac.abort_code);
  153. afs_done_one_vl_probe(server, false);
  154. }
  155. }
  156. return in_progress;
  157. }
  158. /*
  159. * Send off probes to all unprobed servers.
  160. */
  161. int afs_send_vl_probes(struct afs_net *net, struct key *key,
  162. struct afs_vlserver_list *vllist)
  163. {
  164. struct afs_vlserver *server;
  165. struct afs_error e;
  166. bool in_progress = false;
  167. int i;
  168. e.error = 0;
  169. e.responded = false;
  170. for (i = 0; i < vllist->nr_servers; i++) {
  171. server = vllist->servers[i].server;
  172. if (test_bit(AFS_VLSERVER_FL_PROBED, &server->flags))
  173. continue;
  174. if (!test_and_set_bit_lock(AFS_VLSERVER_FL_PROBING, &server->flags) &&
  175. afs_do_probe_vlserver(net, server, key, i, &e))
  176. in_progress = true;
  177. }
  178. return in_progress ? 0 : e.error;
  179. }
  180. /*
  181. * Wait for the first as-yet untried server to respond.
  182. */
  183. int afs_wait_for_vl_probes(struct afs_vlserver_list *vllist,
  184. unsigned long untried)
  185. {
  186. struct wait_queue_entry *waits;
  187. struct afs_vlserver *server;
  188. unsigned int rtt = UINT_MAX, rtt_s;
  189. bool have_responders = false;
  190. int pref = -1, i;
  191. _enter("%u,%lx", vllist->nr_servers, untried);
  192. /* Only wait for servers that have a probe outstanding. */
  193. for (i = 0; i < vllist->nr_servers; i++) {
  194. if (test_bit(i, &untried)) {
  195. server = vllist->servers[i].server;
  196. if (!test_bit(AFS_VLSERVER_FL_PROBING, &server->flags))
  197. __clear_bit(i, &untried);
  198. if (server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED)
  199. have_responders = true;
  200. }
  201. }
  202. if (have_responders || !untried)
  203. return 0;
  204. waits = kmalloc(array_size(vllist->nr_servers, sizeof(*waits)), GFP_KERNEL);
  205. if (!waits)
  206. return -ENOMEM;
  207. for (i = 0; i < vllist->nr_servers; i++) {
  208. if (test_bit(i, &untried)) {
  209. server = vllist->servers[i].server;
  210. init_waitqueue_entry(&waits[i], current);
  211. add_wait_queue(&server->probe_wq, &waits[i]);
  212. }
  213. }
  214. for (;;) {
  215. bool still_probing = false;
  216. set_current_state(TASK_INTERRUPTIBLE);
  217. for (i = 0; i < vllist->nr_servers; i++) {
  218. if (test_bit(i, &untried)) {
  219. server = vllist->servers[i].server;
  220. if (server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED)
  221. goto stop;
  222. if (test_bit(AFS_VLSERVER_FL_PROBING, &server->flags))
  223. still_probing = true;
  224. }
  225. }
  226. if (!still_probing || signal_pending(current))
  227. goto stop;
  228. schedule();
  229. }
  230. stop:
  231. set_current_state(TASK_RUNNING);
  232. for (i = 0; i < vllist->nr_servers; i++) {
  233. if (test_bit(i, &untried)) {
  234. server = vllist->servers[i].server;
  235. rtt_s = READ_ONCE(server->rtt);
  236. if (test_bit(AFS_VLSERVER_FL_RESPONDING, &server->flags) &&
  237. rtt_s < rtt) {
  238. pref = i;
  239. rtt = rtt_s;
  240. }
  241. remove_wait_queue(&server->probe_wq, &waits[i]);
  242. }
  243. }
  244. kfree(waits);
  245. if (pref == -1 && signal_pending(current))
  246. return -ERESTARTSYS;
  247. if (pref >= 0)
  248. vllist->preferred = pref;
  249. _leave(" = 0 [%u]", pref);
  250. return 0;
  251. }