• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/utilities/intHisto.cpp@2d8a650513c2 (annotated)

src/share/vm/utilities/intHisto.cpp

Fri, 29 Apr 2016 00:06:10 +0800

author

aoqi

date

Fri, 29 Apr 2016 00:06:10 +0800

changeset 1

2d8a650513c2

parent 0

f90c822e73f8

child 6876

710a3c8b516e

permissions

-rw-r--r--

Added MIPS 64-bit port.

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