summaryrefslogtreecommitdiffstatshomepage
path: root/src/lib/netlist/plib/plists.h
blob: c2fee9c2f8e425c95ec3af0ee13ec761b5637744 (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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
// license:GPL-2.0+
// copyright-holders:Couriersud
/*
 * plists.h
 *
 */

#pragma once

#ifndef PLISTS_H_
#define PLISTS_H_

#include "pstring.h"

#include <array>
#include <type_traits>
#include <vector>

namespace plib {
/* ----------------------------------------------------------------------------------------
 * uninitialised_array_t:
 *      fixed size array allowing to override constructor and initialize
 *      members by placement new.
 *
 *      Use with care. This template is provided to improve locality of storage
 *      in high frequency applications. It should not be used for anything else.
 * ---------------------------------------------------------------------------------------- */

template <class C, std::size_t N>
class uninitialised_array_t
{
public:

	using iterator = C *;
	using const_iterator = const C *;

	uninitialised_array_t() noexcept = default;

	COPYASSIGNMOVE(uninitialised_array_t, delete)
	~uninitialised_array_t() noexcept
	{
		for (std::size_t i=0; i<N; i++)
			(*this)[i].~C();
	}

	size_t size() const { return N; }

	C& operator[](const std::size_t &index) noexcept
	{
		return *reinterpret_cast<C *>(&m_buf[index]);
	}

	const C& operator[](const std::size_t &index) const noexcept
	{
		return *reinterpret_cast<const C *>(&m_buf[index]);
	}

	template<typename... Args>
	void emplace(const std::size_t index, Args&&... args)
	{
		// allocate on buffer
		new (&m_buf[index]) C(std::forward<Args>(args)...);
	}

	iterator begin() const noexcept { return reinterpret_cast<iterator>(&m_buf[0]); }
	iterator end() const noexcept { return reinterpret_cast<iterator>(&m_buf[N]); }

	iterator begin() noexcept { return reinterpret_cast<iterator>(&m_buf[0]); }
	iterator end() noexcept { return reinterpret_cast<iterator>(&m_buf[N]); }

	const_iterator cbegin() const noexcept { return reinterpret_cast<const_iterator>(&m_buf[0]); }
	const_iterator cend() const noexcept { return reinterpret_cast<const_iterator>(&m_buf[N]); }

protected:

private:

	/* ensure proper alignment */
	PALIGNAS_VECTOROPT()
	std::array<typename std::aligned_storage<sizeof(C), alignof(C)>::type, N> m_buf;
};

// ----------------------------------------------------------------------------------------
// plinkedlist_t: a simple linked list
//                the list allows insertions / deletions if used properly
// ----------------------------------------------------------------------------------------

#if 0
template <class LC>
class linkedlist_t
{
public:

	struct element_t
	{
	public:

		friend class linkedlist_t<LC>;

		constexpr element_t() : m_next(nullptr) {}
		constexpr element_t(const element_t &rhs) = delete;
		constexpr element_t(element_t &&rhs) = delete;

		constexpr LC *next() const noexcept { return m_next; }

	protected:
		~element_t() = default;
	private:
		LC * m_next;
	};

	struct iter_t final : public std::iterator<std::forward_iterator_tag, LC>
	{
	private:
		LC* p;
	public:
		explicit constexpr iter_t(LC* x) noexcept : p(x) { }
		explicit constexpr iter_t(const iter_t &rhs) noexcept : p(rhs.p) { }
		iter_t(iter_t &&rhs) noexcept { std::swap(*this, rhs);  }
		iter_t& operator=(const iter_t &rhs) { iter_t t(rhs); std::swap(*this, t); return *this; }
		iter_t& operator=(iter_t &&rhs) { std::swap(*this, rhs); return *this; }
		iter_t& operator++() noexcept {p = p->next();return *this;}
		iter_t operator++(int) noexcept {iter_t tmp(*this); operator++(); return tmp;}
		constexpr bool operator==(const iter_t& rhs) const noexcept {return p == rhs.p;}
		constexpr bool operator!=(const iter_t& rhs) const noexcept {return p != rhs.p;}
		/* constexpr */ LC& operator*() noexcept {return *p;}
		/* constexpr */ LC* operator->() noexcept {return p;}

		constexpr LC& operator*() const noexcept {return *p;}
		constexpr LC* operator->() const noexcept {return p;}
	};

	constexpr linkedlist_t() : m_head(nullptr) {}

	constexpr iter_t begin() const noexcept { return iter_t(m_head); }
	constexpr iter_t end() const noexcept { return iter_t(nullptr); }

	void push_front(LC *elem) noexcept
	{
		elem->m_next = m_head;
		m_head = elem;
	}

	void push_back(LC *elem) noexcept
	{
		LC **p = &m_head;
		while (*p != nullptr)
		{
			p = &((*p)->m_next);
		}
		*p = elem;
		elem->m_next = nullptr;
	}

	void remove(const LC *elem) noexcept
	{
		auto p = &m_head;
		while(*p != elem)
		{
			//nl_assert(*p != nullptr);
			p = &((*p)->m_next);
		}
		(*p) = elem->m_next;
	}

	LC *front() const noexcept { return m_head; }
	void clear() noexcept { m_head = nullptr; }
	constexpr bool empty() const noexcept { return (m_head == nullptr); }

private:
	LC *m_head;
};
#else
template <class LC>
class linkedlist_t
{
public:

	struct element_t
	{
	public:

		friend class linkedlist_t<LC>;

		constexpr element_t() : m_next(nullptr), m_prev(nullptr) {}
		~element_t() noexcept = default;

		COPYASSIGNMOVE(element_t, delete)

		constexpr LC *next() const noexcept { return m_next; }
		constexpr LC *prev() const noexcept { return m_prev; }
	private:
		LC * m_next;
		LC * m_prev;
	};

	struct iter_t final : public std::iterator<std::forward_iterator_tag, LC>
	{
	private:
		LC* p;
	public:
		explicit constexpr iter_t(LC* x) noexcept : p(x) { }
		constexpr iter_t(iter_t &rhs) noexcept : p(rhs.p) { }
		iter_t(iter_t &&rhs) noexcept { std::swap(*this, rhs);  }
		iter_t& operator=(const iter_t &rhs) noexcept { iter_t t(rhs); std::swap(*this, t); return *this; }
		iter_t& operator=(iter_t &&rhs) noexcept { std::swap(*this, rhs); return *this; }
		iter_t& operator++() noexcept {p = p->next();return *this;}
		// NOLINTNEXTLINE(cert-dcl21-cpp)
		iter_t operator++(int) & noexcept {const iter_t tmp(*this); operator++(); return tmp;}

		~iter_t() = default;

		constexpr bool operator==(const iter_t& rhs) const noexcept {return p == rhs.p;}
		constexpr bool operator!=(const iter_t& rhs) const noexcept {return p != rhs.p;}
		/* constexpr */ LC& operator*() noexcept {return *p;}
		/* constexpr */ LC* operator->() noexcept {return p;}

		constexpr LC& operator*() const noexcept {return *p;}
		constexpr LC* operator->() const noexcept {return p;}
	};

	constexpr linkedlist_t() : m_head(nullptr) {}

	constexpr iter_t begin() const noexcept { return iter_t(m_head); }
	constexpr iter_t end() const noexcept { return iter_t(nullptr); }

	void push_front(LC *elem) noexcept
	{
		if (m_head)
			m_head->m_prev = elem;
		elem->m_next = m_head;
		elem->m_prev = nullptr;
		m_head = elem;
	}

	void push_back(LC *elem) noexcept
	{
		LC ** p(&m_head);
		LC *  prev(nullptr);
		while (*p != nullptr)
		{
			prev = *p;
			p = &((*p)->m_next);
		}
		*p = elem;
		elem->m_prev = prev;
		elem->m_next = nullptr;
	}

	void remove(const LC *elem) noexcept
	{
		if (elem->m_prev)
			elem->m_prev->m_next = elem->m_next;
		else
			m_head = elem->m_next;
		if (elem->m_next)
			elem->m_next->m_prev = elem->m_prev;
		else
		{
			/* update tail */
		}
	}

	LC *front() const noexcept { return m_head; }
	void clear() noexcept { m_head = nullptr; }
	constexpr bool empty() const noexcept { return (m_head == nullptr); }

private:
	LC *m_head;
};
#endif
} // namespace plib

#endif /* PLISTS_H_ */