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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
|
/**
* @file llvolumemgr.cpp
*
* $LicenseInfo:firstyear=2002&license=viewergpl$
*
* Copyright (c) 2002-2007, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlife.com/developers/opensource/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at http://secondlife.com/developers/opensource/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
* $/LicenseInfo$
*/
#include "linden_common.h"
#include "llvolumemgr.h"
#include "llvolume.h"
//#define DEBUG_VOLUME
LLVolumeMgr* gVolumeMgr = 0;
const F32 BASE_THRESHOLD = 0.03f;
//static
F32 LLVolumeLODGroup::mDetailThresholds[NUM_LODS] = {BASE_THRESHOLD,
2*BASE_THRESHOLD,
8*BASE_THRESHOLD,
100*BASE_THRESHOLD};
//static
F32 LLVolumeLODGroup::mDetailScales[NUM_LODS] = {1.f, 1.5f, 2.5f, 4.f};
//============================================================================
//static
void LLVolumeMgr::initClass()
{
gVolumeMgr = new LLVolumeMgr();
}
//static
BOOL LLVolumeMgr::cleanupClass()
{
BOOL res = FALSE;
if (gVolumeMgr) {
res = gVolumeMgr->cleanup();
delete gVolumeMgr;
gVolumeMgr = 0;
}
return res;
}
//============================================================================
LLVolumeMgr::LLVolumeMgr()
{
mDataMutex = new LLMutex(gAPRPoolp);
// mNumVolumes = 0;
}
LLVolumeMgr::~LLVolumeMgr()
{
cleanup();
delete mDataMutex;
}
BOOL LLVolumeMgr::cleanup()
{
#ifdef DEBUG_VOLUME
{
lldebugs << "LLVolumeMgr::cleanup()" << llendl;
}
#endif
BOOL no_refs = TRUE;
mDataMutex->lock();
for (volume_lod_group_map_t::iterator iter = mVolumeLODGroups.begin(),
end = mVolumeLODGroups.end();
iter != end; iter++)
{
LLVolumeLODGroup *volgroupp = iter->second;
if (volgroupp->getNumRefs() != 1)
{
llwarns << "Volume group " << volgroupp << " has "
<< volgroupp->getNumRefs() << " remaining refs" << llendl;
llwarns << volgroupp->getParams() << llendl;
no_refs = FALSE;
}
volgroupp->unref();// this );
}
mVolumeLODGroups.clear();
mDataMutex->unlock();
return no_refs;
}
LLVolume *LLVolumeMgr::getVolume(const LLVolumeParams &volume_params, const S32 detail)
{
LLVolumeLODGroup* volgroupp;
mDataMutex->lock();
volume_lod_group_map_t::iterator iter = mVolumeLODGroups.find(&volume_params);
if( iter == mVolumeLODGroups.end() )
{
volgroupp = new LLVolumeLODGroup(volume_params);
const LLVolumeParams* params = &(volgroupp->getParams());
mVolumeLODGroups[params] = volgroupp;
volgroupp->ref(); // initial reference
}
else
{
volgroupp = iter->second;
}
volgroupp->ref();// this );
mDataMutex->unlock();
// mNumVolumes++;
#ifdef DEBUG_VOLUME
{
lldebugs << "LLVolumeMgr::getVolume() " << (*this) << llendl;
}
#endif
return volgroupp->getLOD(detail);
}
void LLVolumeMgr::cleanupVolume(LLVolume *volumep)
{
if (volumep->isUnique())
{
// TomY: Don't need to manage this volume. It is a unique instance.
return;
}
LLVolumeParams* params = (LLVolumeParams*) &(volumep->getParams());
mDataMutex->lock();
volume_lod_group_map_t::iterator iter = mVolumeLODGroups.find(params);
if( iter == mVolumeLODGroups.end() )
{
llerrs << "Warning! Tried to cleanup unknown volume type! " << *params << llendl;
mDataMutex->unlock();
return;
}
else
{
LLVolumeLODGroup* volgroupp = iter->second;
volgroupp->derefLOD(volumep);
volgroupp->unref();// this );
if (volgroupp->getNumRefs() == 1)
{
mVolumeLODGroups.erase(params);
volgroupp->unref();// this );
}
// mNumVolumes--;
}
mDataMutex->unlock();
#ifdef DEBUG_VOLUME
{
lldebugs << "LLVolumeMgr::cleanupVolume() " << (*this) << llendl;
}
#endif
}
void LLVolumeMgr::dump()
{
F32 avg = 0.f;
mDataMutex->lock();
for (volume_lod_group_map_t::iterator iter = mVolumeLODGroups.begin(),
end = mVolumeLODGroups.end();
iter != end; iter++)
{
LLVolumeLODGroup *volgroupp = iter->second;
avg += volgroupp->dump();
}
int count = (int)mVolumeLODGroups.size();
avg = count ? avg / (F32)count : 0.0f;
mDataMutex->unlock();
llinfos << "Average usage of LODs " << avg << llendl;
}
std::ostream& operator<<(std::ostream& s, const LLVolumeMgr& volume_mgr)
{
s << "{ numLODgroups=" << volume_mgr.mVolumeLODGroups.size() << ", ";
S32 total_refs = 0;
volume_mgr.mDataMutex->lock();
LLVolumeMgr::volume_lod_group_map_iter iter = volume_mgr.mVolumeLODGroups.begin();
LLVolumeMgr::volume_lod_group_map_iter end = volume_mgr.mVolumeLODGroups.end();
for ( ; iter != end; ++iter)
{
LLVolumeLODGroup *volgroupp = iter->second;
total_refs += volgroupp->getNumRefs();
s << ", " << (*volgroupp);
}
volume_mgr.mDataMutex->unlock();
s << ", total_refs=" << total_refs << " }";
return s;
}
LLVolumeLODGroup::LLVolumeLODGroup(const LLVolumeParams ¶ms)
{
S32 i;
mParams = params;
for (i = 0; i < NUM_LODS; i++)
{
mLODRefs[i] = 0;
mVolumeLODs[i] = NULL;
mAccessCount[i] = 0;
}
}
LLVolumeLODGroup::~LLVolumeLODGroup()
{
S32 i;
for (i = 0; i < NUM_LODS; i++)
{
delete mVolumeLODs[i];
mVolumeLODs[i] = NULL;
}
}
LLVolume * LLVolumeLODGroup::getLOD(const S32 detail)
{
llassert(detail >=0 && detail < NUM_LODS);
mAccessCount[detail]++;
mLODRefs[detail]++;
if (!mVolumeLODs[detail])
{
mVolumeLODs[detail] = new LLVolume(mParams, mDetailScales[detail]);
}
return mVolumeLODs[detail];
}
BOOL LLVolumeLODGroup::derefLOD(LLVolume *volumep)
{
S32 i;
for (i = 0; i < NUM_LODS; i++)
{
if (mVolumeLODs[i] == volumep)
{
mLODRefs[i]--;
if (!mLODRefs[i])
{
mVolumeLODs[i] = NULL;
}
return TRUE;
}
}
llerrs << "Deref of non-matching LOD in volume LOD group" << llendl;
return FALSE;
}
S32 LLVolumeLODGroup::getDetailFromTan(const F32 tan_angle)
{
S32 i = 0;
while (i < (NUM_LODS - 1))
{
if (tan_angle <= mDetailThresholds[i])
{
return i;
}
i++;
}
return NUM_LODS - 1;
}
F32 LLVolumeLODGroup::getVolumeScaleFromDetail(const S32 detail)
{
return mDetailScales[detail];
}
F32 LLVolumeLODGroup::dump()
{
char dump_str[255]; /* Flawfinder: ignore */
F32 usage = 0.f;
for (S32 i = 0; i < NUM_LODS; i++)
{
if (mAccessCount[i] > 0)
{
usage += 1.f;
}
}
usage = usage / (F32)NUM_LODS;
snprintf(dump_str, sizeof(dump_str), "%.3f %d %d %d %d", usage, mAccessCount[0], mAccessCount[1], mAccessCount[2], mAccessCount[3]); /* Flawfinder: ignore */
llinfos << dump_str << llendl;
return usage;
}
std::ostream& operator<<(std::ostream& s, const LLVolumeLODGroup& volgroup)
{
s << "{ numRefs=" << volgroup.getNumRefs();
s << ", mParams=" << volgroup.mParams;
s << " }";
return s;
}
|