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
|
/********************************************************************************
* *
* Q u e u e O f P o i n t e r s *
* *
*********************************************************************************
* Copyright (C) 2006,2022 by Jeroen van der Zijp. All Rights Reserved. *
*********************************************************************************
* This library is free software; you can redistribute it and/or modify *
* it under the terms of the GNU Lesser General Public License as published by *
* the Free Software Foundation; either version 3 of the License, or *
* (at your option) any later version. *
* *
* This library 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 Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public License *
* along with this program. If not, see <http://www.gnu.org/licenses/> *
********************************************************************************/
#ifndef FXPTRQUEUE_H
#define FXPTRQUEUE_H
namespace FX {
/// Queue of void pointers
class FXAPI FXPtrQueue {
private:
FXPtrList list; // List of pointers
volatile FXival head; // Write side
volatile FXival tail; // Read side
private:
FXPtrQueue(const FXPtrQueue&);
FXPtrQueue &operator=(const FXPtrQueue&);
public:
/// Create initially empty queue
FXPtrQueue();
/// Create queue with initial size
FXPtrQueue(FXival sz);
/// Change size of queue; return true if success
FXbool setSize(FXival sz);
/// Return size
FXival getSize() const { return list.no(); }
/// Return number of used slots
FXival getUsed() const;
/// Return number of free slots
FXival getFree() const;
/// Check if queue is full
FXbool isFull() const;
/// Check if queue is empty
FXbool isEmpty() const;
/// Add item to queue, return true if success
FXbool push(FXptr ptr);
/// Peek for item
FXbool peek(FXptr& ptr);
/// Remove item from queue, return true if success
FXbool pop(FXptr& ptr);
/// Drop item from queue, return true if success
FXbool pop();
/// Destroy queue
~FXPtrQueue();
};
/// Queue of pointers to TYPE
template <typename TYPE>
class FXPtrQueueOf : public FXPtrQueue {
public:
FXPtrQueueOf(){}
FXPtrQueueOf(FXuint sz):FXPtrQueue(sz){}
FXbool push(TYPE* ptr){ return FXPtrQueue::push((FXptr)ptr); }
FXbool peek(TYPE*& ptr){ return FXPtrQueue::peek((FXptr&)ptr); }
FXbool pop(TYPE*& ptr){ return FXPtrQueue::pop((FXptr&)ptr); }
};
}
#endif
|
