include/boost/corosio/detail/intrusive.hpp

100.0% Lines (93/0/93) 100.0% List of functions (87/0/87)

[ ] prev/next file

intrusive.hpp

f(x) Functions (87)

Function Calls Lines Blocks

Line	Hits	Source Code
1		//
2		// Copyright (c) 2025 Vinnie Falco (vinnie.falco@gmail.com)
3		//
4		// Distributed under the Boost Software License, Version 1.0. (See accompanying
5		// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
6		//
7		// Official repository: https://github.com/cppalliance/corosio
8		//
9
10		#ifndef BOOST_COROSIO_DETAIL_INTRUSIVE_HPP
11		#define BOOST_COROSIO_DETAIL_INTRUSIVE_HPP
12
13		namespace boost::corosio::detail {
14
15		/** An intrusive doubly linked list.
16
17		This container provides O(1) push and pop operations for
18		elements that derive from @ref node. Elements are not
19		copied or moved; they are linked directly into the list.
20
21		@tparam T The element type. Must derive from `intrusive_list<T>::node`.
22		*/
23		template<class T>
24		class intrusive_list
25		{
26		public:
27		/** Base class for list elements.
28
29		Derive from this class to make a type usable with
30		@ref intrusive_list. The `next_` and `prev_` pointers
31		are private and accessible only to the list.
32		*/
33		class node
34		{
35		friend class intrusive_list;
36
37		private:
38		T* next_ = nullptr;
39		T* prev_ = nullptr;
40		};
41
42		private:
43		T* head_ = nullptr;
44		T* tail_ = nullptr;
45
46		public:
47	16126x	intrusive_list() = default;
48
49	1x	intrusive_list(intrusive_list&& other) noexcept
50	1x	: head_(other.head_)
51	1x	, tail_(other.tail_)
52		{
53	1x	other.head_ = nullptr;
54	1x	other.tail_ = nullptr;
55	1x	}
56
57		intrusive_list(intrusive_list const&) = delete;
58		intrusive_list& operator=(intrusive_list const&) = delete;
59		intrusive_list& operator=(intrusive_list&&) = delete;
60
61	12x	bool empty() const noexcept
62		{
63	12x	return head_ == nullptr;
64		}
65
66		/// Peek at the head element without removing it.
67	6x	T* front() const noexcept
68		{
69	6x	return head_;
70		}
71
72	30603x	void push_back(T* w) noexcept
73		{
74	30603x	auto* n = static_cast<node*>(w);
75	30603x	n->next_ = nullptr;
76	30603x	n->prev_ = tail_;
77	30603x	if (tail_)
78	21404x	static_cast<node*>(tail_)->next_ = w;
79		else
80	9199x	head_ = w;
81	30603x	tail_ = w;
82	30603x	}
83
84	3x	void splice_back(intrusive_list& other) noexcept
85		{
86	3x	if (other.empty())
87	1x	return;
88	2x	if (tail_)
89		{
90	1x	static_cast<node*>(tail_)->next_ = other.head_;
91	1x	static_cast<node*>(other.head_)->prev_ = tail_;
92	1x	tail_ = other.tail_;
93		}
94		else
95		{
96	1x	head_ = other.head_;
97	1x	tail_ = other.tail_;
98		}
99	2x	other.head_ = nullptr;
100	2x	other.tail_ = nullptr;
101		}
102
103	496615x	T* pop_front() noexcept
104		{
105	496615x	if (!head_)
106	489198x	return nullptr;
107	7417x	T* w = head_;
108	7417x	head_ = static_cast<node*>(head_)->next_;
109	7417x	if (head_)
110	14x	static_cast<node*>(head_)->prev_ = nullptr;
111		else
112	7403x	tail_ = nullptr;
113		// Defensive: clear stale linkage so remove() on a
114		// popped node cannot corrupt the list.
115	7417x	auto* n = static_cast<node*>(w);
116	7417x	n->next_ = nullptr;
117	7417x	n->prev_ = nullptr;
118	7417x	return w;
119		}
120
121	23184x	void remove(T* w) noexcept
122		{
123	23184x	auto* n = static_cast<node*>(w);
124		// Already detached — nothing to do.
125	23184x	if (!n->next_ && !n->prev_ && head_ != w && tail_ != w)
126	1x	return;
127	23183x	if (n->prev_)
128	7164x	static_cast<node*>(n->prev_)->next_ = n->next_;
129		else
130	16019x	head_ = n->next_;
131	23183x	if (n->next_)
132	14315x	static_cast<node*>(n->next_)->prev_ = n->prev_;
133		else
134	8868x	tail_ = n->prev_;
135	23183x	n->next_ = nullptr;
136	23183x	n->prev_ = nullptr;
137		}
138
139		/// Invoke @p f for each element in the list.
140		template<class F>
141	274x	void for_each(F f)
142		{
143	277x	for (T* p = head_; p; p = static_cast<node*>(p)->next_)
144	3x	f(p);
145	274x	}
146		};
147
148		/** An intrusive singly linked FIFO queue.
149
150		This container provides O(1) push and pop operations for
151		elements that derive from @ref node. Elements are not
152		copied or moved; they are linked directly into the queue.
153
154		Unlike @ref intrusive_list, this uses only a single `next_`
155		pointer per node, saving memory at the cost of not supporting
156		O(1) removal of arbitrary elements.
157
158		@tparam T The element type. Must derive from `intrusive_queue<T>::node`.
159		*/
160		template<class T>
161		class intrusive_queue
162		{
163		public:
164		/** Base class for queue elements.
165
166		Derive from this class to make a type usable with
167		@ref intrusive_queue. The `next_` pointer is private
168		and accessible only to the queue.
169		*/
170		class node
171		{
172		friend class intrusive_queue;
173
174		private:
175		T* next_ = nullptr;
176		};
177
178		private:
179		T* head_ = nullptr;
180		T* tail_ = nullptr;
181
182		public:
183	1605x	intrusive_queue() = default;
184
185	1x	intrusive_queue(intrusive_queue&& other) noexcept
186	1x	: head_(other.head_)
187	1x	, tail_(other.tail_)
188		{
189	1x	other.head_ = nullptr;
190	1x	other.tail_ = nullptr;
191	1x	}
192
193		intrusive_queue(intrusive_queue const&) = delete;
194		intrusive_queue& operator=(intrusive_queue const&) = delete;
195		intrusive_queue& operator=(intrusive_queue&&) = delete;
196
197	2144x	bool empty() const noexcept
198		{
199	2144x	return head_ == nullptr;
200		}
201
202	401x	void push(T* w) noexcept
203		{
204	401x	w->next_ = nullptr;
205	401x	if (tail_)
206	114x	tail_->next_ = w;
207		else
208	287x	head_ = w;
209	401x	tail_ = w;
210	401x	}
211
212	3x	void splice(intrusive_queue& other) noexcept
213		{
214	3x	if (other.empty())
215	1x	return;
216	2x	if (tail_)
217	1x	tail_->next_ = other.head_;
218		else
219	1x	head_ = other.head_;
220	2x	tail_ = other.tail_;
221	2x	other.head_ = nullptr;
222	2x	other.tail_ = nullptr;
223		}
224
225	3623x	T* pop() noexcept
226		{
227	3623x	if (!head_)
228	3222x	return nullptr;
229	401x	T* w = head_;
230	401x	head_ = head_->next_;
231	401x	if (!head_)
232	286x	tail_ = nullptr;
233		// Defensive: clear stale linkage on popped node.
234	401x	w->next_ = nullptr;
235	401x	return w;
236		}
237		};
238
239		} // namespace boost::corosio::detail
240
241		#endif
242