2006-01-02 18:04:38 +00:00
|
|
|
/*
|
|
|
|
* net/tipc/msg.c: TIPC message header routines
|
2007-02-09 14:25:21 +00:00
|
|
|
*
|
2006-01-11 18:14:19 +00:00
|
|
|
* Copyright (c) 2000-2006, Ericsson AB
|
2011-01-25 18:33:31 +00:00
|
|
|
* Copyright (c) 2005, 2010-2011, Wind River Systems
|
2006-01-02 18:04:38 +00:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
2006-01-11 12:30:43 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
2006-01-02 18:04:38 +00:00
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
2006-01-11 12:30:43 +00:00
|
|
|
* 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.
|
2006-01-02 18:04:38 +00:00
|
|
|
*
|
2006-01-11 12:30:43 +00:00
|
|
|
* 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
|
2006-01-02 18:04:38 +00:00
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "core.h"
|
|
|
|
#include "msg.h"
|
|
|
|
|
2010-05-11 14:30:18 +00:00
|
|
|
u32 tipc_msg_tot_importance(struct tipc_msg *m)
|
|
|
|
{
|
|
|
|
if (likely(msg_isdata(m))) {
|
|
|
|
if (likely(msg_orignode(m) == tipc_own_addr))
|
|
|
|
return msg_importance(m);
|
|
|
|
return msg_importance(m) + 4;
|
|
|
|
}
|
|
|
|
if ((msg_user(m) == MSG_FRAGMENTER) &&
|
|
|
|
(msg_type(m) == FIRST_FRAGMENT))
|
|
|
|
return msg_importance(msg_get_wrapped(m));
|
|
|
|
return msg_importance(m);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void tipc_msg_init(struct tipc_msg *m, u32 user, u32 type,
|
|
|
|
u32 hsize, u32 destnode)
|
|
|
|
{
|
|
|
|
memset(m, 0, hsize);
|
|
|
|
msg_set_version(m);
|
|
|
|
msg_set_user(m, user);
|
|
|
|
msg_set_hdr_sz(m, hsize);
|
|
|
|
msg_set_size(m, hsize);
|
|
|
|
msg_set_prevnode(m, tipc_own_addr);
|
|
|
|
msg_set_type(m, type);
|
2011-05-31 18:35:18 +00:00
|
|
|
msg_set_orignode(m, tipc_own_addr);
|
|
|
|
msg_set_destnode(m, destnode);
|
2010-05-11 14:30:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* tipc_msg_build - create message using specified header and data
|
|
|
|
*
|
|
|
|
* Note: Caller must not hold any locks in case copy_from_user() is interrupted!
|
|
|
|
*
|
|
|
|
* Returns message data size or errno
|
|
|
|
*/
|
tipc: Avoid recomputation of outgoing message length
Rework TIPC's message sending routines to take advantage of the total
amount of data value passed to it by the kernel socket infrastructure.
This change eliminates the need for TIPC to compute the size of outgoing
messages itself, as well as the check for an oversize message in
tipc_msg_build(). In addition, this change warrants an explanation:
- res = send_packet(NULL, sock, &my_msg, 0);
+ res = send_packet(NULL, sock, &my_msg, bytes_to_send);
Previously, the final argument to send_packet() was ignored (since the
amount of data being sent was recalculated by a lower-level routine)
and we could just pass in a dummy value (0). Now that the
recalculation is being eliminated, the argument value being passed to
send_packet() is significant and we have to supply the actual amount
of data we want to send.
Signed-off-by: Allan Stephens <Allan.Stephens@windriver.com>
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
2011-04-21 15:42:07 +00:00
|
|
|
int tipc_msg_build(struct tipc_msg *hdr, struct iovec const *msg_sect,
|
|
|
|
u32 num_sect, unsigned int total_len,
|
2010-12-31 18:59:32 +00:00
|
|
|
int max_size, int usrmem, struct sk_buff **buf)
|
2010-05-11 14:30:18 +00:00
|
|
|
{
|
|
|
|
int dsz, sz, hsz, pos, res, cnt;
|
|
|
|
|
tipc: Avoid recomputation of outgoing message length
Rework TIPC's message sending routines to take advantage of the total
amount of data value passed to it by the kernel socket infrastructure.
This change eliminates the need for TIPC to compute the size of outgoing
messages itself, as well as the check for an oversize message in
tipc_msg_build(). In addition, this change warrants an explanation:
- res = send_packet(NULL, sock, &my_msg, 0);
+ res = send_packet(NULL, sock, &my_msg, bytes_to_send);
Previously, the final argument to send_packet() was ignored (since the
amount of data being sent was recalculated by a lower-level routine)
and we could just pass in a dummy value (0). Now that the
recalculation is being eliminated, the argument value being passed to
send_packet() is significant and we have to supply the actual amount
of data we want to send.
Signed-off-by: Allan Stephens <Allan.Stephens@windriver.com>
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
2011-04-21 15:42:07 +00:00
|
|
|
dsz = total_len;
|
2010-05-11 14:30:18 +00:00
|
|
|
pos = hsz = msg_hdr_sz(hdr);
|
|
|
|
sz = hsz + dsz;
|
|
|
|
msg_set_size(hdr, sz);
|
|
|
|
if (unlikely(sz > max_size)) {
|
|
|
|
*buf = NULL;
|
|
|
|
return dsz;
|
|
|
|
}
|
|
|
|
|
2010-10-13 13:20:35 +00:00
|
|
|
*buf = tipc_buf_acquire(sz);
|
2010-05-11 14:30:18 +00:00
|
|
|
if (!(*buf))
|
|
|
|
return -ENOMEM;
|
|
|
|
skb_copy_to_linear_data(*buf, hdr, hsz);
|
|
|
|
for (res = 1, cnt = 0; res && (cnt < num_sect); cnt++) {
|
|
|
|
if (likely(usrmem))
|
|
|
|
res = !copy_from_user((*buf)->data + pos,
|
|
|
|
msg_sect[cnt].iov_base,
|
|
|
|
msg_sect[cnt].iov_len);
|
|
|
|
else
|
|
|
|
skb_copy_to_linear_data_offset(*buf, pos,
|
|
|
|
msg_sect[cnt].iov_base,
|
|
|
|
msg_sect[cnt].iov_len);
|
|
|
|
pos += msg_sect[cnt].iov_len;
|
|
|
|
}
|
|
|
|
if (likely(res))
|
|
|
|
return dsz;
|
|
|
|
|
2011-11-04 17:24:29 +00:00
|
|
|
kfree_skb(*buf);
|
2010-05-11 14:30:18 +00:00
|
|
|
*buf = NULL;
|
|
|
|
return -EFAULT;
|
|
|
|
}
|