blob: 75d4bfae1a78714b46dc303769ff26f2b6bc8b91 [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>
12#include <net/caif/cfpkt.h>
13
Sjur Braendeland24e263a2010-08-10 07:36:46 +000014#define PKT_PREFIX 48
Sjur Braendeland2aa40ae2010-06-17 06:55:40 +000015#define PKT_POSTFIX 2
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000016#define PKT_LEN_WHEN_EXTENDING 128
Joe Perchesb31fa5b2010-09-05 21:31:11 +000017#define PKT_ERROR(pkt, errmsg) \
18do { \
19 cfpkt_priv(pkt)->erronous = true; \
20 skb_reset_tail_pointer(&pkt->skb); \
21 pr_warn(errmsg); \
22} while (0)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000023
24struct cfpktq {
25 struct sk_buff_head head;
26 atomic_t count;
27 /* Lock protects count updates */
28 spinlock_t lock;
29};
30
31/*
32 * net/caif/ is generic and does not
33 * understand SKB, so we do this typecast
34 */
35struct cfpkt {
36 struct sk_buff skb;
37};
38
39/* Private data inside SKB */
40struct cfpkt_priv_data {
41 struct dev_info dev_info;
42 bool erronous;
43};
44
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000045static inline struct cfpkt_priv_data *cfpkt_priv(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000046{
47 return (struct cfpkt_priv_data *) pkt->skb.cb;
48}
49
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000050static inline bool is_erronous(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000051{
52 return cfpkt_priv(pkt)->erronous;
53}
54
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000055static inline struct sk_buff *pkt_to_skb(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000056{
57 return &pkt->skb;
58}
59
Stephen Hemminger73d6ac62011-04-11 10:43:50 +000060static inline struct cfpkt *skb_to_pkt(struct sk_buff *skb)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +000061{
62 return (struct cfpkt *) skb;
63}
64
65
66struct cfpkt *cfpkt_fromnative(enum caif_direction dir, void *nativepkt)
67{
68 struct cfpkt *pkt = skb_to_pkt(nativepkt);
69 cfpkt_priv(pkt)->erronous = false;
70 return pkt;
71}
72EXPORT_SYMBOL(cfpkt_fromnative);
73
74void *cfpkt_tonative(struct cfpkt *pkt)
75{
76 return (void *) pkt;
77}
78EXPORT_SYMBOL(cfpkt_tonative);
79
80static struct cfpkt *cfpkt_create_pfx(u16 len, u16 pfx)
81{
82 struct sk_buff *skb;
83
84 if (likely(in_interrupt()))
85 skb = alloc_skb(len + pfx, GFP_ATOMIC);
86 else
87 skb = alloc_skb(len + pfx, GFP_KERNEL);
88
89 if (unlikely(skb == NULL))
90 return NULL;
91
92 skb_reserve(skb, pfx);
93 return skb_to_pkt(skb);
94}
95
96inline struct cfpkt *cfpkt_create(u16 len)
97{
98 return cfpkt_create_pfx(len + PKT_POSTFIX, PKT_PREFIX);
99}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000100
101void cfpkt_destroy(struct cfpkt *pkt)
102{
103 struct sk_buff *skb = pkt_to_skb(pkt);
104 kfree_skb(skb);
105}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000106
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000107
108inline bool cfpkt_more(struct cfpkt *pkt)
109{
110 struct sk_buff *skb = pkt_to_skb(pkt);
111 return skb->len > 0;
112}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000113
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000114
115int cfpkt_peek_head(struct cfpkt *pkt, void *data, u16 len)
116{
117 struct sk_buff *skb = pkt_to_skb(pkt);
118 if (skb_headlen(skb) >= len) {
119 memcpy(data, skb->data, len);
120 return 0;
121 }
122 return !cfpkt_extr_head(pkt, data, len) &&
123 !cfpkt_add_head(pkt, data, len);
124}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000125
126int cfpkt_extr_head(struct cfpkt *pkt, void *data, u16 len)
127{
128 struct sk_buff *skb = pkt_to_skb(pkt);
129 u8 *from;
130 if (unlikely(is_erronous(pkt)))
131 return -EPROTO;
132
133 if (unlikely(len > skb->len)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000134 PKT_ERROR(pkt, "read beyond end of packet\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000135 return -EPROTO;
136 }
137
138 if (unlikely(len > skb_headlen(skb))) {
139 if (unlikely(skb_linearize(skb) != 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000140 PKT_ERROR(pkt, "linearize failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000141 return -EPROTO;
142 }
143 }
144 from = skb_pull(skb, len);
145 from -= len;
146 memcpy(data, from, len);
147 return 0;
148}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000149
150int cfpkt_extr_trail(struct cfpkt *pkt, void *dta, u16 len)
151{
152 struct sk_buff *skb = pkt_to_skb(pkt);
153 u8 *data = dta;
154 u8 *from;
155 if (unlikely(is_erronous(pkt)))
156 return -EPROTO;
157
158 if (unlikely(skb_linearize(skb) != 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000159 PKT_ERROR(pkt, "linearize failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000160 return -EPROTO;
161 }
162 if (unlikely(skb->data + len > skb_tail_pointer(skb))) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000163 PKT_ERROR(pkt, "read beyond end of packet\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000164 return -EPROTO;
165 }
166 from = skb_tail_pointer(skb) - len;
167 skb_trim(skb, skb->len - len);
168 memcpy(data, from, len);
169 return 0;
170}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000171
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000172
173int cfpkt_pad_trail(struct cfpkt *pkt, u16 len)
174{
175 return cfpkt_add_body(pkt, NULL, len);
176}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000177
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000178
179int cfpkt_add_body(struct cfpkt *pkt, const void *data, u16 len)
180{
181 struct sk_buff *skb = pkt_to_skb(pkt);
182 struct sk_buff *lastskb;
183 u8 *to;
184 u16 addlen = 0;
185
186
187 if (unlikely(is_erronous(pkt)))
188 return -EPROTO;
189
190 lastskb = skb;
191
192 /* Check whether we need to add space at the tail */
193 if (unlikely(skb_tailroom(skb) < len)) {
194 if (likely(len < PKT_LEN_WHEN_EXTENDING))
195 addlen = PKT_LEN_WHEN_EXTENDING;
196 else
197 addlen = len;
198 }
199
200 /* Check whether we need to change the SKB before writing to the tail */
201 if (unlikely((addlen > 0) || skb_cloned(skb) || skb_shared(skb))) {
202
203 /* Make sure data is writable */
204 if (unlikely(skb_cow_data(skb, addlen, &lastskb) < 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000205 PKT_ERROR(pkt, "cow failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000206 return -EPROTO;
207 }
208 /*
209 * Is the SKB non-linear after skb_cow_data()? If so, we are
210 * going to add data to the last SKB, so we need to adjust
211 * lengths of the top SKB.
212 */
213 if (lastskb != skb) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000214 pr_warn("Packet is non-linear\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000215 skb->len += len;
216 skb->data_len += len;
217 }
218 }
219
220 /* All set to put the last SKB and optionally write data there. */
221 to = skb_put(lastskb, len);
222 if (likely(data))
223 memcpy(to, data, len);
224 return 0;
225}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000226
227inline int cfpkt_addbdy(struct cfpkt *pkt, u8 data)
228{
229 return cfpkt_add_body(pkt, &data, 1);
230}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000231
232int cfpkt_add_head(struct cfpkt *pkt, const void *data2, u16 len)
233{
234 struct sk_buff *skb = pkt_to_skb(pkt);
235 struct sk_buff *lastskb;
236 u8 *to;
237 const u8 *data = data2;
Sjur Braendeland638e6282010-05-21 02:16:09 +0000238 int ret;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000239 if (unlikely(is_erronous(pkt)))
240 return -EPROTO;
241 if (unlikely(skb_headroom(skb) < len)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000242 PKT_ERROR(pkt, "no headroom\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000243 return -EPROTO;
244 }
245
246 /* Make sure data is writable */
Sjur Braendeland638e6282010-05-21 02:16:09 +0000247 ret = skb_cow_data(skb, 0, &lastskb);
248 if (unlikely(ret < 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000249 PKT_ERROR(pkt, "cow failed\n");
Sjur Braendeland638e6282010-05-21 02:16:09 +0000250 return ret;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000251 }
252
253 to = skb_push(skb, len);
254 memcpy(to, data, len);
255 return 0;
256}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000257
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000258
259inline int cfpkt_add_trail(struct cfpkt *pkt, const void *data, u16 len)
260{
261 return cfpkt_add_body(pkt, data, len);
262}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000263
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000264
265inline u16 cfpkt_getlen(struct cfpkt *pkt)
266{
267 struct sk_buff *skb = pkt_to_skb(pkt);
268 return skb->len;
269}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000270
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000271
272inline u16 cfpkt_iterate(struct cfpkt *pkt,
273 u16 (*iter_func)(u16, void *, u16),
274 u16 data)
275{
276 /*
277 * Don't care about the performance hit of linearizing,
278 * Checksum should not be used on high-speed interfaces anyway.
279 */
280 if (unlikely(is_erronous(pkt)))
281 return -EPROTO;
282 if (unlikely(skb_linearize(&pkt->skb) != 0)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000283 PKT_ERROR(pkt, "linearize failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000284 return -EPROTO;
285 }
286 return iter_func(data, pkt->skb.data, cfpkt_getlen(pkt));
287}
sjur.brandeland@stericsson.com3f874ad2011-05-13 02:44:08 +0000288
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000289
290int cfpkt_setlen(struct cfpkt *pkt, u16 len)
291{
292 struct sk_buff *skb = pkt_to_skb(pkt);
293
294
295 if (unlikely(is_erronous(pkt)))
296 return -EPROTO;
297
298 if (likely(len <= skb->len)) {
299 if (unlikely(skb->data_len))
300 ___pskb_trim(skb, len);
301 else
302 skb_trim(skb, len);
303
304 return cfpkt_getlen(pkt);
305 }
306
307 /* Need to expand SKB */
308 if (unlikely(!cfpkt_pad_trail(pkt, len - skb->len)))
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000309 PKT_ERROR(pkt, "skb_pad_trail failed\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000310
311 return cfpkt_getlen(pkt);
312}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000313
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000314struct cfpkt *cfpkt_append(struct cfpkt *dstpkt,
315 struct cfpkt *addpkt,
316 u16 expectlen)
317{
318 struct sk_buff *dst = pkt_to_skb(dstpkt);
319 struct sk_buff *add = pkt_to_skb(addpkt);
320 u16 addlen = skb_headlen(add);
321 u16 neededtailspace;
322 struct sk_buff *tmp;
323 u16 dstlen;
324 u16 createlen;
325 if (unlikely(is_erronous(dstpkt) || is_erronous(addpkt))) {
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000326 return dstpkt;
327 }
328 if (expectlen > addlen)
329 neededtailspace = expectlen;
330 else
331 neededtailspace = addlen;
332
333 if (dst->tail + neededtailspace > dst->end) {
334 /* Create a dumplicate of 'dst' with more tail space */
Sjur Braendeland638e6282010-05-21 02:16:09 +0000335 struct cfpkt *tmppkt;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000336 dstlen = skb_headlen(dst);
337 createlen = dstlen + neededtailspace;
Sjur Braendeland638e6282010-05-21 02:16:09 +0000338 tmppkt = cfpkt_create(createlen + PKT_PREFIX + PKT_POSTFIX);
339 if (tmppkt == NULL)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000340 return NULL;
Sjur Braendeland638e6282010-05-21 02:16:09 +0000341 tmp = pkt_to_skb(tmppkt);
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000342 skb_set_tail_pointer(tmp, dstlen);
343 tmp->len = dstlen;
344 memcpy(tmp->data, dst->data, dstlen);
345 cfpkt_destroy(dstpkt);
346 dst = tmp;
347 }
348 memcpy(skb_tail_pointer(dst), add->data, skb_headlen(add));
349 cfpkt_destroy(addpkt);
350 dst->tail += addlen;
351 dst->len += addlen;
352 return skb_to_pkt(dst);
353}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000354
355struct cfpkt *cfpkt_split(struct cfpkt *pkt, u16 pos)
356{
357 struct sk_buff *skb2;
358 struct sk_buff *skb = pkt_to_skb(pkt);
Sjur Braendeland638e6282010-05-21 02:16:09 +0000359 struct cfpkt *tmppkt;
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000360 u8 *split = skb->data + pos;
361 u16 len2nd = skb_tail_pointer(skb) - split;
362
363 if (unlikely(is_erronous(pkt)))
364 return NULL;
365
366 if (skb->data + pos > skb_tail_pointer(skb)) {
Joe Perchesb31fa5b2010-09-05 21:31:11 +0000367 PKT_ERROR(pkt, "trying to split beyond end of packet\n");
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000368 return NULL;
369 }
370
371 /* Create a new packet for the second part of the data */
Sjur Braendeland638e6282010-05-21 02:16:09 +0000372 tmppkt = cfpkt_create_pfx(len2nd + PKT_PREFIX + PKT_POSTFIX,
373 PKT_PREFIX);
374 if (tmppkt == NULL)
375 return NULL;
376 skb2 = pkt_to_skb(tmppkt);
377
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000378
379 if (skb2 == NULL)
380 return NULL;
381
382 /* Reduce the length of the original packet */
383 skb_set_tail_pointer(skb, pos);
384 skb->len = pos;
385
386 memcpy(skb2->data, split, len2nd);
387 skb2->tail += len2nd;
388 skb2->len += len2nd;
389 return skb_to_pkt(skb2);
390}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000391
Stephen Hemminger73d6ac62011-04-11 10:43:50 +0000392bool cfpkt_erroneous(struct cfpkt *pkt)
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000393{
394 return cfpkt_priv(pkt)->erronous;
395}
Sjur Braendeland15c9ac02010-03-30 13:56:24 +0000396
397struct caif_payload_info *cfpkt_info(struct cfpkt *pkt)
398{
399 return (struct caif_payload_info *)&pkt_to_skb(pkt)->cb;
400}