30     explicit EcmaList(T *node) : first_(node), last_(node)  in EcmaList()  argument
32         node->LinkPrev(nullptr);  in EcmaList()
33         node->LinkNext(nullptr);  in EcmaList()
38     void AddNode(T *node)  in AddNode()  argument
40         ASSERT(node != nullptr);  in AddNode()
43             node->LinkNext(lastNext);  in AddNode()
44             node->LinkPrev(last_);  in AddNode()
45             last_->LinkNext(node);  in AddNode()
47                 lastNext->LinkPrev(node);  in AddNode()
49                 last_ = node;  in AddNode()
52             node->LinkPrev(nullptr);  in AddNode()
53             node->LinkNext(nullptr);  in AddNode()
54             first_ = last_ = node;  in AddNode()
59     void AddNodeToFront(T *node)  in AddNodeToFront()  argument
61         ASSERT(node != nullptr);  in AddNodeToFront()
63             node->LinkNext(first_);  in AddNodeToFront()
64             node->LinkPrev(first_->GetPrev());  in AddNodeToFront()
65             first_->LinkPrev(node);  in AddNodeToFront()
66             first_ = node;  in AddNodeToFront()
68             node->LinkPrev(nullptr);  in AddNodeToFront()
69             node->LinkNext(nullptr);  in AddNodeToFront()
70             first_ = last_ = node;  in AddNodeToFront()
77         T *node = last_;  in PopBack()  local
79         return node;  in PopBack()
82     void RemoveNode(T *node)  in RemoveNode()  argument
84         ASSERT(HasNode(node));  in RemoveNode()
85         if (last_ == node) {  in RemoveNode()
87             last_ = node->GetPrev();  in RemoveNode()
89         if (first_ == node) {  in RemoveNode()
91             first_ = node->GetNext();  in RemoveNode()
94         T *next = node->GetNext();  in RemoveNode()
96         T *prev = node->GetPrev();  in RemoveNode()
104         node->LinkPrev(nullptr);  in RemoveNode()
106         node->LinkNext(nullptr);  in RemoveNode()
110     bool HasNode(T *node)  in HasNode()  argument
114             if (it == node) {  in HasNode()