| /external/apache-xml/src/main/java/org/apache/xalan/processor/ |
| ProcessorExsltFuncResult.java | 52 ElemTemplateElement ancestor = handler.getElemTemplateElement().getParentElem(); local
53 while (ancestor != null && !(ancestor instanceof ElemExsltFunction))
55 if (ancestor instanceof ElemVariable
56 || ancestor instanceof ElemParam
57 || ancestor instanceof ElemExsltFuncResult)
62 ancestor = ancestor.getParentElem();
64 if (ancestor == null)
|
| /external/webkit/Source/WebCore/editing/ |
| BreakBlockquoteCommand.cpp | 138 // On exiting this loop, clonedAncestor is the lowest ancestor
169 // Split the tree up the ancestor chain until the topBlockquote
170 // Throughout this loop, clonedParent is the clone of ancestor's parent.
171 // This is so we can clone ancestor's siblings and place the clones
172 // into the clone corresponding to the ancestor's parent.
173 Element* ancestor; local
175 for (ancestor = ancestors.first(), clonedParent = clonedAncestor->parentElement();
176 ancestor && ancestor != topBlockquote;
177 ancestor = ancestor->parentElement(), clonedParent = clonedParent->parentElement())
[all...] |
| markup.cpp | 365 Node* ancestor = ancestorsToClose.last(); local
366 if (next != pastEnd && next->isDescendantOf(ancestor))
369 appendEndTag(ancestor);
370 lastClosed = ancestor;
490 // Retain the Mail quote level by including all ancestor mail block quotes.
595 // Also include all of the ancestors of lastClosed up to this special ancestor.
596 for (ContainerNode* ancestor = lastClosed->parentNode(); ancestor; ancestor = ancestor->parentNode())
[all...] |
| htmlediting.cpp | 571 Node* ancestor = range->commonAncestorContainer(ec);// find the cloeset common ancestor local
574 while (ancestor && ancestor->rendererIsEditable() && isNodeVisiblyContainedWithin(ancestor, maximumRange) && ancestor != rootNode) {
575 highestNode = ancestor;
576 ancestor = ancestor->parentNode();
892 Node* ancestor = node->shadowAncestorNode()
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| EventDispatcher.cpp | 136 // Assume divergent boundary is the relatedTarget itself (in other words, related target ancestor chain does not cross any shadow DOM boundaries).
140 // Walk down from the top, looking for lowest common ancestor, also monitoring shadow DOM boundaries.
166 // The relatedTarget is an ancestor or shadowHost of the target.
247 Node* ancestor = m_node.get(); local
248 EventTarget* target = eventTargetRespectingSVGTargetRules(ancestor);
251 bool isSVGShadowRoot = ancestor->isSVGShadowRoot();
252 if (isSVGShadowRoot || ancestor->isShadowRoot()) {
256 ancestor = isSVGShadowRoot ? ancestor->svgShadowHost() : ancestor->shadowHost()
[all...] |
| Range.cpp | 478 // case 2: node C (container B or an ancestor) is a child node of A
496 // case 3: node C (container A or an ancestor) is a child node of B
864 RefPtr<Node> ancestor = *it; local
866 if (RefPtr<Node> clonedAncestor = ancestor->cloneNode(false)) { // Might have been removed already during mutation event.
872 // Copy siblings of an ancestor of start/end containers
875 ASSERT(!firstChildInAncestorToProcess || firstChildInAncestorToProcess->parentNode() == ancestor);
881 ancestor->removeChild(child, ec);
883 case EXTRACT_CONTENTS: // will remove child from ancestor
897 firstChildInAncestorToProcess = direction == ProcessContentsForward ? ancestor->nextSibling() : ancestor->previousSibling()
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 117 DFSInfo ancestorbbInfo = info[bbInfo.ancestor.getIndex()];
119 if (ancestorbbInfo.ancestor != null) {
128 SsaBasicBlock vAncestor = vbbInfo.ancestor;
131 // Make sure we process our ancestor before ourselves.
132 if (visited.add(vAncestor) && vabbInfo.ancestor != null) {
138 // Update based on ancestor info.
139 if (vabbInfo.ancestor == null) {
148 vbbInfo.ancestor = vabbInfo.ancestor;
156 if (bbInfo.ancestor == null)
278 public SsaBasicBlock ancestor; field in class:Dominators.DFSInfo
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| ChunkedIntArray.java | 131 // Check that the node at index "position" is not an ancestor
133 // RETURN -1. If position is NOT an ancestor, return position.
139 // We have to look all the way up the ancestor chain
140 // to make sure we don't have an ancestor.
141 int ancestor = startPos; local
142 while(ancestor > 0)
144 // Get the node whose index == ancestor
145 ancestor*=slotsize;
146 int chunkpos = ancestor >> lowbits;
147 int slotpos = ancestor & lowmask
[all...] |
| DTMDefaultBase.java | 1358 int ancestor=_parent(elementNodeIndex); local
[all...] |
| /external/guava/src/com/google/common/collect/ |
| AbstractMultimap.java | 363 K key, List<V> list, @Nullable WrappedCollection ancestor) {
365 ? new RandomAccessWrappedList(key, list, ancestor)
366 : new WrappedList(key, list, ancestor);
374 * <p>Full collections, identified by a null ancestor field, contain all
381 * given key. Its ancestor field points to the full wrapped collection with
389 final WrappedCollection ancestor; field in class:AbstractMultimap.WrappedCollection
393 @Nullable WrappedCollection ancestor) {
396 this.ancestor = ancestor;
398 = (ancestor == null) ? null : ancestor.getDelegate()
[all...] |
| /external/chromium/chrome/browser/ui/views/autocomplete/ |
| autocomplete_popup_contents_view.cc | 417 views::View* ancestor = child; local
418 while (ancestor && ancestor != opt_in_view_)
419 ancestor = ancestor->parent();
420 return ancestor ? child : this;
|
| /external/libxslt/libxslt/ |
| numbers.c | 594 /* Skip to next preceding or ancestor */
635 xmlNodePtr ancestor; local
652 /* ancestor-or-self::*[count] */
653 for (ancestor = node;
654 (ancestor != NULL) && (ancestor->type != XML_DOCUMENT_NODE);
655 ancestor = xmlXPathNextAncestor(parser, ancestor)) {
658 xsltTestCompMatchList(context, ancestor, fromPat))
661 if ((count == NULL && node->type == ancestor->type &&
[all...] |
| /external/webkit/Source/WebCore/inspector/ |
| InspectorInstrumentation.cpp | 86 Node* ancestor = ancestors[i].node(); local
87 if (ancestor->hasEventListeners(eventType))
[all...] |
| InspectorDOMAgent.cpp | 737 for (ContainerNode* ancestor = node->parentOrHostNode(); ancestor; ancestor = ancestor->parentOrHostNode())
738 ancestors.append(ancestor);
743 ContainerNode* ancestor = ancestors[i - 1]; local
746 if (ancestor->hasEventListeners(type))
747 eventInformation.append(EventListenerInfo(ancestor, type, ancestor->getEventListeners(type)));
[all...] |
| /external/libxml2/include/libxml/ |
| xpath.h | 382 xmlNodePtr ancestor; /* used for walking preceding axis */ member in struct:_xmlXPathParserContext
|
| /external/apache-harmony/logging/src/test/java/org/apache/harmony/logging/tests/java/util/logging/ |
| LoggerTest.java | 2768 Logger ancestor = new MockParentLogger("ancestorLogger", local
2889 Logger ancestor = new MockLogger("ancestorLogger", local
2961 Logger ancestor = new MockLogger("ancestorLogger", local
[all...] |
| /external/protobuf/java/src/test/java/com/google/protobuf/ |
| TestUtil.java | 3710 File ancestor = new File("."); local
[all...] |
| /external/libvpx/nestegg/src/ |
| nestegg.c | 273 struct list_node * ancestor; member in struct:saved_state
291 struct list_node * ancestor; member in struct:nestegg
755 ne_is_ancestor_element(uint64_t id, struct list_node * ancestor)
759 for (; ancestor; ancestor = ancestor->previous)
760 for (element = ancestor->node; element->id; ++element)
780 ne_ctx_push(nestegg * ctx, struct ebml_element_desc * ancestor, void * data)
785 item->previous = ctx->ancestor;
786 item->node = ancestor;
[all...] |
| /external/webkit/Source/WebCore/rendering/ |
| RenderLayer.cpp | 3829 RenderObject* ancestor = commonAncestor(oldHoverObj, newHoverObj); local
[all...] |
| /development/samples/NFCDemo/libs/ |
| guava-10.0.1.jar | |
| /prebuilt/sdk/tools/lib/ |
| dx.jar | |
| /prebuilt/common/tradefed/ |
| tradefed-prebuilt.jar | |
