include/boost/corosio/detail/intrusive.hpp

100.0% Lines (110/110) 100.0% List of functions (112/112) 39.5% Branches (234/592)

[ ] prev/next file n p prev/next uncovered line

intrusive.hpp

f(x) Functions (112)

Function Calls Lines Branches Blocks

Line	Branch	Hits	Source Code
1			//
2			// Copyright (c) 2025 Vinnie Falco ([email protected])
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		47273x	class node
34			{
35			friend class intrusive_list;
36
37			private:
38		47273x	T* next_ = nullptr;
39		47273x	T* prev_ = nullptr;
40			};
41
42			private:
43		1658212x	T* head_ = nullptr;
44		1658212x	T* tail_ = nullptr;
45
46			public:
47		4974636x	intrusive_list() = default;
48
49		2x	intrusive_list(intrusive_list&& other) noexcept
50		1x	: head_(other.head_)
51		1x	, tail_(other.tail_)
52		1x	{
53		1x	other.head_ = nullptr;
54		1x	other.tail_ = nullptr;
55		2x	}
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		32953x	void push_back(T* w) noexcept
73			{
74	15/34 ✗ Branch 0 not taken. ✓ Branch 1 taken 18440 times. ✗ Branch 2 not taken. ✓ Branch 3 taken 5399 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 95 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 96 times. ✗ Branch 8 not taken. ✓ Branch 9 taken 2 times. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✓ Branch 13 taken 186 times. ✗ Branch 14 not taken. ✓ Branch 15 taken 124 times. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✓ Branch 19 taken 45 times. ✗ Branch 20 not taken. ✓ Branch 21 taken 98 times. ✗ Branch 22 not taken. ✓ Branch 23 taken 1 time. ✗ Branch 24 not taken. ✓ Branch 25 taken 1799 times. ✗ Branch 26 not taken. ✓ Branch 27 taken 135 times. ✗ Branch 28 not taken. ✓ Branch 29 taken 4 times. ✗ Branch 30 not taken. ✓ Branch 31 taken 47 times. ✗ Branch 32 not taken. ✓ Branch 33 taken 102 times.	32953x	auto* n = static_cast<node*>(w);
75		32953x	n->next_ = nullptr;
76		32953x	n->prev_ = tail_;
77	30/36 ✓ Branch 0 taken 16478 times. ✓ Branch 1 taken 1981 times. ✓ Branch 2 taken 5042 times. ✓ Branch 3 taken 357 times. ✓ Branch 4 taken 4 times. ✓ Branch 5 taken 91 times. ✓ Branch 6 taken 3 times. ✓ Branch 7 taken 93 times. ✗ Branch 8 not taken. ✓ Branch 9 taken 2 times. ✓ Branch 10 taken 12 times. ✓ Branch 11 taken 6349 times. ✗ Branch 12 not taken. ✗ Branch 13 not taken. ✓ Branch 14 taken 11 times. ✓ Branch 15 taken 175 times. ✓ Branch 16 taken 36 times. ✓ Branch 17 taken 88 times. ✗ Branch 18 not taken. ✗ Branch 19 not taken. ✓ Branch 20 taken 5 times. ✓ Branch 21 taken 40 times. ✓ Branch 22 taken 38 times. ✓ Branch 23 taken 60 times. ✗ Branch 24 not taken. ✓ Branch 25 taken 1 time. ✓ Branch 26 taken 12 times. ✓ Branch 27 taken 1787 times. ✓ Branch 28 taken 38 times. ✓ Branch 29 taken 97 times. ✓ Branch 30 taken 2 times. ✓ Branch 31 taken 2 times. ✓ Branch 32 taken 5 times. ✓ Branch 33 taken 42 times. ✓ Branch 34 taken 40 times. ✓ Branch 35 taken 62 times.	32953x	if (tail_)
78	13/34 ✗ Branch 0 not taken. ✓ Branch 1 taken 16468 times. ✗ Branch 2 not taken. ✓ Branch 3 taken 5042 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 4 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 3 times. ✗ Branch 8 not taken. ✗ Branch 9 not taken. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✓ Branch 13 taken 11 times. ✗ Branch 14 not taken. ✓ Branch 15 taken 36 times. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✓ Branch 19 taken 5 times. ✗ Branch 20 not taken. ✓ Branch 21 taken 38 times. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✗ Branch 24 not taken. ✓ Branch 25 taken 12 times. ✗ Branch 26 not taken. ✓ Branch 27 taken 38 times. ✗ Branch 28 not taken. ✓ Branch 29 taken 2 times. ✗ Branch 30 not taken. ✓ Branch 31 taken 5 times. ✗ Branch 32 not taken. ✓ Branch 33 taken 40 times.	21726x	static_cast<node*>(tail_)->next_ = w;
79			else
80		11227x	head_ = w;
81		32953x	tail_ = w;
82		32953x	}
83
84		3x	void splice_back(intrusive_list& other) noexcept
85			{
86	2/2 ✓ Branch 0 taken 1 time. ✓ Branch 1 taken 2 times.	3x	if (other.empty())
87		1x	return;
88	2/2 ✓ Branch 0 taken 1 time. ✓ Branch 1 taken 1 time.	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		1x	}
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		3x	}
102
103		1664481x	T* pop_front() noexcept
104			{
105	19/34 ✓ Branch 0 taken 13 times. ✓ Branch 1 taken 1945 times. ✗ Branch 2 not taken. ✓ Branch 3 taken 1944 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 1944 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 1944 times. ✓ Branch 8 taken 6361 times. ✓ Branch 9 taken 1638666 times. ✗ Branch 10 not taken. ✓ Branch 11 taken 702 times. ✗ Branch 12 not taken. ✓ Branch 13 taken 702 times. ✗ Branch 14 not taken. ✓ Branch 15 taken 702 times. ✗ Branch 16 not taken. ✓ Branch 17 taken 702 times. ✗ Branch 18 not taken. ✓ Branch 19 taken 702 times. ✗ Branch 20 not taken. ✓ Branch 21 taken 702 times. ✗ Branch 22 not taken. ✓ Branch 23 taken 1242 times. ✗ Branch 24 not taken. ✓ Branch 25 taken 1242 times. ✗ Branch 26 not taken. ✓ Branch 27 taken 1242 times. ✗ Branch 28 not taken. ✓ Branch 29 taken 1242 times. ✗ Branch 30 not taken. ✓ Branch 31 taken 1242 times. ✗ Branch 32 not taken. ✓ Branch 33 taken 1242 times.	1664481x	if (!head_)
106		1658107x	return nullptr;
107		6374x	T* w = head_;
108	0/32 ✗ Branch 0 not taken. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✗ Branch 7 not taken. ✗ Branch 8 not taken. ✗ Branch 9 not taken. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✗ Branch 13 not taken. ✗ Branch 14 not taken. ✗ Branch 15 not taken. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✗ Branch 19 not taken. ✗ Branch 20 not taken. ✗ Branch 21 not taken. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✗ Branch 24 not taken. ✗ Branch 25 not taken. ✗ Branch 26 not taken. ✗ Branch 27 not taken. ✗ Branch 28 not taken. ✗ Branch 29 not taken. ✗ Branch 30 not taken. ✗ Branch 31 not taken.	6374x	head_ = static_cast<node*>(head_)->next_;
109	4/34 ✓ Branch 0 taken 7 times. ✓ Branch 1 taken 6 times. ✗ Branch 2 not taken. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✗ Branch 7 not taken. ✓ Branch 8 taken 12 times. ✓ Branch 9 taken 6349 times. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✗ Branch 13 not taken. ✗ Branch 14 not taken. ✗ Branch 15 not taken. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✗ Branch 19 not taken. ✗ Branch 20 not taken. ✗ Branch 21 not taken. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✗ Branch 24 not taken. ✗ Branch 25 not taken. ✗ Branch 26 not taken. ✗ Branch 27 not taken. ✗ Branch 28 not taken. ✗ Branch 29 not taken. ✗ Branch 30 not taken. ✗ Branch 31 not taken. ✗ Branch 32 not taken. ✗ Branch 33 not taken.	6374x	if (head_)
110	0/32 ✗ Branch 0 not taken. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✗ Branch 7 not taken. ✗ Branch 8 not taken. ✗ Branch 9 not taken. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✗ Branch 13 not taken. ✗ Branch 14 not taken. ✗ Branch 15 not taken. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✗ Branch 19 not taken. ✗ Branch 20 not taken. ✗ Branch 21 not taken. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✗ Branch 24 not taken. ✗ Branch 25 not taken. ✗ Branch 26 not taken. ✗ Branch 27 not taken. ✗ Branch 28 not taken. ✗ Branch 29 not taken. ✗ Branch 30 not taken. ✗ Branch 31 not taken.	19x	static_cast<node*>(head_)->prev_ = nullptr;
111			else
112		6355x	tail_ = nullptr;
113			// Defensive: clear stale linkage so remove() on a
114			// popped node cannot corrupt the list.
115	0/32 ✗ Branch 0 not taken. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✗ Branch 7 not taken. ✗ Branch 8 not taken. ✗ Branch 9 not taken. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✗ Branch 13 not taken. ✗ Branch 14 not taken. ✗ Branch 15 not taken. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✗ Branch 19 not taken. ✗ Branch 20 not taken. ✗ Branch 21 not taken. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✗ Branch 24 not taken. ✗ Branch 25 not taken. ✗ Branch 26 not taken. ✗ Branch 27 not taken. ✗ Branch 28 not taken. ✗ Branch 29 not taken. ✗ Branch 30 not taken. ✗ Branch 31 not taken.	6374x	auto* n = static_cast<node*>(w);
116		6374x	n->next_ = nullptr;
117		6374x	n->prev_ = nullptr;
118		6374x	return w;
119		1664481x	}
120
121		26577x	void remove(T* w) noexcept
122			{
123	15/34 ✗ Branch 0 not taken. ✓ Branch 1 taken 18440 times. ✗ Branch 2 not taken. ✓ Branch 3 taken 5399 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 95 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times. ✗ Branch 8 not taken. ✓ Branch 9 taken 96 times. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✓ Branch 13 taken 186 times. ✗ Branch 14 not taken. ✓ Branch 15 taken 124 times. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✓ Branch 19 taken 45 times. ✗ Branch 20 not taken. ✓ Branch 21 taken 98 times. ✗ Branch 22 not taken. ✓ Branch 23 taken 1 time. ✗ Branch 24 not taken. ✓ Branch 25 taken 1799 times. ✗ Branch 26 not taken. ✓ Branch 27 taken 135 times. ✗ Branch 28 not taken. ✓ Branch 29 taken 4 times. ✗ Branch 30 not taken. ✓ Branch 31 taken 47 times. ✗ Branch 32 not taken. ✓ Branch 33 taken 102 times.	26577x	auto* n = static_cast<node*>(w);
124			// Already detached — nothing to do.
125	62/136 ✓ Branch 0 taken 6236 times. ✓ Branch 1 taken 12208 times. ✓ Branch 2 taken 1974 times. ✓ Branch 3 taken 4262 times. ✓ Branch 4 taken 1 time. ✓ Branch 5 taken 1973 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 1 time. ✓ Branch 8 taken 2049 times. ✓ Branch 9 taken 3350 times. ✓ Branch 10 taken 357 times. ✓ Branch 11 taken 1692 times. ✗ Branch 12 not taken. ✓ Branch 13 taken 357 times. ✗ Branch 14 not taken. ✗ Branch 15 not taken. ✓ Branch 16 taken 95 times. ✗ Branch 17 not taken. ✓ Branch 18 taken 91 times. ✓ Branch 19 taken 4 times. ✗ Branch 20 not taken. ✓ Branch 21 taken 91 times. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✓ Branch 24 taken 2 times. ✗ Branch 25 not taken. ✓ Branch 26 taken 2 times. ✗ Branch 27 not taken. ✗ Branch 28 not taken. ✓ Branch 29 taken 2 times. ✗ Branch 30 not taken. ✗ Branch 31 not taken. ✓ Branch 32 taken 96 times. ✗ Branch 33 not taken. ✓ Branch 34 taken 93 times. ✓ Branch 35 taken 3 times. ✗ Branch 36 not taken. ✓ Branch 37 taken 93 times. ✗ Branch 38 not taken. ✗ Branch 39 not taken. ✗ Branch 40 not taken. ✗ Branch 41 not taken. ✗ Branch 42 not taken. ✗ Branch 43 not taken. ✗ Branch 44 not taken. ✗ Branch 45 not taken. ✗ Branch 46 not taken. ✗ Branch 47 not taken. ✓ Branch 48 taken 186 times. ✗ Branch 49 not taken. ✓ Branch 50 taken 175 times. ✓ Branch 51 taken 11 times. ✗ Branch 52 not taken. ✓ Branch 53 taken 175 times. ✗ Branch 54 not taken. ✗ Branch 55 not taken. ✓ Branch 56 taken 124 times. ✗ Branch 57 not taken. ✓ Branch 58 taken 88 times. ✓ Branch 59 taken 36 times. ✗ Branch 60 not taken. ✓ Branch 61 taken 88 times. ✗ Branch 62 not taken. ✗ Branch 63 not taken. ✗ Branch 64 not taken. ✗ Branch 65 not taken. ✗ Branch 66 not taken. ✗ Branch 67 not taken. ✗ Branch 68 not taken. ✗ Branch 69 not taken. ✗ Branch 70 not taken. ✗ Branch 71 not taken. ✓ Branch 72 taken 45 times. ✗ Branch 73 not taken. ✓ Branch 74 taken 40 times. ✓ Branch 75 taken 5 times. ✗ Branch 76 not taken. ✓ Branch 77 taken 40 times. ✗ Branch 78 not taken. ✗ Branch 79 not taken. ✓ Branch 80 taken 98 times. ✗ Branch 81 not taken. ✓ Branch 82 taken 60 times. ✓ Branch 83 taken 38 times. ✗ Branch 84 not taken. ✓ Branch 85 taken 60 times. ✗ Branch 86 not taken. ✗ Branch 87 not taken. ✓ Branch 88 taken 1 time. ✗ Branch 89 not taken. ✓ Branch 90 taken 1 time. ✗ Branch 91 not taken. ✗ Branch 92 not taken. ✓ Branch 93 taken 1 time. ✗ Branch 94 not taken. ✗ Branch 95 not taken. ✓ Branch 96 taken 1799 times. ✗ Branch 97 not taken. ✓ Branch 98 taken 1787 times. ✓ Branch 99 taken 12 times. ✗ Branch 100 not taken. ✓ Branch 101 taken 1787 times. ✗ Branch 102 not taken. ✗ Branch 103 not taken. ✓ Branch 104 taken 135 times. ✗ Branch 105 not taken. ✓ Branch 106 taken 97 times. ✓ Branch 107 taken 38 times. ✗ Branch 108 not taken. ✓ Branch 109 taken 97 times. ✗ Branch 110 not taken. ✗ Branch 111 not taken. ✓ Branch 112 taken 4 times. ✗ Branch 113 not taken. ✓ Branch 114 taken 2 times. ✓ Branch 115 taken 2 times. ✗ Branch 116 not taken. ✓ Branch 117 taken 2 times. ✗ Branch 118 not taken. ✗ Branch 119 not taken. ✓ Branch 120 taken 47 times. ✗ Branch 121 not taken. ✓ Branch 122 taken 42 times. ✓ Branch 123 taken 5 times. ✗ Branch 124 not taken. ✓ Branch 125 taken 42 times. ✗ Branch 126 not taken. ✗ Branch 127 not taken. ✓ Branch 128 taken 102 times. ✗ Branch 129 not taken. ✓ Branch 130 taken 62 times. ✓ Branch 131 taken 40 times. ✗ Branch 132 not taken. ✓ Branch 133 taken 62 times. ✗ Branch 134 not taken. ✗ Branch 135 not taken.	26577x	if (!n->next_ && !n->prev_ && head_ != w && tail_ != w)
126		1x	return;
127	28/34 ✓ Branch 0 taken 4611 times. ✓ Branch 1 taken 13832 times. ✓ Branch 2 taken 1732 times. ✓ Branch 3 taken 3667 times. ✓ Branch 4 taken 4 times. ✓ Branch 5 taken 91 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times. ✓ Branch 8 taken 3 times. ✓ Branch 9 taken 93 times. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✓ Branch 12 taken 11 times. ✓ Branch 13 taken 175 times. ✓ Branch 14 taken 36 times. ✓ Branch 15 taken 88 times. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✓ Branch 18 taken 5 times. ✓ Branch 19 taken 40 times. ✓ Branch 20 taken 38 times. ✓ Branch 21 taken 60 times. ✗ Branch 22 not taken. ✓ Branch 23 taken 1 time. ✓ Branch 24 taken 12 times. ✓ Branch 25 taken 1787 times. ✓ Branch 26 taken 38 times. ✓ Branch 27 taken 97 times. ✓ Branch 28 taken 2 times. ✓ Branch 29 taken 2 times. ✓ Branch 30 taken 5 times. ✓ Branch 31 taken 42 times. ✓ Branch 32 taken 40 times. ✓ Branch 33 taken 62 times.	26576x	if (n->prev_)
128	13/34 ✗ Branch 0 not taken. ✓ Branch 1 taken 4610 times. ✗ Branch 2 not taken. ✓ Branch 3 taken 1732 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 4 times. ✗ Branch 6 not taken. ✗ Branch 7 not taken. ✗ Branch 8 not taken. ✓ Branch 9 taken 3 times. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✓ Branch 13 taken 11 times. ✗ Branch 14 not taken. ✓ Branch 15 taken 36 times. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✓ Branch 19 taken 5 times. ✗ Branch 20 not taken. ✓ Branch 21 taken 38 times. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✗ Branch 24 not taken. ✓ Branch 25 taken 12 times. ✗ Branch 26 not taken. ✓ Branch 27 taken 38 times. ✗ Branch 28 not taken. ✓ Branch 29 taken 2 times. ✗ Branch 30 not taken. ✓ Branch 31 taken 5 times. ✗ Branch 32 not taken. ✓ Branch 33 taken 40 times.	6537x	static_cast<node*>(n->prev_)->next_ = n->next_;
129			else
130		20039x	head_ = n->next_;
131	17/34 ✓ Branch 0 taken 12208 times. ✓ Branch 1 taken 6235 times. ✓ Branch 2 taken 3350 times. ✓ Branch 3 taken 2049 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 95 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times. ✗ Branch 8 not taken. ✓ Branch 9 taken 96 times. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✓ Branch 13 taken 186 times. ✗ Branch 14 not taken. ✓ Branch 15 taken 124 times. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✓ Branch 19 taken 45 times. ✗ Branch 20 not taken. ✓ Branch 21 taken 98 times. ✗ Branch 22 not taken. ✓ Branch 23 taken 1 time. ✗ Branch 24 not taken. ✓ Branch 25 taken 1799 times. ✗ Branch 26 not taken. ✓ Branch 27 taken 135 times. ✗ Branch 28 not taken. ✓ Branch 29 taken 4 times. ✗ Branch 30 not taken. ✓ Branch 31 taken 47 times. ✗ Branch 32 not taken. ✓ Branch 33 taken 102 times.	26576x	if (n->next_)
132	2/34 ✗ Branch 0 not taken. ✓ Branch 1 taken 12206 times. ✗ Branch 2 not taken. ✓ Branch 3 taken 3350 times. ✗ Branch 4 not taken. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✗ Branch 7 not taken. ✗ Branch 8 not taken. ✗ Branch 9 not taken. ✗ Branch 10 not taken. ✗ Branch 11 not taken. ✗ Branch 12 not taken. ✗ Branch 13 not taken. ✗ Branch 14 not taken. ✗ Branch 15 not taken. ✗ Branch 16 not taken. ✗ Branch 17 not taken. ✗ Branch 18 not taken. ✗ Branch 19 not taken. ✗ Branch 20 not taken. ✗ Branch 21 not taken. ✗ Branch 22 not taken. ✗ Branch 23 not taken. ✗ Branch 24 not taken. ✗ Branch 25 not taken. ✗ Branch 26 not taken. ✗ Branch 27 not taken. ✗ Branch 28 not taken. ✗ Branch 29 not taken. ✗ Branch 30 not taken. ✗ Branch 31 not taken. ✗ Branch 32 not taken. ✗ Branch 33 not taken.	15558x	static_cast<node*>(n->next_)->prev_ = n->prev_;
133			else
134		11018x	tail_ = n->prev_;
135		26576x	n->next_ = nullptr;
136		26576x	n->prev_ = nullptr;
137		26577x	}
138
139			/// Invoke @p f for each element in the list.
140			template<class F>
141		274x	void for_each(F f)
142			{
143	2/4 ✓ Branch 0 taken 3 times. ✓ Branch 1 taken 274 times. ✗ Branch 2 not taken. ✗ Branch 3 not taken.	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		209631x	class node
171			{
172			friend class intrusive_queue;
173
174			private:
175		209631x	T* next_ = nullptr;
176			};
177
178			private:
179		1954x	T* head_ = nullptr;
180		1954x	T* tail_ = nullptr;
181
182			public:
183		5862x	intrusive_queue() = default;
184
185		2x	intrusive_queue(intrusive_queue&& other) noexcept
186		1x	: head_(other.head_)
187		1x	, tail_(other.tail_)
188		1x	{
189		1x	other.head_ = nullptr;
190		1x	other.tail_ = nullptr;
191		2x	}
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		2221x	bool empty() const noexcept
198			{
199		2221x	return head_ == nullptr;
200			}
201
202		401x	void push(T* w) noexcept
203			{
204		401x	w->next_ = nullptr;
205	2/2 ✓ Branch 0 taken 256 times. ✓ Branch 1 taken 145 times.	401x	if (tail_)
206		256x	tail_->next_ = w;
207			else
208		145x	head_ = w;
209		401x	tail_ = w;
210		401x	}
211
212		3x	void splice(intrusive_queue& other) noexcept
213			{
214	2/2 ✓ Branch 0 taken 1 time. ✓ Branch 1 taken 2 times.	3x	if (other.empty())
215		1x	return;
216	2/2 ✓ Branch 0 taken 1 time. ✓ Branch 1 taken 1 time.	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		3x	}
224
225		4305x	T* pop() noexcept
226			{
227	2/2 ✓ Branch 0 taken 401 times. ✓ Branch 1 taken 3904 times.	4305x	if (!head_)
228		3904x	return nullptr;
229		401x	T* w = head_;
230		401x	head_ = head_->next_;
231	2/2 ✓ Branch 0 taken 257 times. ✓ Branch 1 taken 144 times.	401x	if (!head_)
232		144x	tail_ = nullptr;
233			// Defensive: clear stale linkage on popped node.
234		401x	w->next_ = nullptr;
235		401x	return w;
236		4305x	}
237			};
238
239			} // namespace boost::corosio::detail
240
241			#endif
242