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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
/*
* Copyright (c) 2003 The Regents of The University of Michigan
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution;
* neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/types.h>
#include <sys/time.h>
#include <time.h>
#include <iostream>
#include "sim/sim_time.hh"
using namespace std;
namespace Time
{
struct _timeval
{
timeval tv;
};
double
convert(const timeval &tv)
{
return (double)tv.tv_sec + (double)tv.tv_usec / 1000000.0;
}
Start::Start()
{
start = new _timeval;
::gettimeofday(&start->tv, NULL);
}
Start::~Start()
{
delete start;
}
const timeval &
Start::get() const
{
return start->tv;
}
double
Start::operator()() const
{
return convert(get());
}
Now::Now()
: now(0)
{
}
Now::~Now()
{
if (now)
delete now;
}
const timeval &
Now::get() const
{
if (!now)
now = new _timeval;
::gettimeofday(&now->tv, NULL);
return now->tv;
}
double
Now::operator()() const
{
return convert(get());
}
Elapsed::Elapsed()
: elapsed(0)
{}
Elapsed::~Elapsed()
{
if (elapsed)
delete elapsed;
}
const timeval &
Elapsed::get() const
{
if (!elapsed)
elapsed = new _timeval;
timersub(&now.get(), &start.get(), &elapsed->tv);
return elapsed->tv;
}
double
Elapsed::operator()() const
{
return convert(get());
}
Start start;
Now now;
Elapsed elapsed;
ostream &
operator<<(ostream &out, const Start &start)
{
out << ::ctime((const time_t *)&start.get().tv_sec);
return out;
}
ostream &
operator<<(ostream &out, const Now &now)
{
out << ::ctime((const time_t *)&now.get().tv_sec);
return out;
}
ostream &
operator<<(ostream &out, const Elapsed &elapsed)
{
out << ::ctime((const time_t *)&elapsed.get().tv_sec);
return out;
}
}
|
