001: /*
002: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
003: *
004: * Copyright 1997-2007 Sun Microsystems, Inc. All rights reserved.
005: *
006: * The contents of this file are subject to the terms of either the GNU
007: * General Public License Version 2 only ("GPL") or the Common
008: * Development and Distribution License("CDDL") (collectively, the
009: * "License"). You may not use this file except in compliance with the
010: * License. You can obtain a copy of the License at
011: * http://www.netbeans.org/cddl-gplv2.html
012: * or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the
013: * specific language governing permissions and limitations under the
014: * License. When distributing the software, include this License Header
015: * Notice in each file and include the License file at
016: * nbbuild/licenses/CDDL-GPL-2-CP. Sun designates this
017: * particular file as subject to the "Classpath" exception as provided
018: * by Sun in the GPL Version 2 section of the License file that
019: * accompanied this code. If applicable, add the following below the
020: * License Header, with the fields enclosed by brackets [] replaced by
021: * your own identifying information:
022: * "Portions Copyrighted [year] [name of copyright owner]"
023: *
024: * Contributor(s):
025: * The Original Software is NetBeans. The Initial Developer of the Original
026: * Software is Sun Microsystems, Inc. Portions Copyright 1997-2006 Sun
027: * Microsystems, Inc. All Rights Reserved.
028: *
029: * If you wish your version of this file to be governed by only the CDDL
030: * or only the GPL Version 2, indicate your decision by adding
031: * "[Contributor] elects to include this software in this distribution
032: * under the [CDDL or GPL Version 2] license." If you do not indicate a
033: * single choice of license, a recipient has the option to distribute
034: * your version of this file under either the CDDL, the GPL Version 2 or
035: * to extend the choice of license to its licensees as provided above.
036: * However, if you add GPL Version 2 code and therefore, elected the GPL
037: * Version 2 license, then the option applies only if the new code is
038: * made subject to such option by the copyright holder.
039: */
040:
041: package org.netbeans.lib.profiler.results.memory;
042:
043: /**
044: * This class is used to calculate the cardinality of the set of all object ages for the given class,
045: * which is actually the definition of the number of surviving generations.
046: *
047: * @author Misha Dmitriev
048: */
049: public class SurvGenSet {
050: //~ Instance fields ----------------------------------------------------------------------------------------------------------
051:
052: private int[] age;
053: private int limit;
054: private int nEls;
055: private int nSlots;
056:
057: //~ Constructors -------------------------------------------------------------------------------------------------------------
058:
059: public SurvGenSet() {
060: nSlots = 11;
061: age = new int[nSlots];
062:
063: for (int i = 0; i < nSlots; i++) {
064: age[i] = -1;
065: }
066:
067: nEls = 0;
068: limit = (nSlots * 3) / 4;
069: }
070:
071: //~ Methods ------------------------------------------------------------------------------------------------------------------
072:
073: /* Get the total number of different ages */
074: public int getTotalNoOfAges() {
075: return nEls;
076: }
077:
078: /**
079: * Add the given age to the existing set of ages
080: */
081: public void addAge(int objAge) {
082: int pos = objAge % nSlots;
083:
084: while ((age[pos] != objAge) && (age[pos] != -1)) {
085: pos = (pos + 1) % nSlots;
086: }
087:
088: if (age[pos] == -1) {
089: age[pos] = objAge;
090: nEls++;
091:
092: if (nEls >= limit) {
093: rehash();
094: }
095: }
096: }
097:
098: public void mergeWith(SurvGenSet other) {
099: int[] otherAge = other.age;
100: int otherLen = otherAge.length;
101:
102: for (int i = 0; i < otherLen; i++) {
103: if (otherAge[i] != -1) {
104: addAge(otherAge[i]);
105: }
106: }
107: }
108:
109: private void rehash() {
110: int[] oldAge = age;
111: int oldNSlots = nSlots;
112: nSlots = (oldNSlots * 2) + 1;
113: age = new int[nSlots];
114:
115: for (int i = 0; i < nSlots; i++) {
116: age[i] = -1;
117: }
118:
119: nEls = 0;
120: limit = (nSlots * 3) / 4;
121:
122: for (int i = 0; i < oldNSlots; i++) {
123: if (oldAge[i] != -1) {
124: addAge(oldAge[i]);
125: }
126: }
127: }
128: }
|