test-hashmap.cc 5.13 KB
Newer Older
1
// Copyright 2008 the V8 project authors. All rights reserved.
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
// 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 <stdlib.h>

30
#include "src/base/overflowing-math.h"
31
#include "src/init/v8.h"
32
#include "test/cctest/cctest.h"
33

lpy's avatar
lpy committed
34
#include "src/base/hashmap.h"
35

36 37
namespace v8 {
namespace internal {
38
namespace test_hashmap {
39

40
using IntKeyHash = uint32_t (*)(uint32_t key);
41

42 43
class IntSet {
 public:
44
  explicit IntSet(IntKeyHash hash) : hash_(hash) {}
45 46

  void Insert(int x) {
47
    CHECK_NE(0, x);  // 0 corresponds to (void*)nullptr - illegal key value
lpy's avatar
lpy committed
48
    v8::base::HashMap::Entry* p =
49
        map_.LookupOrInsert(reinterpret_cast<void*>(x), hash_(x));
50
    CHECK_NOT_NULL(p);  // insert is set!
51 52 53 54
    CHECK_EQ(reinterpret_cast<void*>(x), p->key);
    // we don't care about p->value
  }

55
  void Remove(int x) {
56
    CHECK_NE(0, x);  // 0 corresponds to (void*)nullptr - illegal key value
57 58 59
    map_.Remove(reinterpret_cast<void*>(x), hash_(x));
  }

60
  bool Present(int x) {
lpy's avatar
lpy committed
61 62
    v8::base::HashMap::Entry* p =
        map_.Lookup(reinterpret_cast<void*>(x), hash_(x));
63
    if (p != nullptr) {
64 65
      CHECK_EQ(reinterpret_cast<void*>(x), p->key);
    }
66
    return p != nullptr;
67 68 69 70 71 72 73 74
  }

  void Clear() {
    map_.Clear();
  }

  uint32_t occupancy() const {
    uint32_t count = 0;
75
    for (v8::base::HashMap::Entry* p = map_.Start(); p != nullptr;
lpy's avatar
lpy committed
76
         p = map_.Next(p)) {
77 78 79 80 81 82 83
      count++;
    }
    CHECK_EQ(map_.occupancy(), static_cast<double>(count));
    return count;
  }

 private:
84
  IntKeyHash hash_;
lpy's avatar
lpy committed
85
  v8::base::HashMap map_;
86 87 88
};


89 90 91 92 93 94
static uint32_t Hash(uint32_t key)  { return 23; }
static uint32_t CollisionHash(uint32_t key)  { return key & 0x3; }


void TestSet(IntKeyHash hash, int size) {
  IntSet set(hash);
95
  CHECK_EQ(0u, set.occupancy());
96 97 98 99

  set.Insert(1);
  set.Insert(2);
  set.Insert(3);
100
  CHECK_EQ(3u, set.occupancy());
101 102 103

  set.Insert(2);
  set.Insert(3);
104
  CHECK_EQ(3u, set.occupancy());
105 106 107 108 109

  CHECK(set.Present(1));
  CHECK(set.Present(2));
  CHECK(set.Present(3));
  CHECK(!set.Present(4));
110
  CHECK_EQ(3u, set.occupancy());
111

112 113 114 115
  set.Remove(1);
  CHECK(!set.Present(1));
  CHECK(set.Present(2));
  CHECK(set.Present(3));
116
  CHECK_EQ(2u, set.occupancy());
117 118 119 120 121

  set.Remove(3);
  CHECK(!set.Present(1));
  CHECK(set.Present(2));
  CHECK(!set.Present(3));
122
  CHECK_EQ(1u, set.occupancy());
123

124
  set.Clear();
125
  CHECK_EQ(0u, set.occupancy());
126 127 128 129 130

  // Insert a long series of values.
  const int start = 453;
  const int factor = 13;
  const int offset = 7;
131
  const uint32_t n = size;
132 133 134 135 136

  int x = start;
  for (uint32_t i = 0; i < n; i++) {
    CHECK_EQ(i, static_cast<double>(set.occupancy()));
    set.Insert(x);
137
    x = base::AddWithWraparound(base::MulWithWraparound(x, factor), offset);
138
  }
139
  CHECK_EQ(n, static_cast<double>(set.occupancy()));
140 141 142 143 144

  // Verify the same sequence of values.
  x = start;
  for (uint32_t i = 0; i < n; i++) {
    CHECK(set.Present(x));
145
    x = base::AddWithWraparound(base::MulWithWraparound(x, factor), offset);
146 147
  }
  CHECK_EQ(n, static_cast<double>(set.occupancy()));
148 149 150 151 152 153 154 155

  // Remove all these values.
  x = start;
  for (uint32_t i = 0; i < n; i++) {
    CHECK_EQ(n - i, static_cast<double>(set.occupancy()));
    CHECK(set.Present(x));
    set.Remove(x);
    CHECK(!set.Present(x));
156
    x = base::AddWithWraparound(base::MulWithWraparound(x, factor), offset);
157 158 159 160 161 162 163 164 165

    // Verify the the expected values are still there.
    int y = start;
    for (uint32_t j = 0; j < n; j++) {
      if (j <= i) {
        CHECK(!set.Present(y));
      } else {
        CHECK(set.Present(y));
      }
166
      y = base::AddWithWraparound(base::MulWithWraparound(y, factor), offset);
167 168
    }
  }
169
  CHECK_EQ(0u, set.occupancy());
170 171 172
}


173
TEST(HashSet) {
174 175
  TestSet(Hash, 100);
  TestSet(CollisionHash, 50);
176
}
177

178
}  // namespace test_hashmap
179 180
}  // namespace internal
}  // namespace v8