msg.c 16.1 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/msg.c: TIPC message header routines
3
 *
4
 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB
5
 * Copyright (c) 2005, 2010-2011, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the names of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
P
Per Liden 已提交
34 35 36
 * POSSIBILITY OF SUCH DAMAGE.
 */

37
#include <net/sock.h>
P
Per Liden 已提交
38 39
#include "core.h"
#include "msg.h"
40 41
#include "addr.h"
#include "name_table.h"
P
Per Liden 已提交
42

43 44
#define MAX_FORWARD_SIZE 1024

45
static unsigned int align(unsigned int i)
46
{
47
	return (i + 3) & ~3u;
48 49
}

Y
Ying Xue 已提交
50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
/**
 * tipc_buf_acquire - creates a TIPC message buffer
 * @size: message size (including TIPC header)
 *
 * Returns a new buffer with data pointers set to the specified size.
 *
 * NOTE: Headroom is reserved to allow prepending of a data link header.
 *       There may also be unrequested tailroom present at the buffer's end.
 */
struct sk_buff *tipc_buf_acquire(u32 size)
{
	struct sk_buff *skb;
	unsigned int buf_size = (BUF_HEADROOM + size + 3) & ~3u;

	skb = alloc_skb_fclone(buf_size, GFP_ATOMIC);
	if (skb) {
		skb_reserve(skb, BUF_HEADROOM);
		skb_put(skb, size);
		skb->next = NULL;
	}
	return skb;
}

73 74
void tipc_msg_init(u32 own_node, struct tipc_msg *m, u32 user, u32 type,
		   u32 hsize, u32 dnode)
75 76 77 78 79 80
{
	memset(m, 0, hsize);
	msg_set_version(m);
	msg_set_user(m, user);
	msg_set_hdr_sz(m, hsize);
	msg_set_size(m, hsize);
81
	msg_set_prevnode(m, own_node);
82
	msg_set_type(m, type);
83
	if (hsize > SHORT_H_SIZE) {
84 85
		msg_set_orignode(m, own_node);
		msg_set_destnode(m, dnode);
86 87 88
	}
}

89
struct sk_buff *tipc_msg_create(uint user, uint type,
90 91
				uint hdr_sz, uint data_sz, u32 dnode,
				u32 onode, u32 dport, u32 oport, int errcode)
92 93 94 95 96 97 98 99 100
{
	struct tipc_msg *msg;
	struct sk_buff *buf;

	buf = tipc_buf_acquire(hdr_sz + data_sz);
	if (unlikely(!buf))
		return NULL;

	msg = buf_msg(buf);
101
	tipc_msg_init(onode, msg, user, type, hdr_sz, dnode);
102 103 104 105 106 107 108 109 110
	msg_set_size(msg, hdr_sz + data_sz);
	msg_set_origport(msg, oport);
	msg_set_destport(msg, dport);
	msg_set_errcode(msg, errcode);
	if (hdr_sz > SHORT_H_SIZE) {
		msg_set_orignode(msg, onode);
		msg_set_destnode(msg, dnode);
	}
	return buf;
111 112
}

113
/* tipc_buf_append(): Append a buffer to the fragment list of another buffer
114 115 116
 * @*headbuf: in:  NULL for first frag, otherwise value returned from prev call
 *            out: set when successful non-complete reassembly, otherwise NULL
 * @*buf:     in:  the buffer to append. Always defined
S
stephen hemminger 已提交
117
 *            out: head buf after successful complete reassembly, otherwise NULL
118
 * Returns 1 when reassembly complete, otherwise 0
119 120 121 122 123 124
 */
int tipc_buf_append(struct sk_buff **headbuf, struct sk_buff **buf)
{
	struct sk_buff *head = *headbuf;
	struct sk_buff *frag = *buf;
	struct sk_buff *tail;
125 126
	struct tipc_msg *msg;
	u32 fragid;
127
	int delta;
128
	bool headstolen;
129

130 131 132 133 134 135
	if (!frag)
		goto err;

	msg = buf_msg(frag);
	fragid = msg_type(msg);
	frag->next = NULL;
136 137 138
	skb_pull(frag, msg_hdr_sz(msg));

	if (fragid == FIRST_FRAGMENT) {
139 140 141 142
		if (unlikely(head))
			goto err;
		if (unlikely(skb_unclone(frag, GFP_ATOMIC)))
			goto err;
143 144
		head = *headbuf = frag;
		skb_frag_list_init(head);
145
		TIPC_SKB_CB(head)->tail = NULL;
146
		*buf = NULL;
147 148
		return 0;
	}
149

150
	if (!head)
151 152
		goto err;

153 154 155
	if (skb_try_coalesce(head, frag, &headstolen, &delta)) {
		kfree_skb_partial(frag, headstolen);
	} else {
156
		tail = TIPC_SKB_CB(head)->tail;
157 158 159 160 161 162 163 164 165
		if (!skb_has_frag_list(head))
			skb_shinfo(head)->frag_list = frag;
		else
			tail->next = frag;
		head->truesize += frag->truesize;
		head->data_len += frag->len;
		head->len += frag->len;
		TIPC_SKB_CB(head)->tail = frag;
	}
166

167
	if (fragid == LAST_FRAGMENT) {
168 169 170
		TIPC_SKB_CB(head)->validated = false;
		if (unlikely(!tipc_msg_validate(head)))
			goto err;
171 172 173 174 175 176 177
		*buf = head;
		TIPC_SKB_CB(head)->tail = NULL;
		*headbuf = NULL;
		return 1;
	}
	*buf = NULL;
	return 0;
178
err:
179 180
	pr_warn_ratelimited("Unable to build fragment list\n");
	kfree_skb(*buf);
181 182
	kfree_skb(*headbuf);
	*buf = *headbuf = NULL;
183 184
	return 0;
}
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 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227
/* tipc_msg_validate - validate basic format of received message
 *
 * This routine ensures a TIPC message has an acceptable header, and at least
 * as much data as the header indicates it should.  The routine also ensures
 * that the entire message header is stored in the main fragment of the message
 * buffer, to simplify future access to message header fields.
 *
 * Note: Having extra info present in the message header or data areas is OK.
 * TIPC will ignore the excess, under the assumption that it is optional info
 * introduced by a later release of the protocol.
 */
bool tipc_msg_validate(struct sk_buff *skb)
{
	struct tipc_msg *msg;
	int msz, hsz;

	if (unlikely(TIPC_SKB_CB(skb)->validated))
		return true;
	if (unlikely(!pskb_may_pull(skb, MIN_H_SIZE)))
		return false;

	hsz = msg_hdr_sz(buf_msg(skb));
	if (unlikely(hsz < MIN_H_SIZE) || (hsz > MAX_H_SIZE))
		return false;
	if (unlikely(!pskb_may_pull(skb, hsz)))
		return false;

	msg = buf_msg(skb);
	if (unlikely(msg_version(msg) != TIPC_VERSION))
		return false;

	msz = msg_size(msg);
	if (unlikely(msz < hsz))
		return false;
	if (unlikely((msz - hsz) > TIPC_MAX_USER_MSG_SIZE))
		return false;
	if (unlikely(skb->len < msz))
		return false;

	TIPC_SKB_CB(skb)->validated = true;
	return true;
}
228 229

/**
230
 * tipc_msg_build - create buffer chain containing specified header and data
231
 * @mhdr: Message header, to be prepended to data
232
 * @m: User message
233 234
 * @dsz: Total length of user data
 * @pktmax: Max packet size that can be used
235 236
 * @list: Buffer or chain of buffers to be returned to caller
 *
237 238
 * Returns message data size or errno: -ENOMEM, -EFAULT
 */
239
int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m,
240
		   int offset, int dsz, int pktmax, struct sk_buff_head *list)
241 242 243 244 245 246 247 248
{
	int mhsz = msg_hdr_sz(mhdr);
	int msz = mhsz + dsz;
	int pktno = 1;
	int pktsz;
	int pktrem = pktmax;
	int drem = dsz;
	struct tipc_msg pkthdr;
249
	struct sk_buff *skb;
250 251
	char *pktpos;
	int rc;
252

253 254 255 256
	msg_set_size(mhdr, msz);

	/* No fragmentation needed? */
	if (likely(msz <= pktmax)) {
257 258
		skb = tipc_buf_acquire(msz);
		if (unlikely(!skb))
259
			return -ENOMEM;
260
		skb_orphan(skb);
261 262 263
		__skb_queue_tail(list, skb);
		skb_copy_to_linear_data(skb, mhdr, mhsz);
		pktpos = skb->data + mhsz;
A
Al Viro 已提交
264
		if (copy_from_iter(pktpos, dsz, &m->msg_iter) == dsz)
265 266 267 268 269 270
			return dsz;
		rc = -EFAULT;
		goto error;
	}

	/* Prepare reusable fragment header */
271 272
	tipc_msg_init(msg_prevnode(mhdr), &pkthdr, MSG_FRAGMENTER,
		      FIRST_FRAGMENT, INT_H_SIZE, msg_destnode(mhdr));
273 274
	msg_set_size(&pkthdr, pktmax);
	msg_set_fragm_no(&pkthdr, pktno);
275
	msg_set_importance(&pkthdr, msg_importance(mhdr));
276 277

	/* Prepare first fragment */
278 279
	skb = tipc_buf_acquire(pktmax);
	if (!skb)
280
		return -ENOMEM;
281
	skb_orphan(skb);
282 283 284
	__skb_queue_tail(list, skb);
	pktpos = skb->data;
	skb_copy_to_linear_data(skb, &pkthdr, INT_H_SIZE);
285 286
	pktpos += INT_H_SIZE;
	pktrem -= INT_H_SIZE;
287
	skb_copy_to_linear_data_offset(skb, INT_H_SIZE, mhdr, mhsz);
288 289 290 291 292 293 294
	pktpos += mhsz;
	pktrem -= mhsz;

	do {
		if (drem < pktrem)
			pktrem = drem;

A
Al Viro 已提交
295
		if (copy_from_iter(pktpos, pktrem, &m->msg_iter) != pktrem) {
296 297 298 299 300 301 302 303 304 305 306 307 308
			rc = -EFAULT;
			goto error;
		}
		drem -= pktrem;

		if (!drem)
			break;

		/* Prepare new fragment: */
		if (drem < (pktmax - INT_H_SIZE))
			pktsz = drem + INT_H_SIZE;
		else
			pktsz = pktmax;
309 310
		skb = tipc_buf_acquire(pktsz);
		if (!skb) {
311 312 313
			rc = -ENOMEM;
			goto error;
		}
314
		skb_orphan(skb);
315
		__skb_queue_tail(list, skb);
316 317 318
		msg_set_type(&pkthdr, FRAGMENT);
		msg_set_size(&pkthdr, pktsz);
		msg_set_fragm_no(&pkthdr, ++pktno);
319 320
		skb_copy_to_linear_data(skb, &pkthdr, INT_H_SIZE);
		pktpos = skb->data + INT_H_SIZE;
321 322 323
		pktrem = pktsz - INT_H_SIZE;

	} while (1);
324
	msg_set_type(buf_msg(skb), LAST_FRAGMENT);
325 326
	return dsz;
error:
327 328
	__skb_queue_purge(list);
	__skb_queue_head_init(list);
329 330 331
	return rc;
}

332 333
/**
 * tipc_msg_bundle(): Append contents of a buffer to tail of an existing one
334 335
 * @skb: the buffer to append to ("bundle")
 * @msg:  message to be appended
336 337 338 339
 * @mtu:  max allowable size for the bundle buffer
 * Consumes buffer if successful
 * Returns true if bundling could be performed, otherwise false
 */
340
bool tipc_msg_bundle(struct sk_buff *skb, struct tipc_msg *msg, u32 mtu)
341
{
J
Jon Paul Maloy 已提交
342 343
	struct tipc_msg *bmsg;
	unsigned int bsz;
344
	unsigned int msz = msg_size(msg);
J
Jon Paul Maloy 已提交
345
	u32 start, pad;
346 347 348 349
	u32 max = mtu - INT_H_SIZE;

	if (likely(msg_user(msg) == MSG_FRAGMENTER))
		return false;
350
	if (!skb)
J
Jon Paul Maloy 已提交
351
		return false;
352
	bmsg = buf_msg(skb);
J
Jon Paul Maloy 已提交
353 354 355 356
	bsz = msg_size(bmsg);
	start = align(bsz);
	pad = start - bsz;

357
	if (unlikely(msg_user(msg) == TUNNEL_PROTOCOL))
358 359 360
		return false;
	if (unlikely(msg_user(msg) == BCAST_PROTOCOL))
		return false;
361
	if (unlikely(msg_user(bmsg) != MSG_BUNDLER))
362
		return false;
363
	if (unlikely(skb_tailroom(skb) < (pad + msz)))
364 365 366
		return false;
	if (unlikely(max < (start + msz)))
		return false;
367 368 369
	if ((msg_importance(msg) < TIPC_SYSTEM_IMPORTANCE) &&
	    (msg_importance(bmsg) == TIPC_SYSTEM_IMPORTANCE))
		return false;
370

371 372
	skb_put(skb, pad + msz);
	skb_copy_to_linear_data_offset(skb, start, msg, msz);
373 374 375 376 377
	msg_set_size(bmsg, start + msz);
	msg_set_msgcnt(bmsg, msg_msgcnt(bmsg) + 1);
	return true;
}

378 379
/**
 *  tipc_msg_extract(): extract bundled inner packet from buffer
380
 *  @skb: buffer to be extracted from.
381
 *  @iskb: extracted inner buffer, to be returned
382 383
 *  @pos: position in outer message of msg to be extracted.
 *        Returns position of next msg
384 385 386 387 388
 *  Consumes outer buffer when last packet extracted
 *  Returns true when when there is an extracted buffer, otherwise false
 */
bool tipc_msg_extract(struct sk_buff *skb, struct sk_buff **iskb, int *pos)
{
389
	struct tipc_msg *msg;
390
	int imsz, offset;
391

392
	*iskb = NULL;
393
	if (unlikely(skb_linearize(skb)))
394 395
		goto none;

396
	msg = buf_msg(skb);
397 398
	offset = msg_hdr_sz(msg) + *pos;
	if (unlikely(offset > (msg_size(msg) - MIN_H_SIZE)))
399 400
		goto none;

401 402
	*iskb = skb_clone(skb, GFP_ATOMIC);
	if (unlikely(!*iskb))
403
		goto none;
404 405 406 407
	skb_pull(*iskb, offset);
	imsz = msg_size(buf_msg(*iskb));
	skb_trim(*iskb, imsz);
	if (unlikely(!tipc_msg_validate(*iskb)))
408 409 410 411 412
		goto none;
	*pos += align(imsz);
	return true;
none:
	kfree_skb(skb);
413
	kfree_skb(*iskb);
414 415 416 417
	*iskb = NULL;
	return false;
}

418 419
/**
 * tipc_msg_make_bundle(): Create bundle buf and append message to its tail
420 421 422
 * @list: the buffer chain, where head is the buffer to replace/append
 * @skb: buffer to be created, appended to and returned in case of success
 * @msg: message to be appended
423
 * @mtu: max allowable size for the bundle buffer, inclusive header
424
 * @dnode: destination node for message. (Not always present in header)
S
stephen hemminger 已提交
425
 * Returns true if success, otherwise false
426
 */
427 428
bool tipc_msg_make_bundle(struct sk_buff **skb,  struct tipc_msg *msg,
			  u32 mtu, u32 dnode)
429
{
430
	struct sk_buff *_skb;
431 432 433 434 435 436
	struct tipc_msg *bmsg;
	u32 msz = msg_size(msg);
	u32 max = mtu - INT_H_SIZE;

	if (msg_user(msg) == MSG_FRAGMENTER)
		return false;
437
	if (msg_user(msg) == TUNNEL_PROTOCOL)
438 439 440 441 442 443
		return false;
	if (msg_user(msg) == BCAST_PROTOCOL)
		return false;
	if (msz > (max / 2))
		return false;

444 445
	_skb = tipc_buf_acquire(max);
	if (!_skb)
446 447
		return false;

448 449
	skb_trim(_skb, INT_H_SIZE);
	bmsg = buf_msg(_skb);
450 451
	tipc_msg_init(msg_prevnode(msg), bmsg, MSG_BUNDLER, 0,
		      INT_H_SIZE, dnode);
452 453 454 455
	if (msg_isdata(msg))
		msg_set_importance(bmsg, TIPC_CRITICAL_IMPORTANCE);
	else
		msg_set_importance(bmsg, TIPC_SYSTEM_IMPORTANCE);
456 457 458
	msg_set_seqno(bmsg, msg_seqno(msg));
	msg_set_ack(bmsg, msg_ack(msg));
	msg_set_bcast_ack(bmsg, msg_bcast_ack(msg));
459 460
	tipc_msg_bundle(_skb, msg, mtu);
	*skb = _skb;
J
Jon Paul Maloy 已提交
461
	return true;
462
}
463 464 465

/**
 * tipc_msg_reverse(): swap source and destination addresses and add error code
466 467 468 469
 * @own_node: originating node id for reversed message
 * @skb:  buffer containing message to be reversed; may be replaced.
 * @err:  error code to be set in message, if any
 * Consumes buffer at failure
470 471
 * Returns true if success, otherwise false
 */
472
bool tipc_msg_reverse(u32 own_node,  struct sk_buff **skb, int err)
473
{
474 475
	struct sk_buff *_skb = *skb;
	struct tipc_msg *hdr = buf_msg(_skb);
476
	struct tipc_msg ohdr;
477
	int dlen = min_t(uint, msg_data_sz(hdr), MAX_FORWARD_SIZE);
478

479
	if (skb_linearize(_skb))
480
		goto exit;
481 482
	hdr = buf_msg(_skb);
	if (msg_dest_droppable(hdr))
483
		goto exit;
484
	if (msg_errcode(hdr))
485
		goto exit;
486 487 488 489 490 491 492 493 494 495 496 497 498 499 500

	/* Take a copy of original header before altering message */
	memcpy(&ohdr, hdr, msg_hdr_sz(hdr));

	/* Never return SHORT header; expand by replacing buffer if necessary */
	if (msg_short(hdr)) {
		*skb = tipc_buf_acquire(BASIC_H_SIZE + dlen);
		if (!*skb)
			goto exit;
		memcpy((*skb)->data + BASIC_H_SIZE, msg_data(hdr), dlen);
		kfree_skb(_skb);
		_skb = *skb;
		hdr = buf_msg(_skb);
		memcpy(hdr, &ohdr, BASIC_H_SIZE);
		msg_set_hdr_sz(hdr, BASIC_H_SIZE);
501
	}
502 503 504 505 506 507 508 509 510 511 512

	/* Now reverse the concerned fields */
	msg_set_errcode(hdr, err);
	msg_set_origport(hdr, msg_destport(&ohdr));
	msg_set_destport(hdr, msg_origport(&ohdr));
	msg_set_destnode(hdr, msg_prevnode(&ohdr));
	msg_set_prevnode(hdr, own_node);
	msg_set_orignode(hdr, own_node);
	msg_set_size(hdr, msg_hdr_sz(hdr) + dlen);
	skb_trim(_skb, msg_size(hdr));
	skb_orphan(_skb);
513 514
	return true;
exit:
515 516
	kfree_skb(_skb);
	*skb = NULL;
517 518
	return false;
}
519 520

/**
521 522 523 524
 * tipc_msg_lookup_dest(): try to find new destination for named message
 * @skb: the buffer containing the message.
 * @dnode: return value: next-hop node, if destination found
 * @err: return value: error code to use, if message to be rejected
525
 * Does not consume buffer
526
 * Returns true if a destination is found, false otherwise
527
 */
528 529
bool tipc_msg_lookup_dest(struct net *net, struct sk_buff *skb,
			  u32 *dnode, int *err)
530
{
531
	struct tipc_msg *msg = buf_msg(skb);
532
	u32 dport;
533
	u32 own_addr = tipc_own_addr(net);
534

535 536 537 538
	if (!msg_isdata(msg))
		return false;
	if (!msg_named(msg))
		return false;
539 540
	if (msg_errcode(msg))
		return false;
541 542 543
	*err = -TIPC_ERR_NO_NAME;
	if (skb_linearize(skb))
		return false;
544
	if (msg_reroute_cnt(msg))
545
		return false;
546
	*dnode = addr_domain(net, msg_lookup_scope(msg));
547
	dport = tipc_nametbl_translate(net, msg_nametype(msg),
548
				       msg_nameinst(msg), dnode);
549
	if (!dport)
550
		return false;
551
	msg_incr_reroute_cnt(msg);
552 553
	if (*dnode != own_addr)
		msg_set_prevnode(msg, own_addr);
554 555
	msg_set_destnode(msg, *dnode);
	msg_set_destport(msg, dport);
556 557
	*err = TIPC_OK;
	return true;
558
}
559 560 561 562

/* tipc_msg_reassemble() - clone a buffer chain of fragments and
 *                         reassemble the clones into one message
 */
563
struct sk_buff *tipc_msg_reassemble(struct sk_buff_head *list)
564
{
565 566
	struct sk_buff *skb;
	struct sk_buff *frag = NULL;
567 568 569 570
	struct sk_buff *head = NULL;
	int hdr_sz;

	/* Copy header if single buffer */
571 572 573 574
	if (skb_queue_len(list) == 1) {
		skb = skb_peek(list);
		hdr_sz = skb_headroom(skb) + msg_hdr_sz(buf_msg(skb));
		return __pskb_copy(skb, hdr_sz, GFP_ATOMIC);
575 576 577
	}

	/* Clone all fragments and reassemble */
578 579
	skb_queue_walk(list, skb) {
		frag = skb_clone(skb, GFP_ATOMIC);
580 581 582 583 584 585 586 587 588 589 590 591 592 593
		if (!frag)
			goto error;
		frag->next = NULL;
		if (tipc_buf_append(&head, &frag))
			break;
		if (!head)
			goto error;
	}
	return frag;
error:
	pr_warn("Failed do clone local mcast rcv buffer\n");
	kfree_skb(head);
	return NULL;
}