1 /*
2 * Copyright (c) 2015-2016, Texas Instruments Incorporated
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * * Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * * Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * * Neither the name of Texas Instruments Incorporated nor the names of
17 * its contributors may be used to endorse or promote products derived
18 * from this software without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
22 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
24 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
25 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
26 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
27 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
28 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 */
32 /*
33 * ======== HwiP_tirtos.c ========
34 */
36 #include <ti/osal/osal.h>
37 #include <ti/sysbios/knl/Queue.h>
38 #include <ti/osal/src/tirtos/tirtos_config.h>
39 /*!
40 * @brief Function to construct the queue
41 *
42 * @param structPtr Pointer to the structure containing the queue element
43 *
44 * @param queue parameters
45 *
46 */
47 void Osal_Queue_construct(void * structPtr, const void * params)
48 {
49 Queue_construct((Queue_Struct*)structPtr, (Queue_Params *) params);
50 }
51 /*!
52 * @brief Function to return the queue handle from the structure
53 *
54 * @param structPtr Pointer to the structure containing the queue element
55 *
56 */
57 Osal_Queue_Handle Osal_Queue_handle(void *structPtr)
58 {
59 return((Osal_Queue_Handle)Queue_handle((Queue_Struct *)structPtr));
60 }
61 /*!
62 * @brief Function to empty the queue
63 *
64 * @param handle The queue handle
65 *
66 */
67 bool Osal_Queue_empty(Osal_Queue_Handle handle)
68 {
69 bool ret;
70 if(Queue_empty(Queue_handle((Queue_Struct *)handle)) == TRUE)
71 {
72 ret = (bool)true;
73 }
74 else
75 {
76 ret = (bool)false;
77 }
78 return (ret);
79 }
80 /*!
81 * @brief Function to return the element at the front of the queue
82 *
83 * @param handle The queue handle
84 *
85 */
86 void * Osal_Queue_get(Osal_Queue_Handle handle)
87 {
88 return Queue_get(Queue_handle((Queue_Struct *)handle));
90 }
91 /*!
92 * @brief Function to return the element at the front of the queue
93 *
94 * @param handle The queue handle
95 *
96 * @param elem The queue element
97 */
98 void Osal_Queue_put(Osal_Queue_Handle handle,Osal_Queue_Elem *ptr)
99 {
100 Queue_put(Queue_handle((Queue_Struct *)handle),(Queue_Elem *)ptr);
101 }