Searched refs:kid (Results 1 - 14 of 14) sorted by relevance
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | DocumentFragmentImpl.java | 121 ChildNode kid, next; 123 for (kid = firstChild; kid != null; kid = next) { 124 next = kid.nextSibling; 126 // If kid is a text node, we need to check for one of two 129 // 2) There is no adjacent text node, but kid is 131 if ( kid.getNodeType() == Node.TEXT_NODE ) 133 // If an adjacent text node, merge it with kid 136 ((Text)kid) [all...] |
H A D | AttrImpl.java | 544 Node kid, next; 546 for (kid = firstChild; kid != null; kid = next) { 547 next = kid.getNextSibling(); 549 // If kid is a text node, we need to check for one of two 552 // 2) There is no adjacent text node, but kid is 554 if ( kid.getNodeType() == Node.TEXT_NODE ) 556 // If an adjacent text node, merge it with kid 559 ((Text)kid) [all...] |
H A D | ParentNode.java | 320 for (Node kid = newChild.getFirstChild(); // Prescan 321 kid != null; kid = kid.getNextSibling()) { 323 if (!ownerDocument.isKidOK(this, kid)) { 853 ChildNode kid; 854 for (kid = firstChild; kid != null; kid = kid [all...] |
H A D | ElementImpl.java | 341 ChildNode kid, next; 342 for (kid = firstChild; kid != null; kid = next) { 343 next = kid.nextSibling; 345 // If kid is a text node, we need to check for one of two 348 // 2) There is no adjacent text node, but kid is 350 if ( kid.getNodeType() == Node.TEXT_NODE ) 352 // If an adjacent text node, merge it with kid 355 ((Text)kid) [all...] |
H A D | DOMNormalizer.java | 230 Node kid, next; 231 for (kid = fDocument.getFirstChild(); kid != null; kid = next) { 232 next = kid.getNextSibling(); 233 kid = normalizeNode(kid); 234 if (kid != null) { // don't advance 235 next = kid; 403 Node kid, nex [all...] |
H A D | CoreDocumentImpl.java | 360 for (ChildNode kid = firstChild; kid != null; 361 kid = kid.nextSibling) { 362 newdoc.appendChild(newdoc.importNode(kid, true, true, 406 // If insert succeeded, cache the kid appropriately 429 // If remove succeeded, un-cache the kid appropriately
|
/openjdk7/jdk/src/share/classes/java/util/prefs/ |
H A D | XmlSupport.java | 111 for (Preferences kid = p, dad = kid.parent(); dad != null; 112 kid = dad, dad = kid.parent()) { 113 ancestors.add(kid);
|
H A D | AbstractPreferences.java | 716 for (String kid : childrenNamesSpi()) 717 s.add(kid);
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/ |
H A D | DTMDocumentImpl.java | 1033 int kid = nodeHandle + 1; 1034 nodes.readSlot(kid, gotslot); 1037 kid = gotslot[2]; 1039 if (kid == NULL) return NULL; 1040 nodes.readSlot(kid, gotslot); 1042 // If parent slot matches given parent, return kid 1045 int firstChild = kid | m_docHandle; 1207 int kid = NULL; 1210 kid = nextkid; 1212 return kid | m_docHandl [all...] |
/openjdk7/jdk/src/share/classes/sun/security/x509/ |
H A D | AuthorityKeyIdentifierExtension.java | 126 public AuthorityKeyIdentifierExtension(KeyIdentifier kid, GeneralNames name, argument 129 this.id = kid;
|
/openjdk7/jdk/src/share/classes/java/util/logging/ |
H A D | Logger.java | 1579 Logger kid = ref.get(); 1580 if (kid == this) { 1612 // kid list. We should only be called from LoggerWeakRef.dispose(). 1657 Logger kid = ref.get(); 1658 if (kid != null) { 1659 kid.updateEffectiveLevel();
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | matcher.cpp | 1835 State *kid = s->_kids[0]; 1836 assert( kid == NULL || s->_leaf->in(0) == NULL, "internal operands have no control" ); 1839 if( kid == NULL && !_swallowed[rule] ) { 1857 for( uint i=0; kid != NULL && i<2; kid = s->_kids[1], i++ ) { // binary tree 1860 newrule = kid->_rule[_leftOp[rule]]; 1862 newrule = kid->_rule[_rightOp[rule]]; 1866 ReduceOper( kid, newrule, mem, mach ); 1873 mach->add_req( ReduceInst( kid, newrule, mem1 ) );
|
H A D | graphKit.cpp | 1941 int kid = (klass == NULL)? -1: log->identify(klass); local 1946 if (kid >= 0) log->print(" klass='%d'", kid);
|
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciTypeFlow.cpp | 828 int kid = (klass == NULL)? -1: log->identify(klass); local 833 if (kid >= 0) 834 log->print(" klass='%d'", kid);
|
Completed in 1984 milliseconds