score/src/objectshrinkinformation.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_objects_block() and _Objects_Shrink_information().
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/assert.h>
0044 #include <rtems/score/chainimpl.h>
0045 #include <rtems/score/wkspace.h>
0046
0047 void _Objects_Free_objects_block(
0048   Objects_Information *information,
0049   Objects_Maximum      block
0050 )
0051 {
0052   Objects_Maximum   objects_per_block;
0053   Objects_Maximum   index_base;
0054   Objects_Maximum   index_end;
0055   Chain_Node       *node;
0056   const Chain_Node *tail;
0057
0058   objects_per_block = information->objects_per_block;
0059
0060   _Assert( _Objects_Allocator_is_owner() );
0061   _Assert( _Objects_Is_auto_extend( information ) );
0062   _Assert( block >= 1 );
0063   _Assert(
0064     block < _Objects_Get_maximum_index( information ) / objects_per_block
0065   );
0066
0067   index_base = block * objects_per_block;
0068   index_end = index_base + objects_per_block;
0069   node = _Chain_First( &information->Inactive );
0070   tail = _Chain_Immutable_tail( &information->Inactive );
0071
0072   while ( node != tail ) {
0073     Objects_Control *object;
0074     uint32_t         index;
0075
0076     object = (Objects_Control *) node;
0077     index = _Objects_Get_index( object->id ) - OBJECTS_INDEX_MINIMUM;
0078
0079     /*
0080      *  Get the next node before the node is extracted
0081      */
0082     node = _Chain_Next( node );
0083
0084     if ( index >= index_base && index < index_end ) {
0085       _Chain_Extract_unprotected( &object->Node );
0086     }
0087   }
0088
0089   /*
0090    *  Free the memory and reset the structures in the object' information
0091    */
0092
0093   _Workspace_Free( information->object_blocks[ block ] );
0094   information->object_blocks[ block ] = NULL;
0095   information->inactive_per_block[ block ] = 0;
0096   information->inactive -= objects_per_block;
0097 }
0098
0099 void _Objects_Shrink_information(
0100   Objects_Information *information
0101 )
0102 {
0103   Objects_Maximum objects_per_block;
0104   Objects_Maximum block_count;
0105   Objects_Maximum block;
0106
0107   _Assert( _Objects_Allocator_is_owner() );
0108   _Assert( _Objects_Is_auto_extend( information ) );
0109
0110   /*
0111    * Search the list to find block or chunk with all objects inactive.
0112    */
0113
0114   objects_per_block = information->objects_per_block;
0115   block_count = _Objects_Get_maximum_index( information ) / objects_per_block;
0116
0117   for ( block = 1; block < block_count; block++ ) {
0118     if ( information->inactive_per_block[ block ] == objects_per_block ) {
0119       _Objects_Free_objects_block( information, block );
0120       return;
0121     }
0122   }
0123 }