Chris@82: /*
Chris@82:  * Copyright (c) 2001 Matteo Frigo
Chris@82:  * Copyright (c) 2001 Massachusetts Institute of Technology
Chris@82:  *
Chris@82:  * This program is free software; you can redistribute it and/or modify
Chris@82:  * it under the terms of the GNU General Public License as published by
Chris@82:  * the Free Software Foundation; either version 2 of the License, or
Chris@82:  * (at your option) any later version.
Chris@82:  *
Chris@82:  * This program is distributed in the hope that it will be useful,
Chris@82:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@82:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@82:  * GNU General Public License for more details.
Chris@82:  *
Chris@82:  * You should have received a copy of the GNU General Public License
Chris@82:  * along with this program; if not, write to the Free Software
Chris@82:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@82:  *
Chris@82:  */
Chris@82: 
Chris@82: 
Chris@82: #include "libbench2/bench.h"
Chris@82: 
Chris@82: int no_speed_allocation = 0; /* 1 to not allocate array data in speed() */
Chris@82: 
Chris@82: void speed(const char *param, int setup_only)
Chris@82: {
Chris@82:      double *t;
Chris@82:      int iter = 0, k;
Chris@82:      bench_problem *p;
Chris@82:      double tmin, y;
Chris@82: 
Chris@82:      t = (double *) bench_malloc(time_repeat * sizeof(double));
Chris@82: 
Chris@82:      for (k = 0; k < time_repeat; ++k) 
Chris@82: 	  t[k] = 0;
Chris@82: 
Chris@82:      p = problem_parse(param);
Chris@82:      BENCH_ASSERT(can_do(p));
Chris@82:      if (!no_speed_allocation) {
Chris@82: 	  problem_alloc(p);
Chris@82: 	  problem_zero(p);
Chris@82:      }
Chris@82: 
Chris@82:      timer_start(LIBBENCH_TIMER);
Chris@82:      setup(p);
Chris@82:      p->setup_time = bench_cost_postprocess(timer_stop(LIBBENCH_TIMER));
Chris@82: 
Chris@82:      /* reset the input to zero again, because the planner in paranoid
Chris@82: 	mode sets it to random values, thus making the benchmark
Chris@82: 	diverge. */
Chris@82:      if (!no_speed_allocation) 
Chris@82: 	  problem_zero(p);
Chris@82:      
Chris@82:      if (setup_only)
Chris@82: 	  goto done;
Chris@82: 
Chris@82:  start_over:
Chris@82:      for (iter = 1; iter < (1<<30); iter *= 2) {
Chris@82: 	  tmin = 1.0e20;
Chris@82: 	  for (k = 0; k < time_repeat; ++k) {
Chris@82: 	       timer_start(LIBBENCH_TIMER);
Chris@82: 	       doit(iter, p);
Chris@82: 	       y = bench_cost_postprocess(timer_stop(LIBBENCH_TIMER));
Chris@82: 	       if (y < 0) /* yes, it happens */
Chris@82: 		    goto start_over;
Chris@82: 	       t[k] = y;
Chris@82: 	       if (y < tmin)
Chris@82: 		    tmin = y;
Chris@82: 	  }
Chris@82: 	  
Chris@82: 	  if (tmin >= time_min)
Chris@82: 	       goto done;
Chris@82:      }
Chris@82: 
Chris@82:      goto start_over; /* this also happens */
Chris@82: 
Chris@82:  done:
Chris@82:      done(p);
Chris@82: 
Chris@82:      if (iter) 
Chris@82: 	  for (k = 0; k < time_repeat; ++k) 
Chris@82: 	       t[k] /= iter;
Chris@82:      else
Chris@82: 	  for (k = 0; k < time_repeat; ++k) 
Chris@82: 	       t[k] = 0;
Chris@82: 
Chris@82:      report(p, t, time_repeat);
Chris@82: 
Chris@82:      if (!no_speed_allocation)
Chris@82: 	  problem_destroy(p);
Chris@82:      bench_free(t);
Chris@82:      return;
Chris@82: }