/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/tree/ |
H A D | TreeScanner.java | 48 public void scan(JCTree tree) { method in class:TreeScanner 52 /** Visitor method: scan a list of nodes. 54 public void scan(List<? extends JCTree> trees) { method in class:TreeScanner 57 scan(l.head); 66 scan(tree.defs); 70 scan(tree.annotations); 71 scan(tree.pid); 76 scan(tree.mods); 77 scan(tree.qualId); 78 scan(tre [all...] |
/openjdk10/jdk/test/java/io/StreamTokenizer/ |
H A D | Reset.java | 38 StreamTokenizer scan = new StreamTokenizer(in); 40 scan.nextToken(); 41 scan.nextToken(); 43 int token = scan.nextToken();
|
/openjdk10/langtools/src/java.compiler/share/classes/javax/lang/model/util/ |
H A D | ElementScanner6.java | 38 * class scan their component elements by calling {@code scan} on 44 * may get the desired behavior be invoking {@code v.scan(e, p)} rather 57 * should call {@code scan} with the elements in the desired order. 129 * #scan(Element, Object) scan(Element, P)} on each one. Returns 130 * the result of the last call to {@code scan} or {@code 133 * @param iterable the elements to scan 135 * @return the scan of the last element or {@code DEFAULT_VALUE} if no elements 137 public final R scan(Iterabl method in class:ElementScanner6 152 public R scan(Element e, P p) { method in class:ElementScanner6 162 public final R scan(Element e) { method in class:ElementScanner6 [all...] |
/openjdk10/langtools/src/jdk.jshell/share/classes/jdk/jshell/ |
H A D | TreeDependencyScanner.java | 50 public void scan(Tree node) { method in class:TreeDependencyScanner 51 scan(node, decl); 70 scan(node.getModifiers(), p); 71 scan(node.getTypeParameters(), p); 72 scan(node.getExtendsClause(), p); 73 scan(node.getImplementsClause(), p); 74 scan(node.getMembers(), body); 80 scan(node.getModifiers(), p); 81 scan(node.getReturnType(), p); 82 scan(nod [all...] |
/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/source/util/ |
H A D | DocTreeScanner.java | 43 * result of calling {@code scan} on that child. The child may be a simple node 46 * be determined by calling {@code scan} each child in turn, and then combining the 47 * result of each scan after the first with the cumulative result 78 public R scan(DocTree node, P p) { method in class:DocTreeScanner 83 return reduce(scan(node, p), r); 93 public R scan(Iterable<? extends DocTree> nodes, P p) { method in class:DocTreeScanner 98 r = (first ? scan(node, p) : scanAndReduce(node, p, r)); 106 return reduce(scan(nodes, p), r); 147 return scan(node.getName(), p); 171 return scan(nod [all...] |
H A D | TreeScanner.java | 42 * result of calling {@code scan} on that child. The child may be a simple node 45 * be determined by calling {@code scan} each child in turn, and then combining the 46 * result of each scan after the first with the cumulative result 85 public R scan(Tree tree, P p) { method in class:TreeScanner 90 return reduce(scan(node, p), r); 100 public R scan(Iterable<? extends Tree> nodes, P p) { method in class:TreeScanner 105 r = (first ? scan(node, p) : scanAndReduce(node, p, r)); 113 return reduce(scan(nodes, p), r); 142 R r = scan(node.getPackage(), p); 157 R r = scan(nod [all...] |
H A D | DocTreePathScanner.java | 47 public R scan(DocTreePath path, P p) { method in class:DocTreePathScanner 58 * The current path is updated for the duration of the scan. 64 public R scan(DocTree tree, P p) { method in class:DocTreePathScanner 79 * active set of scan calls.
|
H A D | TreePathScanner.java | 39 * In order to initialize the "current path", the scan must be 40 * started by calling one of the {@code scan} methods. 53 public R scan(TreePath path, P p) { method in class:TreePathScanner 64 * The current path is updated for the duration of the scan. 67 * scanner's {@code visit} methods, as part of an ongoing scan 68 * initiated by {@link #scan(TreePath,Object) scan(TreePath, P)}. 70 * a full scan of a {@link CompilationUnitTree}. 75 public R scan(Tree tree, P p) { method in class:TreePathScanner 90 * active set of scan call [all...] |
/openjdk10/langtools/test/tools/javac/6199662/ |
H A D | TreeScanner.java | 31 public void scan(Tree tree) throws E { method in class:TreeScanner
|
H A D | TreeInfo.java | 31 public void scan(Tree tree) {
|
/openjdk10/jdk/src/jdk.rmic/share/classes/sun/tools/java/ |
H A D | Parser.java | 104 * by <code>this.scan()</code> and the constructor. 299 * Expect a token, return its value, scan the next token or 314 scan(); 323 return new TypeExpression(scan(), Type.tVoid); 325 return new TypeExpression(scan(), Type.tBoolean); 327 return new TypeExpression(scan(), Type.tByte); 329 return new TypeExpression(scan(), Type.tChar); 331 return new TypeExpression(scan(), Type.tShort); 333 return new TypeExpression(scan(), Type.tInt); 335 return new TypeExpression(scan(), Typ 2111 public long scan() throws IOException { method in class:Parser [all...] |
/openjdk10/langtools/test/tools/javac/processing/model/6194785/ |
H A D | T6194785.java | 55 Scan scan = new Scan(); 57 scan.scan(e);
|
/openjdk10/langtools/src/jdk.javadoc/share/classes/com/sun/tools/javadoc/main/ |
H A D | JavadocMemberEnter.java | 132 scan(tree); 136 public void scan(JCTree tree) { method in class:JavadocMemberEnter.MaybeConstantExpressionScanner 137 // short circuit scan when end result is definitely false 166 scan(tree.cond); 167 scan(tree.truepart); 168 scan(tree.falsepart); 179 scan(tree.expr); 184 scan(tree.selected); 189 scan(tree.clazz); 190 scan(tre [all...] |
/openjdk10/langtools/src/jdk.javadoc/share/classes/jdk/javadoc/internal/tool/ |
H A D | JavadocMemberEnter.java | 124 scan(tree); 128 public void scan(JCTree tree) { method in class:JavadocMemberEnter.MaybeConstantExpressionScanner 129 // short circuit scan when end result is definitely false 158 scan(tree.cond); 159 scan(tree.truepart); 160 scan(tree.falsepart); 171 scan(tree.expr); 176 scan(tree.selected); 181 scan(tree.clazz); 182 scan(tre [all...] |
/openjdk10/jdk/src/java.desktop/share/classes/java/awt/image/ |
H A D | MemoryImageSource.java | 128 * @param scan the distance from one row of pixels to the next in 133 byte[] pix, int off, int scan) { 134 initialize(w, h, cm, (Object) pix, off, scan, null); 146 * @param scan the distance from one row of pixels to the next in 153 byte[] pix, int off, int scan, 156 initialize(w, h, cm, (Object) pix, off, scan, props); 168 * @param scan the distance from one row of pixels to the next in 173 int[] pix, int off, int scan) { 174 initialize(w, h, cm, (Object) pix, off, scan, null); 186 * @param scan th 132 MemoryImageSource(int w, int h, ColorModel cm, byte[] pix, int off, int scan) argument 152 MemoryImageSource(int w, int h, ColorModel cm, byte[] pix, int off, int scan, Hashtable<?,?> props) argument 172 MemoryImageSource(int w, int h, ColorModel cm, int[] pix, int off, int scan) argument 192 MemoryImageSource(int w, int h, ColorModel cm, int[] pix, int off, int scan, Hashtable<?,?> props) argument 199 initialize(int w, int h, ColorModel cm, Object pix, int off, int scan, Hashtable<?,?> props) argument 226 MemoryImageSource(int w, int h, int pix[], int off, int scan) argument 246 MemoryImageSource(int w, int h, int pix[], int off, int scan, Hashtable<?,?> props) argument [all...] |
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/nodes/ |
H A D | BitScanForwardNode.java | 67 int firstAlwaysSetBit = scan(valueStamp.downMask() & mask); 68 int firstMaybeSetBit = scan(valueStamp.upMask() & mask); 70 int lastMaybeSetBit = BitScanReverseNode.scan(valueStamp.upMask() & mask); 84 return ConstantNode.forInt(value.getStackKind() == JavaKind.Int ? scan(c.asInt()) : scan(c.asLong())); 102 public static int scan(long v) { method in class:BitScanForwardNode 115 public static int scan(int v) { method in class:BitScanForwardNode 116 return scan(0xffffffffL & v);
|
H A D | BitScanReverseNode.java | 67 int lastAlwaysSetBit = scan(valueStamp.downMask() & mask); 69 int firstMaybeSetBit = BitScanForwardNode.scan(valueStamp.upMask() & mask); 74 int lastMaybeSetBit = scan(valueStamp.upMask() & mask); 84 return ConstantNode.forInt(forValue.getStackKind() == JavaKind.Int ? scan(c.asInt()) : scan(c.asLong())); 96 public static int scan(long v) { method in class:BitScanReverseNode 106 public static int scan(int v) { method in class:BitScanReverseNode
|
/openjdk10/langtools/test/tools/jdeprscan/tests/jdk/jdeprscan/ |
H A D | TestMethodSig.java | 27 * @modules jdk.jdeps/com.sun.tools.jdeprscan.scan 36 import static com.sun.tools.jdeprscan.scan.MethodSig.fromDesc;
|
/openjdk10/hotspot/src/share/vm/oops/ |
H A D | symbol.cpp | 90 address scan = bytes + i; local 91 if (scan > limit) 93 for (; scan <= limit; scan++) { 94 scan = (address) memchr(scan, first_char, (limit + 1 - scan)); 95 if (scan == NULL) 97 assert(scan >= bytes+i && scan < [all...] |
/openjdk10/langtools/test/tools/javac/enum/6424358/ |
H A D | T6424358.java | 65 Scan scan = new Scan(); 67 scan.scan(e);
|
/openjdk10/langtools/test/tools/javac/api/ |
H A D | T6392782.java | 27 * @summary TreeScanner.visitImport returns null, not result of nested scan 49 check(scanner, 6, scanner.scan(trees, null)); 54 check(nodeCounter, 362, nodeCounter.scan(trees, null)); 57 check(idCounter, 107, idCounter.scan(trees, null)); 81 public Integer scan(Tree node, Void p) { method in class:T6392782.CountNodes 84 Integer n = super.scan(node, p);
|
/openjdk10/jdk/src/java.desktop/unix/native/libawt/java2d/loops/ |
H A D | vis_DrawLine.c | 44 if ((((jint)pPix | scan) & 3) == 0) { \ 75 mlib_s32 scan = pRasInfo->scanStride; \ 82 PTR_ADD(pPix, y1 * scan + x1 * ANYTYPE##PixelStride); \ 88 if (bumpmajormask & 0x4) bumpmajor = scan; else \ 89 bumpmajor = - scan; \ 93 if (bumpminormask & 0x4) bumpminor = scan; else \ 94 if (bumpminormask & 0x8) bumpminor = -scan; else \
|
/openjdk10/langtools/test/tools/javac/tree/ |
H A D | TestToString.java | 85 checkEqual(scan(t.parse()), stmt); 88 String scan(Iterable<? extends CompilationUnitTree> trees) { method in class:TestToString 90 String scan(Iterable<? extends Tree> trees) { 92 scan(trees, sb); 96 public Void scan(Tree tree, StringBuilder sb) { 103 return super.scan(tree, sb); 117 return new Scanner().scan(trees);
|
/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/ |
H A D | Flow.java | 257 * Definite assignment scan mode 391 public void scan(JCTree tree) { method in class:Flow.BaseAnalyzer 395 super.scan(tree); 443 scan(tree); 485 scan(l.head); 527 scan(tree.init); 543 scan(tree.cond); 551 scan(tree.cond); 564 scan(tree.cond); 571 scan(tre [all...] |
/openjdk10/langtools/test/tools/javac/processing/model/type/ |
H A D | BasicAnnoTests.java | 99 s.scan(e, null); 116 public Void scan(Element elem, Void ignore) { method in class:BasicAnnoTests.TestElementScanner 130 return super.scan(elem, ignore); 158 scan(t, null); 162 Void scan(TypeMirror t, Void ignore) { method in class:BasicAnnoTests.TestTypeScanner 170 out.println("scan " + count + ": " + t); 203 return super.scan(t, ignore); 318 scan(t.getComponentType(), p); 325 scan(t.getTypeVariables(), p); 327 scan( 365 R scan(TypeMirror t) { method in class:BasicAnnoTests.TypeScanner 369 R scan(TypeMirror t, P p) { method in class:BasicAnnoTests.TypeScanner 373 R scan(Iterable<? extends TypeMirror> iter, P p) { method in class:BasicAnnoTests.TypeScanner [all...] |