Searched refs:leaf (Results 26 - 50 of 54) sorted by relevance

123

/openjdk7/jdk/src/solaris/classes/sun/awt/X11/
H A DXBaseMenuWindow.java592 * returns leaf menu window or
597 XBaseMenuWindow leaf = this;
598 XMenuPeer leafchild = leaf.getShowingSubmenu();
600 leaf = leafchild.getMenuWindow();
601 leafchild = leaf.getShowingSubmenu();
603 return leaf;
625 * search is started from leaf window
1041 //Currently showing leaf window
1111 //clear selection in leaf to reflect it
1156 //leaf windo
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/api/
H A DJavacTrees.java354 * Makes a copy of a tree, noting the value resulting from copying a particular leaf.
364 public <T extends JCTree> T copy(T t, JCTree leaf) { argument
365 T t2 = super.copy(t, leaf);
366 if (t == leaf)
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/dtd/models/
H A DDFAContentModel.java155 * non-epsilon leaf node.) This is only used during the building of
169 * The count of leaf nodes. This is an important number that set some
175 * An array of non-epsilon leaf nodes, which is used during the DFA
180 /** Array mapping ANY types to the leaf list. */
451 // Note that, during this operation, we set each non-epsilon leaf
484 // and counted as a non-epsilon leaf node. It could not be handled
494 // work now that we know the leaf count. One thing we need to do is
498 // Along the way we also set the leaf count in each node as the
503 // leaf nodes. Since we iterate it in the same way as before, this
513 // one for each leaf nod
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DconcurrentGCThread.cpp98 _m = new Monitor(Mutex::leaf,
/openjdk7/jdk/src/share/classes/com/sun/jndi/cosnaming/
H A DCNCtx.java719 * @exception NotFound No objects under the name. If leaf
731 // If leaf is the one missing, return success
744 private boolean leafNotFound(NotFound e, NameComponent leaf) { argument
749 // the leaf (e.g. aa/aa/aa, which one is missing?)
754 (rest=e.rest_of_name[0]).id.equals(leaf.id) &&
755 (rest.kind == leaf.kind ||
756 (rest.kind != null && rest.kind.equals(leaf.kind)));
950 // If leaf is the one missing, return success
956 return; // leaf missing OK
/openjdk7/hotspot/src/share/vm/runtime/
H A Dvm_operations.cpp406 Monitor timer(Mutex::leaf, "VM_Exit timer", true);
/openjdk7/hotspot/src/share/vm/services/
H A DmemoryManager.cpp203 _last_gc_lock = new Mutex(Mutex::leaf, "_last_gc_lock", true);
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkCompiler.cpp65 _execution_engine_lock = new Monitor(Mutex::leaf, "SharkExecutionEngineLock");
/openjdk7/jdk/src/share/classes/javax/swing/text/
H A DDefaultStyledDocument.java246 * instead, preceding leaf element is extended to cover the
247 * character. If the last leaf already ends with {@code "\n",} it is
298 removeFrom--; // preceding leaf ends with "\n", remove it
337 // preceding leaf element should be extended to cover orphaned "\n"
590 * a leaf.
730 // element after pParagraph, and it isn't a leaf.
746 // is a leaf.
869 // leaf. There will be a facture.
1598 // will have no children (the bottomost leaf would have length 0)
1837 // This happens if inserting into a leaf, followe
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/runtime/
H A DJAXBContextImpl.java288 // recognize leaf bean infos
289 for( RuntimeBuiltinLeafInfo leaf : RuntimeBuiltinLeafInfoImpl.builtinBeanInfos ) {
290 LeafBeanInfoImpl<?> bi = new LeafBeanInfoImpl(this,leaf);
291 beanInfoMap.put(leaf.getClazz(),bi);
/openjdk7/jdk/src/share/demo/jfc/Notepad/
H A DElementTreePanel.java105 boolean expanded, boolean leaf,
443 // Element is a leaf, assume it changed
511 * if the node is a leaf or if it has no children.
527 * Returns true if <I>node</I> is a leaf. It is possible for
531 * not a leaf, but it also has no children.
534 * @return true if <I>node</I> is a leaf
/openjdk7/jdk/src/share/classes/javax/swing/
H A DJMenu.java1302 * @param leaf the leaf node from which to start building up the array
1305 private MenuElement[] buildMenuElementArray(JMenu leaf) { argument
1307 Component current = leaf.getPopupMenu();
H A DJTree.java54 * An <i>expanded</i> node is a non-leaf node (as identified by
385 * <li>The root is a leaf node
558 * The default model used by the tree defines a leaf node as any node
571 * By default, the tree defines a leaf node as any node without
588 * tree defines a leaf node as any node without children.
605 * a leaf node as any node without children.
621 * By default, the tree defines a leaf node as any node without children.
634 * leaf node in the specified manner.
638 * leaf node; if true, only nodes that do not allow
639 * children are leaf node
1589 convertValueToText(Object value, boolean selected, boolean expanded, boolean leaf, int row, boolean hasFocus) argument
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/plaf/synth/
H A DSynthTreeUI.java702 boolean leaf, int row,
713 expanded, leaf, row, hasFocus);
699 getTreeCellRendererComponent(JTree tree, Object value, boolean sel, boolean expanded, boolean leaf, int row, boolean hasFocus) argument
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp2441 // pre_orders. Returns the leaf of the merged branch.
2443 // Sort is (looking from leaf towards the root)
2447 Loop* leaf = this; local
2449 Loop* current = leaf;
2455 return leaf; // Already in list
2471 leaf = lp;
2476 return leaf;
/openjdk7/hotspot/src/share/vm/interpreter/
H A DoopMapCache.cpp507 _mut(Mutex::leaf, "An OopMapCache lock", true)
/openjdk7/hotspot/src/share/vm/adlc/
H A Dformssel.hpp208 // Return the register class associated with 'leaf'.
644 // Return the register class associated with 'leaf'.
645 virtual const char *in_reg_class(uint leaf, FormDict &globals);
H A Dformssel.cpp846 // Return the register class associated with 'leaf'.
2266 // Return the register class associated with 'leaf'.
2267 const char *OperandForm::in_reg_class(uint leaf, FormDict &globals) { argument
2278 // until we reach the register that corresponds to "leaf"
2280 // level user type associated with the leaf.
2295 // Increment our target leaf position if current leaf is not a candidate.
2296 if( reg_class == NULL) ++leaf;
2298 if( idx == leaf ) break;
2299 // May iterate through all base operands if reg_class for 'leaf' i
[all...]
/openjdk7/hotspot/src/share/vm/utilities/
H A Dworkgroup.cpp44 _monitor = new Monitor(/* priority */ Mutex::leaf,
/openjdk7/jdk/src/share/classes/javax/swing/plaf/basic/
H A DBasicTreeUI.java1485 // Draw icons if not a leaf and either hasn't been loaded,
2241 * the node at <code>row</code> does not represent a leaf.
2404 * @return true if the node at <code>row</code> is a leaf.
3224 boolean leaf = model.isLeaf(node);
3225 String label = getDisplayString(path, true, leaf);
3249 String getDisplayString(TreePath path, boolean selected, boolean leaf) { argument
3254 leaf, row, hasFocus);
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DheapRegion.cpp988 _par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true),
H A DheapRegionRemSet.cpp261 _m(Mutex::leaf, "An OtherRegionsTable lock", true),
/openjdk7/hotspot/src/share/vm/memory/
H A Dspace.cpp972 _par_alloc_lock(Mutex::leaf, "OffsetTableContigSpace par alloc lock", true)
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/xsom/impl/util/
H A DSchemaTreeTraverser.java344 boolean selected, boolean expanded, boolean leaf, int row,
343 getTreeCellRendererComponent(JTree tree, Object value, boolean selected, boolean expanded, boolean leaf, int row, boolean hasFocus) argument
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp50 int CompactibleFreeListSpace::_lockRank = Mutex::leaf + 3;
85 _parDictionaryAllocLock(Mutex::leaf - 1, // == rank(ExpandHeap_lock) - 1
152 _indexedFreeListParLocks[i] = new Mutex(Mutex::leaf - 1, // == ExpandHeap_lock - 1

Completed in 110 milliseconds

123