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
|
//===-- QueueList.cpp -------------------------------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#include "lldb/Target/Process.h"
#include "lldb/Target/Queue.h"
#include "lldb/Target/QueueList.h"
using namespace lldb;
using namespace lldb_private;
QueueList::QueueList(Process *process) : m_process(process), m_stop_id(0), m_queues(), m_mutex()
{
}
QueueList::~QueueList ()
{
Clear();
}
uint32_t
QueueList::GetSize ()
{
std::lock_guard<std::mutex> guard(m_mutex);
return m_queues.size();
}
lldb::QueueSP
QueueList::GetQueueAtIndex (uint32_t idx)
{
std::lock_guard<std::mutex> guard(m_mutex);
if (idx < m_queues.size())
{
return m_queues[idx];
}
else
{
return QueueSP();
}
}
void
QueueList::Clear ()
{
std::lock_guard<std::mutex> guard(m_mutex);
m_queues.clear();
}
void
QueueList::AddQueue (QueueSP queue_sp)
{
std::lock_guard<std::mutex> guard(m_mutex);
if (queue_sp.get ())
{
m_queues.push_back (queue_sp);
}
}
lldb::QueueSP
QueueList::FindQueueByID (lldb::queue_id_t qid)
{
QueueSP ret;
for (QueueSP queue_sp : Queues())
{
if (queue_sp->GetID() == qid)
{
ret = queue_sp;
break;
}
}
return ret;
}
lldb::QueueSP
QueueList::FindQueueByIndexID (uint32_t index_id)
{
QueueSP ret;
for (QueueSP queue_sp : Queues())
{
if (queue_sp->GetIndexID() == index_id)
{
ret = queue_sp;
break;
}
}
return ret;
}
std::mutex &
QueueList::GetMutex()
{
return m_mutex;
}
|
