clang: Remove an ancient workaround.

base/linked_list.h

 // Copyright (c) 2009 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef BASE_LINKED_LIST_H_
 #define BASE_LINKED_LIST_H_
 
 // Simple LinkedList type. (See the Q&A section to understand how this
 // differs from std::list).
 //
@@ skipping 107 matching lines @@
 
   // Cast from the node-type to the value type.
   const T* value() const {
     return static_cast<const T*>(this);
   }
 
   T* value() {
     return static_cast<T*>(this);
   }
 
-  // Work around a Clang bug reported upstream:
-  //   http://llvm.org/bugs/show_bug.cgi?id=7974
-  // TODO(evanm): remove this and its sole caller.
-  void set(LinkNode<T>* prev, LinkNode<T>* next) {
-    previous_ = prev; next_ = next;
-  }
-
  private:
   LinkNode<T>* previous_;
   LinkNode<T>* next_;
 };
 
 template <typename T>
 class LinkedList {
  public:
   // The "root" node is self-referential, and forms the basis of a circular
   // list (root_.next() will point back to the start of the list,
   // and root_->previous() wraps around to the end of the list).
-  LinkedList() { root_.set(&root_, &root_); }
+  LinkedList() : root_(&root_, &root_) {}
 
   // Appends |e| to the end of the linked list.
   void Append(LinkNode<T>* e) {
     e->InsertBefore(&root_);
   }
 
   LinkNode<T>* head() const {
     return root_.next();
   }
 
   LinkNode<T>* tail() const {
     return root_.previous();
   }
 
   const LinkNode<T>* end() const {
     return &root_;
   }
 
  private:
   LinkNode<T> root_;
 };
 
 }  // namespace base
 
 #endif  // BASE_LINKED_LIST_H_