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_Name_to_id_u32().
0010  */
0011 
0012 /*
0013  *  COPYRIGHT (c) 1989-2010.
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 static bool _Objects_Is_local_node_search( uint32_t node )
0045 {
0046   return node == OBJECTS_SEARCH_LOCAL_NODE || _Objects_Is_local_node( node );
0047 }
0048 
0049 Status_Control _Objects_Name_to_id_u32(
0050   uint32_t                   name,
0051   uint32_t                   node,
0052   Objects_Id                *id,
0053   const Objects_Information *information
0054 )
0055 {
0056 #if defined(RTEMS_MULTIPROCESSING)
0057   Objects_Name name_for_mp;
0058 #endif
0059 
0060   _Assert( !_Objects_Has_string_name( information ) );
0061 
0062   if ( id == NULL ) {
0063     return STATUS_INVALID_ADDRESS;
0064   }
0065 
0066   if (
0067     node == OBJECTS_SEARCH_ALL_NODES ||
0068     _Objects_Is_local_node_search( node )
0069   ) {
0070     Objects_Maximum maximum;
0071     Objects_Maximum index;
0072 
0073     maximum = _Objects_Get_maximum_index( information );
0074 
0075     for ( index = 0; index < maximum; ++index ) {
0076       const Objects_Control *the_object;
0077 
0078       the_object = information->local_table[ index ];
0079 
0080       if ( the_object != NULL && name == the_object->name.name_u32 ) {
0081         *id = the_object->id;
0082         _Assert( name != 0 );
0083         return STATUS_SUCCESSFUL;
0084       }
0085     }
0086   }
0087 
0088 #if defined(RTEMS_MULTIPROCESSING)
0089   if ( _Objects_Is_local_node_search( node ) ) {
0090     return STATUS_INVALID_NAME;
0091   }
0092 
0093   name_for_mp.name_u32 = name;
0094   return _Objects_MP_Global_name_search( information, name_for_mp, node, id );
0095 #else
0096   return STATUS_INVALID_NAME;
0097 #endif
0098 }