blob: ab24bfdfe480bae8a9ccf4af5f3a938cee288da3 (
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
|
// license:GPL-2.0+
// copyright-holders:Couriersud
/*
* nllists.h
*
*/
#pragma once
#ifndef NLLISTS_H_
#define NLLISTS_H_
#include "nl_config.h"
// ----------------------------------------------------------------------------------------
// timed queue
// ----------------------------------------------------------------------------------------
template <class _Element, class _Time, int _Size>
class netlist_timed_queue
{
NETLIST_PREVENT_COPYING(netlist_timed_queue)
public:
class entry_t
{
public:
ATTR_HOT inline entry_t()
: m_exec_time(), m_object() {}
ATTR_HOT inline entry_t(const _Time atime, const _Element elem) : m_exec_time(atime), m_object(elem) {}
ATTR_HOT inline const _Time exec_time() const { return m_exec_time; }
ATTR_HOT inline const _Element object() const { return m_object; }
private:
_Time m_exec_time;
_Element m_object;
};
netlist_timed_queue()
{
//m_list = global_alloc_array(entry_t, SIZE);
clear();
}
ATTR_HOT inline int capacity() const { return _Size; }
ATTR_HOT inline bool is_empty() const { return (m_end == &m_list[0]); }
ATTR_HOT inline bool is_not_empty() const { return (m_end > &m_list[0]); }
ATTR_HOT ATTR_ALIGN void push(const entry_t &e)
{
entry_t * i = m_end++;
const _Time e_time = e.exec_time();
while ((i > &m_list[0]) && (e_time > (i - 1)->exec_time()) )
{
*(i) = *(i-1);
i--;
inc_stat(m_prof_sortmove);
}
*i = e;
inc_stat(m_prof_sort);
assert(m_end - m_list < _Size);
}
ATTR_HOT inline const entry_t *pop()
{
return --m_end;
}
ATTR_HOT inline const entry_t *peek() const
{
return (m_end-1);
}
ATTR_HOT inline void remove(const _Element elem)
{
entry_t * i = m_end - 1;
while (i > &m_list[0])
{
if (i->object() == elem)
{
m_end--;
while (i < m_end)
{
*i = *(i+1);
i++;
}
return;
}
i--;
}
}
ATTR_COLD void clear()
{
m_end = &m_list[0];
}
// save state support & mame disasm
ATTR_COLD inline const entry_t *listptr() const { return &m_list[0]; }
ATTR_HOT inline int count() const { return m_end - m_list; }
ATTR_HOT inline const entry_t & operator[](const int & index) const { return m_list[index]; }
#if (NL_KEEP_STATISTICS)
// profiling
INT32 m_prof_start;
INT32 m_prof_end;
INT32 m_prof_sortmove;
INT32 m_prof_sort;
#endif
private:
entry_t * m_end;
entry_t m_list[_Size];
};
#endif /* NLLISTS_H_ */
|