Lines Matching refs:m_children
67 for (StackIterator currentChild = m_children.begin(); currentChild != m_children.end(); ++currentChild) {
75 if (m_children.size())
76 m_children.last()->setNextSibling(newChild.get());
77 m_children.append(newChild.release());
78 return m_children.last().get();
91 if (m_children.size())
92 m_children.last()->setNextSibling(child.get());
93 m_children.append(child.release());
101 for (size_t i = 0; i < m_children.size(); ++i) {
102 if (*node == m_children[i].get()) {
103 m_children.remove(i);
115 for (unsigned i = 0; i < m_children.size(); ++i)
116 node->addChild(m_children[i].release());
118 m_children.clear();
119 m_children.append(node.release());
130 for (unsigned i = 0; i < m_children.size(); ++i)
131 m_selfTime += m_children[i]->totalTime();
164 unsigned size = m_children.size();
166 m_children[i]->setNextSibling(i + 1 == size ? 0 : m_children[i + 1].get());
184 for (StackIterator currentChild = m_children.begin(); currentChild != m_children.end(); ++currentChild)
210 for (StackIterator currentChild = m_children.begin(); currentChild != m_children.end(); ++currentChild)