blob: df08c47183d477b96bf26cb026043f17c1abcf64 [file] [log] [blame]
Sjur Braendeland15c9ac02010-03-30 13:56:24 +00001/*
2 * Copyright (C) ST-Ericsson AB 2010
3 * Author: Sjur Brendeland/sjur.brandeland@stericsson.com
4 * License terms: GNU General Public License (GPL) version 2
5 */
6
Joe Perchesb31fa5b2010-09-05 21:31:11 +00007#define pr_fmt(fmt) KBUILD_MODNAME ":%s(): " fmt, __func__
8
Sjur Braendeland15c9ac02010-03-30 13:56:24 +00009#include <linux/string.h>
10#include <linux/skbuff.h>
11#include <linux/hardirq.h>
Paul Gortmakerbc3b2d72011-07-15 11:47:34 -040012#include <linux/export.h>
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000013#include <net/caif/cfpkt.h>
14
Sjur Braendeland24e263a2010-08-10 07:36:46 +000015#define PKT_PREFIX 48
Sjur Braendeland2aa40ae2010-06-17 06:55:40 +000016#define PKT_POSTFIX 2
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000017#define PKT_LEN_WHEN_EXTENDING 128
Joe Perchesb31fa5b2010-09-05 21:31:11 +000018#define PKT_ERROR(pkt, errmsg) \
19do { \
20 cfpkt_priv(pkt)->erronous = true; \
21 skb_reset_tail_pointer(&pkt->skb); \
22 pr_warn(errmsg); \
23} while (0)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000024
25struct cfpktq {
26 struct sk_buff_head head;
27 atomic_t count;
28 /* Lock protects count updates */
29 spinlock_t lock;
30};
31
32/*
33 * net/caif/ is generic and does not
34 * understand SKB, so we do this typecast
35 */
36struct cfpkt {
37 struct sk_buff skb;
38};
39
40/* Private data inside SKB */
41struct cfpkt_priv_data {
42 struct dev_info dev_info;
43 bool erronous;
44};
45
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000046static inline struct cfpkt_priv_data *cfpkt_priv(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000047{
48 return (struct cfpkt_priv_data *) pkt->skb.cb;
49}
50
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000051static inline bool is_erronous(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000052{
53 return cfpkt_priv(pkt)->erronous;
54}
55
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000056static inline struct sk_buff *pkt_to_skb(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000057{
58 return &pkt->skb;
59}
60
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000061static inline struct cfpkt *skb_to_pkt(struct sk_buff *skb)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000062{
63 return (struct cfpkt *) skb;
64}
65
66
67struct cfpkt *cfpkt_fromnative(enum caif_direction dir, void *nativepkt)
68{
69 struct cfpkt *pkt = skb_to_pkt(nativepkt);
70 cfpkt_priv(pkt)->erronous = false;
71 return pkt;
72}
73EXPORT_SYMBOL(cfpkt_fromnative);
74
75void *cfpkt_tonative(struct cfpkt *pkt)
76{
77 return (void *) pkt;
78}
79EXPORT_SYMBOL(cfpkt_tonative);
80
81static struct cfpkt *cfpkt_create_pfx(u16 len, u16 pfx)
82{
83 struct sk_buff *skb;
84
85 if (likely(in_interrupt()))
86 skb = alloc_skb(len + pfx, GFP_ATOMIC);
87 else
88 skb = alloc_skb(len + pfx, GFP_KERNEL);
89
90 if (unlikely(skb == NULL))
91 return NULL;
92
93 skb_reserve(skb, pfx);
94 return skb_to_pkt(skb);
95}
96
97inline struct cfpkt *cfpkt_create(u16 len)
98{
99 return cfpkt_create_pfx(len + PKT_POSTFIX, PKT_PREFIX);
100}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000101
102void cfpkt_destroy(struct cfpkt *pkt)
103{
104 struct sk_buff *skb = pkt_to_skb(pkt);
105 kfree_skb(skb);
106}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000107
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000108
109inline bool cfpkt_more(struct cfpkt *pkt)
110{
111 struct sk_buff *skb = pkt_to_skb(pkt);
112 return skb->len > 0;
113}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000114
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000115
116int cfpkt_peek_head(struct cfpkt *pkt, void *data, u16 len)
117{
118 struct sk_buff *skb = pkt_to_skb(pkt);
119 if (skb_headlen(skb) >= len) {
120 memcpy(data, skb->data, len);
121 return 0;
122 }
123 return !cfpkt_extr_head(pkt, data, len) &&
124 !cfpkt_add_head(pkt, data, len);
125}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000126
127int cfpkt_extr_head(struct cfpkt *pkt, void *data, u16 len)
128{
129 struct sk_buff *skb = pkt_to_skb(pkt);
130 u8 *from;
131 if (unlikely(is_erronous(pkt)))
132 return -EPROTO;
133
134 if (unlikely(len > skb->len)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000135 PKT_ERROR(pkt, "read beyond end of packet\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000136 return -EPROTO;
137 }
138
139 if (unlikely(len > skb_headlen(skb))) {
140 if (unlikely(skb_linearize(skb) != 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000141 PKT_ERROR(pkt, "linearize failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000142 return -EPROTO;
143 }
144 }
145 from = skb_pull(skb, len);
146 from -= len;
147 memcpy(data, from, len);
148 return 0;
149}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000150
151int cfpkt_extr_trail(struct cfpkt *pkt, void *dta, u16 len)
152{
153 struct sk_buff *skb = pkt_to_skb(pkt);
154 u8 *data = dta;
155 u8 *from;
156 if (unlikely(is_erronous(pkt)))
157 return -EPROTO;
158
159 if (unlikely(skb_linearize(skb) != 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000160 PKT_ERROR(pkt, "linearize failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000161 return -EPROTO;
162 }
163 if (unlikely(skb->data + len > skb_tail_pointer(skb))) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000164 PKT_ERROR(pkt, "read beyond end of packet\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000165 return -EPROTO;
166 }
167 from = skb_tail_pointer(skb) - len;
168 skb_trim(skb, skb->len - len);
169 memcpy(data, from, len);
170 return 0;
171}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000172
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000173
174int cfpkt_pad_trail(struct cfpkt *pkt, u16 len)
175{
176 return cfpkt_add_body(pkt, NULL, len);
177}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000178
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000179
180int cfpkt_add_body(struct cfpkt *pkt, const void *data, u16 len)
181{
182 struct sk_buff *skb = pkt_to_skb(pkt);
183 struct sk_buff *lastskb;
184 u8 *to;
185 u16 addlen = 0;
186
187
188 if (unlikely(is_erronous(pkt)))
189 return -EPROTO;
190
191 lastskb = skb;
192
193 /* Check whether we need to add space at the tail */
194 if (unlikely(skb_tailroom(skb) < len)) {
195 if (likely(len < PKT_LEN_WHEN_EXTENDING))
196 addlen = PKT_LEN_WHEN_EXTENDING;
197 else
198 addlen = len;
199 }
200
201 /* Check whether we need to change the SKB before writing to the tail */
202 if (unlikely((addlen > 0) || skb_cloned(skb) || skb_shared(skb))) {
203
204 /* Make sure data is writable */
205 if (unlikely(skb_cow_data(skb, addlen, &lastskb) < 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000206 PKT_ERROR(pkt, "cow failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000207 return -EPROTO;
208 }
209 /*
210 * Is the SKB non-linear after skb_cow_data()? If so, we are
211 * going to add data to the last SKB, so we need to adjust
212 * lengths of the top SKB.
213 */
214 if (lastskb != skb) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000215 pr_warn("Packet is non-linear\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000216 skb->len += len;
217 skb->data_len += len;
218 }
219 }
220
221 /* All set to put the last SKB and optionally write data there. */
222 to = skb_put(lastskb, len);
223 if (likely(data))
224 memcpy(to, data, len);
225 return 0;
226}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000227
228inline int cfpkt_addbdy(struct cfpkt *pkt, u8 data)
229{
230 return cfpkt_add_body(pkt, &data, 1);
231}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000232
233int cfpkt_add_head(struct cfpkt *pkt, const void *data2, u16 len)
234{
235 struct sk_buff *skb = pkt_to_skb(pkt);
236 struct sk_buff *lastskb;
237 u8 *to;
238 const u8 *data = data2;
Sjur Braendeland638e6282010-05-21 02:16:09 +0000239 int ret;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000240 if (unlikely(is_erronous(pkt)))
241 return -EPROTO;
242 if (unlikely(skb_headroom(skb) < len)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000243 PKT_ERROR(pkt, "no headroom\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000244 return -EPROTO;
245 }
246
247 /* Make sure data is writable */
Sjur Braendeland638e6282010-05-21 02:16:09 +0000248 ret = skb_cow_data(skb, 0, &lastskb);
249 if (unlikely(ret < 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000250 PKT_ERROR(pkt, "cow failed\n");
Sjur Braendeland638e6282010-05-21 02:16:09 +0000251 return ret;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000252 }
253
254 to = skb_push(skb, len);
255 memcpy(to, data, len);
256 return 0;
257}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000258
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000259
260inline int cfpkt_add_trail(struct cfpkt *pkt, const void *data, u16 len)
261{
262 return cfpkt_add_body(pkt, data, len);
263}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000264
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000265
266inline u16 cfpkt_getlen(struct cfpkt *pkt)
267{
268 struct sk_buff *skb = pkt_to_skb(pkt);
269 return skb->len;
270}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000271
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000272
273inline u16 cfpkt_iterate(struct cfpkt *pkt,
274 u16 (*iter_func)(u16, void *, u16),
275 u16 data)
276{
277 /*
278 * Don't care about the performance hit of linearizing,
279 * Checksum should not be used on high-speed interfaces anyway.
280 */
281 if (unlikely(is_erronous(pkt)))
282 return -EPROTO;
283 if (unlikely(skb_linearize(&pkt->skb) != 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000284 PKT_ERROR(pkt, "linearize failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000285 return -EPROTO;
286 }
287 return iter_func(data, pkt->skb.data, cfpkt_getlen(pkt));
288}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000289
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000290
291int cfpkt_setlen(struct cfpkt *pkt, u16 len)
292{
293 struct sk_buff *skb = pkt_to_skb(pkt);
294
295
296 if (unlikely(is_erronous(pkt)))
297 return -EPROTO;
298
299 if (likely(len <= skb->len)) {
300 if (unlikely(skb->data_len))
301 ___pskb_trim(skb, len);
302 else
303 skb_trim(skb, len);
304
305 return cfpkt_getlen(pkt);
306 }
307
308 /* Need to expand SKB */
309 if (unlikely(!cfpkt_pad_trail(pkt, len - skb->len)))
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000310 PKT_ERROR(pkt, "skb_pad_trail failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000311
312 return cfpkt_getlen(pkt);
313}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000314
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000315struct cfpkt *cfpkt_append(struct cfpkt *dstpkt,
316 struct cfpkt *addpkt,
317 u16 expectlen)
318{
319 struct sk_buff *dst = pkt_to_skb(dstpkt);
320 struct sk_buff *add = pkt_to_skb(addpkt);
321 u16 addlen = skb_headlen(add);
322 u16 neededtailspace;
323 struct sk_buff *tmp;
324 u16 dstlen;
325 u16 createlen;
326 if (unlikely(is_erronous(dstpkt) || is_erronous(addpkt))) {
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000327 return dstpkt;
328 }
329 if (expectlen > addlen)
330 neededtailspace = expectlen;
331 else
332 neededtailspace = addlen;
333
334 if (dst->tail + neededtailspace > dst->end) {
335 /* Create a dumplicate of 'dst' with more tail space */
Sjur Braendeland638e6282010-05-21 02:16:09 +0000336 struct cfpkt *tmppkt;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000337 dstlen = skb_headlen(dst);
338 createlen = dstlen + neededtailspace;
Sjur Braendeland638e6282010-05-21 02:16:09 +0000339 tmppkt = cfpkt_create(createlen + PKT_PREFIX + PKT_POSTFIX);
340 if (tmppkt == NULL)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000341 return NULL;
Sjur Braendeland638e6282010-05-21 02:16:09 +0000342 tmp = pkt_to_skb(tmppkt);
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000343 skb_set_tail_pointer(tmp, dstlen);
344 tmp->len = dstlen;
345 memcpy(tmp->data, dst->data, dstlen);
346 cfpkt_destroy(dstpkt);
347 dst = tmp;
348 }
349 memcpy(skb_tail_pointer(dst), add->data, skb_headlen(add));
350 cfpkt_destroy(addpkt);
351 dst->tail += addlen;
352 dst->len += addlen;
353 return skb_to_pkt(dst);
354}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000355
356struct cfpkt *cfpkt_split(struct cfpkt *pkt, u16 pos)
357{
358 struct sk_buff *skb2;
359 struct sk_buff *skb = pkt_to_skb(pkt);
Sjur Braendeland638e6282010-05-21 02:16:09 +0000360 struct cfpkt *tmppkt;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000361 u8 *split = skb->data + pos;
362 u16 len2nd = skb_tail_pointer(skb) - split;
363
364 if (unlikely(is_erronous(pkt)))
365 return NULL;
366
367 if (skb->data + pos > skb_tail_pointer(skb)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000368 PKT_ERROR(pkt, "trying to split beyond end of packet\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000369 return NULL;
370 }
371
372 /* Create a new packet for the second part of the data */
Sjur Braendeland638e6282010-05-21 02:16:09 +0000373 tmppkt = cfpkt_create_pfx(len2nd + PKT_PREFIX + PKT_POSTFIX,
374 PKT_PREFIX);
375 if (tmppkt == NULL)
376 return NULL;
377 skb2 = pkt_to_skb(tmppkt);
378
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000379
380 if (skb2 == NULL)
381 return NULL;
382
383 /* Reduce the length of the original packet */
384 skb_set_tail_pointer(skb, pos);
385 skb->len = pos;
386
387 memcpy(skb2->data, split, len2nd);
388 skb2->tail += len2nd;
389 skb2->len += len2nd;
390 return skb_to_pkt(skb2);
391}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000392
Stephen Hemminger73d6ac62011-04-11 10:43:50 +0000393bool cfpkt_erroneous(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000394{
395 return cfpkt_priv(pkt)->erronous;
396}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000397
398struct caif_payload_info *cfpkt_info(struct cfpkt *pkt)
399{
400 return (struct caif_payload_info *)&pkt_to_skb(pkt)->cb;
401}