/external/webkit/WebCore/rendering/ |
H A D | RenderRuby.cpp | 44 RenderObject* child = ruby->lastChild(); local 45 if (child && ruby->isAfterContent(child)) 46 child = child->previousSibling(); 47 ASSERT(!child || child->isRubyRun()); 48 return static_cast<RenderRubyRun*>(child); 51 static inline RenderRubyRun* findRubyRunParent(RenderObject* child) argument 53 while (child 69 isChildAllowed(RenderObject* child, RenderStyle*) const argument 76 addChild(RenderObject* child, RenderObject* beforeChild) argument 110 removeChild(RenderObject* child) argument 138 isChildAllowed(RenderObject* child, RenderStyle*) const argument 145 addChild(RenderObject* child, RenderObject* beforeChild) argument 180 removeChild(RenderObject* child) argument [all...] |
H A D | RenderFlexibleBox.cpp | 54 RenderBox* child = box->firstChildBox(); local 55 while (child) { 56 if (child->style()->boxOrdinalGroup() > lastOrdinal) 57 lastOrdinal = child->style()->boxOrdinalGroup(); 58 child = child->nextSiblingBox(); 123 for (RenderBox* child = firstChildBox(); child; child = child 311 RenderBox* child = iterator.first(); local 350 RenderBox* child; local 660 RenderBox* child; local 1015 placeChild(RenderBox* child, int x, int y) argument 1029 allowedChildFlex(RenderBox* child, bool expanding, unsigned int group) argument [all...] |
H A D | RenderTableRow.cpp | 65 void RenderTableRow::addChild(RenderObject* child, RenderObject* beforeChild) argument 71 if (!child->isTableCell()) { 76 last->addChild(child); 82 last->parent()->addChild(child, beforeChild); 92 cell->addChild(child); 100 RenderTableCell* cell = toRenderTableCell(child); 120 for (RenderObject* child = firstChild(); child; child = child [all...] |
H A D | RenderRubyText.cpp | 47 bool RenderRubyText::isChildAllowed(RenderObject* child, RenderStyle*) const argument 49 return child->isInline();
|
H A D | RenderRubyBase.cpp | 48 bool RenderRubyBase::isChildAllowed(RenderObject* child, RenderStyle*) const argument 50 return child->isInline(); 58 for (RenderObject* child = firstChild(); child != beforeChild; child = child->nextSibling()) { 59 if (!child->isFloatingOrPositioned() && !(child->isAnonymousBlock() && child->childrenInline())) 71 // First make sure that beforeChild (if set) is indeed a direct child o [all...] |
H A D | RenderRubyRun.cpp | 84 RenderObject* child = firstChild(); local 85 return child && child->isRubyText() ? static_cast<RenderRubyText*>(child) : 0; 90 RenderObject* child = lastChild(); local 91 return child && child->isRubyBase() ? static_cast<RenderRubyBase*>(child) : 0; 113 bool RenderRubyRun::isChildAllowed(RenderObject* child, RenderStyle*) const argument 115 return child 118 addChild(RenderObject* child, RenderObject* beforeChild) argument 164 removeChild(RenderObject* child) argument [all...] |
H A D | RenderObjectChildList.h | 47 // FIXME: Temporary while RenderBox still exists. Eventually this will just happen during insert/append/remove methods on the child list, and nobody 49 void setFirstChild(RenderObject* child) { m_firstChild = child; } argument 50 void setLastChild(RenderObject* child) { m_lastChild = child; } argument 56 void insertChildNode(RenderObject* owner, RenderObject* child, RenderObject* before, bool fullInsert = true);
|
H A D | RenderTableCol.cpp | 60 bool RenderTableCol::isChildAllowed(RenderObject* child, RenderStyle* style) const argument 62 return !child->isText() && style && (style->display() == TABLE_COLUMN); 95 for (RenderObject* child = firstChild(); child; child = child->nextSibling()) 96 child->setPrefWidthsDirty(false);
|
/external/webkit/WebCore/html/ |
H A D | HTMLTableRowsCollection.cpp | 57 Node* child = 0; local 62 for (child = previous->nextSibling(); child; child = child->nextSibling()) { 63 if (child->hasTagName(trTag)) 64 return static_cast<HTMLTableRowElement*>(child); 70 child = table->firstChild(); 72 child = previous->parent()->nextSibling(); 73 for (; child; chil [all...] |
/external/webkit/WebCore/editing/ |
H A D | RemoveNodePreservingChildrenCommand.cpp | 44 for (Node* child = m_node->firstChild(); child; child = child->nextSibling()) 45 children.append(child); 49 RefPtr<Node> child = children[i].release(); local 50 removeNode(child); 51 insertNodeBefore(child.release(), m_node);
|
H A D | WrapContentsInDummySpanCommand.cpp | 44 for (Node* child = m_element->firstChild(); child; child = child->nextSibling()) 45 children.append(child); 71 for (Node* child = m_dummySpan->firstChild(); child; child = child->nextSibling()) 72 children.append(child); [all...] |
H A D | MergeIdenticalElementsCommand.cpp | 53 for (Node* child = m_element1->firstChild(); child; child = child->nextSibling()) 54 children.append(child); 81 for (Node* child = m_element2->firstChild(); child && child != atChild; child = child [all...] |
/external/webkit/WebCore/platform/qt/ |
H A D | ScrollViewQt.cpp | 49 void ScrollView::platformRemoveChild(Widget* child) argument 51 child->hide();
|
/external/webkit/WebCore/css/ |
H A D | StyleList.cpp | 31 void StyleList::append(PassRefPtr<StyleBase> child) argument 33 StyleBase* c = child.get(); 34 m_children.append(child); 38 void StyleList::insert(unsigned position, PassRefPtr<StyleBase> child) argument 40 StyleBase* c = child.get(); 42 m_children.append(child); 44 m_children.insert(position, child);
|
/external/webkit/WebCore/svg/ |
H A D | SVGTSpanElement.cpp | 41 bool SVGTSpanElement::childShouldCreateRenderer(Node* child) const 43 if (child->isTextNode() 45 || child->hasTagName(SVGNames::altGlyphTag) 47 || child->hasTagName(SVGNames::tspanTag) || child->hasTagName(SVGNames::trefTag) || child->hasTagName(SVGNames::textPathTag))
|
H A D | SVGFontFaceSrcElement.cpp | 44 for (Node* child = firstChild(); child; child = child->nextSibling()) { 45 if (child->hasTagName(font_face_uriTag)) 46 list->append(static_cast<SVGFontFaceUriElement*>(child)->srcValue()); 47 else if (child->hasTagName(font_face_nameTag)) 48 list->append(static_cast<SVGFontFaceNameElement*>(child)->srcValue());
|
/external/skia/src/core/ |
H A D | SkTSort.h | 26 int child = root * 2 + 1; local 27 if (child+1 <= bottom && array[child] < array[child+1]) { 28 child += 1; 30 if (array[root] < array[child]) { 31 SkTSwap<T>(array[root], array[child]); 32 root = child;
|
/external/gtest/test/ |
H A D | gtest_xml_test_utils.py | 62 * It has an equivalent set of child nodes (including elements and 89 for child_id, child in expected_children.iteritems(): 92 self.AssertEquivalentNodes(child, actual_children[child_id]) 102 Fetches all of the child nodes of element, a DOM Element object. 108 above four is encountered, if two child elements with the same 115 for child in element.childNodes: 116 if child.nodeType == Node.ELEMENT_NODE: 117 self.assert_(child.tagName in self.identifying_attribute, 118 "Encountered unknown element <%s>" % child.tagName) 119 childID = child [all...] |
/external/elfutils/libelf/ |
H A D | elf_readall.c | 33 Elf *child = elf->state.ar.children; local 35 while (child != NULL) 37 if (child->map_address == NULL) 39 child->map_address = elf->map_address; 40 child->start_offset -= offset; 41 if (child->kind == ELF_K_AR) 42 child->state.ar.offset -= offset; 44 set_address (child, offset); 47 child = child [all...] |
/external/webkit/WebCore/page/ |
H A D | FrameTree.cpp | 38 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling()) 39 child->setView(0); 64 void FrameTree::appendChild(PassRefPtr<Frame> child) argument 66 ASSERT(child->page() == m_thisFrame->page()); 67 child->tree()->m_parent = m_thisFrame; 70 m_lastChild = child.get(); 73 child 83 removeChild(Frame* child) argument 152 Frame* FrameTree::child(unsigned index) const function in class:WebCore::FrameTree 160 Frame* FrameTree::child(const AtomicString& name) const function in class:WebCore::FrameTree 232 Frame* child = firstChild(); local [all...] |
/external/kernel-headers/original/linux/ |
H A D | ptrace.h | 84 extern long arch_ptrace(struct task_struct *child, long request, long addr, long data); 93 extern int ptrace_request(struct task_struct *child, long request, long addr, long data); 95 extern void __ptrace_link(struct task_struct *child, 97 extern void __ptrace_unlink(struct task_struct *child); 98 extern void ptrace_untrace(struct task_struct *child); 101 static inline void ptrace_link(struct task_struct *child, argument 104 if (unlikely(child->ptrace)) 105 __ptrace_link(child, new_parent); 107 static inline void ptrace_unlink(struct task_struct *child) argument 109 if (unlikely(child [all...] |
/external/webkit/WebCore/accessibility/ |
H A D | AccessibilityARIAGrid.cpp | 62 void AccessibilityARIAGrid::addChild(AccessibilityObject* child, HashSet<AccessibilityObject*>& appendedRows, unsigned& columnCount) argument 64 if (!child || !child->isTableRow() || child->ariaRoleAttribute() != RowRole) 67 AccessibilityTableRow* row = static_cast<AccessibilityTableRow*>(child); 100 for (RefPtr<AccessibilityObject> child = firstChild(); child; child = child->nextSibling()) { 103 if (child [all...] |
/external/webkit/WebCore/dom/ |
H A D | ContainerNode.cpp | 77 // Make sure adding the new child is OK. 82 // NOT_FOUND_ERR: Raised if refChild is not a child of this node 95 // Now actually add the child(ren) 102 RefPtr<Node> child = isFragment ? newChild->firstChild() : newChild; local 103 while (child) { 104 RefPtr<Node> nextChild = isFragment ? child->nextSibling() : 0; 106 // If child is already present in the tree, first remove it from the old location. 107 if (Node* oldParent = child->parentNode()) 108 oldParent->removeChild(child.get(), ec); 118 // possible that "next" is no longer a child o 206 RefPtr<Node> child = isFragment ? newChild->firstChild() : newChild; local 287 willRemoveChild(Node *child) argument 322 RefPtr<Node> child = oldChild; local 454 RefPtr<Node> child = isFragment ? newChild->firstChild() : newChild; local 869 dispatchChildInsertionEvents(Node* child) argument 900 dispatchChildRemovalEvents(Node* child) argument [all...] |
/external/opencore/oscl/oscl/osclutil/src/ |
H A D | oscl_priqueue.cpp | 57 * parent-child relationship is satisfied (i.e., parent not less than 65 int child = 2 * index + 1; local 68 while (child < new_last_index) 70 if (((child + 1) < new_last_index) 71 && (pOpaqueType->compare_LT(pVec->increment_T(first, child), pVec->increment_T(first, child + 1)))) 73 // make certain the child index is ordered according the comparison 74 child += 1; 77 if (pOpaqueType->compare_LT(pVec->increment_T(first, index), pVec->increment_T(first, child))) 80 pOpaqueType->swap(pVec->increment_T(first, index), pVec->increment_T(first, child)); [all...] |
/external/skia/src/views/ |
H A D | SkView.cpp | 111 SkView* child; local 115 while ((child = iter.next()) != NULL) 116 child->draw(childCanvas); 201 SkView* child, *focus; local 202 while ((child = iter.next()) != NULL) 203 if ((focus = child->acceptFocus(dir)) != NULL) 209 SkView* child, *focus; local 210 while ((child = iter.next()) != NULL) 211 if ((focus = child->acceptFocus(dir)) != NULL) 232 SkView* child, *paren local 356 SkView* child; local 512 attachChildToBack(SkView* child) argument 544 attachChildToFront(SkView* child) argument 650 SkView* child; local 755 SkView* child; local [all...] |