msg.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  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. #include "core.h"
  37. #include "msg.h"
  38. u32 tipc_msg_tot_importance(struct tipc_msg *m)
  39. {
  40. if (likely(msg_isdata(m))) {
  41. if (likely(msg_orignode(m) == tipc_own_addr))
  42. return msg_importance(m);
  43. return msg_importance(m) + 4;
  44. }
  45. if ((msg_user(m) == MSG_FRAGMENTER) &&
  46. (msg_type(m) == FIRST_FRAGMENT))
  47. return msg_importance(msg_get_wrapped(m));
  48. return msg_importance(m);
  49. }
  50. void tipc_msg_init(struct tipc_msg *m, u32 user, u32 type, u32 hsize,
  51. u32 destnode)
  52. {
  53. memset(m, 0, hsize);
  54. msg_set_version(m);
  55. msg_set_user(m, user);
  56. msg_set_hdr_sz(m, hsize);
  57. msg_set_size(m, hsize);
  58. msg_set_prevnode(m, tipc_own_addr);
  59. msg_set_type(m, type);
  60. msg_set_orignode(m, tipc_own_addr);
  61. msg_set_destnode(m, destnode);
  62. }
  63. /**
  64. * tipc_msg_build - create message using specified header and data
  65. *
  66. * Note: Caller must not hold any locks in case copy_from_user() is interrupted!
  67. *
  68. * Returns message data size or errno
  69. */
  70. int tipc_msg_build(struct tipc_msg *hdr, struct iovec const *msg_sect,
  71. unsigned int len, int max_size, struct sk_buff **buf)
  72. {
  73. int dsz, sz, hsz;
  74. unsigned char *to;
  75. dsz = len;
  76. hsz = msg_hdr_sz(hdr);
  77. sz = hsz + dsz;
  78. msg_set_size(hdr, sz);
  79. if (unlikely(sz > max_size)) {
  80. *buf = NULL;
  81. return dsz;
  82. }
  83. *buf = tipc_buf_acquire(sz);
  84. if (!(*buf))
  85. return -ENOMEM;
  86. skb_copy_to_linear_data(*buf, hdr, hsz);
  87. to = (*buf)->data + hsz;
  88. if (len && memcpy_fromiovecend(to, msg_sect, 0, dsz)) {
  89. kfree_skb(*buf);
  90. *buf = NULL;
  91. return -EFAULT;
  92. }
  93. return dsz;
  94. }
  95. /* tipc_buf_append(): Append a buffer to the fragment list of another buffer
  96. * @*headbuf: in: NULL for first frag, otherwise value returned from prev call
  97. * out: set when successful non-complete reassembly, otherwise NULL
  98. * @*buf: in: the buffer to append. Always defined
  99. * out: head buf after sucessful complete reassembly, otherwise NULL
  100. * Returns 1 when reassembly complete, otherwise 0
  101. */
  102. int tipc_buf_append(struct sk_buff **headbuf, struct sk_buff **buf)
  103. {
  104. struct sk_buff *head = *headbuf;
  105. struct sk_buff *frag = *buf;
  106. struct sk_buff *tail;
  107. struct tipc_msg *msg = buf_msg(frag);
  108. u32 fragid = msg_type(msg);
  109. bool headstolen;
  110. int delta;
  111. skb_pull(frag, msg_hdr_sz(msg));
  112. if (fragid == FIRST_FRAGMENT) {
  113. if (head || skb_unclone(frag, GFP_ATOMIC))
  114. goto out_free;
  115. head = *headbuf = frag;
  116. skb_frag_list_init(head);
  117. *buf = NULL;
  118. return 0;
  119. }
  120. if (!head)
  121. goto out_free;
  122. tail = TIPC_SKB_CB(head)->tail;
  123. if (skb_try_coalesce(head, frag, &headstolen, &delta)) {
  124. kfree_skb_partial(frag, headstolen);
  125. } else {
  126. if (!skb_has_frag_list(head))
  127. skb_shinfo(head)->frag_list = frag;
  128. else
  129. tail->next = frag;
  130. head->truesize += frag->truesize;
  131. head->data_len += frag->len;
  132. head->len += frag->len;
  133. TIPC_SKB_CB(head)->tail = frag;
  134. }
  135. if (fragid == LAST_FRAGMENT) {
  136. *buf = head;
  137. TIPC_SKB_CB(head)->tail = NULL;
  138. *headbuf = NULL;
  139. return 1;
  140. }
  141. *buf = NULL;
  142. return 0;
  143. out_free:
  144. pr_warn_ratelimited("Unable to build fragment list\n");
  145. kfree_skb(*buf);
  146. kfree_skb(*headbuf);
  147. *buf = *headbuf = NULL;
  148. return 0;
  149. }