/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#include "precompiled.hpp"
#include "interpreter/bytecodeHistogram.hpp"
#include "memory/resourceArea.hpp"
#include "utilities/growableArray.hpp"
// ------------------------------------------------------------------------------------------------
// Non-product code
#ifndef PRODUCT
// Implementation of BytecodeCounter
_counter_value = 0;
}
}
return (double)counter_value() / elapsed_time();
}
"%d bytecodes executed in %.1fs (%.3fMHz)",
elapsed_time(),
frequency() / 1000000.0
);
}
// Helper class for sorting
private:
int _index;
int _count;
public:
};
// Helper functions
int i = length;
return a;
}
int sum = 0;
return sum;
}
static const char* name_for(int i) {
}
// Implementation of BytecodeHistogram
int i = Bytecodes::number_of_codes;
while (i-- > 0) _counters[i] = 0;
}
// print profile
int abs_sum = 0;
while (i-- > 0) {
}
}
}
// Implementation of BytecodePairHistogram
int i = number_of_pairs;
while (i-- > 0) _counters[i] = 0;
}
// print profile
int abs_sum = 0;
while (i-- > 0) {
}
}
}
#endif