Searched refs:child (Results 151 - 175 of 1690) sorted by relevance

1234567891011>>

/external/chromium_org/ui/compositor/
H A Dlayer_tree_owner.cc19 Layer* child = *it; local
20 DeepDeleteLayers(child);
/external/chromium_org/ui/views/
H A Dview_targeter_delegate.cc44 View* child = root->child_at(i); local
46 if (!child->CanProcessEventsWithinSubtree())
50 if (!child->visible())
53 View::ConvertRectToTarget(root, child, &rect_in_child_coords_f);
56 if (!child->HitTestRect(rect_in_child_coords))
59 View* cur_view = child->GetEventHandlerForRect(rect_in_child_coords);
82 if (child->HitTestPoint(point_in_child_coords))
83 point_view = child->GetEventHandlerForPoint(point_in_child_coords);
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DCheckerHelpers.h32 if (const Stmt *child = *I)
33 if (containsStmt<T>(child))
/external/jsilver/src/com/google/clearsilver/jsilver/data/
H A DAbstractData.java52 Data child = getChild(path);
53 if (child == null) {
56 String result = child.getValue();
68 Data child = getChild(path);
69 if (child == null) {
72 String result = child.getValue();
109 Data child = createChild(path);
110 child.setValue(value);
/external/chromium_org/ash/wm/
H A Droot_window_layout_manager.cc55 void RootWindowLayoutManager::OnWindowAddedToLayout(aura::Window* child) { argument
59 aura::Window* child) {
62 void RootWindowLayoutManager::OnWindowRemovedFromLayout(aura::Window* child) { argument
66 aura::Window* child,
71 aura::Window* child,
73 SetChildBoundsDirect(child, requested_bounds);
58 OnWillRemoveWindowFromLayout( aura::Window* child) argument
65 OnChildWindowVisibilityChanged( aura::Window* child, bool visible) argument
70 SetChildBounds( aura::Window* child, const gfx::Rect& requested_bounds) argument
/external/chromium_org/components/onc/docs/
H A Donc_spec.js33 var child = node.firstChild;
34 while (child) {
35 if (child.tagName === 'SECTION') {
36 outline(child);
38 child = child.nextSibling;
/external/chromium_org/content/browser/frame_host/
H A Dframe_tree_node.cc44 void FrameTreeNode::AddChild(scoped_ptr<FrameTreeNode> child, argument
50 // Initialize the RenderFrameHost for the new node. We always create child
53 child->render_manager()->Init(
58 child->set_parent(this);
59 children_.push_back(child.release());
62 void FrameTreeNode::RemoveChild(FrameTreeNode* child) { argument
66 if ((*iter) == child)
87 // commits before the old process cleans everything up. Make sure the child
/external/chromium_org/sandbox/win/wow_helper/
H A Dwow_helper.cc21 // ntdll.dll. 'thunk' is the buffer on the address space of process 'child',
23 int PatchNtdll(HANDLE child, void* thunk, size_t thunk_bytes) { argument
29 Service64ResolverThunk resolver(child);
44 if (!::WriteProcessMemory(child, code, &TargetNtMapViewOfSection, size,
74 HANDLE child = ::OpenProcess(access, FALSE, process_id); local
75 if (!child)
85 return sandbox::PatchNtdll(child, thunk, kPageSize);
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderRubyRun.cpp68 RenderObject* child = firstChild(); local
71 ASSERT(!child || !child->isRubyText() || !child->isFloatingOrOutOfFlowPositioned());
72 return child && child->isRubyText() ? static_cast<RenderRubyText*>(child) : 0;
77 RenderObject* child = lastChild(); local
78 return child && child
91 isChildAllowed(RenderObject* child, RenderStyle*) const argument
96 addChild(RenderObject* child, RenderObject* beforeChild) argument
140 removeChild(RenderObject* child) argument
[all...]
H A DRenderGrid.cpp223 // If the new child has been inserted inside an existent anonymous block, we can simply ignore it as the anonymous
239 // The new child requires the auto-placement algorithm to run so we need to recompute the grid fully.
248 void RenderGrid::addChildToIndexesMap(RenderBox& child) argument
250 ASSERT(!m_gridItemsIndexesMap.contains(&child));
251 RenderBox* sibling = child.nextSiblingBox();
255 sibling = child.previousSiblingBox();
266 m_gridItemsIndexesMap.set(&child, index);
269 void RenderGrid::removeChild(RenderObject* child) argument
271 RenderBlock::removeChild(child);
276 ASSERT(child
615 logicalHeightForChild(RenderBox& child, Vector<GridTrack>& columnTracks) argument
631 minContentForChild(RenderBox& child, GridTrackSizingDirection direction, Vector<GridTrack>& columnTracks) argument
647 maxContentForChild(RenderBox& child, GridTrackSizingDirection direction, Vector<GridTrack>& columnTracks) argument
663 gridItemSpan(const RenderBox& child, GridTrackSizingDirection direction) argument
828 insertItemIntoGrid(RenderBox& child, const GridCoordinate& coordinate) argument
1104 gridAreaBreadthForChild(const RenderBox& child, GridTrackSizingDirection direction, const Vector<GridTrack>& tracks) const argument
[all...]
/external/markdown/markdown/
H A Dtreeprocessors.py172 for child in [node] + node.getchildren():
173 if child.tail:
174 if child.tail.strip():
175 self.__processElementText(node, child, False)
176 if child.text:
177 if child.text.strip():
178 self.__processElementText(child, child)
227 for child in [node] + node.getchildren():
229 if child
[all...]
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DContainerNode.h59 // for a Node Vector that is used to store child Nodes of a given Node.
85 PassRefPtrWillBeRawPtr<Node> removeChild(PassRefPtrWillBeRawPtr<Node> child, ExceptionState& = ASSERT_NO_EXCEPTION);
195 // Notifies the node that it's list of children have changed (either by adding or removing child nodes), or a child
212 void setFirstChild(Node* child) { m_firstChild = child; } argument
213 void setLastChild(Node* child) { m_lastChild = child; } argument
228 void appendChildCommon(Node& child);
229 void updateTreeAfterInsertion(Node& child);
268 Node* child = m_firstChild; local
[all...]
/external/valgrind/main/coregrind/
H A Dm_wordfm.c68 struct _AvlNode* child[2]; /* [0] is left subtree, [1] is right */ member in struct:_AvlNode
100 AvlNode* b = a->child[1];
102 a->child[1] = b->child[0];
103 b->child[0] = a;
110 AvlNode* b = a->child[0];
112 a->child[0] = b->child[1];
113 b->child[1] = a;
121 root->child[
[all...]
/external/chromium_org/tools/resources/
H A Dlist_unused_grit_header.py45 for child in node.getchildren():
46 if child.tag == resource_tag:
47 resources.append(child.attrib['name'])
48 elif child.tag in IF_ELSE_TAGS:
49 resources.extend(GetResourcesForNode(child, parent_file, resource_tag))
50 elif child.tag == 'part':
52 part_file = os.path.join(parent_dir, child.attrib['file'])
58 raise Exception('unknown tag:', child.tag)
67 """Look through a node's children for a child node with a given tag.
71 tag: The tag on a child nod
[all...]
/external/chromium_org/third_party/libxml/src/
H A Dcheck-relaxng-test-suite.py76 child = node.children
77 while child != None:
78 if child.type != 'text':
79 instance = instance + child.serialize()
80 child = child.next
117 child = node.children
118 while child != None:
119 if child.type != 'text':
120 instance = instance + child
[all...]
H A Dcheck-relaxng-test-suite2.py65 child = node.children
66 while child != None:
67 if child.type != 'text':
68 instance = instance + child.serialize()
69 child = child.next
118 child = node.children
119 while child != None:
120 if child.type != 'text':
121 instance = instance + child
[all...]
H A Dcheck-xsddata-test-suite.py64 child = node.children
65 while child != None:
66 if child.type != 'text':
67 instance = instance + child.serialize()
68 child = child.next
117 child = node.children
118 while child != None:
119 if child.type != 'text':
120 instance = instance + child
[all...]
/external/doclava/src/com/google/doclava/
H A DInfoBuilder.java394 ParseTree child = (ParseTree) tree.getChild(i);
396 if (child.payload != null && "qualifiedName".equals(child.payload.toString())) {
397 String packageName = buildQualifiedName(child);
457 ParseTree child = it.next();
460 modifiers.parseModifiers(child);
463 child = it.next();
466 cls = buildClassName(child, containingClass, modifiers,
471 child = it.next();
474 if ("typeParameters".equals(child
[all...]
/external/chromium_org/ash/system/
H A Dstatus_area_widget_delegate.cc100 SetLayoutManager(NULL); // Reset layout manager before adding a child.
117 views::View* child = child_at(c); local
118 if (!child->visible())
129 views::View* child = child_at(c); local
130 if (child->visible())
131 layout->AddView(child);
139 views::View* child = child_at(c); local
140 if (!child->visible())
146 layout->AddView(child);
157 void StatusAreaWidgetDelegate::ChildPreferredSizeChanged(View* child) { argument
163 ChildVisibilityChanged(View* child) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/rendering/compositing/
H A DGraphicsLayerUpdater.cpp121 for (RenderLayer* child = layer.firstChild(); child; child = child->nextSibling())
122 updateRecursive(*child, updateType, childContext, layersNeedingPaintInvalidation);
132 for (RenderLayer* child = layer.firstChild(); child; child = child->nextSibling())
133 assertNeedsToUpdateGraphicsLayerBitsCleared(*child);
[all...]
/external/chromium_org/third_party/markdown/
H A Dtreeprocessors.py214 for child in [node] + node.getchildren():
215 if child.tail:
216 if child.tail.strip():
217 self.__processElementText(node, child,False)
218 if child.text:
219 if child.text.strip():
220 self.__processElementText(child, child)
272 for child in [node] + node.getchildren():
274 if child
[all...]
/external/chromium_org/net/tools/tld_cleanup/
H A Dmake_dafsa.py37 most one child with a label starting by the same character. The output
42 bits in a link (a reference to a child node) indicate if it has a size of one,
103 offset itself and the first child node. Subsequent offsets are the distance
104 between previous child node and next child node. Thus each offset links a node
105 to a child node. The distance is always counted between start addresses, i.e.
106 first byte in decoded offset or first byte in child node.
142 0: 0x81 <end_offset1> child at position 0 + (0x81 & 0x3F) -> jump to 1
145 2: 0x02 <offset1> child at position 2 + (0x02 & 0x3F) -> jump to 4
147 3: 0x81 <end_offset1> child a
[all...]
/external/chromium_org/tools/idl_parser/
H A Didl_node.py40 # which will be passed as a child to a standard IDLNode.
56 # which will be passed as a child to a standard IDLNode.
134 for child in self._children:
135 child.Traverse(search, filter_nodes)
181 for child in self.GetChildren():
182 if child.GetClass() in keys:
183 out.append(child)
194 for child in children:
195 if not child:
197 if type(child)
[all...]
/external/chromium_org/third_party/WebKit/Source/core/accessibility/
H A DAXMenuListPopup.cpp119 AXObject* child = m_children[i - 1].get(); local
122 if (child->actionElement()) {
123 child->detachFromParent();
124 cache->remove(child->axObjectID());
143 RefPtr<AXObject> child = m_children[optionIndex].get(); local
145 cache->postNotification(child.get(), document(), AXObjectCache::AXFocusedUIElementChanged, true, PostSynchronously);
146 cache->postNotification(child.get(), document(), AXObjectCache::AXMenuListItemSelected, true, PostSynchronously);
/external/chromium_org/ui/v2/public/
H A Dview.h69 void AddChild(View* child);
70 void RemoveChild(View* child);
72 bool Contains(View* child) const;
74 void StackChildAtTop(View* child);
75 void StackChildAtBottom(View* child);
76 void StackChildAbove(View* child, View* other);
77 void StackChildBelow(View* child, View* other);

Completed in 2641 milliseconds

1234567891011>>