@Override public String toString() { return rootNode.toString(); }
@Override public String toString() { return rootNode.toString(); }
@Override public String toString() { return rootNode.toString(); }
@Override public String getName() { String result = nameCache; if (result == null) { CompilerDirectives.transferToInterpreterAndInvalidate(); result = rootNode.toString(); nameCache = result; } return result; }
@Override public String toString() { CompilerAsserts.neverPartOfCompilation(); String superString = rootNode.toString(); if (isValid()) { superString += " <opt>"; } if (sourceCallTarget != null) { superString += " <split-" + Integer.toHexString(hashCode()) + ">"; } return superString; }
private static String extractRootName(Node instrumentedNode) { RootNode rootNode = instrumentedNode.getRootNode(); if (rootNode != null) { if (rootNode.getName() == null) { return rootNode.toString(); } else { return rootNode.getName(); } } else { return "<Unknown>"; } }
private void visitRoot(RootNode root, final Node node, final AbstractNodeVisitor visitor, boolean forceRootBitComputation) { if (TRACE) { trace("BEGIN: Visit root %s for %s%n", root.toString(), visitor); } visitor.root = root; visitor.providedTags = getProvidedTags(root); visitor.rootSourceSection = root.getSourceSection(); visitor.rootBits = RootNodeBits.get(visitor.root); if (visitor.shouldVisit() || forceRootBitComputation) { if (forceRootBitComputation) { visitor.computingRootNodeBits = RootNodeBits.isUninitialized(visitor.rootBits) ? RootNodeBits.getAll() : visitor.rootBits; } else if (RootNodeBits.isUninitialized(visitor.rootBits)) { visitor.computingRootNodeBits = RootNodeBits.getAll(); } if (TRACE) { trace("BEGIN: Traverse root %s for %s%n", root.toString(), visitor); } visitor.visit(node); if (TRACE) { trace("END: Traverse root %s for %s%n", root.toString(), visitor); } if (!RootNodeBits.isUninitialized(visitor.computingRootNodeBits)) { RootNodeBits.set(visitor.root, visitor.computingRootNodeBits); } } if (TRACE) { trace("END: Visited root %s for %s%n", root.toString(), visitor); } }
private void visitRoot(RootNode root, final Node node, final AbstractNodeVisitor visitor, boolean forceRootBitComputation) { if (TRACE) { trace("BEGIN: Visit root %s for %s%n", root.toString(), visitor); } visitor.root = root; visitor.providedTags = getProvidedTags(root); visitor.rootSourceSection = root.getSourceSection(); visitor.rootBits = RootNodeBits.get(visitor.root); if (visitor.shouldVisit() || forceRootBitComputation) { if (forceRootBitComputation) { visitor.computingRootNodeBits = RootNodeBits.isUninitialized(visitor.rootBits) ? RootNodeBits.getAll() : visitor.rootBits; } else if (RootNodeBits.isUninitialized(visitor.rootBits)) { visitor.computingRootNodeBits = RootNodeBits.getAll(); } if (TRACE) { trace("BEGIN: Traverse root %s for %s%n", root.toString(), visitor); } visitor.visit(node); if (TRACE) { trace("END: Traverse root %s for %s%n", root.toString(), visitor); } if (!RootNodeBits.isUninitialized(visitor.computingRootNodeBits)) { RootNodeBits.set(visitor.root, visitor.computingRootNodeBits); } } if (TRACE) { trace("END: Visited root %s for %s%n", root.toString(), visitor); } }