Lines Matching refs:m_prev
54 LinkedHashSetNodeBase() : m_prev(this), m_next(this) { }
60 ASSERT(m_prev);
61 ASSERT(m_next->m_prev == this);
62 ASSERT(m_prev->m_next == this);
63 m_next->m_prev = m_prev;
64 m_prev->m_next = m_next;
75 other.m_prev = m_prev;
76 m_prev->m_next = &other;
77 m_prev = &other;
79 ASSERT(other.m_prev);
81 ASSERT(m_prev);
86 other.m_prev = this;
88 m_next->m_prev = &other;
91 ASSERT(other.m_prev);
93 ASSERT(m_prev);
97 : m_prev(prev)
103 LinkedHashSetNodeBase* m_prev;
111 : m_prev(0)
258 Node* lastNode() { return reinterpret_cast<Node*>(m_anchor.m_prev); }
259 const Node* lastNode() const { return reinterpret_cast<const Node*>(m_anchor.m_prev); }
411 m_position = m_position->m_prev;
551 m_impl.remove(static_cast<Node*>(m_anchor.m_prev));
672 ASSERT(a.m_prev && a.m_next && b.m_prev && b.m_next);
673 swap(a.m_prev, b.m_prev);
676 ASSERT(b.m_prev == &a);
678 b.m_prev = &b;
680 b.m_next->m_prev = &b;
681 b.m_prev->m_next = &b;
684 ASSERT(a.m_prev == &b);
686 a.m_prev = &a;
688 a.m_next->m_prev = &a;
689 a.m_prev->m_next = &a;
696 swap(a.m_prev, b.m_prev);
699 b.m_next->m_prev = &b;
700 b.m_prev->m_next = &b;
703 a.m_next->m_prev = &a;
704 a.m_prev->m_next = &a;
