forked from Imagelibrary/rtems
0bb4dd0337
PR 820/rtems * inline/rtems/score/coremsg.inl, macros/rtems/score/coremsg.inl, src/coremsginsert.c: Increment of pending message count should be atomic with insertion on the pending message chain. Determination of the need to call the notification handler should also be in this atomic section of code.
114 lines
3.3 KiB
C
114 lines
3.3 KiB
C
/*
|
|
* CORE Message Queue Handler
|
|
*
|
|
* DESCRIPTION:
|
|
*
|
|
* This package is the implementation of the CORE Message Queue Handler.
|
|
* This core object provides task synchronization and communication functions
|
|
* via messages passed to queue objects.
|
|
*
|
|
* COPYRIGHT (c) 1989-2005.
|
|
* On-Line Applications Research Corporation (OAR).
|
|
*
|
|
* The license and distribution terms for this file may be
|
|
* found in the file LICENSE in this distribution or at
|
|
* http://www.rtems.com/license/LICENSE.
|
|
*
|
|
* $Id$
|
|
*/
|
|
|
|
#include <rtems/system.h>
|
|
#include <rtems/score/chain.h>
|
|
#include <rtems/score/isr.h>
|
|
#include <rtems/score/object.h>
|
|
#include <rtems/score/coremsg.h>
|
|
#include <rtems/score/states.h>
|
|
#include <rtems/score/thread.h>
|
|
#include <rtems/score/wkspace.h>
|
|
#if defined(RTEMS_MULTIPROCESSING)
|
|
#include <rtems/score/mpci.h>
|
|
#endif
|
|
|
|
/*PAGE
|
|
*
|
|
* _CORE_message_queue_Insert_message
|
|
*
|
|
* This kernel routine inserts the specified message into the
|
|
* message queue. It is assumed that the message has been filled
|
|
* in before this routine is called.
|
|
*
|
|
* Input parameters:
|
|
* the_message_queue - pointer to message queue
|
|
* the_message - message to insert
|
|
* priority - insert indication
|
|
*
|
|
* Output parameters: NONE
|
|
*
|
|
* INTERRUPT LATENCY:
|
|
* insert
|
|
*/
|
|
|
|
void _CORE_message_queue_Insert_message(
|
|
CORE_message_queue_Control *the_message_queue,
|
|
CORE_message_queue_Buffer_control *the_message,
|
|
CORE_message_queue_Submit_types submit_type
|
|
)
|
|
{
|
|
ISR_Level level;
|
|
boolean notify = FALSE;
|
|
|
|
the_message->priority = submit_type;
|
|
|
|
switch ( submit_type ) {
|
|
case CORE_MESSAGE_QUEUE_SEND_REQUEST:
|
|
_ISR_Disable( level );
|
|
if ( the_message_queue->number_of_pending_messages++ == 0 )
|
|
notify = TRUE;
|
|
_CORE_message_queue_Append_unprotected(the_message_queue, the_message);
|
|
_ISR_Enable( level );
|
|
break;
|
|
case CORE_MESSAGE_QUEUE_URGENT_REQUEST:
|
|
_ISR_Disable( level );
|
|
if ( the_message_queue->number_of_pending_messages++ == 0 )
|
|
notify = TRUE;
|
|
_CORE_message_queue_Prepend_unprotected(the_message_queue, the_message);
|
|
_ISR_Enable( level );
|
|
break;
|
|
default:
|
|
{
|
|
CORE_message_queue_Buffer_control *this_message;
|
|
Chain_Node *the_node;
|
|
Chain_Control *the_header;
|
|
|
|
the_header = &the_message_queue->Pending_messages;
|
|
the_node = the_header->first;
|
|
while ( !_Chain_Is_tail( the_header, the_node ) ) {
|
|
|
|
this_message = (CORE_message_queue_Buffer_control *) the_node;
|
|
|
|
if ( this_message->priority <= the_message->priority ) {
|
|
the_node = the_node->next;
|
|
continue;
|
|
}
|
|
|
|
break;
|
|
}
|
|
_ISR_Disable( level );
|
|
if ( the_message_queue->number_of_pending_messages++ == 0 )
|
|
notify = TRUE;
|
|
_Chain_Insert_unprotected( the_node->previous, &the_message->Node );
|
|
_ISR_Enable( level );
|
|
}
|
|
break;
|
|
}
|
|
|
|
/*
|
|
* According to POSIX, does this happen before or after the message
|
|
* is actually enqueued. It is logical to think afterwards, because
|
|
* the message is actually in the queue at this point.
|
|
*/
|
|
|
|
if ( notify && the_message_queue->notify_handler )
|
|
(*the_message_queue->notify_handler)( the_message_queue->notify_argument );
|
|
}
|