Eliminate Newborn/NoAddRef (
bug 5907, r=ds).
1 // vim: set sts=8 ts=2 sw=2 tw=99 et:
3 // Copyright (C) 2013, David Anderson and AlliedModders LLC
4 // All rights reserved.
6 // Redistribution and use in source and binary forms, with or without
7 // modification, are permitted provided that the following conditions are met:
9 // * Redistributions of source code must retain the above copyright notice, this
10 // list of conditions and the following disclaimer.
11 // * Redistributions in binary form must reproduce the above copyright notice,
12 // this list of conditions and the following disclaimer in the documentation
13 // and/or other materials provided with the distribution.
14 // * Neither the name of AlliedModders LLC nor the names of its contributors
15 // may be used to endorse or promote products derived from this software
16 // without specific prior written permission.
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
22 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 // POSSIBILITY OF SUCH DAMAGE.
30 #ifndef _include_amtl_inline_list_h_
31 #define _include_amtl_inline_list_h_
38 template <typename T> class InlineList;
40 // Objects can recursively inherit from InlineListNode in order to have
41 // membership in an InlineList<T>.
45 friend class InlineList<T>;
54 InlineListNode(InlineListNode *next, InlineListNode *prev)
61 InlineListNode *next_;
62 InlineListNode *prev_;
65 // An InlineList is a linked list that threads link pointers through objects,
66 // rather than allocating node memory. A node can be in at most one list at
69 // Since InlineLists are designed to be very cheap, there is no requirement
70 // that elements be removed from a list once the list is destructed. However,
71 // for as long as the list is alive, all of its contained nodes must also
76 typedef InlineListNode<T> Node;
80 // Work around a clang bug where we can't initialize with &head_ in the ctor.
87 : head_(head(), head())
94 // Remove all items to clear their next/prev fields.
95 while (begin() != end())
103 friend class InlineList;
112 iterator & operator ++() {
116 iterator operator ++(int) {
118 iter_ = iter_->next_;
122 return static_cast<T *>(iter_);
125 return static_cast<T *>(iter_);
127 bool operator !=(const iterator &where) const {
128 return iter_ != where.iter_;
130 bool operator ==(const iterator &where) const {
131 return iter_ == where.iter_;
136 return iterator(head_.next_);
140 return iterator(&head_);
143 iterator erase(iterator &at) {
149 // Iterator is no longer valid.
156 return head_.next_ == &head_;
159 void remove(Node *t) {
160 t->prev_->next_ = t->next_;
161 t->next_->prev_ = t->prev_;
169 void append(Node *t) {
173 t->prev_ = head_.prev_;
175 head_.prev_->next_ = t;
182 #endif // _include_amtl_inline_list_h_