-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathslice_output_manager.cpp
128 lines (114 loc) · 4.55 KB
/
slice_output_manager.cpp
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
/*
* SpectRE - A Spectral Code for Reheating
* Copyright (C) 2009-2010 Hal Finkel, Nathaniel Roth and Richard Easther
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED ``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 AUTHORS BE LIABLE FOR ANY DIRECT, 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.
*/
#include "slice_output_manager.hpp"
using namespace std;
template <typename R>
void slice_output_manager<R>::add_outputter(std::string varname, var_func vf)
{
outputters.push_back(
new slice_outputter<R>(fs, mp, ts, slicelength, varname, vf, sliceflt)
);
}
/**
* @page slices Binary Slices
* Binary slices are optionally generated for many different variables.
* Single-precision floating point format is used regardless of the precision used
* for computation. The "length" parameter indicates the length of the side of the
* grid from which the slice is taken, @b not the size of the output slice if
* "skip" is \> 0. "skip" is the number of grid points inbetween output points.
* If averaging is active, the skipped points are averaged over instead of actually
* being skipped.
*/
template <typename R>
void slice_output_manager<R>::output()
{
if (!outputters.size()) {
return;
}
gc.compute();
gpotc.compute(position, true);
for (typename vector< slice_outputter<R> * >::iterator it = outputters.begin();
it != outputters.end(); ++it) {
(*it)->begin(bin_idx);
}
phi.switch_state(position, true);
chi.switch_state(position, true);
phidot.switch_state(position, true);
chidot.switch_state(position, true);
for (int i = 0; i < (slicedim > 2 ? slicelength : 1); i += sliceskip) {
for (int j = 0; j < (slicedim > 1 ? slicelength : 1); j += sliceskip) {
for (int k = 0; k < slicelength; k += sliceskip) {
if (sliceaverage) {
// Average over all "skipped" points
for (int x = i; x < i + sliceskip && x < fs.n; ++x) {
for (int y = j; y < j + sliceskip && y < fs.n; ++y) {
for (int z = k; z < k + sliceskip && z < fs.n; ++z) {
int fdx = z + phi.ldl*(y + fs.n*x);
int idx = z + gc.phigradx.ldl*(y + fs.n*x);
for (typename vector< slice_outputter<R> * >::iterator it = outputters.begin();
it != outputters.end(); ++it) {
(*it)->accumulate(phi.data[fdx], chi.data[fdx],
phidot.data[fdx], chidot.data[fdx],
gc.phigradx.data[idx], gc.chigradx.data[idx],
gc.phigrady.data[idx], gc.chigrady.data[idx],
gc.phigradz.data[idx], gc.chigradz.data[idx],
gpotc.gpot.data[idx]);
}
}
}
}
for (typename vector< slice_outputter<R> * >::iterator it = outputters.begin();
it != outputters.end(); ++it) {
(*it)->advance();
}
}
else {
int fdx = k + phi.ldl*(j + fs.n*i);
int idx = k + gc.phigradx.ldl*(j + fs.n*i);
for (typename vector< slice_outputter<R> * >::iterator it = outputters.begin();
it != outputters.end(); ++it) {
(*it)->accumulate(phi.data[fdx], chi.data[fdx],
phidot.data[fdx], chidot.data[fdx],
gc.phigradx.data[idx], gc.chigradx.data[idx],
gc.phigrady.data[idx], gc.chigrady.data[idx],
gc.phigradz.data[idx], gc.chigradz.data[idx],
gpotc.gpot.data[idx]);
(*it)->advance();
}
}
for (typename vector< slice_outputter<R> * >::iterator it = outputters.begin();
it != outputters.end(); ++it) {
(*it)->flush();
}
}
}
}
++bin_idx;
}
// Explicit instantiations
template class slice_output_manager<double>;
#ifdef USE_LD
template class slice_output_manager<long double>;
#endif