summaryrefslogtreecommitdiffstats
path: root/libdimension/bench/prtree.c
blob: 7c38990d6b51b810cb0600b7b0ffafd35cf1483b (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
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
/*************************************************************************
 * Copyright (C) 2009-2011 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 "../prtree.c"
#include "../threads.c"
#include "../progress.c"
#include <sandglass.h>
#include <stdlib.h>

static bool
dmnsn_fake_intersection_fn(const dmnsn_object *object, dmnsn_line line,
                           dmnsn_intersection *intersection)
{
  intersection->t = (object->bounding_box.min.z - line.x0.z)/line.n.z;
  intersection->normal = dmnsn_x;
  return true;
}

static bool
dmnsn_fake_inside_fn(const dmnsn_object *object, dmnsn_vector point)
{
  return true;
}

static void
dmnsn_randomize_bounding_box(dmnsn_object *object)
{
  dmnsn_vector a, b;

  a.x = 2.0*((double)rand())/RAND_MAX - 1.0;
  a.y = 2.0*((double)rand())/RAND_MAX - 1.0;
  a.z = 2.0*((double)rand())/RAND_MAX - 1.0;

  b.x = 2.0*((double)rand())/RAND_MAX - 1.0;
  b.y = 2.0*((double)rand())/RAND_MAX - 1.0;
  b.z = 2.0*((double)rand())/RAND_MAX - 1.0;

  object->bounding_box.min = dmnsn_vector_min(a, b);
  object->bounding_box.max = dmnsn_vector_max(a, b);
}

static dmnsn_object *
dmnsn_new_fake_object(void)
{
  dmnsn_object *object = dmnsn_new_object();
  /* Generate a bounding box in  (-1, -1, -1), (1, 1, 1) */
  dmnsn_randomize_bounding_box(object);
  object->intersection_fn = dmnsn_fake_intersection_fn;
  object->inside_fn       = dmnsn_fake_inside_fn;
  return object;
}

int
main(void)
{
  const size_t nobjects = 10000;

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

  dmnsn_array *objects = dmnsn_new_array(sizeof(dmnsn_object *));
  dmnsn_texture *texture = dmnsn_new_texture();
  texture->pigment = dmnsn_new_pigment();
  for (size_t i = 0; i < nobjects; ++i) {
    dmnsn_object *object = dmnsn_new_fake_object();
    object->texture = texture;
    DMNSN_INCREF(object->texture);
    dmnsn_initialize_object(object);
    dmnsn_array_push(objects, &object);
  }

  dmnsn_prtree *tree;
  sandglass_bench_noprecache(&sandglass, {
    tree = dmnsn_new_prtree(objects);
  });
  printf("dmnsn_new_prtree(): %ld\n", sandglass.grains);

  /* dmnsn_prtree_intersection() */
  dmnsn_line ray = dmnsn_new_line(
    dmnsn_new_vector( 1.0,  1.0, -2.0),
    dmnsn_new_vector(-0.5, -0.5,  1.0)
  );
  dmnsn_intersection intersection;

  sandglass_bench_fine(&sandglass, {
    dmnsn_prtree_intersection(tree, ray, &intersection, true);
  });
  printf("dmnsn_prtree_intersection(): %ld\n", sandglass.grains);

  /* dmnsn_prtree_inside() */
  sandglass_bench_fine(&sandglass, {
    dmnsn_prtree_inside(tree, dmnsn_zero);
  });
  printf("dmnsn_prtree_inside(): %ld\n", sandglass.grains);

  /* Cleanup */
  dmnsn_delete_prtree(tree);
  DMNSN_ARRAY_FOREACH (dmnsn_object **, object, objects) {
    dmnsn_delete_object(*object);
  }
  dmnsn_delete_texture(texture);
  dmnsn_delete_array(objects);
  return EXIT_SUCCESS;
}