Searched refs:ancestor (Results 1 - 25 of 128) sorted by relevance

123456

/external/chromium_org/third_party/WebKit/Source/core/svg/
H A DSVGFontFaceFormatElement.cpp46 ContainerNode* ancestor = parentNode()->parentNode();
47 if (!isSVGFontFaceSrcElement(ancestor))
50 ancestor = ancestor->parentNode();
51 if (isSVGFontFaceElement(ancestor))
52 toSVGFontFaceElement(ancestor)->rebuildFontFace();
H A DSVGForeignObjectElement.cpp129 Element* ancestor = parentElement(); local
130 while (ancestor && ancestor->isSVGElement()) {
131 if (ancestor->renderer() && ancestor->renderer()->isSVGHiddenContainer())
134 ancestor = ancestor->parentElement();
/external/apache-xml/src/main/java/org/apache/xalan/processor/
H A DProcessorExsltFuncResult.java52 ElemTemplateElement ancestor = handler.getElemTemplateElement().getParentElem();
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/chromium_org/third_party/WebKit/Source/core/html/imports/
H A DHTMLImportStateResolver.cpp53 for (HTMLImport* ancestor = m_import; ancestor; ancestor = ancestor->parent()) {
54 for (HTMLImport* predecessor = ancestor->previous(); predecessor; predecessor = predecessor->previous()) {
H A DHTMLImportsController.cpp83 for (HTMLImport* ancestor = parent; ancestor; ancestor = ancestor->parent()) {
84 if (!ancestor->isRoot() && equalIgnoringFragmentIdentifier(toHTMLImportChild(parent)->url(), url))
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dfind_util.js28 * unique ancestor tree and outputting Node if the ancestor tree matches
41 // Find our ancestor that matches the predicate.
42 var ancestor;
43 if (ancestor = predicate(cvox.DomUtil.getAncestors(cur.start.node))) {
44 cur = cvox.CursorSelection.fromNode(ancestor).setReversed(r);
/external/chromium_org/ui/accessibility/
H A Dax_node.cc38 bool AXNode::IsDescendantOf(AXNode* ancestor) { argument
39 if (this == ancestor)
42 return parent()->IsDescendantOf(ancestor);
H A Dax_node.h55 // Return true if this object is equal to or a descendant of |ancestor|.
56 bool IsDescendantOf(AXNode* ancestor);
/external/chromium_org/third_party/WebKit/Source/core/inspector/
H A DPageConsoleAgent.cpp96 Node& ancestor = NodeTraversal::highestAncestorOrSelf(*node); local
97 if (!ancestor.isShadowRoot() || toShadowRoot(ancestor).type() == ShadowRoot::AuthorShadowRoot)
100 node = toShadowRoot(ancestor).host();
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DChunkedIntArray.java131 // 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;
142 while(ancestor > 0)
144 // Get the node whose index == ancestor
145 ancestor*=slotsize;
146 int chunkpos = ancestor >> lowbits;
147 int slotpos = ancestor
[all...]
/external/chromium_org/tools/python/google/
H A Dpath_utils.py21 def FindAncestor(start_dir, ancestor):
22 """Finds an ancestor dir in a path.
31 if tail == ancestor:
36 raise PathNotFound("Unable to find ancestor %s in %s" % (ancestor, start_dir))
/external/guava/guava-tests/test/com/google/common/collect/
H A DFauxveridesTest.java108 private void doHasAllFauxveridesTest(Class<?> descendant, Class<?> ancestor) { argument
110 getAllRequiredToFauxveride(descendant, ancestor);
111 Set<MethodSignature> found = getAllFauxveridden(descendant, ancestor);
114 assertEquals("Must hide public static methods from ancestor classes",
119 Class<?> descendant, Class<?> ancestor) {
120 return getPublicStaticMethodsBetween(ancestor, Object.class);
124 Class<?> descendant, Class<?> ancestor) {
125 return getPublicStaticMethodsBetween(descendant, ancestor);
129 Class<?> descendant, Class<?> ancestor) {
131 for (Class<?> clazz : getClassesBetween(descendant, ancestor)) {
118 getAllRequiredToFauxveride( Class<?> descendant, Class<?> ancestor) argument
123 getAllFauxveridden( Class<?> descendant, Class<?> ancestor) argument
128 getPublicStaticMethodsBetween( Class<?> descendant, Class<?> ancestor) argument
151 getClassesBetween( Class<?> descendant, Class<?> ancestor) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DBreakBlockquoteCommand.cpp142 // On exiting this loop, clonedAncestor is the lowest ancestor
166 // Split the tree up the ancestor chain until the topBlockquote
167 // Throughout this loop, clonedParent is the clone of ancestor's parent.
168 // This is so we can clone ancestor's siblings and place the clones
169 // into the clone corresponding to the ancestor's parent.
170 RefPtrWillBeRawPtr<Element> ancestor = nullptr; local
172 for (ancestor = ancestors.first(), clonedParent = clonedAncestor->parentElement();
173 ancestor && ancestor != topBlockquote;
174 ancestor
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkPictureStateTree.cpp158 // Trace back up to a common ancestor, restoring to get our current state to match that
159 // of the ancestor, and saving a list of nodes whose state we need to apply to get to
160 // the target (we can restore up to the ancestor immediately, but we'll need to return
164 Node* ancestor = targetNode; local
165 while (tmp != ancestor) {
167 uint16_t targetLevel = ancestor->fLevel;
182 fNodes.push(ancestor);
183 ancestor = ancestor->fParent;
187 if (ancestor
[all...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DDominators.java117 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
278 public SsaBasicBlock ancestor; field in class:Dominators.DFSInfo
[all...]
/external/skia/src/core/
H A DSkPictureStateTree.cpp156 // Trace back up to a common ancestor, restoring to get our current state to match that
157 // of the ancestor, and saving a list of nodes whose state we need to apply to get to
158 // the target (we can restore up to the ancestor immediately, but we'll need to return
162 Node* ancestor = targetNode; local
163 while (tmp != ancestor) {
165 uint16_t targetLevel = ancestor->fLevel;
180 fNodes.push(ancestor);
181 ancestor = ancestor->fParent;
185 if (ancestor
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
H A DCPUProfileBottomUpDataGrid.js30 // because a root node can represent itself AND an ancestor.
142 var ancestor = nodeInfo.ancestor;
144 var child = container.findChild(ancestor);
155 // If not, add it as a true ancestor.
156 // In heavy mode, we take our visual identity from ancestor node...
157 child = new WebInspector.BottomUpProfileDataGridNode(ancestor, /** @type {!WebInspector.TopDownProfileDataGridTree} */ (container.tree));
159 if (ancestor !== focusNode) {
168 var parent = ancestor.parent;
170 nodeInfo.ancestor
[all...]
/external/chromium_org/third_party/WebKit/Source/core/css/
H A DSelectorFilter.cpp95 for (Element* ancestor = &parent; ancestor; ancestor = ancestor->parentOrShadowHostElement())
96 ancestors.append(ancestor);
/external/guava/guava/src/com/google/common/collect/
H A DAbstractMultimap.java376 @Nullable K key, List<V> list, @Nullable WrappedCollection ancestor) {
378 ? new RandomAccessWrappedList(key, list, ancestor)
379 : new WrappedList(key, list, ancestor);
387 * <p>Full collections, identified by a null ancestor field, contain all
394 * given key. Its ancestor field points to the full wrapped collection with
402 final WrappedCollection ancestor; field in class:AbstractMultimap.WrappedCollection
406 @Nullable WrappedCollection ancestor) {
409 this.ancestor = ancestor;
411 = (ancestor
375 wrapList( @ullable K key, List<V> list, @Nullable WrappedCollection ancestor) argument
405 WrappedCollection(@ullable K key, Collection<V> delegate, @Nullable WrappedCollection ancestor) argument
657 WrappedSortedSet(@ullable K key, SortedSet<V> delegate, @Nullable WrappedCollection ancestor) argument
710 WrappedList(@ullable K key, List<V> delegate, @Nullable WrappedCollection ancestor) argument
856 RandomAccessWrappedList(@ullable K key, List<V> delegate, @Nullable WrappedCollection ancestor) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/
H A DSVGRenderSupport.cpp175 bool SVGRenderSupport::transformToRootChanged(RenderObject* ancestor) argument
177 while (ancestor && !ancestor->isSVGRoot()) {
178 if (ancestor->isSVGTransformableContainer())
179 return toRenderSVGContainer(ancestor)->didTransformToRootUpdate();
180 if (ancestor->isSVGViewportContainer())
181 return toRenderSVGViewportContainer(ancestor)->didTransformToRootUpdate();
182 ancestor = ancestor->parent();
/external/chromium_org/chrome/browser/sync_file_system/
H A Dfake_remote_change_processor.cc72 base::FilePath ancestor = storage::VirtualPath::DirName(url.path()); local
75 CreateSyncableFileSystemURL(url.origin(), ancestor);
90 base::FilePath ancestor_parent = storage::VirtualPath::DirName(ancestor);
91 if (ancestor == ancestor_parent)
93 ancestor = ancestor_parent;
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderLayerStackingNode.cpp316 for (RenderLayer* ancestor = layer()->parent(); ancestor; ancestor = ancestor->parent()) {
317 RenderLayerStackingNode* stackingNode = ancestor->stackingNode();
/external/chromium_org/third_party/WebKit/Source/core/plugins/
H A DPluginOcclusionSupport.cpp69 // we've found the nodes just below the lowest comment ancestor.
195 const Element* ancestor = topLayerAncestor(element); local
198 size_t start = ancestor ? elements.find(ancestor) + 1 : 0;
/external/chromium_org/ui/wm/core/
H A Dwindow_util.cc120 const aura::Window* ancestor) {
122 if (transient_parent == ancestor)
125 HasTransientAncestor(transient_parent, ancestor) : false;
119 HasTransientAncestor(const aura::Window* window, const aura::Window* ancestor) argument
/external/chromium_org/content/browser/accessibility/
H A Dbrowser_accessibility_manager_android.cc414 BrowserAccessibilityAndroid* ancestor =
416 while (ancestor) {
417 if (ancestor->PlatformIsLeaf() ||
418 (ancestor->IsFocusable() && !ancestor->HasFocusableChild())) {
419 node = ancestor;
420 // Don't break - we want the highest ancestor that's focusable or a
423 ancestor = static_cast<BrowserAccessibilityAndroid*>(ancestor->GetParent());

Completed in 737 milliseconds

123456