blob: ac288fec1532c8c6573c210fdfdcc4eda59d9713 (
plain) (
blame)
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
// license:GPL-2.0+
// copyright-holders:Couriersud
/*
* nllists.h
*
*/
#pragma once
#ifndef NLLISTS_H_
#define NLLISTS_H_
#include "nl_config.h"
#include "plib/plists.h"
// ----------------------------------------------------------------------------------------
// timed queue
// ----------------------------------------------------------------------------------------
namespace netlist
{
template <class _Element, class _Time>
class timed_queue
{
P_PREVENT_COPYING(timed_queue)
public:
class entry_t
{
public:
ATTR_HOT entry_t()
: m_exec_time(), m_object() {}
ATTR_HOT entry_t(const _Time &atime, const _Element &elem) : m_exec_time(atime), m_object(elem) {}
ATTR_HOT const _Time &exec_time() const { return m_exec_time; }
ATTR_HOT const _Element &object() const { return m_object; }
ATTR_HOT entry_t &operator=(const entry_t &right) {
m_exec_time = right.m_exec_time;
m_object = right.m_object;
return *this;
}
private:
_Time m_exec_time;
_Element m_object;
};
timed_queue(unsigned list_size)
: m_list(list_size)
{
#if HAS_OPENMP && USE_OPENMP
m_lock = 0;
#endif
clear();
}
ATTR_HOT std::size_t capacity() const { return m_list.size(); }
ATTR_HOT bool is_empty() const { return (m_end == &m_list[1]); }
ATTR_HOT bool is_not_empty() const { return (m_end > &m_list[1]); }
ATTR_HOT void push(const entry_t &e)
{
#if HAS_OPENMP && USE_OPENMP
/* Lock */
while (atomic_exchange32(&m_lock, 1)) { }
#endif
const _Time &t = e.exec_time();
entry_t * i = m_end++;
for (; t > (i - 1)->exec_time(); i--)
{
*(i) = *(i-1);
//i--;
inc_stat(m_prof_sortmove);
}
*i = e;
inc_stat(m_prof_call);
#if HAS_OPENMP && USE_OPENMP
m_lock = 0;
#endif
//nl_assert(m_end - m_list < _Size);
}
ATTR_HOT const entry_t & pop()
{
return *(--m_end);
}
ATTR_HOT const entry_t & top() const
{
return *(m_end-1);
}
ATTR_HOT void remove(const _Element &elem)
{
/* Lock */
#if HAS_OPENMP && USE_OPENMP
while (atomic_exchange32(&m_lock, 1)) { }
#endif
for (entry_t * i = m_end - 1; i > &m_list[0]; i--)
{
if (i->object() == elem)
{
m_end--;
while (i < m_end)
{
*i = *(i+1);
i++;
}
#if HAS_OPENMP && USE_OPENMP
m_lock = 0;
#endif
return;
}
}
#if HAS_OPENMP && USE_OPENMP
m_lock = 0;
#endif
}
ATTR_COLD void clear()
{
m_end = &m_list[0];
/* put an empty element with maximum time into the queue.
* the insert algo above will run into this element and doesn't
* need a comparison with queue start.
*/
m_list[0] = entry_t(_Time::from_raw(~0), _Element(0));
m_end++;
}
// save state support & mame disasm
ATTR_COLD const entry_t *listptr() const { return &m_list[1]; }
ATTR_HOT int count() const { return m_end - &m_list[1]; }
ATTR_HOT const entry_t & operator[](const int & index) const { return m_list[1+index]; }
#if (NL_KEEP_STATISTICS)
// profiling
INT32 m_prof_sortmove;
INT32 m_prof_call;
#endif
private:
#if HAS_OPENMP && USE_OPENMP
volatile INT32 m_lock;
#endif
entry_t * m_end;
parray_t<entry_t> m_list;
};
}
#endif /* NLLISTS_H_ */
|