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
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
|
///////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2012-2018 DreamWorks Animation LLC
//
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
//
// Redistributions of source code must retain the above copyright
// and license notice and the following restrictions and disclaimer.
//
// * Neither the name of DreamWorks Animation nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// IN NO EVENT SHALL THE COPYRIGHT HOLDERS' AND CONTRIBUTORS' AGGREGATE
// LIABILITY FOR ALL CLAIMS REGARDLESS OF THEIR BASIS EXCEED US$250.00.
//
///////////////////////////////////////////////////////////////////////////
#include <openvdb/Types.h>
#include <openvdb/tree/LeafManager.h>
#include <openvdb/util/CpuTimer.h>
#include "util.h" // for unittest_util::makeSphere()
#include <cppunit/extensions/HelperMacros.h>
class TestLeafManager: public CppUnit::TestFixture
{
public:
void setUp() override { openvdb::initialize(); }
void tearDown() override { openvdb::uninitialize(); }
CPPUNIT_TEST_SUITE(TestLeafManager);
CPPUNIT_TEST(testBasics);
CPPUNIT_TEST(testActiveLeafVoxelCount);
CPPUNIT_TEST(testForeach);
CPPUNIT_TEST(testReduce);
CPPUNIT_TEST_SUITE_END();
void testBasics();
void testActiveLeafVoxelCount();
void testForeach();
void testReduce();
};
CPPUNIT_TEST_SUITE_REGISTRATION(TestLeafManager);
void
TestLeafManager::testBasics()
{
using openvdb::CoordBBox;
using openvdb::Coord;
using openvdb::Vec3f;
using openvdb::FloatGrid;
using openvdb::FloatTree;
const Vec3f center(0.35f, 0.35f, 0.35f);
const float radius = 0.15f;
const int dim = 128, half_width = 5;
const float voxel_size = 1.0f/dim;
FloatGrid::Ptr grid = FloatGrid::create(/*background=*/half_width*voxel_size);
FloatTree& tree = grid->tree();
grid->setTransform(openvdb::math::Transform::createLinearTransform(/*voxel size=*/voxel_size));
unittest_util::makeSphere<FloatGrid>(
Coord(dim), center, radius, *grid, unittest_util::SPHERE_SPARSE_NARROW_BAND);
const size_t leafCount = tree.leafCount();
//grid->print(std::cout, 3);
{// test with no aux buffers
openvdb::tree::LeafManager<FloatTree> r(tree);
CPPUNIT_ASSERT_EQUAL(leafCount, r.leafCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBufferCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBuffersPerLeaf());
size_t n = 0;
for (FloatTree::LeafCIter iter=tree.cbeginLeaf(); iter; ++iter, ++n) {
CPPUNIT_ASSERT(r.leaf(n) == *iter);
CPPUNIT_ASSERT(r.getBuffer(n,0) == iter->buffer());
}
CPPUNIT_ASSERT_EQUAL(r.leafCount(), n);
CPPUNIT_ASSERT(!r.swapBuffer(0,0));
r.rebuildAuxBuffers(2);
CPPUNIT_ASSERT_EQUAL(leafCount, r.leafCount());
CPPUNIT_ASSERT_EQUAL(size_t(2), r.auxBuffersPerLeaf());
CPPUNIT_ASSERT_EQUAL(size_t(2*leafCount),r.auxBufferCount());
for (n=0; n<leafCount; ++n) {
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) == r.getBuffer(n,2));
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,2));
}
}
{// test with 2 aux buffers
openvdb::tree::LeafManager<FloatTree> r(tree, 2);
CPPUNIT_ASSERT_EQUAL(leafCount, r.leafCount());
CPPUNIT_ASSERT_EQUAL(size_t(2), r.auxBuffersPerLeaf());
CPPUNIT_ASSERT_EQUAL(size_t(2*leafCount),r.auxBufferCount());
size_t n = 0;
for (FloatTree::LeafCIter iter=tree.cbeginLeaf(); iter; ++iter, ++n) {
CPPUNIT_ASSERT(r.leaf(n) == *iter);
CPPUNIT_ASSERT(r.getBuffer(n,0) == iter->buffer());
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) == r.getBuffer(n,2));
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,2));
}
CPPUNIT_ASSERT_EQUAL(r.leafCount(), n);
for (n=0; n<leafCount; ++n) r.leaf(n).buffer().setValue(4,2.4f);
for (n=0; n<leafCount; ++n) {
CPPUNIT_ASSERT(r.getBuffer(n,0) != r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) == r.getBuffer(n,2));
CPPUNIT_ASSERT(r.getBuffer(n,0) != r.getBuffer(n,2));
}
r.syncAllBuffers();
for (n=0; n<leafCount; ++n) {
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) == r.getBuffer(n,2));
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,2));
}
for (n=0; n<leafCount; ++n) r.getBuffer(n,1).setValue(4,5.4f);
for (n=0; n<leafCount; ++n) {
CPPUNIT_ASSERT(r.getBuffer(n,0) != r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) != r.getBuffer(n,2));
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,2));
}
CPPUNIT_ASSERT(r.swapLeafBuffer(1));
for (n=0; n<leafCount; ++n) {
CPPUNIT_ASSERT(r.getBuffer(n,0) != r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) == r.getBuffer(n,2));
CPPUNIT_ASSERT(r.getBuffer(n,0) != r.getBuffer(n,2));
}
r.syncAuxBuffer(1);
for (n=0; n<leafCount; ++n) {
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) != r.getBuffer(n,2));
CPPUNIT_ASSERT(r.getBuffer(n,0) != r.getBuffer(n,2));
}
r.syncAuxBuffer(2);
for (n=0; n<leafCount; ++n) {
CPPUNIT_ASSERT(r.getBuffer(n,0) == r.getBuffer(n,1));
CPPUNIT_ASSERT(r.getBuffer(n,1) == r.getBuffer(n,2));
}
}
{// test with const tree (buffers are not swappable)
openvdb::tree::LeafManager<const FloatTree> r(tree);
for (size_t numAuxBuffers = 0; numAuxBuffers <= 2; ++numAuxBuffers += 2) {
r.rebuildAuxBuffers(numAuxBuffers);
CPPUNIT_ASSERT_EQUAL(leafCount, r.leafCount());
CPPUNIT_ASSERT_EQUAL(int(numAuxBuffers * leafCount), int(r.auxBufferCount()));
CPPUNIT_ASSERT_EQUAL(numAuxBuffers, r.auxBuffersPerLeaf());
size_t n = 0;
for (FloatTree::LeafCIter iter = tree.cbeginLeaf(); iter; ++iter, ++n) {
CPPUNIT_ASSERT(r.leaf(n) == *iter);
// Verify that each aux buffer was initialized with a copy of the leaf buffer.
for (size_t bufIdx = 0; bufIdx < numAuxBuffers; ++bufIdx) {
CPPUNIT_ASSERT(r.getBuffer(n, bufIdx) == iter->buffer());
}
}
CPPUNIT_ASSERT_EQUAL(r.leafCount(), n);
for (size_t i = 0; i < numAuxBuffers; ++i) {
for (size_t j = 0; j < numAuxBuffers; ++j) {
// Verify that swapping buffers with themselves and swapping
// leaf buffers with aux buffers have no effect.
const bool canSwap = (i != j && i != 0 && j != 0);
CPPUNIT_ASSERT_EQUAL(canSwap, r.swapBuffer(i, j));
}
}
}
}
}
void
TestLeafManager::testActiveLeafVoxelCount()
{
using namespace openvdb;
for (const Int32 dim: { 87, 1023, 1024, 2023 }) {
const CoordBBox denseBBox{Coord{0}, Coord{dim - 1}};
const auto size = denseBBox.volume();
// Create a large dense tree for testing but use a MaskTree to
// minimize the memory overhead
MaskTree tree{false};
tree.denseFill(denseBBox, true, true);
// Add some tiles, which should not contribute to the leaf voxel count.
tree.addTile(/*level=*/2, Coord{10000}, true, true);
tree.addTile(/*level=*/1, Coord{-10000}, true, true);
tree.addTile(/*level=*/1, Coord{20000}, false, false);
tree::LeafManager<MaskTree> mgr(tree);
// On a dual CPU Intel(R) Xeon(R) E5-2697 v3 @ 2.60GHz
// the speedup of LeafManager::activeLeafVoxelCount over
// Tree::activeLeafVoxelCount is ~15x (assuming a LeafManager already exists)
//openvdb::util::CpuTimer t("\nTree::activeVoxelCount");
const auto treeActiveVoxels = tree.activeVoxelCount();
//t.restart("\nTree::activeLeafVoxelCount");
const auto treeActiveLeafVoxels = tree.activeLeafVoxelCount();
//t.restart("\nLeafManager::activeLeafVoxelCount");
const auto mgrActiveLeafVoxels = mgr.activeLeafVoxelCount();//multi-threaded
//t.stop();
//std::cerr << "Old1 = " << treeActiveVoxels << " old2 = " << treeActiveLeafVoxels
// << " New = " << mgrActiveLeafVoxels << std::endl;
CPPUNIT_ASSERT(size < treeActiveVoxels);
CPPUNIT_ASSERT_EQUAL(size, treeActiveLeafVoxels);
CPPUNIT_ASSERT_EQUAL(size, mgrActiveLeafVoxels);
}
}
namespace {
struct ForeachOp
{
ForeachOp(float v) : mV(v) {}
template <typename T>
void operator()(T &leaf, size_t) const
{
for (typename T::ValueOnIter iter = leaf.beginValueOn(); iter; ++iter) {
if ( *iter > mV) iter.setValue( 2.0f );
}
}
const float mV;
};// ForeachOp
struct ReduceOp
{
ReduceOp(float v) : mV(v), mN(0) {}
ReduceOp(const ReduceOp &other) : mV(other.mV), mN(other.mN) {}
ReduceOp(const ReduceOp &other, tbb::split) : mV(other.mV), mN(0) {}
template <typename T>
void operator()(T &leaf, size_t)
{
for (typename T::ValueOnIter iter = leaf.beginValueOn(); iter; ++iter) {
if ( *iter > mV) ++mN;
}
}
void join(const ReduceOp &other) {mN += other.mN;}
const float mV;
openvdb::Index mN;
};// ReduceOp
}//unnamed namespace
void
TestLeafManager::testForeach()
{
using namespace openvdb;
FloatTree tree( 0.0f );
const int dim = int(FloatTree::LeafNodeType::dim());
const CoordBBox bbox1(Coord(0),Coord(dim-1));
const CoordBBox bbox2(Coord(dim),Coord(2*dim-1));
tree.fill( bbox1, -1.0f);
tree.fill( bbox2, 1.0f);
tree.voxelizeActiveTiles();
for (CoordBBox::Iterator<true> iter(bbox1); iter; ++iter) {
CPPUNIT_ASSERT_EQUAL( -1.0f, tree.getValue(*iter));
}
for (CoordBBox::Iterator<true> iter(bbox2); iter; ++iter) {
CPPUNIT_ASSERT_EQUAL( 1.0f, tree.getValue(*iter));
}
tree::LeafManager<FloatTree> r(tree);
CPPUNIT_ASSERT_EQUAL(size_t(2), r.leafCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBufferCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBuffersPerLeaf());
ForeachOp op(0.0f);
r.foreach(op);
CPPUNIT_ASSERT_EQUAL(size_t(2), r.leafCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBufferCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBuffersPerLeaf());
for (CoordBBox::Iterator<true> iter(bbox1); iter; ++iter) {
CPPUNIT_ASSERT_EQUAL( -1.0f, tree.getValue(*iter));
}
for (CoordBBox::Iterator<true> iter(bbox2); iter; ++iter) {
CPPUNIT_ASSERT_EQUAL( 2.0f, tree.getValue(*iter));
}
}
void
TestLeafManager::testReduce()
{
using namespace openvdb;
FloatTree tree( 0.0f );
const int dim = int(FloatTree::LeafNodeType::dim());
const CoordBBox bbox1(Coord(0),Coord(dim-1));
const CoordBBox bbox2(Coord(dim),Coord(2*dim-1));
tree.fill( bbox1, -1.0f);
tree.fill( bbox2, 1.0f);
tree.voxelizeActiveTiles();
for (CoordBBox::Iterator<true> iter(bbox1); iter; ++iter) {
CPPUNIT_ASSERT_EQUAL( -1.0f, tree.getValue(*iter));
}
for (CoordBBox::Iterator<true> iter(bbox2); iter; ++iter) {
CPPUNIT_ASSERT_EQUAL( 1.0f, tree.getValue(*iter));
}
tree::LeafManager<FloatTree> r(tree);
CPPUNIT_ASSERT_EQUAL(size_t(2), r.leafCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBufferCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBuffersPerLeaf());
ReduceOp op(0.0f);
r.reduce(op);
CPPUNIT_ASSERT_EQUAL(FloatTree::LeafNodeType::numValues(), op.mN);
CPPUNIT_ASSERT_EQUAL(size_t(2), r.leafCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBufferCount());
CPPUNIT_ASSERT_EQUAL(size_t(0), r.auxBuffersPerLeaf());
Index n = 0;
for (CoordBBox::Iterator<true> iter(bbox1); iter; ++iter) {
++n;
CPPUNIT_ASSERT_EQUAL( -1.0f, tree.getValue(*iter));
}
CPPUNIT_ASSERT_EQUAL(FloatTree::LeafNodeType::numValues(), n);
n = 0;
for (CoordBBox::Iterator<true> iter(bbox2); iter; ++iter) {
++n;
CPPUNIT_ASSERT_EQUAL( 1.0f, tree.getValue(*iter));
}
CPPUNIT_ASSERT_EQUAL(FloatTree::LeafNodeType::numValues(), n);
}
// Copyright (c) 2012-2018 DreamWorks Animation LLC
// All rights reserved. This software is distributed under the
// Mozilla Public License 2.0 ( http://www.mozilla.org/MPL/2.0/ )
|
