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
|
/**
* @file _httprequestqueue.cpp
* @brief
*
* $LicenseInfo:firstyear=2012&license=viewerlgpl$
* Second Life Viewer Source Code
* Copyright (C) 2012, Linden Research, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation;
* version 2.1 of the License only.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Linden Research, Inc., 945 Battery Street, San Francisco, CA 94111 USA
* $/LicenseInfo$
*/
#include "_httprequestqueue.h"
#include "_httpoperation.h"
#include "_mutex.h"
using namespace LLCoreInt;
namespace LLCore
{
HttpRequestQueue * HttpRequestQueue::sInstance(NULL);
HttpRequestQueue::HttpRequestQueue()
: RefCounted(true)
{
}
HttpRequestQueue::~HttpRequestQueue()
{
while (! mQueue.empty())
{
HttpOperation * op = mQueue.back();
mQueue.pop_back();
op->release();
}
}
void HttpRequestQueue::init()
{
LLINT_ASSERT(! sInstance);
sInstance = new HttpRequestQueue();
}
void HttpRequestQueue::term()
{
if (sInstance)
{
sInstance->release();
sInstance = NULL;
}
}
void HttpRequestQueue::addOp(HttpOperation * op)
{
{
HttpScopedLock lock(mQueueMutex);
mQueue.push_back(op);
}
mQueueCV.notify_all();
}
HttpOperation * HttpRequestQueue::fetchOp(bool wait)
{
HttpOperation * result(NULL);
{
HttpScopedLock lock(mQueueMutex);
while (mQueue.empty())
{
if (! wait)
return NULL;
mQueueCV.wait(lock);
}
result = mQueue.front();
mQueue.erase(mQueue.begin());
}
// Caller also acquires the reference count
return result;
}
void HttpRequestQueue::fetchAll(bool wait, OpContainer & ops)
{
// Note: Should probably test whether we're empty or not here.
// A target passed in with entries is likely also carrying
// reference counts and we're going to leak something.
ops.clear();
{
HttpScopedLock lock(mQueueMutex);
while (mQueue.empty())
{
if (! wait)
return;
mQueueCV.wait(lock);
}
mQueue.swap(ops);
}
// Caller also acquires the reference counts on each op.
return;
}
} // end namespace LLCore
|
