src/share/vm/utilities/intHisto.cpp

Fri, 16 Aug 2013 14:11:40 -0700

author
kvn
date
Fri, 16 Aug 2013 14:11:40 -0700
changeset 5543
4b2838704fd5
parent 4153
b9a9ed0f8eeb
child 6876
710a3c8b516e
permissions
-rw-r--r--

8021898: Broken JIT compiler optimization for loop unswitching
Summary: fix method clone_projs() to clone all related MachProj nodes.
Reviewed-by: roland, adlertz

ysr@777 1 /*
mikael@4153 2 * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved.
ysr@777 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@777 4 *
ysr@777 5 * This code is free software; you can redistribute it and/or modify it
ysr@777 6 * under the terms of the GNU General Public License version 2 only, as
ysr@777 7 * published by the Free Software Foundation.
ysr@777 8 *
ysr@777 9 * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@777 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@777 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
ysr@777 12 * version 2 for more details (a copy is included in the LICENSE file that
ysr@777 13 * accompanied this code).
ysr@777 14 *
ysr@777 15 * You should have received a copy of the GNU General Public License version
ysr@777 16 * 2 along with this work; if not, write to the Free Software Foundation,
ysr@777 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@777 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
ysr@777 22 *
ysr@777 23 */
ysr@777 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "utilities/intHisto.hpp"
ysr@777 27
ysr@777 28 IntHistogram::IntHistogram(int est, int max) : _max(max), _tot(0) {
ysr@777 29 assert(0 <= est && est <= max, "Preconditions");
zgu@3900 30 _elements = new (ResourceObj::C_HEAP, mtInternal) GrowableArray<int>(est, true);
ysr@777 31 guarantee(_elements != NULL, "alloc failure");
ysr@777 32 }
ysr@777 33
ysr@777 34 void IntHistogram::add_entry(int outcome) {
ysr@777 35 if (outcome > _max) outcome = _max;
ysr@777 36 int new_count = _elements->at_grow(outcome) + 1;
ysr@777 37 _elements->at_put(outcome, new_count);
ysr@777 38 _tot++;
ysr@777 39 }
ysr@777 40
ysr@777 41 int IntHistogram::entries_for_outcome(int outcome) {
ysr@777 42 return _elements->at_grow(outcome);
ysr@777 43 }
ysr@777 44
ysr@777 45 void IntHistogram::print_on(outputStream* st) const {
ysr@777 46 double tot_d = (double)_tot;
ysr@777 47 st->print_cr("Outcome # of occurrences %% of occurrences");
ysr@777 48 st->print_cr("-----------------------------------------------");
ysr@777 49 for (int i=0; i < _elements->length()-2; i++) {
ysr@777 50 int cnt = _elements->at(i);
ysr@777 51 if (cnt != 0) {
ysr@777 52 st->print_cr("%7d %10d %8.4f",
ysr@777 53 i, cnt, (double)cnt/tot_d);
ysr@777 54 }
ysr@777 55 }
ysr@777 56 // Does it have any max entries?
ysr@777 57 if (_elements->length()-1 == _max) {
ysr@777 58 int cnt = _elements->at(_max);
ysr@777 59 st->print_cr(">= %4d %10d %8.4f",
ysr@777 60 _max, cnt, (double)cnt/tot_d);
ysr@777 61 }
ysr@777 62 st->print_cr("-----------------------------------------------");
ysr@777 63 st->print_cr(" All %10d %8.4f", _tot, 1.0);
ysr@777 64 }

mercurial