[deliverable/linux.git] / net / batman-adv / unicast.c

/*
 * Copyright (C) 2010-2011 B.A.T.M.A.N. contributors:
 *
 * Andreas Langer
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
 * 02110-1301, USA
 *
 */

#include "main.h"
#include "unicast.h"
#include "send.h"
#include "soft-interface.h"
#include "gateway_client.h"
#include "originator.h"
#include "hash.h"
#include "translation-table.h"
#include "routing.h"
#include "hard-interface.h"


static struct sk_buff *frag_merge_packet(struct list_head *head,
					 struct frag_packet_list_entry *tfp,
					 struct sk_buff *skb)
{
	struct unicast_frag_packet *up =
		(struct unicast_frag_packet *)skb->data;
	struct sk_buff *tmp_skb;
	struct unicast_packet *unicast_packet;
	int hdr_len = sizeof(struct unicast_packet);
	int uni_diff = sizeof(struct unicast_frag_packet) - hdr_len;

	/* set skb to the first part and tmp_skb to the second part */
	if (up->flags & UNI_FRAG_HEAD) {
		tmp_skb = tfp->skb;
	} else {
		tmp_skb = skb;
		skb = tfp->skb;
	}

	skb_pull(tmp_skb, sizeof(struct unicast_frag_packet));
	if (pskb_expand_head(skb, 0, tmp_skb->len, GFP_ATOMIC) < 0) {
		/* free buffered skb, skb will be freed later */
		kfree_skb(tfp->skb);
		return NULL;
	}

	/* move free entry to end */
	tfp->skb = NULL;
	tfp->seqno = 0;
	list_move_tail(&tfp->list, head);

	memcpy(skb_put(skb, tmp_skb->len), tmp_skb->data, tmp_skb->len);
	kfree_skb(tmp_skb);

	memmove(skb->data + uni_diff, skb->data, hdr_len);
	unicast_packet = (struct unicast_packet *) skb_pull(skb, uni_diff);
	unicast_packet->packet_type = BAT_UNICAST;

	return skb;
}

static void frag_create_entry(struct list_head *head, struct sk_buff *skb)
{
	struct frag_packet_list_entry *tfp;
	struct unicast_frag_packet *up =
		(struct unicast_frag_packet *)skb->data;

	/* free and oldest packets stand at the end */
	tfp = list_entry((head)->prev, typeof(*tfp), list);
	kfree_skb(tfp->skb);

	tfp->seqno = ntohs(up->seqno);
	tfp->skb = skb;
	list_move(&tfp->list, head);
	return;
}

static int frag_create_buffer(struct list_head *head)
{
	int i;
	struct frag_packet_list_entry *tfp;

	for (i = 0; i < FRAG_BUFFER_SIZE; i++) {
		tfp = kmalloc(sizeof(struct frag_packet_list_entry),
			GFP_ATOMIC);
		if (!tfp) {
			frag_list_free(head);
			return -ENOMEM;
		}
		tfp->skb = NULL;
		tfp->seqno = 0;
		INIT_LIST_HEAD(&tfp->list);
		list_add(&tfp->list, head);
	}

	return 0;
}

static struct frag_packet_list_entry *frag_search_packet(struct list_head *head,
						 struct unicast_frag_packet *up)
{
	struct frag_packet_list_entry *tfp;
	struct unicast_frag_packet *tmp_up = NULL;
	uint16_t search_seqno;

	if (up->flags & UNI_FRAG_HEAD)
		search_seqno = ntohs(up->seqno)+1;
	else
		search_seqno = ntohs(up->seqno)-1;

	list_for_each_entry(tfp, head, list) {

		if (!tfp->skb)
			continue;

		if (tfp->seqno == ntohs(up->seqno))
			goto mov_tail;

		tmp_up = (struct unicast_frag_packet *)tfp->skb->data;

		if (tfp->seqno == search_seqno) {

			if ((tmp_up->flags & UNI_FRAG_HEAD) !=
			    (up->flags & UNI_FRAG_HEAD))
				return tfp;
			else
				goto mov_tail;
		}
	}
	return NULL;

mov_tail:
	list_move_tail(&tfp->list, head);
	return NULL;
}

void frag_list_free(struct list_head *head)
{
	struct frag_packet_list_entry *pf, *tmp_pf;

	if (!list_empty(head)) {

		list_for_each_entry_safe(pf, tmp_pf, head, list) {
			kfree_skb(pf->skb);
			list_del(&pf->list);
			kfree(pf);
		}
	}
	return;
}

/* frag_reassemble_skb():
 * returns NET_RX_DROP if the operation failed - skb is left intact
 * returns NET_RX_SUCCESS if the fragment was buffered (skb_new will be NULL)
 * or the skb could be reassembled (skb_new will point to the new packet and
 * skb was freed)
 */
int frag_reassemble_skb(struct sk_buff *skb, struct bat_priv *bat_priv,
			struct sk_buff **new_skb)
{
	struct orig_node *orig_node;
	struct frag_packet_list_entry *tmp_frag_entry;
	int ret = NET_RX_DROP;
	struct unicast_frag_packet *unicast_packet =
		(struct unicast_frag_packet *)skb->data;

	*new_skb = NULL;

	spin_lock_bh(&bat_priv->orig_hash_lock);
	orig_node = orig_hash_find(bat_priv, unicast_packet->orig);
	if (!orig_node)
		goto unlock;

	orig_node->last_frag_packet = jiffies;

	if (list_empty(&orig_node->frag_list) &&
	    frag_create_buffer(&orig_node->frag_list)) {
		pr_debug("couldn't create frag buffer\n");
		goto out;
	}

	tmp_frag_entry = frag_search_packet(&orig_node->frag_list,
					    unicast_packet);

	if (!tmp_frag_entry) {
		frag_create_entry(&orig_node->frag_list, skb);
		ret = NET_RX_SUCCESS;
		goto out;
	}

	*new_skb = frag_merge_packet(&orig_node->frag_list, tmp_frag_entry,
				     skb);
	/* if not, merge failed */
	if (*new_skb)
		ret = NET_RX_SUCCESS;

unlock:
	spin_unlock_bh(&bat_priv->orig_hash_lock);
out:
	if (orig_node)
		kref_put(&orig_node->refcount, orig_node_free_ref);
	return ret;
}

int frag_send_skb(struct sk_buff *skb, struct bat_priv *bat_priv,
		  struct batman_if *batman_if, uint8_t dstaddr[])
{
	struct unicast_packet tmp_uc, *unicast_packet;
	struct sk_buff *frag_skb;
	struct unicast_frag_packet *frag1, *frag2;
	int uc_hdr_len = sizeof(struct unicast_packet);
	int ucf_hdr_len = sizeof(struct unicast_frag_packet);
	int data_len = skb->len - uc_hdr_len;
	int large_tail = 0;
	uint16_t seqno;

	if (!bat_priv->primary_if)
		goto dropped;

	frag_skb = dev_alloc_skb(data_len - (data_len / 2) + ucf_hdr_len);
	if (!frag_skb)
		goto dropped;
	skb_reserve(frag_skb, ucf_hdr_len);

	unicast_packet = (struct unicast_packet *) skb->data;
	memcpy(&tmp_uc, unicast_packet, uc_hdr_len);
	skb_split(skb, frag_skb, data_len / 2 + uc_hdr_len);

	if (my_skb_head_push(skb, ucf_hdr_len - uc_hdr_len) < 0 ||
	    my_skb_head_push(frag_skb, ucf_hdr_len) < 0)
		goto drop_frag;

	frag1 = (struct unicast_frag_packet *)skb->data;
	frag2 = (struct unicast_frag_packet *)frag_skb->data;

	memcpy(frag1, &tmp_uc, sizeof(struct unicast_packet));

	frag1->ttl--;
	frag1->version = COMPAT_VERSION;
	frag1->packet_type = BAT_UNICAST_FRAG;

	memcpy(frag1->orig, bat_priv->primary_if->net_dev->dev_addr, ETH_ALEN);
	memcpy(frag2, frag1, sizeof(struct unicast_frag_packet));

	if (data_len & 1)
		large_tail = UNI_FRAG_LARGETAIL;

	frag1->flags = UNI_FRAG_HEAD | large_tail;
	frag2->flags = large_tail;

	seqno = atomic_add_return(2, &batman_if->frag_seqno);
	frag1->seqno = htons(seqno - 1);
	frag2->seqno = htons(seqno);

	send_skb_packet(skb, batman_if, dstaddr);
	send_skb_packet(frag_skb, batman_if, dstaddr);
	return NET_RX_SUCCESS;

drop_frag:
	kfree_skb(frag_skb);
dropped:
	kfree_skb(skb);
	return NET_RX_DROP;
}

int unicast_send_skb(struct sk_buff *skb, struct bat_priv *bat_priv)
{
	struct ethhdr *ethhdr = (struct ethhdr *)skb->data;
	struct unicast_packet *unicast_packet;
	struct orig_node *orig_node = NULL;
	struct batman_if *batman_if;
	struct neigh_node *neigh_node;
	int data_len = skb->len;
	uint8_t dstaddr[6];
	int ret = 1;

	spin_lock_bh(&bat_priv->orig_hash_lock);

	/* get routing information */
	if (is_multicast_ether_addr(ethhdr->h_dest)) {
		orig_node = (struct orig_node *)gw_get_selected(bat_priv);
		if (orig_node)
			goto find_router;
	}

	/* check for hna host - increases orig_node refcount */
	orig_node = transtable_search(bat_priv, ethhdr->h_dest);

find_router:
	/* find_router() increases neigh_nodes refcount if found. */
	neigh_node = find_router(bat_priv, orig_node, NULL);

	if (!neigh_node)
		goto unlock;

	if (neigh_node->if_incoming->if_status != IF_ACTIVE)
		goto unlock;

	if (my_skb_head_push(skb, sizeof(struct unicast_packet)) < 0)
		goto unlock;

	/* don't lock while sending the packets ... we therefore
	 * copy the required data before sending */
	batman_if = neigh_node->if_incoming;
	memcpy(dstaddr, neigh_node->addr, ETH_ALEN);
	spin_unlock_bh(&bat_priv->orig_hash_lock);

	unicast_packet = (struct unicast_packet *)skb->data;

	unicast_packet->version = COMPAT_VERSION;
	/* batman packet type: unicast */
	unicast_packet->packet_type = BAT_UNICAST;
	/* set unicast ttl */
	unicast_packet->ttl = TTL;
	/* copy the destination for faster routing */
	memcpy(unicast_packet->dest, orig_node->orig, ETH_ALEN);

	if (atomic_read(&bat_priv->fragmentation) &&
	    data_len + sizeof(struct unicast_packet) >
						batman_if->net_dev->mtu) {
		/* send frag skb decreases ttl */
		unicast_packet->ttl++;
		ret = frag_send_skb(skb, bat_priv, batman_if, dstaddr);
		goto out;
	}

	send_skb_packet(skb, batman_if, dstaddr);
	ret = 0;
	goto out;

unlock:
	spin_unlock_bh(&bat_priv->orig_hash_lock);
out:
	if (neigh_node)
		neigh_node_free_ref(neigh_node);
	if (orig_node)
		kref_put(&orig_node->refcount, orig_node_free_ref);
	if (ret == 1)
		kfree_skb(skb);
	return ret;
}
Commit	Line	Data
c6c8fea2	1	/*
64afe353	2	* Copyright (C) 2010-2011 B.A.T.M.A.N. contributors:
c6c8fea2 SE	3	*
	4	* Andreas Langer
	5	*
	6	* This program is free software; you can redistribute it and/or
	7	* modify it under the terms of version 2 of the GNU General Public
	8	* License as published by the Free Software Foundation.
	9	*
	10	* This program is distributed in the hope that it will be useful, but
	11	* WITHOUT ANY WARRANTY; without even the implied warranty of
	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	13	* General Public License for more details.
	14	*
	15	* You should have received a copy of the GNU General Public License
	16	* along with this program; if not, write to the Free Software
	17	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
	18	* 02110-1301, USA
	19	*
	20	*/
	21
	22	#include "main.h"
	23	#include "unicast.h"
	24	#include "send.h"
	25	#include "soft-interface.h"
	26	#include "gateway_client.h"
	27	#include "originator.h"
	28	#include "hash.h"
	29	#include "translation-table.h"
	30	#include "routing.h"
	31	#include "hard-interface.h"
	32
	33
	34	static struct sk_buff frag_merge_packet(struct list_head head,
	35	struct frag_packet_list_entry *tfp,
	36	struct sk_buff *skb)
	37	{
	38	struct unicast_frag_packet *up =
	39	(struct unicast_frag_packet *)skb->data;
	40	struct sk_buff *tmp_skb;
	41	struct unicast_packet *unicast_packet;
14062064 ML	42	int hdr_len = sizeof(struct unicast_packet);
14062064 ML	43	int uni_diff = sizeof(struct unicast_frag_packet) - hdr_len;
c6c8fea2 SE	44
	45	/* set skb to the first part and tmp_skb to the second part */
	46	if (up->flags & UNI_FRAG_HEAD) {
	47	tmp_skb = tfp->skb;
	48	} else {
	49	tmp_skb = skb;
	50	skb = tfp->skb;
	51	}
	52
	53	skb_pull(tmp_skb, sizeof(struct unicast_frag_packet));
	54	if (pskb_expand_head(skb, 0, tmp_skb->len, GFP_ATOMIC) < 0) {
	55	/* free buffered skb, skb will be freed later */
	56	kfree_skb(tfp->skb);
	57	return NULL;
	58	}
	59
	60	/* move free entry to end */
	61	tfp->skb = NULL;
	62	tfp->seqno = 0;
	63	list_move_tail(&tfp->list, head);
	64
	65	memcpy(skb_put(skb, tmp_skb->len), tmp_skb->data, tmp_skb->len);
	66	kfree_skb(tmp_skb);
	67
	68	memmove(skb->data + uni_diff, skb->data, hdr_len);
	69	unicast_packet = (struct unicast_packet *) skb_pull(skb, uni_diff);
	70	unicast_packet->packet_type = BAT_UNICAST;
	71
	72	return skb;
	73	}
	74
	75	static void frag_create_entry(struct list_head head, struct sk_buff skb)
	76	{
	77	struct frag_packet_list_entry *tfp;
	78	struct unicast_frag_packet *up =
	79	(struct unicast_frag_packet *)skb->data;
	80
	81	/* free and oldest packets stand at the end */
	82	tfp = list_entry((head)->prev, typeof(*tfp), list);
	83	kfree_skb(tfp->skb);
	84
	85	tfp->seqno = ntohs(up->seqno);
	86	tfp->skb = skb;
	87	list_move(&tfp->list, head);
	88	return;
	89	}
	90
	91	static int frag_create_buffer(struct list_head *head)
	92	{
	93	int i;
	94	struct frag_packet_list_entry *tfp;
	95
	96	for (i = 0; i < FRAG_BUFFER_SIZE; i++) {
	97	tfp = kmalloc(sizeof(struct frag_packet_list_entry),
	98	GFP_ATOMIC);
	99	if (!tfp) {
	100	frag_list_free(head);
	101	return -ENOMEM;
	102	}
	103	tfp->skb = NULL;
	104	tfp->seqno = 0;
	105	INIT_LIST_HEAD(&tfp->list);
	106	list_add(&tfp->list, head);
	107	}
108
109	return 0;
110	}
111
112	static struct frag_packet_list_entry frag_search_packet(struct list_head head,
113	struct unicast_frag_packet *up)
114	{
115	struct frag_packet_list_entry *tfp;
116	struct unicast_frag_packet *tmp_up = NULL;
117	uint16_t search_seqno;
118
119	if (up->flags & UNI_FRAG_HEAD)
120	search_seqno = ntohs(up->seqno)+1;
121	else
122	search_seqno = ntohs(up->seqno)-1;
123
124	list_for_each_entry(tfp, head, list) {
125
126	if (!tfp->skb)
127	continue;
128
129	if (tfp->seqno == ntohs(up->seqno))
130	goto mov_tail;
131
132	tmp_up = (struct unicast_frag_packet *)tfp->skb->data;
133
134	if (tfp->seqno == search_seqno) {
135
136	if ((tmp_up->flags & UNI_FRAG_HEAD) !=
137	(up->flags & UNI_FRAG_HEAD))
138	return tfp;
139	else
140	goto mov_tail;
141	}
142	}
143	return NULL;
144
145	mov_tail:
146	list_move_tail(&tfp->list, head);
147	return NULL;
148	}
149
150	void frag_list_free(struct list_head *head)
151	{
152	struct frag_packet_list_entry pf, tmp_pf;
153
154	if (!list_empty(head)) {
155
156	list_for_each_entry_safe(pf, tmp_pf, head, list) {
157	kfree_skb(pf->skb);
158	list_del(&pf->list);
159	kfree(pf);
160	}
161	}
162	return;
163	}
164
165	/* frag_reassemble_skb():
166	* returns NET_RX_DROP if the operation failed - skb is left intact
167	* returns NET_RX_SUCCESS if the fragment was buffered (skb_new will be NULL)
168	* or the skb could be reassembled (skb_new will point to the new packet and
169	* skb was freed)
170	*/
171	int frag_reassemble_skb(struct sk_buff skb, struct bat_priv bat_priv,
172	struct sk_buff **new_skb)
173	{
174	struct orig_node *orig_node;
175	struct frag_packet_list_entry *tmp_frag_entry;
176	int ret = NET_RX_DROP;
177	struct unicast_frag_packet *unicast_packet =
178	(struct unicast_frag_packet *)skb->data;
179
180	*new_skb = NULL;
7aadf889	181
c6c8fea2	182	spin_lock_bh(&bat_priv->orig_hash_lock);
7aadf889 ML	183	orig_node = orig_hash_find(bat_priv, unicast_packet->orig);
	184	if (!orig_node)
	185	goto unlock;
c6c8fea2 SE	186
	187	orig_node->last_frag_packet = jiffies;
	188
	189	if (list_empty(&orig_node->frag_list) &&
	190	frag_create_buffer(&orig_node->frag_list)) {
	191	pr_debug("couldn't create frag buffer\n");
	192	goto out;
	193	}
	194
	195	tmp_frag_entry = frag_search_packet(&orig_node->frag_list,
	196	unicast_packet);
	197
	198	if (!tmp_frag_entry) {
	199	frag_create_entry(&orig_node->frag_list, skb);
	200	ret = NET_RX_SUCCESS;
	201	goto out;
	202	}
	203
	204	*new_skb = frag_merge_packet(&orig_node->frag_list, tmp_frag_entry,
	205	skb);
	206	/* if not, merge failed */
	207	if (*new_skb)
	208	ret = NET_RX_SUCCESS;
c6c8fea2	209
7aadf889 ML	210	unlock:
	211	spin_unlock_bh(&bat_priv->orig_hash_lock);
	212	out:
	213	if (orig_node)
	214	kref_put(&orig_node->refcount, orig_node_free_ref);
c6c8fea2 SE	215	return ret;
	216	}
	217
	218	int frag_send_skb(struct sk_buff skb, struct bat_priv bat_priv,
	219	struct batman_if *batman_if, uint8_t dstaddr[])
	220	{
	221	struct unicast_packet tmp_uc, *unicast_packet;
	222	struct sk_buff *frag_skb;
	223	struct unicast_frag_packet frag1, frag2;
	224	int uc_hdr_len = sizeof(struct unicast_packet);
	225	int ucf_hdr_len = sizeof(struct unicast_frag_packet);
5c77d8bb	226	int data_len = skb->len - uc_hdr_len;
ae361ce1	227	int large_tail = 0;
c2f7f0e7	228	uint16_t seqno;
c6c8fea2 SE	229
	230	if (!bat_priv->primary_if)
	231	goto dropped;
	232
ed7809d9 JJ	233	frag_skb = dev_alloc_skb(data_len - (data_len / 2) + ucf_hdr_len);
	234	if (!frag_skb)
	235	goto dropped;
5c77d8bb	236	skb_reserve(frag_skb, ucf_hdr_len);
c6c8fea2	237
ed7809d9	238	unicast_packet = (struct unicast_packet *) skb->data;
c6c8fea2	239	memcpy(&tmp_uc, unicast_packet, uc_hdr_len);
5c77d8bb	240	skb_split(skb, frag_skb, data_len / 2 + uc_hdr_len);
c6c8fea2 SE	241
	242	if (my_skb_head_push(skb, ucf_hdr_len - uc_hdr_len) < 0 \|\|
	243	my_skb_head_push(frag_skb, ucf_hdr_len) < 0)
	244	goto drop_frag;
	245
	246	frag1 = (struct unicast_frag_packet *)skb->data;
	247	frag2 = (struct unicast_frag_packet *)frag_skb->data;
	248
	249	memcpy(frag1, &tmp_uc, sizeof(struct unicast_packet));
	250
	251	frag1->ttl--;
	252	frag1->version = COMPAT_VERSION;
	253	frag1->packet_type = BAT_UNICAST_FRAG;
	254
	255	memcpy(frag1->orig, bat_priv->primary_if->net_dev->dev_addr, ETH_ALEN);
	256	memcpy(frag2, frag1, sizeof(struct unicast_frag_packet));
	257
ae361ce1 SE	258	if (data_len & 1)
	259	large_tail = UNI_FRAG_LARGETAIL;
	260
	261	frag1->flags = UNI_FRAG_HEAD \| large_tail;
	262	frag2->flags = large_tail;
c6c8fea2	263
c2f7f0e7 SE	264	seqno = atomic_add_return(2, &batman_if->frag_seqno);
	265	frag1->seqno = htons(seqno - 1);
	266	frag2->seqno = htons(seqno);
c6c8fea2 SE	267
	268	send_skb_packet(skb, batman_if, dstaddr);
	269	send_skb_packet(frag_skb, batman_if, dstaddr);
	270	return NET_RX_SUCCESS;
	271
	272	drop_frag:
	273	kfree_skb(frag_skb);
	274	dropped:
	275	kfree_skb(skb);
	276	return NET_RX_DROP;
	277	}
	278
	279	int unicast_send_skb(struct sk_buff skb, struct bat_priv bat_priv)
	280	{
	281	struct ethhdr ethhdr = (struct ethhdr )skb->data;
	282	struct unicast_packet *unicast_packet;
3878f1f0	283	struct orig_node *orig_node = NULL;
c6c8fea2	284	struct batman_if *batman_if;
44524fcd	285	struct neigh_node *neigh_node;
c6c8fea2 SE	286	int data_len = skb->len;
c6c8fea2 SE	287	uint8_t dstaddr[6];
44524fcd	288	int ret = 1;
c6c8fea2 SE	289
	290	spin_lock_bh(&bat_priv->orig_hash_lock);
	291
	292	/* get routing information */
43c70ad5	293	if (is_multicast_ether_addr(ethhdr->h_dest)) {
c6c8fea2	294	orig_node = (struct orig_node *)gw_get_selected(bat_priv);
43c70ad5	295	if (orig_node)
44524fcd ML	296	goto find_router;
44524fcd ML	297	}
c6c8fea2	298
44524fcd ML	299	/* check for hna host - increases orig_node refcount */
44524fcd ML	300	orig_node = transtable_search(bat_priv, ethhdr->h_dest);
c6c8fea2	301
44524fcd	302	find_router:
a4c135c5	303	/* find_router() increases neigh_nodes refcount if found. */
44524fcd	304	neigh_node = find_router(bat_priv, orig_node, NULL);
c6c8fea2	305
44524fcd	306	if (!neigh_node)
c6c8fea2 SE	307	goto unlock;
c6c8fea2 SE	308
44524fcd ML	309	if (neigh_node->if_incoming->if_status != IF_ACTIVE)
44524fcd ML	310	goto unlock;
c6c8fea2 SE	311
c6c8fea2 SE	312	if (my_skb_head_push(skb, sizeof(struct unicast_packet)) < 0)
44524fcd ML	313	goto unlock;
	314
	315	/* don't lock while sending the packets ... we therefore
	316	* copy the required data before sending */
	317	batman_if = neigh_node->if_incoming;
	318	memcpy(dstaddr, neigh_node->addr, ETH_ALEN);
	319	spin_unlock_bh(&bat_priv->orig_hash_lock);
c6c8fea2 SE	320
	321	unicast_packet = (struct unicast_packet *)skb->data;
	322
	323	unicast_packet->version = COMPAT_VERSION;
	324	/* batman packet type: unicast */
	325	unicast_packet->packet_type = BAT_UNICAST;
	326	/* set unicast ttl */
	327	unicast_packet->ttl = TTL;
	328	/* copy the destination for faster routing */
	329	memcpy(unicast_packet->dest, orig_node->orig, ETH_ALEN);
	330
	331	if (atomic_read(&bat_priv->fragmentation) &&
	332	data_len + sizeof(struct unicast_packet) >
44524fcd	333	batman_if->net_dev->mtu) {
c6c8fea2 SE	334	/* send frag skb decreases ttl */
c6c8fea2 SE	335	unicast_packet->ttl++;
44524fcd ML	336	ret = frag_send_skb(skb, bat_priv, batman_if, dstaddr);
44524fcd ML	337	goto out;
c6c8fea2	338	}
44524fcd	339
c6c8fea2	340	send_skb_packet(skb, batman_if, dstaddr);
44524fcd ML	341	ret = 0;
44524fcd ML	342	goto out;
c6c8fea2 SE	343
	344	unlock:
	345	spin_unlock_bh(&bat_priv->orig_hash_lock);
44524fcd ML	346	out:
	347	if (neigh_node)
	348	neigh_node_free_ref(neigh_node);
	349	if (orig_node)
	350	kref_put(&orig_node->refcount, orig_node_free_ref);
	351	if (ret == 1)
	352	kfree_skb(skb);
	353	return ret;
c6c8fea2	354	}