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

1 2 3 4

  /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/chromium_org/third_party/WebKit/Source/core/svg/
SVGForeignObjectElement.cpp 147 Element* ancestor = parentElement(); local
148 while (ancestor && ancestor->isSVGElement()) {
149 if (ancestor->renderer() && ancestor->renderer()->isSVGHiddenContainer())
152 ancestor = ancestor->parentElement();
  /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...]
  /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/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();
native_control.cc 134 // We need to find an ancestor with a non-null background, and
140 const View *ancestor = parent_; local
141 while (ancestor) {
142 const Background *background = ancestor->background();
148 ancestor = ancestor->parent();
  /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/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/robolectric/src/main/java/com/xtremelabs/robolectric/res/
ViewLoader.java 300 View ancestor = (View) parent; local
301 while (ancestor.getParent() != null) {
302 ancestor = (View) ancestor.getParent();
304 ancestor.clearFocus();
  /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/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeParser.java 202 Object ancestor = getAncestor(adaptor, tokenNames, t, goal); local
203 if ( ancestor==null ) return false;
204 t = ancestor;
  /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/chromium_org/third_party/WebKit/Source/core/dom/
TreeScope.cpp 421 // chain is the ancestor.
431 Element* ancestor = node->shadowHost(); local
432 if (!ancestor)
434 node = ancestor;
  /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/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
  /external/chromium_org/ash/wm/dock/
docked_window_layout_manager.cc 407 aura::Window* ancestor = NULL; local
411 ancestor = parent;
415 if (ancestor)
416 UpdateStacking(ancestor);
  /packages/apps/Launcher3/src/com/android/launcher3/
Utilities.java 272 View ancestor = ancestorChain.get(i); local
275 pt[0] += ancestor.getScrollX();
276 pt[1] += ancestor.getScrollY();
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
ipa-prop.h 49 getting addresses of of ancestor fields in C++
51 NULL, ancestor jump function must behave like a simple pass-through.
74 IPA_JF_ANCESTOR /* represented by field ancestor */
93 /* Structure holding data required to describe an ancestor pass-through
98 /* Offset of the field representing the ancestor. */
129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
ipa-prop.h 49 getting addresses of of ancestor fields in C++
51 NULL, ancestor jump function must behave like a simple pass-through.
74 IPA_JF_ANCESTOR /* represented by field ancestor */
93 /* Structure holding data required to describe an ancestor pass-through
98 /* Offset of the field representing the ancestor. */
129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
ipa-prop.h 49 getting addresses of of ancestor fields in C++
51 NULL, ancestor jump function must behave like a simple pass-through.
74 IPA_JF_ANCESTOR /* represented by field ancestor */
93 /* Structure holding data required to describe an ancestor pass-through
98 /* Offset of the field representing the ancestor. */
129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
ipa-prop.h 49 getting addresses of of ancestor fields in C++
51 NULL, ancestor jump function must behave like a simple pass-through.
74 IPA_JF_ANCESTOR /* represented by field ancestor */
93 /* Structure holding data required to describe an ancestor pass-through
98 /* Offset of the field representing the ancestor. */
129 struct ipa_ancestor_jf_data GTY ((tag ("IPA_JF_ANCESTOR"))) ancestor; member in union:jump_func_value
  /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_org/third_party/WebKit/Source/core/rendering/
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/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...]

Completed in 800 milliseconds

1 2 3 4