Searched refs:Node (Results 1 - 25 of 645) sorted by relevance

1234567891011>>

/openjdk7/jaxp/src/org/w3c/dom/traversal/
H A DTreeWalker.java44 import org.w3c.dom.Node;
70 public Node getRoot();
116 public Node getCurrentNode();
132 public void setCurrentNode(Node currentNode)
144 public Node parentNode();
154 public Node firstChild();
164 public Node lastChild();
174 public Node previousSibling();
183 public Node nextSibling();
195 public Node previousNod
[all...]
H A DNodeIterator.java44 import org.w3c.dom.Node;
50 * governed by a particular <code>Node</code>, the results of a query, or
65 public Node getRoot();
107 * @return The next <code>Node</code> in the set being iterated over, or
113 public Node nextNode()
119 * @return The previous <code>Node</code> in the set being iterated over,
125 public Node previousNode()
/openjdk7/jaxp/src/org/w3c/dom/
H A DNamedNodeMap.java60 * @return A <code>Node</code> (of any type) with the specified
64 public Node getNamedItem(String name);
77 * @return If the new <code>Node</code> replaces an existing node the
78 * replaced <code>Node</code> is returned, otherwise <code>null</code>
94 public Node setNamedItem(Node arg)
111 public Node removeNamedItem(String name)
122 public Node item(int index);
137 * @return A <code>Node</code> (of any type) with the specified local
146 public Node getNamedItemN
[all...]
H A DDocumentFragment.java50 * which can hold such fragments and it is quite natural to use a Node for
57 * of another <code>Node</code> -- may take <code>DocumentFragment</code>
70 * <code>Document</code> (or indeed any other <code>Node</code> that may
73 * <code>Node</code>. This makes the <code>DocumentFragment</code> very
76 * the user can use the standard methods from the <code>Node</code>
77 * interface, such as <code>Node.insertBefore</code> and
78 * <code>Node.appendChild</code>.
81 public interface DocumentFragment extends Node {
H A DEntityReference.java71 public interface EntityReference extends Node {
H A DNodeList.java62 public Node item(int index);
/openjdk7/hotspot/src/share/vm/opto/
H A Dmacro.hpp33 class Node;
41 Node* top() const { return C->top(); }
42 Node* intcon(jint con) const { return _igvn.intcon(con); }
43 Node* longcon(jlong con) const { return _igvn.longcon(con); }
44 Node* makecon(const Type *t) const { return _igvn.makecon(t); }
45 Node* basic_plus_adr(Node* base, int offset) {
48 Node* basic_plus_adr(Node* base, Node* pt
[all...]
H A DidealKit.hpp63 // Node* limit = ??
66 // Node* exit = make_label(1); // 1 goto
98 // are managed via a Node [in(1)..in(_var_ct)], and the predecessor
99 // control edges managed via a RegionNode. The in(0) of the Node
104 GrowableArray<Node*>* _pending_cvstates; // stack of cvstates
105 Node* _cvstate; // current cvstate (control, memory and variables)
108 Node* _initial_ctrl; // saves initial control until variables declared
109 Node* _initial_memory; // saves initial memory until variables declared
110 Node* _initial_i_o; // saves initial i_o until variables declared
114 Node* new_cvstat
[all...]
H A DgraphKit.hpp92 void record_for_igvn(Node* n) const { C->record_for_igvn(n); } // delegate to Compile
95 Node* null() const { return zerocon(T_OBJECT); }
96 Node* top() const { return C->top(); }
100 Node* intcon(jint con) const { return _gvn.intcon(con); }
101 Node* longcon(jlong con) const { return _gvn.longcon(con); }
102 Node* makecon(const Type *t) const { return _gvn.makecon(t); }
103 Node* zerocon(BasicType bt) const { return _gvn.zerocon(bt); }
107 Node* byte_map_base_node() {
118 jint find_int_con(Node* n, jint value_if_unknown) {
121 jlong find_long_con(Node*
[all...]
H A Dstringopts.hpp62 Node* fetch_static_field(GraphKit& kit, ciField* field);
65 Node* int_stringSize(GraphKit& kit, Node* value);
68 void int_getChars(GraphKit& kit, Node* value, Node* char_array, Node* start, Node* end);
71 Node* copy_string(GraphKit& kit, Node* str, Node* char_arra
[all...]
H A Dclasses.cpp45 int Node::Opcode() const { return Op_Node; }
46 #define macro(x) int x##Node::Opcode() const { return Op_##x; }
H A Dmemnode.hpp41 class MemNode : public Node {
55 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at )
56 : Node(c0,c1,c2 ) {
60 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at, Node *c3 )
61 : Node(c
[all...]
H A Dloopnode.hpp39 class Node;
88 LoopNode( Node *entry, Node *backedge ) : RegionNode(3), _loop_flags(0), _unswitch_count(0) {
94 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
154 // Node count prior to last unrolling - used to decide if
159 CountedLoopNode( Node *entry, Node *backedge )
169 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
171 Node *init_control() const { return in(EntryControl); }
172 Node *back_contro
[all...]
H A Dconnode.hpp40 init_req(0, (Node*)Compile::current()->root());
140 class BinaryNode : public Node {
142 BinaryNode( Node *n1, Node *n2 ) : Node(0,n1,n2) { }
155 CMoveNode( Node *bol, Node *left, Node *right, const Type *t ) : TypeNode(t,4)
158 // all inputs are nullified in Node::Node(in
[all...]
H A Ddivnode.hpp43 class DivINode : public Node {
45 DivINode( Node *c, Node *dividend, Node *divisor ) : Node(c, dividend, divisor ) {}
47 virtual Node *Identity( PhaseTransform *phase );
48 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
56 class DivLNode : public Node {
58 DivLNode( Node *c, Node *dividen
[all...]
H A Dmulnode.hpp41 class MulNode : public Node {
44 MulNode( Node *in1, Node *in2 ): Node(0,in1,in2) {
48 // Handle algebraic identities here. If we have an identity, return the Node
50 virtual Node *Identity( PhaseTransform *phase );
52 // We also canonicalize the Node, moving constants to the right input,
54 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
84 MulINode( Node *in1, Node *in
[all...]
/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/rmi/altroot/
H A DNode.java30 public class Node implements Serializable { class in inherits:Serializable
/openjdk7/langtools/test/tools/javac/generics/
H A DCyclicInheritance5.java32 class G<N extends G.Node<N>> {
33 static class Node<N extends Node<N>> { class in class:G
37 static class MyNode extends G.Node<MyNode> {
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/IPAcl/
H A DNode.java27 /* Generated By:JJTree: Do not edit this line. Node.java */
35 interface Node { interface
47 public void jjtSetParent(Node n);
48 public Node jjtGetParent();
52 public void jjtAddChild(Node n, int i);
56 public Node jjtGetChild(int i);
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/signature/
H A DNodeFilter.java23 import org.w3c.dom.Node;
39 public int isNodeInclude(Node n);
51 public int isNodeIncludeDO(Node n, int level);
/openjdk7/jaxp/src/org/w3c/dom/html/
H A DHTMLCollection.java44 import org.w3c.dom.Node;
65 * @return The <code>Node</code> at the corresponding position upon
69 public Node item(int index);
72 * This method retrieves a <code>Node</code> using a name. It first
73 * searches for a <code>Node</code> with a matching <code>id</code>
75 * <code>Node</code> with a matching <code>name</code> attribute, but
77 * @param name The name of the <code>Node</code> to be fetched.
78 * @return The <code>Node</code> with a <code>name</code> or
83 public Node namedItem(String name);
/openjdk7/langtools/test/tools/javac/generics/wildcards/
H A DT5097548.java33 interface Edge<N extends Node<? extends Edge<? extends N>>> {}
34 interface Node<E extends Edge<? extends Node<? extends E>>> {} interface
H A DT5097548b.java32 interface Edge<N extends Node<? extends Edge<N>>> {
35 interface Node<E extends Edge<? extends Node<E>>> { interface
41 Node<?> node = null;
/openjdk7/langtools/test/tools/javac/generics/6213818/
H A DT6213818.java32 static interface Edge<N extends Node<? extends Edge<N>>> { }
33 static interface Node<E extends Edge<? extends Node<E>>> { } interface in class:T6213818
34 static class BasicNode<E extends BasicEdge<N, E> & Edge<N>, N extends BasicNode<E, N> & Node<E>> implements Node<E> { }
35 static class BasicEdge<N extends BasicNode<E, N> & Node<E>, E extends BasicEdge<N, E> & Edge<N>> implements Edge<N> { }
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Coordinator/src/com/sun/hotspot/igv/coordinator/actions/
H A DRemoveCookie.java28 import org.openide.nodes.Node;
34 public interface RemoveCookie extends Node.Cookie {

Completed in 100 milliseconds

1234567891011>>