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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* 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-2018 OpenVPN 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; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef INTEGER_H
#define INTEGER_H
#include "error.h"
/*
* min/max functions
*/
static inline int
max_int(int x, int y)
{
if (x > y)
{
return x;
}
else
{
return y;
}
}
static inline int
min_int(int x, int y)
{
if (x < y)
{
return x;
}
else
{
return y;
}
}
static inline int
constrain_int(int x, int min, int max)
{
if (min > max)
{
return min;
}
if (x < min)
{
return min;
}
else if (x > max)
{
return max;
}
else
{
return x;
}
}
/*
* Functions used for circular buffer index arithmetic.
*/
/*
* Return x - y on a circle of circumference mod by shortest path.
*
* 0 <= x < mod
* 0 <= y < mod
*/
static inline int
modulo_subtract(int x, int y, int mod)
{
const int d1 = x - y;
const int d2 = (x > y ? -mod : mod) + d1;
ASSERT(0 <= x && x < mod && 0 <= y && y < mod);
return abs(d1) > abs(d2) ? d2 : d1;
}
/*
* Return x + y on a circle of circumference mod.
*
* 0 <= x < mod
* -mod <= y <= mod
*/
static inline int
modulo_add(int x, int y, int mod)
{
int sum = x + y;
ASSERT(0 <= x && x < mod && -mod <= y && y <= mod);
if (sum >= mod)
{
sum -= mod;
}
if (sum < 0)
{
sum += mod;
}
return sum;
}
/*
* Return the next largest power of 2
* or u if u is a power of 2.
*/
static inline size_t
adjust_power_of_2(size_t u)
{
size_t ret = 1;
while (ret < u)
{
ret <<= 1;
ASSERT(ret > 0);
}
return ret;
}
static inline int
index_verify(int index, int size, const char *file, int line)
{
if (index < 0 || index >= size)
{
msg(M_FATAL, "Assertion Failed: Array index=%d out of bounds for array size=%d in %s:%d",
index,
size,
file,
line);
}
return index;
}
#endif /* ifndef INTEGER_H */
|
