blob: 74745a47d72ae1c0ce84c6ff5b096682410a0789 [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/msg.c: TIPC message header routines
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Jon Paul Maloy37e22162014-05-14 05:39:12 -04004 * Copyright (c) 2000-2006, 2014, Ericsson AB
Allan Stephens741de3e2011-01-25 13:33:31 -05005 * Copyright (c) 2005, 2010-2011, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * All rights reserved.
7 *
Per Liden9ea1fd32006-01-11 13:30:43 +01008 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +01009 * modification, are permitted provided that the following conditions are met:
10 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 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.
Per Lidenb97bf3f2006-01-02 19:04:38 +010019 *
Per Liden9ea1fd32006-01-11 13:30:43 +010020 * 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
Per Lidenb97bf3f2006-01-02 19:04:38 +010034 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010038#include "msg.h"
Jon Paul Maloy5a379072014-06-25 20:41:36 -050039#include "addr.h"
40#include "name_table.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010041
Jon Paul Maloy8db1bae2014-06-25 20:41:35 -050042#define MAX_FORWARD_SIZE 1024
43
Jon Paul Maloy4f1688b2014-06-25 20:41:32 -050044static unsigned int align(unsigned int i)
Allan Stephens23461e82010-05-11 14:30:18 +000045{
Jon Paul Maloy4f1688b2014-06-25 20:41:32 -050046 return (i + 3) & ~3u;
Allan Stephens23461e82010-05-11 14:30:18 +000047}
48
Paul Gortmakerae8509c2013-06-17 10:54:47 -040049void tipc_msg_init(struct tipc_msg *m, u32 user, u32 type, u32 hsize,
50 u32 destnode)
Allan Stephens23461e82010-05-11 14:30:18 +000051{
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);
Jon Paul Maloy1dd0bd22014-08-22 18:09:06 -040059 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;
Allan Stephens23461e82010-05-11 14:30:18 +000088}
89
Jon Paul Maloy37e22162014-05-14 05:39:12 -040090/* tipc_buf_append(): Append a buffer to the fragment list of another buffer
Jon Paul Maloy29322d02014-07-05 13:44:13 -040091 * @*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
Jon Paul Maloy37e22162014-05-14 05:39:12 -040096 */
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;
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400102 struct tipc_msg *msg;
103 u32 fragid;
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400104 int delta;
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400105 bool headstolen;
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400106
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400107 if (!frag)
108 goto err;
109
110 msg = buf_msg(frag);
111 fragid = msg_type(msg);
112 frag->next = NULL;
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400113 skb_pull(frag, msg_hdr_sz(msg));
114
115 if (fragid == FIRST_FRAGMENT) {
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400116 if (unlikely(head))
117 goto err;
118 if (unlikely(skb_unclone(frag, GFP_ATOMIC)))
119 goto err;
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400120 head = *headbuf = frag;
121 skb_frag_list_init(head);
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400122 TIPC_SKB_CB(head)->tail = NULL;
Jon Paul Maloy29322d02014-07-05 13:44:13 -0400123 *buf = NULL;
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400124 return 0;
125 }
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400126
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400127 if (!head)
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400128 goto err;
129
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400130 if (skb_try_coalesce(head, frag, &headstolen, &delta)) {
131 kfree_skb_partial(frag, headstolen);
132 } else {
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400133 tail = TIPC_SKB_CB(head)->tail;
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400134 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 }
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400143
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400144 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;
Jon Paul Maloy13e9b992014-07-25 14:48:09 -0400152
153err:
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400154 pr_warn_ratelimited("Unable to build fragment list\n");
155 kfree_skb(*buf);
Jon Paul Maloy29322d02014-07-05 13:44:13 -0400156 kfree_skb(*headbuf);
157 *buf = *headbuf = NULL;
Jon Paul Maloy37e22162014-05-14 05:39:12 -0400158 return 0;
159}
Jon Paul Maloy4f1688b2014-06-25 20:41:32 -0500160
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500161
162/**
Jon Paul Maloy9fbfb8b2014-07-16 20:41:03 -0400163 * tipc_msg_build - create buffer chain containing specified header and data
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500164 * @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 */
Jon Paul Maloy9fbfb8b2014-07-16 20:41:03 -0400172int tipc_msg_build(struct tipc_msg *mhdr, struct iovec const *iov,
173 int offset, int dsz, int pktmax , struct sk_buff **chain)
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500174{
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;
Jon Paul Maloy50100a52014-08-22 18:09:07 -0400185 uint chain_sz = 0;
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500186 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;
Jon Paul Maloy50100a52014-08-22 18:09:07 -0400196 TIPC_SKB_CB(buf)->chain_sz = 1;
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500197 if (!dsz || !memcpy_fromiovecend(pktpos, iov, offset, dsz))
198 return dsz;
199 rc = -EFAULT;
200 goto error;
201 }
202
203 /* Prepare reusable fragment header */
204 tipc_msg_init(&pkthdr, MSG_FRAGMENTER, FIRST_FRAGMENT,
205 INT_H_SIZE, msg_destnode(mhdr));
206 msg_set_size(&pkthdr, pktmax);
207 msg_set_fragm_no(&pkthdr, pktno);
208
209 /* Prepare first fragment */
210 *chain = buf = tipc_buf_acquire(pktmax);
211 if (!buf)
212 return -ENOMEM;
Jon Paul Maloy50100a52014-08-22 18:09:07 -0400213 chain_sz = 1;
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500214 pktpos = buf->data;
215 skb_copy_to_linear_data(buf, &pkthdr, INT_H_SIZE);
216 pktpos += INT_H_SIZE;
217 pktrem -= INT_H_SIZE;
218 skb_copy_to_linear_data_offset(buf, INT_H_SIZE, mhdr, mhsz);
219 pktpos += mhsz;
220 pktrem -= mhsz;
221
222 do {
223 if (drem < pktrem)
224 pktrem = drem;
225
226 if (memcpy_fromiovecend(pktpos, iov, offset, pktrem)) {
227 rc = -EFAULT;
228 goto error;
229 }
230 drem -= pktrem;
231 offset += pktrem;
232
233 if (!drem)
234 break;
235
236 /* Prepare new fragment: */
237 if (drem < (pktmax - INT_H_SIZE))
238 pktsz = drem + INT_H_SIZE;
239 else
240 pktsz = pktmax;
241 prev = buf;
242 buf = tipc_buf_acquire(pktsz);
243 if (!buf) {
244 rc = -ENOMEM;
245 goto error;
246 }
Jon Paul Maloy50100a52014-08-22 18:09:07 -0400247 chain_sz++;
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500248 prev->next = buf;
249 msg_set_type(&pkthdr, FRAGMENT);
250 msg_set_size(&pkthdr, pktsz);
251 msg_set_fragm_no(&pkthdr, ++pktno);
252 skb_copy_to_linear_data(buf, &pkthdr, INT_H_SIZE);
253 pktpos = buf->data + INT_H_SIZE;
254 pktrem = pktsz - INT_H_SIZE;
255
256 } while (1);
Jon Paul Maloy50100a52014-08-22 18:09:07 -0400257 TIPC_SKB_CB(*chain)->chain_sz = chain_sz;
Jon Paul Maloy067608e2014-06-25 20:41:34 -0500258 msg_set_type(buf_msg(buf), LAST_FRAGMENT);
259 return dsz;
260error:
261 kfree_skb_list(*chain);
262 *chain = NULL;
263 return rc;
264}
265
Jon Paul Maloy4f1688b2014-06-25 20:41:32 -0500266/**
267 * tipc_msg_bundle(): Append contents of a buffer to tail of an existing one
268 * @bbuf: the existing buffer ("bundle")
269 * @buf: buffer to be appended
270 * @mtu: max allowable size for the bundle buffer
271 * Consumes buffer if successful
272 * Returns true if bundling could be performed, otherwise false
273 */
274bool tipc_msg_bundle(struct sk_buff *bbuf, struct sk_buff *buf, u32 mtu)
275{
276 struct tipc_msg *bmsg = buf_msg(bbuf);
277 struct tipc_msg *msg = buf_msg(buf);
278 unsigned int bsz = msg_size(bmsg);
279 unsigned int msz = msg_size(msg);
280 u32 start = align(bsz);
281 u32 max = mtu - INT_H_SIZE;
282 u32 pad = start - bsz;
283
284 if (likely(msg_user(msg) == MSG_FRAGMENTER))
285 return false;
286 if (unlikely(msg_user(msg) == CHANGEOVER_PROTOCOL))
287 return false;
288 if (unlikely(msg_user(msg) == BCAST_PROTOCOL))
289 return false;
290 if (likely(msg_user(bmsg) != MSG_BUNDLER))
291 return false;
292 if (likely(msg_type(bmsg) != BUNDLE_OPEN))
293 return false;
294 if (unlikely(skb_tailroom(bbuf) < (pad + msz)))
295 return false;
296 if (unlikely(max < (start + msz)))
297 return false;
298
299 skb_put(bbuf, pad + msz);
300 skb_copy_to_linear_data_offset(bbuf, start, buf->data, msz);
301 msg_set_size(bmsg, start + msz);
302 msg_set_msgcnt(bmsg, msg_msgcnt(bmsg) + 1);
303 bbuf->next = buf->next;
304 kfree_skb(buf);
305 return true;
306}
307
308/**
309 * tipc_msg_make_bundle(): Create bundle buf and append message to its tail
310 * @buf: buffer to be appended and replaced
311 * @mtu: max allowable size for the bundle buffer, inclusive header
312 * @dnode: destination node for message. (Not always present in header)
313 * Replaces buffer if successful
314 * Returns true if sucess, otherwise false
315 */
316bool tipc_msg_make_bundle(struct sk_buff **buf, u32 mtu, u32 dnode)
317{
318 struct sk_buff *bbuf;
319 struct tipc_msg *bmsg;
320 struct tipc_msg *msg = buf_msg(*buf);
321 u32 msz = msg_size(msg);
322 u32 max = mtu - INT_H_SIZE;
323
324 if (msg_user(msg) == MSG_FRAGMENTER)
325 return false;
326 if (msg_user(msg) == CHANGEOVER_PROTOCOL)
327 return false;
328 if (msg_user(msg) == BCAST_PROTOCOL)
329 return false;
330 if (msz > (max / 2))
331 return false;
332
333 bbuf = tipc_buf_acquire(max);
334 if (!bbuf)
335 return false;
336
337 skb_trim(bbuf, INT_H_SIZE);
338 bmsg = buf_msg(bbuf);
339 tipc_msg_init(bmsg, MSG_BUNDLER, BUNDLE_OPEN, INT_H_SIZE, dnode);
340 msg_set_seqno(bmsg, msg_seqno(msg));
341 msg_set_ack(bmsg, msg_ack(msg));
342 msg_set_bcast_ack(bmsg, msg_bcast_ack(msg));
343 bbuf->next = (*buf)->next;
344 tipc_msg_bundle(bbuf, *buf, mtu);
345 *buf = bbuf;
346 return true;
347}
Jon Paul Maloy8db1bae2014-06-25 20:41:35 -0500348
349/**
350 * tipc_msg_reverse(): swap source and destination addresses and add error code
351 * @buf: buffer containing message to be reversed
352 * @dnode: return value: node where to send message after reversal
353 * @err: error code to be set in message
354 * Consumes buffer if failure
355 * Returns true if success, otherwise false
356 */
357bool tipc_msg_reverse(struct sk_buff *buf, u32 *dnode, int err)
358{
359 struct tipc_msg *msg = buf_msg(buf);
360 uint imp = msg_importance(msg);
361 struct tipc_msg ohdr;
362 uint rdsz = min_t(uint, msg_data_sz(msg), MAX_FORWARD_SIZE);
363
Jon Paul Maloyac0074e2014-06-25 20:41:41 -0500364 if (skb_linearize(buf))
Jon Paul Maloy8db1bae2014-06-25 20:41:35 -0500365 goto exit;
Jon Paul Maloyac0074e2014-06-25 20:41:41 -0500366 if (msg_dest_droppable(msg))
367 goto exit;
368 if (msg_errcode(msg))
Jon Paul Maloy8db1bae2014-06-25 20:41:35 -0500369 goto exit;
370
371 memcpy(&ohdr, msg, msg_hdr_sz(msg));
Jon Paul Maloyac0074e2014-06-25 20:41:41 -0500372 imp = min_t(uint, imp + 1, TIPC_CRITICAL_IMPORTANCE);
373 if (msg_isdata(msg))
374 msg_set_importance(msg, imp);
Jon Paul Maloy8db1bae2014-06-25 20:41:35 -0500375 msg_set_errcode(msg, err);
376 msg_set_origport(msg, msg_destport(&ohdr));
377 msg_set_destport(msg, msg_origport(&ohdr));
378 msg_set_prevnode(msg, tipc_own_addr);
379 if (!msg_short(msg)) {
380 msg_set_orignode(msg, msg_destnode(&ohdr));
381 msg_set_destnode(msg, msg_orignode(&ohdr));
382 }
383 msg_set_size(msg, msg_hdr_sz(msg) + rdsz);
384 skb_trim(buf, msg_size(msg));
385 skb_orphan(buf);
386 *dnode = msg_orignode(&ohdr);
387 return true;
388exit:
389 kfree_skb(buf);
390 return false;
391}
Jon Paul Maloy5a379072014-06-25 20:41:36 -0500392
393/**
394 * tipc_msg_eval: determine fate of message that found no destination
395 * @buf: the buffer containing the message.
396 * @dnode: return value: next-hop node, if message to be forwarded
397 * @err: error code to use, if message to be rejected
398 *
399 * Does not consume buffer
400 * Returns 0 (TIPC_OK) if message ok and we can try again, -TIPC error
401 * code if message to be rejected
402 */
403int tipc_msg_eval(struct sk_buff *buf, u32 *dnode)
404{
405 struct tipc_msg *msg = buf_msg(buf);
406 u32 dport;
407
408 if (msg_type(msg) != TIPC_NAMED_MSG)
409 return -TIPC_ERR_NO_PORT;
410 if (skb_linearize(buf))
411 return -TIPC_ERR_NO_NAME;
412 if (msg_data_sz(msg) > MAX_FORWARD_SIZE)
413 return -TIPC_ERR_NO_NAME;
414 if (msg_reroute_cnt(msg) > 0)
415 return -TIPC_ERR_NO_NAME;
416
417 *dnode = addr_domain(msg_lookup_scope(msg));
418 dport = tipc_nametbl_translate(msg_nametype(msg),
419 msg_nameinst(msg),
420 dnode);
421 if (!dport)
422 return -TIPC_ERR_NO_NAME;
423 msg_incr_reroute_cnt(msg);
424 msg_set_destnode(msg, *dnode);
425 msg_set_destport(msg, dport);
426 return TIPC_OK;
427}
Jon Paul Maloy078bec82014-07-16 20:41:00 -0400428
429/* tipc_msg_reassemble() - clone a buffer chain of fragments and
430 * reassemble the clones into one message
431 */
432struct sk_buff *tipc_msg_reassemble(struct sk_buff *chain)
433{
434 struct sk_buff *buf = chain;
435 struct sk_buff *frag = buf;
436 struct sk_buff *head = NULL;
437 int hdr_sz;
438
439 /* Copy header if single buffer */
440 if (!buf->next) {
441 hdr_sz = skb_headroom(buf) + msg_hdr_sz(buf_msg(buf));
442 return __pskb_copy(buf, hdr_sz, GFP_ATOMIC);
443 }
444
445 /* Clone all fragments and reassemble */
446 while (buf) {
447 frag = skb_clone(buf, GFP_ATOMIC);
448 if (!frag)
449 goto error;
450 frag->next = NULL;
451 if (tipc_buf_append(&head, &frag))
452 break;
453 if (!head)
454 goto error;
455 buf = buf->next;
456 }
457 return frag;
458error:
459 pr_warn("Failed do clone local mcast rcv buffer\n");
460 kfree_skb(head);
461 return NULL;
462}