olaf@424: /*
olaf@424:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
olaf@424:  *
olaf@424:  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
olaf@424:  *
olaf@424:  * Redistribution and use in source and binary forms, with or without
olaf@424:  * modification, are permitted provided that the following conditions are met:
olaf@424:  *
olaf@424:  *   1. Redistributions of source code must retain the above copyright
olaf@424:  *      notice, this list of conditions and the following disclaimer.
olaf@424:  *
olaf@424:  *   2. Redistributions in binary form must reproduce the above copyright
olaf@424:  *      notice, this list of conditions and the following disclaimer in the
olaf@424:  *      documentation and/or other materials provided with the distribution.
olaf@424:  *
olaf@424:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
olaf@424:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
olaf@424:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
olaf@424:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
olaf@424:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
olaf@424:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
olaf@424:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
olaf@424:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
olaf@424:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
olaf@424:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
olaf@424:  * POSSIBILITY OF SUCH DAMAGE.
olaf@424:  */
olaf@424: 
olaf@424: #include "cx/tree.h"
olaf@431: #include "cx/linked_list.h"
olaf@425: 
universe@472: #define CX_TR_PTR(cur, off) *((void**)(((char*)cur)+off))
olaf@426: 
universe@453: void cx_tree_add_sibling(void *node, ptrdiff_t loc_prev, ptrdiff_t loc_next, ptrdiff_t loc_parent, void *new_node) {
universe@453:     cx_linked_list_add(&node, NULL, loc_prev, loc_next, new_node);
universe@453: 
universe@453:     // optional parent link
universe@453:     if (loc_parent >= 0) {
universe@472:         CX_TR_PTR(new_node, loc_parent) = CX_TR_PTR(node, loc_parent);
olaf@426:     }
olaf@425: }
olaf@425: 
universe@453: void cx_tree_add_child(void **children_begin, void **children_end,
universe@453:                   ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node,
universe@453:                   ptrdiff_t loc_parent, void *parent) {
universe@453:     cx_linked_list_add(children_begin, children_end, loc_prev, loc_next, new_node);
universe@453: 
universe@453:     // optional parent link
universe@453:     if (loc_parent >= 0) {
universe@472:         CX_TR_PTR(new_node, loc_parent) = parent;
olaf@431:     }
olaf@425: }