| /external/webkit/Source/WebCore/svg/ |
| SVGFontFaceFormatElement.cpp | 49 ContainerNode* ancestor = parentNode()->parentNode();
50 if (!ancestor || !ancestor->hasTagName(font_face_srcTag))
53 ancestor = ancestor->parentNode();
54 if (ancestor && ancestor->hasTagName(font_faceTag))
55 static_cast<SVGFontFaceElement*>(ancestor)->rebuildFontFace();
|
| /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/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...] |
| /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...] |
| ScriptElement.cpp | 202 Node* ancestor = m_element->parentNode();
203 while (ancestor) {
204 if (ancestor->isSVGShadowRoot())
206 ancestor = ancestor->parentNode();
|
| /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...] |
| /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/webkit/Source/WebCore/inspector/front-end/ |
| BottomUpProfileDataGridTree.js | 30 // because a root node can represent itself AND an ancestor.
99 var ancestor = nodeInfo.ancestor;
101 var child = this.findChild(ancestor);
113 // If not, add it as a true ancestor.
114 // In heavy mode, we take our visual identity from ancestor node...
115 var child = new WebInspector.BottomUpProfileDataGridNode(this.profileView, ancestor, this.tree);
117 if (ancestor !== focusNode) {
127 var parent = ancestor.parent;
129 nodeInfo.ancestor = parent
[all...] |
| /external/webkit/Source/WebCore/platform/graphics/android/ |
| Layer.cpp | 129 void Layer::localToAncestor(const Layer* ancestor, SkMatrix* matrix) const {
130 if (this == ancestor) {
139 ASSERT(!ancestor);
145 // and ancestor.
146 ASSERT(isAncestor(ancestor));
147 for (const Layer* layer = this->fParent; layer != ancestor; layer = layer->fParent) {
154 // If ancestor is not the root layer, apply its child transformation too.
155 if (ancestor)
156 matrix->postConcat(ancestor->getChildrenMatrix());
|
| Layer.h | 45 // layer, rather than using the transforms of all ancestor layers. This is
152 space to the space of the given ancestor layer. Use NULL for ancestor to
154 fixed position layer with ancestor != NULL.
158 SkMatrix localToAncestor = layer->localToAncestor(ancestor);
159 SkMatrix ancestorToGlobal = ancestor->localToAncestor(NULL);
163 void localToAncestor(const Layer* ancestor, SkMatrix* matrix) const;
|
| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| nodeinsertbefore22.js | 78 Using insertBefore on an Element node attempt to insert the ancestor of an Element node
91 var ancestor;
103 ancestor = doc.createElementNS("http://www.w3.org/1999/xhtml","xhtml:p");
105 appendedChild = ancestor.appendChild(element);
110 inserted = element.insertBefore(ancestor,refNode);
|
| /external/chromium/chrome/browser/accessibility/ |
| browser_accessibility.cc | 91 BrowserAccessibility* ancestor) {
92 if (this == ancestor) {
95 return parent_->IsDescendantOf(ancestor);
|
| browser_accessibility.h | 74 // Return true if this object is equal to or a descendant of |ancestor|.
75 bool IsDescendantOf(BrowserAccessibility* ancestor);
|
| /external/webkit/Source/WebCore/html/ |
| HTMLImageElement.cpp | 240 for (ContainerNode* ancestor = parentNode(); ancestor; ancestor = ancestor->parentNode()) {
241 if (ancestor->hasTagName(formTag)) {
242 m_form = static_cast<HTMLFormElement*>(ancestor);
|
| /external/webkit/Source/WebCore/loader/ |
| NavigationScheduler.cpp | 299 // Navigation of a subframe during loading of an ancestor frame does not create a new back/forward item.
302 for (Frame* ancestor = targetFrame->tree()->parent(); ancestor; ancestor = ancestor->tree()->parent()) {
303 Document* document = ancestor->document();
304 if (!ancestor->loader()->isComplete() || (document && document->processingLoadEvent()))
|
| /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/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/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/page/ |
| FrameTree.h | 55 bool isDescendantOf(const Frame* ancestor) const;
|
| FrameTree.cpp | 242 bool FrameTree::isDescendantOf(const Frame* ancestor) const
244 if (!ancestor)
247 if (m_thisFrame->page() != ancestor->page())
251 if (frame == ancestor)
|
| /external/webkit/Source/WebKit2/UIProcess/ |
| WebFrameProxy.cpp | 221 bool WebFrameProxy::isDescendantOf(const WebFrameProxy* ancestor) const
223 if (!ancestor)
226 if (m_page != ancestor->m_page)
230 if (frame == ancestor)
|
| /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/chromium/webkit/glue/ |
| webaccessibility.h | 201 // Returns true if |ancestor| is the first unignored parent of |child|,
203 // |ancestor| is the *first* ancestor that isn't marked as
205 bool IsParentUnignoredOf(const WebKit::WebAccessibilityObject& ancestor,
|
