![]() |
|
|||
File indexing completed on 2025-05-11 08:24:27
0001 /* SPDX-License-Identifier: BSD-2-Clause */ 0002 0003 /** 0004 * @file 0005 * 0006 * @ingroup RTEMSScoreWatchdog 0007 * 0008 * @brief This source file contains the implementation of 0009 * _Watchdog_Insert(). 0010 */ 0011 0012 /* 0013 * Copyright (c) 2016 embedded brains GmbH & Co. KG 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/watchdogimpl.h> 0042 0043 void _Watchdog_Insert( 0044 Watchdog_Header *header, 0045 Watchdog_Control *the_watchdog, 0046 uint64_t expire 0047 ) 0048 { 0049 RBTree_Node **link; 0050 RBTree_Node *parent; 0051 RBTree_Node *old_first; 0052 RBTree_Node *new_first; 0053 0054 _Assert( _Watchdog_Get_state( the_watchdog ) == WATCHDOG_INACTIVE ); 0055 0056 link = _RBTree_Root_reference( &header->Watchdogs ); 0057 parent = NULL; 0058 old_first = header->first; 0059 new_first = &the_watchdog->Node.RBTree; 0060 0061 the_watchdog->expire = expire; 0062 0063 while ( *link != NULL ) { 0064 Watchdog_Control *parent_watchdog; 0065 0066 parent = *link; 0067 parent_watchdog = (Watchdog_Control *) parent; 0068 0069 if ( expire < parent_watchdog->expire ) { 0070 link = _RBTree_Left_reference( parent ); 0071 } else { 0072 link = _RBTree_Right_reference( parent ); 0073 new_first = old_first; 0074 } 0075 } 0076 0077 header->first = new_first; 0078 _RBTree_Initialize_node( &the_watchdog->Node.RBTree ); 0079 _RBTree_Add_child( &the_watchdog->Node.RBTree, parent, link ); 0080 _RBTree_Insert_color( &header->Watchdogs, &the_watchdog->Node.RBTree ); 0081 }
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |
![]() ![]() |