activity.cc revision 9086
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 * 28 * Authors: Kevin Lim 29 */ 30 31#include <string> 32 33#include "cpu/activity.hh" 34#include "cpu/timebuf.hh" 35#include "debug/Activity.hh" 36 37using namespace std; 38 39ActivityRecorder::ActivityRecorder(const string &name, int num_stages, 40 int longest_latency, int activity) 41 : _name(name), activityBuffer(longest_latency, 0), 42 longestLatency(longest_latency), activityCount(activity), 43 numStages(num_stages) 44{ 45 stageActive = new bool[numStages]; 46 std::memset(stageActive, 0, numStages); 47} 48 49ActivityRecorder::~ActivityRecorder() 50{ 51 delete[] stageActive; 52} 53 54void 55ActivityRecorder::activity() 56{ 57 // If we've already recorded activity for this cycle, we don't 58 // want to increment the count any more. 59 if (activityBuffer[0]) { 60 return; 61 } 62 63 activityBuffer[0] = true; 64 65 ++activityCount; 66 67 DPRINTF(Activity, "Activity: %i\n", activityCount); 68} 69 70void 71ActivityRecorder::advance() 72{ 73 // If there's a 1 in the slot that is about to be erased once the 74 // time buffer advances, then decrement the activityCount. 75 if (activityBuffer[-longestLatency]) { 76 --activityCount; 77 78 assert(activityCount >= 0); 79 80 DPRINTF(Activity, "Activity: %i\n", activityCount); 81 82 if (activityCount == 0) { 83 DPRINTF(Activity, "No activity left!\n"); 84 } 85 } 86 87 activityBuffer.advance(); 88} 89 90void 91ActivityRecorder::activateStage(const int idx) 92{ 93 // Increment the activity count if this stage wasn't already active. 94 if (!stageActive[idx]) { 95 ++activityCount; 96 97 stageActive[idx] = true; 98 99 DPRINTF(Activity, "Activity: %i\n", activityCount); 100 } else { 101 DPRINTF(Activity, "Stage %i already active.\n", idx); 102 } 103 104// assert(activityCount < longestLatency + numStages + 1); 105} 106 107void 108ActivityRecorder::deactivateStage(const int idx) 109{ 110 // Decrement the activity count if this stage was active. 111 if (stageActive[idx]) { 112 --activityCount; 113 114 stageActive[idx] = false; 115 116 DPRINTF(Activity, "Activity: %i\n", activityCount); 117 } else { 118 DPRINTF(Activity, "Stage %i already inactive.\n", idx); 119 } 120 121 assert(activityCount >= 0); 122} 123 124void 125ActivityRecorder::reset() 126{ 127 activityCount = 0; 128 std::memset(stageActive, 0, numStages); 129 for (int i = 0; i < longestLatency + 1; ++i) 130 activityBuffer.advance(); 131} 132 133void 134ActivityRecorder::dump() 135{ 136 for (int i = 0; i <= longestLatency; ++i) { 137 cprintf("[Idx:%i %i] ", i, activityBuffer[-i]); 138 } 139 140 cprintf("\n"); 141 142 for (int i = 0; i < numStages; ++i) { 143 cprintf("[Stage:%i %i]\n", i, stageActive[i]); 144 } 145 146 cprintf("\n"); 147 148 cprintf("Activity count: %i\n", activityCount); 149} 150 151void 152ActivityRecorder::validate() 153{ 154 int count = 0; 155 for (int i = 0; i <= longestLatency; ++i) { 156 if (activityBuffer[-i]) { 157 count++; 158 } 159 } 160 161 for (int i = 0; i < numStages; ++i) { 162 if (stageActive[i]) { 163 count++; 164 } 165 } 166 167 assert(count == activityCount); 168} 169