Mon, 25 Jul 2022 15:34:19 +0200
#170 test cxBufferGet
olaf@424 | 1 | /* |
olaf@424 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
olaf@424 | 3 | * |
olaf@424 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
olaf@424 | 5 | * |
olaf@424 | 6 | * Redistribution and use in source and binary forms, with or without |
olaf@424 | 7 | * modification, are permitted provided that the following conditions are met: |
olaf@424 | 8 | * |
olaf@424 | 9 | * 1. Redistributions of source code must retain the above copyright |
olaf@424 | 10 | * notice, this list of conditions and the following disclaimer. |
olaf@424 | 11 | * |
olaf@424 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
olaf@424 | 13 | * notice, this list of conditions and the following disclaimer in the |
olaf@424 | 14 | * documentation and/or other materials provided with the distribution. |
olaf@424 | 15 | * |
olaf@424 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
olaf@424 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
olaf@424 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
olaf@424 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
olaf@424 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
olaf@424 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
olaf@424 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
olaf@424 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
olaf@424 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
olaf@424 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
olaf@424 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
olaf@424 | 27 | */ |
olaf@424 | 28 | |
olaf@424 | 29 | #include "cx/tree.h" |
olaf@431 | 30 | #include "cx/linked_list.h" |
olaf@425 | 31 | |
universe@472 | 32 | #define CX_TR_PTR(cur, off) *((void**)(((char*)cur)+off)) |
olaf@426 | 33 | |
universe@453 | 34 | void cx_tree_add_sibling(void *node, ptrdiff_t loc_prev, ptrdiff_t loc_next, ptrdiff_t loc_parent, void *new_node) { |
universe@453 | 35 | cx_linked_list_add(&node, NULL, loc_prev, loc_next, new_node); |
universe@453 | 36 | |
universe@453 | 37 | // optional parent link |
universe@453 | 38 | if (loc_parent >= 0) { |
universe@472 | 39 | CX_TR_PTR(new_node, loc_parent) = CX_TR_PTR(node, loc_parent); |
olaf@426 | 40 | } |
olaf@425 | 41 | } |
olaf@425 | 42 | |
universe@453 | 43 | void cx_tree_add_child(void **children_begin, void **children_end, |
universe@453 | 44 | ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node, |
universe@453 | 45 | ptrdiff_t loc_parent, void *parent) { |
universe@453 | 46 | cx_linked_list_add(children_begin, children_end, loc_prev, loc_next, new_node); |
universe@453 | 47 | |
universe@453 | 48 | // optional parent link |
universe@453 | 49 | if (loc_parent >= 0) { |
universe@472 | 50 | CX_TR_PTR(new_node, loc_parent) = parent; |
olaf@431 | 51 | } |
olaf@425 | 52 | } |