msg.c revision 1dd0bd2b14032037d40a316dd52370f1713fa62b
1/*
2 * net/tipc/msg.c: TIPC message header routines
3 *
4 * Copyright (c) 2000-2006, 2014, Ericsson AB
5 * Copyright (c) 2005, 2010-2011, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 *    contributors may be used to endorse or promote products derived from
18 *    this software without specific prior written permission.
19 *
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
38#include "msg.h"
39#include "addr.h"
40#include "name_table.h"
41
42#define MAX_FORWARD_SIZE 1024
43
44static unsigned int align(unsigned int i)
45{
46	return (i + 3) & ~3u;
47}
48
49void tipc_msg_init(struct tipc_msg *m, u32 user, u32 type, u32 hsize,
50		   u32 destnode)
51{
52	memset(m, 0, hsize);
53	msg_set_version(m);
54	msg_set_user(m, user);
55	msg_set_hdr_sz(m, hsize);
56	msg_set_size(m, hsize);
57	msg_set_prevnode(m, tipc_own_addr);
58	msg_set_type(m, type);
59	if (hsize > SHORT_H_SIZE) {
60		msg_set_orignode(m, tipc_own_addr);
61		msg_set_destnode(m, destnode);
62	}
63}
64
65struct sk_buff *tipc_msg_create(uint user, uint type, uint hdr_sz,
66				uint data_sz, u32 dnode, u32 onode,
67				u32 dport, u32 oport, int errcode)
68{
69	struct tipc_msg *msg;
70	struct sk_buff *buf;
71
72	buf = tipc_buf_acquire(hdr_sz + data_sz);
73	if (unlikely(!buf))
74		return NULL;
75
76	msg = buf_msg(buf);
77	tipc_msg_init(msg, user, type, hdr_sz, dnode);
78	msg_set_size(msg, hdr_sz + data_sz);
79	msg_set_prevnode(msg, onode);
80	msg_set_origport(msg, oport);
81	msg_set_destport(msg, dport);
82	msg_set_errcode(msg, errcode);
83	if (hdr_sz > SHORT_H_SIZE) {
84		msg_set_orignode(msg, onode);
85		msg_set_destnode(msg, dnode);
86	}
87	return buf;
88}
89
90/* tipc_buf_append(): Append a buffer to the fragment list of another buffer
91 * @*headbuf: in:  NULL for first frag, otherwise value returned from prev call
92 *            out: set when successful non-complete reassembly, otherwise NULL
93 * @*buf:     in:  the buffer to append. Always defined
94 *            out: head buf after sucessful complete reassembly, otherwise NULL
95 * Returns 1 when reassembly complete, otherwise 0
96 */
97int tipc_buf_append(struct sk_buff **headbuf, struct sk_buff **buf)
98{
99	struct sk_buff *head = *headbuf;
100	struct sk_buff *frag = *buf;
101	struct sk_buff *tail;
102	struct tipc_msg *msg;
103	u32 fragid;
104	int delta;
105	bool headstolen;
106
107	if (!frag)
108		goto err;
109
110	msg = buf_msg(frag);
111	fragid = msg_type(msg);
112	frag->next = NULL;
113	skb_pull(frag, msg_hdr_sz(msg));
114
115	if (fragid == FIRST_FRAGMENT) {
116		if (unlikely(head))
117			goto err;
118		if (unlikely(skb_unclone(frag, GFP_ATOMIC)))
119			goto err;
120		head = *headbuf = frag;
121		skb_frag_list_init(head);
122		TIPC_SKB_CB(head)->tail = NULL;
123		*buf = NULL;
124		return 0;
125	}
126
127	if (!head)
128		goto err;
129
130	if (skb_try_coalesce(head, frag, &headstolen, &delta)) {
131		kfree_skb_partial(frag, headstolen);
132	} else {
133		tail = TIPC_SKB_CB(head)->tail;
134		if (!skb_has_frag_list(head))
135			skb_shinfo(head)->frag_list = frag;
136		else
137			tail->next = frag;
138		head->truesize += frag->truesize;
139		head->data_len += frag->len;
140		head->len += frag->len;
141		TIPC_SKB_CB(head)->tail = frag;
142	}
143
144	if (fragid == LAST_FRAGMENT) {
145		*buf = head;
146		TIPC_SKB_CB(head)->tail = NULL;
147		*headbuf = NULL;
148		return 1;
149	}
150	*buf = NULL;
151	return 0;
152
153err:
154	pr_warn_ratelimited("Unable to build fragment list\n");
155	kfree_skb(*buf);
156	kfree_skb(*headbuf);
157	*buf = *headbuf = NULL;
158	return 0;
159}
160
161
162/**
163 * tipc_msg_build - create buffer chain containing specified header and data
164 * @mhdr: Message header, to be prepended to data
165 * @iov: User data
166 * @offset: Posision in iov to start copying from
167 * @dsz: Total length of user data
168 * @pktmax: Max packet size that can be used
169 * @chain: Buffer or chain of buffers to be returned to caller
170 * Returns message data size or errno: -ENOMEM, -EFAULT
171 */
172int tipc_msg_build(struct tipc_msg *mhdr, struct iovec const *iov,
173		   int offset, int dsz, int pktmax , struct sk_buff **chain)
174{
175	int mhsz = msg_hdr_sz(mhdr);
176	int msz = mhsz + dsz;
177	int pktno = 1;
178	int pktsz;
179	int pktrem = pktmax;
180	int drem = dsz;
181	struct tipc_msg pkthdr;
182	struct sk_buff *buf, *prev;
183	char *pktpos;
184	int rc;
185
186	msg_set_size(mhdr, msz);
187
188	/* No fragmentation needed? */
189	if (likely(msz <= pktmax)) {
190		buf = tipc_buf_acquire(msz);
191		*chain = buf;
192		if (unlikely(!buf))
193			return -ENOMEM;
194		skb_copy_to_linear_data(buf, mhdr, mhsz);
195		pktpos = buf->data + mhsz;
196		if (!dsz || !memcpy_fromiovecend(pktpos, iov, offset, dsz))
197			return dsz;
198		rc = -EFAULT;
199		goto error;
200	}
201
202	/* Prepare reusable fragment header */
203	tipc_msg_init(&pkthdr, MSG_FRAGMENTER, FIRST_FRAGMENT,
204		      INT_H_SIZE, msg_destnode(mhdr));
205	msg_set_size(&pkthdr, pktmax);
206	msg_set_fragm_no(&pkthdr, pktno);
207
208	/* Prepare first fragment */
209	*chain = buf = tipc_buf_acquire(pktmax);
210	if (!buf)
211		return -ENOMEM;
212	pktpos = buf->data;
213	skb_copy_to_linear_data(buf, &pkthdr, INT_H_SIZE);
214	pktpos += INT_H_SIZE;
215	pktrem -= INT_H_SIZE;
216	skb_copy_to_linear_data_offset(buf, INT_H_SIZE, mhdr, mhsz);
217	pktpos += mhsz;
218	pktrem -= mhsz;
219
220	do {
221		if (drem < pktrem)
222			pktrem = drem;
223
224		if (memcpy_fromiovecend(pktpos, iov, offset, pktrem)) {
225			rc = -EFAULT;
226			goto error;
227		}
228		drem -= pktrem;
229		offset += pktrem;
230
231		if (!drem)
232			break;
233
234		/* Prepare new fragment: */
235		if (drem < (pktmax - INT_H_SIZE))
236			pktsz = drem + INT_H_SIZE;
237		else
238			pktsz = pktmax;
239		prev = buf;
240		buf = tipc_buf_acquire(pktsz);
241		if (!buf) {
242			rc = -ENOMEM;
243			goto error;
244		}
245		prev->next = buf;
246		msg_set_type(&pkthdr, FRAGMENT);
247		msg_set_size(&pkthdr, pktsz);
248		msg_set_fragm_no(&pkthdr, ++pktno);
249		skb_copy_to_linear_data(buf, &pkthdr, INT_H_SIZE);
250		pktpos = buf->data + INT_H_SIZE;
251		pktrem = pktsz - INT_H_SIZE;
252
253	} while (1);
254
255	msg_set_type(buf_msg(buf), LAST_FRAGMENT);
256	return dsz;
257error:
258	kfree_skb_list(*chain);
259	*chain = NULL;
260	return rc;
261}
262
263/**
264 * tipc_msg_bundle(): Append contents of a buffer to tail of an existing one
265 * @bbuf: the existing buffer ("bundle")
266 * @buf:  buffer to be appended
267 * @mtu:  max allowable size for the bundle buffer
268 * Consumes buffer if successful
269 * Returns true if bundling could be performed, otherwise false
270 */
271bool tipc_msg_bundle(struct sk_buff *bbuf, struct sk_buff *buf, u32 mtu)
272{
273	struct tipc_msg *bmsg = buf_msg(bbuf);
274	struct tipc_msg *msg = buf_msg(buf);
275	unsigned int bsz = msg_size(bmsg);
276	unsigned int msz = msg_size(msg);
277	u32 start = align(bsz);
278	u32 max = mtu - INT_H_SIZE;
279	u32 pad = start - bsz;
280
281	if (likely(msg_user(msg) == MSG_FRAGMENTER))
282		return false;
283	if (unlikely(msg_user(msg) == CHANGEOVER_PROTOCOL))
284		return false;
285	if (unlikely(msg_user(msg) == BCAST_PROTOCOL))
286		return false;
287	if (likely(msg_user(bmsg) != MSG_BUNDLER))
288		return false;
289	if (likely(msg_type(bmsg) != BUNDLE_OPEN))
290		return false;
291	if (unlikely(skb_tailroom(bbuf) < (pad + msz)))
292		return false;
293	if (unlikely(max < (start + msz)))
294		return false;
295
296	skb_put(bbuf, pad + msz);
297	skb_copy_to_linear_data_offset(bbuf, start, buf->data, msz);
298	msg_set_size(bmsg, start + msz);
299	msg_set_msgcnt(bmsg, msg_msgcnt(bmsg) + 1);
300	bbuf->next = buf->next;
301	kfree_skb(buf);
302	return true;
303}
304
305/**
306 * tipc_msg_make_bundle(): Create bundle buf and append message to its tail
307 * @buf:  buffer to be appended and replaced
308 * @mtu:  max allowable size for the bundle buffer, inclusive header
309 * @dnode: destination node for message. (Not always present in header)
310 * Replaces buffer if successful
311 * Returns true if sucess, otherwise false
312 */
313bool tipc_msg_make_bundle(struct sk_buff **buf, u32 mtu, u32 dnode)
314{
315	struct sk_buff *bbuf;
316	struct tipc_msg *bmsg;
317	struct tipc_msg *msg = buf_msg(*buf);
318	u32 msz = msg_size(msg);
319	u32 max = mtu - INT_H_SIZE;
320
321	if (msg_user(msg) == MSG_FRAGMENTER)
322		return false;
323	if (msg_user(msg) == CHANGEOVER_PROTOCOL)
324		return false;
325	if (msg_user(msg) == BCAST_PROTOCOL)
326		return false;
327	if (msz > (max / 2))
328		return false;
329
330	bbuf = tipc_buf_acquire(max);
331	if (!bbuf)
332		return false;
333
334	skb_trim(bbuf, INT_H_SIZE);
335	bmsg = buf_msg(bbuf);
336	tipc_msg_init(bmsg, MSG_BUNDLER, BUNDLE_OPEN, INT_H_SIZE, dnode);
337	msg_set_seqno(bmsg, msg_seqno(msg));
338	msg_set_ack(bmsg, msg_ack(msg));
339	msg_set_bcast_ack(bmsg, msg_bcast_ack(msg));
340	bbuf->next = (*buf)->next;
341	tipc_msg_bundle(bbuf, *buf, mtu);
342	*buf = bbuf;
343	return true;
344}
345
346/**
347 * tipc_msg_reverse(): swap source and destination addresses and add error code
348 * @buf:  buffer containing message to be reversed
349 * @dnode: return value: node where to send message after reversal
350 * @err:  error code to be set in message
351 * Consumes buffer if failure
352 * Returns true if success, otherwise false
353 */
354bool tipc_msg_reverse(struct sk_buff *buf, u32 *dnode, int err)
355{
356	struct tipc_msg *msg = buf_msg(buf);
357	uint imp = msg_importance(msg);
358	struct tipc_msg ohdr;
359	uint rdsz = min_t(uint, msg_data_sz(msg), MAX_FORWARD_SIZE);
360
361	if (skb_linearize(buf))
362		goto exit;
363	if (msg_dest_droppable(msg))
364		goto exit;
365	if (msg_errcode(msg))
366		goto exit;
367
368	memcpy(&ohdr, msg, msg_hdr_sz(msg));
369	imp = min_t(uint, imp + 1, TIPC_CRITICAL_IMPORTANCE);
370	if (msg_isdata(msg))
371		msg_set_importance(msg, imp);
372	msg_set_errcode(msg, err);
373	msg_set_origport(msg, msg_destport(&ohdr));
374	msg_set_destport(msg, msg_origport(&ohdr));
375	msg_set_prevnode(msg, tipc_own_addr);
376	if (!msg_short(msg)) {
377		msg_set_orignode(msg, msg_destnode(&ohdr));
378		msg_set_destnode(msg, msg_orignode(&ohdr));
379	}
380	msg_set_size(msg, msg_hdr_sz(msg) + rdsz);
381	skb_trim(buf, msg_size(msg));
382	skb_orphan(buf);
383	*dnode = msg_orignode(&ohdr);
384	return true;
385exit:
386	kfree_skb(buf);
387	return false;
388}
389
390/**
391 * tipc_msg_eval: determine fate of message that found no destination
392 * @buf: the buffer containing the message.
393 * @dnode: return value: next-hop node, if message to be forwarded
394 * @err: error code to use, if message to be rejected
395 *
396 * Does not consume buffer
397 * Returns 0 (TIPC_OK) if message ok and we can try again, -TIPC error
398 * code if message to be rejected
399 */
400int tipc_msg_eval(struct sk_buff *buf, u32 *dnode)
401{
402	struct tipc_msg *msg = buf_msg(buf);
403	u32 dport;
404
405	if (msg_type(msg) != TIPC_NAMED_MSG)
406		return -TIPC_ERR_NO_PORT;
407	if (skb_linearize(buf))
408		return -TIPC_ERR_NO_NAME;
409	if (msg_data_sz(msg) > MAX_FORWARD_SIZE)
410		return -TIPC_ERR_NO_NAME;
411	if (msg_reroute_cnt(msg) > 0)
412		return -TIPC_ERR_NO_NAME;
413
414	*dnode = addr_domain(msg_lookup_scope(msg));
415	dport = tipc_nametbl_translate(msg_nametype(msg),
416				       msg_nameinst(msg),
417				       dnode);
418	if (!dport)
419		return -TIPC_ERR_NO_NAME;
420	msg_incr_reroute_cnt(msg);
421	msg_set_destnode(msg, *dnode);
422	msg_set_destport(msg, dport);
423	return TIPC_OK;
424}
425
426/* tipc_msg_reassemble() - clone a buffer chain of fragments and
427 *                         reassemble the clones into one message
428 */
429struct sk_buff *tipc_msg_reassemble(struct sk_buff *chain)
430{
431	struct sk_buff *buf = chain;
432	struct sk_buff *frag = buf;
433	struct sk_buff *head = NULL;
434	int hdr_sz;
435
436	/* Copy header if single buffer */
437	if (!buf->next) {
438		hdr_sz = skb_headroom(buf) + msg_hdr_sz(buf_msg(buf));
439		return __pskb_copy(buf, hdr_sz, GFP_ATOMIC);
440	}
441
442	/* Clone all fragments and reassemble */
443	while (buf) {
444		frag = skb_clone(buf, GFP_ATOMIC);
445		if (!frag)
446			goto error;
447		frag->next = NULL;
448		if (tipc_buf_append(&head, &frag))
449			break;
450		if (!head)
451			goto error;
452		buf = buf->next;
453	}
454	return frag;
455error:
456	pr_warn("Failed do clone local mcast rcv buffer\n");
457	kfree_skb(head);
458	return NULL;
459}
460