/openjdk7/jdk/src/share/classes/sun/tools/tree/ |
H A D | MethodExpression.java | 558 if (p.node != null && p.node.op == TRY) { 559 ((TryStatement) p.node).arrayCloneWhere = where;
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | TreeMap.java | 1546 TreeMap.Entry node = m.getEntry(key); 1547 return node != null && 1548 valEquals(node.getValue(), entry.getValue()); 1558 TreeMap.Entry<K,V> node = m.getEntry(key); 1559 if (node!=null && valEquals(node.getValue(), 1561 m.deleteEntry(node); 2135 * Delete node p, and then rebalance the tree. 2150 // Start fixup at replacement node, if it exists. 2169 } else if (p.parent == null) { // return if we are the only node [all...] |
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/main/ |
H A D | JavaCompiler.java | 1310 public void visitClassDef(JCClassDecl node) { 1311 Type st = types.supertype(node.sym.type); 1320 super.visitClassDef(node);
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | callnode.cpp | 96 // The method start node for an on stack replacement adapter 768 assert(false, "unexpected projection from allocation node."); 1098 // Do not allow value-numbering for SafePointScalarObject node. 1171 // Don't bother trying to transform a dead node 1469 bool AbstractLockNode::find_lock_and_unlock_through_if(Node* node, LockNode* lock, argument 1471 Node* if_node = node->in(0); 1472 bool if_true = node->is_IfTrue(); 1474 if (if_node->is_If() && if_node->outcnt() == 2 && (if_true || node->is_IfFalse())) { 1518 // If we fall through to here then it was some kind of node we 1553 // Don't bother trying to transform a dead node [all...] |
H A D | chaitin.hpp | 318 Node_List **_lrg_nodes; // Array of node; lists for lrgs which spill 411 assert(retval == Find(n),"Invalid node to lidx mapping"); 477 // Set the 'spilled_once' or 'spilled_twice' flag on a node. 481 // Set C->failing when fixup spills could not complete, node limit exceeded. 487 // Replace the old node with the current live version of that value 511 // Extend the node to LRG mapping 512 void add_reference( const Node *node, const Node *old_node);
|
H A D | loopPredicate.cpp | 80 // Variation of a dead If node. 103 assert(n->is_CFG(), "must be control node"); 482 Node* n = _stack.node(); 527 Node* n = _stack.node(); 531 // clone invariant node
|
H A D | matcher.cpp | 126 debug_only(_mem_node = NULL;) // Ideal memory node consumed by mach node 167 assert(C->node_arena()->contains(n), "dead node"); 171 assert(C->node_arena()->contains(in), "dead node"); 314 // Collect roots of matcher trees. Every node for which 322 // Create new ideal node ConP #NULL even if it does exist in old space 323 // to avoid false sharing if the corresponding mach node is not used. 324 // The corresponding mach node is only used in rare cases for derived 342 // Reset node counter so MachNodes start with _idx at 0 370 // Generate new mach node fo [all...] |
H A D | callnode.hpp | 62 // The method start node 89 // The method start node for on stack replacement code 116 // Return from subroutine node 210 SafePointNode* _map; // Map node associated with this scope 334 const TypePtr* _adr_type; // What type of memory does this node produce? 451 uint _first_index; // First input edge index of a SafePoint node where 480 // Assumes that "this" is an argument to a safepoint node "s", and that 552 // Are we guaranteed that this node is a safepoint? Not true for leaf calls and 556 // the node the JVMState must be cloned. 561 // Does this node hav [all...] |
H A D | chaitin.cpp | 1435 // Set the 'spilled_once' or 'spilled_twice' flag on a node. 1464 C->top() == n || // Or the random TOP node 1465 n->is_Proj(), // Or a fat-proj kill node 1479 // This is a CISC Spill, get stack offset and construct new node 1487 // Bailout if we might exceed node limit when spilling this instruction 1490 // Transform node 1552 // (where top() node is placed). 1747 // Extend the node to LRG mapping 1748 void PhaseChaitin::add_reference( const Node *node, const Node *old_node ) { argument 1749 _names.extend( node [all...] |
H A D | loopopts.cpp | 69 // Alter data node to use pre-phi inputs 87 // the PhiNode may cause the resulting node to migrate back to a previous 101 // We now call Identity to try to simplify the cloned node. 104 // our new node, even though we may throw the node away. 105 // (Note: This tweaking with igvn only works because x is a new node.) 121 // Else x is a new node we are keeping 154 // The occasional new node 155 if (x->_idx >= old_unique) { // Found a new, unplaced node? 243 Node* cd = dp->fast_out(i); // Control-dependent node [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/trax/ |
H A D | TransformerFactoryImpl.java | 610 final org.w3c.dom.Node node = domsrc.getNode(); 611 final DOM2SAX dom2sax = new DOM2SAX(node);
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/msg/ |
H A D | DOMMessages_ja.properties | 67 wf-invalid-character-in-node-name = {1}\u3068\u3044\u3046\u540D\u524D\u306E{0}\u30CE\u30FC\u30C9\u306B\u7121\u52B9\u306AXML\u6587\u5B57\u304C\u542B\u307E\u308C\u3066\u3044\u307E\u3059\u3002
|
H A D | DOMMessages_ko.properties | 67 wf-invalid-character-in-node-name = \uC774\uB984\uC774 {1}\uC778 {0} \uB178\uB4DC\uC5D0 \uBD80\uC801\uD569\uD55C XML \uBB38\uC790\uAC00 \uD3EC\uD568\uB418\uC5B4 \uC788\uC2B5\uB2C8\uB2E4.
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/xsom/impl/util/ |
H A D | SchemaTreeTraverser.java | 83 * Every node in the resulting tree is a {@link SchemaTreeTraverser.SchemaTreeNode}, 97 * The current node in the tree. 108 * A simple constructor. Is made private to allow creating the root node 111 * @param root The root node. 127 public void addSchemaNode(SchemaTreeNode node) { argument 128 ((SchemaRootNode) this.root).add(node); 133 * The node of the schema hierarchy tree. 178 * Returns the caption for <code>this</code> node. 180 * @return The caption for <code>this</code> node. 219 * The root node o [all...] |
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/ |
H A D | Attr.java | 304 public Symbol visitMemberSelect(MemberSelectTree node, Env<AttrContext> env) { argument 305 Symbol site = visit(node.getExpression(), env); 308 Name name = (Name)node.getIdentifier(); 319 public Symbol visitIdentifier(IdentifierTree node, Env<AttrContext> env) { argument 320 return rs.findIdent(env, (Name)node.getName(), TYP | PCK); 328 public Type attribType(JCTree node, TypeSymbol sym) { argument 330 Env<AttrContext> localEnv = env.dup(node, env.info.dup()); 331 return attribTree(node, localEnv, Kinds.TYP, Type.noType); 1561 /** Check that given application node appears as first statement 1563 * @param tree The application node [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/ |
H A D | JTree.java | 50 * A specific node in a tree can be identified either by a 52 * that encapsulates a node and all of its ancestors), or by its 53 * display row, where each row in the display area displays one node. 54 * An <i>expanded</i> node is a non-leaf node (as identified by 55 * <code>TreeModel.isLeaf(node)</code> returning false) that will displays 58 * node is one which hides them. A <i>hidden</i> node is one which is 60 * are expanded, but may or may not be displayed. A <i>displayed</i> node 85 * node <cod [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/text/ |
H A D | AbstractDocument.java | 2168 * Returns the index of <code>node</code> in the receivers children. 2169 * If the receiver does not contain <code>node</code>, -1 will be 2171 * @param node the location of interest 2172 * @return the index of <code>node</code> in the receiver's 2175 public int getIndex(TreeNode node) { argument 2177 if(getChildAt(counter) == node)
|
/openjdk7/hotspot/src/os/windows/vm/ |
H A D | os_windows.cpp | 2658 // Container for NUMA node list info 2787 // * UseNUMAInterleaving requires a separate node for each piece 2857 // get the next node to use from the used_node_list 2859 DWORD node = numa_node_list_holder.get_node_list_entry(count % numa_node_list_holder.get_count()); local 2865 node); 3070 // 2) NUMA Interleaving is enabled, in which case we use a different node for each page 5152 LPVOID os::Kernel32Dll::VirtualAllocExNuma(HANDLE hProc, LPVOID addr, SIZE_T bytes, DWORD flags, DWORD prot, DWORD node) { argument 5156 return _VirtualAllocExNuma(hProc, addr, bytes, flags, prot, node); 5166 BOOL os::Kernel32Dll::GetNumaNodeProcessorMask(UCHAR node, PULONGLONG proc_mask) { argument 5170 return _GetNumaNodeProcessorMask(node, proc_mas [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | Mode.java | 88 * Group for patterns with node()-type kernel and child axis. 93 * Test sequence for patterns with node()-type kernel and child axis. 98 * Group for patterns with node()-type kernel and attribute axis. 103 * Test sequence for patterns with node()-type kernel and attribute axis. 149 * A reference to the pattern matching the root node. 165 * Variable index for the current node used in code generation. 305 // any kernel node type (it can be anything as long as the node is in 423 * by including patterns of "*" and "node()" kernel to all element test 430 // Complete test sequence for "text()" with "child::node()" 610 compileGetChildren(ClassGenerator classGen, MethodGenerator methodGen, int node) argument [all...] |
H A D | XPathParser.java | 921 * creates a StepPattern instead of just returning a node type. It also 1102 * nodesets only if the context node is of type element. 1545 else if (fname.getLocalPart().equals("nodeset") || fname.getLocalPart().equals("node-set")) { 1623 SyntaxTreeNode node = parser.lookupName(varName); 1625 if (node != null) { 1626 if (node instanceof Variable) { 1627 RESULT = new VariableRef((Variable)node); 1629 else if (node instanceof Param) { 1630 RESULT = new ParameterRef((Param)node); 1637 if (node [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/ |
H A D | ToStream.java | 121 * State flag that tells if the previous node processed 231 * Serializes the DOM node. Throws an exception only if an I/O 234 * @param node Node to serialize. 237 public void serialize(Node node) throws IOException argument 245 walker.traverse(node); 1025 * are from a text node, false if they are from an attribute value 1049 // if this is text node character and a special one of those, 1376 // Section 7.6.1 of XSLT 1.0 (http://www.w3.org/TR/xslt#value-of) suggest no text node 1558 * from a text node, false if they are from an attribute value. 1629 * from a text node, fals [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/ |
H A D | DTMDocumentImpl.java | 69 // Number of lower bits used to represent node index. 71 // Masks the lower order of node handle. 84 protected int m_currentNode = -1; // current node 158 * all node ID numbers, so those IDs indicate which document they 412 // Actually creating the text node is handled by 418 // Flush string accumulation into a text node 631 // wait for the first startElement to create the doc root node 667 // * Factory method; creates an Element node in this document. 669 // * The node created will be chained according to its natural order of request 674 // * to prepare and patch up parent and sibling node pointer 2378 getSourceLocatorFor(int node) argument [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/plaf/basic/ |
H A D | BasicTreeUI.java | 109 * the node should be selected before editing, used in completeEditing. */ 136 /** Reponsible for telling the TreeState the size needed for a node. */ 439 * Determines whether the node handles are to be displayed. 566 * Returns the path to the node that is closest to x,y. If 841 * the size of a given node in the tree. 960 * stamping of each node. 1172 // Information for the node being rendered. 1356 // Don't paint the legs for the root'ish node if the 1588 * parent node by default. This method makes the leg start below that. 1596 * right of the left-hand side of the child node b [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/traversers/ |
H A D | XSDHandler.java | 268 // By asking the node for its ownerDocument and looking in 765 // schemaRoot node. Then, for each <include>, 1222 // set its Document node to hidden so that we don't try to traverse 1356 // readOnly field on that node has not been set, it calls an 2318 final Node node = schemaSource.getNode(); 2320 if (node != null) { 2321 nodeType = node.getNodeType(); 2323 schemaRootElement = DOMUtil.getRoot((Document) node); 2326 schemaRootElement = (Element) node; 4077 * Extract location information from an Element node, an [all...] |
/openjdk7/jdk/src/share/demo/nio/zipfs/src/com/sun/nio/zipfs/ |
H A D | ZipFileSystem.java | 1255 continue; // pseudo directory node 1737 // Internal node that links a "name" to its pos in cen table. 1738 // The node itself can be used as a "key" to lookup itself in 1742 int hashcode; // node is hashable/hashed by its name 1759 final IndexNode as(byte[] name) { // reuse the node, mostly 2305 // A possible solution is to build the node tree ourself as 2354 for (IndexNode node : inodes.keySet().toArray(new IndexNode[0])) { 2355 addToTree(node, dirs);
|