vl_probe.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310
  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 (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_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->vl_probe;
  43. struct afs_vlserver *server = call->vlserver;
  44. struct afs_address *addr = &alist->addrs[call->probe_index];
  45. unsigned int server_index = call->server_index;
  46. unsigned int rtt_us = 0;
  47. unsigned int index = call->probe_index;
  48. bool have_result = false;
  49. int ret = call->error;
  50. _enter("%s,%u,%u,%d,%d", server->name, server_index, index, ret, call->abort_code);
  51. spin_lock(&server->probe_lock);
  52. switch (ret) {
  53. case 0:
  54. server->probe.error = 0;
  55. goto responded;
  56. case -ECONNABORTED:
  57. if (!(server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED)) {
  58. server->probe.abort_code = call->abort_code;
  59. server->probe.error = ret;
  60. }
  61. goto responded;
  62. case -ENOMEM:
  63. case -ENONET:
  64. case -EKEYEXPIRED:
  65. case -EKEYREVOKED:
  66. case -EKEYREJECTED:
  67. server->probe.flags |= AFS_VLSERVER_PROBE_LOCAL_FAILURE;
  68. if (server->probe.error == 0)
  69. server->probe.error = ret;
  70. trace_afs_io_error(call->debug_id, ret, afs_io_error_vl_probe_fail);
  71. goto out;
  72. case -ECONNRESET: /* Responded, but call expired. */
  73. case -ERFKILL:
  74. case -EADDRNOTAVAIL:
  75. case -ENETUNREACH:
  76. case -EHOSTUNREACH:
  77. case -EHOSTDOWN:
  78. case -ECONNREFUSED:
  79. case -ETIMEDOUT:
  80. case -ETIME:
  81. default:
  82. clear_bit(index, &alist->responded);
  83. set_bit(index, &alist->probe_failed);
  84. if (!(server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED) &&
  85. (server->probe.error == 0 ||
  86. server->probe.error == -ETIMEDOUT ||
  87. server->probe.error == -ETIME))
  88. server->probe.error = ret;
  89. trace_afs_io_error(call->debug_id, ret, afs_io_error_vl_probe_fail);
  90. goto out;
  91. }
  92. responded:
  93. set_bit(index, &alist->responded);
  94. clear_bit(index, &alist->probe_failed);
  95. if (call->service_id == YFS_VL_SERVICE) {
  96. server->probe.flags |= AFS_VLSERVER_PROBE_IS_YFS;
  97. set_bit(AFS_VLSERVER_FL_IS_YFS, &server->flags);
  98. server->service_id = call->service_id;
  99. } else {
  100. server->probe.flags |= AFS_VLSERVER_PROBE_NOT_YFS;
  101. if (!(server->probe.flags & AFS_VLSERVER_PROBE_IS_YFS)) {
  102. clear_bit(AFS_VLSERVER_FL_IS_YFS, &server->flags);
  103. server->service_id = call->service_id;
  104. }
  105. }
  106. rtt_us = rxrpc_kernel_get_srtt(addr->peer);
  107. if (rtt_us < server->probe.rtt) {
  108. server->probe.rtt = rtt_us;
  109. server->rtt = rtt_us;
  110. alist->preferred = index;
  111. }
  112. smp_wmb(); /* Set rtt before responded. */
  113. server->probe.flags |= AFS_VLSERVER_PROBE_RESPONDED;
  114. set_bit(AFS_VLSERVER_FL_PROBED, &server->flags);
  115. set_bit(AFS_VLSERVER_FL_RESPONDING, &server->flags);
  116. have_result = true;
  117. out:
  118. spin_unlock(&server->probe_lock);
  119. trace_afs_vl_probe(server, false, alist, index, call->error, call->abort_code, rtt_us);
  120. _debug("probe [%u][%u] %pISpc rtt=%d ret=%d",
  121. server_index, index, rxrpc_kernel_remote_addr(addr->peer),
  122. rtt_us, ret);
  123. afs_done_one_vl_probe(server, have_result);
  124. }
  125. /*
  126. * Probe all of a vlserver's addresses to find out the best route and to
  127. * query its capabilities.
  128. */
  129. static bool afs_do_probe_vlserver(struct afs_net *net,
  130. struct afs_vlserver *server,
  131. struct key *key,
  132. unsigned int server_index,
  133. struct afs_error *_e)
  134. {
  135. struct afs_addr_list *alist;
  136. struct afs_call *call;
  137. unsigned long unprobed;
  138. unsigned int index, i;
  139. bool in_progress = false;
  140. int best_prio;
  141. _enter("%s", server->name);
  142. read_lock(&server->lock);
  143. alist = rcu_dereference_protected(server->addresses,
  144. lockdep_is_held(&server->lock));
  145. afs_get_addrlist(alist, afs_alist_trace_get_vlprobe);
  146. read_unlock(&server->lock);
  147. atomic_set(&server->probe_outstanding, alist->nr_addrs);
  148. memset(&server->probe, 0, sizeof(server->probe));
  149. server->probe.rtt = UINT_MAX;
  150. unprobed = (1UL << alist->nr_addrs) - 1;
  151. while (unprobed) {
  152. best_prio = -1;
  153. index = 0;
  154. for (i = 0; i < alist->nr_addrs; i++) {
  155. if (test_bit(i, &unprobed) &&
  156. alist->addrs[i].prio > best_prio) {
  157. index = i;
  158. best_prio = alist->addrs[i].prio;
  159. }
  160. }
  161. __clear_bit(index, &unprobed);
  162. trace_afs_vl_probe(server, true, alist, index, 0, 0, 0);
  163. call = afs_vl_get_capabilities(net, alist, index, key, server,
  164. server_index);
  165. if (!IS_ERR(call)) {
  166. afs_prioritise_error(_e, call->error, call->abort_code);
  167. afs_put_call(call);
  168. in_progress = true;
  169. } else {
  170. afs_prioritise_error(_e, PTR_ERR(call), 0);
  171. afs_done_one_vl_probe(server, false);
  172. }
  173. }
  174. afs_put_addrlist(alist, afs_alist_trace_put_vlprobe);
  175. return in_progress;
  176. }
  177. /*
  178. * Send off probes to all unprobed servers.
  179. */
  180. int afs_send_vl_probes(struct afs_net *net, struct key *key,
  181. struct afs_vlserver_list *vllist)
  182. {
  183. struct afs_vlserver *server;
  184. struct afs_error e = {};
  185. bool in_progress = false;
  186. int i;
  187. for (i = 0; i < vllist->nr_servers; i++) {
  188. server = vllist->servers[i].server;
  189. if (test_bit(AFS_VLSERVER_FL_PROBED, &server->flags))
  190. continue;
  191. if (!test_and_set_bit_lock(AFS_VLSERVER_FL_PROBING, &server->flags) &&
  192. afs_do_probe_vlserver(net, server, key, i, &e))
  193. in_progress = true;
  194. }
  195. return in_progress ? 0 : e.error;
  196. }
  197. /*
  198. * Wait for the first as-yet untried server to respond.
  199. */
  200. int afs_wait_for_vl_probes(struct afs_vlserver_list *vllist,
  201. unsigned long untried)
  202. {
  203. struct wait_queue_entry *waits;
  204. struct afs_vlserver *server;
  205. unsigned int rtt = UINT_MAX, rtt_s;
  206. bool have_responders = false;
  207. int pref = -1, i;
  208. _enter("%u,%lx", vllist->nr_servers, untried);
  209. /* Only wait for servers that have a probe outstanding. */
  210. for (i = 0; i < vllist->nr_servers; i++) {
  211. if (test_bit(i, &untried)) {
  212. server = vllist->servers[i].server;
  213. if (!test_bit(AFS_VLSERVER_FL_PROBING, &server->flags))
  214. __clear_bit(i, &untried);
  215. if (server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED)
  216. have_responders = true;
  217. }
  218. }
  219. if (have_responders || !untried)
  220. return 0;
  221. waits = kmalloc(array_size(vllist->nr_servers, sizeof(*waits)), GFP_KERNEL);
  222. if (!waits)
  223. return -ENOMEM;
  224. for (i = 0; i < vllist->nr_servers; i++) {
  225. if (test_bit(i, &untried)) {
  226. server = vllist->servers[i].server;
  227. init_waitqueue_entry(&waits[i], current);
  228. add_wait_queue(&server->probe_wq, &waits[i]);
  229. }
  230. }
  231. for (;;) {
  232. bool still_probing = false;
  233. set_current_state(TASK_INTERRUPTIBLE);
  234. for (i = 0; i < vllist->nr_servers; i++) {
  235. if (test_bit(i, &untried)) {
  236. server = vllist->servers[i].server;
  237. if (server->probe.flags & AFS_VLSERVER_PROBE_RESPONDED)
  238. goto stop;
  239. if (test_bit(AFS_VLSERVER_FL_PROBING, &server->flags))
  240. still_probing = true;
  241. }
  242. }
  243. if (!still_probing || signal_pending(current))
  244. goto stop;
  245. schedule();
  246. }
  247. stop:
  248. set_current_state(TASK_RUNNING);
  249. for (i = 0; i < vllist->nr_servers; i++) {
  250. if (test_bit(i, &untried)) {
  251. server = vllist->servers[i].server;
  252. rtt_s = READ_ONCE(server->rtt);
  253. if (test_bit(AFS_VLSERVER_FL_RESPONDING, &server->flags) &&
  254. rtt_s < rtt) {
  255. pref = i;
  256. rtt = rtt_s;
  257. }
  258. remove_wait_queue(&server->probe_wq, &waits[i]);
  259. }
  260. }
  261. kfree(waits);
  262. if (pref == -1 && signal_pending(current))
  263. return -ERESTARTSYS;
  264. if (pref >= 0)
  265. vllist->preferred = pref;
  266. _leave(" = 0 [%u]", pref);
  267. return 0;
  268. }