Annotation of libaitio/src/array.c, revision 1.2.4.4
1.2 misho 1: /*************************************************************************
2: * (C) 2011 AITNET ltd - Sofia/Bulgaria - <misho@aitnet.org>
3: * by Michael Pounov <misho@elwix.org>
4: *
5: * $Author: misho $
1.2.4.4 ! misho 6: * $Id: array.c,v 1.2.4.3 2011/05/19 03:18:36 misho Exp $
1.2 misho 7: *
8: **************************************************************************
9: The ELWIX and AITNET software is distributed under the following
10: terms:
11:
12: All of the documentation and software included in the ELWIX and AITNET
13: Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>
14:
15: Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
16: by Michael Pounov <misho@elwix.org>. All rights reserved.
17:
18: Redistribution and use in source and binary forms, with or without
19: modification, are permitted provided that the following conditions
20: are met:
21: 1. Redistributions of source code must retain the above copyright
22: notice, this list of conditions and the following disclaimer.
23: 2. Redistributions in binary form must reproduce the above copyright
24: notice, this list of conditions and the following disclaimer in the
25: documentation and/or other materials provided with the distribution.
26: 3. All advertising materials mentioning features or use of this software
27: must display the following acknowledgement:
28: This product includes software developed by Michael Pounov <misho@elwix.org>
29: ELWIX - Embedded LightWeight unIX and its contributors.
30: 4. Neither the name of AITNET nor the names of its contributors
31: may be used to endorse or promote products derived from this software
32: without specific prior written permission.
33:
34: THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND
35: ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
36: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
37: ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
38: FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
39: DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
40: OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
41: HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
42: LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
43: OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44: SUCH DAMAGE.
45: */
46: #include "global.h"
47:
48:
49: /*
50: * io_arrayInit() - Create and initialize dynamic array
51: * @numItems = Number of Items
52: * return: NULL error, != NULL allocated memory for array
53: */
54: inline array_t *
55: io_arrayInit(int numItems)
56: {
57: array_t *arr = NULL;
58:
59: arr = malloc(sizeof(array_t));
60: if (!arr) {
61: LOGERR;
62: return NULL;
63: }
64:
65: arr->arr_num = numItems;
1.2.4.2 misho 66: arr->arr_data = calloc(io_arraySize(arr), sizeof(void*));
1.2 misho 67: if (!arr->arr_data) {
68: LOGERR;
69: free(arr);
70: return NULL;
71: } else
1.2.4.2 misho 72: memset(arr->arr_data, 0, io_arraySize(arr) * sizeof(void*));
1.2 misho 73:
74: return arr;
75: }
76:
77: /*
1.2.4.2 misho 78: * io_arrayFrom() - Create and fill array from array with pointers
79: * @argv = Array with pointers
80: * @argc = Number of Items, if 0 walk through argv and stop when reach NULL item
81: * return: NULL error, != NULL allocated memory for array
82: */
83: inline array_t *
84: io_arrayFrom(const char **argv, int argc)
85: {
86: array_t *arr = NULL;
87: const char **a = NULL;
88: register int num = 0;
89:
90: assert(argv);
91: if (!argv || !*argv || argc < 0)
92: return NULL;
93:
94: if (argc)
95: num = argc;
96: else
97: for (a = argv; *a; a++, num++);
98:
99: arr = malloc(sizeof(array_t));
100: if (!arr) {
101: LOGERR;
102: return NULL;
103: }
104:
105: arr->arr_num = num;
106: arr->arr_data = calloc(io_arraySize(arr), sizeof(void*));
107: if (!arr->arr_data) {
108: LOGERR;
109: free(arr);
110: return NULL;
111: } else
112: memcpy(arr->arr_data, argv, io_arraySize(arr) * sizeof(void*));
113:
114: return arr;
115: }
116:
117: /*
118: * io_arrayTo() - Create and fill array with pointers from dynamic array
119: * @arr = Array
120: * return: NULL error, != NULL allocated memory for array
121: */
122: inline char **
123: io_arrayTo(array_t * __restrict arr)
124: {
125: char **args = NULL;
126:
127: assert(arr);
128: if (!arr || !io_arraySize(arr))
129: return NULL;
130:
1.2.4.3 misho 131: args = (char **) calloc(io_arraySize(arr) + 1, sizeof(char*));
1.2.4.2 misho 132: if (!args) {
133: LOGERR;
134: return NULL;
135: } else
136: memcpy(args, arr->arr_data, io_arraySize(arr) * sizeof(char*));
1.2.4.3 misho 137: args[io_arraySize(arr)] = NULL;
1.2.4.2 misho 138:
139: return args;
140: }
141:
142: /*
1.2.4.1 misho 143: * io_arrayFree() - Free all data in dynamic array items
1.2 misho 144: * (WARNING! If assign static array dont use this!!!)
145: * @arr = Array
146: * return: none
147: */
148: inline void
149: io_arrayFree(array_t * __restrict arr)
150: {
151: register int i;
152:
153: assert(arr);
154: if (!arr)
155: return;
156:
1.2.4.2 misho 157: for (i = 0; i < io_arraySize(arr); i++)
1.2 misho 158: if (arr->arr_data[i]) {
159: free(arr->arr_data[i]);
160: arr->arr_data[i] = NULL;
161: }
162: }
163:
164: /*
1.2.4.1 misho 165: * io_arrayDestroy() - Free and destroy dynamic array
1.2 misho 166: * @parr = Array
167: * return: none
168: */
169: inline void
170: io_arrayDestroy(array_t ** __restrict parr)
171: {
172: assert(parr);
173: if (!parr)
174: return;
175:
176: if ((*parr)->arr_data)
177: free((*parr)->arr_data);
178: free(*parr);
179: *parr = NULL;
180: }
181:
182: /*
183: * io_arrayLen() - Get last used element in dynamic array (array Length)
184: * @arr = Array
185: * return: -1 error, 0 empty or >0 position of last used element
186: */
187: inline int
188: io_arrayLen(array_t * __restrict arr)
189: {
190: register int i;
191:
192: assert(arr);
193: if (!arr)
194: return -1;
195:
1.2.4.2 misho 196: for (i = io_arraySize(arr); i && !arr->arr_data[i - 1]; i--);
1.2 misho 197:
198: return i;
199: }
200:
201: /*
202: * io_arrayGrow() - Grow/Shrink dynamic array, Use with care when it shrink!!!
203: * @arr = Array
204: * @newNumItems = Number of Items
205: * return: -1 error, 0 ok
206: */
207: int
208: io_arrayGrow(array_t * __restrict arr, int newNumItems)
209: {
210: void **data;
211: int n = 0;
212: /* register int i; */
213:
214: assert(arr);
215: if (!arr)
216: return -1;
217:
218: if (arr->arr_num == newNumItems)
219: return 0;
1.2.4.2 misho 220: if (io_arraySize(arr) < newNumItems) {
221: n = newNumItems - io_arraySize(arr);
1.2 misho 222: } /* else
223: for (i = newNumItems; i < arr->arr_num; i++)
224: if (arr->arr_data[i])
225: free(arr->arr_data[i]);
226: */
227:
228: arr->arr_num = newNumItems;
1.2.4.4 ! misho 229: if (io_arraySize(arr)) {
! 230: data = realloc(arr->arr_data, io_arraySize(arr) * sizeof(void*));
! 231: if (!data) {
! 232: LOGERR;
! 233: return -1;
! 234: } else
! 235: arr->arr_data = data;
! 236:
! 237: memset(arr->arr_data + (io_arraySize(arr) - n), 0, n * sizeof(void*));
! 238: } else {
! 239: if (arr->arr_data)
! 240: free(arr->arr_data);
! 241: arr->arr_data = NULL;
! 242: }
1.2 misho 243:
244: return 0;
245: }
246:
247: /*
248: * io_arrayVacuum() - Vacuum dynamic array, empty elements will be deleted
249: * @arr = Array
250: * @fromWhere = 1 begin, 2 ALL empty elements
251: * return: -1 error, 0 ok
252: */
253: int
254: io_arrayVacuum(array_t * __restrict arr, int fromWhere)
255: {
256: register int i, j, num;
257: int cx = 0;
258:
259: assert(arr);
260: if (!arr)
261: return -1;
262: else
263: fromWhere &= 0x7;
264:
1.2.4.2 misho 265: num = io_arraySize(arr);
1.2 misho 266: /*
267: if (fromWhere & VACUUM_RIGHT) {
268: for (cx = 0, i = num - 1; i && !arr->arr_data[i]; i--, cx++);
269: num -= cx;
270: }
271: */
272: if (fromWhere & VACUUM_LEFT) {
273: for (i = 0; i < num && !arr->arr_data[i]; i++);
274:
275: memmove(arr->arr_data, arr->arr_data + i, (num - i) * sizeof(void*));
276: memset(arr->arr_data + (num - i), 0, i * sizeof(void*));
277:
278: num -= i;
279: cx += i;
280: }
281: if (fromWhere & VACUUM_BETWEEN) {
282: for (i = 0; i < num; i++) {
283: if (arr->arr_data[i])
284: continue;
285:
286: for (j = i; j < num && !arr->arr_data[j]; j++);
287:
288: memmove(arr->arr_data + i, arr->arr_data + j, (num - j) * sizeof(void*));
289: memset(arr->arr_data + i + (num - j), 0, (j - i) * sizeof(void*));
290:
291: num -= j - i;
292: cx += j - i;
293: }
294: }
295:
296: return cx;
297: }
298:
299: /*
300: * io_arrayPush() - Push element into dynamic array like stack manner, place at first empty position
301: * @arr = Array
302: * @data = Element, if set NULL return only first empty position
303: * return: -1 not found empty position, array is full!, >-1 return position of stored element into array
304: */
305: inline int
306: io_arrayPush(array_t * __restrict arr, void **data)
307: {
308: register int i;
309: int ret = -1;
310:
311: assert(arr);
312:
1.2.4.2 misho 313: for (i = 0; i < io_arraySize(arr); i++)
1.2 misho 314: if (!arr->arr_data[i]) {
315: if (data)
316: arr->arr_data[i] = *data;
317: ret = i;
318: break;
319: }
320:
321: return ret;
322: }
323:
324: /*
325: * io_arrayPop() - Pop element from dynamic array like stack manner, last used position
326: * @arr = Array
327: * @data = Element, if set NULL return only first empty position
328: * @delAfter = Delete after Pop element, !=0 delete element from array after return data
329: * return: -1 not found used position, array is empty!, >-1 return element position
330: */
331: inline int
332: io_arrayPop(array_t * __restrict arr, void ** __restrict data, int delAfter)
333: {
334: register int i;
335: int ret = -1;
336:
337: assert(arr);
338:
1.2.4.2 misho 339: for (i = io_arraySize(arr) - 1; i >= 0; i--)
1.2 misho 340: if (arr->arr_data[i]) {
341: if (data)
342: *data = arr->arr_data[i];
343: if (delAfter)
344: arr->arr_data[i] = NULL;
345: ret = i;
346: break;
347: }
348:
349: return ret;
350: }
351:
352: /*
1.2.4.1 misho 353: * io_arrayConcat() Concat source array to destination array
354: * @dest = Destination array
355: * @src = Source array
356: * return: -1 error; >0 new count of destination array
357: */
358: int
359: io_arrayConcat(array_t * __restrict dest, array_t * __restrict src)
360: {
361: int n;
362:
363: assert(dest);
364: assert(src);
365: if (!dest || !src)
366: return -1;
367:
1.2.4.2 misho 368: n = io_arraySize(dest);
369: if (io_arrayGrow(dest, n + io_arraySize(src)))
1.2.4.1 misho 370: return -1;
1.2.4.2 misho 371: memcpy(dest->arr_data + n, src->arr_data, io_arraySize(src) * sizeof(void*));
1.2.4.1 misho 372:
373: return io_arraySize(dest);
374: }
375:
376: /*
1.2 misho 377: * io_argsNum() Parse and calculate number of arguments
378: * @csArgs = Input arguments line
379: * @csDelim = Delimiter(s) for separate
380: * return: 0 error format; -1 error:: can`t read; >0 ok, number of items
381: */
382: inline int
383: io_argsNum(const char *csArgs, const char *csDelim)
384: {
385: register int res;
386: char *pos;
387:
388: assert(csArgs);
389: assert(csDelim);
390: if (!csArgs || !csDelim)
391: return -1;
392:
393: for (res = 1, pos = (char*) csArgs; (pos = strpbrk(pos, csDelim)); res++, pos++);
394: return res;
395: }
396:
397: /*
398: * io_arrayMake() Parse and make array from arguments ... (input string will be modified!!!
399: * and output array must be free with io_arrayDestroy() after use!)
400: * @psArgs = Input arguments line, after execute string is modified!!!
401: * @nargs = Maximum requested count of arguments from input string psArgs, if 0 all psArgs
402: * @csDelim = Delimiter(s) for separate
403: * @parr = Output array of arguments ... (must be free with io_arrayDestroy() after use!)
404: * return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items
405: */
406: int
407: io_arrayMake(char * __restrict psArgs, int nargs, const char *csDelim, array_t ** __restrict parr)
408: {
409: char **app;
410: register int i;
411:
412: assert(psArgs);
413: assert(csDelim);
414: assert(parr);
415: if (!psArgs || !csDelim || !parr)
416: return -1;
417:
418: if (nargs)
419: i = nargs;
420: else
421: i = io_argsNum(psArgs, csDelim);
422: *parr = io_arrayInit(i);
423: if (!*parr)
424: return -1;
425:
426: for (i = 0, app = (char**) (*parr)->arr_data;
427: app < (char**) (*parr)->arr_data + (*parr)->arr_num &&
428: (*app = strsep((char **) &psArgs, csDelim));
429: **app ? i++ : i, **app ? app++ : app);
430: return i;
431: }
432:
433: /*
434: * io_MakeAV() Parse and make attribute/value pair
435: * @csArgs = Input argument line
436: * @csDelim = Delimiter for separate
437: * @psAttr = Output Attribute
438: * @attrLen = Size of attribute array
439: * @psValue = Output Value, if ==NULL this element not present value or not wanted for return
440: * @valLen = Size of value array
441: * return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items
442: */
443: int
444: io_MakeAV(const char * __restrict csArgs, const char *csDelim,
445: char * __restrict psAttr, int attrLen, char * __restrict psValue, int valLen)
446: {
447: register int ret = 0;
448: char *pos, *psBuf;
449:
450: if (!csArgs || !csDelim || !psAttr || !attrLen)
451: return -1;
452: if (psValue && !valLen)
453: return -1;
454: else
455: memset(psValue, 0, valLen);
456: psBuf = strdup(csArgs);
457: if (!psBuf) {
458: LOGERR;
459: return -1;
460: }
461:
462: pos = strpbrk(psBuf, csDelim);
463: if (pos)
464: *pos++ = 0;
465: ret++;
466: strlcpy(psAttr, psBuf, attrLen);
467:
468: if (pos && *pos) {
469: ret++;
470: if (psValue)
471: strlcpy(psValue, pos, valLen);
472: }
473:
474: free(psBuf);
475: return ret;
476: }
477:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to array.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [ELWIX - Embedded LightWeight unIX -] / libaitio / src