Searched refs:reachable (Results 1 - 5 of 5) sorted by relevance

/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DNode.java41 private boolean reachable; field in class:Node
53 return reachable;
57 reachable = b;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java223 // Mark all nodes reachable in backward traversal from root
224 Set<Node> reachable = new HashSet<Node>();
225 reachable.add(root);
231 if (!reachable.contains(n)) {
232 reachable.add(n);
240 if (n.block == null && reachable.contains(n)) {
257 if (reachable.contains(s)) {
288 Set<Node> curReachable = new HashSet<Node>(reachable);
292 if (!reachable.contains(s)) {
293 markWithBlock(s, n.block, reachable);
301 markWithBlock(Node n, InputBlock b, Set<Node> reachable) argument
[all...]
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dassembler_x86.cpp4380 bool Assembler::reachable(AddressLiteral adr) { function in class:Assembler
4384 // always be reachable.
4389 // This should be rip relative and easily reachable.
4397 // reachable until we get huge code caches. (At which point
4418 // For external_word_type/runtime_call_type if it is reachable from where we
4420 // anywhere in the codeCache then we are always reachable.
4446 // Check if the polling page is not reachable from the code cache using rip-relative
6118 assert(reachable(adr), "must be");
6328 if (reachable(src2)) {
6452 if (reachable(sr
[all...]
H A Dassembler_x86.hpp726 bool reachable(AddressLiteral adr) NOT_LP64({ return true;});
H A Dc1_LIRAssembler_x86.cpp234 if (! __ reachable(laddr)) {
817 // Always reachable in 32bit so this doesn't produce useless move literal
2781 // %%% Make this explode if addr isn't reachable until we figure out a

Completed in 81 milliseconds