addr_list.c 8.1 KB
Newer Older
D
David Howells 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
/* Server address list management
 *
 * Copyright (C) 2017 Red Hat, Inc. All Rights Reserved.
 * Written by David Howells (dhowells@redhat.com)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public Licence
 * as published by the Free Software Foundation; either version
 * 2 of the Licence, or (at your option) any later version.
 */

#include <linux/slab.h>
#include <linux/ctype.h>
#include <linux/dns_resolver.h>
#include <linux/inet.h>
#include <keys/rxrpc-type.h>
#include "internal.h"
#include "afs_fs.h"

/*
 * Release an address list.
 */
void afs_put_addrlist(struct afs_addr_list *alist)
{
	if (alist && refcount_dec_and_test(&alist->usage))
		call_rcu(&alist->rcu, (rcu_callback_t)kfree);
}

/*
 * Allocate an address list.
 */
struct afs_addr_list *afs_alloc_addrlist(unsigned int nr,
					 unsigned short service,
					 unsigned short port)
{
	struct afs_addr_list *alist;
	unsigned int i;

	_enter("%u,%u,%u", nr, service, port);

41 42 43
	if (nr > AFS_MAX_ADDRESSES)
		nr = AFS_MAX_ADDRESSES;

44
	alist = kzalloc(struct_size(alist, addrs, nr), GFP_KERNEL);
D
David Howells 已提交
45 46 47 48
	if (!alist)
		return NULL;

	refcount_set(&alist->usage, 1);
49
	alist->max_addrs = nr;
D
David Howells 已提交
50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118

	for (i = 0; i < nr; i++) {
		struct sockaddr_rxrpc *srx = &alist->addrs[i];
		srx->srx_family			= AF_RXRPC;
		srx->srx_service		= service;
		srx->transport_type		= SOCK_DGRAM;
		srx->transport_len		= sizeof(srx->transport.sin6);
		srx->transport.sin6.sin6_family	= AF_INET6;
		srx->transport.sin6.sin6_port	= htons(port);
	}

	return alist;
}

/*
 * Parse a text string consisting of delimited addresses.
 */
struct afs_addr_list *afs_parse_text_addrs(const char *text, size_t len,
					   char delim,
					   unsigned short service,
					   unsigned short port)
{
	struct afs_addr_list *alist;
	const char *p, *end = text + len;
	unsigned int nr = 0;

	_enter("%*.*s,%c", (int)len, (int)len, text, delim);

	if (!len)
		return ERR_PTR(-EDESTADDRREQ);

	if (delim == ':' && (memchr(text, ',', len) || !memchr(text, '.', len)))
		delim = ',';

	/* Count the addresses */
	p = text;
	do {
		if (!*p)
			return ERR_PTR(-EINVAL);
		if (*p == delim)
			continue;
		nr++;
		if (*p == '[') {
			p++;
			if (p == end)
				return ERR_PTR(-EINVAL);
			p = memchr(p, ']', end - p);
			if (!p)
				return ERR_PTR(-EINVAL);
			p++;
			if (p >= end)
				break;
		}

		p = memchr(p, delim, end - p);
		if (!p)
			break;
		p++;
	} while (p < end);

	_debug("%u/%u addresses", nr, AFS_MAX_ADDRESSES);

	alist = afs_alloc_addrlist(nr, service, port);
	if (!alist)
		return ERR_PTR(-ENOMEM);

	/* Extract the addresses */
	p = text;
	do {
D
David Howells 已提交
119
		const char *q, *stop;
120 121 122
		unsigned int xport = port;
		__be32 x[4];
		int family;
D
David Howells 已提交
123 124 125 126 127 128 129 130

		if (*p == delim) {
			p++;
			continue;
		}

		if (*p == '[') {
			p++;
D
David Howells 已提交
131 132 133 134 135
			q = memchr(p, ']', end - p);
		} else {
			for (q = p; q < end; q++)
				if (*q == '+' || *q == delim)
					break;
D
David Howells 已提交
136 137
		}

138 139 140 141 142
		if (in4_pton(p, q - p, (u8 *)&x[0], -1, &stop))
			family = AF_INET;
		else if (in6_pton(p, q - p, (u8 *)x, -1, &stop))
			family = AF_INET6;
		else
D
David Howells 已提交
143 144
			goto bad_address;

D
David Howells 已提交
145 146 147 148 149
		if (stop != q)
			goto bad_address;

		p = q;
		if (q < end && *q == ']')
D
David Howells 已提交
150 151 152 153 154
			p++;

		if (p < end) {
			if (*p == '+') {
				/* Port number specification "+1234" */
155
				xport = 0;
D
David Howells 已提交
156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172
				p++;
				if (p >= end || !isdigit(*p))
					goto bad_address;
				do {
					xport *= 10;
					xport += *p - '0';
					if (xport > 65535)
						goto bad_address;
					p++;
				} while (p < end && isdigit(*p));
			} else if (*p == delim) {
				p++;
			} else {
				goto bad_address;
			}
		}

173 174 175 176 177 178
		if (family == AF_INET)
			afs_merge_fs_addr4(alist, x[0], xport);
		else
			afs_merge_fs_addr6(alist, x, xport);

	} while (p < end);
D
David Howells 已提交
179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212

	_leave(" = [nr %u]", alist->nr_addrs);
	return alist;

bad_address:
	kfree(alist);
	return ERR_PTR(-EINVAL);
}

/*
 * Compare old and new address lists to see if there's been any change.
 * - How to do this in better than O(Nlog(N)) time?
 *   - We don't really want to sort the address list, but would rather take the
 *     list as we got it so as not to undo record rotation by the DNS server.
 */
#if 0
static int afs_cmp_addr_list(const struct afs_addr_list *a1,
			     const struct afs_addr_list *a2)
{
}
#endif

/*
 * Perform a DNS query for VL servers and build a up an address list.
 */
struct afs_addr_list *afs_dns_query(struct afs_cell *cell, time64_t *_expiry)
{
	struct afs_addr_list *alist;
	char *vllist = NULL;
	int ret;

	_enter("%s", cell->name);

	ret = dns_query("afsdb", cell->name, cell->name_len,
D
David Howells 已提交
213
			"", &vllist, _expiry);
D
David Howells 已提交
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
	if (ret < 0)
		return ERR_PTR(ret);

	alist = afs_parse_text_addrs(vllist, strlen(vllist), ',',
				     VL_SERVICE, AFS_VL_PORT);
	if (IS_ERR(alist)) {
		kfree(vllist);
		if (alist != ERR_PTR(-ENOMEM))
			pr_err("Failed to parse DNS data\n");
		return alist;
	}

	kfree(vllist);
	return alist;
}

230 231 232
/*
 * Merge an IPv4 entry into a fileserver address list.
 */
233
void afs_merge_fs_addr4(struct afs_addr_list *alist, __be32 xdr, u16 port)
234
{
235 236
	struct sockaddr_in6 *p;
	u32 addr = ntohl(xdr);
237 238
	int i;

239 240 241
	if (alist->nr_addrs >= alist->max_addrs)
		return;

242
	for (i = 0; i < alist->nr_ipv4; i++) {
243 244 245 246 247
		struct sockaddr_in6 *a = &alist->addrs[i].transport.sin6;
		u32 a_addr = ntohl(a->sin6_addr.s6_addr32[3]);
		u16 a_port = ntohs(a->sin6_port);

		if (addr == a_addr && port == a_port)
248
			return;
249
		if (addr == a_addr && port < a_port)
250
			break;
251
		if (addr < a_addr)
252 253 254 255 256 257 258 259
			break;
	}

	if (i < alist->nr_addrs)
		memmove(alist->addrs + i + 1,
			alist->addrs + i,
			sizeof(alist->addrs[0]) * (alist->nr_addrs - i));

260 261 262 263 264 265
	p = &alist->addrs[i].transport.sin6;
	p->sin6_port		  = htons(port);
	p->sin6_addr.s6_addr32[0] = 0;
	p->sin6_addr.s6_addr32[1] = 0;
	p->sin6_addr.s6_addr32[2] = htonl(0xffff);
	p->sin6_addr.s6_addr32[3] = xdr;
266 267 268 269
	alist->nr_ipv4++;
	alist->nr_addrs++;
}

270 271 272 273 274
/*
 * Merge an IPv6 entry into a fileserver address list.
 */
void afs_merge_fs_addr6(struct afs_addr_list *alist, __be32 *xdr, u16 port)
{
275
	struct sockaddr_in6 *p;
276 277
	int i, diff;

278 279 280
	if (alist->nr_addrs >= alist->max_addrs)
		return;

281
	for (i = alist->nr_ipv4; i < alist->nr_addrs; i++) {
282 283 284
		struct sockaddr_in6 *a = &alist->addrs[i].transport.sin6;
		u16 a_port = ntohs(a->sin6_port);

285
		diff = memcmp(xdr, &a->sin6_addr, 16);
286
		if (diff == 0 && port == a_port)
287
			return;
288
		if (diff == 0 && port < a_port)
289 290 291 292 293 294 295 296 297 298
			break;
		if (diff < 0)
			break;
	}

	if (i < alist->nr_addrs)
		memmove(alist->addrs + i + 1,
			alist->addrs + i,
			sizeof(alist->addrs[0]) * (alist->nr_addrs - i));

299 300 301
	p = &alist->addrs[i].transport.sin6;
	p->sin6_port = htons(port);
	memcpy(&p->sin6_addr, xdr, 16);
302 303 304
	alist->nr_addrs++;
}

D
David Howells 已提交
305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336
/*
 * Get an address to try.
 */
bool afs_iterate_addresses(struct afs_addr_cursor *ac)
{
	_enter("%hu+%hd", ac->start, (short)ac->index);

	if (!ac->alist)
		return false;

	if (ac->begun) {
		ac->index++;
		if (ac->index == ac->alist->nr_addrs)
			ac->index = 0;

		if (ac->index == ac->start) {
			ac->error = -EDESTADDRREQ;
			return false;
		}
	}

	ac->begun = true;
	ac->responded = false;
	ac->addr = &ac->alist->addrs[ac->index];
	return true;
}

/*
 * Release an address list cursor.
 */
int afs_end_cursor(struct afs_addr_cursor *ac)
{
337 338 339 340 341 342 343 344
	struct afs_addr_list *alist;

	alist = ac->alist;
	if (alist) {
		if (ac->responded && ac->index != ac->start)
			WRITE_ONCE(alist->index, ac->index);
		afs_put_addrlist(alist);
	}
D
David Howells 已提交
345

346
	ac->addr = NULL;
D
David Howells 已提交
347
	ac->alist = NULL;
348
	ac->begun = false;
D
David Howells 已提交
349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390
	return ac->error;
}

/*
 * Set the address cursor for iterating over VL servers.
 */
int afs_set_vl_cursor(struct afs_addr_cursor *ac, struct afs_cell *cell)
{
	struct afs_addr_list *alist;
	int ret;

	if (!rcu_access_pointer(cell->vl_addrs)) {
		ret = wait_on_bit(&cell->flags, AFS_CELL_FL_NO_LOOKUP_YET,
				  TASK_INTERRUPTIBLE);
		if (ret < 0)
			return ret;

		if (!rcu_access_pointer(cell->vl_addrs) &&
		    ktime_get_real_seconds() < cell->dns_expiry)
			return cell->error;
	}

	read_lock(&cell->vl_addrs_lock);
	alist = rcu_dereference_protected(cell->vl_addrs,
					  lockdep_is_held(&cell->vl_addrs_lock));
	if (alist->nr_addrs > 0)
		afs_get_addrlist(alist);
	else
		alist = NULL;
	read_unlock(&cell->vl_addrs_lock);

	if (!alist)
		return -EDESTADDRREQ;

	ac->alist = alist;
	ac->addr = NULL;
	ac->start = READ_ONCE(alist->index);
	ac->index = ac->start;
	ac->error = 0;
	ac->begun = false;
	return 0;
}