version 1.7.2.1, 2011/04/19 21:07:32
|
version 1.8.2.1, 2011/05/03 08:39:14
|
Line 1
|
Line 1
|
/************************************************************************* |
/************************************************************************* |
* (C) 2010 AITNET ltd - Sofia/Bulgaria - <misho@aitbg.com> | * (C) 2010 AITNET ltd - Sofia/Bulgaria - <misho@aitnet.org> |
* by Michael Pounov <misho@openbsd-bg.org> | * by Michael Pounov <misho@elwix.org> |
* |
* |
* $Author$ |
* $Author$ |
* $Id$ |
* $Id$ |
* |
* |
*************************************************************************/ | ************************************************************************** |
| The ELWIX and AITNET software is distributed under the following |
| terms: |
| |
| All of the documentation and software included in the ELWIX and AITNET |
| Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org> |
| |
| Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 |
| by Michael Pounov <misho@elwix.org>. All rights reserved. |
| |
| 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. All advertising materials mentioning features or use of this software |
| must display the following acknowledgement: |
| This product includes software developed by Michael Pounov <misho@elwix.org> |
| ELWIX - Embedded LightWeight unIX and its contributors. |
| 4. Neither the name of AITNET 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 AITNET 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 REGENTS 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 __AITIO_H |
#ifndef __AITIO_H |
#define __AITIO_H |
#define __AITIO_H |
|
|
Line 18
|
Line 55
|
#define VACUUM_BETWEEN 2 |
#define VACUUM_BETWEEN 2 |
|
|
|
|
|
typedef void ** sarr_seg_t; |
|
typedef struct _tagSplitArray { |
|
int sarr_num; |
|
int sarr_seg; |
|
int sarr_siz; |
|
sarr_seg_t *sarr_data; |
|
} sarr_t; |
|
|
typedef struct _tagArray { |
typedef struct _tagArray { |
int arr_num; |
int arr_num; |
void **arr_data; |
void **arr_data; |
Line 217 int io_arrayVacuum(array_t * __restrict arr, int fromW
|
Line 262 int io_arrayVacuum(array_t * __restrict arr, int fromW
|
} while (0) |
} while (0) |
|
|
/* |
/* |
|
* io_arrayPush() - Push element into dynamic array like stack manner, place at first empty position |
|
* @arr = Array |
|
* @data = Element, if set NULL return only first empty position |
|
* 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); |
|
/* |
|
* io_arrayPop() - Pop element from dynamic array like stack manner, last used position |
|
* @arr = Array |
|
* @data = Element, if set NULL return only first empty position |
|
* @delAfter = Delete after Pop element, !=0 delete element from array after return data |
|
* return: -1 not found used position, array is empty!, >-1 return element position |
|
*/ |
|
inline int io_arrayPop(array_t * __restrict arr, void ** __restrict data, int delAfter); |
|
|
|
/* |
* io_argsNum() Parse and calculate number of arguments |
* io_argsNum() Parse and calculate number of arguments |
* @csArgs = Input arguments line |
* @csArgs = Input arguments line |
* @csDelim = Delimiter(s) for separate |
* @csDelim = Delimiter(s) for separate |
Line 249 int io_arrayMake(char * __restrict psArgs, int nargs,
|
Line 310 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_sarrInit() - Create and initialize dynamic split-order array |
|
* @numItems = Number of Items |
|
* @segLen = Length of segment |
|
* return: NULL error, != NULL allocated memory for array |
|
*/ |
|
inline sarr_t *io_sarrInit(int numItems, int segLen); |
|
/* |
|
* io_sarrDestroy() - Free all data in dynamic split-order array and Destroy array |
|
* @parr = Array |
|
* return: none |
|
*/ |
|
inline void io_sarrDestroy(sarr_t ** __restrict parr); |
|
/* |
|
* io_sarrVacuum() - Vacuum dynamic split-order array, empty segments will be freed |
|
* @arr = Array |
|
* return: -1 error, >-1 freed segments |
|
*/ |
|
inline int io_sarrVacuum(sarr_t * __restrict arr); |
|
#define io_sarrSize(_arr) ((assert(_arr)), _arr->sarr_num) |
|
|
/* |
/* |
* ioURLGet() Parse and get data from input URL |
* ioURLGet() Parse and get data from input URL |
Line 390 int ioCipher(unsigned char *pInput, int inLen, unsigne
|
Line 471 int ioCipher(unsigned char *pInput, int inLen, unsigne
|
* @nMode = Mode 0 - decrypting or 1 - encrypting |
* @nMode = Mode 0 - decrypting or 1 - encrypting |
* return: 0 not present data or error!; >0 number of processed and returned bytes into ppOutput |
* return: 0 not present data or error!; >0 number of processed and returned bytes into ppOutput |
*/ |
*/ |
int io_Blowfish(u_char *pInput, int inLen, u_char **ppOutput, u_char *pKey, u_char *pIV, int nMode); | int io_Blowfish(unsigned char *pInput, int inLen, unsigned char **ppOutput, |
| unsigned char *pKey, unsigned char *pIV, int nMode); |
|
|
|
|
#endif |
#endif |