Mercurial > jdk8-mips64-public > langtools / file comparison
comparison: src/share/classes/com/sun/source/util/TreeScanner.java
src/share/classes/com/sun/source/util/TreeScanner.java
- changeset 1521
- 71f35e4b93a5
- parent 1436
- f6f1fd261f57
- child 1590
- 011cf7e0a148
equal
deleted
inserted
replaced
| 1520:5c956be64b9e | 1521:71f35e4b93a5 |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved. | 2 * Copyright (c) 2005, 2013, Oracle and/or its affiliates. All rights reserved. |
| 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | 4 * |
| 5 * This code is free software; you can redistribute it and/or modify it | 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 | 6 * under the terms of the GNU General Public License version 2 only, as |
| 7 * published by the Free Software Foundation. Oracle designates this | 7 * published by the Free Software Foundation. Oracle designates this |
| 136 public R visitMethod(MethodTree node, P p) { | 136 public R visitMethod(MethodTree node, P p) { |
| 137 R r = scan(node.getModifiers(), p); | 137 R r = scan(node.getModifiers(), p); |
| 138 r = scanAndReduce(node.getReturnType(), p, r); | 138 r = scanAndReduce(node.getReturnType(), p, r); |
| 139 r = scanAndReduce(node.getTypeParameters(), p, r); | 139 r = scanAndReduce(node.getTypeParameters(), p, r); |
| 140 r = scanAndReduce(node.getParameters(), p, r); | 140 r = scanAndReduce(node.getParameters(), p, r); |
| 141 r = scanAndReduce(node.getReceiverParameter(), p, r); | |
| 141 r = scanAndReduce(node.getThrows(), p, r); | 142 r = scanAndReduce(node.getThrows(), p, r); |
| 142 r = scanAndReduce(node.getBody(), p, r); | 143 r = scanAndReduce(node.getBody(), p, r); |
| 143 r = scanAndReduce(node.getDefaultValue(), p, r); | 144 r = scanAndReduce(node.getDefaultValue(), p, r); |
| 144 return r; | 145 return r; |
| 145 } | 146 } |
| 374 public R visitIntersectionType(IntersectionTypeTree node, P p) { | 375 public R visitIntersectionType(IntersectionTypeTree node, P p) { |
| 375 return scan(node.getBounds(), p); | 376 return scan(node.getBounds(), p); |
| 376 } | 377 } |
| 377 | 378 |
| 378 public R visitTypeParameter(TypeParameterTree node, P p) { | 379 public R visitTypeParameter(TypeParameterTree node, P p) { |
| 379 R r = scan(node.getBounds(), p); | 380 R r = scan(node.getAnnotations(), p); |
| 381 r = scanAndReduce(node.getBounds(), p, r); | |
| 380 return r; | 382 return r; |
| 381 } | 383 } |
| 382 | 384 |
| 383 public R visitWildcard(WildcardTree node, P p) { | 385 public R visitWildcard(WildcardTree node, P p) { |
| 384 return scan(node.getBound(), p); | 386 return scan(node.getBound(), p); |
| 392 R r = scan(node.getAnnotationType(), p); | 394 R r = scan(node.getAnnotationType(), p); |
| 393 r = scanAndReduce(node.getArguments(), p, r); | 395 r = scanAndReduce(node.getArguments(), p, r); |
| 394 return r; | 396 return r; |
| 395 } | 397 } |
| 396 | 398 |
| 399 public R visitAnnotatedType(AnnotatedTypeTree node, P p) { | |
| 400 R r = scan(node.getAnnotations(), p); | |
| 401 r = scanAndReduce(node.getUnderlyingType(), p, r); | |
| 402 return r; | |
| 403 } | |
| 404 | |
| 397 public R visitOther(Tree node, P p) { | 405 public R visitOther(Tree node, P p) { |
| 398 return null; | 406 return null; |
| 399 } | 407 } |
| 400 | 408 |
| 401 public R visitErroneous(ErroneousTree node, P p) { | 409 public R visitErroneous(ErroneousTree node, P p) { |
