Back to home page

LXR

 
 

    


File indexing completed on 2025-05-11 08:24:08

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002 
0003 /*  void Shm_Locked_queue_Add( lq_cb, ecb )
0004  *
0005  *  This routine adds an envelope control block to a shared memory queue.
0006  *
0007  *  Input parameters:
0008  *    lq_cb - pointer to a locked queue control block
0009  *    ecb   - pointer to an envelope control block
0010  *
0011  *  Output parameters: NONE
0012  *
0013  *  COPYRIGHT (c) 1989-1999.
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 #include <rtems.h>
0039 #include "shm_driver.h"
0040 
0041 void Shm_Locked_queue_Add(
0042   Shm_Locked_queue_Control *lq_cb,
0043   Shm_Envelope_control     *ecb
0044 )
0045 {
0046   uint32_t   index;
0047 
0048   ecb->next  = Shm_Locked_queue_End_of_list;
0049   ecb->queue = lq_cb->owner;
0050   index      = ecb->index;
0051 
0052   Shm_Lock( lq_cb );
0053     if ( Shm_Convert(lq_cb->front) != Shm_Locked_queue_End_of_list )
0054       Shm_Envelopes[ Shm_Convert(lq_cb->rear) ].next = index;
0055     else
0056       lq_cb->front = index;
0057     lq_cb->rear  = index;
0058   Shm_Unlock( lq_cb );
0059 }