forked from mas-bandwidth/yojimbo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
yojimbo_common.h
279 lines (225 loc) · 8.36 KB
/
yojimbo_common.h
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
/*
Yojimbo Client/Server Network Library.
Copyright © 2016, The Network Protocol Company, Inc.
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 copyright holder 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 COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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.
*/
#ifndef YOJIMBO_COMMON_H
#define YOJIMBO_COMMON_H
#include "yojimbo_config.h"
#include <stdint.h>
#include <stddef.h>
#include <stdlib.h>
#include <stdarg.h>
#include <assert.h>
namespace yojimbo
{
inline int random_int( int a, int b )
{
assert( a < b );
int result = a + rand() % ( b - a + 1 );
assert( result >= a );
assert( result <= b );
return result;
}
inline float random_float( float a, float b )
{
assert( a < b );
float random = ( (float) rand() ) / (float) RAND_MAX;
float diff = b - a;
float r = random * diff;
return a + r;
}
#ifndef min
template <typename T> const T & min( const T & a, const T & b )
{
return ( a < b ) ? a : b;
}
#endif
#ifndef max
template <typename T> const T & max( const T & a, const T & b )
{
return ( a > b ) ? a : b;
}
#endif
template <typename T> T clamp( const T & value, const T & min, const T & max )
{
if ( value < min )
return min;
else if ( value > max )
return max;
else
return value;
}
template <typename T> void swap( T & a, T & b )
{
T tmp = a;
a = b;
b = tmp;
};
template <typename T> T abs( const T & value )
{
return ( value < 0 ) ? -value : value;
}
template <uint32_t x> struct PopCount
{
enum { a = x - ( ( x >> 1 ) & 0x55555555 ),
b = ( ( ( a >> 2 ) & 0x33333333 ) + ( a & 0x33333333 ) ),
c = ( ( ( b >> 4 ) + b ) & 0x0f0f0f0f ),
d = c + ( c >> 8 ),
e = d + ( d >> 16 ),
result = e & 0x0000003f
};
};
template <uint32_t x> struct Log2
{
enum { a = x | ( x >> 1 ),
b = a | ( a >> 2 ),
c = b | ( b >> 4 ),
d = c | ( c >> 8 ),
e = d | ( d >> 16 ),
f = e >> 1,
result = PopCount<f>::result
};
};
template <int64_t min, int64_t max> struct BitsRequired
{
static const uint32_t result = ( min == max ) ? 0 : ( Log2<uint32_t(max-min)>::result + 1 );
};
#define BITS_REQUIRED( min, max ) BitsRequired<min,max>::result
inline uint32_t popcount( uint32_t x )
{
#ifdef __GNUC__
return __builtin_popcount( x );
#else // #ifdef __GNUC__
const uint32_t a = x - ( ( x >> 1 ) & 0x55555555 );
const uint32_t b = ( ( ( a >> 2 ) & 0x33333333 ) + ( a & 0x33333333 ) );
const uint32_t c = ( ( ( b >> 4 ) + b ) & 0x0f0f0f0f );
const uint32_t d = c + ( c >> 8 );
const uint32_t e = d + ( d >> 16 );
const uint32_t result = e & 0x0000003f;
return result;
#endif // #ifdef __GNUC__
}
#ifdef __GNUC__
inline int bits_required( uint32_t min, uint32_t max )
{
return 32 - __builtin_clz( max - min );
}
#else // #ifdef __GNUC__
inline uint32_t log2( uint32_t x )
{
const uint32_t a = x | ( x >> 1 );
const uint32_t b = a | ( a >> 2 );
const uint32_t c = b | ( b >> 4 );
const uint32_t d = c | ( c >> 8 );
const uint32_t e = d | ( d >> 16 );
const uint32_t f = e >> 1;
return popcount( f );
}
inline int bits_required( uint32_t min, uint32_t max )
{
return ( min == max ) ? 0 : log2( max - min ) + 1;
}
#endif // #ifdef __GNUC__
inline uint32_t bswap( uint32_t value )
{
#ifdef __GNUC__
return __builtin_bswap32( value );
#else // #ifdef __GNUC__
return ( value & 0x000000ff ) << 24 | ( value & 0x0000ff00 ) << 8 | ( value & 0x00ff0000 ) >> 8 | ( value & 0xff000000 ) >> 24;
#endif // #ifdef __GNUC__
}
inline uint16_t bswap( uint16_t value )
{
return ( value & 0x00ff ) << 8 | ( value & 0xff00 ) >> 8;
}
// IMPORTANT: These functions consider network order to be little endian because most modern processors are little endian. Least amount of work!
inline uint32_t host_to_network( uint32_t value )
{
#if YOJIMBO_BIG_ENDIAN
return bswap( value );
#else // #if YOJIMBO_BIG_ENDIAN
return value;
#endif // #if YOJIMBO_BIG_ENDIAN
}
inline uint32_t network_to_host( uint32_t value )
{
#if YOJIMBO_BIG_ENDIAN
return bswap( value );
#else // #if YOJIMBO_BIG_ENDIAN
return value;
#endif // #if YOJIMBO_BIG_ENDIAN
}
inline uint16_t host_to_network( uint16_t value )
{
#if YOJIMBO_BIG_ENDIAN
return bswap( value );
#else // #if YOJIMBO_BIG_ENDIAN
return value;
#endif // #if YOJIMBO_BIG_ENDIAN
}
inline uint16_t network_to_host( uint16_t value )
{
#if YOJIMBO_BIG_ENDIAN
return bswap( value );
#else // #if YOJIMBO_BIG_ENDIAN
return value;
#endif // #if YOJIMBO_BIG_ENDIAN
}
inline bool sequence_greater_than( uint16_t s1, uint16_t s2 )
{
return ( ( s1 > s2 ) && ( s1 - s2 <= 32768 ) ) ||
( ( s1 < s2 ) && ( s2 - s1 > 32768 ) );
}
inline bool sequence_less_than( uint16_t s1, uint16_t s2 )
{
return sequence_greater_than( s2, s1 );
}
inline int sequence_difference( uint16_t _s1, uint16_t _s2 )
{
int s1 = _s1;
int s2 = _s2;
if ( abs( s1 - s2 ) >= 32768 )
{
if ( s1 > s2 )
s2 += 65536;
else
s1 += 65536;
}
return s1 - s2;
}
inline int signed_to_unsigned( int n )
{
return ( n << 1 ) ^ ( n >> 31 );
}
inline int unsigned_to_signed( uint32_t n )
{
return ( n >> 1 ) ^ ( -int32_t( n & 1 ) );
}
void compress_packet_sequence( uint64_t sequence, uint8_t & prefix_byte, int & num_sequence_bytes, uint8_t * sequence_bytes );
int get_packet_sequence_bytes( uint8_t prefix_byte );
uint64_t decompress_packet_sequence( uint8_t prefix_byte, const uint8_t * sequence_bytes );
uint32_t calculate_crc32( const uint8_t *buffer, size_t length, uint32_t crc32 = 0 );
uint32_t hash_data( const uint8_t * data, uint32_t length, uint32_t hash );
uint32_t hash_string( const char string[], uint32_t hash );
uint64_t murmur_hash_64( const void * key, uint32_t length, uint64_t seed );
void print_bytes( const char * label, const uint8_t * data, int data_bytes );
int base64_encode_string( const char * input, char * output, int output_size );
int base64_decode_string( const char * input, char * output, int output_size );
int base64_encode_data( const uint8_t * input, int input_length, char * output, int output_size );
int base64_decode_data( const char * input, uint8_t * output, int output_size );
void debug_printf( const char * format, ... );
}
#endif // #ifndef YOJIMBO_COMMON_H