--- libaitio/src/Attic/array.c 2011/04/19 21:07:32 1.1 +++ libaitio/src/Attic/array.c 2011/04/20 22:56:32 1.2 @@ -0,0 +1,381 @@ +/************************************************************************* +* (C) 2011 AITNET ltd - Sofia/Bulgaria - +* by Michael Pounov +* +* $Author: misho $ +* $Id: array.c,v 1.2 2011/04/20 22:56:32 misho Exp $ +* +************************************************************************** +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 + +Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 + by Michael Pounov . 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 +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. +*/ +#include "global.h" + + +/* + * io_arrayInit() - Create and initialize dynamic array + * @numItems = Number of Items + * return: NULL error, != NULL allocated memory for array + */ +inline array_t * +io_arrayInit(int numItems) +{ + array_t *arr = NULL; + + arr = malloc(sizeof(array_t)); + if (!arr) { + LOGERR; + return NULL; + } + + arr->arr_num = numItems; + arr->arr_data = calloc(arr->arr_num, sizeof(void*)); + if (!arr->arr_data) { + LOGERR; + free(arr); + return NULL; + } else + memset(arr->arr_data, 0, arr->arr_num * sizeof(void*)); + + return arr; +} + +/* + * io_arrayFree() - Free all data in dynamic array + * (WARNING! If assign static array dont use this!!!) + * @arr = Array + * return: none + */ +inline void +io_arrayFree(array_t * __restrict arr) +{ + register int i; + + assert(arr); + if (!arr) + return; + + for (i = 0; i < arr->arr_num; i++) + if (arr->arr_data[i]) { + free(arr->arr_data[i]); + arr->arr_data[i] = NULL; + } +} + +/* + * io_arrayDestroy() - Free all data in dynamic array and Destroy dynamic array + * @parr = Array + * return: none + */ +inline void +io_arrayDestroy(array_t ** __restrict parr) +{ + assert(parr); + if (!parr) + return; + + if ((*parr)->arr_data) + free((*parr)->arr_data); + free(*parr); + *parr = NULL; +} + +/* + * io_arrayLen() - Get last used element in dynamic array (array Length) + * @arr = Array + * return: -1 error, 0 empty or >0 position of last used element + */ +inline int +io_arrayLen(array_t * __restrict arr) +{ + register int i; + + assert(arr); + if (!arr) + return -1; + + for (i = arr->arr_num; i && !arr->arr_data[i - 1]; i--); + + return i; +} + +/* + * io_arrayGrow() - Grow/Shrink dynamic array, Use with care when it shrink!!! + * @arr = Array + * @newNumItems = Number of Items + * return: -1 error, 0 ok + */ +int +io_arrayGrow(array_t * __restrict arr, int newNumItems) +{ + void **data; + int n = 0; +/* register int i; */ + + assert(arr); + if (!arr) + return -1; + + if (arr->arr_num == newNumItems) + return 0; + if (arr->arr_num < newNumItems) { + n = newNumItems - arr->arr_num; + } /* else + for (i = newNumItems; i < arr->arr_num; i++) + if (arr->arr_data[i]) + free(arr->arr_data[i]); + */ + + arr->arr_num = newNumItems; + data = realloc(arr->arr_data, arr->arr_num * sizeof(void*)); + if (!data) { + LOGERR; + return -1; + } else + arr->arr_data = data; + memset(arr->arr_data + (arr->arr_num - n), 0, n * sizeof(void*)); + + return 0; +} + +/* + * io_arrayVacuum() - Vacuum dynamic array, empty elements will be deleted + * @arr = Array + * @fromWhere = 1 begin, 2 ALL empty elements + * return: -1 error, 0 ok + */ +int +io_arrayVacuum(array_t * __restrict arr, int fromWhere) +{ + register int i, j, num; + int cx = 0; + + assert(arr); + if (!arr) + return -1; + else + fromWhere &= 0x7; + + num = arr->arr_num; + /* + if (fromWhere & VACUUM_RIGHT) { + for (cx = 0, i = num - 1; i && !arr->arr_data[i]; i--, cx++); + num -= cx; + } + */ + if (fromWhere & VACUUM_LEFT) { + for (i = 0; i < num && !arr->arr_data[i]; i++); + + memmove(arr->arr_data, arr->arr_data + i, (num - i) * sizeof(void*)); + memset(arr->arr_data + (num - i), 0, i * sizeof(void*)); + + num -= i; + cx += i; + } + if (fromWhere & VACUUM_BETWEEN) { + for (i = 0; i < num; i++) { + if (arr->arr_data[i]) + continue; + + for (j = i; j < num && !arr->arr_data[j]; j++); + + memmove(arr->arr_data + i, arr->arr_data + j, (num - j) * sizeof(void*)); + memset(arr->arr_data + i + (num - j), 0, (j - i) * sizeof(void*)); + + num -= j - i; + cx += j - i; + } + } + + return cx; +} + +/* + * 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) +{ + register int i; + int ret = -1; + + assert(arr); + + for (i = 0; i < arr->arr_num; i++) + if (!arr->arr_data[i]) { + if (data) + arr->arr_data[i] = *data; + ret = i; + break; + } + + return ret; +} + +/* + * 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) +{ + register int i; + int ret = -1; + + assert(arr); + + for (i = arr->arr_num - 1; i >= 0; i--) + if (arr->arr_data[i]) { + if (data) + *data = arr->arr_data[i]; + if (delAfter) + arr->arr_data[i] = NULL; + ret = i; + break; + } + + return ret; +} + +/* + * io_argsNum() Parse and calculate number of arguments + * @csArgs = Input arguments line + * @csDelim = Delimiter(s) for separate + * return: 0 error format; -1 error:: can`t read; >0 ok, number of items + */ +inline int +io_argsNum(const char *csArgs, const char *csDelim) +{ + register int res; + char *pos; + + assert(csArgs); + assert(csDelim); + if (!csArgs || !csDelim) + return -1; + + for (res = 1, pos = (char*) csArgs; (pos = strpbrk(pos, csDelim)); res++, pos++); + return res; +} + +/* + * io_arrayMake() Parse and make array from arguments ... (input string will be modified!!! + * and output array must be free with io_arrayDestroy() after use!) + * @psArgs = Input arguments line, after execute string is modified!!! + * @nargs = Maximum requested count of arguments from input string psArgs, if 0 all psArgs + * @csDelim = Delimiter(s) for separate + * @parr = Output array of arguments ... (must be free with io_arrayDestroy() after use!) + * 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, array_t ** __restrict parr) +{ + char **app; + register int i; + + assert(psArgs); + assert(csDelim); + assert(parr); + if (!psArgs || !csDelim || !parr) + return -1; + + if (nargs) + i = nargs; + else + i = io_argsNum(psArgs, csDelim); + *parr = io_arrayInit(i); + if (!*parr) + return -1; + + for (i = 0, app = (char**) (*parr)->arr_data; + app < (char**) (*parr)->arr_data + (*parr)->arr_num && + (*app = strsep((char **) &psArgs, csDelim)); + **app ? i++ : i, **app ? app++ : app); + return i; +} + +/* + * io_MakeAV() Parse and make attribute/value pair + * @csArgs = Input argument line + * @csDelim = Delimiter for separate + * @psAttr = Output Attribute + * @attrLen = Size of attribute array + * @psValue = Output Value, if ==NULL this element not present value or not wanted for return + * @valLen = Size of value array + * return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items +*/ +int +io_MakeAV(const char * __restrict csArgs, const char *csDelim, + char * __restrict psAttr, int attrLen, char * __restrict psValue, int valLen) +{ + register int ret = 0; + char *pos, *psBuf; + + if (!csArgs || !csDelim || !psAttr || !attrLen) + return -1; + if (psValue && !valLen) + return -1; + else + memset(psValue, 0, valLen); + psBuf = strdup(csArgs); + if (!psBuf) { + LOGERR; + return -1; + } + + pos = strpbrk(psBuf, csDelim); + if (pos) + *pos++ = 0; + ret++; + strlcpy(psAttr, psBuf, attrLen); + + if (pos && *pos) { + ret++; + if (psValue) + strlcpy(psValue, pos, valLen); + } + + free(psBuf); + return ret; +} +