/*

   * 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
   *
   */
  
  #ifndef _NET_BATMAN_ADV_UNICAST_H_
  #define _NET_BATMAN_ADV_UNICAST_H_

  #include "packet.h"

  #define FRAG_TIMEOUT 10000	/* purge frag list entries after time in ms */

  #define FRAG_BUFFER_SIZE 6	/* number of list elements in buffer */
  
  int frag_reassemble_skb(struct sk_buff *skb, struct bat_priv *bat_priv,
  			struct sk_buff **new_skb);
  void frag_list_free(struct list_head *head);
  int unicast_send_skb(struct sk_buff *skb, struct bat_priv *bat_priv);
  int frag_send_skb(struct sk_buff *skb, struct bat_priv *bat_priv,

  		  struct hard_iface *hard_iface, const uint8_t dstaddr[]);

  static inline int frag_can_reassemble(const struct sk_buff *skb, int mtu)

  {

  	const struct unicast_frag_packet *unicast_packet;

  	int uneven_correction = 0;
  	unsigned int merged_size;
  
  	unicast_packet = (struct unicast_frag_packet *)skb->data;
  
  	if (unicast_packet->flags & UNI_FRAG_LARGETAIL) {
  		if (unicast_packet->flags & UNI_FRAG_HEAD)
  			uneven_correction = 1;
  		else
  			uneven_correction = -1;
  	}

  	merged_size = (skb->len - sizeof(*unicast_packet)) * 2;

  	merged_size += sizeof(struct unicast_packet) + uneven_correction;
  
  	return merged_size <= mtu;
  }

  #endif /* _NET_BATMAN_ADV_UNICAST_H_ */