Lines Matching full:child
38 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling())
39 child->setView(0);
64 void FrameTree::appendChild(PassRefPtr<Frame> child)
66 ASSERT(child->page() == m_thisFrame->page());
67 child->tree()->m_parent = m_thisFrame;
70 m_lastChild = child.get();
73 child->tree()->m_previousSibling = oldLast;
74 oldLast->tree()->m_nextSibling = child;
76 m_firstChild = child;
83 void FrameTree::removeChild(Frame* child)
85 child->tree()->m_parent = 0;
87 // Slightly tricky way to prevent deleting the child until we are done with it, w/o
88 // extra refs. These swaps leave the child in a circular list by itself. Clearing its
91 RefPtr<Frame>& newLocationForNext = m_firstChild == child ? m_firstChild : child->tree()->m_previousSibling->tree()->m_nextSibling;
92 Frame*& newLocationForPrevious = m_lastChild == child ? m_lastChild : child->tree()->m_nextSibling->tree()->m_previousSibling;
93 swap(newLocationForNext, child->tree()->m_nextSibling);
95 std::swap(newLocationForPrevious, child->tree()->m_previousSibling);
97 child->tree()->m_previousSibling = 0;
98 child->tree()->m_nextSibling = 0;
105 if (!requestedName.isEmpty() && !child(requestedName) && requestedName != "_blank")
108 // Create a repeatable name for a child about to be added to us. The name must be
112 // We generate this path component by index in the child list along with an unlikely
152 Frame* FrameTree::child(unsigned index) const
160 Frame* FrameTree::child(const AtomicString& name) const
162 for (Frame* child = firstChild(); child; child = child->tree()->nextSibling())
163 if (child->tree()->name() == name)
164 return child;
232 Frame* child = firstChild();
233 if (child) {
234 ASSERT(!stayWithin || child->tree()->isDescendantOf(stayWithin));
235 return child;
