score/src/objectfree.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSScoreObject
0007  *
0008  * @brief This source file contains the implementation of
0009  *   _Objects_Free_unlimited().
0010  */
0011
0012 /*
0013  *  COPYRIGHT (c) 1989-1999.
0014  *  On-Line Applications Research Corporation (OAR).
0015  *
0016  * Redistribution and use in source and binary forms, with or without
0017  * modification, are permitted provided that the following conditions
0018  * are met:
0019  * 1. Redistributions of source code must retain the above copyright
0020  *    notice, this list of conditions and the following disclaimer.
0021  * 2. Redistributions in binary form must reproduce the above copyright
0022  *    notice, this list of conditions and the following disclaimer in the
0023  *    documentation and/or other materials provided with the distribution.
0024  *
0025  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0026  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0027  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0028  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0029  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0030  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0031  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0032  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0033  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0034  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0035  * POSSIBILITY OF SUCH DAMAGE.
0036  */
0037
0038 #ifdef HAVE_CONFIG_H
0039 #include "config.h"
0040 #endif
0041
0042 #include <rtems/score/objectimpl.h>
0043 #include <rtems/score/chainimpl.h>
0044
0045 void _Objects_Free_unlimited(
0046   Objects_Information *information,
0047   Objects_Control     *the_object
0048 )
0049 {
0050   _Chain_Append_unprotected( &information->Inactive, &the_object->Node );
0051
0052   if ( _Objects_Is_auto_extend( information ) ) {
0053     Objects_Maximum objects_per_block;
0054     Objects_Maximum index;
0055
0056     objects_per_block = information->objects_per_block;
0057     index = _Objects_Get_index( the_object->id ) - OBJECTS_INDEX_MINIMUM;
0058
0059     if ( _Objects_Is_in_allocated_block( index, objects_per_block ) ) {
0060       Objects_Maximum block;
0061       Objects_Maximum inactive;
0062
0063       block = index / objects_per_block;
0064
0065       ++information->inactive_per_block[ block ];
0066
0067       inactive = information->inactive;
0068       ++inactive;
0069       information->inactive = inactive;
0070
0071       /*
0072        *  Check if the threshold level has been met of
0073        *  1.5 x objects_per_block are free.
0074        */
0075
0076       if ( inactive > ( objects_per_block + ( objects_per_block >> 1 ) ) ) {
0077         _Objects_Shrink_information( information );
0078       }
0079     }
0080   }
0081 }