Back to home page

LXR

 
 

    


File indexing completed on 2025-05-11 08:24:26

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_Get_next().
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 
0044 Objects_Control *_Objects_Get_next(
0045   Objects_Id                 id,
0046   const Objects_Information *information,
0047   Objects_Id                *next_id_p
0048 )
0049 {
0050     Objects_Control *the_object;
0051     Objects_Id       next_id;
0052     Objects_Maximum  maximum;
0053 
0054     if ( !information )
0055       return NULL;
0056 
0057     if ( !next_id_p )
0058       return NULL;
0059 
0060     if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX)
0061         next_id = _Objects_Get_minimum_id( information->maximum_id );
0062     else
0063         next_id = id;
0064 
0065     _Objects_Allocator_lock();
0066     maximum = _Objects_Get_maximum_index( information );
0067 
0068     do {
0069       /* walked off end of list? */
0070       if (_Objects_Get_index( next_id ) > maximum) {
0071         _Objects_Allocator_unlock();
0072         *next_id_p = OBJECTS_ID_FINAL;
0073         return NULL;
0074       }
0075 
0076       /* try to grab one */
0077       the_object = _Objects_Get_no_protection( next_id, information );
0078 
0079       next_id++;
0080     } while ( the_object == NULL );
0081 
0082     *next_id_p = next_id;
0083     return the_object;
0084 }