summaryrefslogtreecommitdiffstats
path: root/libdimension/bench/future.c
blob: 0e3acc6e808bee9db0ad51dc0ccd78234a2ed7a2 (plain)
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
/*************************************************************************
 * Copyright (C) 2013-2014 Tavian Barnes <tavianator@tavianator.com>     *
 *                                                                       *
 * This file is part of The Dimension Benchmark Suite.                   *
 *                                                                       *
 * The Dimension Benchmark Suite is free software; you can redistribute  *
 * it and/or modify it under the terms of the GNU General Public License *
 * as published by the Free Software Foundation; either version 3 of the *
 * License, or (at your option) any later version.                       *
 *                                                                       *
 * The Dimension Benchmark Suite is distributed in the hope that it will *
 * be useful, but WITHOUT ANY WARRANTY; without even the implied         *
 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See *
 * the GNU General Public License for more details.                      *
 *                                                                       *
 * You should have received a copy of the GNU General Public License     *
 * along with this program.  If not, see <http://www.gnu.org/licenses/>. *
 *************************************************************************/

#include "../platform.c"
#include "../future.c"
#include "../threads.c"
#include <sandglass.h>
#include <stdlib.h>

#define ITERATIONS 100000

static int
dmnsn_bench_future(void *ptr, unsigned int thread, unsigned int nthreads)
{
  dmnsn_future *future = (dmnsn_future *)ptr;
  for (int i = 0; i < ITERATIONS; ++i) {
    dmnsn_future_increment(future);
  }
  return 0;
}

static int
dmnsn_bench_thread(void *ptr)
{
  dmnsn_future *future = (dmnsn_future *)ptr;
  size_t nthreads = 2*dmnsn_ncpus();
  dmnsn_future_set_total(future, nthreads*ITERATIONS);

  sandglass_t sandglass;
  if (sandglass_init_monotonic(&sandglass, SANDGLASS_CPUTIME) != 0) {
    perror("sandglass_create()");
    return EXIT_FAILURE;
  }

  /* Benchmark the increment operation. */
  sandglass_bench_fine(&sandglass, dmnsn_future_increment(future));
  printf("dmnsn_future_increment(): %ld\n", sandglass.grains);

  /* Reset the progress. */
  dmnsn_lock_mutex(&future->mutex);
    future->progress = 0;
  dmnsn_unlock_mutex(&future->mutex);

  /* Now run a bunch of increments concurrently. */
  return dmnsn_execute_concurrently(future, &dmnsn_bench_future, future,
                                    nthreads);
}

int
main(void)
{
  dmnsn_timer timer1, timer2;
  dmnsn_future *future = dmnsn_new_future();

  dmnsn_timer_start(&timer1);
  dmnsn_timer_start(&timer2);

  dmnsn_new_thread(future, &dmnsn_bench_thread, future);

  dmnsn_future_wait(future, 0.5);
  dmnsn_timer_stop(&timer1);
  printf(" 50%%: " DMNSN_TIMER_FORMAT "\n", DMNSN_TIMER_PRINTF(timer1));

  dmnsn_future_join(future);
  dmnsn_timer_stop(&timer2);
  printf("100%%: " DMNSN_TIMER_FORMAT "\n", DMNSN_TIMER_PRINTF(timer2));
}