Debian Codegraph @

bench/mesh/topology/cpp/main.cpp

raw
1 // Copyright (C) 2010 Anders Logg
2 //
3 // This file is part of DOLFIN.
4 //
5 // DOLFIN is free software: you can redistribute it and/or modify
6 // it under the terms of the GNU Lesser General Public License as published by
7 // the Free Software Foundation, either version 3 of the License, or
8 // (at your option) any later version.
9 //
10 // DOLFIN is distributed in the hope that it will be useful,
11 // but WITHOUT ANY WARRANTY; without even the implied warranty of
12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 // GNU Lesser General Public License for more details.
14 //
15 // You should have received a copy of the GNU Lesser General Public License
16 // along with DOLFIN. If not, see <http://www.gnu.org/licenses/>.
17 //
18 // First added: 2010-11-25
19 // Last changed: 2012-12-12
20
21 #include <dolfin.h>
22 #include <dolfin/log/LogLevel.h>
23
24 using namespace dolfin;
25
26 #define NUM_REPS 5
27 #define SIZE 64
28
29 // Use for quick testing
30 //#define NUM_REPS 2
31 //#define SIZE 32
32
33 int main(int argc, char* argv[])
34 {
35 info("Creating cell-cell connectivity for unit cube of size %d x %d x %d (%d repetitions)",
36 SIZE, SIZE, SIZE, NUM_REPS);
37
38 set_log_level(DBG);
39
40 parameters.parse(argc, argv);
41
42 UnitCubeMesh mesh(SIZE, SIZE, SIZE);
43 const int D = mesh.topology().dim();
44
45 // Clear timing (if there is some)
46 { Timer t("Compute connectivity 3-3"); }
47 timing("Compute connectivity 3-3", TimingClear::clear);
48
49 for (int i = 0; i < NUM_REPS; i++)
50 {
51 mesh.clean();
52 mesh.init(D, D);
53 dolfin::cout << "Created unit cube: " << mesh << dolfin::endl;
54 }
55
56 // Report timings
57 list_timings(TimingClear::keep,
58 { TimingType::wall, TimingType::user, TimingType::system });
59
60 // Report timing
61 const auto t = timing("Compute connectivity 3-3", TimingClear::clear);
62 info("BENCH %g", std::get<1>(t));
63
64 return 0;
65 }