/* * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ /* * @test * @bug 8079136 * @summary Accessing a nested sublist leads to StackOverflowError */ import java.util.Arrays; import java.util.ArrayList; import java.util.Collections; import java.util.LinkedList; import java.util.List; import java.util.Vector; public class NestedSubList { static final int NEST_LIMIT = 65536; static int total = 0; static int failed = 0; public static void main(String args[]) throws Throwable { List c = Arrays.asList(42); test(c, false); test(new ArrayList<>(c), true); test(new LinkedList<>(c), true); test(new Vector<>(c), true); test(Collections.unmodifiableList(new ArrayList<>(c)), false); test(Collections.unmodifiableList(new LinkedList<>(c)), false); test(Collections.unmodifiableList(new Vector<>(c)), false); if (failed > 0) { throw new RuntimeException( "tests failed: " + failed + " of " + total); } } static void test(List list, boolean modifiable) { total++; Class cls = list.getClass(); for (int i = 0; i < NEST_LIMIT; ++i) { list = list.subList(0, 1); } try { list.get(0); if (modifiable) { list.remove(0); list.add(0, 42); } } catch (StackOverflowError e) { System.out.println("failed for " + cls); failed++; } } }