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
|
/* Inferior iterators and ranges for GDB, the GNU debugger.
Copyright (C) 2018-2020 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/>. */
#ifndef INFERIOR_ITER_H
#define INFERIOR_ITER_H
#include "gdbsupport/filtered-iterator.h"
#include "gdbsupport/safe-iterator.h"
/* A forward iterator that iterates over all inferiors. */
class all_inferiors_iterator
{
public:
typedef all_inferiors_iterator self_type;
typedef struct inferior *value_type;
typedef struct inferior *&reference;
typedef struct inferior **pointer;
typedef std::forward_iterator_tag iterator_category;
typedef int difference_type;
/* Create an iterator pointing at HEAD. */
all_inferiors_iterator (process_stratum_target *proc_target, inferior *head)
: m_proc_target (proc_target)
{
/* Advance M_INF to the first inferior's position. */
for (m_inf = head; m_inf != NULL; m_inf = m_inf->next)
if (m_inf_matches ())
return;
}
/* Create a one-past-end iterator. */
all_inferiors_iterator ()
: m_proc_target (nullptr), m_inf (nullptr)
{}
all_inferiors_iterator &operator++ ()
{
advance ();
return *this;
}
inferior *operator* () const
{ return m_inf; }
bool operator!= (const all_inferiors_iterator &other) const
{ return m_inf != other.m_inf; }
private:
/* Advance to next inferior, skipping filtered inferiors. */
void advance ()
{
/* 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;
while (m_inf != NULL)
{
if (m_inf_matches ())
return;
start:
m_inf = m_inf->next;
}
}
bool m_inf_matches ()
{
return (m_proc_target == nullptr
|| m_proc_target == m_inf->process_target ());
}
process_stratum_target *m_proc_target;
inferior *m_inf;
};
/* Filter for filtered_iterator. Filters out exited inferiors. */
struct exited_inferior_filter
{
bool operator() (inferior *inf)
{
return inf->pid != 0;
}
};
/* Iterate over all non-exited inferiors. */
using all_non_exited_inferiors_iterator
= filtered_iterator<all_inferiors_iterator, exited_inferior_filter>;
/* A range adapter that makes it possible to iterate over all
inferiors with range-for. */
struct all_inferiors_range
{
all_inferiors_range (process_stratum_target *proc_target = nullptr)
: m_filter_target (proc_target)
{}
all_inferiors_iterator begin () const
{ return all_inferiors_iterator (m_filter_target, inferior_list); }
all_inferiors_iterator end () const
{ return all_inferiors_iterator (); }
private:
process_stratum_target *m_filter_target;
};
/* Iterate over all inferiors, safely. */
using all_inferiors_safe_iterator
= basic_safe_iterator<all_inferiors_iterator>;
/* A range adapter that makes it possible to iterate over all
inferiors with range-for "safely". I.e., it is safe to delete the
currently-iterated inferior. */
struct all_inferiors_safe_range
{
explicit all_inferiors_safe_range (process_stratum_target *filter_target)
: m_filter_target (filter_target)
{}
all_inferiors_safe_range ()
: m_filter_target (nullptr)
{}
all_inferiors_safe_iterator begin () const
{
return (all_inferiors_safe_iterator
(all_inferiors_iterator (m_filter_target, inferior_list)));
}
all_inferiors_safe_iterator end () const
{ return all_inferiors_safe_iterator (); }
private:
/* The filter. */
process_stratum_target *m_filter_target;
};
/* A range adapter that makes it possible to iterate over all
non-exited inferiors with range-for. */
struct all_non_exited_inferiors_range
{
explicit all_non_exited_inferiors_range (process_stratum_target *filter_target)
: m_filter_target (filter_target)
{}
all_non_exited_inferiors_range ()
: m_filter_target (nullptr)
{}
all_non_exited_inferiors_iterator begin () const
{ return all_non_exited_inferiors_iterator (m_filter_target, inferior_list); }
all_non_exited_inferiors_iterator end () const
{ return all_non_exited_inferiors_iterator (); }
private:
/* The filter. */
process_stratum_target *m_filter_target;
};
#endif /* !defined (INFERIOR_ITER_H) */
|
