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