1 /* 2 * Copyright (c) 1997, 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 * @test 26 * @bug 4091185 27 * @summary Repeatedly OR BitSets; No OutOfMemoryException should result 28 */ 29 30 package test.java.util.BitSet; 31 32 import java.util.*; 33 34 /** 35 * This is a simple test class that repeatedly ORs two 36 * BitSets of unequal size together. Previously this 37 * caused an exponential growth in the memory underlying 38 * the BitSets quickly using all available memory 39 */ 40 public class MemoryLeak { 41 main(String[] args)42 public static void main(String[] args) { 43 44 //create 2 test bitsets 45 BitSet setOne = new BitSet(); 46 BitSet setTwo = new BitSet(); 47 48 setOne.set(64); 49 setTwo.set(129); 50 51 //test for bug #4091185 52 //exponential set growth causing memory depletion 53 for (int i = 0; i < 50; i++) { 54 setOne.or(setTwo); 55 setTwo.or(setOne); 56 } 57 } 58 } 59