4 * @brief general purpose definitions and macros
9 * Copyright (C) 2005 Jan Hutter, Martin Willi
10 * Hochschule fuer Technik Rapperswil
11 * Copyright (C) 1998, 1999 D. Hugh Redelmeier. (Endian stuff)
13 * This program is free software; you can redistribute it and/or modify it
14 * under the terms of the GNU General Public License as published by the
15 * Free Software Foundation; either version 2 of the License, or (at your
16 * option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
18 * This program is distributed in the hope that it will be useful, but
19 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
20 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
24 #ifndef DEFINITIONS_H_
25 #define DEFINITIONS_H_
29 /* stolen from strongswan */
31 # if defined(i386) && !defined(__i386__)
33 # define MYHACKFORTHIS 1
40 #elif !(defined(BIG_ENDIAN) && defined(LITTLE_ENDIAN) && defined(BYTE_ORDER))
41 /* we don't know how to do this, so we require the macros to be defined
42 * with compiler flags:
43 * -DBIG_ENDIAN=4321 -DLITTLE_ENDIAN=1234 -DBYTE_ORDER=BIG_ENDIAN
44 * or -DBIG_ENDIAN=4321 -DLITTLE_ENDIAN=1234 -DBYTE_ORDER=LITTLE_ENDIAN
45 * Thse match the GNU definitions
47 # include <sys/endian.h>
51 #error "BIG_ENDIAN must be defined"
55 #error "LITTLE_ENDIAN must be defined"
59 #error "BYTE_ORDER must be defined"
66 * Classes which implement configuration related things.
72 * Classes used to encode and decode IKEv2 Messages.
78 * Classes for network relevant stuff.
84 * Classes representing a specific IKEv2 Payload.
92 * Security association with all helber classes.
99 * Varius states in which an IKE SA can be.
107 * Different kind of queues.
113 * Jobs used in job queue and event queue.
119 * @defgroup testcases
121 * Testcases used to test the different classes in seperate module tests.
125 * @defgroup transforms
127 * Transform algorithms of different kind.
133 * RSA public key algorithm
135 * @ingroup transforms
141 * Pseudo random functions, generate a lot of pseudo
142 * randomness using random numbers.
144 * @ingroup transforms
150 * Symmetric signing algorithms, used to ensure
153 * @ingroup transforms
159 * Symmetric encryption algorithms, used to en-
162 * @ingroup transforms
168 * Hashing algorithms.
170 * Example for using hasher_t:
174 * u_int8_t sha1_hash[20];
178 * data.ptr = "string to hash";
179 * data.len = strlen(data.ptr);
181 * // use MD5, allocate hash
182 * hasher = hasher_create(HASH_MD5);
183 * hasher->allocate_hash(hasher, data, &hash);
184 * hasher->destroy(hasher);
186 * // use SHA1, hash in buffer
187 * hasher = hasher_create(HASH_SHA1);
188 * hasher->get_hash(hasher, data, &sha1_hash);
189 * hasher->destroy(hasher);
194 * @ingroup transforms
200 * Generic helper classes.
206 * Threaded classes, which will do their
213 * macro gives back larger of two values
215 #define max(x,y) (x > y ? x : y)
219 * macro gives back smaller of two values
221 #define min(x,y) (x < y ? x : y)
225 * mapping entry which defines the end of a mapping_t array
227 #define MAPPING_END (-1)
229 typedef struct mapping_t mapping_t
;
232 * @brief mapping entry, where enum-to-string mappings are stored.
248 * @brief find a mapping_string in the mapping[]
250 * @param mappings mappings array
251 * @param value enum-value to get the string from
254 char *mapping_find(mapping_t
*mappings
, int value
);
258 * Default random device used when no device is given.
260 #define DEFAULT_RANDOM_DEVICE "/dev/random"
263 * Pseudo random device used when no device is given.
265 #define DEFAULT_PSEUDO_RANDOM_DEVICE "/dev/urandom"
268 #endif /*DEFINITIONS_H_*/