version 1.1.2.4, 2011/05/03 14:48:49
|
version 1.3.2.2, 2011/08/26 12:51:01
|
Line 1
|
Line 1
|
|
/************************************************************************* |
|
* (C) 2011 AITNET ltd - Sofia/Bulgaria - <misho@aitnet.org> |
|
* by Michael Pounov <misho@elwix.org> |
|
* |
|
* $Author$ |
|
* $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. |
|
*/ |
#include "global.h" |
#include "global.h" |
|
|
|
|
Line 45 io_sarrDestroy(sarr_t ** __restrict parr)
|
Line 90 io_sarrDestroy(sarr_t ** __restrict parr)
|
{ |
{ |
register int i; |
register int i; |
|
|
assert(parr); | assert(parr && *parr); |
if (!parr) | if (!parr || !*parr) |
return; |
return; |
|
|
for (i = 0; i < (*parr)->sarr_siz; i++) |
for (i = 0; i < (*parr)->sarr_siz; i++) |
Line 156 io_sarrGet(sarr_t * __restrict arr, u_int idx)
|
Line 201 io_sarrGet(sarr_t * __restrict arr, u_int idx)
|
} |
} |
|
|
/* |
/* |
|
* io_sarrGet2() - Always get element from dynamic split-order array |
|
* Function automatic grow array. Good use for Hash tables! |
|
* @arr = Array |
|
* @idx = Index (warning 1st element is at position 1) |
|
* return: NULL not found, !=NULL element |
|
*/ |
|
void * |
|
io_sarrGet2(sarr_t * __restrict arr, u_int idx) |
|
{ |
|
assert(arr); |
|
if (!arr || idx < 1) |
|
return NULL; |
|
if (arr->sarr_num < idx) |
|
if (io_sarrGrow(arr, idx)) |
|
return NULL; |
|
return io_sarrGet(arr, idx); |
|
} |
|
|
|
/* |
* io_sarrSet() - Set element to dynamic split-order array |
* io_sarrSet() - Set element to dynamic split-order array |
* @arr = Array |
* @arr = Array |
* @idx = Index (warning 1st element is at position 1) |
* @idx = Index (warning 1st element is at position 1) |
Line 189 io_sarrSet(sarr_t * __restrict arr, u_int idx, void *d
|
Line 253 io_sarrSet(sarr_t * __restrict arr, u_int idx, void *d
|
seg[pos] = data; |
seg[pos] = data; |
|
|
return ret; |
return ret; |
|
} |
|
|
|
/* |
|
* io_sarr2array() - Convert from split-order array to dynamic array |
|
* @sa = split array |
|
* @sarrFree = after convert split array !=0 will be destroyed sarray |
|
* return: NULL error or != NULL new array |
|
*/ |
|
array_t * |
|
io_sarr2array(sarr_t ** __restrict sa, int sarrFree) |
|
{ |
|
array_t *arr = NULL; |
|
int el; |
|
register int i; |
|
|
|
assert(sa && *sa); |
|
if (!sa || !*sa) |
|
return NULL; |
|
|
|
el = io_sarrSize(*sa); |
|
arr = io_arrayInit(el); |
|
if (!arr) |
|
return NULL; |
|
|
|
for (i = 0; i < el; i++) |
|
io_arraySet(arr, i, io_sarrGet(*sa, i + 1)); |
|
|
|
if (sarrFree) { |
|
free(*sa); |
|
*sa = NULL; |
|
} |
|
return arr; |
|
} |
|
|
|
/* |
|
* io_array2sarr() - Convert from dynamic array to split-order array |
|
* @a = array |
|
* @arrFree = after convert array !=0 will be destroyed |
|
* return: NULL error or != NULL new sarr |
|
*/ |
|
sarr_t * |
|
io_array2sarr(array_t ** __restrict a, int arrFree) |
|
{ |
|
return NULL; |
} |
} |