| 1/*
2 * Copyright (c) 2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
|
1
2#include "base/timebuf.hh"
3#include "cpu/activity.hh"
4
5ActivityRecorder::ActivityRecorder(int num_stages, int longest_latency,
6 int activity)
7 : activityBuffer(longest_latency, 0), longestLatency(longest_latency),
8 activityCount(activity), numStages(num_stages)
9{
10 stageActive = new bool[numStages];
11 memset(stageActive, 0, numStages);
12}
13
14void
15ActivityRecorder::activity()
16{
| 28
29#include "base/timebuf.hh"
30#include "cpu/activity.hh"
31
32ActivityRecorder::ActivityRecorder(int num_stages, int longest_latency,
33 int activity)
34 : activityBuffer(longest_latency, 0), longestLatency(longest_latency),
35 activityCount(activity), numStages(num_stages)
36{
37 stageActive = new bool[numStages];
38 memset(stageActive, 0, numStages);
39}
40
41void
42ActivityRecorder::activity()
43{
|
| 44 // If we've already recorded activity for this cycle, we don't
45 // want to increment the count any more.
|
17 if (activityBuffer[0]) {
18 return;
19 }
20
21 activityBuffer[0] = true;
22
23 ++activityCount;
24
25 DPRINTF(Activity, "Activity: %i\n", activityCount);
26}
27
28void
29ActivityRecorder::advance()
30{
| 46 if (activityBuffer[0]) {
47 return;
48 }
49
50 activityBuffer[0] = true;
51
52 ++activityCount;
53
54 DPRINTF(Activity, "Activity: %i\n", activityCount);
55}
56
57void
58ActivityRecorder::advance()
59{
|
| 60 // If there's a 1 in the slot that is about to be erased once the
61 // time buffer advances, then decrement the activityCount.
|
31 if (activityBuffer[-longestLatency]) {
32 --activityCount;
33
34 assert(activityCount >= 0);
35
36 DPRINTF(Activity, "Activity: %i\n", activityCount);
37
38 if (activityCount == 0) {
39 DPRINTF(Activity, "No activity left!\n");
40 }
41 }
42
43 activityBuffer.advance();
44}
45
46void
47ActivityRecorder::activateStage(const int idx)
48{
| 62 if (activityBuffer[-longestLatency]) {
63 --activityCount;
64
65 assert(activityCount >= 0);
66
67 DPRINTF(Activity, "Activity: %i\n", activityCount);
68
69 if (activityCount == 0) {
70 DPRINTF(Activity, "No activity left!\n");
71 }
72 }
73
74 activityBuffer.advance();
75}
76
77void
78ActivityRecorder::activateStage(const int idx)
79{
|
| 80 // Increment the activity count if this stage wasn't already active.
|
49 if (!stageActive[idx]) {
50 ++activityCount;
51
52 stageActive[idx] = true;
53
54 DPRINTF(Activity, "Activity: %i\n", activityCount);
55 } else {
56 DPRINTF(Activity, "Stage %i already active.\n", idx);
57 }
58
59// assert(activityCount < longestLatency + numStages + 1);
60}
61
62void
63ActivityRecorder::deactivateStage(const int idx)
64{
| 81 if (!stageActive[idx]) {
82 ++activityCount;
83
84 stageActive[idx] = true;
85
86 DPRINTF(Activity, "Activity: %i\n", activityCount);
87 } else {
88 DPRINTF(Activity, "Stage %i already active.\n", idx);
89 }
90
91// assert(activityCount < longestLatency + numStages + 1);
92}
93
94void
95ActivityRecorder::deactivateStage(const int idx)
96{
|
| 97 // Decrement the activity count if this stage was active.
|
65 if (stageActive[idx]) {
66 --activityCount;
67
68 stageActive[idx] = false;
69
70 DPRINTF(Activity, "Activity: %i\n", activityCount);
71 } else {
72 DPRINTF(Activity, "Stage %i already inactive.\n", idx);
--- 50 unchanged lines hidden --- | 98 if (stageActive[idx]) {
99 --activityCount;
100
101 stageActive[idx] = false;
102
103 DPRINTF(Activity, "Activity: %i\n", activityCount);
104 } else {
105 DPRINTF(Activity, "Stage %i already inactive.\n", idx);
--- 50 unchanged lines hidden --- |