ucx: src/tree.c@dcf01bb852f4

     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/tree.h"

    30 #include "cx/linked_list.h"

    32 #define CX_TR_PTR(cur, off) ((void**)(((char*)cur)+off))

    34 void* cx_tree_last(void *node, ptrdiff_t loc_next) {

    35     void *last;

    36     do {

    37         last = node;

    38     } while ((node = *CX_TR_PTR(node, loc_next)) != NULL);

    39     return last;

    40 }

    42 int cx_tree_add_node(void *node, ptrdiff_t loc_parent, ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node) {

    43     void *last = cx_tree_last(node, loc_next);

    44     if(!last)

    45         return 1;

    47     // next pointer must be present

    48     *CX_TR_PTR(last, loc_next) = new_node;

    50     // optional fields

    51     if(loc_parent >= 0) {

    52         *CX_TR_PTR(new_node, loc_parent) = *CX_TR_PTR(node, loc_parent);

    53     }

    54     if(loc_prev >= 0) {

    55         *CX_TR_PTR(new_node, loc_prev) = last;

    56     }

    58     return 0;

    59 }

    61 int cx_tree_add_child_node(

    62         void *parent,

    63         ptrdiff_t loc_parent,

    64         ptrdiff_t loc_prev,

    65         ptrdiff_t loc_next,

    66         void **children_begin,

    67         void **children_end,

    68         void *new_node)

    69 {

    70     if(cx_linked_list_add(children_begin, children_end, loc_prev, loc_next, new_node)) {

    71         return 1;

    72     }

    73     // optional field

    74     if(loc_parent >= 0) {

    75         *CX_TR_PTR(new_node, loc_parent) = parent;

    76     }

    77     return 0;

    78 }

Mercurial > hg > ucx / file revision