blob: e56ccd857b0ab47ff1e812d3cf146e4e58748853 (
plain)
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
|
/* Thread iterators and ranges for GDB, the GNU debugger.
Copyright (C) 2018-2021 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include "defs.h"
#include "gdbthread.h"
#include "inferior.h"
/* See thread-iter.h. */
all_threads_iterator::all_threads_iterator (begin_t)
{
/* Advance M_INF/M_THR to the first thread's position. */
for (inferior &inf : inferior_list)
{
auto thr_iter = inf.thread_list.begin ();
if (thr_iter != inf.thread_list.end ())
{
m_inf = &inf;
m_thr = &*thr_iter;
return;
}
}
m_inf = nullptr;
m_thr = nullptr;
}
/* See thread-iter.h. */
void
all_threads_iterator::advance ()
{
intrusive_list<inferior>::iterator inf_iter (m_inf);
intrusive_list<thread_info>::iterator thr_iter (m_thr);
/* The loop below is written in the natural way as-if we'd always
start at the beginning of the inferior list. This fast forwards
the algorithm to the actual current position. */
goto start;
for (; inf_iter != inferior_list.end (); ++inf_iter)
{
m_inf = &*inf_iter;
thr_iter = m_inf->thread_list.begin ();
while (thr_iter != m_inf->thread_list.end ())
{
m_thr = &*thr_iter;
return;
start:
++thr_iter;
}
}
m_thr = nullptr;
}
/* See thread-iter.h. */
bool
all_matching_threads_iterator::m_inf_matches ()
{
return (m_filter_target == nullptr
|| m_filter_target == m_inf->process_target ());
}
/* See thread-iter.h. */
all_matching_threads_iterator::all_matching_threads_iterator
(process_stratum_target *filter_target, ptid_t filter_ptid)
: m_filter_target (filter_target)
{
if (filter_ptid == minus_one_ptid)
{
/* Iterate on all threads of all inferiors, possibly filtering on
FILTER_TARGET. */
m_mode = mode::ALL_THREADS;
/* Seek the first thread of the first matching inferior. */
for (inferior &inf : inferior_list)
{
m_inf = &inf;
if (!m_inf_matches ()
|| inf.thread_list.empty ())
continue;
m_thr = &inf.thread_list.front ();
return;
}
}
else
{
gdb_assert (filter_target != nullptr);
if (filter_ptid.is_pid ())
{
/* Iterate on all threads of the given inferior. */
m_mode = mode::ALL_THREADS_OF_INFERIOR;
m_inf = find_inferior_pid (filter_target, filter_ptid.pid ());
if (m_inf != nullptr)
m_thr = &m_inf->thread_list.front ();
}
else
{
/* Iterate on a single thread. */
m_mode = mode::SINGLE_THREAD;
m_thr = find_thread_ptid (filter_target, filter_ptid);
}
}
}
/* See thread-iter.h. */
void
all_matching_threads_iterator::advance ()
{
switch (m_mode)
{
case mode::ALL_THREADS:
{
intrusive_list<inferior>::iterator inf_iter (m_inf);
intrusive_list<thread_info>::iterator thr_iter
= m_inf->thread_list.iterator_to (*m_thr);
/* The loop below is written in the natural way as-if we'd always
start at the beginning of the inferior list. This fast forwards
the algorithm to the actual current position. */
goto start;
for (; inf_iter != inferior_list.end (); ++inf_iter)
{
m_inf = &*inf_iter;
if (!m_inf_matches ())
continue;
thr_iter = m_inf->thread_list.begin ();
while (thr_iter != m_inf->thread_list.end ())
{
m_thr = &*thr_iter;
return;
start:
++thr_iter;
}
}
}
m_thr = nullptr;
break;
case mode::ALL_THREADS_OF_INFERIOR:
{
intrusive_list<thread_info>::iterator thr_iter
= m_inf->thread_list.iterator_to (*m_thr);
++thr_iter;
if (thr_iter != m_inf->thread_list.end ())
m_thr = &*thr_iter;
else
m_thr = nullptr;
break;
}
case mode::SINGLE_THREAD:
m_thr = nullptr;
break;
default:
gdb_assert_not_reached ("invalid mode value");
}
}
|
