statistics.cc revision 8231
12SN/A/* 21762SN/A * Copyright (c) 2003-2005 The Regents of The University of Michigan 32SN/A * All rights reserved. 42SN/A * 52SN/A * Redistribution and use in source and binary forms, with or without 62SN/A * modification, are permitted provided that the following conditions are 72SN/A * met: redistributions of source code must retain the above copyright 82SN/A * notice, this list of conditions and the following disclaimer; 92SN/A * redistributions in binary form must reproduce the above copyright 102SN/A * notice, this list of conditions and the following disclaimer in the 112SN/A * documentation and/or other materials provided with the distribution; 122SN/A * neither the name of the copyright holders nor the names of its 132SN/A * contributors may be used to endorse or promote products derived from 142SN/A * this software without specific prior written permission. 152SN/A * 162SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 172SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 182SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 192SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 202SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 212SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 222SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 232SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 242SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 252SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 262SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 272665Ssaidi@eecs.umich.edu * 282665Ssaidi@eecs.umich.edu * Authors: Nathan Binkert 292SN/A */ 302SN/A 318229Snate@binkert.org#include <fstream> 322SN/A#include <iomanip> 332SN/A#include <list> 342SN/A#include <map> 352SN/A#include <string> 362SN/A 37148SN/A#include "base/callback.hh" 3856SN/A#include "base/cprintf.hh" 395889Snate@binkert.org#include "base/debug.hh" 40441SN/A#include "base/hostinfo.hh" 4156SN/A#include "base/misc.hh" 4256SN/A#include "base/statistics.hh" 4356SN/A#include "base/str.hh" 44441SN/A#include "base/time.hh" 45433SN/A#include "base/trace.hh" 462SN/A 472SN/Ausing namespace std; 482SN/A 49729SN/Anamespace Stats { 50388SN/A 515887Snate@binkert.orgtypedef map<const void *, Info *> MapType; 525887Snate@binkert.org 535887Snate@binkert.org// We wrap these in a function to make sure they're built in time. 545887Snate@binkert.orglist<Info *> & 555887Snate@binkert.orgstatsList() 56388SN/A{ 575887Snate@binkert.org static list<Info *> the_list; 585887Snate@binkert.org return the_list; 59388SN/A} 60388SN/A 615887Snate@binkert.orgMapType & 625887Snate@binkert.orgstatsMap() 63441SN/A{ 645887Snate@binkert.org static MapType the_map; 655887Snate@binkert.org return the_map; 66441SN/A} 67441SN/A 68388SN/Avoid 695886Snate@binkert.orgInfoAccess::setInfo(Info *info) 70388SN/A{ 715887Snate@binkert.org if (statsMap().find(this) != statsMap().end()) 725887Snate@binkert.org panic("shouldn't register stat twice!"); 735887Snate@binkert.org 745887Snate@binkert.org statsList().push_back(info); 755887Snate@binkert.org 765887Snate@binkert.org#ifndef NDEBUG 775887Snate@binkert.org pair<MapType::iterator, bool> result = 785887Snate@binkert.org#endif 795887Snate@binkert.org statsMap().insert(make_pair(this, info)); 805887Snate@binkert.org assert(result.second && "this should never fail"); 815887Snate@binkert.org assert(statsMap().find(this) != statsMap().end()); 82388SN/A} 83388SN/A 84388SN/Avoid 855889Snate@binkert.orgInfoAccess::setParams(const StorageParams *params) 865889Snate@binkert.org{ 875889Snate@binkert.org info()->storageParams = params; 885889Snate@binkert.org} 895889Snate@binkert.org 905889Snate@binkert.orgvoid 915886Snate@binkert.orgInfoAccess::setInit() 92388SN/A{ 936130Snate@binkert.org info()->flags.set(init); 94388SN/A} 95388SN/A 965886Snate@binkert.orgInfo * 975886Snate@binkert.orgInfoAccess::info() 98388SN/A{ 995887Snate@binkert.org MapType::const_iterator i = statsMap().find(this); 1005887Snate@binkert.org assert(i != statsMap().end()); 1015887Snate@binkert.org return (*i).second; 102388SN/A} 103388SN/A 1045886Snate@binkert.orgconst Info * 1055886Snate@binkert.orgInfoAccess::info() const 1065886Snate@binkert.org{ 1075887Snate@binkert.org MapType::const_iterator i = statsMap().find(this); 1085887Snate@binkert.org assert(i != statsMap().end()); 1095887Snate@binkert.org return (*i).second; 1105886Snate@binkert.org} 1115886Snate@binkert.org 1125889Snate@binkert.orgStorageParams::~StorageParams() 1135889Snate@binkert.org{ 1145889Snate@binkert.org} 1155889Snate@binkert.org 1166026Snate@binkert.orgtypedef map<std::string, Info *> NameMapType; 1176026Snate@binkert.orgNameMapType & 1186026Snate@binkert.orgnameMap() 1196026Snate@binkert.org{ 1206026Snate@binkert.org static NameMapType the_map; 1216026Snate@binkert.org return the_map; 1226026Snate@binkert.org} 1236026Snate@binkert.org 1245889Snate@binkert.orgint Info::id_count = 0; 1255889Snate@binkert.org 1265889Snate@binkert.orgint debug_break_id = -1; 1275889Snate@binkert.org 1285886Snate@binkert.orgInfo::Info() 1295889Snate@binkert.org : flags(none), precision(-1), prereq(0), storageParams(NULL) 130582SN/A{ 1315889Snate@binkert.org id = id_count++; 1325889Snate@binkert.org if (debug_break_id >= 0 and debug_break_id == id) 1338231Snate@binkert.org Debug::breakpoint(); 134582SN/A} 135582SN/A 1365886Snate@binkert.orgInfo::~Info() 137388SN/A{ 138388SN/A} 139388SN/A 1406026Snate@binkert.orgvoid 1416026Snate@binkert.orgInfo::setName(const string &name) 1426026Snate@binkert.org{ 1436026Snate@binkert.org pair<NameMapType::iterator, bool> p = 1446026Snate@binkert.org nameMap().insert(make_pair(name, this)); 1456026Snate@binkert.org 1466026Snate@binkert.org Info *other = p.first->second; 1476026Snate@binkert.org bool result = p.second; 1486026Snate@binkert.org 1496026Snate@binkert.org if (!result) { 1506026Snate@binkert.org // using other->name instead of just name to avoid a compiler 1516026Snate@binkert.org // warning. They should be the same. 1526026Snate@binkert.org panic("same statistic name used twice! name=%s\n", other->name); 1536026Snate@binkert.org } 1546026Snate@binkert.org 1556026Snate@binkert.org this->name = name; 1566026Snate@binkert.org} 1576026Snate@binkert.org 1582SN/Abool 1595886Snate@binkert.orgInfo::less(Info *stat1, Info *stat2) 1602SN/A{ 161388SN/A const string &name1 = stat1->name; 162388SN/A const string &name2 = stat2->name; 1632SN/A 1642SN/A vector<string> v1; 1652SN/A vector<string> v2; 1662SN/A 1672SN/A tokenize(v1, name1, '.'); 1682SN/A tokenize(v2, name2, '.'); 1692SN/A 1705599Snate@binkert.org size_type last = min(v1.size(), v2.size()) - 1; 1715599Snate@binkert.org for (off_type i = 0; i < last; ++i) 1722SN/A if (v1[i] != v2[i]) 1732SN/A return v1[i] < v2[i]; 1742SN/A 1752SN/A // Special compare for last element. 1762SN/A if (v1[last] == v2[last]) 1772SN/A return v1.size() < v2.size(); 1782SN/A else 1792SN/A return v1[last] < v2[last]; 1802SN/A 1812SN/A return false; 1822SN/A} 1832SN/A 184388SN/Abool 1855886Snate@binkert.orgInfo::baseCheck() const 1862SN/A{ 1876000Snate@binkert.org if (!(flags & Stats::init)) { 188582SN/A#ifdef DEBUG 189695SN/A cprintf("this is stat number %d\n", id); 190388SN/A#endif 191388SN/A panic("Not all stats have been initialized"); 192388SN/A return false; 193388SN/A } 1942SN/A 1957462Snate@binkert.org if ((flags & display) && name.empty()) { 196388SN/A panic("all printable stats must be named"); 197388SN/A return false; 198388SN/A } 1992SN/A 200388SN/A return true; 2012SN/A} 2022SN/A 2036001Snate@binkert.orgvoid 2046001Snate@binkert.orgInfo::enable() 2056001Snate@binkert.org{ 2066001Snate@binkert.org} 2076001Snate@binkert.org 2086001Snate@binkert.orgvoid 2096128Snate@binkert.orgVectorInfo::enable() 2106001Snate@binkert.org{ 2116001Snate@binkert.org size_type s = size(); 2126001Snate@binkert.org if (subnames.size() < s) 2136001Snate@binkert.org subnames.resize(s); 2146001Snate@binkert.org if (subdescs.size() < s) 2156001Snate@binkert.org subdescs.resize(s); 2166001Snate@binkert.org} 2176001Snate@binkert.org 2186001Snate@binkert.orgvoid 2196128Snate@binkert.orgVectorDistInfo::enable() 2206001Snate@binkert.org{ 2216001Snate@binkert.org size_type s = size(); 2226001Snate@binkert.org if (subnames.size() < s) 2236001Snate@binkert.org subnames.resize(s); 2246001Snate@binkert.org if (subdescs.size() < s) 2256001Snate@binkert.org subdescs.resize(s); 2266001Snate@binkert.org} 2276001Snate@binkert.org 2286001Snate@binkert.orgvoid 2296128Snate@binkert.orgVector2dInfo::enable() 2306001Snate@binkert.org{ 2316001Snate@binkert.org if (subnames.size() < x) 2326001Snate@binkert.org subnames.resize(x); 2336001Snate@binkert.org if (subdescs.size() < x) 2346001Snate@binkert.org subdescs.resize(x); 2356001Snate@binkert.org if (y_subnames.size() < y) 2366001Snate@binkert.org y_subnames.resize(y); 2376001Snate@binkert.org} 238695SN/A 2397831Snate@binkert.orgvoid 2407831Snate@binkert.orgHistStor::grow_out() 2417831Snate@binkert.org{ 2427831Snate@binkert.org int size = cvec.size(); 2437831Snate@binkert.org int zero = size / 2; // round down! 2447831Snate@binkert.org int top_half = zero + (size - zero + 1) / 2; // round up! 2457831Snate@binkert.org int bottom_half = (size - zero) / 2; // round down! 2467831Snate@binkert.org 2477831Snate@binkert.org // grow down 2487831Snate@binkert.org int low_pair = zero - 1; 2497831Snate@binkert.org for (int i = zero - 1; i >= bottom_half; i--) { 2507831Snate@binkert.org cvec[i] = cvec[low_pair]; 2517831Snate@binkert.org if (low_pair - 1 >= 0) 2527831Snate@binkert.org cvec[i] += cvec[low_pair - 1]; 2537831Snate@binkert.org low_pair -= 2; 2547831Snate@binkert.org } 2557831Snate@binkert.org assert(low_pair == 0 || low_pair == -1 || low_pair == -2); 2567831Snate@binkert.org 2577831Snate@binkert.org for (int i = bottom_half - 1; i >= 0; i--) 2587831Snate@binkert.org cvec[i] = Counter(); 2597831Snate@binkert.org 2607831Snate@binkert.org // grow up 2617831Snate@binkert.org int high_pair = zero; 2627831Snate@binkert.org for (int i = zero; i < top_half; i++) { 2637831Snate@binkert.org cvec[i] = cvec[high_pair]; 2647831Snate@binkert.org if (high_pair + 1 < size) 2657831Snate@binkert.org cvec[i] += cvec[high_pair + 1]; 2667831Snate@binkert.org high_pair += 2; 2677831Snate@binkert.org } 2687831Snate@binkert.org assert(high_pair == size || high_pair == size + 1); 2697831Snate@binkert.org 2707831Snate@binkert.org for (int i = top_half; i < size; i++) 2717831Snate@binkert.org cvec[i] = Counter(); 2727831Snate@binkert.org 2737831Snate@binkert.org max_bucket *= 2; 2747831Snate@binkert.org min_bucket *= 2; 2757831Snate@binkert.org bucket_size *= 2; 2767831Snate@binkert.org} 2777831Snate@binkert.org 2787831Snate@binkert.orgvoid 2797831Snate@binkert.orgHistStor::grow_convert() 2807831Snate@binkert.org{ 2817831Snate@binkert.org int size = cvec.size(); 2827831Snate@binkert.org int half = (size + 1) / 2; // round up! 2837831Snate@binkert.org //bool even = (size & 1) == 0; 2847831Snate@binkert.org 2857831Snate@binkert.org int pair = size - 1; 2867831Snate@binkert.org for (int i = size - 1; i >= half; --i) { 2877831Snate@binkert.org cvec[i] = cvec[pair]; 2887831Snate@binkert.org if (pair - 1 >= 0) 2897831Snate@binkert.org cvec[i] += cvec[pair - 1]; 2907831Snate@binkert.org pair -= 2; 2917831Snate@binkert.org } 2927831Snate@binkert.org 2937831Snate@binkert.org for (int i = half - 1; i >= 0; i--) 2947831Snate@binkert.org cvec[i] = Counter(); 2957831Snate@binkert.org 2967831Snate@binkert.org min_bucket = -max_bucket;// - (even ? bucket_size : 0); 2977831Snate@binkert.org bucket_size *= 2; 2987831Snate@binkert.org} 2997831Snate@binkert.org 3007831Snate@binkert.orgvoid 3017831Snate@binkert.orgHistStor::grow_up() 3027831Snate@binkert.org{ 3037831Snate@binkert.org int size = cvec.size(); 3047831Snate@binkert.org int half = (size + 1) / 2; // round up! 3057831Snate@binkert.org 3067831Snate@binkert.org int pair = 0; 3077831Snate@binkert.org for (int i = 0; i < half; i++) { 3087831Snate@binkert.org cvec[i] = cvec[pair]; 3097831Snate@binkert.org if (pair + 1 < size) 3107831Snate@binkert.org cvec[i] += cvec[pair + 1]; 3117831Snate@binkert.org pair += 2; 3127831Snate@binkert.org } 3137831Snate@binkert.org assert(pair == size || pair == size + 1); 3147831Snate@binkert.org 3157831Snate@binkert.org for (int i = half; i < size; i++) 3167831Snate@binkert.org cvec[i] = Counter(); 3177831Snate@binkert.org 3187831Snate@binkert.org max_bucket *= 2; 3197831Snate@binkert.org bucket_size *= 2; 3207831Snate@binkert.org} 3217831Snate@binkert.org 322388SN/AFormula::Formula() 323388SN/A{ 324388SN/A} 325388SN/A 326388SN/AFormula::Formula(Temp r) 327388SN/A{ 328388SN/A root = r; 3297461Snate@binkert.org setInit(); 330388SN/A assert(size()); 331388SN/A} 332388SN/A 333388SN/Aconst Formula & 334388SN/AFormula::operator=(Temp r) 335388SN/A{ 336388SN/A assert(!root && "Can't change formulas"); 337388SN/A root = r; 3387461Snate@binkert.org setInit(); 339388SN/A assert(size()); 340388SN/A return *this; 341388SN/A} 342388SN/A 343388SN/Aconst Formula & 344388SN/AFormula::operator+=(Temp r) 345388SN/A{ 346388SN/A if (root) 347695SN/A root = NodePtr(new BinaryNode<std::plus<Result> >(root, r)); 3487461Snate@binkert.org else { 349388SN/A root = r; 3507461Snate@binkert.org setInit(); 3517461Snate@binkert.org } 3527461Snate@binkert.org 353388SN/A assert(size()); 354388SN/A return *this; 355388SN/A} 356388SN/A 357142SN/Avoid 3586000Snate@binkert.orgFormula::result(VResult &vec) const 3596000Snate@binkert.org{ 3606000Snate@binkert.org if (root) 3616000Snate@binkert.org vec = root->result(); 3626000Snate@binkert.org} 3636000Snate@binkert.org 3646000Snate@binkert.orgResult 3656000Snate@binkert.orgFormula::total() const 3666000Snate@binkert.org{ 3676000Snate@binkert.org return root ? root->total() : 0.0; 3686000Snate@binkert.org} 3696000Snate@binkert.org 3706000Snate@binkert.orgsize_type 3716000Snate@binkert.orgFormula::size() const 3726000Snate@binkert.org{ 3736000Snate@binkert.org if (!root) 3746000Snate@binkert.org return 0; 3756000Snate@binkert.org else 3766000Snate@binkert.org return root->size(); 3776000Snate@binkert.org} 3786000Snate@binkert.org 3796000Snate@binkert.orgvoid 3806000Snate@binkert.orgFormula::reset() 3816000Snate@binkert.org{ 3826000Snate@binkert.org} 3836000Snate@binkert.org 3846000Snate@binkert.orgbool 3856000Snate@binkert.orgFormula::zero() const 3866000Snate@binkert.org{ 3876000Snate@binkert.org VResult vec; 3886000Snate@binkert.org result(vec); 3896227Snate@binkert.org for (VResult::size_type i = 0; i < vec.size(); ++i) 3906000Snate@binkert.org if (vec[i] != 0.0) 3916000Snate@binkert.org return false; 3926000Snate@binkert.org return true; 3936000Snate@binkert.org} 3946000Snate@binkert.org 3956000Snate@binkert.orgstring 3966000Snate@binkert.orgFormula::str() const 3976000Snate@binkert.org{ 3986000Snate@binkert.org return root ? root->str() : ""; 3996000Snate@binkert.org} 4006000Snate@binkert.org 4016000Snate@binkert.orgvoid 4026001Snate@binkert.orgenable() 4032SN/A{ 4045887Snate@binkert.org typedef list<Info *>::iterator iter_t; 405695SN/A 4065887Snate@binkert.org iter_t i, end = statsList().end(); 4075887Snate@binkert.org for (i = statsList().begin(); i != end; ++i) { 4085886Snate@binkert.org Info *info = *i; 4095886Snate@binkert.org assert(info); 4105886Snate@binkert.org if (!info->check() || !info->baseCheck()) 4115889Snate@binkert.org panic("stat check failed for '%s' %d\n", info->name, info->id); 412695SN/A } 413695SN/A 4145599Snate@binkert.org off_t j = 0; 4155887Snate@binkert.org for (i = statsList().begin(); i != end; ++i) { 4165886Snate@binkert.org Info *info = *i; 4177462Snate@binkert.org if (!(info->flags & display)) 4185886Snate@binkert.org info->name = "__Stat" + to_string(j++); 419695SN/A } 420695SN/A 4215887Snate@binkert.org statsList().sort(Info::less); 422695SN/A 4236001Snate@binkert.org for (i = statsList().begin(); i != end; ++i) { 4246001Snate@binkert.org Info *info = *i; 4256001Snate@binkert.org info->enable(); 4266001Snate@binkert.org } 4276001Snate@binkert.org} 428695SN/A 4296001Snate@binkert.orgvoid 4306001Snate@binkert.orgprepare() 4316001Snate@binkert.org{ 4326001Snate@binkert.org list<Info *>::iterator i = statsList().begin(); 4336001Snate@binkert.org list<Info *>::iterator end = statsList().end(); 4346001Snate@binkert.org while (i != end) { 4356001Snate@binkert.org Info *info = *i; 4366001Snate@binkert.org info->prepare(); 4376001Snate@binkert.org ++i; 438695SN/A } 4392SN/A} 4402SN/A 441695SN/ACallbackQueue resetQueue; 4422SN/A 443456SN/Avoid 444695SN/Areset() 445456SN/A{ 4465887Snate@binkert.org list<Info *>::iterator i = statsList().begin(); 4475887Snate@binkert.org list<Info *>::iterator end = statsList().end(); 448695SN/A while (i != end) { 4495886Snate@binkert.org Info *info = *i; 4505886Snate@binkert.org info->reset(); 451695SN/A ++i; 452695SN/A } 453695SN/A 454695SN/A resetQueue.process(); 455456SN/A} 456456SN/A 457456SN/Avoid 458394SN/AregisterResetCallback(Callback *cb) 459148SN/A{ 460148SN/A resetQueue.add(cb); 461148SN/A} 462148SN/A 4637811Ssteve.reinhardt@amd.com} // namespace Stats 464