aoqi@0: /*
aoqi@0:  * Copyright (c) 2001, 2012, 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: #include "precompiled.hpp"
aoqi@0: #include "utilities/intHisto.hpp"
aoqi@0: 
aoqi@0: IntHistogram::IntHistogram(int est, int max) : _max(max), _tot(0) {
aoqi@0:   assert(0 <= est && est <= max, "Preconditions");
aoqi@0:   _elements = new (ResourceObj::C_HEAP, mtInternal) GrowableArray<int>(est, true);
aoqi@0:   guarantee(_elements != NULL, "alloc failure");
aoqi@0: }
aoqi@0: 
aoqi@0: void IntHistogram::add_entry(int outcome) {
aoqi@0:   if (outcome > _max) outcome = _max;
aoqi@0:   int new_count = _elements->at_grow(outcome) + 1;
aoqi@0:   _elements->at_put(outcome, new_count);
aoqi@0:   _tot++;
aoqi@0: }
aoqi@0: 
aoqi@0: int IntHistogram::entries_for_outcome(int outcome) {
aoqi@0:   return _elements->at_grow(outcome);
aoqi@0: }
aoqi@0: 
aoqi@0: void IntHistogram::print_on(outputStream* st) const {
aoqi@0:   double tot_d = (double)_tot;
aoqi@0:   st->print_cr("Outcome     # of occurrences   %% of occurrences");
aoqi@0:   st->print_cr("-----------------------------------------------");
aoqi@0:   for (int i=0; i < _elements->length()-2; i++) {
aoqi@0:     int cnt = _elements->at(i);
aoqi@0:     if (cnt != 0) {
aoqi@0:       st->print_cr("%7d        %10d         %8.4f",
aoqi@0:                    i, cnt, (double)cnt/tot_d);
aoqi@0:     }
aoqi@0:   }
aoqi@0:   // Does it have any max entries?
aoqi@0:   if (_elements->length()-1 == _max) {
aoqi@0:     int cnt = _elements->at(_max);
aoqi@0:     st->print_cr(">= %4d        %10d         %8.4f",
aoqi@0:                  _max, cnt, (double)cnt/tot_d);
aoqi@0:   }
aoqi@0:   st->print_cr("-----------------------------------------------");
aoqi@0:   st->print_cr("    All        %10d         %8.4f", _tot, 1.0);
aoqi@0: }