1 | /*
|
---|
2 | * Copyright (c) 2015 Michal Koutny
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup libc
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /** @file
|
---|
33 | */
|
---|
34 |
|
---|
35 | #ifndef LIBC_DYN_ARRAY_H_
|
---|
36 | #define LIBC_DYN_ARRAY_H_
|
---|
37 |
|
---|
38 | #include <stdbool.h>
|
---|
39 | #include <stddef.h>
|
---|
40 |
|
---|
41 | typedef struct {
|
---|
42 | /** Data buffer of array */
|
---|
43 | uint8_t *_data;
|
---|
44 | /** Size on bytes of a single item */
|
---|
45 | size_t _item_size;
|
---|
46 |
|
---|
47 | /** Allocated space (in items) of the array */
|
---|
48 | size_t capacity;
|
---|
49 | /** No. of items in the array */
|
---|
50 | size_t size;
|
---|
51 | } dyn_array_t;
|
---|
52 |
|
---|
53 | /** Initialize dynamic array
|
---|
54 | *
|
---|
55 | * @param[in] capacity initial capacity of array
|
---|
56 | *
|
---|
57 | * @return void
|
---|
58 | */
|
---|
59 | #define dyn_array_initialize(dyn_array, type) \
|
---|
60 | _dyn_array_initialize((dyn_array), sizeof(type))
|
---|
61 |
|
---|
62 |
|
---|
63 | /** Dynamic array accessor
|
---|
64 | *
|
---|
65 | * @return lvalue for the given item
|
---|
66 | */
|
---|
67 | #define dyn_array_at(dyn_array, type, index) \
|
---|
68 | (*((type *) (dyn_array)->_data + index))
|
---|
69 |
|
---|
70 |
|
---|
71 | /** Access last element
|
---|
72 | *
|
---|
73 | * @return lvalue for the last item
|
---|
74 | */
|
---|
75 | #define dyn_array_last(dyn_array, type) \
|
---|
76 | (*((type *) (dyn_array)->_data + ((dyn_array)->size - 1)))
|
---|
77 |
|
---|
78 |
|
---|
79 | /** Insert item at given position, shift rest of array
|
---|
80 | *
|
---|
81 | * @return EOK on success
|
---|
82 | * @return ENOMEM on failure
|
---|
83 | */
|
---|
84 | #define dyn_array_insert(dyn_array, type, index, value) \
|
---|
85 | ({ \
|
---|
86 | size_t _index = (index); \
|
---|
87 | dyn_array_t *_da = (dyn_array); \
|
---|
88 | int rc = dyn_array_reserve(_da, _da->size + 1); \
|
---|
89 | if (!rc) { \
|
---|
90 | _dyn_array_shift(_da, _index, 1); \
|
---|
91 | dyn_array_at(_da, type, _index) = (value); \
|
---|
92 | } \
|
---|
93 | rc; \
|
---|
94 | })
|
---|
95 |
|
---|
96 | /** Insert item at the end of array
|
---|
97 | *
|
---|
98 | * @return EOK on success
|
---|
99 | * @return ENOMEM on failure
|
---|
100 | */
|
---|
101 | #define dyn_array_append(dyn_array, type, value) \
|
---|
102 | dyn_array_insert(dyn_array, type, (dyn_array)->size, (value))
|
---|
103 |
|
---|
104 |
|
---|
105 | /** Dynamic array iteration
|
---|
106 | *
|
---|
107 | * @param[in] dyn_array dyn_array_t (not pointer)
|
---|
108 | * @param[in] it name of variable used as iterator, it's pointer
|
---|
109 | * to @p type
|
---|
110 | */
|
---|
111 | #define dyn_array_foreach(dyn_array, type, it) \
|
---|
112 | for (type *it = NULL; it == NULL; it = (type *)1) \
|
---|
113 | for (type *_it = (type *)(dyn_array)._data; \
|
---|
114 | it = _it, _it != ((type *)(dyn_array)._data + (dyn_array).size); \
|
---|
115 | ++_it)
|
---|
116 |
|
---|
117 | /** Find first occurence of value
|
---|
118 | *
|
---|
119 | * @param[in] dyn_array dyn_array_t *
|
---|
120 | * @param[in] value value to search for
|
---|
121 | *
|
---|
122 | * @return index of found value or size of array when no found
|
---|
123 | */
|
---|
124 | #define dyn_array_find(dyn_array, type, value) \
|
---|
125 | ({ \
|
---|
126 | size_t _result = (dyn_array)->size; \
|
---|
127 | dyn_array_foreach(*(dyn_array), type, _it) { \
|
---|
128 | if (*_it == value) { \
|
---|
129 | _result = _it - (type *)(dyn_array)->_data; \
|
---|
130 | break; \
|
---|
131 | } \
|
---|
132 | } \
|
---|
133 | _result; \
|
---|
134 | })
|
---|
135 |
|
---|
136 | extern void dyn_array_destroy(dyn_array_t *);
|
---|
137 | extern void dyn_array_remove(dyn_array_t *, size_t);
|
---|
138 | void dyn_array_clear(dyn_array_t *);
|
---|
139 | void dyn_array_clear_range(dyn_array_t *, size_t, size_t);
|
---|
140 | extern int dyn_array_concat(dyn_array_t *, dyn_array_t *);
|
---|
141 | extern int dyn_array_reserve(dyn_array_t *, size_t);
|
---|
142 |
|
---|
143 | extern void _dyn_array_initialize(dyn_array_t *, size_t);
|
---|
144 | extern void _dyn_array_shift(dyn_array_t *, size_t, size_t);
|
---|
145 | extern void _dyn_array_unshift(dyn_array_t *, size_t, size_t);
|
---|
146 |
|
---|
147 | #endif
|
---|
148 |
|
---|
149 | /** @}
|
---|
150 | */
|
---|