tipc: improve sequence number checking
[deliverable/linux.git] / net / tipc / msg.c
CommitLineData
b97bf3fd
PL
1/*
2 * net/tipc/msg.c: TIPC message header routines
c4307285 3 *
cf2157f8 4 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB
741de3e9 5 * Copyright (c) 2005, 2010-2011, Wind River Systems
b97bf3fd
PL
6 * All rights reserved.
7 *
9ea1fd3c 8 * Redistribution and use in source and binary forms, with or without
b97bf3fd
PL
9 * modification, are permitted provided that the following conditions are met:
10 *
9ea1fd3c
PL
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.
b97bf3fd 19 *
9ea1fd3c
PL
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
b97bf3fd
PL
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
c93d3baa 37#include <net/sock.h>
b97bf3fd 38#include "core.h"
b97bf3fd 39#include "msg.h"
5a379074
JPM
40#include "addr.h"
41#include "name_table.h"
b97bf3fd 42
8db1bae3
JPM
43#define MAX_FORWARD_SIZE 1024
44
4f1688b2 45static unsigned int align(unsigned int i)
23461e83 46{
4f1688b2 47 return (i + 3) & ~3u;
23461e83
AS
48}
49
859fc7c0
YX
50/**
51 * tipc_buf_acquire - creates a TIPC message buffer
52 * @size: message size (including TIPC header)
53 *
54 * Returns a new buffer with data pointers set to the specified size.
55 *
56 * NOTE: Headroom is reserved to allow prepending of a data link header.
57 * There may also be unrequested tailroom present at the buffer's end.
58 */
59struct sk_buff *tipc_buf_acquire(u32 size)
60{
61 struct sk_buff *skb;
62 unsigned int buf_size = (BUF_HEADROOM + size + 3) & ~3u;
63
64 skb = alloc_skb_fclone(buf_size, GFP_ATOMIC);
65 if (skb) {
66 skb_reserve(skb, BUF_HEADROOM);
67 skb_put(skb, size);
68 skb->next = NULL;
69 }
70 return skb;
71}
72
c5898636
JPM
73void tipc_msg_init(u32 own_node, struct tipc_msg *m, u32 user, u32 type,
74 u32 hsize, u32 dnode)
23461e83
AS
75{
76 memset(m, 0, hsize);
77 msg_set_version(m);
78 msg_set_user(m, user);
79 msg_set_hdr_sz(m, hsize);
80 msg_set_size(m, hsize);
c5898636 81 msg_set_prevnode(m, own_node);
23461e83 82 msg_set_type(m, type);
1dd0bd2b 83 if (hsize > SHORT_H_SIZE) {
c5898636
JPM
84 msg_set_orignode(m, own_node);
85 msg_set_destnode(m, dnode);
1dd0bd2b
JPM
86 }
87}
88
c5898636 89struct sk_buff *tipc_msg_create(uint user, uint type,
34747539
YX
90 uint hdr_sz, uint data_sz, u32 dnode,
91 u32 onode, u32 dport, u32 oport, int errcode)
1dd0bd2b
JPM
92{
93 struct tipc_msg *msg;
94 struct sk_buff *buf;
95
96 buf = tipc_buf_acquire(hdr_sz + data_sz);
97 if (unlikely(!buf))
98 return NULL;
99
100 msg = buf_msg(buf);
c5898636 101 tipc_msg_init(onode, msg, user, type, hdr_sz, dnode);
1dd0bd2b 102 msg_set_size(msg, hdr_sz + data_sz);
1dd0bd2b
JPM
103 msg_set_origport(msg, oport);
104 msg_set_destport(msg, dport);
105 msg_set_errcode(msg, errcode);
106 if (hdr_sz > SHORT_H_SIZE) {
107 msg_set_orignode(msg, onode);
108 msg_set_destnode(msg, dnode);
109 }
110 return buf;
23461e83
AS
111}
112
37e22164 113/* tipc_buf_append(): Append a buffer to the fragment list of another buffer
29322d0d
JPM
114 * @*headbuf: in: NULL for first frag, otherwise value returned from prev call
115 * out: set when successful non-complete reassembly, otherwise NULL
116 * @*buf: in: the buffer to append. Always defined
b2ad5e5f 117 * out: head buf after successful complete reassembly, otherwise NULL
29322d0d 118 * Returns 1 when reassembly complete, otherwise 0
37e22164
JPM
119 */
120int tipc_buf_append(struct sk_buff **headbuf, struct sk_buff **buf)
121{
122 struct sk_buff *head = *headbuf;
123 struct sk_buff *frag = *buf;
124 struct sk_buff *tail;
13e9b997
JPM
125 struct tipc_msg *msg;
126 u32 fragid;
37e22164 127 int delta;
13e9b997 128 bool headstolen;
37e22164 129
13e9b997
JPM
130 if (!frag)
131 goto err;
132
133 msg = buf_msg(frag);
134 fragid = msg_type(msg);
135 frag->next = NULL;
37e22164
JPM
136 skb_pull(frag, msg_hdr_sz(msg));
137
138 if (fragid == FIRST_FRAGMENT) {
13e9b997
JPM
139 if (unlikely(head))
140 goto err;
141 if (unlikely(skb_unclone(frag, GFP_ATOMIC)))
142 goto err;
37e22164
JPM
143 head = *headbuf = frag;
144 skb_frag_list_init(head);
13e9b997 145 TIPC_SKB_CB(head)->tail = NULL;
29322d0d 146 *buf = NULL;
37e22164
JPM
147 return 0;
148 }
13e9b997 149
37e22164 150 if (!head)
13e9b997
JPM
151 goto err;
152
37e22164
JPM
153 if (skb_try_coalesce(head, frag, &headstolen, &delta)) {
154 kfree_skb_partial(frag, headstolen);
155 } else {
13e9b997 156 tail = TIPC_SKB_CB(head)->tail;
37e22164
JPM
157 if (!skb_has_frag_list(head))
158 skb_shinfo(head)->frag_list = frag;
159 else
160 tail->next = frag;
161 head->truesize += frag->truesize;
162 head->data_len += frag->len;
163 head->len += frag->len;
164 TIPC_SKB_CB(head)->tail = frag;
165 }
13e9b997 166
37e22164 167 if (fragid == LAST_FRAGMENT) {
1149557d
JPM
168 TIPC_SKB_CB(head)->validated = false;
169 if (unlikely(!tipc_msg_validate(head)))
170 goto err;
37e22164
JPM
171 *buf = head;
172 TIPC_SKB_CB(head)->tail = NULL;
173 *headbuf = NULL;
174 return 1;
175 }
176 *buf = NULL;
177 return 0;
13e9b997 178err:
37e22164
JPM
179 pr_warn_ratelimited("Unable to build fragment list\n");
180 kfree_skb(*buf);
29322d0d
JPM
181 kfree_skb(*headbuf);
182 *buf = *headbuf = NULL;
37e22164
JPM
183 return 0;
184}
4f1688b2 185
cf2157f8
JPM
186/* tipc_msg_validate - validate basic format of received message
187 *
188 * This routine ensures a TIPC message has an acceptable header, and at least
189 * as much data as the header indicates it should. The routine also ensures
190 * that the entire message header is stored in the main fragment of the message
191 * buffer, to simplify future access to message header fields.
192 *
193 * Note: Having extra info present in the message header or data areas is OK.
194 * TIPC will ignore the excess, under the assumption that it is optional info
195 * introduced by a later release of the protocol.
196 */
197bool tipc_msg_validate(struct sk_buff *skb)
198{
199 struct tipc_msg *msg;
200 int msz, hsz;
201
202 if (unlikely(TIPC_SKB_CB(skb)->validated))
203 return true;
204 if (unlikely(!pskb_may_pull(skb, MIN_H_SIZE)))
205 return false;
206
207 hsz = msg_hdr_sz(buf_msg(skb));
208 if (unlikely(hsz < MIN_H_SIZE) || (hsz > MAX_H_SIZE))
209 return false;
210 if (unlikely(!pskb_may_pull(skb, hsz)))
211 return false;
212
213 msg = buf_msg(skb);
214 if (unlikely(msg_version(msg) != TIPC_VERSION))
215 return false;
216
217 msz = msg_size(msg);
218 if (unlikely(msz < hsz))
219 return false;
220 if (unlikely((msz - hsz) > TIPC_MAX_USER_MSG_SIZE))
221 return false;
222 if (unlikely(skb->len < msz))
223 return false;
224
225 TIPC_SKB_CB(skb)->validated = true;
226 return true;
227}
067608e9
JPM
228
229/**
9fbfb8b1 230 * tipc_msg_build - create buffer chain containing specified header and data
067608e9 231 * @mhdr: Message header, to be prepended to data
45dcc687 232 * @m: User message
067608e9
JPM
233 * @dsz: Total length of user data
234 * @pktmax: Max packet size that can be used
a6ca1094
YX
235 * @list: Buffer or chain of buffers to be returned to caller
236 *
067608e9
JPM
237 * Returns message data size or errno: -ENOMEM, -EFAULT
238 */
c5898636 239int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m,
34747539 240 int offset, int dsz, int pktmax, struct sk_buff_head *list)
067608e9
JPM
241{
242 int mhsz = msg_hdr_sz(mhdr);
243 int msz = mhsz + dsz;
244 int pktno = 1;
245 int pktsz;
246 int pktrem = pktmax;
247 int drem = dsz;
248 struct tipc_msg pkthdr;
a6ca1094 249 struct sk_buff *skb;
067608e9
JPM
250 char *pktpos;
251 int rc;
a6ca1094 252
067608e9
JPM
253 msg_set_size(mhdr, msz);
254
255 /* No fragmentation needed? */
256 if (likely(msz <= pktmax)) {
a6ca1094
YX
257 skb = tipc_buf_acquire(msz);
258 if (unlikely(!skb))
067608e9 259 return -ENOMEM;
c93d3baa 260 skb_orphan(skb);
a6ca1094
YX
261 __skb_queue_tail(list, skb);
262 skb_copy_to_linear_data(skb, mhdr, mhsz);
263 pktpos = skb->data + mhsz;
f25dcc76 264 if (copy_from_iter(pktpos, dsz, &m->msg_iter) == dsz)
067608e9
JPM
265 return dsz;
266 rc = -EFAULT;
267 goto error;
268 }
269
270 /* Prepare reusable fragment header */
c5898636
JPM
271 tipc_msg_init(msg_prevnode(mhdr), &pkthdr, MSG_FRAGMENTER,
272 FIRST_FRAGMENT, INT_H_SIZE, msg_destnode(mhdr));
067608e9
JPM
273 msg_set_size(&pkthdr, pktmax);
274 msg_set_fragm_no(&pkthdr, pktno);
e3eea1eb 275 msg_set_importance(&pkthdr, msg_importance(mhdr));
067608e9
JPM
276
277 /* Prepare first fragment */
a6ca1094
YX
278 skb = tipc_buf_acquire(pktmax);
279 if (!skb)
067608e9 280 return -ENOMEM;
c93d3baa 281 skb_orphan(skb);
a6ca1094
YX
282 __skb_queue_tail(list, skb);
283 pktpos = skb->data;
284 skb_copy_to_linear_data(skb, &pkthdr, INT_H_SIZE);
067608e9
JPM
285 pktpos += INT_H_SIZE;
286 pktrem -= INT_H_SIZE;
a6ca1094 287 skb_copy_to_linear_data_offset(skb, INT_H_SIZE, mhdr, mhsz);
067608e9
JPM
288 pktpos += mhsz;
289 pktrem -= mhsz;
290
291 do {
292 if (drem < pktrem)
293 pktrem = drem;
294
f25dcc76 295 if (copy_from_iter(pktpos, pktrem, &m->msg_iter) != pktrem) {
067608e9
JPM
296 rc = -EFAULT;
297 goto error;
298 }
299 drem -= pktrem;
067608e9
JPM
300
301 if (!drem)
302 break;
303
304 /* Prepare new fragment: */
305 if (drem < (pktmax - INT_H_SIZE))
306 pktsz = drem + INT_H_SIZE;
307 else
308 pktsz = pktmax;
a6ca1094
YX
309 skb = tipc_buf_acquire(pktsz);
310 if (!skb) {
067608e9
JPM
311 rc = -ENOMEM;
312 goto error;
313 }
c93d3baa 314 skb_orphan(skb);
a6ca1094 315 __skb_queue_tail(list, skb);
067608e9
JPM
316 msg_set_type(&pkthdr, FRAGMENT);
317 msg_set_size(&pkthdr, pktsz);
318 msg_set_fragm_no(&pkthdr, ++pktno);
a6ca1094
YX
319 skb_copy_to_linear_data(skb, &pkthdr, INT_H_SIZE);
320 pktpos = skb->data + INT_H_SIZE;
067608e9
JPM
321 pktrem = pktsz - INT_H_SIZE;
322
323 } while (1);
a6ca1094 324 msg_set_type(buf_msg(skb), LAST_FRAGMENT);
067608e9
JPM
325 return dsz;
326error:
a6ca1094
YX
327 __skb_queue_purge(list);
328 __skb_queue_head_init(list);
067608e9
JPM
329 return rc;
330}
331
4f1688b2
JPM
332/**
333 * tipc_msg_bundle(): Append contents of a buffer to tail of an existing one
dd3f9e70
JPM
334 * @skb: the buffer to append to ("bundle")
335 * @msg: message to be appended
4f1688b2
JPM
336 * @mtu: max allowable size for the bundle buffer
337 * Consumes buffer if successful
338 * Returns true if bundling could be performed, otherwise false
339 */
dd3f9e70 340bool tipc_msg_bundle(struct sk_buff *skb, struct tipc_msg *msg, u32 mtu)
4f1688b2 341{
05dcc5aa 342 struct tipc_msg *bmsg;
05dcc5aa 343 unsigned int bsz;
4f1688b2 344 unsigned int msz = msg_size(msg);
05dcc5aa 345 u32 start, pad;
4f1688b2 346 u32 max = mtu - INT_H_SIZE;
4f1688b2
JPM
347
348 if (likely(msg_user(msg) == MSG_FRAGMENTER))
349 return false;
dd3f9e70 350 if (!skb)
05dcc5aa 351 return false;
dd3f9e70 352 bmsg = buf_msg(skb);
05dcc5aa
JPM
353 bsz = msg_size(bmsg);
354 start = align(bsz);
355 pad = start - bsz;
356
dff29b1a 357 if (unlikely(msg_user(msg) == TUNNEL_PROTOCOL))
4f1688b2
JPM
358 return false;
359 if (unlikely(msg_user(msg) == BCAST_PROTOCOL))
360 return false;
dd3f9e70 361 if (unlikely(msg_user(bmsg) != MSG_BUNDLER))
4f1688b2 362 return false;
dd3f9e70 363 if (unlikely(skb_tailroom(skb) < (pad + msz)))
4f1688b2
JPM
364 return false;
365 if (unlikely(max < (start + msz)))
366 return false;
f21e897e
JPM
367 if ((msg_importance(msg) < TIPC_SYSTEM_IMPORTANCE) &&
368 (msg_importance(bmsg) == TIPC_SYSTEM_IMPORTANCE))
369 return false;
4f1688b2 370
dd3f9e70
JPM
371 skb_put(skb, pad + msz);
372 skb_copy_to_linear_data_offset(skb, start, msg, msz);
4f1688b2
JPM
373 msg_set_size(bmsg, start + msz);
374 msg_set_msgcnt(bmsg, msg_msgcnt(bmsg) + 1);
4f1688b2
JPM
375 return true;
376}
377
c637c103
JPM
378/**
379 * tipc_msg_extract(): extract bundled inner packet from buffer
c1336ee4 380 * @skb: buffer to be extracted from.
c637c103 381 * @iskb: extracted inner buffer, to be returned
c1336ee4
JPM
382 * @pos: position in outer message of msg to be extracted.
383 * Returns position of next msg
c637c103
JPM
384 * Consumes outer buffer when last packet extracted
385 * Returns true when when there is an extracted buffer, otherwise false
386 */
387bool tipc_msg_extract(struct sk_buff *skb, struct sk_buff **iskb, int *pos)
388{
1149557d 389 struct tipc_msg *msg;
c1336ee4 390 int imsz, offset;
c637c103 391
c1336ee4 392 *iskb = NULL;
1149557d 393 if (unlikely(skb_linearize(skb)))
c1336ee4
JPM
394 goto none;
395
1149557d 396 msg = buf_msg(skb);
c1336ee4
JPM
397 offset = msg_hdr_sz(msg) + *pos;
398 if (unlikely(offset > (msg_size(msg) - MIN_H_SIZE)))
c637c103 399 goto none;
c637c103 400
c1336ee4
JPM
401 *iskb = skb_clone(skb, GFP_ATOMIC);
402 if (unlikely(!*iskb))
c637c103 403 goto none;
c1336ee4
JPM
404 skb_pull(*iskb, offset);
405 imsz = msg_size(buf_msg(*iskb));
406 skb_trim(*iskb, imsz);
407 if (unlikely(!tipc_msg_validate(*iskb)))
c637c103 408 goto none;
c637c103
JPM
409 *pos += align(imsz);
410 return true;
411none:
412 kfree_skb(skb);
c1336ee4 413 kfree_skb(*iskb);
c637c103
JPM
414 *iskb = NULL;
415 return false;
416}
417
4f1688b2
JPM
418/**
419 * tipc_msg_make_bundle(): Create bundle buf and append message to its tail
dd3f9e70
JPM
420 * @list: the buffer chain, where head is the buffer to replace/append
421 * @skb: buffer to be created, appended to and returned in case of success
422 * @msg: message to be appended
58dc55f2 423 * @mtu: max allowable size for the bundle buffer, inclusive header
4f1688b2 424 * @dnode: destination node for message. (Not always present in header)
b2ad5e5f 425 * Returns true if success, otherwise false
4f1688b2 426 */
dd3f9e70
JPM
427bool tipc_msg_make_bundle(struct sk_buff **skb, struct tipc_msg *msg,
428 u32 mtu, u32 dnode)
4f1688b2 429{
dd3f9e70 430 struct sk_buff *_skb;
4f1688b2 431 struct tipc_msg *bmsg;
4f1688b2
JPM
432 u32 msz = msg_size(msg);
433 u32 max = mtu - INT_H_SIZE;
434
435 if (msg_user(msg) == MSG_FRAGMENTER)
436 return false;
dff29b1a 437 if (msg_user(msg) == TUNNEL_PROTOCOL)
4f1688b2
JPM
438 return false;
439 if (msg_user(msg) == BCAST_PROTOCOL)
440 return false;
441 if (msz > (max / 2))
442 return false;
443
dd3f9e70
JPM
444 _skb = tipc_buf_acquire(max);
445 if (!_skb)
4f1688b2
JPM
446 return false;
447
dd3f9e70
JPM
448 skb_trim(_skb, INT_H_SIZE);
449 bmsg = buf_msg(_skb);
c5898636
JPM
450 tipc_msg_init(msg_prevnode(msg), bmsg, MSG_BUNDLER, 0,
451 INT_H_SIZE, dnode);
f21e897e
JPM
452 if (msg_isdata(msg))
453 msg_set_importance(bmsg, TIPC_CRITICAL_IMPORTANCE);
454 else
455 msg_set_importance(bmsg, TIPC_SYSTEM_IMPORTANCE);
4f1688b2
JPM
456 msg_set_seqno(bmsg, msg_seqno(msg));
457 msg_set_ack(bmsg, msg_ack(msg));
458 msg_set_bcast_ack(bmsg, msg_bcast_ack(msg));
dd3f9e70
JPM
459 tipc_msg_bundle(_skb, msg, mtu);
460 *skb = _skb;
05dcc5aa 461 return true;
4f1688b2 462}
8db1bae3
JPM
463
464/**
465 * tipc_msg_reverse(): swap source and destination addresses and add error code
29042e19
JPM
466 * @own_node: originating node id for reversed message
467 * @skb: buffer containing message to be reversed; may be replaced.
468 * @err: error code to be set in message, if any
469 * Consumes buffer at failure
8db1bae3
JPM
470 * Returns true if success, otherwise false
471 */
bcd3ffd4 472bool tipc_msg_reverse(u32 own_node, struct sk_buff **skb, int err)
8db1bae3 473{
29042e19
JPM
474 struct sk_buff *_skb = *skb;
475 struct tipc_msg *hdr = buf_msg(_skb);
8db1bae3 476 struct tipc_msg ohdr;
29042e19 477 int dlen = min_t(uint, msg_data_sz(hdr), MAX_FORWARD_SIZE);
8db1bae3 478
29042e19 479 if (skb_linearize(_skb))
8db1bae3 480 goto exit;
29042e19
JPM
481 hdr = buf_msg(_skb);
482 if (msg_dest_droppable(hdr))
ac0074ee 483 goto exit;
29042e19 484 if (msg_errcode(hdr))
8db1bae3 485 goto exit;
29042e19
JPM
486
487 /* Take a copy of original header before altering message */
488 memcpy(&ohdr, hdr, msg_hdr_sz(hdr));
489
490 /* Never return SHORT header; expand by replacing buffer if necessary */
491 if (msg_short(hdr)) {
492 *skb = tipc_buf_acquire(BASIC_H_SIZE + dlen);
493 if (!*skb)
494 goto exit;
495 memcpy((*skb)->data + BASIC_H_SIZE, msg_data(hdr), dlen);
496 kfree_skb(_skb);
497 _skb = *skb;
498 hdr = buf_msg(_skb);
499 memcpy(hdr, &ohdr, BASIC_H_SIZE);
500 msg_set_hdr_sz(hdr, BASIC_H_SIZE);
8db1bae3 501 }
29042e19
JPM
502
503 /* Now reverse the concerned fields */
504 msg_set_errcode(hdr, err);
505 msg_set_origport(hdr, msg_destport(&ohdr));
506 msg_set_destport(hdr, msg_origport(&ohdr));
507 msg_set_destnode(hdr, msg_prevnode(&ohdr));
508 msg_set_prevnode(hdr, own_node);
509 msg_set_orignode(hdr, own_node);
510 msg_set_size(hdr, msg_hdr_sz(hdr) + dlen);
29042e19
JPM
511 skb_trim(_skb, msg_size(hdr));
512 skb_orphan(_skb);
8db1bae3
JPM
513 return true;
514exit:
29042e19
JPM
515 kfree_skb(_skb);
516 *skb = NULL;
8db1bae3
JPM
517 return false;
518}
5a379074
JPM
519
520/**
e3a77561
JPM
521 * tipc_msg_lookup_dest(): try to find new destination for named message
522 * @skb: the buffer containing the message.
cda3696d 523 * @err: error code to be used by caller if lookup fails
5a379074 524 * Does not consume buffer
e3a77561 525 * Returns true if a destination is found, false otherwise
5a379074 526 */
cda3696d 527bool tipc_msg_lookup_dest(struct net *net, struct sk_buff *skb, int *err)
5a379074 528{
e3a77561 529 struct tipc_msg *msg = buf_msg(skb);
cda3696d
JPM
530 u32 dport, dnode;
531 u32 onode = tipc_own_addr(net);
5a379074 532
e3a77561
JPM
533 if (!msg_isdata(msg))
534 return false;
535 if (!msg_named(msg))
536 return false;
d482994f
JPM
537 if (msg_errcode(msg))
538 return false;
e3a77561
JPM
539 *err = -TIPC_ERR_NO_NAME;
540 if (skb_linearize(skb))
541 return false;
4e3ae001 542 msg = buf_msg(skb);
d482994f 543 if (msg_reroute_cnt(msg))
e3a77561 544 return false;
cda3696d 545 dnode = addr_domain(net, msg_lookup_scope(msg));
4ac1c8d0 546 dport = tipc_nametbl_translate(net, msg_nametype(msg),
cda3696d 547 msg_nameinst(msg), &dnode);
5a379074 548 if (!dport)
e3a77561 549 return false;
5a379074 550 msg_incr_reroute_cnt(msg);
cda3696d
JPM
551 if (dnode != onode)
552 msg_set_prevnode(msg, onode);
553 msg_set_destnode(msg, dnode);
5a379074 554 msg_set_destport(msg, dport);
e3a77561
JPM
555 *err = TIPC_OK;
556 return true;
5a379074 557}
078bec82
JPM
558
559/* tipc_msg_reassemble() - clone a buffer chain of fragments and
560 * reassemble the clones into one message
561 */
a6ca1094 562struct sk_buff *tipc_msg_reassemble(struct sk_buff_head *list)
078bec82 563{
a6ca1094
YX
564 struct sk_buff *skb;
565 struct sk_buff *frag = NULL;
078bec82
JPM
566 struct sk_buff *head = NULL;
567 int hdr_sz;
568
569 /* Copy header if single buffer */
a6ca1094
YX
570 if (skb_queue_len(list) == 1) {
571 skb = skb_peek(list);
572 hdr_sz = skb_headroom(skb) + msg_hdr_sz(buf_msg(skb));
573 return __pskb_copy(skb, hdr_sz, GFP_ATOMIC);
078bec82
JPM
574 }
575
576 /* Clone all fragments and reassemble */
a6ca1094
YX
577 skb_queue_walk(list, skb) {
578 frag = skb_clone(skb, GFP_ATOMIC);
078bec82
JPM
579 if (!frag)
580 goto error;
581 frag->next = NULL;
582 if (tipc_buf_append(&head, &frag))
583 break;
584 if (!head)
585 goto error;
078bec82
JPM
586 }
587 return frag;
588error:
589 pr_warn("Failed do clone local mcast rcv buffer\n");
590 kfree_skb(head);
591 return NULL;
592}
This page took 0.707047 seconds and 5 git commands to generate.