![]() |
|
|||
File indexing completed on 2025-05-11 08:24:26
0001 /* SPDX-License-Identifier: BSD-2-Clause */ 0002 0003 /** 0004 * @file 0005 * 0006 * @ingroup RTEMSScoreMessageQueue 0007 * 0008 * @brief This source file contains the implementation of 0009 * _CORE_message_queue_Broadcast(). 0010 */ 0011 0012 /* 0013 * COPYRIGHT (c) 1989-2008. 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/coremsgimpl.h> 0043 #include <rtems/score/objectimpl.h> 0044 0045 Status_Control _CORE_message_queue_Broadcast( 0046 CORE_message_queue_Control *the_message_queue, 0047 const void *buffer, 0048 size_t size, 0049 uint32_t *count, 0050 Thread_queue_Context *queue_context 0051 ) 0052 { 0053 uint32_t number_broadcasted; 0054 0055 if ( size > the_message_queue->maximum_message_size ) { 0056 _ISR_lock_ISR_enable( &queue_context->Lock_context.Lock_context ); 0057 return STATUS_MESSAGE_INVALID_SIZE; 0058 } 0059 0060 number_broadcasted = 0; 0061 0062 _CORE_message_queue_Acquire_critical( the_message_queue, queue_context ); 0063 0064 while ( 0065 _CORE_message_queue_Dequeue_receiver( 0066 the_message_queue, 0067 buffer, 0068 size, 0069 0, 0070 queue_context 0071 ) != NULL 0072 ) { 0073 number_broadcasted += 1; 0074 0075 _CORE_message_queue_Acquire( the_message_queue, queue_context ); 0076 } 0077 0078 _CORE_message_queue_Release( the_message_queue, queue_context ); 0079 0080 *count = number_broadcasted; 0081 return STATUS_SUCCESSFUL; 0082 }
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |
![]() ![]() |