blob: 741648a0346ef9fe197e3296f0b68e47ceaa7c0e (
plain)
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
|
/*
ChibiOS/RT - Copyright (C) 2006-2007 Giovanni Di Sirio.
This file is part of ChibiOS/RT.
ChibiOS/RT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
ChibiOS/RT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* @addtogroup Threads
* @{
*/
#ifndef _LISTS_H_
#define _LISTS_H_
typedef struct Thread Thread;
/* Macros good with both ThreadsQueue and ThreadsList.*/
#define isempty(p) ((p)->p_next == (Thread *)(p))
#define notempty(p) ((p)->p_next != (Thread *)(p))
/**
* Generic threads queue header and element.
*/
typedef struct {
/** First \p Thread in the queue, or \p ThreadQueue when empty. */
Thread *p_next;
/** Last \p Thread in the queue, or \p ThreadQueue when empty. */
Thread *p_prev;
} ThreadsQueue;
/**
* Generic threads single link list, it works like a stack.
*/
typedef struct {
/** Last pushed \p Thread on the stack list, or \p ThreadList when empty. */
Thread *p_next;
} ThreadsList;
/*
* Threads Lists functions and macros.
*/
#define fifo_init(tqp) ((tqp)->p_next = (tqp)->p_prev = (Thread *)(tqp));
#define list_init(tlp) ((tlp)->p_next = (Thread *)(tlp))
#ifndef CH_OPTIMIZE_SPEED
#ifdef __cplusplus
extern "C" {
#endif
void prio_insert(Thread *tp, ThreadsQueue *tqp);
void queue_insert(Thread *tp, ThreadsQueue *tqp);
Thread *fifo_remove(ThreadsQueue *tqp);
Thread *lifo_remove(ThreadsQueue *tqp);
Thread *dequeue(Thread *tp);
void list_insert(Thread *tp, ThreadsList *tlp);
Thread *list_remove(ThreadsList *tlp);
#ifdef __cplusplus
}
#endif
#endif /* CH_OPTIMIZE_SPEED */
#endif /* _LISTS_H_ */
/** @} */
|
