pktqueue.h
1.87 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/*
* Copyright (C) 2014, 2015 Martine Lenders <mlenders@inf.fu-berlin.de>
*
* This file is subject to the terms and conditions of the GNU Lesser General
* Public License v2.1. See the file LICENSE in the top level directory for
* more details.
*/
/**
* @defgroup net_gnrc_pktqueue Packet queue
* @ingroup net_gnrc
* @brief @ref gnrc_pktsnip_t queue
* @{
*
* @file
* @brief Packet queue definitions
*
* @author Martine Lenders <mlenders@inf.fu-berlin.de>
*/
#ifndef NET_GNRC_PKTQUEUE_H
#define NET_GNRC_PKTQUEUE_H
#include <stdint.h>
#include <stdlib.h>
#include "net/gnrc/pkt.h"
#include "utlist.h"
#ifdef __cplusplus
extern "C" {
#endif
/**
* @brief data type for packet queue nodes
*/
typedef struct gnrc_pktqueue {
struct gnrc_pktqueue *next; /**< next node in queue */
gnrc_pktsnip_t *pkt; /**< pointer to the packet */
} gnrc_pktqueue_t;
/**
* @brief add @p node into @p queue.
*
* @param[in,out] queue the queue, may not be NULL
* @param[in] node the node to add.
*/
static inline void gnrc_pktqueue_add(gnrc_pktqueue_t **queue, gnrc_pktqueue_t *node)
{
LL_APPEND(*queue, node);
}
/**
* @brief remove @p node from @p queue
*
* @param[in] queue the queue, may not be NULL
* @param[in] node the node to remove
*
* @return @p node.
*/
static inline gnrc_pktqueue_t *gnrc_pktqueue_remove(gnrc_pktqueue_t **queue, gnrc_pktqueue_t *node)
{
if (node) {
LL_DELETE(*queue, node);
node->next = NULL;
}
return node;
}
/**
* @brief remove the packet queue's head
*
* @param[in] queue the queue, may not be NULL
*
* @return the old head
*/
static inline gnrc_pktqueue_t *gnrc_pktqueue_remove_head(gnrc_pktqueue_t **queue)
{
return gnrc_pktqueue_remove(queue, *queue);
}
#ifdef __cplusplus
}
#endif
#endif /* NET_GNRC_PKTQUEUE_H */
/**
* @}
*/