1 //============================================================================
2 //  Copyright (c) Kitware, Inc.
3 //  All rights reserved.
4 //  See LICENSE.txt for details.
5 //
6 //  This software is distributed WITHOUT ANY WARRANTY; without even
7 //  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
8 //  PURPOSE.  See the above copyright notice for more information.
9 //============================================================================
10 // Copyright (c) 2018, The Regents of the University of California, through
11 // Lawrence Berkeley National Laboratory (subject to receipt of any required approvals
12 // from the U.S. Dept. of Energy).  All rights reserved.
13 //
14 // Redistribution and use in source and binary forms, with or without modification,
15 // are permitted provided that the following conditions are met:
16 //
17 // (1) Redistributions of source code must retain the above copyright notice, this
18 //     list of conditions and the following disclaimer.
19 //
20 // (2) Redistributions in binary form must reproduce the above copyright notice,
21 //     this list of conditions and the following disclaimer in the documentation
22 //     and/or other materials provided with the distribution.
23 //
24 // (3) Neither the name of the University of California, Lawrence Berkeley National
25 //     Laboratory, U.S. Dept. of Energy nor the names of its contributors may be
26 //     used to endorse or promote products derived from this software without
27 //     specific prior written permission.
28 //
29 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
30 // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
31 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
32 // IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
33 // INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
34 // BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
36 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
37 // OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
38 // OF THE POSSIBILITY OF SUCH DAMAGE.
39 //
40 //=============================================================================
41 //
42 //  This code is an extension of the algorithm presented in the paper:
43 //  Parallel Peak Pruning for Scalable SMP Contour Tree Computation.
44 //  Hamish Carr, Gunther Weber, Christopher Sewell, and James Ahrens.
45 //  Proceedings of the IEEE Symposium on Large Data Analysis and Visualization
46 //  (LDAV), October 2016, Baltimore, Maryland.
47 //
48 //  The PPP2 algorithm and software were jointly developed by
49 //  Hamish Carr (University of Leeds), Gunther H. Weber (LBNL), and
50 //  Oliver Ruebel (LBNL)
51 //==============================================================================
52 
53 #include "TestingContourTreeUniformDistributedFilter.h"
54 
55 namespace
56 {
57 using vtkm::filter::testing::contourtree_uniform_distributed::TestContourTreeFile;
58 using vtkm::filter::testing::contourtree_uniform_distributed::
59   TestContourTreeUniformDistributed5x6x7;
60 using vtkm::filter::testing::contourtree_uniform_distributed::TestContourTreeUniformDistributed8x9;
61 
62 class TestContourTreeUniformDistributedFilterMPI
63 {
64 public:
operator ()() const65   void operator()() const
66   {
67     using vtkm::cont::testing::Testing;
68     auto comm = vtkm::cont::EnvironmentTracker::GetCommunicator();
69     auto rank = comm.rank();
70     auto size = comm.size();
71     // TestContourTreeUniformDistributed8x9(3);
72     TestContourTreeUniformDistributed8x9(4, rank, size);
73     TestContourTreeUniformDistributed8x9(8, rank, size);
74     TestContourTreeUniformDistributed8x9(16, rank, size);
75 #if 0
76     TestContourTreeFile(Testing::DataPath("rectilinear/vanc.vtk"),
77                         "var",
78                         Testing::DataPath("rectilinear/vanc.ct_txt"),
79                         4,
80                         false,
81                         rank,
82                         size);
83     TestContourTreeFile(Testing::DataPath("rectilinear/vanc.vtk"),
84                         "var",
85                         Testing::DataPath("rectilinear/vanc.ct_txt"),
86                         8,
87                         false,
88                         rank,
89                         size);
90     TestContourTreeFile(Testing::DataPath("rectilinear/vanc.vtk"),
91                         "var",
92                         Testing::DataPath("rectilinear/vanc.ct_txt"),
93                         16,
94                         false,
95                         rank,
96                         size);
97 #endif
98     TestContourTreeUniformDistributed5x6x7(4, false, rank, size);
99     TestContourTreeUniformDistributed5x6x7(8, false, rank, size);
100     TestContourTreeUniformDistributed5x6x7(16, false, rank, size);
101     TestContourTreeUniformDistributed5x6x7(4, true, rank, size);
102     TestContourTreeUniformDistributed5x6x7(8, true, rank, size);
103     TestContourTreeUniformDistributed5x6x7(16, true, rank, size);
104   }
105 };
106 }
107 
UnitTestContourTreeUniformDistributedFilterMPI(int argc,char * argv[])108 int UnitTestContourTreeUniformDistributedFilterMPI(int argc, char* argv[])
109 {
110   return vtkm::cont::testing::Testing::Run(
111     TestContourTreeUniformDistributedFilterMPI(), argc, argv);
112 }
113