2 * Copyright (c) 2015-2016 ARM Limited
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.
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.
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.
37 * Authors: Akash Bagdia
38 * David Guillen Fandos
41 #include "sim/clocked_object.hh"
43 #include "base/logging.hh"
44 #include "sim/power/power_model.hh"
46 ClockedObject::ClockedObject(const ClockedObjectParams
*p
) :
47 SimObject(p
), Clocked(*p
->clk_domain
),
48 _currPwrState(p
->default_p_state
),
52 // Register the power_model with the object
53 for (auto & power_model
: p
->power_model
)
54 power_model
->setClockedObject(this);
58 ClockedObject::serialize(CheckpointOut
&cp
) const
60 unsigned int currPwrState
= (unsigned int)_currPwrState
;
62 SERIALIZE_SCALAR(currPwrState
);
63 SERIALIZE_SCALAR(prvEvalTick
);
67 ClockedObject::unserialize(CheckpointIn
&cp
)
69 unsigned int currPwrState
;
71 UNSERIALIZE_SCALAR(currPwrState
);
72 UNSERIALIZE_SCALAR(prvEvalTick
);
74 _currPwrState
= Enums::PwrState(currPwrState
);
78 ClockedObject::pwrState(Enums::PwrState p
)
80 // Function should ideally be called only when there is a state change
81 if (_currPwrState
== p
) {
82 warn_once("ClockedObject: Already in the requested power state, " \
87 // No need to compute stats if in the same tick, update state though. This
88 // can happen in cases like a) during start of the simulation multiple
89 // state changes happens in init/startup phase, b) one takes a decision to
90 // migrate state but decides to reverts back to the original state in the
91 // same tick if other conditions are not met elsewhere.
92 // Any state change related stats would have been recorded on previous call
93 // to the pwrState() function.
94 if (prvEvalTick
== curTick() && curTick() != 0) {
95 warn("ClockedObject %s: More than one power state change request "\
96 "encountered within the same simulation tick %d",
102 // Record stats for previous state.
107 stats
.numPwrStateTransitions
++;
111 ClockedObject::computeStats()
113 // Calculate time elapsed from last (valid) state change
114 Tick elapsed_time
= curTick() - prvEvalTick
;
116 stats
.pwrStateResidencyTicks
[_currPwrState
] += elapsed_time
;
118 // Time spent in CLK_GATED state, this might change depending on
119 // transition to other low power states in respective simulation
121 if (_currPwrState
== Enums::PwrState::CLK_GATED
) {
122 stats
.pwrStateClkGateDist
.sample(elapsed_time
);
125 prvEvalTick
= curTick();
129 ClockedObject::pwrStateWeights() const
131 // Get residency stats
132 std::vector
<double> ret
;
133 Stats::VCounter residencies
;
134 stats
.pwrStateResidencyTicks
.value(residencies
);
136 // Account for current state too!
137 Tick elapsed_time
= curTick() - prvEvalTick
;
138 residencies
[_currPwrState
] += elapsed_time
;
140 ret
.resize(Enums::PwrState::Num_PwrState
);
141 for (unsigned i
= 0; i
< Enums::PwrState::Num_PwrState
; i
++)
142 ret
[i
] = residencies
[i
] / \
143 (stats
.pwrStateResidencyTicks
.total() + elapsed_time
);
149 ClockedObject::ClockedObjectStats::ClockedObjectStats(ClockedObject
&co
)
152 ADD_STAT(numPwrStateTransitions
,
153 "Number of power state transitions"),
154 ADD_STAT(pwrStateClkGateDist
,
155 "Distribution of time spent in the clock gated state"),
156 ADD_STAT(pwrStateResidencyTicks
,
157 "Cumulative time (in ticks) in various power states")
162 ClockedObject::ClockedObjectStats::regStats()
164 Stats::Group::regStats();
166 using namespace Stats
;
168 const ClockedObjectParams
*p
= clockedObject
.params();
170 numPwrStateTransitions
.flags(nozero
);
172 // Each sample is time in ticks
173 unsigned num_bins
= std::max(p
->p_state_clk_gate_bins
, 10U);
175 .init(p
->p_state_clk_gate_min
, p
->p_state_clk_gate_max
,
176 (p
->p_state_clk_gate_max
/ num_bins
))
177 .flags(pdf
| nozero
| nonan
)
180 pwrStateResidencyTicks
181 .init(Enums::PwrState::Num_PwrState
)
184 for (int i
= 0; i
< Enums::PwrState::Num_PwrState
; i
++) {
185 pwrStateResidencyTicks
.subname(i
, Enums::PwrStateStrings
[i
]);
188 numPwrStateTransitions
= 0;
192 ClockedObject::ClockedObjectStats::preDumpStats()
194 Stats::Group::preDumpStats();
197 * For every stats dump, the power state residency and other distribution
198 * stats should be computed just before the dump to ensure correct stats
199 * value being reported for current dump window. It avoids things like
200 * having any unreported time spent in a power state to be forwarded to the
201 * next dump window which might have rather unpleasant effects (like
202 * perturbing the distribution stats).
204 clockedObject
.computeStats();