/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/ |
H A D | DOMBuilder.java | 54 /** Current node */ 57 /** The root node */ 60 /** The next sibling node */ 63 /** First node of document fragment or null if not a DocumentFragment */ 74 * @param node Current node 76 public DOMBuilder(Document doc, Node node) argument 79 m_currentNode = m_root = node; 81 if (node instanceof Element) 82 m_elemStack.push(node); [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/ui/ |
H A D | Inspector.java | 273 Object node = tree.getLastSelectedPathComponent(); 274 if (node != null && node instanceof SimpleTreeNode) { 275 showInspector((SimpleTreeNode)node);
|
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/gui/ |
H A D | ThreadTreeTool.java | 97 ThreadTreeNode node = 100 if (node.isLeaf()) { 103 node.getThreadId() + 105 node.getName() + "\")"); 283 // A like-named interior node already exists. 286 // Insert new node before the child. 292 // Insert new node after last child.
|
H A D | ClassTreeTool.java | 89 ClassTreeNode node = (ClassTreeNode) 91 if (node != null) { 92 interpreter.executeCommand("view " + node.getReferenceTypeName()); 105 ClassTreeNode node = 108 if (node.isLeaf()) { 110 interpreter.executeCommand("view " + node.getReferenceTypeName()); 234 // like-named node already exists 237 // insert new node before the child 243 // insert new node after last child
|
/openjdk7/jdk/src/share/classes/sun/tools/tree/ |
H A D | ContinueStatement.java | 63 switch (destctx.node.op) {
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | FutureTask.java | 430 * Tries to unlink a timed-out or interrupted wait node to avoid 439 private void removeWaiter(WaitNode node) { argument 440 if (node != null) { 441 node.thread = null;
|
H A D | ConcurrentHashMap.java | 373 * Also, scanAndLockForPut speculatively creates a fresh node 374 * to use in put if no node is found. 432 HashEntry<K,V> node = tryLock() ? null : 454 if (node != null) 455 node.setNext(first); 457 node = new HashEntry<K,V>(hash, key, value, first); 460 rehash(node); 462 setEntryAt(tab, index, node); 477 * given node to new table 480 private void rehash(HashEntry<K,V> node) { argument [all...] |
/openjdk7/jdk/src/share/classes/java/util/prefs/ |
H A D | Preferences.java | 46 * A node in a hierarchical collection of preference data. This class 65 * directories in a hierarchical file system. Every node in a preference 66 * tree has a <i>node name</i> (which is not necessarily unique), 70 * <p>The root node has a node name of the empty string (""). Every other 71 * node has an arbitrary node name, specified at the time it is created. The 75 * <p>The root node has an absolute path name of <tt>"/"</tt>. Children of 76 * the root node have absolute path names of <tt>"/" + </tt><i><node 939 public abstract Preferences node(String pathName); method in class:Preferences [all...] |
/openjdk7/jdk/src/share/classes/javax/imageio/metadata/ |
H A D | IIOMetadata.java | 247 * will usually create a dummy node for the root, and then a 680 * Appends a new node to an existing node, if the new node is 683 private void append(IIOMetadataNode root, IIOMetadataNode node) { argument 684 if (node != null) { 685 root.appendChild(node); 697 * of the root node. If any of those methods returns 700 * single root node will be returned.
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | ptrQueue.cpp | 137 BufferNode *node = BufferNode::make_node_from_buffer(buf); local 138 node->set_next(_fl_owner->_buf_free_list); 139 _fl_owner->_buf_free_list = node;
|
/openjdk7/jdk/src/macosx/native/jobjc/src/generator/java/com/apple/internal/jobjc/generator/model/ |
H A D | Framework.java | 91 public FrameworkDependency(final Node node, final Framework parent) { argument 92 super(getAttr(node, "path").replaceFirst("^.*/([^/]+)\\.framework$", "$1"), parent); 93 this.path = getAttr(node, "path");
|
/openjdk7/jaxws/src/share/jaxws_classes/javax/xml/bind/helpers/ |
H A D | AbstractMarshallerImpl.java | 126 public final void marshal( Object obj, org.w3c.dom.Node node ) 129 checkNotNull( obj, "obj", node, "node" ); 130 marshal( obj, new DOMResult(node) );
|
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/ |
H A D | trees.c | 451 /* Index within the heap array of least frequent node in the Huffman tree */ 474 * Restore the heap property by moving down the tree starting at node k, 475 * exchanging a node with the smallest of its two sons if necessary, stopping 482 int k; /* node to move down */ 545 if (n > max_code) continue; /* not a leaf node */ 652 int node; /* new node being created */ local 675 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); 676 tree[node].Freq = 1; 677 s->depth[node] [all...] |
/openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/ |
H A D | TestEnvironment.java | 93 public void visit(Node node) { argument 94 if (node instanceof Test) { 95 ((Test) node).runTest(this);
|
/openjdk7/jdk/test/java/util/UUID/ |
H A D | UUIDTest.java | 205 test.node(); 211 if (test.node() != 1) 212 throw new Exception("Incorrect node"); 214 if (test.node() != ((2L<<47)-1)) // 2^48 - 1 215 throw new Exception("Incorrect node");
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | escape.hpp | 29 #include "opto/node.hpp" 57 // PointsTo(n) - n is any CG node, it returns the set of JO that n could 85 // The following node types are JavaObject: 108 // Then, for each node which is GlobalEscape, anything it could point to 109 // is marked GlobalEscape. Finally, for any node marked ArgEscape, anything 130 GrowableArray<PointsToNode*> _edges; // List of nodes this node points to 131 GrowableArray<PointsToNode*> _uses; // List of nodes which point to this node 138 Node* const _node; // Ideal node corresponding to this PointsTo node. 139 const int _idx; // Cached ideal node' 296 const PointsToNode* node; member in class:PointsToIterator [all...] |
H A D | superword.hpp | 29 #include "opto/node.hpp" 71 // node are threaded through _next_in for incoming edges and _next_out 93 // A node in the dependence graph. _in_head starts the threaded list of 97 Node* _node; // Corresponding ideal node 102 DepMem(Node* node) : _node(node), _in_head(NULL), _out_head(NULL) {} argument 104 Node* node() { return _node; } function in class:DepMem 133 // Return dependence node corresponding to an ideal node 134 DepMem* dep(Node* node) { retur argument [all...] |
H A D | regalloc.hpp | 49 VectorSet _node_oops; // Mapping from node indices to oopiness 78 // notify the register allocator that "node" is a new reference 80 virtual void add_reference( const Node *node, const Node *old_node) = 0; 104 // Set and query if a node produces an oop
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/ |
H A D | DTMDefaultBase.java | 52 // node of a DTM. 53 /** The identity of the root node. */ 58 * node index. 62 /** The expanded names, one array element for each node. */ 65 /** First child values, one array element for each node. */ 68 /** Next sibling values, one array element for each node. */ 71 /** Previous sibling values, one array element for each node. */ 74 /** Previous sibling values, one array element for each node. */ 92 /** The default block size of the node arrays */ 95 /** The number of blocks for the node array [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | Predicate.java | 85 * Cached node type of the expression that owns this predicate. 185 SyntaxTreeNode node = getParent(); 187 if (node instanceof Closure) { 188 _parentClosure = (Closure) node; 191 if (node instanceof TopLevelElement) { 194 node = node.getParent(); 195 } while (node != null); 231 * Returns the node type of the expression owning this predicate. The 397 "node", [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/traversers/ |
H A D | XSDSimpleTypeTraverser.java | 176 Element node = DOMUtil.getParent(simpleTypeDecl); 177 while (node != null && (node != DOMUtil.getRoot(DOMUtil.getDocument(node)))) { 178 typeName.append(node.getAttribute(SchemaSymbols.ATT_NAME)); 179 node = DOMUtil.getParent(node);
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | LinkedList.java | 88 * Pointer to first node. 95 * Pointer to last node. 167 * Unlinks non-null first node f. 186 * Unlinks non-null last node l. 205 * Unlinks non-null node x. 416 succ = node(index); 475 return node(index).item; 489 Node<E> x = node(index); 510 linkBefore(element, node(index)); 524 return unlink(node(inde 564 Node<E> node(int index) { method in class:LinkedList [all...] |
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/api/ |
H A D | JavacTaskImpl.java | 326 for (JCTree node : unit.defs) { 327 if (node.getTag() == JCTree.CLASSDEF) { 328 JCClassDecl cdef = (JCClassDecl) node; 451 for (Tree node : path) 452 last = node; 468 public Iterable<? extends Tree> pathFor(CompilationUnitTree unit, Tree node) { argument 469 return TreeInfo.pathFor((JCTree) node, (JCTree.JCCompilationUnit) unit).reverse();
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
H A D | ServerCompilerScheduler.java | 416 stack.push(succ.index); // TODO: check if same node could be pushed twice 555 Node node = new Node(); 556 node.inputNode = n; 557 nodes.add(node); 559 node.isBlockProjection = (p != null && p.equals("true")); 561 node.isBlockStart = (p != null && p.equals("true")); 562 inputNodeToNode.put(n, node);
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/widgets/ |
H A D | FigureWidget.java | 77 private Node node; field in class:FigureWidget 88 return node; 166 // Initialize node for property sheet 167 node = new AbstractNode(Children.LEAF) { 176 node.setDisplayName(getName());
|