67 lines
2.6 KiB
C
67 lines
2.6 KiB
C
|
/*
|
||
|
|
* Copyright (c) 2010, Swedish Institute of Computer Science.
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Copyright (c) 2013, ADVANSEE - http://www.advansee.com/
|
||
|
|
* Benoît Thébaudeau <benoit.thebaudeau@advansee.com>
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* 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 name of the Institute nor the names of its contributors
|
||
|
|
* may be used to endorse or promote products derived from this software
|
||
|
|
* without specific prior written permission.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE 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 INSTITUTE 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 POSSIBILITY OF
|
||
|
|
* SUCH DAMAGE.
|
||
|
|
*
|
||
|
|
* This file is part of the Contiki operating system.
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \file
|
||
|
|
* Header file for MAC sequence numbers management
|
||
|
|
* \author
|
||
|
|
* Adam Dunkels <adam@sics.se>
|
||
|
|
* Benoît Thébaudeau <benoit.thebaudeau@advansee.com>
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef MAC_SEQUENCE_H
|
||
|
|
#define MAC_SEQUENCE_H
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Tell whether the packetbuf is a duplicate packet
|
||
|
|
* \return Non-zero if the packetbuf is a duplicate packet, zero otherwise
|
||
|
|
*
|
||
|
|
* This function is used to check for duplicate packet by comparing
|
||
|
|
* the sequence number of the incoming packet with the last few ones
|
||
|
|
* we saw, filtering with the Rime address.
|
||
|
|
*/
|
||
|
|
int mac_sequence_is_duplicate(void);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Register the sequence number of the packetbuf
|
||
|
|
*
|
||
|
|
* This function is used to add the sequence number of the incoming
|
||
|
|
* packet to the history.
|
||
|
|
*/
|
||
|
|
void mac_sequence_register_seqno(void);
|
||
|
|
|
||
|
|
#endif /* MAC_SEQUENCE_H */
|