version 1.16.2.5, 2012/04/02 09:10:30
|
version 1.22.2.5, 2012/07/30 11:20:07
|
Line 58 SUCH DAMAGE.
|
Line 58 SUCH DAMAGE.
|
#include <sys/un.h> |
#include <sys/un.h> |
#include <net/if_dl.h> |
#include <net/if_dl.h> |
#include <netinet/in.h> |
#include <netinet/in.h> |
|
#include <atree.h> |
|
#include <ampool.h> |
|
|
|
|
|
#ifndef STRSIZ |
|
#define STRSIZ 256 |
|
#endif |
|
|
|
#ifndef be16toh |
|
#define be16toh betoh16 |
|
#endif |
|
#ifndef be32toh |
|
#define be32toh betoh32 |
|
#endif |
|
#ifndef be64toh |
|
#define be64toh betoh64 |
|
#endif |
|
#ifndef le16toh |
|
#define le16toh letoh16 |
|
#endif |
|
#ifndef le32toh |
|
#define le32toh letoh32 |
|
#endif |
|
#ifndef le64toh |
|
#define le64toh letoh64 |
|
#endif |
|
|
|
#define IO_SYSM 0 |
|
#define IO_MPOOL 1 |
|
|
#define VACUUM_LEFT 1 |
#define VACUUM_LEFT 1 |
#define VACUUM_BETWEEN 2 |
#define VACUUM_BETWEEN 2 |
|
|
Line 74 typedef struct _tagSplitArray {
|
Line 102 typedef struct _tagSplitArray {
|
} sarr_t; |
} sarr_t; |
|
|
typedef struct _tagArray { |
typedef struct _tagArray { |
|
int arr_last; |
int arr_num; |
int arr_num; |
void **arr_data; |
void **arr_data; |
} array_t; |
} array_t; |
Line 90 typedef enum {
|
Line 119 typedef enum {
|
|
|
typedef struct { |
typedef struct { |
uint8_t val_type; |
uint8_t val_type; |
uint8_t val_pad; | union { |
| struct { |
| uint8_t val_in:1; |
| uint8_t val_be:1; |
| uint8_t val_le:1; |
| uint8_t val_pad:5; |
| }; |
| uint8_t val_opt; |
| }; |
uint16_t val_key; |
uint16_t val_key; |
uint32_t val_len; |
uint32_t val_len; |
union { |
union { |
Line 112 typedef struct {
|
Line 149 typedef struct {
|
int64_t i64; |
int64_t i64; |
} val; |
} val; |
uint8_t val_data[0]; |
uint8_t val_data[0]; |
} __packed ait_val_t; | } __packed ait_val_t; /* sizeof 16 bytes */ |
|
|
#define AIT_TYPE(_vl) ((ait_type_t) (_vl)->val_type) |
#define AIT_TYPE(_vl) ((ait_type_t) (_vl)->val_type) |
#define AIT_LEN(_vl) (_vl)->val_len |
#define AIT_LEN(_vl) (_vl)->val_len |
#define AIT_KEY(_vl) (_vl)->val_key |
#define AIT_KEY(_vl) (_vl)->val_key |
#define AIT_RAW(_vl) (_vl)->val.net |
#define AIT_RAW(_vl) (_vl)->val.net |
#define AIT_VOID(_vl) (_vl)->val.ptr | #define AIT_ADDR(_vl) (_vl)->val.ptr |
#define AIT_BLOB_CHUNKS(_vl, _n) (assert((_vl)), AIT_LEN((_vl)) / _n + (AIT_LEN((_vl)) % _n) ? 1 : 0) | #define AIT_IN(_vl) (_vl)->val_in |
#define AIT_ISEMPTY(_vl) (assert((_vl)), AIT_TYPE((_vl)) == empty) | #define AIT_BE(_vl) (_vl)->val_be |
| #define AIT_LE(_vl) (_vl)->val_le |
| #define AIT_BLOB_CHUNKS(_vl, _n) (AIT_LEN((_vl)) / _n + (AIT_LEN((_vl)) % _n) ? 1 : 0) |
| #define AIT_ISEMPTY(_vl) (AIT_TYPE((_vl)) == empty) |
|
|
#define AIT_GET_LIKE(_vl, _type) ((_type) ((_vl) ? (_vl)->val.ptr : NULL)) | #define AIT_GET_LIKE(_vl, _type) ((_type) AIT_ADDR((_vl))) |
|
|
#define AIT_GET_PTR(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == ptr), (_vl)->val.ptr) | #define AIT_GET_PTR(_vl) (assert(AIT_TYPE((_vl)) == ptr), (_vl)->val.ptr) |
#define AIT_GET_DATA(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == data), (_vl)->val_data) | #define AIT_GET_DATA(_vl) (assert(AIT_TYPE((_vl)) == data), (_vl)->val_data) |
#define AIT_GET_BUF(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == buffer), (_vl)->val.buffer) | #define AIT_GET_BUF(_vl) (assert(AIT_TYPE((_vl)) == buffer), (_vl)->val.buffer) |
#define AIT_GET_STR(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == string), (_vl)->val.string) | #define AIT_GET_STR(_vl) (assert(AIT_TYPE((_vl)) == string), (char*) (_vl)->val.string) |
#define AIT_GET_BLOB(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == blob), (_vl)->val.blob) | #define AIT_GET_BLOB(_vl) (assert(AIT_TYPE((_vl)) == blob), (_vl)->val.blob) |
#define AIT_GET_U8(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == u8), (_vl)->val.u8) | #define AIT_GET_U8(_vl) (assert(AIT_TYPE((_vl)) == u8), (_vl)->val.u8) |
#define AIT_GET_U16(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == u16), (_vl)->val.u16) | #define AIT_GET_U16(_vl) (assert(AIT_TYPE((_vl)) == u16), (_vl)->val.u16) |
#define AIT_GET_U32(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == u32), (_vl)->val.u32) | #define AIT_GET_U32(_vl) (assert(AIT_TYPE((_vl)) == u32), (_vl)->val.u32) |
#define AIT_GET_U64(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == u64), (_vl)->val.u64) | #define AIT_GET_U64(_vl) (assert(AIT_TYPE((_vl)) == u64), (_vl)->val.u64) |
#define AIT_GET_I8(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == i8), (_vl)->val.i8) | #define AIT_GET_I8(_vl) (assert(AIT_TYPE((_vl)) == i8), (_vl)->val.i8) |
#define AIT_GET_I16(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == i16), (_vl)->val.i16) | #define AIT_GET_I16(_vl) (assert(AIT_TYPE((_vl)) == i16), (_vl)->val.i16) |
#define AIT_GET_I32(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == i32), (_vl)->val.i32) | #define AIT_GET_I32(_vl) (assert(AIT_TYPE((_vl)) == i32), (_vl)->val.i32) |
#define AIT_GET_I64(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == i64), (_vl)->val.i64) | #define AIT_GET_I64(_vl) (assert(AIT_TYPE((_vl)) == i64), (_vl)->val.i64) |
#define AIT_GET_F32(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == f32), (_vl)->val.f32) | #define AIT_GET_F32(_vl) (assert(AIT_TYPE((_vl)) == f32), (_vl)->val.f32) |
#define AIT_GET_F64(_vl) (assert((_vl)), assert(AIT_TYPE((_vl)) == f64), (_vl)->val.f64) | #define AIT_GET_F64(_vl) (assert(AIT_TYPE((_vl)) == f64), (_vl)->val.f64) |
|
|
#define AIT_SET_DATA(_vl, _p, _len) do { ait_val_t *__val = (_vl); \ |
#define AIT_SET_DATA(_vl, _p, _len) do { ait_val_t *__val = (_vl); \ |
__val = realloc(__val, sizeof(ait_val_t) + _len); \ | __val = io_realloc(__val, sizeof(ait_val_t) + _len); \ |
if (__val) { \ |
if (__val) { \ |
__val->val_type = data; AIT_LEN(__val) = _len; \ |
__val->val_type = data; AIT_LEN(__val) = _len; \ |
if ((_p)) \ |
if ((_p)) \ |
Line 150 typedef struct {
|
Line 190 typedef struct {
|
(_vl) = __val; \ |
(_vl) = __val; \ |
} while (0); |
} while (0); |
#define AIT_SET_PTR(_vl, _p, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
#define AIT_SET_PTR(_vl, _p, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
__val->val_type = ptr; AIT_LEN(__val) = _len; \ | __val->val_type = ptr; __val->val.ptr = _p; \ |
__val->val.ptr = _p; } while (0) | AIT_LEN(__val) = _len; } while (0) |
| #define AIT_RE_BUF(_vl, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
| void *__ptr = io_realloc(AIT_GET_BUF(__val), _len); \ |
| if (__ptr) { \ |
| __val->val.buffer = __ptr; AIT_LEN(__val) = _len; \ |
| } } while (0) |
| #define AIT_SET_BUF2(_vl, _c, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
| __val->val.buffer = io_malloc(_len); \ |
| if (__val->val.buffer) { \ |
| __val->val_type = buffer; AIT_LEN(__val) = _len; \ |
| memset(__val->val.buffer, _c, _len); \ |
| } } while (0) |
#define AIT_SET_BUF(_vl, _v, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
#define AIT_SET_BUF(_vl, _v, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
__val->val.buffer = malloc(_len); \ | __val->val.buffer = io_malloc(_len); \ |
if (__val->val.buffer) { \ |
if (__val->val.buffer) { \ |
__val->val_type = buffer; AIT_LEN(__val) = _len; \ |
__val->val_type = buffer; AIT_LEN(__val) = _len; \ |
memcpy(__val->val.buffer, (_v), _len); \ | if ((_v)) \ |
| memcpy(__val->val.buffer, (_v), _len); \ |
| else \ |
| memset(__val->val.buffer, 0, _len); \ |
} } while (0) |
} } while (0) |
#define AIT_SET_STR(_vl, _v) do { ait_val_t *__val = (_vl); assert(__val); \ |
#define AIT_SET_STR(_vl, _v) do { ait_val_t *__val = (_vl); assert(__val); \ |
__val->val.string = (int8_t*) strdup((_v)); \ | __val->val.string = (int8_t*) io_strdup((_v)); \ |
if (__val->val.string) { \ |
if (__val->val.string) { \ |
__val->val_type = string; \ |
__val->val_type = string; \ |
AIT_LEN(__val) = strlen((_v)) + 1; \ |
AIT_LEN(__val) = strlen((_v)) + 1; \ |
} } while (0) |
} } while (0) |
#define AIT_SET_STRCAT(_vl, _v) do { ait_val_t *__val = (_vl); assert(__val); \ |
#define AIT_SET_STRCAT(_vl, _v) do { ait_val_t *__val = (_vl); assert(__val); \ |
assert(AIT_TYPE(__val) == string); \ |
assert(AIT_TYPE(__val) == string); \ |
void *__p = realloc(__val->val.string, \ | void *__p = io_realloc(__val->val.string, \ |
AIT_LEN(__val) + strlen((_v))); \ |
AIT_LEN(__val) + strlen((_v))); \ |
if (__p) { \ |
if (__p) { \ |
__val->val.string = __p; \ |
__val->val.string = __p; \ |
Line 174 typedef struct {
|
Line 228 typedef struct {
|
strlcat((char*) __val->val.string, (_v), \ |
strlcat((char*) __val->val.string, (_v), \ |
AIT_LEN(__val)); \ |
AIT_LEN(__val)); \ |
} } while (0) |
} } while (0) |
|
#define AIT_SET_STRCPY(_vl, _v) do { ait_val_t *__val = (_vl); assert(__val); \ |
|
assert(AIT_TYPE(__val) == string); \ |
|
void *__p = io_realloc(__val->val.string, \ |
|
strlen((_v)) + 1); \ |
|
if (__p) { \ |
|
__val->val.string = __p; \ |
|
AIT_LEN(__val) = strlen((_v)) + 1; \ |
|
strlcpy((char*) __val->val.string, (_v), \ |
|
AIT_LEN(__val)); \ |
|
} } while (0) |
#define AIT_SET_BLOB(_vl, _n, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
#define AIT_SET_BLOB(_vl, _n, _len) do { ait_val_t *__val = (_vl); assert(__val); \ |
__val->val_type = blob; AIT_LEN(__val) = _len; \ | __val->val_type = blob; __val->val.blob = _n; \ |
__val->val.blob = _n; } while (0) | AIT_LEN(__val) = _len; } while (0) |
#define AIT_SET_BLOB2(_vl, _bv) do { ait_val_t *__val = (_vl); assert(__val); assert((_bv)); \ |
#define AIT_SET_BLOB2(_vl, _bv) do { ait_val_t *__val = (_vl); assert(__val); assert((_bv)); \ |
__val->val_type = blob; AIT_LEN(__val) = (_bv)->blob_len; \ | __val->val_type = blob; AIT_LEN(__val) = \ |
| (_bv)->blob_len; \ |
__val->val.blob = (_bv)->blob_var; } while (0) |
__val->val.blob = (_bv)->blob_var; } while (0) |
#define AIT_NEW_BLOB(_vl, _len) AIT_SET_BLOB((_vl), 0, _len) |
#define AIT_NEW_BLOB(_vl, _len) AIT_SET_BLOB((_vl), 0, _len) |
|
|
Line 213 typedef struct {
|
Line 278 typedef struct {
|
__val->val_type = f64; __val->val.f64 = _n; \ |
__val->val_type = f64; __val->val.f64 = _n; \ |
AIT_LEN(__val) = sizeof(double); } while (0) |
AIT_LEN(__val) = sizeof(double); } while (0) |
|
|
/* if attribute zeroCopy is set not execute free() */ | #define AIT_COPY_VAL(_vl, _v) do { memcpy((_vl), (_v), sizeof(ait_val_t)); \ |
| switch (AIT_TYPE((_vl))) { \ |
| case buffer: \ |
| AIT_SET_BUF((_vl), \ |
| AIT_GET_BUF((_v)), \ |
| AIT_LEN((_v))); \ |
| break; \ |
| case string: \ |
| AIT_SET_STR((_vl), \ |
| AIT_GET_STR((_v))); \ |
| break; \ |
| default: \ |
| break; \ |
| } \ |
| } while (0) |
| #define AIT_COPY_VAL2(_vl, _v) do { AIT_COPY_VAL((_vl), (_v)); \ |
| if (AIT_TYPE((_vl)) == data) \ |
| AIT_SET_DATA((_vl), AIT_GET_DATA((_v)), \ |
| AIT_LEN((_v))); \ |
| } while (0) |
| |
| #define AIT_INIT_VAL(_vl) (memset((_vl), 0, sizeof(ait_val_t))) |
| #define AIT_INIT_VAL2(_vl, _t) do { \ |
| AIT_INIT_VAL((_vl)); \ |
| (_vl)->val_type = _t; \ |
| } while (0) |
| /* if attribute zeroCopy is set not execute io_free() */ |
#define AIT_FREE_VAL(_vl) do { ait_val_t *__val = (_vl); assert(__val); \ |
#define AIT_FREE_VAL(_vl) do { ait_val_t *__val = (_vl); assert(__val); \ |
switch (AIT_TYPE(__val)) { \ |
switch (AIT_TYPE(__val)) { \ |
case buffer: \ |
case buffer: \ |
if (__val->val.buffer) { \ | if (!__val->val_in && \ |
free(__val->val.buffer); \ | __val->val.buffer) \ |
__val->val.buffer = NULL; \ | io_free(__val->val.buffer); \ |
} \ | __val->val.buffer = NULL; \ |
break; \ |
break; \ |
case string: \ |
case string: \ |
if (__val->val.string) { \ | if (!__val->val_in && \ |
free(__val->val.string); \ | __val->val.string) \ |
__val->val.string = NULL; \ | io_free(__val->val.string); \ |
} \ | __val->val.string = NULL; \ |
break; \ |
break; \ |
default: \ |
default: \ |
break; \ |
break; \ |
} \ |
} \ |
__val->val_type = empty; \ |
__val->val_type = empty; \ |
|
__val->val_opt ^= __val->val_opt; \ |
AIT_LEN(__val) = 0; \ |
AIT_LEN(__val) = 0; \ |
|
AIT_KEY(__val) = 0; \ |
} while (0) |
} while (0) |
|
#define AIT_ZERO_VAL(_vl) do { ait_val_t *__val = (_vl); assert(__val); \ |
|
switch (AIT_TYPE(__val)) { \ |
|
case buffer: \ |
|
case string: \ |
|
memset(__val->val.buffer, 0, \ |
|
AIT_LEN(__val)); \ |
|
break; \ |
|
case data: \ |
|
memset(__val->val_data, 0, \ |
|
AIT_LEN(__val)); \ |
|
break; \ |
|
default: \ |
|
__val->val.net = 0LL; \ |
|
break; \ |
|
} \ |
|
AIT_KEY(__val) = 0; \ |
|
} while (0) |
|
|
struct io_ether_addr { |
struct io_ether_addr { |
u_int8_t ether_addr_octet[6]; |
u_int8_t ether_addr_octet[6]; |
Line 248 typedef union {
|
Line 358 typedef union {
|
struct sockaddr_in6 sin6; |
struct sockaddr_in6 sin6; |
struct sockaddr_dl sdl; |
struct sockaddr_dl sdl; |
} io_sockaddr_t; |
} io_sockaddr_t; |
|
#define IO_SOCKADDR_INIT { .ss = { 0 } } |
|
|
|
|
#define io_align(x, a) (((x) + (a)) & ~(a)) |
#define io_align(x, a) (((x) + (a)) & ~(a)) |
Line 259 inline int io_GetErrno();
|
Line 370 inline int io_GetErrno();
|
inline const char *io_GetError(); |
inline const char *io_GetError(); |
|
|
|
|
|
// io_mm_inuse() Check for memory management model |
|
inline int io_mm_inuse(); |
|
|
/* |
/* |
|
* ioLibInit() - Init libaitio library memory management |
|
* |
|
* @mm = memory management (IO_SYSM or IO_MPOOL) |
|
* @maxmem = memory limit |
|
* return: -1 error or !=-1 used memory management model |
|
*/ |
|
inline int ioLibInit(int mm, unsigned long maxmem); |
|
/* |
|
* ioLibFini() - Finish libaitio library memory management |
|
* |
|
* return: none |
|
*/ |
|
inline void ioLibFini(); |
|
|
|
/* memory management hooks */ |
|
extern void *(*io_malloc)(size_t); |
|
extern void *(*io_calloc)(size_t, size_t); |
|
extern void *(*io_realloc)(void*, size_t); |
|
extern char *(*io_strdup)(const char*); |
|
extern void (*io_free)(void*); |
|
|
|
|
|
/* |
* io_ether_ntoa() - Convert ethernet address to string |
* io_ether_ntoa() - Convert ethernet address to string |
* |
* |
* @n = ethernet address structure, like struct ether_addr |
* @n = ethernet address structure, like struct ether_addr |
Line 310 io_sockaddr_t *io_gethostbyname(const char *psHost, un
|
Line 447 io_sockaddr_t *io_gethostbyname(const char *psHost, un
|
* @vars = Variable array |
* @vars = Variable array |
* return: -1 error, 0 nothing done or >0 size of marshaled data |
* return: -1 error, 0 nothing done or >0 size of marshaled data |
*/ |
*/ |
int io_vars2buffer(unsigned char *buf, int buflen, array_t *vars); | inline int io_vars2buffer(unsigned char * __restrict buf, int buflen, |
| array_t * __restrict vars); |
/* |
/* |
* io_buffer2vars() - De-marshaling data from buffer to array with variables |
* io_buffer2vars() - De-marshaling data from buffer to array with variables |
* |
* |
Line 321 int io_vars2buffer(unsigned char *buf, int buflen, arr
|
Line 459 int io_vars2buffer(unsigned char *buf, int buflen, arr
|
*DON'T MODIFY OR DESTROY BUFFER*. =0 call io_arrayFree() before io_arrayDestroy() |
*DON'T MODIFY OR DESTROY BUFFER*. =0 call io_arrayFree() before io_arrayDestroy() |
* return: =NULL error, !=NULL allocated variable array, after use must free with io_arrayDestroy() |
* return: =NULL error, !=NULL allocated variable array, after use must free with io_arrayDestroy() |
*/ |
*/ |
array_t *io_buffer2vars(unsigned char *buf, int buflen, int vnum, int zcpy); | inline array_t *io_buffer2vars(unsigned char * __restrict buf, int buflen, int vnum, int zcpy); |
/* |
/* |
* io_vars2map() - Marshaling data from array with variables to memory map |
* io_vars2map() - Marshaling data from array with variables to memory map |
* |
* |
Line 330 array_t *io_buffer2vars(unsigned char *buf, int buflen
|
Line 468 array_t *io_buffer2vars(unsigned char *buf, int buflen
|
* @vars = Variable array |
* @vars = Variable array |
* return: -1 error, 0 nothing done or >0 size of marshaled data |
* return: -1 error, 0 nothing done or >0 size of marshaled data |
*/ |
*/ |
int io_vars2map(unsigned char *buf, int buflen, array_t *vars); | inline int io_vars2map(unsigned char * __restrict buf, int buflen, |
| array_t * __restrict vars); |
/* |
/* |
* io_map2vars() - De-marshaling data from memory map to array with variables |
* io_map2vars() - De-marshaling data from memory map to array with variables |
* |
* |
Line 341 int io_vars2map(unsigned char *buf, int buflen, array_
|
Line 480 int io_vars2map(unsigned char *buf, int buflen, array_
|
*DON'T MODIFY OR DESTROY BUFFER*. =0 call io_arrayFree() before io_arrayDestroy() |
*DON'T MODIFY OR DESTROY BUFFER*. =0 call io_arrayFree() before io_arrayDestroy() |
* return: =NULL error, !=NULL allocated variable array, after use must free with io_arrayDestroy() |
* return: =NULL error, !=NULL allocated variable array, after use must free with io_arrayDestroy() |
*/ |
*/ |
array_t *io_map2vars(unsigned char *buf, int buflen, int vnum, int zcpy); | inline array_t *io_map2vars(unsigned char * __restrict buf, int buflen, int vnum, int zcpy); |
|
|
/* |
/* |
* io_allocVar() - Allocate memory for variable |
* io_allocVar() - Allocate memory for variable |
Line 355 inline ait_val_t *io_allocVar(void);
|
Line 494 inline ait_val_t *io_allocVar(void);
|
* @val = Variable |
* @val = Variable |
* return: none |
* return: none |
*/ |
*/ |
inline void io_freeVar(ait_val_t * __restrict val); | inline void io_freeVar(ait_val_t ** __restrict val); |
/* |
/* |
* io_allocVars() - Allocate ait_val_t array |
* io_allocVars() - Allocate ait_val_t array |
* |
* |
Line 378 inline int io_clrVars(array_t * __restrict vars);
|
Line 517 inline int io_clrVars(array_t * __restrict vars);
|
*/ |
*/ |
inline void io_freeVars(array_t ** __restrict vars); |
inline void io_freeVars(array_t ** __restrict vars); |
/* |
/* |
* io_sortVars() - Sorting array with variables | * io_getVars() - Get ait_val_t element from array and if not exists allocate it |
* |
* |
* @vars = Variable array |
* @vars = Variable array |
* @order = Sort order. If =0 ascend ot !=0 descend | * @n = index of variable into array |
* @cmp = Compare function for sorting. If =NULL compare by key | * return: NULL error or !=NULL ait_val_t element |
| */ |
| inline ait_val_t *io_getVars(array_t ** __restrict vars, int n); |
| /* |
| * io_sortVarsByKey() - Sorting array with variables by key |
| * |
| * @vars = Variable array |
| * @order = Sort order. If =0 ascend or !=0 descend |
* return: none |
* return: none |
*/ |
*/ |
inline void io_sortVars(array_t * __restrict vars, int order, | inline void io_sortVarsByKey(array_t * __restrict vars, int order); |
| /* |
| * io_sortVarsByVal() - Sorting array with variables by value |
| * |
| * @vars = Variable array |
| * @order = Sort order. If =0 ascend or !=0 descend |
| * @cmp = Custom compare function for sorting. If =NULL compare by value |
| * return: none |
| */ |
| inline void io_sortVarsByVal(array_t * __restrict vars, int order, |
int (*cmp)(const void*, const void*)); |
int (*cmp)(const void*, const void*)); |
/* |
/* |
* io_findKeyVars() - Find variable by key from array |
* io_findKeyVars() - Find variable by key from array |
Line 445 int ioRegexGet(const char *csRegex, const char *csData
|
Line 600 int ioRegexGet(const char *csRegex, const char *csData
|
* @csRegex = Regulare expression pattern |
* @csRegex = Regulare expression pattern |
* @csData = Source data |
* @csData = Source data |
* @csNew = Data for replace |
* @csNew = Data for replace |
* return: NULL not match or error; !=NULL allocated new string, must be free after use! | * return: NULL not match or error; !=NULL allocated new string, must be io_free after use! |
*/ |
*/ |
char *ioRegexReplace(const char *csRegex, const char *csData, const char *csNew); |
char *ioRegexReplace(const char *csRegex, const char *csData, const char *csNew); |
|
|
Line 453 char *ioRegexReplace(const char *csRegex, const char *
|
Line 608 char *ioRegexReplace(const char *csRegex, const char *
|
* ioStrAst() - Function for evaluate string like asterisk variable "{text[:[-]#[:#]]}" |
* ioStrAst() - Function for evaluate string like asterisk variable "{text[:[-]#[:#]]}" |
* |
* |
* @csString = Input string |
* @csString = Input string |
* return: NULL error, !=NULL Allocated new string evaluated from input string, must be free() | * return: NULL error, !=NULL Allocated new string evaluated from input string, must be io_free() |
*/ |
*/ |
char *ioStrAst(const char *csString); |
char *ioStrAst(const char *csString); |
|
|
Line 490 inline int io_TrimStr(char * __restrict psLine);
|
Line 645 inline int io_TrimStr(char * __restrict psLine);
|
* |
* |
* @psLine = Text string |
* @psLine = Text string |
* @lineLen = Length of Text string |
* @lineLen = Length of Text string |
* return: NULL nothing to do or error; !=0 Allocated new converted data without term\0 (must be free) | * return: NULL nothing to do or error; !=0 Allocated new converted data without term\0 (must be io_free) |
*/ |
*/ |
inline unsigned char *io_Ch2Hex(unsigned char *psLine, int lineLen); |
inline unsigned char *io_Ch2Hex(unsigned char *psLine, int lineLen); |
/* |
/* |
Line 498 inline unsigned char *io_Ch2Hex(unsigned char *psLine,
|
Line 653 inline unsigned char *io_Ch2Hex(unsigned char *psLine,
|
* |
* |
* @psLine = Text string |
* @psLine = Text string |
* @lineLen = Length of Text string |
* @lineLen = Length of Text string |
* return: NULL nothing to do or error; !=0 Allocated new converted string(must be free) | * return: NULL nothing to do or error; !=0 Allocated new converted string(must be io_free) |
*/ |
*/ |
inline char *io_Hex2Ch(unsigned char *psLine, int lineLen); |
inline char *io_Hex2Ch(unsigned char *psLine, int lineLen); |
|
|
Line 557 inline char **io_arrayTo(array_t * __restrict arr);
|
Line 712 inline char **io_arrayTo(array_t * __restrict arr);
|
* io_arrayLen() - Get last used element in dynamic array (array Length) |
* io_arrayLen() - Get last used element in dynamic array (array Length) |
* |
* |
* @arr = Array |
* @arr = Array |
* return: -1 error, 0 empty or >0 position of last used element | * return: -1 empty or >-1 position of last used element |
*/ |
*/ |
inline int io_arrayLen(array_t * __restrict arr); |
inline int io_arrayLen(array_t * __restrict arr); |
/* |
/* |
Line 595 int io_arrayGrow(array_t * __restrict arr, int newNumI
|
Line 750 int io_arrayGrow(array_t * __restrict arr, int newNumI
|
int io_arrayVacuum(array_t * __restrict arr, int fromWhere); |
int io_arrayVacuum(array_t * __restrict arr, int fromWhere); |
|
|
#define io_arraySize(_arr) ((_arr) ? (_arr)->arr_num : 0) |
#define io_arraySize(_arr) ((_arr) ? (_arr)->arr_num : 0) |
|
#define io_arrayLast(_arr) (io_arraySize((_arr)) ? (_arr)->arr_last : -1) |
#define io_arrayZero(_arr) (assert((_arr)), memset((_arr)->arr_data, 0, \ |
#define io_arrayZero(_arr) (assert((_arr)), memset((_arr)->arr_data, 0, \ |
io_arraySize((_arr)) * sizeof(void*))) |
io_arraySize((_arr)) * sizeof(void*))) |
|
|
#define io_arrayGet(_arr, _d) (assert((_arr) && (_arr)->arr_num > _d), *((_arr)->arr_data + _d)) | #define io_arrayGet2(_arr, _d) (assert((_arr) && (_arr)->arr_num > _d), ((_arr)->arr_data + _d)) |
| #define io_arrayGet(_arr, _d) (assert((_arr) && (_arr)->arr_num > _d), (_arr)->arr_data[_d]) |
#define io_array(_arr, _d, _type) (assert((_arr) && (_arr)->arr_num > _d), \ |
#define io_array(_arr, _d, _type) (assert((_arr) && (_arr)->arr_num > _d), \ |
((_type) *((_arr)->arr_data + _d))) | ((_type) (_arr)->arr_data[_d])) |
#define io_arraySet(_arr, _d, _ptr) do { \ |
#define io_arraySet(_arr, _d, _ptr) do { \ |
assert((_arr) && (_arr)->arr_num > _d); \ |
assert((_arr) && (_arr)->arr_num > _d); \ |
*((_arr)->arr_data + _d) = (void*) (_ptr); \ | if ((_arr)->arr_last < _d) \ |
| (_arr)->arr_last = _d; \ |
| (_arr)->arr_data[_d] = (void*) (_ptr); \ |
} while (0) |
} while (0) |
#define io_arrayDel(_arr, _d, _fri) do { \ |
#define io_arrayDel(_arr, _d, _fri) do { \ |
assert((_arr) && (_arr)->arr_num > _d); \ |
assert((_arr) && (_arr)->arr_num > _d); \ |
if (_fri) \ | if (_fri && (_arr)->arr_data[_d]) \ |
free(*((_arr)->arr_data + _d)); \ | free((_arr)->arr_data[_d]); \ |
*((_arr)->arr_data + _d) = NULL; \ | (_arr)->arr_data[_d] = NULL; \ |
} while (0) |
} while (0) |
|
|
/* |
/* |
Line 626 inline void *io_arrayElem(array_t * __restrict arr, in
|
Line 785 inline void *io_arrayElem(array_t * __restrict arr, in
|
* |
* |
* @arr = Array |
* @arr = Array |
* @data = Element, if set NULL return only first empty position |
* @data = Element, if set NULL return only first empty position |
|
* @mayGrow = Array may to grow, if not enough room for new element |
* return: -1 not found empty position, array is full!, >-1 return position of stored element into array |
* return: -1 not found empty position, array is full!, >-1 return position of stored element into array |
*/ |
*/ |
inline int io_arrayPush(array_t * __restrict arr, void **data); | inline int io_arrayPush(array_t * __restrict arr, void **data, int mayGrow); |
/* |
/* |
* io_arrayPop() - Pop element from dynamic array like stack manner, last used position |
* io_arrayPop() - Pop element from dynamic array like stack manner, last used position |
* |
* |
Line 655 inline int io_argsNum(const char *csArgs, const char *
|
Line 815 inline int io_argsNum(const char *csArgs, const char *
|
* @psArgs = Input arguments line, after execute string is modified!!! |
* @psArgs = Input arguments line, after execute string is modified!!! |
* @nargs = Maximum requested count of arguments from input string psArgs, if 0 all psArgs |
* @nargs = Maximum requested count of arguments from input string psArgs, if 0 all psArgs |
* @csDelim = Delimiter(s) for separate |
* @csDelim = Delimiter(s) for separate |
* @parr = Output array of arguments ... (must be free with io_arrayDestroy() after use!) | * @parr = Output array of arguments ... (must be io_free with io_arrayDestroy() after use!) |
* return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items |
* return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items |
*/ |
*/ |
int io_arrayMake(char * __restrict psArgs, int nargs, const char *csDelim, |
int io_arrayMake(char * __restrict psArgs, int nargs, const char *csDelim, |
Line 674 int io_arrayMake(char * __restrict psArgs, int nargs,
|
Line 834 int io_arrayMake(char * __restrict psArgs, int nargs,
|
*/ |
*/ |
int io_MakeAV(const char * __restrict csArgs, const char *csDelim, |
int io_MakeAV(const char * __restrict csArgs, const char *csDelim, |
char * __restrict psAttr, int attrLen, char * __restrict psValue, int valLen); |
char * __restrict psAttr, int attrLen, char * __restrict psValue, int valLen); |
|
/* |
|
* io_MakeAV2() Parse and make attribute/value pair over input string |
|
* |
|
* @csArgs = Input argument line, will be modified! |
|
* @csDelim = Delimiter for separate |
|
* @psAttr = Output Attribute |
|
* @psValue = Output Value, if ==NULL this element not present value or not wanted for return |
|
* return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items |
|
*/ |
|
int io_MakeAV2(char * __restrict psArgs, const char *csDelim, |
|
char ** __restrict psAttr, char ** __restrict psValue); |
|
|
/* |
/* |
* io_sarrInit() - Create and initialize dynamic split-order array |
* io_sarrInit() - Create and initialize dynamic split-order array |
Line 765 sarr_t *io_array2sarr(array_t ** __restrict a, int seg
|
Line 936 sarr_t *io_array2sarr(array_t ** __restrict a, int seg
|
* io_CopyEnv() - Copy environment to new environment array; |
* io_CopyEnv() - Copy environment to new environment array; |
* |
* |
* @oldenv = Environment array |
* @oldenv = Environment array |
* return: NULL error; !=NULL Allocated new environment array(must be free) | * return: NULL error; !=NULL Allocated new environment array(must be io_free) |
*/ |
*/ |
char **io_CopyEnv(const char **oldenv); |
char **io_CopyEnv(const char **oldenv); |
/* |
/* |
Line 773 char **io_CopyEnv(const char **oldenv);
|
Line 944 char **io_CopyEnv(const char **oldenv);
|
* |
* |
* @psProg = Program name for execute |
* @psProg = Program name for execute |
* @oldarg = Arguments array |
* @oldarg = Arguments array |
* return: NULL error; !=NULL Allocated execution array(must be free) | * return: NULL error; !=NULL Allocated execution array(must be io_free) |
*/ |
*/ |
char **io_ExecArgs(const char *psProg, const char **oldarg); |
char **io_ExecArgs(const char *psProg, const char **oldarg); |
/* |
/* |
Line 890 extern int io_Debug;
|
Line 1061 extern int io_Debug;
|
* |
* |
* @pInput = input buffer |
* @pInput = input buffer |
* @inLen = input buffer len |
* @inLen = input buffer len |
* @ppOutput = output allocated buffe, must be free after use | * @ppOutput = output allocated buffe, must be io_free after use |
* @Cipher = cipher engine, like EVP_bf_cbc() or etc... |
* @Cipher = cipher engine, like EVP_bf_cbc() or etc... |
* @pKey = key |
* @pKey = key |
* @pIV = IV, salt (8 bytes) |
* @pIV = IV, salt (8 bytes) |
Line 905 int ioCipher(unsigned char *pInput, int inLen, unsigne
|
Line 1076 int ioCipher(unsigned char *pInput, int inLen, unsigne
|
* |
* |
* @pInput = input buffer |
* @pInput = input buffer |
* @inLen = input buffer len |
* @inLen = input buffer len |
* @ppOutput = output allocated buffe, must be free after use | * @ppOutput = output allocated buffe, must be io_free after use |
* @pKey = key |
* @pKey = key |
* @pIV = IV, salt (8 bytes) |
* @pIV = IV, salt (8 bytes) |
* @nMode = Mode 0 - decrypting or 1 - encrypting |
* @nMode = Mode 0 - decrypting or 1 - encrypting |
Line 918 int io_Blowfish(unsigned char *pInput, int inLen, unsi
|
Line 1089 int io_Blowfish(unsigned char *pInput, int inLen, unsi
|
* |
* |
* @pInput = Input buffer with ASCII |
* @pInput = Input buffer with ASCII |
* @inLen = Input buffer data length |
* @inLen = Input buffer data length |
* @ppOutput = Output buffer with cipher data, must be free after use | * @ppOutput = Output buffer with cipher data, must be io_free after use |
* @pKey = Key |
* @pKey = Key |
* @IV = IVector/Nonce/Counter, Warning: IV must be variable, because we write there!!! |
* @IV = IVector/Nonce/Counter, Warning: IV must be variable, because we write there!!! |
* return: -1 error or >-1 how many cipher blocks proceeded |
* return: -1 error or >-1 how many cipher blocks proceeded |