Annotation of libaitio/src/array.c, revision 1.3.2.2
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.3.2.2 ! misho 6: * $Id: array.c,v 1.3.2.1 2011/08/25 13:50:16 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.3 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.3 misho 72: memset(arr->arr_data, 0, io_arraySize(arr) * sizeof(void*));
1.2 misho 73:
74: return arr;
75: }
76:
77: /*
1.3 misho 78: * io_arrayFrom() - Create and fill array from array with pointers
1.3.2.1 misho 79: * @pargv = Array with pointers
1.3 misho 80: * @argc = Number of Items, if 0 walk through argv and stop when reach NULL item
1.3.2.1 misho 81: * return: NULL error, != NULL allocated new array
1.3 misho 82: */
83: inline array_t *
1.3.2.1 misho 84: io_arrayFrom(const char *** __restrict pargv, int argc)
1.3 misho 85: {
86: array_t *arr = NULL;
87: const char **a = NULL;
88: register int num = 0;
89:
1.3.2.1 misho 90: assert(pargv);
91: if (!pargv || !*pargv || argc < 0)
1.3 misho 92: return NULL;
93:
94: if (argc)
95: num = argc;
96: else
1.3.2.1 misho 97: for (a = *pargv; *a; a++, num++);
1.3 misho 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
1.3.2.1 misho 112: memcpy(arr->arr_data, *pargv, io_arraySize(arr) * sizeof(void*));
1.3 misho 113:
114: return arr;
115: }
116:
117: /*
118: * io_arrayTo() - Create and fill array with pointers from dynamic array
119: * @arr = Array
1.3.2.1 misho 120: * return: NULL error, != NULL allocated memory for array, NULL terminated
1.3 misho 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:
131: args = (char **) calloc(io_arraySize(arr) + 1, sizeof(char*));
132: if (!args) {
133: LOGERR;
134: return NULL;
135: } else
136: memcpy(args, arr->arr_data, io_arraySize(arr) * sizeof(char*));
137: args[io_arraySize(arr)] = NULL;
138:
139: return args;
140: }
141:
142: /*
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.3 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.3 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: {
1.3.2.2 ! misho 172: assert(parr && *parr);
! 173: if (!parr || !*parr)
1.2 misho 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.3 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.3 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.3 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.3 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++);
1.3.2.1 misho 274: if (i) {
275: memmove(arr->arr_data, arr->arr_data + i, (num - i) * sizeof(void*));
276: memset(arr->arr_data + (num - i), 0, i * sizeof(void*));
1.2 misho 277:
1.3.2.1 misho 278: num -= i;
279: cx += i;
280: }
1.2 misho 281: }
282: if (fromWhere & VACUUM_BETWEEN) {
283: for (i = 0; i < num; i++) {
284: if (arr->arr_data[i])
285: continue;
286:
287: for (j = i; j < num && !arr->arr_data[j]; j++);
288:
289: memmove(arr->arr_data + i, arr->arr_data + j, (num - j) * sizeof(void*));
290: memset(arr->arr_data + i + (num - j), 0, (j - i) * sizeof(void*));
291:
292: num -= j - i;
293: cx += j - i;
294: }
295: }
296:
297: return cx;
298: }
299:
300: /*
301: * io_arrayPush() - Push element into dynamic array like stack manner, place at first empty position
302: * @arr = Array
303: * @data = Element, if set NULL return only first empty position
304: * return: -1 not found empty position, array is full!, >-1 return position of stored element into array
305: */
306: inline int
307: io_arrayPush(array_t * __restrict arr, void **data)
308: {
309: register int i;
310: int ret = -1;
311:
312: assert(arr);
313:
1.3 misho 314: for (i = 0; i < io_arraySize(arr); i++)
1.2 misho 315: if (!arr->arr_data[i]) {
316: if (data)
317: arr->arr_data[i] = *data;
318: ret = i;
319: break;
320: }
321:
322: return ret;
323: }
324:
325: /*
326: * io_arrayPop() - Pop element from dynamic array like stack manner, last used position
327: * @arr = Array
1.3.2.1 misho 328: * @data = Element, if set NULL return only last used position
1.2 misho 329: * @delAfter = Delete after Pop element, !=0 delete element from array after return data
330: * return: -1 not found used position, array is empty!, >-1 return element position
331: */
332: inline int
333: io_arrayPop(array_t * __restrict arr, void ** __restrict data, int delAfter)
334: {
335: register int i;
336: int ret = -1;
337:
338: assert(arr);
339:
1.3 misho 340: for (i = io_arraySize(arr) - 1; i >= 0; i--)
1.2 misho 341: if (arr->arr_data[i]) {
342: if (data)
343: *data = arr->arr_data[i];
344: if (delAfter)
345: arr->arr_data[i] = NULL;
346: ret = i;
347: break;
348: }
349:
350: return ret;
351: }
352:
353: /*
1.3 misho 354: * io_arrayConcat() Concat source array to destination array
355: * @dest = Destination array
356: * @src = Source array
357: * return: -1 error; >0 new count of destination array
358: */
359: int
360: io_arrayConcat(array_t * __restrict dest, array_t * __restrict src)
361: {
362: int n;
363:
364: assert(dest);
365: assert(src);
366: if (!dest || !src)
367: return -1;
368:
369: n = io_arraySize(dest);
370: if (io_arrayGrow(dest, n + io_arraySize(src)))
371: return -1;
372: memcpy(dest->arr_data + n, src->arr_data, io_arraySize(src) * sizeof(void*));
373:
374: return io_arraySize(dest);
375: }
376:
377: /*
1.2 misho 378: * io_argsNum() Parse and calculate number of arguments
379: * @csArgs = Input arguments line
380: * @csDelim = Delimiter(s) for separate
381: * return: 0 error format; -1 error:: can`t read; >0 ok, number of items
382: */
383: inline int
384: io_argsNum(const char *csArgs, const char *csDelim)
385: {
386: register int res;
387: char *pos;
388:
389: assert(csArgs);
390: assert(csDelim);
391: if (!csArgs || !csDelim)
392: return -1;
393:
394: for (res = 1, pos = (char*) csArgs; (pos = strpbrk(pos, csDelim)); res++, pos++);
395: return res;
396: }
397:
398: /*
399: * io_arrayMake() Parse and make array from arguments ... (input string will be modified!!!
400: * and output array must be free with io_arrayDestroy() after use!)
401: * @psArgs = Input arguments line, after execute string is modified!!!
402: * @nargs = Maximum requested count of arguments from input string psArgs, if 0 all psArgs
403: * @csDelim = Delimiter(s) for separate
404: * @parr = Output array of arguments ... (must be free with io_arrayDestroy() after use!)
405: * return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items
406: */
407: int
408: io_arrayMake(char * __restrict psArgs, int nargs, const char *csDelim, array_t ** __restrict parr)
409: {
410: char **app;
411: register int i;
412:
413: assert(psArgs);
414: assert(csDelim);
415: assert(parr);
416: if (!psArgs || !csDelim || !parr)
417: return -1;
418:
419: if (nargs)
420: i = nargs;
421: else
422: i = io_argsNum(psArgs, csDelim);
423: *parr = io_arrayInit(i);
424: if (!*parr)
425: return -1;
426:
427: for (i = 0, app = (char**) (*parr)->arr_data;
428: app < (char**) (*parr)->arr_data + (*parr)->arr_num &&
429: (*app = strsep((char **) &psArgs, csDelim));
430: **app ? i++ : i, **app ? app++ : app);
431: return i;
432: }
433:
434: /*
435: * io_MakeAV() Parse and make attribute/value pair
436: * @csArgs = Input argument line
437: * @csDelim = Delimiter for separate
438: * @psAttr = Output Attribute
439: * @attrLen = Size of attribute array
440: * @psValue = Output Value, if ==NULL this element not present value or not wanted for return
441: * @valLen = Size of value array
442: * return: 0 error format; -1 error:: can`t read; >0 ok, number of readed items
443: */
444: int
445: io_MakeAV(const char * __restrict csArgs, const char *csDelim,
446: char * __restrict psAttr, int attrLen, char * __restrict psValue, int valLen)
447: {
448: register int ret = 0;
449: char *pos, *psBuf;
450:
451: if (!csArgs || !csDelim || !psAttr || !attrLen)
452: return -1;
453: if (psValue && !valLen)
454: return -1;
455: else
456: memset(psValue, 0, valLen);
457: psBuf = strdup(csArgs);
458: if (!psBuf) {
459: LOGERR;
460: return -1;
461: }
462:
463: pos = strpbrk(psBuf, csDelim);
464: if (pos)
465: *pos++ = 0;
466: ret++;
467: strlcpy(psAttr, psBuf, attrLen);
468:
469: if (pos && *pos) {
470: ret++;
471: if (psValue)
472: strlcpy(psValue, pos, valLen);
473: }
474:
475: free(psBuf);
476: return ret;
477: }
478:
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