score/src/rbtreeextract.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSScoreRBTree
0007  *
0008  * @brief This source file contains the implementation of
0009  *   _RBTree_Extract().
0010  */
0011
0012 /*
0013  *  Copyright (c) 2010 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/score/rbtreeimpl.h>
0042
0043 RTEMS_RB_GENERATE_REMOVE_COLOR( RBTree_Control, RBTree_Node, Node, static )
0044
0045 RTEMS_RB_GENERATE_REMOVE( RBTree_Control, RBTree_Node, Node, static )
0046
0047 #if defined(RTEMS_DEBUG)
0048 static const RBTree_Node *_RBTree_Find_root( const RBTree_Node *the_node )
0049 {
0050   while ( true ) {
0051     const RBTree_Node *potential_root;
0052
0053     potential_root = the_node;
0054     the_node = _RBTree_Parent( the_node );
0055
0056     if ( the_node == NULL ) {
0057       return potential_root;
0058     }
0059   }
0060 }
0061 #endif
0062
0063 void _RBTree_Extract(
0064   RBTree_Control *the_rbtree,
0065   RBTree_Node    *the_node
0066 )
0067 {
0068   _Assert( _RBTree_Find_root( the_node ) == _RBTree_Root( the_rbtree ) );
0069   RTEMS_RB_REMOVE( RBTree_Control, the_rbtree, the_node );
0070   _RBTree_Initialize_node( the_node );
0071 }