1/*
2 * Copyright (c) 2012-2014 ARM Limited
3 * All rights reserved.
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
13 *
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions are
16 * met: redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer;
18 * redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution;
21 * neither the name of the copyright holders nor the names of its
22 * contributors may be used to endorse or promote products derived from
23 * this software without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
26 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
27 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
28 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
29 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
30 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
31 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
32 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
33 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
34 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
35 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 *
37 * Authors: Dam Sunwoo
38 * Curtis Dunham
39 */
40
41#include "base/output.hh"
42#include "cpu/simple/probes/simpoint.hh"
43
44SimPoint::SimPoint(const SimPointParams *p)
45 : ProbeListenerObject(p),
46 intervalSize(p->interval),
47 intervalCount(0),
48 intervalDrift(0),
49 simpointStream(NULL),
50 currentBBV(0, 0),
51 currentBBVInstCount(0)
52{
53 simpointStream = simout.create(p->profile_file, false);
54 if (!simpointStream)
55 fatal("unable to open SimPoint profile_file");
56}
57
58SimPoint::~SimPoint()
59{
60 simout.close(simpointStream);
61}
62
63void
64SimPoint::init()
65{}
66
67void
68SimPoint::regProbeListeners()
69{
70 typedef ProbeListenerArg<SimPoint, std::pair<SimpleThread*,StaticInstPtr>>
71 SimPointListener;
72 listeners.push_back(new SimPointListener(this, "Commit",
73 &SimPoint::profile));
74}
75
76void
77SimPoint::profile(const std::pair<SimpleThread*, StaticInstPtr>& p)
78{
79 SimpleThread* thread = p.first;
| 1/*
2 * Copyright (c) 2012-2014 ARM Limited
3 * All rights reserved.
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
13 *
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions are
16 * met: redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer;
18 * redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution;
21 * neither the name of the copyright holders nor the names of its
22 * contributors may be used to endorse or promote products derived from
23 * this software without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
26 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
27 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
28 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
29 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
30 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
31 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
32 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
33 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
34 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
35 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 *
37 * Authors: Dam Sunwoo
38 * Curtis Dunham
39 */
40
41#include "base/output.hh"
42#include "cpu/simple/probes/simpoint.hh"
43
44SimPoint::SimPoint(const SimPointParams *p)
45 : ProbeListenerObject(p),
46 intervalSize(p->interval),
47 intervalCount(0),
48 intervalDrift(0),
49 simpointStream(NULL),
50 currentBBV(0, 0),
51 currentBBVInstCount(0)
52{
53 simpointStream = simout.create(p->profile_file, false);
54 if (!simpointStream)
55 fatal("unable to open SimPoint profile_file");
56}
57
58SimPoint::~SimPoint()
59{
60 simout.close(simpointStream);
61}
62
63void
64SimPoint::init()
65{}
66
67void
68SimPoint::regProbeListeners()
69{
70 typedef ProbeListenerArg<SimPoint, std::pair<SimpleThread*,StaticInstPtr>>
71 SimPointListener;
72 listeners.push_back(new SimPointListener(this, "Commit",
73 &SimPoint::profile));
74}
75
76void
77SimPoint::profile(const std::pair<SimpleThread*, StaticInstPtr>& p)
78{
79 SimpleThread* thread = p.first;
|
81
82 if (!currentBBVInstCount)
83 currentBBV.first = thread->pcState().instAddr();
84
85 ++intervalCount;
86 ++currentBBVInstCount;
87
88 // If inst is control inst, assume end of basic block.
89 if (inst->isControl()) {
90 currentBBV.second = thread->pcState().instAddr();
91
92 auto map_itr = bbMap.find(currentBBV);
93 if (map_itr == bbMap.end()){
94 // If a new (previously unseen) basic block is found,
95 // add a new unique id, record num of insts and insert into bbMap.
96 BBInfo info;
97 info.id = bbMap.size() + 1;
98 info.insts = currentBBVInstCount;
99 info.count = currentBBVInstCount;
100 bbMap.insert(std::make_pair(currentBBV, info));
101 } else {
102 // If basic block is seen before, just increment the count by the
103 // number of insts in basic block.
104 BBInfo& info = map_itr->second;
105 info.count += currentBBVInstCount;
106 }
107 currentBBVInstCount = 0;
108
109 // Reached end of interval if the sum of the current inst count
110 // (intervalCount) and the excessive inst count from the previous
111 // interval (intervalDrift) is greater than/equal to the interval size.
112 if (intervalCount + intervalDrift >= intervalSize) {
113 // summarize interval and display BBV info
114 std::vector<std::pair<uint64_t, uint64_t> > counts;
115 for (auto map_itr = bbMap.begin(); map_itr != bbMap.end();
116 ++map_itr) {
117 BBInfo& info = map_itr->second;
118 if (info.count != 0) {
119 counts.push_back(std::make_pair(info.id, info.count));
120 info.count = 0;
121 }
122 }
123 std::sort(counts.begin(), counts.end());
124
125 // Print output BBV info
126 *simpointStream << "T";
127 for (auto cnt_itr = counts.begin(); cnt_itr != counts.end();
128 ++cnt_itr) {
129 *simpointStream << ":" << cnt_itr->first
130 << ":" << cnt_itr->second << " ";
131 }
132 *simpointStream << "\n";
133
134 intervalDrift = (intervalCount + intervalDrift) - intervalSize;
135 intervalCount = 0;
136 }
137 }
138}
139
140/** SimPoint SimObject */
141SimPoint*
142SimPointParams::create()
143{
144 return new SimPoint(this);
145}
| 81
82 if (!currentBBVInstCount)
83 currentBBV.first = thread->pcState().instAddr();
84
85 ++intervalCount;
86 ++currentBBVInstCount;
87
88 // If inst is control inst, assume end of basic block.
89 if (inst->isControl()) {
90 currentBBV.second = thread->pcState().instAddr();
91
92 auto map_itr = bbMap.find(currentBBV);
93 if (map_itr == bbMap.end()){
94 // If a new (previously unseen) basic block is found,
95 // add a new unique id, record num of insts and insert into bbMap.
96 BBInfo info;
97 info.id = bbMap.size() + 1;
98 info.insts = currentBBVInstCount;
99 info.count = currentBBVInstCount;
100 bbMap.insert(std::make_pair(currentBBV, info));
101 } else {
102 // If basic block is seen before, just increment the count by the
103 // number of insts in basic block.
104 BBInfo& info = map_itr->second;
105 info.count += currentBBVInstCount;
106 }
107 currentBBVInstCount = 0;
108
109 // Reached end of interval if the sum of the current inst count
110 // (intervalCount) and the excessive inst count from the previous
111 // interval (intervalDrift) is greater than/equal to the interval size.
112 if (intervalCount + intervalDrift >= intervalSize) {
113 // summarize interval and display BBV info
114 std::vector<std::pair<uint64_t, uint64_t> > counts;
115 for (auto map_itr = bbMap.begin(); map_itr != bbMap.end();
116 ++map_itr) {
117 BBInfo& info = map_itr->second;
118 if (info.count != 0) {
119 counts.push_back(std::make_pair(info.id, info.count));
120 info.count = 0;
121 }
122 }
123 std::sort(counts.begin(), counts.end());
124
125 // Print output BBV info
126 *simpointStream << "T";
127 for (auto cnt_itr = counts.begin(); cnt_itr != counts.end();
128 ++cnt_itr) {
129 *simpointStream << ":" << cnt_itr->first
130 << ":" << cnt_itr->second << " ";
131 }
132 *simpointStream << "\n";
133
134 intervalDrift = (intervalCount + intervalDrift) - intervalSize;
135 intervalCount = 0;
136 }
137 }
138}
139
140/** SimPoint SimObject */
141SimPoint*
142SimPointParams::create()
143{
144 return new SimPoint(this);
145}
|