Mercurial > jdk8-mips64-public > langtools / annotate
test/tools/javac/api/T6392782.java@9a66ca7c79fa (annotated)
test/tools/javac/api/T6392782.java
Sat, 01 Dec 2007 00:00:00 +0000
- author
- duke
- date
- Sat, 01 Dec 2007 00:00:00 +0000
- changeset 1
- 9a66ca7c79fa
- child 554
- 9d9f26857129
- permissions
- -rw-r--r--
Initial load
| duke@1 | 1 | /* |
| duke@1 | 2 | * Copyright 2006 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 6392782 |
| duke@1 | 27 | * @summary TreeScanner.visitImport returns null, not result of nested scan |
| duke@1 | 28 | */ |
| duke@1 | 29 | |
| duke@1 | 30 | import java.io.*; |
| duke@1 | 31 | import java.util.*; |
| duke@1 | 32 | import javax.tools.*; |
| duke@1 | 33 | import com.sun.source.tree.*; |
| duke@1 | 34 | import com.sun.source.util.*; |
| duke@1 | 35 | import com.sun.tools.javac.api.*; |
| duke@1 | 36 | |
| duke@1 | 37 | public class T6392782 { |
| duke@1 | 38 | public static void main(String... args) throws IOException { |
| duke@1 | 39 | String testSrc = System.getProperty("test.src", "."); |
| duke@1 | 40 | JavacTool tool = JavacTool.create(); |
| duke@1 | 41 | StandardJavaFileManager fm = tool.getStandardFileManager(null, null, null); |
| duke@1 | 42 | Iterable<? extends JavaFileObject> files = |
| duke@1 | 43 | fm.getJavaFileObjectsFromFiles(Arrays.asList(new File(testSrc, T6392782.class.getName()+".java"))); |
| duke@1 | 44 | JavacTask task = tool.getTask(null, fm, null, null, null, files); |
| duke@1 | 45 | Iterable<? extends Tree> trees = task.parse(); |
| duke@1 | 46 | TreeScanner<Integer,Void> scanner = new MyScanner(); |
| duke@1 | 47 | check(scanner, 6, scanner.scan(trees, null)); |
| duke@1 | 48 | |
| duke@1 | 49 | CountNodes nodeCounter = new CountNodes(); |
| duke@1 | 50 | // 383 nodes with the regular parser; 384 nodes with EndPosParser |
| duke@1 | 51 | // We automatically swith to EndPosParser when calling JavacTask.parse() |
| duke@1 | 52 | check(nodeCounter, 384, nodeCounter.scan(trees, null)); |
| duke@1 | 53 | |
| duke@1 | 54 | CountIdentifiers idCounter = new CountIdentifiers(); |
| duke@1 | 55 | check(idCounter, 106, idCounter.scan(trees, null)); |
| duke@1 | 56 | } |
| duke@1 | 57 | |
| duke@1 | 58 | private static void check(TreeScanner<?,?> scanner, int expect, int found) { |
| duke@1 | 59 | if (found != expect) |
| duke@1 | 60 | throw new AssertionError(scanner.getClass().getName() + ": expected: " + expect + " found: " + found); |
| duke@1 | 61 | } |
| duke@1 | 62 | |
| duke@1 | 63 | static class MyScanner extends TreeScanner<Integer,Void> { |
| duke@1 | 64 | @Override |
| duke@1 | 65 | public Integer visitImport(ImportTree tree, Void ignore) { |
| duke@1 | 66 | //System.err.println(tree); |
| duke@1 | 67 | return 1; |
| duke@1 | 68 | } |
| duke@1 | 69 | |
| duke@1 | 70 | @Override |
| duke@1 | 71 | public Integer reduce(Integer i1, Integer i2) { |
| duke@1 | 72 | return (i1 == null ? 0 : i1) + (i2 == null ? 0 : i2); |
| duke@1 | 73 | } |
| duke@1 | 74 | } |
| duke@1 | 75 | |
| duke@1 | 76 | // example from TreeScanner javadoc |
| duke@1 | 77 | static class CountNodes extends TreeScanner<Integer,Void> { |
| duke@1 | 78 | @Override |
| duke@1 | 79 | public Integer scan(Tree node, Void p) { |
| duke@1 | 80 | Integer n = super.scan(node, p); |
| duke@1 | 81 | return (n == null ? 0 : n) + 1; |
| duke@1 | 82 | } |
| duke@1 | 83 | @Override |
| duke@1 | 84 | public Integer reduce(Integer r1, Integer r2) { |
| duke@1 | 85 | return (r1 == null ? 0 : r1) + (r2 == null ? 0 : r2); |
| duke@1 | 86 | } |
| duke@1 | 87 | } |
| duke@1 | 88 | |
| duke@1 | 89 | // example from TreeScanner javadoc |
| duke@1 | 90 | static class CountIdentifiers extends TreeScanner<Integer,Void> { |
| duke@1 | 91 | @Override |
| duke@1 | 92 | public Integer visitIdentifier(IdentifierTree node, Void p) { |
| duke@1 | 93 | return 1; |
| duke@1 | 94 | } |
| duke@1 | 95 | @Override |
| duke@1 | 96 | public Integer reduce(Integer r1, Integer r2) { |
| duke@1 | 97 | return (r1 == null ? 0 : r1) + (r2 == null ? 0 : r2); |
| duke@1 | 98 | } |
| duke@1 | 99 | } |
| duke@1 | 100 | } |
