cfpkt_skbuff.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389
  1. /*
  2. * Copyright (C) ST-Ericsson AB 2010
  3. * Author: Sjur Brendeland
  4. * License terms: GNU General Public License (GPL) version 2
  5. */
  6. #define pr_fmt(fmt) KBUILD_MODNAME ":%s(): " fmt, __func__
  7. #include <linux/string.h>
  8. #include <linux/skbuff.h>
  9. #include <linux/hardirq.h>
  10. #include <linux/export.h>
  11. #include <net/caif/cfpkt.h>
  12. #define PKT_PREFIX 48
  13. #define PKT_POSTFIX 2
  14. #define PKT_LEN_WHEN_EXTENDING 128
  15. #define PKT_ERROR(pkt, errmsg) \
  16. do { \
  17. cfpkt_priv(pkt)->erronous = true; \
  18. skb_reset_tail_pointer(&pkt->skb); \
  19. pr_warn(errmsg); \
  20. } while (0)
  21. struct cfpktq {
  22. struct sk_buff_head head;
  23. atomic_t count;
  24. /* Lock protects count updates */
  25. spinlock_t lock;
  26. };
  27. /*
  28. * net/caif/ is generic and does not
  29. * understand SKB, so we do this typecast
  30. */
  31. struct cfpkt {
  32. struct sk_buff skb;
  33. };
  34. /* Private data inside SKB */
  35. struct cfpkt_priv_data {
  36. struct dev_info dev_info;
  37. bool erronous;
  38. };
  39. static inline struct cfpkt_priv_data *cfpkt_priv(struct cfpkt *pkt)
  40. {
  41. return (struct cfpkt_priv_data *) pkt->skb.cb;
  42. }
  43. static inline bool is_erronous(struct cfpkt *pkt)
  44. {
  45. return cfpkt_priv(pkt)->erronous;
  46. }
  47. static inline struct sk_buff *pkt_to_skb(struct cfpkt *pkt)
  48. {
  49. return &pkt->skb;
  50. }
  51. static inline struct cfpkt *skb_to_pkt(struct sk_buff *skb)
  52. {
  53. return (struct cfpkt *) skb;
  54. }
  55. struct cfpkt *cfpkt_fromnative(enum caif_direction dir, void *nativepkt)
  56. {
  57. struct cfpkt *pkt = skb_to_pkt(nativepkt);
  58. cfpkt_priv(pkt)->erronous = false;
  59. return pkt;
  60. }
  61. EXPORT_SYMBOL(cfpkt_fromnative);
  62. void *cfpkt_tonative(struct cfpkt *pkt)
  63. {
  64. return (void *) pkt;
  65. }
  66. EXPORT_SYMBOL(cfpkt_tonative);
  67. static struct cfpkt *cfpkt_create_pfx(u16 len, u16 pfx)
  68. {
  69. struct sk_buff *skb;
  70. skb = alloc_skb(len + pfx, GFP_ATOMIC);
  71. if (unlikely(skb == NULL))
  72. return NULL;
  73. skb_reserve(skb, pfx);
  74. return skb_to_pkt(skb);
  75. }
  76. inline struct cfpkt *cfpkt_create(u16 len)
  77. {
  78. return cfpkt_create_pfx(len + PKT_POSTFIX, PKT_PREFIX);
  79. }
  80. void cfpkt_destroy(struct cfpkt *pkt)
  81. {
  82. struct sk_buff *skb = pkt_to_skb(pkt);
  83. kfree_skb(skb);
  84. }
  85. inline bool cfpkt_more(struct cfpkt *pkt)
  86. {
  87. struct sk_buff *skb = pkt_to_skb(pkt);
  88. return skb->len > 0;
  89. }
  90. int cfpkt_peek_head(struct cfpkt *pkt, void *data, u16 len)
  91. {
  92. struct sk_buff *skb = pkt_to_skb(pkt);
  93. if (skb_headlen(skb) >= len) {
  94. memcpy(data, skb->data, len);
  95. return 0;
  96. }
  97. return !cfpkt_extr_head(pkt, data, len) &&
  98. !cfpkt_add_head(pkt, data, len);
  99. }
  100. int cfpkt_extr_head(struct cfpkt *pkt, void *data, u16 len)
  101. {
  102. struct sk_buff *skb = pkt_to_skb(pkt);
  103. u8 *from;
  104. if (unlikely(is_erronous(pkt)))
  105. return -EPROTO;
  106. if (unlikely(len > skb->len)) {
  107. PKT_ERROR(pkt, "read beyond end of packet\n");
  108. return -EPROTO;
  109. }
  110. if (unlikely(len > skb_headlen(skb))) {
  111. if (unlikely(skb_linearize(skb) != 0)) {
  112. PKT_ERROR(pkt, "linearize failed\n");
  113. return -EPROTO;
  114. }
  115. }
  116. from = skb_pull(skb, len);
  117. from -= len;
  118. if (data)
  119. memcpy(data, from, len);
  120. return 0;
  121. }
  122. EXPORT_SYMBOL(cfpkt_extr_head);
  123. int cfpkt_extr_trail(struct cfpkt *pkt, void *dta, u16 len)
  124. {
  125. struct sk_buff *skb = pkt_to_skb(pkt);
  126. u8 *data = dta;
  127. u8 *from;
  128. if (unlikely(is_erronous(pkt)))
  129. return -EPROTO;
  130. if (unlikely(skb_linearize(skb) != 0)) {
  131. PKT_ERROR(pkt, "linearize failed\n");
  132. return -EPROTO;
  133. }
  134. if (unlikely(skb->data + len > skb_tail_pointer(skb))) {
  135. PKT_ERROR(pkt, "read beyond end of packet\n");
  136. return -EPROTO;
  137. }
  138. from = skb_tail_pointer(skb) - len;
  139. skb_trim(skb, skb->len - len);
  140. memcpy(data, from, len);
  141. return 0;
  142. }
  143. int cfpkt_pad_trail(struct cfpkt *pkt, u16 len)
  144. {
  145. return cfpkt_add_body(pkt, NULL, len);
  146. }
  147. int cfpkt_add_body(struct cfpkt *pkt, const void *data, u16 len)
  148. {
  149. struct sk_buff *skb = pkt_to_skb(pkt);
  150. struct sk_buff *lastskb;
  151. u8 *to;
  152. u16 addlen = 0;
  153. if (unlikely(is_erronous(pkt)))
  154. return -EPROTO;
  155. lastskb = skb;
  156. /* Check whether we need to add space at the tail */
  157. if (unlikely(skb_tailroom(skb) < len)) {
  158. if (likely(len < PKT_LEN_WHEN_EXTENDING))
  159. addlen = PKT_LEN_WHEN_EXTENDING;
  160. else
  161. addlen = len;
  162. }
  163. /* Check whether we need to change the SKB before writing to the tail */
  164. if (unlikely((addlen > 0) || skb_cloned(skb) || skb_shared(skb))) {
  165. /* Make sure data is writable */
  166. if (unlikely(skb_cow_data(skb, addlen, &lastskb) < 0)) {
  167. PKT_ERROR(pkt, "cow failed\n");
  168. return -EPROTO;
  169. }
  170. }
  171. /* All set to put the last SKB and optionally write data there. */
  172. to = pskb_put(skb, lastskb, len);
  173. if (likely(data))
  174. memcpy(to, data, len);
  175. return 0;
  176. }
  177. inline int cfpkt_addbdy(struct cfpkt *pkt, u8 data)
  178. {
  179. return cfpkt_add_body(pkt, &data, 1);
  180. }
  181. int cfpkt_add_head(struct cfpkt *pkt, const void *data2, u16 len)
  182. {
  183. struct sk_buff *skb = pkt_to_skb(pkt);
  184. struct sk_buff *lastskb;
  185. u8 *to;
  186. const u8 *data = data2;
  187. int ret;
  188. if (unlikely(is_erronous(pkt)))
  189. return -EPROTO;
  190. if (unlikely(skb_headroom(skb) < len)) {
  191. PKT_ERROR(pkt, "no headroom\n");
  192. return -EPROTO;
  193. }
  194. /* Make sure data is writable */
  195. ret = skb_cow_data(skb, 0, &lastskb);
  196. if (unlikely(ret < 0)) {
  197. PKT_ERROR(pkt, "cow failed\n");
  198. return ret;
  199. }
  200. to = skb_push(skb, len);
  201. memcpy(to, data, len);
  202. return 0;
  203. }
  204. EXPORT_SYMBOL(cfpkt_add_head);
  205. inline int cfpkt_add_trail(struct cfpkt *pkt, const void *data, u16 len)
  206. {
  207. return cfpkt_add_body(pkt, data, len);
  208. }
  209. inline u16 cfpkt_getlen(struct cfpkt *pkt)
  210. {
  211. struct sk_buff *skb = pkt_to_skb(pkt);
  212. return skb->len;
  213. }
  214. int cfpkt_iterate(struct cfpkt *pkt,
  215. u16 (*iter_func)(u16, void *, u16),
  216. u16 data)
  217. {
  218. /*
  219. * Don't care about the performance hit of linearizing,
  220. * Checksum should not be used on high-speed interfaces anyway.
  221. */
  222. if (unlikely(is_erronous(pkt)))
  223. return -EPROTO;
  224. if (unlikely(skb_linearize(&pkt->skb) != 0)) {
  225. PKT_ERROR(pkt, "linearize failed\n");
  226. return -EPROTO;
  227. }
  228. return iter_func(data, pkt->skb.data, cfpkt_getlen(pkt));
  229. }
  230. int cfpkt_setlen(struct cfpkt *pkt, u16 len)
  231. {
  232. struct sk_buff *skb = pkt_to_skb(pkt);
  233. if (unlikely(is_erronous(pkt)))
  234. return -EPROTO;
  235. if (likely(len <= skb->len)) {
  236. if (unlikely(skb->data_len))
  237. ___pskb_trim(skb, len);
  238. else
  239. skb_trim(skb, len);
  240. return cfpkt_getlen(pkt);
  241. }
  242. /* Need to expand SKB */
  243. if (unlikely(!cfpkt_pad_trail(pkt, len - skb->len)))
  244. PKT_ERROR(pkt, "skb_pad_trail failed\n");
  245. return cfpkt_getlen(pkt);
  246. }
  247. struct cfpkt *cfpkt_append(struct cfpkt *dstpkt,
  248. struct cfpkt *addpkt,
  249. u16 expectlen)
  250. {
  251. struct sk_buff *dst = pkt_to_skb(dstpkt);
  252. struct sk_buff *add = pkt_to_skb(addpkt);
  253. u16 addlen = skb_headlen(add);
  254. u16 neededtailspace;
  255. struct sk_buff *tmp;
  256. u16 dstlen;
  257. u16 createlen;
  258. if (unlikely(is_erronous(dstpkt) || is_erronous(addpkt))) {
  259. return dstpkt;
  260. }
  261. if (expectlen > addlen)
  262. neededtailspace = expectlen;
  263. else
  264. neededtailspace = addlen;
  265. if (dst->tail + neededtailspace > dst->end) {
  266. /* Create a dumplicate of 'dst' with more tail space */
  267. struct cfpkt *tmppkt;
  268. dstlen = skb_headlen(dst);
  269. createlen = dstlen + neededtailspace;
  270. tmppkt = cfpkt_create(createlen + PKT_PREFIX + PKT_POSTFIX);
  271. if (tmppkt == NULL)
  272. return NULL;
  273. tmp = pkt_to_skb(tmppkt);
  274. skb_set_tail_pointer(tmp, dstlen);
  275. tmp->len = dstlen;
  276. memcpy(tmp->data, dst->data, dstlen);
  277. cfpkt_destroy(dstpkt);
  278. dst = tmp;
  279. }
  280. memcpy(skb_tail_pointer(dst), add->data, skb_headlen(add));
  281. cfpkt_destroy(addpkt);
  282. dst->tail += addlen;
  283. dst->len += addlen;
  284. return skb_to_pkt(dst);
  285. }
  286. struct cfpkt *cfpkt_split(struct cfpkt *pkt, u16 pos)
  287. {
  288. struct sk_buff *skb2;
  289. struct sk_buff *skb = pkt_to_skb(pkt);
  290. struct cfpkt *tmppkt;
  291. u8 *split = skb->data + pos;
  292. u16 len2nd = skb_tail_pointer(skb) - split;
  293. if (unlikely(is_erronous(pkt)))
  294. return NULL;
  295. if (skb->data + pos > skb_tail_pointer(skb)) {
  296. PKT_ERROR(pkt, "trying to split beyond end of packet\n");
  297. return NULL;
  298. }
  299. /* Create a new packet for the second part of the data */
  300. tmppkt = cfpkt_create_pfx(len2nd + PKT_PREFIX + PKT_POSTFIX,
  301. PKT_PREFIX);
  302. if (tmppkt == NULL)
  303. return NULL;
  304. skb2 = pkt_to_skb(tmppkt);
  305. if (skb2 == NULL)
  306. return NULL;
  307. /* Reduce the length of the original packet */
  308. skb_set_tail_pointer(skb, pos);
  309. skb->len = pos;
  310. memcpy(skb2->data, split, len2nd);
  311. skb2->tail += len2nd;
  312. skb2->len += len2nd;
  313. skb2->priority = skb->priority;
  314. return skb_to_pkt(skb2);
  315. }
  316. bool cfpkt_erroneous(struct cfpkt *pkt)
  317. {
  318. return cfpkt_priv(pkt)->erronous;
  319. }
  320. struct caif_payload_info *cfpkt_info(struct cfpkt *pkt)
  321. {
  322. return (struct caif_payload_info *)&pkt_to_skb(pkt)->cb;
  323. }
  324. EXPORT_SYMBOL(cfpkt_info);
  325. void cfpkt_set_prio(struct cfpkt *pkt, int prio)
  326. {
  327. pkt_to_skb(pkt)->priority = prio;
  328. }
  329. EXPORT_SYMBOL(cfpkt_set_prio);