Optimize the scope creation code by lazily allocating the hash maps...

src/hashmap.cc

 // Copyright 2008 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 13 matching lines @@
 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 #include "v8.h"
 
 #include "hashmap.h"
 
 namespace v8 { namespace internal {
 
-
-static inline bool IsPowerOf2(uint32_t x) {
-  ASSERT(x != 0);
-  return (x & (x - 1)) == 0;
-}
-
-
 Allocator HashMap::DefaultAllocator;
 
 
 HashMap::HashMap() {
   allocator_ = NULL;
   match_ = NULL;
 }
 
 
 HashMap::HashMap(MatchFun match,
@@ skipping 110 matching lines @@
       n--;
     }
   }
 
   // Delete old map.
   allocator_->Delete(map);
 }
 
 
 } }  // namespace v8::internal