addr_list.c 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /* Server address list management
  3. *
  4. * Copyright (C) 2017 Red Hat, Inc. All Rights Reserved.
  5. * Written by David Howells (dhowells@redhat.com)
  6. */
  7. #include <linux/slab.h>
  8. #include <linux/ctype.h>
  9. #include <linux/dns_resolver.h>
  10. #include <linux/inet.h>
  11. #include <keys/rxrpc-type.h>
  12. #include "internal.h"
  13. #include "afs_fs.h"
  14. static void afs_free_addrlist(struct rcu_head *rcu)
  15. {
  16. struct afs_addr_list *alist = container_of(rcu, struct afs_addr_list, rcu);
  17. unsigned int i;
  18. for (i = 0; i < alist->nr_addrs; i++)
  19. rxrpc_kernel_put_peer(alist->addrs[i].peer);
  20. trace_afs_alist(alist->debug_id, refcount_read(&alist->usage), afs_alist_trace_free);
  21. kfree(alist);
  22. }
  23. /*
  24. * Release an address list.
  25. */
  26. void afs_put_addrlist(struct afs_addr_list *alist, enum afs_alist_trace reason)
  27. {
  28. unsigned int debug_id;
  29. bool dead;
  30. int r;
  31. if (!alist)
  32. return;
  33. debug_id = alist->debug_id;
  34. dead = __refcount_dec_and_test(&alist->usage, &r);
  35. trace_afs_alist(debug_id, r - 1, reason);
  36. if (dead)
  37. call_rcu(&alist->rcu, afs_free_addrlist);
  38. }
  39. struct afs_addr_list *afs_get_addrlist(struct afs_addr_list *alist, enum afs_alist_trace reason)
  40. {
  41. int r;
  42. if (alist) {
  43. __refcount_inc(&alist->usage, &r);
  44. trace_afs_alist(alist->debug_id, r + 1, reason);
  45. }
  46. return alist;
  47. }
  48. /*
  49. * Allocate an address list.
  50. */
  51. struct afs_addr_list *afs_alloc_addrlist(unsigned int nr)
  52. {
  53. struct afs_addr_list *alist;
  54. static atomic_t debug_id;
  55. _enter("%u", nr);
  56. if (nr > AFS_MAX_ADDRESSES)
  57. nr = AFS_MAX_ADDRESSES;
  58. alist = kzalloc(struct_size(alist, addrs, nr), GFP_KERNEL);
  59. if (!alist)
  60. return NULL;
  61. refcount_set(&alist->usage, 1);
  62. alist->max_addrs = nr;
  63. alist->debug_id = atomic_inc_return(&debug_id);
  64. trace_afs_alist(alist->debug_id, 1, afs_alist_trace_alloc);
  65. return alist;
  66. }
  67. /*
  68. * Parse a text string consisting of delimited addresses.
  69. */
  70. struct afs_vlserver_list *afs_parse_text_addrs(struct afs_net *net,
  71. const char *text, size_t len,
  72. char delim,
  73. unsigned short service,
  74. unsigned short port)
  75. {
  76. struct afs_vlserver_list *vllist;
  77. struct afs_addr_list *alist;
  78. const char *p, *end = text + len;
  79. const char *problem;
  80. unsigned int nr = 0;
  81. int ret = -ENOMEM;
  82. _enter("%*.*s,%c", (int)len, (int)len, text, delim);
  83. if (!len) {
  84. _leave(" = -EDESTADDRREQ [empty]");
  85. return ERR_PTR(-EDESTADDRREQ);
  86. }
  87. if (delim == ':' && (memchr(text, ',', len) || !memchr(text, '.', len)))
  88. delim = ',';
  89. /* Count the addresses */
  90. p = text;
  91. do {
  92. if (!*p) {
  93. problem = "nul";
  94. goto inval;
  95. }
  96. if (*p == delim)
  97. continue;
  98. nr++;
  99. if (*p == '[') {
  100. p++;
  101. if (p == end) {
  102. problem = "brace1";
  103. goto inval;
  104. }
  105. p = memchr(p, ']', end - p);
  106. if (!p) {
  107. problem = "brace2";
  108. goto inval;
  109. }
  110. p++;
  111. if (p >= end)
  112. break;
  113. }
  114. p = memchr(p, delim, end - p);
  115. if (!p)
  116. break;
  117. p++;
  118. } while (p < end);
  119. _debug("%u/%u addresses", nr, AFS_MAX_ADDRESSES);
  120. vllist = afs_alloc_vlserver_list(1);
  121. if (!vllist)
  122. return ERR_PTR(-ENOMEM);
  123. vllist->nr_servers = 1;
  124. vllist->servers[0].server = afs_alloc_vlserver("<dummy>", 7, AFS_VL_PORT);
  125. if (!vllist->servers[0].server)
  126. goto error_vl;
  127. alist = afs_alloc_addrlist(nr);
  128. if (!alist)
  129. goto error;
  130. /* Extract the addresses */
  131. p = text;
  132. do {
  133. const char *q, *stop;
  134. unsigned int xport = port;
  135. __be32 x[4];
  136. int family;
  137. if (*p == delim) {
  138. p++;
  139. continue;
  140. }
  141. if (*p == '[') {
  142. p++;
  143. q = memchr(p, ']', end - p);
  144. } else {
  145. for (q = p; q < end; q++)
  146. if (*q == '+' || *q == delim)
  147. break;
  148. }
  149. if (in4_pton(p, q - p, (u8 *)&x[0], -1, &stop)) {
  150. family = AF_INET;
  151. } else if (in6_pton(p, q - p, (u8 *)x, -1, &stop)) {
  152. family = AF_INET6;
  153. } else {
  154. problem = "family";
  155. goto bad_address;
  156. }
  157. p = q;
  158. if (stop != p) {
  159. problem = "nostop";
  160. goto bad_address;
  161. }
  162. if (q < end && *q == ']')
  163. p++;
  164. if (p < end) {
  165. if (*p == '+') {
  166. /* Port number specification "+1234" */
  167. xport = 0;
  168. p++;
  169. if (p >= end || !isdigit(*p)) {
  170. problem = "port";
  171. goto bad_address;
  172. }
  173. do {
  174. xport *= 10;
  175. xport += *p - '0';
  176. if (xport > 65535) {
  177. problem = "pval";
  178. goto bad_address;
  179. }
  180. p++;
  181. } while (p < end && isdigit(*p));
  182. } else if (*p == delim) {
  183. p++;
  184. } else {
  185. problem = "weird";
  186. goto bad_address;
  187. }
  188. }
  189. if (family == AF_INET)
  190. ret = afs_merge_fs_addr4(net, alist, x[0], xport);
  191. else
  192. ret = afs_merge_fs_addr6(net, alist, x, xport);
  193. if (ret < 0)
  194. goto error;
  195. } while (p < end);
  196. rcu_assign_pointer(vllist->servers[0].server->addresses, alist);
  197. _leave(" = [nr %u]", alist->nr_addrs);
  198. return vllist;
  199. inval:
  200. _leave(" = -EINVAL [%s %zu %*.*s]",
  201. problem, p - text, (int)len, (int)len, text);
  202. return ERR_PTR(-EINVAL);
  203. bad_address:
  204. _leave(" = -EINVAL [%s %zu %*.*s]",
  205. problem, p - text, (int)len, (int)len, text);
  206. ret = -EINVAL;
  207. error:
  208. afs_put_addrlist(alist, afs_alist_trace_put_parse_error);
  209. error_vl:
  210. afs_put_vlserverlist(net, vllist);
  211. return ERR_PTR(ret);
  212. }
  213. /*
  214. * Perform a DNS query for VL servers and build a up an address list.
  215. */
  216. struct afs_vlserver_list *afs_dns_query(struct afs_cell *cell, time64_t *_expiry)
  217. {
  218. struct afs_vlserver_list *vllist;
  219. char *result = NULL;
  220. int ret;
  221. _enter("%s", cell->name);
  222. ret = dns_query(cell->net->net, "afsdb", cell->name, cell->name_len,
  223. "srv=1", &result, _expiry, true);
  224. if (ret < 0) {
  225. _leave(" = %d [dns]", ret);
  226. return ERR_PTR(ret);
  227. }
  228. if (*_expiry == 0)
  229. *_expiry = ktime_get_real_seconds() + 60;
  230. if (ret > 1 && result[0] == 0)
  231. vllist = afs_extract_vlserver_list(cell, result, ret);
  232. else
  233. vllist = afs_parse_text_addrs(cell->net, result, ret, ',',
  234. VL_SERVICE, AFS_VL_PORT);
  235. kfree(result);
  236. if (IS_ERR(vllist) && vllist != ERR_PTR(-ENOMEM))
  237. pr_err("Failed to parse DNS data %ld\n", PTR_ERR(vllist));
  238. return vllist;
  239. }
  240. /*
  241. * Merge an IPv4 entry into a fileserver address list.
  242. */
  243. int afs_merge_fs_addr4(struct afs_net *net, struct afs_addr_list *alist,
  244. __be32 xdr, u16 port)
  245. {
  246. struct sockaddr_rxrpc srx;
  247. struct rxrpc_peer *peer;
  248. int i;
  249. if (alist->nr_addrs >= alist->max_addrs)
  250. return 0;
  251. srx.srx_family = AF_RXRPC;
  252. srx.transport_type = SOCK_DGRAM;
  253. srx.transport_len = sizeof(srx.transport.sin);
  254. srx.transport.sin.sin_family = AF_INET;
  255. srx.transport.sin.sin_port = htons(port);
  256. srx.transport.sin.sin_addr.s_addr = xdr;
  257. peer = rxrpc_kernel_lookup_peer(net->socket, &srx, GFP_KERNEL);
  258. if (!peer)
  259. return -ENOMEM;
  260. for (i = 0; i < alist->nr_ipv4; i++) {
  261. if (peer == alist->addrs[i].peer) {
  262. rxrpc_kernel_put_peer(peer);
  263. return 0;
  264. }
  265. if (peer <= alist->addrs[i].peer)
  266. break;
  267. }
  268. if (i < alist->nr_addrs)
  269. memmove(alist->addrs + i + 1,
  270. alist->addrs + i,
  271. sizeof(alist->addrs[0]) * (alist->nr_addrs - i));
  272. alist->addrs[i].peer = peer;
  273. alist->nr_ipv4++;
  274. alist->nr_addrs++;
  275. return 0;
  276. }
  277. /*
  278. * Merge an IPv6 entry into a fileserver address list.
  279. */
  280. int afs_merge_fs_addr6(struct afs_net *net, struct afs_addr_list *alist,
  281. __be32 *xdr, u16 port)
  282. {
  283. struct sockaddr_rxrpc srx;
  284. struct rxrpc_peer *peer;
  285. int i;
  286. if (alist->nr_addrs >= alist->max_addrs)
  287. return 0;
  288. srx.srx_family = AF_RXRPC;
  289. srx.transport_type = SOCK_DGRAM;
  290. srx.transport_len = sizeof(srx.transport.sin6);
  291. srx.transport.sin6.sin6_family = AF_INET6;
  292. srx.transport.sin6.sin6_port = htons(port);
  293. memcpy(&srx.transport.sin6.sin6_addr, xdr, 16);
  294. peer = rxrpc_kernel_lookup_peer(net->socket, &srx, GFP_KERNEL);
  295. if (!peer)
  296. return -ENOMEM;
  297. for (i = alist->nr_ipv4; i < alist->nr_addrs; i++) {
  298. if (peer == alist->addrs[i].peer) {
  299. rxrpc_kernel_put_peer(peer);
  300. return 0;
  301. }
  302. if (peer <= alist->addrs[i].peer)
  303. break;
  304. }
  305. if (i < alist->nr_addrs)
  306. memmove(alist->addrs + i + 1,
  307. alist->addrs + i,
  308. sizeof(alist->addrs[0]) * (alist->nr_addrs - i));
  309. alist->addrs[i].peer = peer;
  310. alist->nr_addrs++;
  311. return 0;
  312. }