Tue, 28 Dec 2021 17:49:52 +0100
fix missing cleanup in test_hl_linked_list_from_array
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
27 */
29 #include "cx/linked_list.h"
30 #include <stdint.h>
31 #include <string.h>
32 #include <assert.h>
34 /* LOW LEVEL LINKED LIST FUNCTIONS */
36 #define CX_LL_PTR(cur, off) (*(void**)(((char*)cur)+off))
37 #define ll_prev(node) CX_LL_PTR(node, loc_prev)
38 #define ll_next(node) CX_LL_PTR(node, loc_next)
39 #define ll_advance(node) CX_LL_PTR(node, loc_advance)
40 #define ll_data(node) (follow_ptr?CX_LL_PTR(node, loc_data):(((char*)node)+loc_data))
42 void *cx_linked_list_at(
43 void *start,
44 size_t start_index,
45 ptrdiff_t loc_advance,
46 size_t index
47 ) {
48 assert(start != NULL);
49 assert(loc_advance >= 0);
50 size_t i = start_index;
51 void *cur = start;
52 while (i != index && cur != NULL) {
53 cur = ll_advance(cur);
54 i < index ? i++ : i--;
55 }
56 return cur;
57 }
59 size_t cx_linked_list_find(
60 void const *start,
61 ptrdiff_t loc_advance,
62 ptrdiff_t loc_data,
63 bool follow_ptr,
64 CxListComparator cmp_func,
65 void const *elem
66 ) {
67 assert(start != NULL);
68 assert(loc_advance >= 0);
69 assert(loc_data >= 0);
70 assert(cmp_func);
72 void const *node = start;
73 size_t index = 0;
74 do {
75 void *current = ll_data(node);
76 if (cmp_func(current, elem) == 0) {
77 return index;
78 }
79 node = ll_advance(node);
80 index++;
81 } while (node != NULL);
82 return index;
83 }
85 void *cx_linked_list_first(
86 void *node,
87 ptrdiff_t loc_prev
88 ) {
89 return cx_linked_list_last(node, loc_prev);
90 }
92 void *cx_linked_list_last(
93 void *node,
94 ptrdiff_t loc_next
95 ) {
96 assert(node != NULL);
97 assert(loc_next >= 0);
99 void *cur = node;
100 void *last;
101 do {
102 last = cur;
103 } while ((cur = ll_next(cur)) != NULL);
105 return last;
106 }
108 void *cx_linked_list_prev(
109 void *begin,
110 ptrdiff_t loc_next,
111 void *node
112 ) {
113 assert(begin != NULL);
114 assert(node != NULL);
115 assert(loc_next >= 0);
116 if (begin == node) return NULL;
117 void *cur = begin;
118 void *next;
119 while (1) {
120 next = ll_next(cur);
121 if (next == node) return cur;
122 cur = next;
123 }
124 }
126 void cx_linked_list_link(
127 void *left,
128 void *right,
129 ptrdiff_t loc_prev,
130 ptrdiff_t loc_next
131 ) {
132 assert(loc_next >= 0);
133 ll_next(left) = right;
134 if (loc_prev >= 0) {
135 ll_prev(right) = left;
136 }
137 }
139 void cx_linked_list_unlink(
140 void *left,
141 void *right,
142 ptrdiff_t loc_prev,
143 ptrdiff_t loc_next
144 ) {
145 assert (loc_next >= 0);
146 assert(ll_next(left) == right);
147 ll_next(left) = NULL;
148 if (loc_prev >= 0) {
149 assert(ll_prev(right) == left);
150 ll_prev(right) = NULL;
151 }
152 }
154 void cx_linked_list_add(
155 void **begin,
156 void **end,
157 ptrdiff_t loc_prev,
158 ptrdiff_t loc_next,
159 void *new_node
160 ) {
161 void *last;
162 if (end == NULL) {
163 assert(begin != NULL);
164 last = *begin == NULL ? NULL : cx_linked_list_last(*begin, loc_next);
165 } else {
166 last = *end;
167 }
168 cx_linked_list_insert_chain(begin, end, loc_prev, loc_next, last, new_node, new_node);
169 }
171 void cx_linked_list_prepend(
172 void **begin,
173 void **end,
174 ptrdiff_t loc_prev,
175 ptrdiff_t loc_next,
176 void *new_node
177 ) {
178 cx_linked_list_insert_chain(begin, end, loc_prev, loc_next, NULL, new_node, new_node);
179 }
181 void cx_linked_list_insert(
182 void **begin,
183 void **end,
184 ptrdiff_t loc_prev,
185 ptrdiff_t loc_next,
186 void *node,
187 void *new_node
188 ) {
189 cx_linked_list_insert_chain(begin, end, loc_prev, loc_next, node, new_node, new_node);
190 }
192 void cx_linked_list_insert_chain(
193 void **begin,
194 void **end,
195 ptrdiff_t loc_prev,
196 ptrdiff_t loc_next,
197 void *node,
198 void *insert_begin,
199 void *insert_end
200 ) {
201 // find the end of the chain, if not specified
202 if (insert_end == NULL) {
203 insert_end = cx_linked_list_last(insert_begin, loc_next);
204 }
206 // determine the successor
207 void *successor;
208 if (node == NULL) {
209 assert(begin != NULL || (end != NULL && loc_prev >= 0));
210 if (begin != NULL) {
211 successor = *begin;
212 *begin = insert_begin;
213 } else {
214 successor = *end == NULL ? NULL : cx_linked_list_first(*end, loc_prev);
215 }
216 } else {
217 successor = ll_next(node);
218 cx_linked_list_link(node, insert_begin, loc_prev, loc_next);
219 }
221 if (successor == NULL) {
222 // the list ends with the new chain
223 if (end != NULL) {
224 *end = insert_end;
225 }
226 } else {
227 cx_linked_list_link(insert_end, successor, loc_prev, loc_next);
228 }
229 }
231 void cx_linked_list_remove(
232 void **begin,
233 void **end,
234 ptrdiff_t loc_prev,
235 ptrdiff_t loc_next,
236 void *node
237 ) {
238 assert(node != NULL);
239 assert(loc_next >= 0);
240 assert(loc_prev >= 0 || begin != NULL);
242 // find adjacent nodes
243 void *next = ll_next(node);
244 void *prev;
245 if (loc_prev >= 0) {
246 prev = ll_prev(node);
247 } else {
248 prev = cx_linked_list_prev(*begin, loc_next, node);
249 }
251 // update next pointer of prev node, or set begin
252 if (prev == NULL) {
253 if (begin != NULL) {
254 *begin = next;
255 }
256 } else {
257 ll_next(prev) = next;
258 }
260 // update prev pointer of next node, or set end
261 if (next == NULL) {
262 if (end != NULL) {
263 *end = prev;
264 }
265 } else if (loc_prev >= 0) {
266 ll_prev(next) = prev;
267 }
268 }
270 size_t cx_linked_list_size(
271 void const *node,
272 ptrdiff_t loc_next
273 ) {
274 assert(loc_next >= 0);
275 size_t size = 0;
276 while (node != NULL) {
277 node = ll_next(node);
278 size++;
279 }
280 return size;
281 }
283 static void *cx_linked_list_sort_merge(
284 ptrdiff_t loc_prev,
285 ptrdiff_t loc_next,
286 ptrdiff_t loc_data,
287 bool follow_ptr,
288 size_t length,
289 void *ls,
290 void *le,
291 void *re,
292 CxListComparator cmp_func
293 ) {
294 const size_t sbo_len = 1024;
295 void *sbo[sbo_len];
296 void **sorted = (length >= sbo_len) ? malloc(sizeof(void *) * length) : sbo;
297 void *rc, *lc;
299 lc = ls;
300 rc = le;
301 size_t n = 0;
302 while (lc && lc != le && rc != re) {
303 if (cmp_func(ll_data(lc), ll_data(rc)) <= 0) {
304 sorted[n] = lc;
305 lc = ll_next(lc);
306 } else {
307 sorted[n] = rc;
308 rc = ll_next(rc);
309 }
310 n++;
311 }
312 while (lc && lc != le) {
313 sorted[n] = lc;
314 lc = ll_next(lc);
315 n++;
316 }
317 while (rc && rc != re) {
318 sorted[n] = rc;
319 rc = ll_next(rc);
320 n++;
321 }
323 // Update pointer
324 if (loc_prev >= 0) ll_prev(sorted[0]) = NULL;
325 for (size_t i = 0; i < length - 1; i++) {
326 cx_linked_list_link(sorted[i], sorted[i + 1], loc_prev, loc_next);
327 }
328 ll_next(sorted[length - 1]) = NULL;
330 void *ret = sorted[0];
331 if (sorted != sbo) {
332 free(sorted);
333 }
334 return ret;
335 }
337 void cx_linked_list_sort( /* NOLINT(misc-no-recursion) - purposely recursive function */
338 void **begin,
339 void **end,
340 ptrdiff_t loc_prev,
341 ptrdiff_t loc_next,
342 ptrdiff_t loc_data,
343 bool follow_ptr,
344 CxListComparator cmp_func
345 ) {
346 assert(begin != NULL);
347 assert(loc_next >= 0);
348 assert(loc_data >= 0);
349 assert(cmp_func);
351 void *lc, *ls, *le, *re;
353 // set start node
354 ls = *begin;
356 // check how many elements are already sorted
357 lc = ls;
358 size_t ln = 1;
359 while (ll_next(lc) != NULL && cmp_func(ll_data(ll_next(lc)), ll_data(lc)) > 0) {
360 lc = ll_next(lc);
361 ln++;
362 }
363 le = ll_next(lc);
365 // if first unsorted node is NULL, the list is already completely sorted
366 if (le != NULL) {
367 void *rc;
368 size_t rn = 1;
369 rc = le;
370 // skip already sorted elements
371 while (ll_next(rc) != NULL && cmp_func(ll_data(ll_next(rc)), ll_data(rc)) > 0) {
372 rc = ll_next(rc);
373 rn++;
374 }
375 re = ll_next(rc);
377 // {ls,...,le->prev} and {rs,...,re->prev} are sorted - merge them
378 void *sorted = cx_linked_list_sort_merge(loc_prev, loc_next, loc_data, follow_ptr,
379 ln + rn, ls, le, re, cmp_func);
381 // Something left? Sort it!
382 size_t remainder_length = cx_linked_list_size(re, loc_next);
383 if (remainder_length > 0) {
384 void *remainder = re;
385 cx_linked_list_sort(&remainder, NULL, loc_prev, loc_next, loc_data, follow_ptr, cmp_func);
387 // merge sorted list with (also sorted) remainder
388 *begin = cx_linked_list_sort_merge(loc_prev, loc_next, loc_data, follow_ptr,
389 ln + rn + remainder_length,
390 sorted, remainder, NULL, cmp_func);
391 } else {
392 // no remainder - we've got our sorted list
393 *begin = sorted;
394 }
395 if (end) *end = cx_linked_list_last(sorted, loc_next);
396 }
397 }
399 int cx_linked_list_compare(
400 void const *begin_left,
401 void const *begin_right,
402 ptrdiff_t loc_advance,
403 ptrdiff_t loc_data,
404 bool follow_ptr,
405 CxListComparator cmp_func
406 ) {
407 void const *left = begin_left, *right = begin_right;
409 while (left != NULL && right != NULL) {
410 int result = cmp_func(ll_data(left), ll_data(right));
411 if (result != 0) return result;
412 left = ll_advance(left);
413 right = ll_advance(right);
414 }
416 if (left != NULL) { return 1; }
417 else if (right != NULL) { return -1; }
418 else { return 0; }
419 }
421 void cx_linked_list_reverse(
422 void **begin,
423 void **end,
424 ptrdiff_t loc_prev,
425 ptrdiff_t loc_next
426 ) {
427 assert(begin != NULL);
428 assert(loc_next >= 0);
430 // swap all links
431 void *prev = NULL;
432 void *cur = *begin;
433 while (cur != NULL) {
434 void *next = ll_next(cur);
436 ll_next(cur) = prev;
437 if (loc_prev >= 0) {
438 ll_prev(cur) = next;
439 }
441 prev = cur;
442 cur = next;
443 }
445 // update begin and end
446 if (end != NULL) {
447 *end = *begin;
448 }
449 *begin = prev;
450 }
452 /* HIGH LEVEL LINKED LIST IMPLEMENTATION */
454 typedef struct cx_linked_list_node cx_linked_list_node;
455 struct cx_linked_list_node {
456 cx_linked_list_node *prev;
457 cx_linked_list_node *next;
458 char payload[];
459 };
461 #define CX_LL_LOC_PREV offsetof(cx_linked_list_node, prev)
462 #define CX_LL_LOC_NEXT offsetof(cx_linked_list_node, next)
463 #define CX_LL_LOC_DATA offsetof(cx_linked_list_node, payload)
465 typedef struct {
466 cx_list_s base;
467 cx_linked_list_node *begin;
468 cx_linked_list_node *end;
469 } cx_linked_list;
471 static cx_linked_list_node *cx_ll_node_at(
472 cx_linked_list const *list,
473 size_t index
474 ) {
475 if (index >= list->base.size) {
476 return NULL;
477 } else if (index > list->base.size / 2) {
478 return cx_linked_list_at(list->end, list->base.size - 1, CX_LL_LOC_PREV, index);
479 } else {
480 return cx_linked_list_at(list->begin, 0, CX_LL_LOC_NEXT, index);
481 }
482 }
484 static int cx_ll_insert(
485 cx_list_s *list,
486 size_t index,
487 void const *elem
488 ) {
489 // out-of bounds check
490 if (index > list->size) return 1;
492 // cast a linked list pointer
493 cx_linked_list *ll = (cx_linked_list *) list;
495 // create the new new_node
496 cx_linked_list_node *new_node = cxMalloc(list->allocator,
497 sizeof(cx_linked_list_node) + list->itemsize);
499 // sortir if failed
500 if (new_node == NULL) return 1;
502 // initialize new new_node
503 new_node->prev = new_node->next = NULL;
504 memcpy(new_node->payload, elem, list->itemsize);
506 // find position efficiently
507 cx_linked_list_node *node = index == 0 ? NULL : cx_ll_node_at(ll, index - 1);
509 // insert
510 cx_linked_list_insert_chain(
511 (void **) &ll->begin, (void **) &ll->end,
512 CX_LL_LOC_PREV, CX_LL_LOC_NEXT,
513 node, new_node, new_node
514 );
516 // increase the size and return
517 list->size++;
518 return 0;
519 }
521 static int cx_ll_add(
522 cx_list_s *list,
523 void const *elem
524 ) {
525 return cx_ll_insert(list, list->size, elem);
526 }
528 static int cx_pll_insert(
529 cx_list_s *list,
530 size_t index,
531 void const *elem
532 ) {
533 return cx_ll_insert(list, index, &elem);
534 }
536 static int cx_pll_add(
537 cx_list_s *list,
538 void const *elem
539 ) {
540 return cx_ll_insert(list, list->size, &elem);
541 }
543 static int cx_ll_remove(
544 cx_list_s *list,
545 size_t index
546 ) {
547 cx_linked_list *ll = (cx_linked_list *) list;
548 cx_linked_list_node *node = cx_ll_node_at(ll, index);
550 // out-of-bounds check
551 if (node == NULL) return 1;
553 // remove
554 cx_linked_list_remove((void **) &ll->begin, (void **) &ll->end,
555 CX_LL_LOC_PREV, CX_LL_LOC_NEXT, node);
557 // adjust size
558 list->size--;
560 // free and return
561 cxFree(list->allocator, node);
563 return 0;
564 }
566 static void *cx_ll_at(
567 cx_list_s const *list,
568 size_t index
569 ) {
570 cx_linked_list *ll = (cx_linked_list *) list;
571 cx_linked_list_node *node = cx_ll_node_at(ll, index);
572 return node == NULL ? NULL : node->payload;
573 }
575 static void *cx_pll_at(
576 cx_list_s const *list,
577 size_t index
578 ) {
579 cx_linked_list *ll = (cx_linked_list *) list;
580 cx_linked_list_node *node = cx_ll_node_at(ll, index);
581 return node == NULL ? NULL : *(void **) node->payload;
582 }
584 static size_t cx_ll_find(
585 cx_list_s const *list,
586 void const *elem
587 ) {
588 return cx_linked_list_find(((cx_linked_list *) list)->begin,
589 CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
590 false, list->cmpfunc, elem);
591 }
593 static size_t cx_pll_find(
594 cx_list_s const *list,
595 void const *elem
596 ) {
597 return cx_linked_list_find(((cx_linked_list *) list)->begin,
598 CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
599 true, list->cmpfunc, elem);
600 }
602 static void cx_ll_sort(cx_list_s *list) {
603 cx_linked_list *ll = (cx_linked_list *) list;
604 cx_linked_list_sort((void **) &ll->begin, (void **) &ll->end,
605 CX_LL_LOC_PREV, CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
606 false, list->cmpfunc);
607 }
609 static void cx_pll_sort(cx_list_s *list) {
610 cx_linked_list *ll = (cx_linked_list *) list;
611 cx_linked_list_sort((void **) &ll->begin, (void **) &ll->end,
612 CX_LL_LOC_PREV, CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
613 true, list->cmpfunc);
614 }
616 static void cx_ll_reverse(cx_list_s *list) {
617 cx_linked_list *ll = (cx_linked_list *) list;
618 cx_linked_list_reverse((void **) &ll->begin, (void **) ll->end, CX_LL_LOC_PREV, CX_LL_LOC_NEXT);
619 }
621 static int cx_ll_compare(
622 cx_list_s const *list,
623 cx_list_s const *other
624 ) {
625 cx_linked_list *left = (cx_linked_list *) list;
626 cx_linked_list *right = (cx_linked_list *) other;
627 return cx_linked_list_compare(left->begin, right->begin,
628 CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
629 false, list->cmpfunc);
630 }
632 static int cx_pll_compare(
633 cx_list_s const *list,
634 cx_list_s const *other
635 ) {
636 cx_linked_list *left = (cx_linked_list *) list;
637 cx_linked_list *right = (cx_linked_list *) other;
638 return cx_linked_list_compare(left->begin, right->begin,
639 CX_LL_LOC_NEXT, CX_LL_LOC_DATA,
640 true, list->cmpfunc);
641 }
643 static cx_list_class cx_linked_list_class = {
644 cx_ll_add,
645 cx_ll_insert,
646 cx_ll_remove,
647 cx_ll_at,
648 cx_ll_find,
649 cx_ll_sort,
650 cx_ll_compare,
651 cx_ll_reverse
652 };
654 static cx_list_class cx_pointer_linked_list_class = {
655 cx_pll_add,
656 cx_pll_insert,
657 cx_ll_remove,
658 cx_pll_at,
659 cx_pll_find,
660 cx_pll_sort,
661 cx_pll_compare,
662 cx_ll_reverse
663 };
665 CxList cxLinkedListCreate(
666 CxAllocator allocator,
667 CxListComparator comparator,
668 size_t item_size
669 ) {
670 cx_linked_list *list = cxMalloc(allocator, sizeof(cx_linked_list));
671 if (list == NULL)
672 return NULL;
674 list->base.cl = &cx_linked_list_class;
675 list->base.allocator = allocator;
676 list->base.cmpfunc = comparator;
677 list->base.itemsize = item_size;
678 list->base.capacity = SIZE_MAX;
679 list->base.size = 0;
681 list->begin = NULL;
682 list->end = NULL;
684 return (CxList) list;
685 }
687 CxList cxPointerLinkedListCreate(
688 CxAllocator allocator,
689 CxListComparator comparator
690 ) {
691 cx_linked_list *list = cxMalloc(allocator, sizeof(cx_linked_list));
692 if (list == NULL)
693 return NULL;
695 list->base.cl = &cx_pointer_linked_list_class;
696 list->base.allocator = allocator;
697 list->base.cmpfunc = comparator;
698 list->base.itemsize = sizeof(void *);
699 list->base.capacity = SIZE_MAX;
700 list->base.size = 0;
702 list->begin = NULL;
703 list->end = NULL;
705 return (CxList) list;
706 }
708 CxList cxLinkedListFromArray(
709 CxAllocator allocator,
710 CxListComparator comparator,
711 size_t item_size,
712 size_t num_items,
713 void const *array
714 ) {
715 CxList list = cxLinkedListCreate(allocator, comparator, item_size);
716 if (list == NULL) return NULL;
717 for (size_t i = 0; i < num_items; i++) {
718 if (0 != cxListAdd(list, ((const unsigned char *) array) + i * item_size)) {
719 cxLinkedListDestroy(list);
720 return NULL;
721 }
722 }
723 return list;
724 }
726 void cxLinkedListDestroy(CxList list) {
727 cx_linked_list *ll = (cx_linked_list *) list;
729 cx_linked_list_node *node = ll->begin;
730 while (node) {
731 void *next = node->next;
732 cxFree(list->allocator, node);
733 node = next;
734 }
736 cxFree(list->allocator, list);
737 }