Remove TLS access for current Zone.

src/splay-tree.h

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 40 matching lines @@
 // template <typename Config, class Allocator = FreeStoreAllocationPolicy>
 //     class SplayTree;
 template <typename Config, class AllocationPolicy>
 class SplayTree {
  public:
   typedef typename Config::Key Key;
   typedef typename Config::Value Value;
 
   class Locator;
 
-  SplayTree() : root_(NULL) { }
+  SplayTree(AllocationPolicy allocator = AllocationPolicy())
+      : root_(NULL), allocator_(allocator) { }
   ~SplayTree();
 
   INLINE(void* operator new(size_t size,
                             AllocationPolicy allocator = AllocationPolicy())) {
     return allocator.New(static_cast<int>(size));
   }
   INLINE(void operator delete(void* p, size_t)) {
     AllocationPolicy::Delete(p);
   }
 
   // Inserts the given key in this tree with the given value.  Returns
   // true if a node was inserted, otherwise false.  If found the locator
   // is enabled and provides access to the mapping for the key.
-  bool Insert(const Key& key, Locator* locator,
-              AllocationPolicy allocator = AllocationPolicy());
+  bool Insert(const Key& key, Locator* locator);
 
   // Looks up the key in this tree and returns true if it was found,
   // otherwise false.  If the node is found the locator is enabled and
   // provides access to the mapping for the key.
   bool Find(const Key& key, Locator* locator);
 
   // Finds the mapping with the greatest key less than or equal to the
   // given key.
   bool FindGreatestLessThan(const Key& key, Locator* locator);
 
@@ skipping 101 matching lines @@
   class NodeDeleter BASE_EMBEDDED {
    public:
     NodeDeleter() { }
     void Call(Node* node) { AllocationPolicy::Delete(node); }
 
    private:
     DISALLOW_COPY_AND_ASSIGN(NodeDeleter);
   };
 
   template <class Callback>
-  void ForEachNode(Callback* callback,
-                   AllocationPolicy allocator = AllocationPolicy());
+  void ForEachNode(Callback* callback);
 
   Node* root_;
+  AllocationPolicy allocator_;
 
   DISALLOW_COPY_AND_ASSIGN(SplayTree);
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPLAY_TREE_H_