Thu, 30 Jul 2009 10:29:53 +0100
6827648: Extremely slow compilation time for visitor pattern code + generics
Summary: Javac unnecessarily recomputates type-substitutions multiple times
Reviewed-by: jjg
duke@1 | 1 | /* |
duke@1 | 2 | * Copyright 2003 Sun Microsystems, Inc. All Rights Reserved. |
duke@1 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@1 | 4 | * |
duke@1 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@1 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@1 | 7 | * published by the Free Software Foundation. |
duke@1 | 8 | * |
duke@1 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@1 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@1 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@1 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@1 | 13 | * accompanied this code). |
duke@1 | 14 | * |
duke@1 | 15 | * You should have received a copy of the GNU General Public License version |
duke@1 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@1 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@1 | 18 | * |
duke@1 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@1 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@1 | 21 | * have any questions. |
duke@1 | 22 | */ |
duke@1 | 23 | |
duke@1 | 24 | /* |
duke@1 | 25 | * @test |
duke@1 | 26 | * @bug 4881179 4883239 |
duke@1 | 27 | * @summary Rule for semantics of ?: in the presence of generics and generic class Class |
duke@1 | 28 | * @author gafter |
duke@1 | 29 | * |
darcy@289 | 30 | * @compile Conditional.java |
duke@1 | 31 | */ |
duke@1 | 32 | |
duke@1 | 33 | package conditional; |
duke@1 | 34 | |
duke@1 | 35 | import java.io.Serializable; |
duke@1 | 36 | |
duke@1 | 37 | interface I {} |
duke@1 | 38 | interface J {} |
duke@1 | 39 | class A implements I, J {} |
duke@1 | 40 | class B implements I, J {} |
duke@1 | 41 | class C extends B {} |
duke@1 | 42 | |
duke@1 | 43 | class Conditional { |
duke@1 | 44 | static boolean cond = String.class.getName().length() == 1; |
duke@1 | 45 | public static void main(String[] args) { |
duke@1 | 46 | Class c = cond ? A.class : B.class; |
duke@1 | 47 | Class<?> d = cond ? A.class : B.class; |
duke@1 | 48 | |
duke@1 | 49 | Class<? extends B> e = cond ? B.class : C.class; |
duke@1 | 50 | } |
duke@1 | 51 | |
duke@1 | 52 | void f(A a, B b) { |
duke@1 | 53 | I i = cond ? a : b; |
duke@1 | 54 | J j = cond ? a : b; |
duke@1 | 55 | } |
duke@1 | 56 | |
duke@1 | 57 | // required for compatibility |
duke@1 | 58 | Class g(Class a) { |
duke@1 | 59 | return cond ? a : B.class; |
duke@1 | 60 | } |
duke@1 | 61 | |
duke@1 | 62 | // required for compatibility |
duke@1 | 63 | byte[] h(byte[] a, byte[] b) { |
duke@1 | 64 | return cond ? a : b; |
duke@1 | 65 | } |
duke@1 | 66 | |
duke@1 | 67 | // This one is hard because of the recursive F-bounds |
duke@1 | 68 | // The naive result is the infinite type |
duke@1 | 69 | // Class<? extends Number&Comparable<? extends Number&Comparable<? extends |
duke@1 | 70 | // ... |
duke@1 | 71 | Class<? extends Comparable<?>> c = |
duke@1 | 72 | cond ? Integer.class : Float.class; |
duke@1 | 73 | |
duke@1 | 74 | Comparable<?> o = |
duke@1 | 75 | cond ? true : 3; |
duke@1 | 76 | |
duke@1 | 77 | /* |
duke@1 | 78 | |
duke@1 | 79 | // See 4942040 |
duke@1 | 80 | void f(Cloneable a, int[] b) { |
duke@1 | 81 | Cloneable x = cond ? a : b; |
duke@1 | 82 | } |
duke@1 | 83 | void f(Serializable a, int[] b) { |
duke@1 | 84 | Serializable x = cond ? a : b; |
duke@1 | 85 | } |
duke@1 | 86 | |
duke@1 | 87 | // See 4941882 |
duke@1 | 88 | void f(float[] a, int[] b) { |
duke@1 | 89 | Serializable x = cond ? a : b; |
duke@1 | 90 | } |
duke@1 | 91 | */ |
duke@1 | 92 | } |