comparison: src/tree.c
src/tree.c
- changeset 427
- ec92b4ed23aa
- parent 426
- 9aa38cd4c992
- child 431
- dcf01bb852f4
equal
deleted
inserted
replaced
| 423:4cea6e50175b | 427:ec92b4ed23aa |
|---|---|
| 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 | |
| 31 #define CX_TR_PTR(cur, off) ((void**)(((char*)cur)+off)) | |
| 32 | |
| 33 void* cx_tree_last(void *node, ptrdiff_t loc_next) { | |
| 34 void *last; | |
| 35 do { | |
| 36 last = node; | |
| 37 } while ((node = *CX_TR_PTR(node, loc_next)) != NULL); | |
| 38 return last; | |
| 39 } | |
| 40 | |
| 41 int cx_tree_add_node(void *node, ptrdiff_t loc_parent, ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node) { | |
| 42 void *last = cx_tree_last(node, loc_next); | |
| 43 if(!last) | |
| 44 return 1; | |
| 45 | |
| 46 // next pointer must be present | |
| 47 *CX_TR_PTR(last, loc_next) = new_node; | |
| 48 | |
| 49 // optional fields | |
| 50 if(loc_parent >= 0) { | |
| 51 *CX_TR_PTR(new_node, loc_parent) = *CX_TR_PTR(node, loc_parent); | |
| 52 } | |
| 53 if(loc_prev >= 0) { | |
| 54 *CX_TR_PTR(new_node, loc_prev) = last; | |
| 55 } | |
| 56 | |
| 57 return 0; | |
| 58 } | |
| 59 | |
| 60 int cx_tree_add_child_node( | |
| 61 void *parent, | |
| 62 ptrdiff_t loc_parent, | |
| 63 ptrdiff_t loc_prev, | |
| 64 ptrdiff_t loc_next, | |
| 65 void **children_begin, | |
| 66 void **children_end, | |
| 67 void *new_node) | |
| 68 { | |
| 69 return 1; | |
| 70 } |
