sapi/src/sapirbtreeinsert.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSAPIClassicRBTrees
0007  *
0008  * @brief This source file contains the implementation of
0009  *   rtems_rbtree_insert().
0010  */
0011
0012 /*
0013  *  Copyright (c) 2010-2012 Gedare Bloom.
0014  *
0015  * Redistribution and use in source and binary forms, with or without
0016  * modification, are permitted provided that the following conditions
0017  * are met:
0018  * 1. Redistributions of source code must retain the above copyright
0019  *    notice, this list of conditions and the following disclaimer.
0020  * 2. Redistributions in binary form must reproduce the above copyright
0021  *    notice, this list of conditions and the following disclaimer in the
0022  *    documentation and/or other materials provided with the distribution.
0023  *
0024  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0025  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0026  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0027  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0028  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0029  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0030  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0031  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0032  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0033  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0034  * POSSIBILITY OF SUCH DAMAGE.
0035  */
0036
0037 #ifdef HAVE_CONFIG_H
0038 #include "config.h"
0039 #endif
0040
0041 #include <rtems/rbtree.h>
0042
0043 RTEMS_STATIC_ASSERT(
0044   sizeof( rtems_rbtree_compare_result ) >= sizeof( intptr_t ),
0045   rtems_rbtree_compare_result_intptr_t
0046 );
0047
0048 RTEMS_STATIC_ASSERT(
0049   sizeof( rtems_rbtree_compare_result ) >= sizeof( int32_t ),
0050   rtems_rbtree_compare_result_int32_t
0051 );
0052
0053 rtems_rbtree_node *rtems_rbtree_insert(
0054   rtems_rbtree_control *the_rbtree,
0055   rtems_rbtree_node    *the_node,
0056   rtems_rbtree_compare  compare,
0057   bool                  is_unique
0058 )
0059 {
0060   rtems_rbtree_node **which = _RBTree_Root_reference( the_rbtree );
0061   rtems_rbtree_node  *parent = NULL;
0062
0063   while ( *which != NULL ) {
0064     rtems_rbtree_compare_result compare_result;
0065
0066     parent = *which;
0067     compare_result = ( *compare )( the_node, parent );
0068
0069     if ( is_unique && rtems_rbtree_is_equal( compare_result ) ) {
0070       return parent;
0071     }
0072
0073     if ( rtems_rbtree_is_lesser( compare_result ) ) {
0074       which = _RBTree_Left_reference( parent );
0075     } else {
0076       which = _RBTree_Right_reference( parent );
0077     }
0078   }
0079
0080   _RBTree_Initialize_node( the_node );
0081   _RBTree_Add_child( the_node, parent, which );
0082   _RBTree_Insert_color( the_rbtree, the_node );
0083
0084   return NULL;
0085 }