| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/lib/ |
| H A D | ExsltSets.java | 103 Node startNode = nl2.item(0);
104 if (!ns1.contains(startNode))
110 if (DOM2Helper.isNodeAfter(startNode, testNode)
111 && !DOM2Helper.isNodeTheSame(startNode, testNode))
|
| /openjdk10/jdk/src/java.xml.crypto/share/classes/com/sun/org/apache/xml/internal/security/utils/ |
| H A D | XMLUtils.java | 931 public static boolean protectAgainstWrappingAttack(Node startNode, String value) { argument
932 Node startParent = startNode.getParentNode();
941 while (startNode != null) {
942 if (startNode.getNodeType() == Node.ELEMENT_NODE) {
943 Element se = (Element) startNode;
962 processedNode = startNode;
963 startNode = startNode.getFirstChild();
966 if (startNode == null) {
968 startNode
990 protectAgainstWrappingAttack( Node startNode, Element knownElement, String value ) argument
[all...] |
| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/gen/ |
| H A D | PhiResolver.java | 95 boolean startNode; field in class:PhiResolver.PhiResolverNode
165 node.startNode = true;
238 } else if (!dest.startNode) {
|
| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/dtm/ref/ |
| H A D | DTMTreeWalker.java | 99 * operating as a Visitor. startNode (preorder) and endNode
115 startNode(pos);
149 * operating as a Visitor. startNode (preorder) and endNode
168 startNode(pos);
216 protected void startNode(int node) throws org.xml.sax.SAXException method in class:DTMTreeWalker
|
| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/utils/ |
| H A D | TreeWalker.java | 137 startNode(pos);
190 startNode(pos);
249 protected void startNode(Node node) throws org.xml.sax.SAXException method in class:TreeWalker
|
| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/serializer/ |
| H A D | TreeWalker.java | 117 startNode(pos);
171 startNode(pos);
230 protected void startNode(Node node) throws org.xml.sax.SAXException method in class:TreeWalker
294 // System.out.println("TreeWalker#startNode: "+node.getNodeName());
|
| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/dtm/ref/sax2dtm/ |
| H A D | SAX2DTM2.java | 1524 final int startNode = _startNode;
1525 if (startNode == NULL) {
1529 if (_includeSelf && (_currentNode + 1) == startNode)
1535 // %OPT% If the startNode is the root node, do not need
1537 if (startNode == ROOTNODE) {
1615 final int startNode = _startNode;
1632 if (NULL == expType || _parent2(node) < startNode && startNode != node) {
1642 else if (startNode == DTMDefaultBase.ROOTNODE)
1663 if (NULL == expType || _parent2(node) < startNode
[all...] |
| H A D | SAX2DTM.java | 527 int startNode = identity;
545 } while (DTM.NULL != identity && (_parent(identity) >= startNode));
1233 int startNode = identity;
1253 } while (DTM.NULL != identity && (_parent(identity) >= startNode));
|
| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/dom/ |
| H A D | RangeImpl.java | 1147 Node startNode = fStartContainer;
1149 startNode = startNode.getParentNode();
1160 for( Node sp = startNode.getParentNode(), ep = endNode.getParentNode();
1164 startNode = sp;
1167 return traverseCommonAncestors( startNode, endNode, how );
|
| /openjdk10/jdk/src/java.base/share/classes/java/util/concurrent/ |
| H A D | ConcurrentLinkedDeque.java | 1347 abstract Node<E> startNode(); method in class:ConcurrentLinkedDeque.AbstractItr
1361 Node<E> p = (nextNode == null) ? startNode() : nextNode(nextNode);
1401 Node<E> startNode() { return first(); } method in class:ConcurrentLinkedDeque.Itr
1408 Node<E> startNode() { return last(); } method in class:ConcurrentLinkedDeque.DescendingItr
|
| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xml/internal/serializer/dom3/ |
| H A D | DOM3TreeWalker.java | 262 startNode(pos);
335 startNode(pos);
383 protected void startNode(Node node) throws org.xml.sax.SAXException { method in class:DOM3TreeWalker
|
| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/ |
| H A D | GraphDecoder.java | 370 protected final LoopScope createInitialLoopScope(MethodScope methodScope, FixedWithNextNode startNode) { argument
373 if (startNode != null) {
379 registerNode(loopScope, GraphEncoder.START_NODE_ORDER_ID, AbstractBeginNode.prevBegin(startNode), false, false);
382 startNode.setNext(firstNode);
|
| H A D | IfNode.java | 1075 private void propagateZeroProbability(FixedNode startNode) { argument
1077 for (FixedNode node : GraphUtil.predecessorIterable(startNode)) {
|
| /openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
| H A D | HierarchicalLayoutManager.java | 1604 private void DFS(LayoutNode startNode) { argument
1605 if (visited.contains(startNode)) {
1610 stack.push(startNode);
|
| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.java/src/org/graalvm/compiler/java/ |
| H A D | BytecodeParser.java | 773 StartNode startNode = graph.start();
776 startNode.setStateAfter(createFrameState(BytecodeFrame.BEFORE_BCI, startNode));
788 startNode.setStateAfter(createFrameState(bci(), startNode));
790 if (startNode.stateAfter() == null) {
792 startNode.setStateAfter(stateAfterStart);
|
| /openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/ |
| H A D | DTDGrammar.java | 2282 private final CMNode buildSyntaxTree(int startNode, argument
2287 getContentSpec(startNode, contentSpec);
|