1 | /* SPDX-License-Identifier: BSD-2-Clause */ |
---|
2 | |
---|
3 | /** |
---|
4 | * @file |
---|
5 | * |
---|
6 | * @ingroup RTEMSScoreObject |
---|
7 | * |
---|
8 | * @brief This source file contains the implementation of |
---|
9 | * _Objects_Get_next(). |
---|
10 | */ |
---|
11 | |
---|
12 | /* |
---|
13 | * COPYRIGHT (c) 1989-1999. |
---|
14 | * On-Line Applications Research Corporation (OAR). |
---|
15 | * |
---|
16 | * Redistribution and use in source and binary forms, with or without |
---|
17 | * modification, are permitted provided that the following conditions |
---|
18 | * are met: |
---|
19 | * 1. Redistributions of source code must retain the above copyright |
---|
20 | * notice, this list of conditions and the following disclaimer. |
---|
21 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
22 | * notice, this list of conditions and the following disclaimer in the |
---|
23 | * documentation and/or other materials provided with the distribution. |
---|
24 | * |
---|
25 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
---|
26 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
27 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
28 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
---|
29 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
---|
30 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
---|
31 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
---|
32 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
---|
33 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
---|
34 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
---|
35 | * POSSIBILITY OF SUCH DAMAGE. |
---|
36 | */ |
---|
37 | |
---|
38 | #ifdef HAVE_CONFIG_H |
---|
39 | #include "config.h" |
---|
40 | #endif |
---|
41 | |
---|
42 | #include <rtems/score/objectimpl.h> |
---|
43 | |
---|
44 | Objects_Control *_Objects_Get_next( |
---|
45 | Objects_Id id, |
---|
46 | const Objects_Information *information, |
---|
47 | Objects_Id *next_id_p |
---|
48 | ) |
---|
49 | { |
---|
50 | Objects_Control *the_object; |
---|
51 | Objects_Id next_id; |
---|
52 | Objects_Maximum maximum; |
---|
53 | |
---|
54 | if ( !information ) |
---|
55 | return NULL; |
---|
56 | |
---|
57 | if ( !next_id_p ) |
---|
58 | return NULL; |
---|
59 | |
---|
60 | if (_Objects_Get_index(id) == OBJECTS_ID_INITIAL_INDEX) |
---|
61 | next_id = _Objects_Get_minimum_id( information->maximum_id ); |
---|
62 | else |
---|
63 | next_id = id; |
---|
64 | |
---|
65 | _Objects_Allocator_lock(); |
---|
66 | maximum = _Objects_Get_maximum_index( information ); |
---|
67 | |
---|
68 | do { |
---|
69 | /* walked off end of list? */ |
---|
70 | if (_Objects_Get_index( next_id ) > maximum) { |
---|
71 | _Objects_Allocator_unlock(); |
---|
72 | *next_id_p = OBJECTS_ID_FINAL; |
---|
73 | return NULL; |
---|
74 | } |
---|
75 | |
---|
76 | /* try to grab one */ |
---|
77 | the_object = _Objects_Get_no_protection( next_id, information ); |
---|
78 | |
---|
79 | next_id++; |
---|
80 | } while ( the_object == NULL ); |
---|
81 | |
---|
82 | *next_id_p = next_id; |
---|
83 | return the_object; |
---|
84 | } |
---|