summaryrefslogtreecommitdiff
path: root/src/openvpn/circ_list.h
blob: ecf2a7f3647f2e7ef4ad63c88504a6039551e57b (plain)
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
/*
 *  OpenVPN -- An application to securely tunnel IP networks
 *             over a single UDP port, with support for SSL/TLS-based
 *             session authentication and key exchange,
 *             packet encryption, packet authentication, and
 *             packet compression.
 *
 *  Copyright (C) 2002-2017 OpenVPN Technologies, Inc. <sales@openvpn.net>
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License version 2
 *  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 (see the file COPYING included with this
 *  distribution); if not, write to the Free Software Foundation, Inc.,
 *  59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

#ifndef CIRC_LIST_H
#define CIRC_LIST_H

#include "basic.h"
#include "integer.h"
#include "error.h"

#define CIRC_LIST(name, type) \
    struct name { \
        int x_head; \
        int x_size; \
        int x_cap; \
        int x_sizeof; \
        type x_list[EMPTY_ARRAY_SIZE]; \
    }

#define CIRC_LIST_PUSH(obj, item) \
    { \
        (obj)->x_head = modulo_add((obj)->x_head, -1, (obj)->x_cap); \
        (obj)->x_list[(obj)->x_head] = (item); \
        (obj)->x_size = min_int((obj)->x_size + 1, (obj)->x_cap); \
    }

#define CIRC_LIST_SIZE(obj) \
    ((obj)->x_size)

#define CIRC_LIST_INDEX(obj, index) \
    modulo_add((obj)->x_head, \
               index_verify((index), (obj)->x_size, __FILE__, __LINE__), \
               (obj)->x_cap)

#define CIRC_LIST_ITEM(obj, index) \
    ((obj)->x_list[CIRC_LIST_INDEX((obj), (index))])

#define CIRC_LIST_RESET(obj) \
    { \
        (obj)->x_head = 0; \
        (obj)->x_size = 0; \
    }

#define CIRC_LIST_ALLOC(dest, list_type, size) \
    { \
        const int so = sizeof(list_type) + sizeof((dest)->x_list[0]) * (size); \
        (dest) = (list_type *) malloc(so); \
        check_malloc_return(dest); \
        memset((dest), 0, so); \
        (dest)->x_cap = size; \
        (dest)->x_sizeof = so; \
    }

#define CIRC_LIST_FREE(dest) \
    free(dest)

#endif /* ifndef CIRC_LIST_H */