aboutsummaryrefslogtreecommitdiff
path: root/Carpet/LoopControl
diff options
context:
space:
mode:
authorErik Schnetter <schnetter@cct.lsu.edu>2011-07-03 21:23:04 -0400
committerBarry Wardell <barry.wardell@gmail.com>2011-12-14 19:54:45 +0000
commit290ad91295f63a173a7dfa2d372aa5d9eb0e36d1 (patch)
tree6450f89763e60d83f8cbc7898e4df03f354a0617 /Carpet/LoopControl
parent472f7e4555bb1b7a673129421c0668ca93951562 (diff)
LoopControl: Disable some unused code
Diffstat (limited to 'Carpet/LoopControl')
-rw-r--r--Carpet/LoopControl/src/lc_hill.c11
1 files changed, 7 insertions, 4 deletions
diff --git a/Carpet/LoopControl/src/lc_hill.c b/Carpet/LoopControl/src/lc_hill.c
index 362cf8e62..805fe58f0 100644
--- a/Carpet/LoopControl/src/lc_hill.c
+++ b/Carpet/LoopControl/src/lc_hill.c
@@ -49,6 +49,8 @@ time_for_stattime (lc_stattime_t const * restrict const lt)
return lt->time_calc_sum / lt->time_count;
}
+#if 0
+/* unused */
static
double
time_for_state (lc_statset_t const * restrict const ls,
@@ -58,6 +60,7 @@ time_for_state (lc_statset_t const * restrict const ls,
assert (lt);
return time_for_stattime (lt);
}
+#endif
@@ -167,7 +170,7 @@ lc_hill_init (lc_statset_t * restrict const ls,
/* Look which neighbours exist. */
typedef enum { nb_boundary, nb_missing, nb_exists } neighbour_t;
- neighbour_t neighbours[3][2];
+ /* neighbour_t neighbours[3][2]; */
lc_state_t nb_state[3][2];
double nb_time[3][2];
lc_state_t * nb_nonexist_state[6];
@@ -182,15 +185,15 @@ lc_hill_init (lc_statset_t * restrict const ls,
if (nb_state[d][f].tiling[d] < 0 ||
nb_state[d][f].tiling[d] >= ntilings)
{
- neighbours[d][f] = nb_boundary;
+ /* neighbours[d][f] = nb_boundary; */
} else {
lc_stattime_t const * restrict const nb_lt =
lc_stattime_find (ls, & nb_state[d][f]);
if (! nb_lt) {
- neighbours[d][f] = nb_missing;
+ /* neighbours[d][f] = nb_missing; */
nb_nonexist_state[num_nonexist_states++] = & nb_state[d][f];
} else {
- neighbours[d][f] = nb_exists;
+ /* neighbours[d][f] = nb_exists; */
nb_time[d][f] = time_for_stattime (nb_lt);
if (! nb_minimum_time || nb_time[d][f] < minimum_time) {
nb_minimum_time = & nb_state[d][f];