diff options
author | Ryan Dahl <ry@tinyclouds.org> | 2011-08-04 12:18:09 -0700 |
---|---|---|
committer | Ryan Dahl <ry@tinyclouds.org> | 2011-08-04 12:18:09 -0700 |
commit | eeece4f5eab2d192635e19c64ae2d429f96c2284 (patch) | |
tree | 8ee91025e2e43769f1bfc01a101f95ba372830dd /deps/v8/test/cctest/test-dictionary.cc | |
parent | b8c8e9c113e4611560948420e1ad67f1ee13d975 (diff) | |
download | android-node-v8-eeece4f5eab2d192635e19c64ae2d429f96c2284.tar.gz android-node-v8-eeece4f5eab2d192635e19c64ae2d429f96c2284.tar.bz2 android-node-v8-eeece4f5eab2d192635e19c64ae2d429f96c2284.zip |
Upgrade V8 to 3.5.3
Diffstat (limited to 'deps/v8/test/cctest/test-dictionary.cc')
-rw-r--r-- | deps/v8/test/cctest/test-dictionary.cc | 85 |
1 files changed, 85 insertions, 0 deletions
diff --git a/deps/v8/test/cctest/test-dictionary.cc b/deps/v8/test/cctest/test-dictionary.cc new file mode 100644 index 0000000000..15a854b363 --- /dev/null +++ b/deps/v8/test/cctest/test-dictionary.cc @@ -0,0 +1,85 @@ +// Copyright 2011 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 +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// 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 "api.h" +#include "debug.h" +#include "execution.h" +#include "factory.h" +#include "macro-assembler.h" +#include "objects.h" +#include "global-handles.h" +#include "cctest.h" + +using namespace v8::internal; + +TEST(ObjectHashTable) { + v8::HandleScope scope; + LocalContext context; + Handle<ObjectHashTable> table = FACTORY->NewObjectHashTable(23); + Handle<JSObject> a = FACTORY->NewJSArray(7); + Handle<JSObject> b = FACTORY->NewJSArray(11); + table = PutIntoObjectHashTable(table, a, b); + CHECK_EQ(table->NumberOfElements(), 1); + CHECK_EQ(table->Lookup(*a), *b); + CHECK_EQ(table->Lookup(*b), HEAP->undefined_value()); + + // Keys still have to be valid after objects were moved. + HEAP->CollectGarbage(NEW_SPACE); + CHECK_EQ(table->NumberOfElements(), 1); + CHECK_EQ(table->Lookup(*a), *b); + CHECK_EQ(table->Lookup(*b), HEAP->undefined_value()); + + // Keys that are overwritten should not change number of elements. + table = PutIntoObjectHashTable(table, a, FACTORY->NewJSArray(13)); + CHECK_EQ(table->NumberOfElements(), 1); + CHECK_NE(table->Lookup(*a), *b); + + // Keys mapped to undefined should be removed permanently. + table = PutIntoObjectHashTable(table, a, FACTORY->undefined_value()); + CHECK_EQ(table->NumberOfElements(), 0); + CHECK_EQ(table->NumberOfDeletedElements(), 1); + CHECK_EQ(table->Lookup(*a), HEAP->undefined_value()); + + // Keys should map back to their respective values. + for (int i = 0; i < 100; i++) { + Handle<JSObject> key = FACTORY->NewJSArray(7); + Handle<JSObject> value = FACTORY->NewJSArray(11); + table = PutIntoObjectHashTable(table, key, value); + CHECK_EQ(table->NumberOfElements(), i + 1); + CHECK_NE(table->FindEntry(*key), ObjectHashTable::kNotFound); + CHECK_EQ(table->Lookup(*key), *value); + } + + // Keys never added to the map should not be found. + for (int i = 0; i < 1000; i++) { + Handle<JSObject> o = FACTORY->NewJSArray(100); + CHECK_EQ(table->FindEntry(*o), ObjectHashTable::kNotFound); + CHECK_EQ(table->Lookup(*o), HEAP->undefined_value()); + } +} |