1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
/*
* Copyright (c) 2017-present, Texas Instruments Incorporated
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* * Neither the name of Texas Instruments Incorporated nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/** ============================================================================
* @file Queue.h
*
* @brief Queue Handling routines for RTOS
*
*
* ============================================================================
*/
#ifndef ti_osal_Queue__include
#define ti_osal_Queue__include
#include <stdbool.h>
#ifdef __cplusplus
extern "C" {
#endif
/*!
* @brief Function to write back and invalidate cache lines
*
* @param addr Start address of the cache line/s
*
* @param size size (in bytes) of the memory to be written back and invalidate
*
*/
typedef struct {
struct Osal_QueueElem *next;
struct Osal_QueueElem *prev;
} Osal_Queue_Elem;
/*!
* OSAL Queue handle Type
*
*/
typedef void *Osal_Queue_Handle;
/*!
* @brief Function to construct the queue
*
* @param structPtr Pointer to the structure containing the queue element
*
* @param queueParams queue parameters
*
*/
void Osal_Queue_construct(void * structPtr, const void * queueParams);
/*!
* @brief Function to return the queue handle from the structure
*
* @param structPtr Pointer to the structure containing the queue element
*
*/
Osal_Queue_Handle Osal_Queue_handle(void *structPtr);
/*!
* @brief Function to empty the queue
*
* @param queueHandle The queue handle
*
*/
bool Osal_Queue_empty(Osal_Queue_Handle queueHandle);
/*!
* @brief Function to return the element at the front of the queue
*
* @param queueHandle The queue handle
*
*/
void * Osal_Queue_get(Osal_Queue_Handle queueHandle);
/*!
* @brief Function to put the element to the queue
*
* @param queueHandle The queue handle
*
* @param Ptr Pointer to the queue element
*/
void Osal_Queue_put(Osal_Queue_Handle queueHandle,Osal_Queue_Elem *ptr);
#ifdef __cplusplus
}
#endif
#endif /* ti_osal_CacheP__include */
|
