msg.c 16.1 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/msg.c: TIPC message header routines
3
 *
4
 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB
5
 * Copyright (c) 2005, 2010-2011, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 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.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * 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
P
Per Liden 已提交
34 35 36
 * POSSIBILITY OF SUCH DAMAGE.
 */

37
#include <net/sock.h>
P
Per Liden 已提交
38 39
#include "core.h"
#include "msg.h"
40 41
#include "addr.h"
#include "name_table.h"
P
Per Liden 已提交
42

43 44
#define MAX_FORWARD_SIZE 1024

45
static unsigned int align(unsigned int i)
46
{
47
	return (i + 3) & ~3u;
48 49
}

Y
Ying Xue 已提交
50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72
/**
 * tipc_buf_acquire - creates a TIPC message buffer
 * @size: message size (including TIPC header)
 *
 * Returns a new buffer with data pointers set to the specified size.
 *
 * NOTE: Headroom is reserved to allow prepending of a data link header.
 *       There may also be unrequested tailroom present at the buffer's end.
 */
struct sk_buff *tipc_buf_acquire(u32 size)
{
	struct sk_buff *skb;
	unsigned int buf_size = (BUF_HEADROOM + size + 3) & ~3u;

	skb = alloc_skb_fclone(buf_size, GFP_ATOMIC);
	if (skb) {
		skb_reserve(skb, BUF_HEADROOM);
		skb_put(skb, size);
		skb->next = NULL;
	}
	return skb;
}

73 74
void tipc_msg_init(u32 own_node, struct tipc_msg *m, u32 user, u32 type,
		   u32 hsize, u32 dnode)
75 76 77 78 79 80
{
	memset(m, 0, hsize);
	msg_set_version(m);
	msg_set_user(m, user);
	msg_set_hdr_sz(m, hsize);
	msg_set_size(m, hsize);
81
	msg_set_prevnode(m, own_node);
82
	msg_set_type(m, type);
83
	if (hsize > SHORT_H_SIZE) {
84 85
		msg_set_orignode(m, own_node);
		msg_set_destnode(m, dnode);
86 87 88
	}
}

89
struct sk_buff *tipc_msg_create(uint user, uint type,
90 91
				uint hdr_sz, uint data_sz, u32 dnode,
				u32 onode, u32 dport, u32 oport, int errcode)
92 93 94 95 96 97 98 99 100
{
	struct tipc_msg *msg;
	struct sk_buff *buf;

	buf = tipc_buf_acquire(hdr_sz + data_sz);
	if (unlikely(!buf))
		return NULL;

	msg = buf_msg(buf);
101
	tipc_msg_init(onode, msg, user, type, hdr_sz, dnode);
102 103 104 105 106 107 108 109 110
	msg_set_size(msg, hdr_sz + data_sz);
	msg_set_origport(msg, oport);
	msg_set_destport(msg, dport);
	msg_set_errcode(msg, errcode);
	if (hdr_sz > SHORT_H_SIZE) {
		msg_set_orignode(msg, onode);
		msg_set_destnode(msg, dnode);
	}
	return buf;
111 112
}

113
/* tipc_buf_append(): Append a buffer to the fragment list of another buffer
114 115 116
 * @*headbuf: in:  NULL for first frag, otherwise value returned from prev call
 *            out: set when successful non-complete reassembly, otherwise NULL
 * @*buf:     in:  the buffer to append. Always defined
S
stephen hemminger 已提交
117
 *            out: head buf after successful complete reassembly, otherwise NULL
118
 * Returns 1 when reassembly complete, otherwise 0
119 120 121 122 123
 */
int tipc_buf_append(struct sk_buff **headbuf, struct sk_buff **buf)
{
	struct sk_buff *head = *headbuf;
	struct sk_buff *frag = *buf;
124
	struct sk_buff *tail = NULL;
125 126
	struct tipc_msg *msg;
	u32 fragid;
127
	int delta;
128
	bool headstolen;
129

130 131 132 133 134 135
	if (!frag)
		goto err;

	msg = buf_msg(frag);
	fragid = msg_type(msg);
	frag->next = NULL;
136 137 138
	skb_pull(frag, msg_hdr_sz(msg));

	if (fragid == FIRST_FRAGMENT) {
139 140 141 142
		if (unlikely(head))
			goto err;
		if (unlikely(skb_unclone(frag, GFP_ATOMIC)))
			goto err;
143
		head = *headbuf = frag;
144
		*buf = NULL;
145 146 147 148 149 150 151 152
		TIPC_SKB_CB(head)->tail = NULL;
		if (skb_is_nonlinear(head)) {
			skb_walk_frags(head, tail) {
				TIPC_SKB_CB(head)->tail = tail;
			}
		} else {
			skb_frag_list_init(head);
		}
153 154
		return 0;
	}
155

156
	if (!head)
157 158
		goto err;

159 160 161
	if (skb_try_coalesce(head, frag, &headstolen, &delta)) {
		kfree_skb_partial(frag, headstolen);
	} else {
162
		tail = TIPC_SKB_CB(head)->tail;
163 164 165 166 167 168 169 170 171
		if (!skb_has_frag_list(head))
			skb_shinfo(head)->frag_list = frag;
		else
			tail->next = frag;
		head->truesize += frag->truesize;
		head->data_len += frag->len;
		head->len += frag->len;
		TIPC_SKB_CB(head)->tail = frag;
	}
172

173
	if (fragid == LAST_FRAGMENT) {
174 175 176
		TIPC_SKB_CB(head)->validated = false;
		if (unlikely(!tipc_msg_validate(head)))
			goto err;
177 178 179 180 181 182 183
		*buf = head;
		TIPC_SKB_CB(head)->tail = NULL;
		*headbuf = NULL;
		return 1;
	}
	*buf = NULL;
	return 0;
184
err:
185 186
	pr_warn_ratelimited("Unable to build fragment list\n");
	kfree_skb(*buf);
187 188
	kfree_skb(*headbuf);
	*buf = *headbuf = NULL;
189 190
	return 0;
}
191

192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233
/* tipc_msg_validate - validate basic format of received message
 *
 * This routine ensures a TIPC message has an acceptable header, and at least
 * as much data as the header indicates it should.  The routine also ensures
 * that the entire message header is stored in the main fragment of the message
 * buffer, to simplify future access to message header fields.
 *
 * Note: Having extra info present in the message header or data areas is OK.
 * TIPC will ignore the excess, under the assumption that it is optional info
 * introduced by a later release of the protocol.
 */
bool tipc_msg_validate(struct sk_buff *skb)
{
	struct tipc_msg *msg;
	int msz, hsz;

	if (unlikely(TIPC_SKB_CB(skb)->validated))
		return true;
	if (unlikely(!pskb_may_pull(skb, MIN_H_SIZE)))
		return false;

	hsz = msg_hdr_sz(buf_msg(skb));
	if (unlikely(hsz < MIN_H_SIZE) || (hsz > MAX_H_SIZE))
		return false;
	if (unlikely(!pskb_may_pull(skb, hsz)))
		return false;

	msg = buf_msg(skb);
	if (unlikely(msg_version(msg) != TIPC_VERSION))
		return false;

	msz = msg_size(msg);
	if (unlikely(msz < hsz))
		return false;
	if (unlikely((msz - hsz) > TIPC_MAX_USER_MSG_SIZE))
		return false;
	if (unlikely(skb->len < msz))
		return false;

	TIPC_SKB_CB(skb)->validated = true;
	return true;
}
234 235

/**
236
 * tipc_msg_build - create buffer chain containing specified header and data
237
 * @mhdr: Message header, to be prepended to data
238
 * @m: User message
239 240
 * @dsz: Total length of user data
 * @pktmax: Max packet size that can be used
241 242
 * @list: Buffer or chain of buffers to be returned to caller
 *
243 244
 * Returns message data size or errno: -ENOMEM, -EFAULT
 */
245
int tipc_msg_build(struct tipc_msg *mhdr, struct msghdr *m,
246
		   int offset, int dsz, int pktmax, struct sk_buff_head *list)
247 248 249 250 251 252 253 254
{
	int mhsz = msg_hdr_sz(mhdr);
	int msz = mhsz + dsz;
	int pktno = 1;
	int pktsz;
	int pktrem = pktmax;
	int drem = dsz;
	struct tipc_msg pkthdr;
255
	struct sk_buff *skb;
256 257
	char *pktpos;
	int rc;
258

259 260 261 262
	msg_set_size(mhdr, msz);

	/* No fragmentation needed? */
	if (likely(msz <= pktmax)) {
263 264
		skb = tipc_buf_acquire(msz);
		if (unlikely(!skb))
265
			return -ENOMEM;
266
		skb_orphan(skb);
267 268 269
		__skb_queue_tail(list, skb);
		skb_copy_to_linear_data(skb, mhdr, mhsz);
		pktpos = skb->data + mhsz;
A
Al Viro 已提交
270
		if (copy_from_iter(pktpos, dsz, &m->msg_iter) == dsz)
271 272 273 274 275 276
			return dsz;
		rc = -EFAULT;
		goto error;
	}

	/* Prepare reusable fragment header */
277 278
	tipc_msg_init(msg_prevnode(mhdr), &pkthdr, MSG_FRAGMENTER,
		      FIRST_FRAGMENT, INT_H_SIZE, msg_destnode(mhdr));
279 280
	msg_set_size(&pkthdr, pktmax);
	msg_set_fragm_no(&pkthdr, pktno);
281
	msg_set_importance(&pkthdr, msg_importance(mhdr));
282 283

	/* Prepare first fragment */
284 285
	skb = tipc_buf_acquire(pktmax);
	if (!skb)
286
		return -ENOMEM;
287
	skb_orphan(skb);
288 289 290
	__skb_queue_tail(list, skb);
	pktpos = skb->data;
	skb_copy_to_linear_data(skb, &pkthdr, INT_H_SIZE);
291 292
	pktpos += INT_H_SIZE;
	pktrem -= INT_H_SIZE;
293
	skb_copy_to_linear_data_offset(skb, INT_H_SIZE, mhdr, mhsz);
294 295 296 297 298 299 300
	pktpos += mhsz;
	pktrem -= mhsz;

	do {
		if (drem < pktrem)
			pktrem = drem;

A
Al Viro 已提交
301
		if (copy_from_iter(pktpos, pktrem, &m->msg_iter) != pktrem) {
302 303 304 305 306 307 308 309 310 311 312 313 314
			rc = -EFAULT;
			goto error;
		}
		drem -= pktrem;

		if (!drem)
			break;

		/* Prepare new fragment: */
		if (drem < (pktmax - INT_H_SIZE))
			pktsz = drem + INT_H_SIZE;
		else
			pktsz = pktmax;
315 316
		skb = tipc_buf_acquire(pktsz);
		if (!skb) {
317 318 319
			rc = -ENOMEM;
			goto error;
		}
320
		skb_orphan(skb);
321
		__skb_queue_tail(list, skb);
322 323 324
		msg_set_type(&pkthdr, FRAGMENT);
		msg_set_size(&pkthdr, pktsz);
		msg_set_fragm_no(&pkthdr, ++pktno);
325 326
		skb_copy_to_linear_data(skb, &pkthdr, INT_H_SIZE);
		pktpos = skb->data + INT_H_SIZE;
327 328 329
		pktrem = pktsz - INT_H_SIZE;

	} while (1);
330
	msg_set_type(buf_msg(skb), LAST_FRAGMENT);
331 332
	return dsz;
error:
333 334
	__skb_queue_purge(list);
	__skb_queue_head_init(list);
335 336 337
	return rc;
}

338 339
/**
 * tipc_msg_bundle(): Append contents of a buffer to tail of an existing one
340 341
 * @skb: the buffer to append to ("bundle")
 * @msg:  message to be appended
342 343 344 345
 * @mtu:  max allowable size for the bundle buffer
 * Consumes buffer if successful
 * Returns true if bundling could be performed, otherwise false
 */
346
bool tipc_msg_bundle(struct sk_buff *skb, struct tipc_msg *msg, u32 mtu)
347
{
J
Jon Paul Maloy 已提交
348 349
	struct tipc_msg *bmsg;
	unsigned int bsz;
350
	unsigned int msz = msg_size(msg);
J
Jon Paul Maloy 已提交
351
	u32 start, pad;
352 353 354 355
	u32 max = mtu - INT_H_SIZE;

	if (likely(msg_user(msg) == MSG_FRAGMENTER))
		return false;
356
	if (!skb)
J
Jon Paul Maloy 已提交
357
		return false;
358
	bmsg = buf_msg(skb);
J
Jon Paul Maloy 已提交
359 360 361 362
	bsz = msg_size(bmsg);
	start = align(bsz);
	pad = start - bsz;

363
	if (unlikely(msg_user(msg) == TUNNEL_PROTOCOL))
364 365 366
		return false;
	if (unlikely(msg_user(msg) == BCAST_PROTOCOL))
		return false;
367
	if (unlikely(msg_user(bmsg) != MSG_BUNDLER))
368
		return false;
369
	if (unlikely(skb_tailroom(skb) < (pad + msz)))
370 371 372
		return false;
	if (unlikely(max < (start + msz)))
		return false;
373 374 375
	if ((msg_importance(msg) < TIPC_SYSTEM_IMPORTANCE) &&
	    (msg_importance(bmsg) == TIPC_SYSTEM_IMPORTANCE))
		return false;
376

377 378
	skb_put(skb, pad + msz);
	skb_copy_to_linear_data_offset(skb, start, msg, msz);
379 380 381 382 383
	msg_set_size(bmsg, start + msz);
	msg_set_msgcnt(bmsg, msg_msgcnt(bmsg) + 1);
	return true;
}

384 385
/**
 *  tipc_msg_extract(): extract bundled inner packet from buffer
386
 *  @skb: buffer to be extracted from.
387
 *  @iskb: extracted inner buffer, to be returned
388 389
 *  @pos: position in outer message of msg to be extracted.
 *        Returns position of next msg
390 391 392 393 394
 *  Consumes outer buffer when last packet extracted
 *  Returns true when when there is an extracted buffer, otherwise false
 */
bool tipc_msg_extract(struct sk_buff *skb, struct sk_buff **iskb, int *pos)
{
395
	struct tipc_msg *msg;
396
	int imsz, offset;
397

398
	*iskb = NULL;
399
	if (unlikely(skb_linearize(skb)))
400 401
		goto none;

402
	msg = buf_msg(skb);
403 404
	offset = msg_hdr_sz(msg) + *pos;
	if (unlikely(offset > (msg_size(msg) - MIN_H_SIZE)))
405 406
		goto none;

407 408
	*iskb = skb_clone(skb, GFP_ATOMIC);
	if (unlikely(!*iskb))
409
		goto none;
410 411 412 413
	skb_pull(*iskb, offset);
	imsz = msg_size(buf_msg(*iskb));
	skb_trim(*iskb, imsz);
	if (unlikely(!tipc_msg_validate(*iskb)))
414 415 416 417 418
		goto none;
	*pos += align(imsz);
	return true;
none:
	kfree_skb(skb);
419
	kfree_skb(*iskb);
420 421 422 423
	*iskb = NULL;
	return false;
}

424 425
/**
 * tipc_msg_make_bundle(): Create bundle buf and append message to its tail
426 427 428
 * @list: the buffer chain, where head is the buffer to replace/append
 * @skb: buffer to be created, appended to and returned in case of success
 * @msg: message to be appended
429
 * @mtu: max allowable size for the bundle buffer, inclusive header
430
 * @dnode: destination node for message. (Not always present in header)
S
stephen hemminger 已提交
431
 * Returns true if success, otherwise false
432
 */
433 434
bool tipc_msg_make_bundle(struct sk_buff **skb,  struct tipc_msg *msg,
			  u32 mtu, u32 dnode)
435
{
436
	struct sk_buff *_skb;
437 438 439 440 441 442
	struct tipc_msg *bmsg;
	u32 msz = msg_size(msg);
	u32 max = mtu - INT_H_SIZE;

	if (msg_user(msg) == MSG_FRAGMENTER)
		return false;
443
	if (msg_user(msg) == TUNNEL_PROTOCOL)
444 445 446 447 448 449
		return false;
	if (msg_user(msg) == BCAST_PROTOCOL)
		return false;
	if (msz > (max / 2))
		return false;

450 451
	_skb = tipc_buf_acquire(max);
	if (!_skb)
452 453
		return false;

454 455
	skb_trim(_skb, INT_H_SIZE);
	bmsg = buf_msg(_skb);
456 457
	tipc_msg_init(msg_prevnode(msg), bmsg, MSG_BUNDLER, 0,
		      INT_H_SIZE, dnode);
458 459 460 461
	if (msg_isdata(msg))
		msg_set_importance(bmsg, TIPC_CRITICAL_IMPORTANCE);
	else
		msg_set_importance(bmsg, TIPC_SYSTEM_IMPORTANCE);
462 463 464
	msg_set_seqno(bmsg, msg_seqno(msg));
	msg_set_ack(bmsg, msg_ack(msg));
	msg_set_bcast_ack(bmsg, msg_bcast_ack(msg));
465 466
	tipc_msg_bundle(_skb, msg, mtu);
	*skb = _skb;
J
Jon Paul Maloy 已提交
467
	return true;
468
}
469 470 471

/**
 * tipc_msg_reverse(): swap source and destination addresses and add error code
472 473 474 475
 * @own_node: originating node id for reversed message
 * @skb:  buffer containing message to be reversed; may be replaced.
 * @err:  error code to be set in message, if any
 * Consumes buffer at failure
476 477
 * Returns true if success, otherwise false
 */
478
bool tipc_msg_reverse(u32 own_node,  struct sk_buff **skb, int err)
479
{
480 481
	struct sk_buff *_skb = *skb;
	struct tipc_msg *hdr = buf_msg(_skb);
482
	struct tipc_msg ohdr;
483
	int dlen = min_t(uint, msg_data_sz(hdr), MAX_FORWARD_SIZE);
484

485
	if (skb_linearize(_skb))
486
		goto exit;
487 488
	hdr = buf_msg(_skb);
	if (msg_dest_droppable(hdr))
489
		goto exit;
490
	if (msg_errcode(hdr))
491
		goto exit;
492 493 494 495 496 497 498 499 500 501 502 503 504 505 506

	/* Take a copy of original header before altering message */
	memcpy(&ohdr, hdr, msg_hdr_sz(hdr));

	/* Never return SHORT header; expand by replacing buffer if necessary */
	if (msg_short(hdr)) {
		*skb = tipc_buf_acquire(BASIC_H_SIZE + dlen);
		if (!*skb)
			goto exit;
		memcpy((*skb)->data + BASIC_H_SIZE, msg_data(hdr), dlen);
		kfree_skb(_skb);
		_skb = *skb;
		hdr = buf_msg(_skb);
		memcpy(hdr, &ohdr, BASIC_H_SIZE);
		msg_set_hdr_sz(hdr, BASIC_H_SIZE);
507
	}
508 509 510 511 512 513 514 515 516 517 518

	/* Now reverse the concerned fields */
	msg_set_errcode(hdr, err);
	msg_set_origport(hdr, msg_destport(&ohdr));
	msg_set_destport(hdr, msg_origport(&ohdr));
	msg_set_destnode(hdr, msg_prevnode(&ohdr));
	msg_set_prevnode(hdr, own_node);
	msg_set_orignode(hdr, own_node);
	msg_set_size(hdr, msg_hdr_sz(hdr) + dlen);
	skb_trim(_skb, msg_size(hdr));
	skb_orphan(_skb);
519 520
	return true;
exit:
521 522
	kfree_skb(_skb);
	*skb = NULL;
523 524
	return false;
}
525 526

/**
527 528
 * tipc_msg_lookup_dest(): try to find new destination for named message
 * @skb: the buffer containing the message.
529
 * @err: error code to be used by caller if lookup fails
530
 * Does not consume buffer
531
 * Returns true if a destination is found, false otherwise
532
 */
533
bool tipc_msg_lookup_dest(struct net *net, struct sk_buff *skb, int *err)
534
{
535
	struct tipc_msg *msg = buf_msg(skb);
536 537
	u32 dport, dnode;
	u32 onode = tipc_own_addr(net);
538

539 540 541 542
	if (!msg_isdata(msg))
		return false;
	if (!msg_named(msg))
		return false;
543 544
	if (msg_errcode(msg))
		return false;
545 546 547
	*err = -TIPC_ERR_NO_NAME;
	if (skb_linearize(skb))
		return false;
548
	msg = buf_msg(skb);
549
	if (msg_reroute_cnt(msg))
550
		return false;
551
	dnode = addr_domain(net, msg_lookup_scope(msg));
552
	dport = tipc_nametbl_translate(net, msg_nametype(msg),
553
				       msg_nameinst(msg), &dnode);
554
	if (!dport)
555
		return false;
556
	msg_incr_reroute_cnt(msg);
557 558 559
	if (dnode != onode)
		msg_set_prevnode(msg, onode);
	msg_set_destnode(msg, dnode);
560
	msg_set_destport(msg, dport);
561 562
	*err = TIPC_OK;
	return true;
563
}
564 565 566 567

/* tipc_msg_reassemble() - clone a buffer chain of fragments and
 *                         reassemble the clones into one message
 */
568
struct sk_buff *tipc_msg_reassemble(struct sk_buff_head *list)
569
{
570 571
	struct sk_buff *skb;
	struct sk_buff *frag = NULL;
572 573 574 575
	struct sk_buff *head = NULL;
	int hdr_sz;

	/* Copy header if single buffer */
576 577 578 579
	if (skb_queue_len(list) == 1) {
		skb = skb_peek(list);
		hdr_sz = skb_headroom(skb) + msg_hdr_sz(buf_msg(skb));
		return __pskb_copy(skb, hdr_sz, GFP_ATOMIC);
580 581 582
	}

	/* Clone all fragments and reassemble */
583 584
	skb_queue_walk(list, skb) {
		frag = skb_clone(skb, GFP_ATOMIC);
585 586 587 588 589 590 591 592 593 594 595 596 597 598
		if (!frag)
			goto error;
		frag->next = NULL;
		if (tipc_buf_append(&head, &frag))
			break;
		if (!head)
			goto error;
	}
	return frag;
error:
	pr_warn("Failed do clone local mcast rcv buffer\n");
	kfree_skb(head);
	return NULL;
}