File: timeTest.cpp

package info (click to toggle)
gtsam 4.2.0%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 46,108 kB
  • sloc: cpp: 127,191; python: 14,312; xml: 8,442; makefile: 252; sh: 119; ansic: 101
file content (74 lines) | stat: -rw-r--r-- 1,505 bytes parent folder | download | duplicates (2)
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
/* ----------------------------------------------------------------------------

 * GTSAM Copyright 2010, Georgia Tech Research Corporation,
 * Atlanta, Georgia 30332-0415
 * All Rights Reserved
 * Authors: Frank Dellaert, et al. (see THANKS for the full author list)

 * See LICENSE for the license information

 * -------------------------------------------------------------------------- */

/**
 * @file    timing.h
 * @author  Richard Roberts (extracted from Michael Kaess' timing functions)
 * @date    Oct 5, 2010
 */

#include <gtsam/base/timing.h>

using namespace gtsam;

int main(int argc, char *argv[]) {

  // FIXME: ticPush_ does not exist
  {
    gttic_(top1);
    gttic_(sub1);
    gttic_(sub_sub_a);
    gttoc_(sub_sub_a);
    gttoc_(sub1);
    gttic_(sub2);
    gttic_(sub_sub_b);
    gttoc_(sub_sub_b);
    gttoc_(sub2);
    gttoc_(top1);
  }

  {
    gttic_(top2);
    gttic_(sub1);
    gttic_(sub_sub_a);
    gttoc_(sub_sub_a);
    gttoc_(sub1);
    gttic_(sub2);
    gttic_(sub_sub_b);
    gttoc_(sub_sub_b);
    gttoc_(sub2);
    gttoc_(top2);
  }

  gttic_(top3);
  for(size_t i=0; i<1000000; ++i) {
    gttic_(overhead);
    gttic_(sub_overhead);
    gttoc_(sub_overhead);
    gttoc_(overhead);
    tictoc_finishedIteration_();
  }
  gttoc_(top3);

  gttic_(top4);
  for(size_t i=0; i<1000000; ++i) {
    gttic(overhead_a);
    gttic(overhead_b);
    gttoc(overhead_b);
    gttoc(overhead_a);
    tictoc_finishedIteration();
  }
  gttoc_(top4);

  tictoc_print_();

  return 0;
}