cpukit/libdl/rtl-chain-iterator.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup rtems_rtld
0007  *
0008  * @brief RTEMS Run-Time Link Editor Chain Iterator
0009  *
0010  * A means of executing an iterator on a chain.
0011  */
0012
0013 /*
0014  *  COPYRIGHT (c) 2012 Chris Johns <chrisj@rtems.org>
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 "rtl-chain-iterator.h"
0043
0044 bool
0045 rtems_rtl_chain_iterate (rtems_chain_control* chain,
0046                          rtems_chain_iterator iterator,
0047                          void*                data)
0048 {
0049   rtems_chain_node* node = rtems_chain_first (chain);
0050   while (!rtems_chain_is_tail (chain, node))
0051   {
0052     rtems_chain_node* next_node = rtems_chain_next (node);
0053     if (!iterator (node, data))
0054       return false;
0055     node = next_node;
0056   }
0057   return true;
0058 }
0059
0060 /**
0061  * Count iterator.
0062  */
0063 static bool
0064 rtems_rtl_count_iterator (rtems_chain_node* node, void* data)
0065 {
0066   int* count = data;
0067   ++(*count);
0068   return true;
0069 }
0070
0071 int
0072 rtems_rtl_chain_count (rtems_chain_control* chain)
0073 {
0074   int count = 0;
0075   rtems_rtl_chain_iterate (chain, rtems_rtl_count_iterator, &count);
0076   return count;
0077 }