HomeSort by relevance Sort by last modified time
    Searched refs:ancestor (Results 1 - 25 of 155) sorted by null

1 2 3 4 5 6 7

  /external/chromium_org/third_party/WebKit/Source/core/svg/
SVGFontFaceFormatElement.cpp 51 ContainerNode* ancestor = parentNode()->parentNode();
52 if (!ancestor || !ancestor->hasTagName(font_face_srcTag))
55 ancestor = ancestor->parentNode();
56 if (ancestor && ancestor->hasTagName(font_faceTag))
57 toSVGFontFaceElement(ancestor)->rebuildFontFace();
SVGForeignObjectElement.cpp 147 Element* ancestor = parentElement(); local
148 while (ancestor && ancestor->isSVGElement()) {
149 if (ancestor->renderer() && ancestor->renderer()->isSVGHiddenContainer())
152 ancestor = ancestor->parentElement();
  /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/chromium_org/third_party/WebKit/Source/core/inspector/
PageConsoleAgent.cpp 78 Node* ancestor = node->highestAncestor(); local
79 if (!ancestor->isShadowRoot() || toShadowRoot(ancestor)->type() == ShadowRoot::AuthorShadowRoot)
82 node = toShadowRoot(ancestor)->host();
  /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/guava/guava-tests/test/com/google/common/collect/
FauxveridesTest.java 108 private void doHasAllFauxveridesTest(Class<?> descendant, Class<?> ancestor) {
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)) {
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/editing/
BreakBlockquoteCommand.cpp 139 // On exiting this loop, clonedAncestor is the lowest ancestor
163 // Split the tree up the ancestor chain until the topBlockquote
164 // Throughout this loop, clonedParent is the clone of ancestor's parent.
165 // This is so we can clone ancestor's siblings and place the clones
166 // into the clone corresponding to the ancestor's parent.
167 RefPtr<Element> ancestor; local
169 for (ancestor = ancestors.first(), clonedParent = clonedAncestor->parentElement();
170 ancestor && ancestor != topBlockquote;
171 ancestor = ancestor->parentElement(), clonedParent = clonedParent->parentElement()
    [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/chromium_org/third_party/skia/src/core/
SkPictureStateTree.cpp 134 // Trace back up to a common ancestor, restoring to get our current state to match that
135 // of the ancestor, and saving a list of nodes whose state we need to apply to get to
136 // the target (we can restore up to the ancestor immediately, but we'll need to return
140 Node* ancestor = targetNode; local
141 while (tmp != ancestor) {
143 uint16_t targetLevel = ancestor->fLevel;
150 fNodes.push(ancestor);
151 ancestor = ancestor->fParent;
155 if (ancestor->fFlags & Node::kSave_Flag)
    [all...]
  /external/dexmaker/src/dx/java/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/skia/src/core/
SkPictureStateTree.cpp 134 // Trace back up to a common ancestor, restoring to get our current state to match that
135 // of the ancestor, and saving a list of nodes whose state we need to apply to get to
136 // the target (we can restore up to the ancestor immediately, but we'll need to return
140 Node* ancestor = targetNode; local
141 while (tmp != ancestor) {
143 uint16_t targetLevel = ancestor->fLevel;
150 fNodes.push(ancestor);
151 ancestor = ancestor->fParent;
155 if (ancestor->fFlags & Node::kSave_Flag)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLFormControlElement.cpp 105 for (ContainerNode* ancestor = parentNode(); ancestor; ancestor = ancestor->parentNode()) {
106 if (!legendAncestor && ancestor->hasTagName(legendTag))
107 legendAncestor = ancestor;
108 if (ancestor->hasTagName(fieldsetTag)) {
109 fieldSetAncestor = static_cast<HTMLFieldSetElement*>(ancestor);
369 for (ContainerNode* ancestor = parentNode(); ancestor; ancestor = ancestor->parentNode())
    [all...]
  /external/chromium_org/tools/python/google/
path_utils.py 21 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/chromium_org/third_party/WebKit/Source/devtools/front_end/
BottomUpProfileDataGridTree.js 30 // because a root node can represent itself AND an ancestor.
114 var ancestor = nodeInfo.ancestor;
116 var child = this.findChild(ancestor);
127 // If not, add it as a true ancestor.
128 // In heavy mode, we take our visual identity from ancestor node...
129 child = new WebInspector.BottomUpProfileDataGridNode(ancestor, this.tree);
131 if (ancestor !== focusNode) {
140 var parent = ancestor.parent;
142 nodeInfo.ancestor = parent
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/css/
SelectorFilter.cpp 96 for (Element* ancestor = parent; ancestor; ancestor = ancestor->parentOrShadowHostElement())
97 ancestors.append(ancestor);
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderLazyBlock.cpp 71 for (RenderObject* ancestor = parent(); ancestor; ancestor = ancestor->parent()) {
72 if (ancestor->isRenderLazyBlock())
TextAutosizer.cpp 86 RenderObject* ancestor = renderer->parent(); local
87 while (ancestor && (ancestor->isRenderInline() || ancestor->isAnonymousBlock()))
88 ancestor = ancestor->parent();
90 return (ancestor && ancestor->isListItem()) ? toRenderListItem(ancestor) : 0;
95 // FIXME: Add support for <menu> elements as a possible ancestor of an <li> element
    [all...]
  /external/chromium_org/ui/views/controls/
native_control_win.cc 182 View *ancestor = this; local
183 while (ancestor) {
184 const Background* background = ancestor->background();
190 ancestor = ancestor->parent();
  /external/guava/guava/src/com/google/common/collect/
AbstractMultimap.java 376 @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 == null) ? null : ancestor.getDelegate()
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/
SVGRenderSupport.cpp 196 bool SVGRenderSupport::transformToRootChanged(RenderObject* ancestor)
198 while (ancestor && !ancestor->isSVGRoot()) {
199 if (ancestor->isSVGTransformableContainer())
200 return toRenderSVGContainer(ancestor)->didTransformToRootUpdate();
201 if (ancestor->isSVGViewportContainer())
202 return toRenderSVGViewportContainer(ancestor)->didTransformToRootUpdate();
203 ancestor = ancestor->parent();
  /external/chromium/chrome/browser/accessibility/
browser_accessibility.cc 91 BrowserAccessibility* ancestor) {
92 if (this == ancestor) {
95 return parent_->IsDescendantOf(ancestor);
  /external/libvpx/libvpx/nestegg/src/
nestegg.c 274 struct list_node * ancestor; member in struct:saved_state
292 struct list_node * ancestor; member in struct:nestegg
756 ne_is_ancestor_element(uint64_t id, struct list_node * ancestor)
760 for (; ancestor; ancestor = ancestor->previous)
761 for (element = ancestor->node; element->id; ++element)
781 ne_ctx_push(nestegg * ctx, struct ebml_element_desc * ancestor, void * data)
786 item->previous = ctx->ancestor;
787 item->node = ancestor;
    [all...]
  /external/chromium_org/third_party/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/chromium_org/ui/base/models/
tree_node_model.h 159 // Returns true if this == ancestor, or one of this nodes parents is
160 // ancestor.
161 bool HasAncestor(const NodeType* ancestor) const {
162 if (ancestor == this)
164 if (!ancestor)
166 return parent_ ? parent_->HasAncestor(ancestor) : false;
  /external/guava/guava/src/com/google/common/net/
InternetDomainName.java 367 return hasPublicSuffix() ? ancestor(publicSuffixIndex) : null;
444 return ancestor(publicSuffixIndex - 1);
455 * Returns an {@code InternetDomainName} that is the immediate ancestor of
464 return ancestor(1);
468 * Returns the ancestor of the current domain at the given number of levels
475 private InternetDomainName ancestor(int levels) { method in class:InternetDomainName

Completed in 1174 milliseconds

1 2 3 4 5 6 7