1 /*******************************************************************************
2 Copyright (c) 2016, Michael Wallner <mike@php.net>.
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
8 * Redistributions of source code must retain the above copyright notice,
9 this list of conditions and the following disclaimer.
10 * Redistributions in binary form must reproduce the above copyright
11 notice, this list of conditions and the following disclaimer in the
12 documentation and/or other materials provided with the distribution.
14 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
15 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
17 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
18 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
20 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
21 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
22 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 *******************************************************************************/
26 #include "php_psi_stdinc.h"
37 #define PLIST_ELE(l, i) (((char *)(l)->list) + (l)->size * (i))
38 #define PLIST_CPY(list, dest, src) do { \
39 if (list->size == sizeof(void *)) { \
40 *(void **)(dest) = *(void **)(src); \
42 memcpy(dest, src, list->size); \
45 #define PLIST_CPY_R(list, dest, src, num) memcpy((dest), (src), (num) * (list)->size)
46 /* !!! adjust list->count prior reduction */
47 #define PLIST_MOV_REDUCE(l, i) PLIST_MOV_REDUCE_EX(l, i, 1)
48 #define PLIST_MOV_REDUCE_EX(l, i, n) memmove(PLIST_ELE(l, i), PLIST_ELE(l, (i) + (n)), (l)->size * ((l)->count - (i)))
49 /* !!! adjust list->count after expansion */
50 #define PLIST_MOV_EXPAND(l, i) PLIST_MOV_EXPAND_EX(l, i, 1)
51 #define PLIST_MOV_EXPAND_EX(l, i, n) memmove(PLIST_ELE(l, (i) + (n)), PLIST_ELE(l, i), (l)->size * ((l)->count - (i)))
53 struct psi_plist
*psi_plist_init(void (*dtor
)(void *)) {
54 return psi_plist_init_ex(0, dtor
);
56 struct psi_plist
*psi_plist_init_ex(size_t size
, void (*dtor
)(void *)) {
57 struct psi_plist
*list
;
63 list
= pecalloc(1, sizeof(*list
) + size
, 1);
70 void psi_plist_clean(struct psi_plist
*list
) {
74 if (list
->dtor
) for (i
= 0; i
< list
->count
; ++i
) {
75 list
->dtor(PLIST_ELE(list
, i
));
81 void psi_plist_free(struct psi_plist
*list
) {
83 psi_plist_clean(list
);
88 struct psi_plist
*psi_plist_copy(struct psi_plist
*list
, void (*ctor
)(void *))
91 struct psi_plist
*copy
= pecalloc(1, sizeof(*list
) + list
->size
+ list
->count
* list
->size
, 1);
95 memcpy(copy
->list
, list
->list
, list
->size
* list
->count
);
98 for (i
= 0; i
< list
->count
; ++i
) {
99 void *ptr
= PLIST_ELE(copy
, i
);
106 size_t psi_plist_count(struct psi_plist
*list
) {
107 return list
? list
->count
: 0;
110 void **psi_plist_eles(struct psi_plist
*list
) {
111 return list
? list
->list
: NULL
;
114 struct psi_plist
*psi_plist_add(struct psi_plist
*list
, void *ptr
) {
115 if (list
&& list
->count
) {
116 list
= safe_perealloc(list
, list
->count
+ 1, list
->size
, sizeof(*list
), 1);
119 PLIST_CPY(list
, PLIST_ELE(list
, list
->count
++), ptr
);
124 struct psi_plist
*psi_plist_add_r(struct psi_plist
*list
, size_t num_eles
, void **eles
) {
126 list
= safe_perealloc(list
, list
->count
+ num_eles
+ 1, list
->size
, sizeof(*list
), 1);
129 memcpy(PLIST_ELE(list
, list
->count
), eles
, num_eles
* list
->size
);
130 list
->count
+= num_eles
;
135 bool psi_plist_get(struct psi_plist
*list
, size_t index
, void *ptr
) {
136 if (list
&& list
->count
> index
) {
137 PLIST_CPY(list
, ptr
, PLIST_ELE(list
, index
));
143 bool psi_plist_unset(struct psi_plist
*list
, size_t index
) {
144 if (list
&& list
->count
> index
) {
145 memset(PLIST_ELE(list
, index
), 0, list
->size
);
151 bool psi_plist_del(struct psi_plist
*list
, size_t index
, void *ptr
) {
152 if (list
&& list
->count
> index
) {
154 PLIST_CPY(list
, ptr
, PLIST_ELE(list
, index
));
156 if (--list
->count
> index
) {
157 PLIST_MOV_REDUCE(list
, index
);
164 bool psi_plist_del_r(struct psi_plist
*list
, size_t offset_start
, size_t num_eles
, void **eles
) {
166 size_t offset_end
= offset_start
+ num_eles
- 1;
168 if (list
->count
<= offset_end
) {
169 offset_end
= list
->count
- 1;
171 if (offset_end
>= offset_start
) {
172 num_eles
= 1 + offset_end
- offset_start
;
175 memcpy(eles
, PLIST_ELE(list
, offset_start
), num_eles
* list
->size
);
177 assert(list
->count
>= num_eles
);
178 if ((list
->count
-= num_eles
)) {
179 PLIST_MOV_REDUCE_EX(list
, offset_start
, num_eles
);
187 struct psi_plist
*psi_plist_ins(struct psi_plist
*list
, size_t index
, void *ptr
) {
191 new_count
= MAX(list
->count
+ 1, index
);
193 list
= safe_perealloc(list
, new_count
+ 1, list
->size
, sizeof(*list
), 1);
196 PLIST_MOV_EXPAND(list
, index
);
197 PLIST_CPY(list
, PLIST_ELE(list
, index
), ptr
);
198 list
->count
= new_count
;
204 struct psi_plist
*psi_plist_ins_r(struct psi_plist
*list
, size_t offset_start
, size_t num_eles
, void **eles
) {
208 new_count
= MAX(offset_start
, list
->count
) + num_eles
;
210 list
= safe_perealloc(list
, new_count
+ 1, list
->size
, sizeof(*list
), 1);
213 PLIST_MOV_EXPAND_EX(list
, offset_start
, num_eles
);
214 PLIST_CPY_R(list
, PLIST_ELE(list
, offset_start
), eles
, num_eles
);
215 list
->count
= new_count
;
221 bool psi_plist_shift(struct psi_plist
*list
, void *ptr
) {
222 if (list
&& list
->count
) {
224 PLIST_CPY(list
, ptr
, PLIST_ELE(list
, 0));
227 PLIST_MOV_REDUCE(list
, 0);
234 bool psi_plist_pop(struct psi_plist
*list
, void *ptr
) {
235 if (list
&& list
->count
) {
238 PLIST_CPY(list
, ptr
, PLIST_ELE(list
, list
->count
));
245 bool psi_plist_top(struct psi_plist
*list
, void *ptr
) {
246 if (list
&& list
->count
) {
247 PLIST_CPY(list
, ptr
, PLIST_ELE(list
, list
->count
- 1));
254 static void swp_ptr(void *a
, void *b
) {
255 void **_a
= a
, **_b
= b
, *_c
;
262 void psi_plist_sort(struct psi_plist
*list
, compare_func_t cmp
, swap_func_t swp
) {
263 if (!swp
&& list
->size
== sizeof(void *)) {
267 zend_insert_sort((void *) list
->list
, list
->count
, list
->size
, cmp
, swp
);