aoqi@0: /* aoqi@0: * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. aoqi@0: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. aoqi@0: * aoqi@0: * This code is free software; you can redistribute it and/or modify it aoqi@0: * under the terms of the GNU General Public License version 2 only, as aoqi@0: * published by the Free Software Foundation. aoqi@0: * aoqi@0: * This code is distributed in the hope that it will be useful, but WITHOUT aoqi@0: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or aoqi@0: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License aoqi@0: * version 2 for more details (a copy is included in the LICENSE file that aoqi@0: * accompanied this code). aoqi@0: * aoqi@0: * You should have received a copy of the GNU General Public License version aoqi@0: * 2 along with this work; if not, write to the Free Software Foundation, aoqi@0: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. aoqi@0: * aoqi@0: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA aoqi@0: * or visit www.oracle.com if you need additional information or have any aoqi@0: * questions. aoqi@0: * aoqi@0: */ aoqi@0: aoqi@0: #ifndef SHARE_VM_INTERPRETER_BYTECODEHISTOGRAM_HPP aoqi@0: #define SHARE_VM_INTERPRETER_BYTECODEHISTOGRAM_HPP aoqi@0: aoqi@0: #include "interpreter/bytecodes.hpp" aoqi@0: #include "memory/allocation.hpp" aoqi@0: aoqi@0: // BytecodeCounter counts the number of bytecodes executed aoqi@0: aoqi@0: class BytecodeCounter: AllStatic { aoqi@0: private: aoqi@0: NOT_PRODUCT(static int _counter_value;) aoqi@0: NOT_PRODUCT(static jlong _reset_time;) aoqi@0: aoqi@0: friend class TemplateInterpreterGenerator; aoqi@0: friend class BytecodeInterpreter; aoqi@0: aoqi@0: public: aoqi@0: // Initialization aoqi@0: static void reset() PRODUCT_RETURN; aoqi@0: aoqi@0: // Counter info (all info since last reset) aoqi@0: static int counter_value() PRODUCT_RETURN0 NOT_PRODUCT({ return _counter_value; }); aoqi@0: static double elapsed_time() PRODUCT_RETURN0; // in seconds aoqi@0: static double frequency() PRODUCT_RETURN0; // bytecodes/seconds aoqi@0: aoqi@0: // Counter printing aoqi@0: static void print() PRODUCT_RETURN; aoqi@0: }; aoqi@0: aoqi@0: aoqi@0: // BytecodeHistogram collects number of executions of bytecodes aoqi@0: aoqi@0: class BytecodeHistogram: AllStatic { aoqi@0: private: aoqi@0: NOT_PRODUCT(static int _counters[Bytecodes::number_of_codes];) // a counter for each bytecode aoqi@0: aoqi@0: friend class TemplateInterpreterGenerator; aoqi@0: friend class InterpreterGenerator; aoqi@0: friend class BytecodeInterpreter; aoqi@0: aoqi@0: public: aoqi@0: // Initialization aoqi@0: static void reset() PRODUCT_RETURN; // reset counters aoqi@0: aoqi@0: // Profile printing aoqi@0: static void print(float cutoff = 0.01F) PRODUCT_RETURN; // cutoff in percent aoqi@0: }; aoqi@0: aoqi@0: aoqi@0: // BytecodePairHistogram collects number of executions of bytecode pairs. aoqi@0: // A bytecode pair is any sequence of two consequtive bytecodes. aoqi@0: aoqi@0: class BytecodePairHistogram: AllStatic { aoqi@0: public: // for SparcWorks aoqi@0: enum Constants { aoqi@0: log2_number_of_codes = 8, // use a power of 2 for faster addressing aoqi@0: number_of_codes = 1 << log2_number_of_codes, // must be no less than Bytecodes::number_of_codes aoqi@0: number_of_pairs = number_of_codes * number_of_codes aoqi@0: }; aoqi@0: aoqi@0: private: aoqi@0: NOT_PRODUCT(static int _index;) // new bytecode is shifted in - used to index into _counters aoqi@0: NOT_PRODUCT(static int _counters[number_of_pairs];) // a counter for each pair aoqi@0: aoqi@0: friend class TemplateInterpreterGenerator; aoqi@0: friend class InterpreterGenerator; aoqi@0: aoqi@0: public: aoqi@0: // Initialization aoqi@0: static void reset() PRODUCT_RETURN; // reset counters aoqi@0: aoqi@0: // Profile printing aoqi@0: static void print(float cutoff = 0.01F) PRODUCT_RETURN; // cutoff in percent aoqi@0: }; aoqi@0: aoqi@0: #endif // SHARE_VM_INTERPRETER_BYTECODEHISTOGRAM_HPP