comparison: src/ucx/tree.c
src/ucx/tree.c
- changeset 504
- c094afcdfb27
- parent 503
- aeaf7db26fac
- child 505
- d41fc7f37aed
equal
deleted
inserted
replaced
| 503:aeaf7db26fac | 504:c094afcdfb27 |
|---|---|
| 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 */ | |
| 28 | |
| 29 #include "cx/tree.h" | |
| 30 #include "cx/linked_list.h" | |
| 31 | |
| 32 #define CX_TR_PTR(cur, off) *((void**)(((char*)(cur))+(off))) | |
| 33 | |
| 34 void cx_tree_add_sibling(void *node, ptrdiff_t loc_prev, ptrdiff_t loc_next, ptrdiff_t loc_parent, void *new_node) { | |
| 35 cx_linked_list_add(&node, NULL, loc_prev, loc_next, new_node); | |
| 36 | |
| 37 // optional parent link | |
| 38 if (loc_parent >= 0) { | |
| 39 CX_TR_PTR(new_node, loc_parent) = CX_TR_PTR(node, loc_parent); | |
| 40 } | |
| 41 } | |
| 42 | |
| 43 void cx_tree_add_child(void **children_begin, void **children_end, | |
| 44 ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node, | |
| 45 ptrdiff_t loc_parent, void *parent) { | |
| 46 cx_linked_list_add(children_begin, children_end, loc_prev, loc_next, new_node); | |
| 47 | |
| 48 // optional parent link | |
| 49 if (loc_parent >= 0) { | |
| 50 CX_TR_PTR(new_node, loc_parent) = parent; | |
| 51 } | |
| 52 } |
