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
|
// license:GPL-2.0+
// copyright-holders:Couriersud
///
/// \file queue.h
///
#ifndef NL_CORE_QUEUE_H_
#define NL_CORE_QUEUE_H_
#include "queue.h"
#include "../nl_errstr.h"
#include "../nltypes.h"
#include "../plib/pstate.h"
#include "../plib/pstring.h"
#include "../plib/ptimed_queue.h"
#include <array>
#include <unordered_map>
#include <utility>
#include <vector>
namespace netlist
{
namespace detail {
// Use timed_queue_heap to use stdc++ heap functions instead of linear processing.
// This slows down processing by about 25% on a Kaby Lake.
// template <class T, bool TS>
// using timed_queue = plib::timed_queue_heap<T, TS>;
template <class T, bool TS>
using timed_queue = plib::timed_queue_linear<T, TS>;
// -----------------------------------------------------------------------------
// queue_t
// -----------------------------------------------------------------------------
// We don't need a thread-safe queue currently. Parallel processing of
// solvers will update inputs after parallel processing.
template <typename O, bool TS>
class queue_base :
public timed_queue<plib::pqentry_t<netlist_time_ext, O *>, false>,
public plib::state_manager_t::callback_t
{
public:
using entry_t = plib::pqentry_t<netlist_time_ext, O *>;
using base_queue = timed_queue<entry_t, false>;
using id_delegate = plib::pmfp<std::size_t, const O *>;
using obj_delegate = plib::pmfp<O *, std::size_t>;
explicit queue_base(std::size_t size, id_delegate get_id, obj_delegate get_obj)
: timed_queue<plib::pqentry_t<netlist_time_ext, O *>, false>(size)
, m_qsize(0)
, m_times(size)
, m_net_ids(size)
, m_get_id(get_id)
, m_obj_by_id(get_obj)
{
}
~queue_base() noexcept override = default;
queue_base(const queue_base &) = delete;
queue_base(queue_base &&) = delete;
queue_base &operator=(const queue_base &) = delete;
queue_base &operator=(queue_base &&) = delete;
protected:
void register_state(plib::state_manager_t &manager, const pstring &module) override
{
manager.save_item(this, m_qsize, module + "." + "qsize");
manager.save_item(this, &m_times[0], module + "." + "times", m_times.size());
manager.save_item(this, &m_net_ids[0], module + "." + "names", m_net_ids.size());
}
void on_pre_save(plib::state_manager_t &manager) override
{
plib::unused_var(manager);
m_qsize = this->size();
for (std::size_t i = 0; i < m_qsize; i++ )
{
m_times[i] = this->listptr()[i].exec_time().as_raw();
m_net_ids[i] = m_get_id(this->listptr()[i].object());
}
}
void on_post_load(plib::state_manager_t &manager) override
{
plib::unused_var(manager);
this->clear();
for (std::size_t i = 0; i < m_qsize; i++ )
{
O *n = m_obj_by_id(m_net_ids[i]);
this->template push<false>(entry_t(netlist_time_ext::from_raw(m_times[i]),n));
}
}
private:
std::size_t m_qsize;
std::vector<netlist_time_ext::internal_type> m_times;
std::vector<std::size_t> m_net_ids;
id_delegate m_get_id;
obj_delegate m_obj_by_id;
};
using queue_t = queue_base<net_t, false>;
} // namespace detail
} // namespace netlist
#endif // NL_CORE_QUEUE_H_
|