• file
• revisions
• annotate
• diff
• comparison
• raw

test/tools/javac/tree/TreeKindTest.java@2eb010b6cb22 (annotated)

test/tools/javac/tree/TreeKindTest.java

Thu, 31 Aug 2017 15:17:03 +0800

author

aoqi

date

Thu, 31 Aug 2017 15:17:03 +0800

changeset 2525

2eb010b6cb22

parent 1521

71f35e4b93a5

parent 0

959103a6100f

permissions

-rw-r--r--

merge

aoqi@0	1	/*
aoqi@0	2	* Copyright (c) 2006, 2013, Oracle and/or its affiliates. All rights reserved.
aoqi@0	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0	4	*
aoqi@0	5	* This code is free software; you can redistribute it and/or modify it
aoqi@0	6	* under the terms of the GNU General Public License version 2 only, as
aoqi@0	7	* published by the Free Software Foundation.
aoqi@0	8	*
aoqi@0	9	* This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0	12	* version 2 for more details (a copy is included in the LICENSE file that
aoqi@0	13	* accompanied this code).
aoqi@0	14	*
aoqi@0	15	* You should have received a copy of the GNU General Public License version
aoqi@0	16	* 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0	18	*
aoqi@0	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0	20	* or visit www.oracle.com if you need additional information or have any
aoqi@0	21	* questions.
aoqi@0	22	*/
aoqi@0	23
aoqi@0	24	/*
aoqi@0	25	* @test
aoqi@0	26	* @bug 6341023
aoqi@0	27	* @summary Tree API: Tree.Kind should have mapping to interface
aoqi@0	28	*/
aoqi@0	29
aoqi@0	30	import com.sun.source.tree.*;
aoqi@0	31
aoqi@0	32	public class TreeKindTest {
aoqi@0	33	public static void main(String... args) {
aoqi@0	34	boolean ok = true;
aoqi@0	35
aoqi@0	36	for (Tree.Kind k: Tree.Kind.values()) {
aoqi@0	37	//System.err.println(k + " " + k.asInterface());
aoqi@0	38	Class<? extends Tree> i = k.asInterface();
aoqi@0	39	switch (k) {
aoqi@0	40	case POSTFIX_INCREMENT:
aoqi@0	41	case POSTFIX_DECREMENT:
aoqi@0	42	case PREFIX_INCREMENT:
aoqi@0	43	case PREFIX_DECREMENT:
aoqi@0	44	case UNARY_PLUS:
aoqi@0	45	case UNARY_MINUS:
aoqi@0	46	case BITWISE_COMPLEMENT:
aoqi@0	47	case LOGICAL_COMPLEMENT:
aoqi@0	48	ok = ok & verify(k, i, i == UnaryTree.class);
aoqi@0	49	break;
aoqi@0	50
aoqi@0	51	case MULTIPLY:
aoqi@0	52	case DIVIDE:
aoqi@0	53	case REMAINDER:
aoqi@0	54	case PLUS:
aoqi@0	55	case MINUS:
aoqi@0	56	case LEFT_SHIFT:
aoqi@0	57	case RIGHT_SHIFT:
aoqi@0	58	case UNSIGNED_RIGHT_SHIFT:
aoqi@0	59	case LESS_THAN:
aoqi@0	60	case GREATER_THAN:
aoqi@0	61	case LESS_THAN_EQUAL:
aoqi@0	62	case GREATER_THAN_EQUAL:
aoqi@0	63	case EQUAL_TO:
aoqi@0	64	case NOT_EQUAL_TO:
aoqi@0	65	case AND:
aoqi@0	66	case XOR:
aoqi@0	67	case OR:
aoqi@0	68	case CONDITIONAL_AND:
aoqi@0	69	case CONDITIONAL_OR:
aoqi@0	70	ok = ok & verify(k, i, i == BinaryTree.class);
aoqi@0	71	break;
aoqi@0	72
aoqi@0	73	case MULTIPLY_ASSIGNMENT:
aoqi@0	74	case DIVIDE_ASSIGNMENT:
aoqi@0	75	case REMAINDER_ASSIGNMENT:
aoqi@0	76	case PLUS_ASSIGNMENT:
aoqi@0	77	case MINUS_ASSIGNMENT:
aoqi@0	78	case LEFT_SHIFT_ASSIGNMENT:
aoqi@0	79	case RIGHT_SHIFT_ASSIGNMENT:
aoqi@0	80	case UNSIGNED_RIGHT_SHIFT_ASSIGNMENT:
aoqi@0	81	case AND_ASSIGNMENT:
aoqi@0	82	case XOR_ASSIGNMENT:
aoqi@0	83	case OR_ASSIGNMENT:
aoqi@0	84	ok = ok & verify(k, i, i == CompoundAssignmentTree.class);
aoqi@0	85	break;
aoqi@0	86
aoqi@0	87	case INT_LITERAL:
aoqi@0	88	case LONG_LITERAL:
aoqi@0	89	case FLOAT_LITERAL:
aoqi@0	90	case DOUBLE_LITERAL:
aoqi@0	91	case BOOLEAN_LITERAL:
aoqi@0	92	case CHAR_LITERAL:
aoqi@0	93	case STRING_LITERAL:
aoqi@0	94	case NULL_LITERAL:
aoqi@0	95	ok = ok & verify(k, i, i == LiteralTree.class);
aoqi@0	96	break;
aoqi@0	97
aoqi@0	98	case UNBOUNDED_WILDCARD:
aoqi@0	99	case EXTENDS_WILDCARD:
aoqi@0	100	case SUPER_WILDCARD:
aoqi@0	101	ok = ok & verify(k, i, i == WildcardTree.class);
aoqi@0	102	break;
aoqi@0	103
aoqi@0	104	case INTERFACE:
aoqi@0	105	case ANNOTATION_TYPE:
aoqi@0	106	case ENUM:
aoqi@0	107	case CLASS:
aoqi@0	108	ok = ok & verify(k, i, i == ClassTree.class);
aoqi@0	109	break;
aoqi@0	110
aoqi@0	111	case ANNOTATION:
aoqi@0	112	case TYPE_ANNOTATION:
aoqi@0	113	ok = ok & verify(k, i, i == AnnotationTree.class);
aoqi@0	114	break;
aoqi@0	115
aoqi@0	116	case OTHER:
aoqi@0	117	ok = ok & verify(k, i, i == null);
aoqi@0	118	break;
aoqi@0	119
aoqi@0	120	default:
aoqi@0	121	String ks = k.toString().replace("_", "") + "tree";
aoqi@0	122	String iName = i.getName();
aoqi@0	123	String is = iName.substring(iName.lastIndexOf(".") + 1);
aoqi@0	124	ok = ok & verify(k, i, ks.equalsIgnoreCase(is));
aoqi@0	125	}
aoqi@0	126	}
aoqi@0	127
aoqi@0	128	if (!ok)
aoqi@0	129	throw new AssertionError("test failed");
aoqi@0	130	}
aoqi@0	131
aoqi@0	132	static boolean verify(Tree.Kind k, Class<?> c, boolean b) {
aoqi@0	133	if (!b)
aoqi@0	134	System.err.println("error: " + k + " " + c);
aoqi@0	135	return b;
aoqi@0	136	}
aoqi@0	137	}