-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathresult.cpp
More file actions
148 lines (130 loc) · 3.42 KB
/
result.cpp
File metadata and controls
148 lines (130 loc) · 3.42 KB
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
// Copyright (C) 2016 Anders Lövgren, BMC Computing Department, Uppsala University
//
// This program 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.
//
// This program 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/>.
//
// --------------------------------------------------------------------------
// Author: Anders Lövgren <anders.lovgren@bmc.uu.se>
//
// File: result.cpp
// Date: 4 Feb 2016
// --------------------------------------------------------------------------
//
#include "result.hpp"
#include <utility>
#include <limits>
Result::Result()
{
}
//
// Compute mean read/write values based on all accounted transfer sizes.
//
void Result::Compute()
{
if(stats.find(0) == stats.end()) {
stats.insert(std::make_pair(0, Transfer()));
}
for(Iterator it = stats.begin(); it != stats.end(); ++it) {
if(it->first == 0) {
continue;
}
Transfer &ta = stats[0];
Transfer &tc = it->second;
ta.read.Merge(tc.read);
ta.write.Merge(tc.write);
}
}
//
// Merge this object into result.
//
void Result::Merge(Result &result) const
{
for(ConstIterator it = stats.begin(); it != stats.end(); ++it) {
// TODO: fix me
}
}
//
// Account an request record in this object.
//
void Result::Account(int size, Result::What what, const Result::Record &record)
{
if(what == Read) {
record.Merge(stats[size].read);
} else {
record.Merge(stats[size].write);
}
}
//
// Return const reference to all statistics.
//
const Result::Statistics & Result::GetStatistics() const
{
return stats;
}
//
// Return const reference to statistics of size. Use 0 to
// get avarage.
//
const Result::Transfer & Result::GetStatistics(int size) const
{
return stats.find(size)->second;
}
//
// Return const reference to statistics of size and type.
// Use 0 to get avarage.
//
const Result::Record &Result::GetStatistics(int size, Result::What what) const
{
if(what == Read) {
return stats.find(size)->second.read;
} else {
return stats.find(size)->second.write;
}
}
//
// Return true if statistics exist.
//
bool Result::HasStatistics(int size) const
{
return stats.find(size) != stats.end();
}
//
// Return true if statistics exist.
//
bool Result::HasStatistics(int size, Result::What) const
{
return stats.find(size) != stats.end(); // read/write always defined.
}
Result::Record::Record()
: tmin(std::numeric_limits<int>::max()),
tmax(std::numeric_limits<int>::min()),
time(0), count(0), failed(0), bytes(0), mean(0)
{
}
//
// Merge this record into argument record.
//
void Result::Record::Merge(Result::Record &record) const
{
if(tmin < record.tmin) {
record.tmin = tmin;
}
if(tmax > record.tmax) {
record.tmax = tmax;
}
record.time += time;
record.count += count;
record.failed += failed;
record.bytes += bytes;
record.mean = record.time / record.count;
}