/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | LinkedBlockingDeque.java | 106 /** Doubly-linked list node class */ 109 * The item, or null if this node has been removed. 135 * Pointer to first node. 142 * Pointer to last node. 212 * Links node as first element, or returns false if full. 214 private boolean linkFirst(Node<E> node) { argument 219 node.next = f; 220 first = node; 222 last = node; 224 f.prev = node; 233 linkLast(Node<E> node) argument [all...] |
/openjdk7/jdk/src/share/classes/sun/tools/tree/ |
H A D | Context.java | 39 Node node; field in class:Context 86 Context(Context ctx, Node node) { argument 101 this.node = node; 680 if ((ctx.node != null) && (ctx.node instanceof Statement)) { 681 if (((Statement)(ctx.node)).hasLabel(lbl)) 697 if (ctx.node != null) { 698 switch (ctx.node.op) { 719 if (ctx.node ! [all...] |
H A D | Statement.java | 224 if (c.node == null) 226 if (c.node.op == SYNCHRONIZED) { 228 } else if (c.node.op == FINALLY 232 FinallyStatement st = ((FinallyStatement)(c.node)); 268 if (c.node == null) 270 if (c.node.op == SYNCHRONIZED) { 272 } else if (c.node.op == FINALLY 274 FinallyStatement st = ((FinallyStatement)(c.node));
|
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/util/ |
H A D | ErrorMsg.java | 226 public ErrorMsg(String code, SyntaxTreeNode node) { argument 228 _url = getFileName(node); 229 _line = node.getLineNumber(); 232 public ErrorMsg(String code, Object param1, SyntaxTreeNode node) { argument 234 _url = getFileName(node); 235 _line = node.getLineNumber(); 241 SyntaxTreeNode node) { 243 _url = getFileName(node); 244 _line = node.getLineNumber(); 254 private String getFileName(SyntaxTreeNode node) { argument 240 ErrorMsg(String code, Object param1, Object param2, SyntaxTreeNode node) argument [all...] |
H A D | TypeCheckError.java | 37 public TypeCheckError(SyntaxTreeNode node) { argument 39 _node = node;
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/bugspot/ |
H A D | VariablePanel.java | 100 SimpleTreeNode node = null; 136 node = new sun.jvm.hotspot.ui.tree.FloatTreeNodeAdapter(coll.floatAt(local.getSlot()), f, true); 140 node = new sun.jvm.hotspot.ui.tree.DoubleTreeNodeAdapter(coll.doubleAt(local.getSlot()), f, true); 144 node = new sun.jvm.hotspot.ui.tree.CharTreeNodeAdapter((char) coll.intAt(local.getSlot()), f, true); 150 node = new sun.jvm.hotspot.ui.tree.LongTreeNodeAdapter(coll.intAt(local.getSlot()), f, true); 154 node = new sun.jvm.hotspot.ui.tree.BooleanTreeNodeAdapter( 160 node = new sun.jvm.hotspot.ui.tree.LongTreeNodeAdapter(coll.longAt(local.getSlot()), f, true); 165 node = new sun.jvm.hotspot.ui.tree.OopTreeNodeAdapter( 169 node = new sun.jvm.hotspot.ui.tree.FieldTreeNodeAdapter(f, true) { 182 if (node ! [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | ForwardPositionIterator.java | 32 * a node in document order. It is needed for the case where 92 public DTMAxisIterator setStartNode(int node) { argument 93 _source.setStartNode(node);
|
H A D | NthIterator.java | 77 int node; 78 while ((node = _source.next()) != DTMAxisIterator.END) { 80 return node; 88 public DTMAxisIterator setStartNode(final int node) { argument 90 _source.setStartNode(node);
|
H A D | UnionIterator.java | 81 public HeapNode setStartNode(int node) { argument 82 iterator.setStartNode(node);
|
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/ |
H A D | MBeansTab.java | 241 DefaultMutableTreeNode node = 243 sheet.displayNode(node); 254 DefaultMutableTreeNode node = 256 if (sheet.isMBeanNode(node)) { 269 DefaultMutableTreeNode node = 271 if (sheet.isMBeanNode(node) && !tree.hasMetadataNodes(node)) { 272 tree.addMetadataNodes(node);
|
/openjdk7/jdk/test/java/rmi/reliability/benchmark/bench/rmi/ |
H A D | ObjTreeCalls.java | 91 Node node = new Node(null, depth); 95 stub.call(node);
|
H A D | SmallObjTreeCalls.java | 82 Node node = new Node(null, depth); 86 stub.call(node);
|
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | SyntaxTreeNode.java | 70 protected SyntaxTreeNode _parent; // Parent node 71 private Stylesheet _stylesheet; // Stylesheet ancestor node 72 private Template _template; // Template ancestor node 139 * Set the QName for the syntax tree node. 140 * @param qname The QName for the syntax tree node 158 * @param qname The QName for the syntax tree node 209 * this syntax tree node. 210 * @return Attributes for this syntax tree node 240 * Adds a single prefix mapping to this syntax tree node. 309 * Set this node' 462 updateScope(Parser parser, SyntaxTreeNode node) argument 544 isSimpleRTF(SyntaxTreeNode node) argument 565 isAdaptiveRTF(SyntaxTreeNode node) argument 593 isTextElement(SyntaxTreeNode node, boolean doExtendedCheck) argument [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/resolver/readers/ |
H A D | DOMCatalogReader.java | 139 * <li>For each child of the root node, it calls the parser's 143 * is appropriate (perhaps using just the node passed in, perhaps 217 Node node = root.getFirstChild(); 218 while (node != null) { 219 domParser.parseCatalogEntry(catalog, node); 220 node = node.getNextSibling();
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/utilities/ |
H A D | RBTree.java | 33 augmentation is one in which a node contains auxiliary information 34 that can be computed by examining only this node and its left and 45 node data. This Comparator is also used to perform the generic 174 // This routine splices out a node. Note that we may not actually 176 // another node from the tree, copying its contents into z. 178 // y is the node to be unlinked from the tree 234 protected Object getNodeValue(RBNode node) { argument 235 return node.getData(); 356 /** Restores red-black property to tree after splicing out node 454 // leaves of the given node 455 verifyFromNode(RBNode node) argument 512 printFromNode(RBNode node, PrintStream tty, int indentDepth) argument [all...] |
/openjdk7/jdk/src/share/classes/com/sun/tools/example/debug/gui/ |
H A D | SourceTreeTool.java | 85 SourceTreeNode node = (SourceTreeNode) 87 interpreter.executeCommand("view " + node.getRelativePath()); 99 SourceTreeNode node = 102 if (node.isLeaf()) { 104 interpreter.executeCommand("view " + node.getRelativePath()); 236 * Returns the index of <code>node</code> in the receivers children. 237 * If the receiver does not contain <code>node</code>, -1 will be 241 public int getIndex(TreeNode node) { argument 244 if (children[i] == node) {
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/ws/wsdl/document/jaxws/ |
H A D | JAXWSBinding.java | 153 * @return Returns the node. 156 return node; 159 * @param node The node to set. 161 public void setNode(String node) { argument 162 this.node = node; 309 private String node; field in class:JAXWSBinding
|
/openjdk7/jdk/src/share/classes/sun/management/snmp/jvmmib/ |
H A D | JvmCompilationMeta.java | 94 return new SnmpInt(node.getJvmJITCompilerTimeMonitoring()); 97 return new SnmpCounter64(node.getJvmJITCompilerTimeMs()); 100 return new SnmpString(node.getJvmJITCompilerName()); 153 node = var; 292 protected JvmCompilationMBean node; field in class:JvmCompilationMeta
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/processing/ |
H A D | JavacProcessingEnvironment.java | 1268 for (JCTree node : unit.defs) { 1269 if (node.getTag() == JCTree.CLASSDEF) { 1270 ClassSymbol sym = ((JCClassDecl) node).sym; 1350 for (T node : nodes) 1351 treeCleaner.scan(node); 1356 public void scan(JCTree node) { 1357 super.scan(node); 1358 if (node != null) 1359 node.type = null; 1361 public void visitTopLevel(JCCompilationUnit node) { [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | AttrImpl.java | 64 * node is associated with. Attr nodes do not have parent nodes. 65 * Besides, the getOwnerElement() method can be used to get the element node 73 * The reason is that we now try and avoid to always create a Text node to 80 * new version, the Attr node has a value pointer which can either be the 83 * much as possible once we've switched to a node there is no going back. This 85 * the node we once returned. 89 * fewer objects! I mean, that's until we have to actually create the node... 96 * implementation of the ParentNode's node behavior. So there is still some 134 /** This can either be a String or the first child node. */ 176 // create a real text node a 668 lastChild(ChildNode node) argument [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/tree/ |
H A D | DefaultMutableTreeNode.java | 34 * A <code>DefaultMutableTreeNode</code> is a general-purpose node in a tree data 43 * A tree node may have at most one parent and 0 or more children. 45 * node's parent and children and also operations for examining the tree that 46 * the node is a part of. A node's tree is the set of all nodes that can be 47 * reached by starting at the node and following all the possible links to 48 * parents and children. A node with no parent is the root of its tree; a 49 * node with no children is a leaf. A tree may consist of many subtrees, 50 * each node acting as the root for its own subtree. 62 * synchronizing on the root node o [all...] |
/openjdk7/jdk/src/share/classes/java/util/regex/ |
H A D | Pattern.java | 956 * node. 967 * node. 1005 * If the Start node might possibly match supplementary characters. 1008 * (2) There is complement node of Category or Block 1322 * only a Start node and a LastNode node. 1705 private static void printObjectTree(Node node) { argument 1706 while(node != null) { 1707 if (node instanceof Prolog) { 1708 System.out.println(node); 3395 Start(Node node) argument 3430 StartS(Node node) argument 4072 Ques(Node node, int type) argument 4116 Curly(Node node, int cmin, int cmax, int type) argument 4263 GroupCurly(Node node, int cmin, int cmax, int type, int local, int group, boolean capture) argument 4488 add(Node node) argument 4881 First(Node node) argument 5293 optimize(Node node) argument [all...] |
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | objectMonitor.cpp | 526 ObjectWaiter node(Self) ; 528 node._prev = (ObjectWaiter *) 0xBAD ; 529 node.TState = ObjectWaiter::TS_CXQ ; 537 node._next = nxt = _cxq ; 538 if (Atomic::cmpxchg_ptr (&node, &_cxq, nxt) == nxt) break ; 666 UnlinkAfterAcquire (Self, &node) ; 1477 // create a node to be put into the queue 1480 ObjectWaiter node(Self); 1481 node.TState = ObjectWaiter::TS_WAIT ; 1493 AddWaiter (&node) ; 2295 AddWaiter(ObjectWaiter* node) argument 2324 DequeueSpecificWaiter(ObjectWaiter* node) argument [all...] |
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | OldHierarchicalLayoutManager.java | 77 private Vertex node; field in class:OldHierarchicalLayoutManager.NodeData 84 public NodeData(Vertex node) { argument 87 this.node = node; 88 assert node != null; 91 width = node.getSize().width; 93 width = node.getSize().height; 110 return node; 167 int yCoord = node.getSize().height + width - node 961 tryAdding(List<Node<NodeData, EdgeData>> alreadyAssigned, Node<NodeData, EdgeData> node, int pos) argument 1065 findOverlap(List<Node<NodeData, EdgeData>> nodes, Node<NodeData, EdgeData> node) argument [all...] |
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/presentation/rmi/ |
H A D | PresentationManagerImpl.java | 208 Node node = new NodeImpl( superclass ) ; 209 gr.add( node ) ; 210 initialRootSet.add( node ) ; 231 NodeImpl node = (NodeImpl)iter.next() ; 232 classes[ctr++] = node.getInterface() ; 263 NodeImpl node = (NodeImpl)iter.next() ; 264 String typeId = node.getTypeId() ;
|