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) 2012-2014, TU Delft
* Copyright (c) 2012-2014, TU Eindhoven
* Copyright (c) 2012-2014, TU Kaiserslautern
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. 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.
*
* 3. Neither the name of the copyright holder 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
* HOLDER 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.
*
* Authors: Omar Naji
*
*/
#include "TraceParser.h"
#include "CommandAnalysis.h"
#include "CmdScheduler.h"
using namespace Data;
using namespace std;
TraceParser::TraceParser(const MemorySpecification& memSpec) :
counters(memSpec)
{
}
Data::MemCommand TraceParser::parseLine(std::string line)
{
MemCommand memcmd(MemCommand::UNINITIALIZED, 0, 0);
istringstream linestream(line);
string item;
int64_t item_val;
unsigned itemnum = 0;
while (getline(linestream, item, ',')) {
if (itemnum == 0) {
stringstream timestamp(item);
timestamp >> item_val;
memcmd.setTime(item_val);
} else if (itemnum == 1) {
item_val = MemCommand::getTypeFromName(item);
memcmd.setType(static_cast<MemCommand::cmds>(item_val));
} else if (itemnum == 2) {
stringstream bank(item);
bank >> item_val;
memcmd.setBank(static_cast<unsigned>(item_val));
}
itemnum++;
}
return memcmd;
} // TraceParser::parseLine
void TraceParser::parseFile(MemorySpecification memSpec, std::ifstream& trace,
int window, int grouping, int interleaving, int burst,
int powerdown, int trans)
{
ifstream pwr_trace;
counters = CommandAnalysis(memSpec);
int nCommands = 0;
bool lastupdate = false;
if (trans) {
cmdScheduler cmdsched;
cmdsched.transTranslation(memSpec, trace, grouping, interleaving, burst, powerdown);
pwr_trace.open("commands.trace", ifstream::in);
std::string line;
while (getline(pwr_trace, line)) {
MemCommand cmdline = parseLine(line);
cmd_list.push_back(cmdline);
nCommands++;
if (nCommands == window) {
counters.getCommands(cmd_list, lastupdate);
nCommands = 0;
cmd_list.clear();
}
}
lastupdate = true;
counters.getCommands(cmd_list, lastupdate);
cmd_list.clear();
pwr_trace.close();
} else {
std::string line;
while (getline(trace, line)) {
MemCommand cmdline = parseLine(line);
cmd_list.push_back(cmdline);
nCommands++;
if (nCommands == window) {
counters.getCommands(cmd_list, lastupdate);
nCommands = 0;
cmd_list.clear();
}
}
lastupdate = true;
counters.getCommands(cmd_list, lastupdate);
cmd_list.clear();
}
counters.clear();
trace.close();
} // TraceParser::parseFile
|
