blob: a6bbc50185a8f4ab45ced0fed307260821462f28 (
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
|
/* Thread 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/>. */
#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 (m_inf = inferior_list; m_inf != NULL; m_inf = m_inf->next)
if ((m_thr = m_inf->thread_list) != NULL)
return;
}
/* See thread-iter.h. */
void
all_threads_iterator::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;
for (; m_inf != NULL; m_inf = m_inf->next)
{
m_thr = m_inf->thread_list;
while (m_thr != NULL)
{
return;
start:
m_thr = m_thr->next;
}
}
}
/* See thread-iter.h. */
bool
all_matching_threads_iterator::m_inf_matches ()
{
return ((m_filter_target == nullptr
|| m_filter_target == m_inf->process_target ())
&& (m_filter_ptid == minus_one_ptid
|| m_filter_ptid.pid () == m_inf->pid));
}
/* 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),
m_filter_ptid (filter_ptid)
{
gdb_assert ((filter_target == nullptr && filter_ptid == minus_one_ptid)
|| filter_target->stratum () == process_stratum);
m_thr = nullptr;
for (m_inf = inferior_list; m_inf != NULL; m_inf = m_inf->next)
if (m_inf_matches ())
for (m_thr = m_inf->thread_list; m_thr != NULL; m_thr = m_thr->next)
if (m_thr->ptid.matches (m_filter_ptid))
return;
}
/* See thread-iter.h. */
void
all_matching_threads_iterator::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;
for (; m_inf != NULL; m_inf = m_inf->next)
if (m_inf_matches ())
{
m_thr = m_inf->thread_list;
while (m_thr != NULL)
{
if (m_thr->ptid.matches (m_filter_ptid))
return;
start:
m_thr = m_thr->next;
}
}
}
|
