1/* 2 * Copyright (c) 2005 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.
| 1/* 2 * Copyright (c) 2005 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 29#ifndef __CPU_PROFILE_HH__ 30#define __CPU_PROFILE_HH__ 31 32#include <map> 33 34#include "cpu/static_inst.hh" 35#include "sim/host.hh" 36#include "arch/stacktrace.hh" 37 38class ExecContext; 39 40class ProfileNode 41{ 42 private: 43 friend class FunctionProfile; 44 45 typedef std::map<Addr, ProfileNode *> ChildList; 46 ChildList children; 47 48 public: 49 Counter count; 50 51 public: 52 ProfileNode(); 53 54 void dump(const std::string &symbol, uint64_t id, 55 const SymbolTable *symtab, std::ostream &os) const; 56 void clear(); 57}; 58 59class Callback; 60class FunctionProfile 61{ 62 private: 63 Callback *reset; 64 const SymbolTable *symtab; 65 ProfileNode top; 66 std::map<Addr, Counter> pc_count; 67 StackTrace trace; 68 69 public: 70 FunctionProfile(const SymbolTable *symtab); 71 ~FunctionProfile(); 72 73 ProfileNode *consume(ExecContext *xc, StaticInstPtr inst); 74 ProfileNode *consume(const std::vector<Addr> &stack); 75 void clear(); 76 void dump(ExecContext *xc, std::ostream &out) const; 77 void sample(ProfileNode *node, Addr pc); 78}; 79 80inline ProfileNode * 81FunctionProfile::consume(ExecContext *xc, StaticInstPtr inst) 82{ 83 if (!trace.trace(xc, inst)) 84 return NULL; 85 trace.dprintf(); 86 return consume(trace.getstack()); 87} 88 89#endif // __CPU_PROFILE_HH__
| 29 */ 30 31#ifndef __CPU_PROFILE_HH__ 32#define __CPU_PROFILE_HH__ 33 34#include <map> 35 36#include "cpu/static_inst.hh" 37#include "sim/host.hh" 38#include "arch/stacktrace.hh" 39 40class ExecContext; 41 42class ProfileNode 43{ 44 private: 45 friend class FunctionProfile; 46 47 typedef std::map<Addr, ProfileNode *> ChildList; 48 ChildList children; 49 50 public: 51 Counter count; 52 53 public: 54 ProfileNode(); 55 56 void dump(const std::string &symbol, uint64_t id, 57 const SymbolTable *symtab, std::ostream &os) const; 58 void clear(); 59}; 60 61class Callback; 62class FunctionProfile 63{ 64 private: 65 Callback *reset; 66 const SymbolTable *symtab; 67 ProfileNode top; 68 std::map<Addr, Counter> pc_count; 69 StackTrace trace; 70 71 public: 72 FunctionProfile(const SymbolTable *symtab); 73 ~FunctionProfile(); 74 75 ProfileNode *consume(ExecContext *xc, StaticInstPtr inst); 76 ProfileNode *consume(const std::vector<Addr> &stack); 77 void clear(); 78 void dump(ExecContext *xc, std::ostream &out) const; 79 void sample(ProfileNode *node, Addr pc); 80}; 81 82inline ProfileNode * 83FunctionProfile::consume(ExecContext *xc, StaticInstPtr inst) 84{ 85 if (!trace.trace(xc, inst)) 86 return NULL; 87 trace.dprintf(); 88 return consume(trace.getstack()); 89} 90 91#endif // __CPU_PROFILE_HH__
|