Searched defs:walk (Results 1 - 6 of 6) sorted by relevance

/openjdk7/jdk/src/share/classes/java/nio/file/
H A DFileTreeWalker.java68 void walk(Path start) throws IOException { method in class:FileTreeWalker
69 FileVisitResult result = walk(start,
83 private FileVisitResult walk(Path file, method in class:FileTreeWalker
199 result = walk(entry, depth+1, ancestors);
/openjdk7/jdk/test/demo/zipfs/
H A DZipFSTester.java163 walk(fs.getPath("/"));
330 walk(fs4.getPath("/"));
432 private static void walk(Path path) throws IOException method in class:ZipFSTester
/openjdk7/jdk/src/share/demo/nio/zipfs/
H A DDemo.java130 walk, // <java Demo walk zipfile [dir]> enum constant in enum:Demo.Action
131 // recursively walk all entries of dir
135 // walk with buildDirTree=true
285 case walk:
286 walk(fs.getPath((args.length > 2)? args[2] : "/"));
385 private static void walk(Path path) throws IOException method in class:Demo
/openjdk7/hotspot/src/share/vm/opto/
H A Dnode.cpp1118 // path was taken for loops: it did not walk in a cycle.
1121 break; // already met before: walk in a cycle
1123 // Region nodes were visited. Continue walk up to Start or Root
1124 // to make sure that it did not walk in a cycle.
1177 // Find an incoming edge which has not been seen yet; walk through it.
1767 // walk the input array downcounting the input edges to n
1779 // Recursive walk over all input edges
1847 //------------------------------walk-------------------------------------------
1848 // Graph walk, with both pre-order and post-order functions
1849 void Node::walk(NFun function in class:Node
[all...]
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LinearScan.hpp704 // walk through all intervals
705 void walk() { walk_to(max_jint); } function in class:IntervalWalker
H A Dc1_LIRGenerator.cpp372 // This is where the tree-walk starts; instr must be root;
388 // This is called for each node in tree; the walk stops if a root is reached
389 void LIRGenerator::walk(Value instr) { function in class:LIRGenerator
391 //stop walk when encounter a root
417 walk(value);
444 walk(value);

Completed in 1186 milliseconds