test-accessor-assembler.cc 7.89 KB
Newer Older
1 2 3 4 5 6 7
// Copyright 2016 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "test/cctest/cctest.h"

#include "src/base/utils/random-number-generator.h"
8
#include "src/ic/accessor-assembler.h"
9
#include "src/ic/stub-cache.h"
10
#include "src/objects/objects-inl.h"
11
#include "src/objects/smi.h"
12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
#include "test/cctest/compiler/code-assembler-tester.h"
#include "test/cctest/compiler/function-tester.h"

namespace v8 {
namespace internal {

using compiler::CodeAssemblerTester;
using compiler::FunctionTester;
using compiler::Node;

namespace {

void TestStubCacheOffsetCalculation(StubCache::Table table) {
  Isolate* isolate(CcTest::InitIsolateOnce());
  const int kNumParams = 2;
27
  CodeAssemblerTester data(isolate, kNumParams + 1);  // Include receiver.
28
  AccessorAssembler m(data.state());
29 30

  {
31 32
    TNode<Name> name = m.CAST(m.Parameter(1));
    TNode<Map> map = m.CAST(m.Parameter(2));
33 34
    TNode<IntPtrT> primary_offset =
        m.StubCachePrimaryOffsetForTesting(name, map);
35 36 37 38 39 40 41
    Node* result;
    if (table == StubCache::kPrimary) {
      result = primary_offset;
    } else {
      CHECK_EQ(StubCache::kSecondary, table);
      result = m.StubCacheSecondaryOffsetForTesting(name, primary_offset);
    }
42
    m.Return(m.SmiTag(result));
43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91
  }

  Handle<Code> code = data.GenerateCode();
  FunctionTester ft(code, kNumParams);

  Factory* factory = isolate->factory();
  Handle<Name> names[] = {
      factory->NewSymbol(),
      factory->InternalizeUtf8String("a"),
      factory->InternalizeUtf8String("bb"),
      factory->InternalizeUtf8String("ccc"),
      factory->NewPrivateSymbol(),
      factory->InternalizeUtf8String("dddd"),
      factory->InternalizeUtf8String("eeeee"),
      factory->InternalizeUtf8String("name"),
      factory->NewSymbol(),
      factory->NewPrivateSymbol(),
  };

  Handle<Map> maps[] = {
      factory->cell_map(),
      Map::Create(isolate, 0),
      factory->meta_map(),
      factory->code_map(),
      Map::Create(isolate, 0),
      factory->hash_table_map(),
      factory->symbol_map(),
      factory->string_map(),
      Map::Create(isolate, 0),
      factory->sloppy_arguments_elements_map(),
  };

  for (size_t name_index = 0; name_index < arraysize(names); name_index++) {
    Handle<Name> name = names[name_index];
    for (size_t map_index = 0; map_index < arraysize(maps); map_index++) {
      Handle<Map> map = maps[map_index];

      int expected_result;
      {
        int primary_offset = StubCache::PrimaryOffsetForTesting(*name, *map);
        if (table == StubCache::kPrimary) {
          expected_result = primary_offset;
        } else {
          expected_result =
              StubCache::SecondaryOffsetForTesting(*name, primary_offset);
        }
      }
      Handle<Object> result = ft.Call(name, map).ToHandleChecked();

92
      Smi expected = Smi::FromInt(expected_result & Smi::kMaxValue);
93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109
      CHECK_EQ(expected, Smi::cast(*result));
    }
  }
}

}  // namespace

TEST(StubCachePrimaryOffset) {
  TestStubCacheOffsetCalculation(StubCache::kPrimary);
}

TEST(StubCacheSecondaryOffset) {
  TestStubCacheOffsetCalculation(StubCache::kSecondary);
}

namespace {

110
Handle<Code> CreateCodeOfKind(CodeKind kind) {
111
  Isolate* isolate(CcTest::InitIsolateOnce());
112
  CodeAssemblerTester data(isolate, kind);
113 114 115 116 117 118 119 120
  CodeStubAssembler m(data.state());
  m.Return(m.UndefinedConstant());
  return data.GenerateCodeCloseAndEscape();
}

}  // namespace

TEST(TryProbeStubCache) {
121
  using Label = CodeStubAssembler::Label;
122 123
  Isolate* isolate(CcTest::InitIsolateOnce());
  const int kNumParams = 3;
124
  CodeAssemblerTester data(isolate, kNumParams + 1);  // Include receiver.
125
  AccessorAssembler m(data.state());
126

127
  StubCache stub_cache(isolate);
128 129 130
  stub_cache.Clear();

  {
131 132
    TNode<Object> receiver = m.CAST(m.Parameter(1));
    TNode<Name> name = m.CAST(m.Parameter(2));
133
    TNode<MaybeObject> expected_handler =
134
        m.UncheckedCast<MaybeObject>(m.Parameter(3));
135 136 137

    Label passed(&m), failed(&m);

138
    CodeStubAssembler::TVariable<MaybeObject> var_handler(&m);
139 140 141 142
    Label if_handler(&m), if_miss(&m);

    m.TryProbeStubCache(&stub_cache, receiver, name, &if_handler, &var_handler,
                        &if_miss);
143
    m.BIND(&if_handler);
144 145
    m.Branch(m.TaggedEqual(expected_handler, var_handler.value()), &passed,
             &failed);
146

147
    m.BIND(&if_miss);
148
    m.Branch(m.TaggedEqual(expected_handler, m.SmiConstant(0)), &passed,
149 150
             &failed);

151
    m.BIND(&passed);
152 153
    m.Return(m.BooleanConstant(true));

154
    m.BIND(&failed);
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206
    m.Return(m.BooleanConstant(false));
  }

  Handle<Code> code = data.GenerateCode();
  FunctionTester ft(code, kNumParams);

  std::vector<Handle<Name>> names;
  std::vector<Handle<JSObject>> receivers;
  std::vector<Handle<Code>> handlers;

  base::RandomNumberGenerator rand_gen(FLAG_random_seed);

  Factory* factory = isolate->factory();

  // Generate some number of names.
  for (int i = 0; i < StubCache::kPrimaryTableSize / 7; i++) {
    Handle<Name> name;
    switch (rand_gen.NextInt(3)) {
      case 0: {
        // Generate string.
        std::stringstream ss;
        ss << "s" << std::hex
           << (rand_gen.NextInt(Smi::kMaxValue) % StubCache::kPrimaryTableSize);
        name = factory->InternalizeUtf8String(ss.str().c_str());
        break;
      }
      case 1: {
        // Generate number string.
        std::stringstream ss;
        ss << (rand_gen.NextInt(Smi::kMaxValue) % StubCache::kPrimaryTableSize);
        name = factory->InternalizeUtf8String(ss.str().c_str());
        break;
      }
      case 2: {
        // Generate symbol.
        name = factory->NewSymbol();
        break;
      }
      default:
        UNREACHABLE();
    }
    names.push_back(name);
  }

  // Generate some number of receiver maps and receivers.
  for (int i = 0; i < StubCache::kSecondaryTableSize / 2; i++) {
    Handle<Map> map = Map::Create(isolate, 0);
    receivers.push_back(factory->NewJSObjectFromMap(map));
  }

  // Generate some number of handlers.
  for (int i = 0; i < 30; i++) {
207
    handlers.push_back(CreateCodeOfKind(CodeKind::STUB));
208 209 210 211 212 213 214 215 216 217 218 219 220
  }

  // Ensure that GC does happen because from now on we are going to fill our
  // own stub cache instance with raw values.
  DisallowHeapAllocation no_gc;

  // Populate {stub_cache}.
  const int N = StubCache::kPrimaryTableSize + StubCache::kSecondaryTableSize;
  for (int i = 0; i < N; i++) {
    int index = rand_gen.NextInt();
    Handle<Name> name = names[index % names.size()];
    Handle<JSObject> receiver = receivers[index % receivers.size()];
    Handle<Code> handler = handlers[index % handlers.size()];
221
    stub_cache.Set(*name, receiver->map(), MaybeObject::FromObject(*handler));
222 223 224 225 226 227 228 229 230
  }

  // Perform some queries.
  bool queried_existing = false;
  bool queried_non_existing = false;
  for (int i = 0; i < N; i++) {
    int index = rand_gen.NextInt();
    Handle<Name> name = names[index % names.size()];
    Handle<JSObject> receiver = receivers[index % receivers.size()];
231 232
    MaybeObject handler = stub_cache.Get(*name, receiver->map());
    if (handler.ptr() == kNullAddress) {
233 234 235 236 237
      queried_non_existing = true;
    } else {
      queried_existing = true;
    }

238
    Handle<Object> expected_handler(handler->GetHeapObjectOrSmi(), isolate);
239 240 241 242 243 244 245 246
    ft.CheckTrue(receiver, name, expected_handler);
  }

  for (int i = 0; i < N; i++) {
    int index1 = rand_gen.NextInt();
    int index2 = rand_gen.NextInt();
    Handle<Name> name = names[index1 % names.size()];
    Handle<JSObject> receiver = receivers[index2 % receivers.size()];
247 248
    MaybeObject handler = stub_cache.Get(*name, receiver->map());
    if (handler.ptr() == kNullAddress) {
249 250 251 252 253
      queried_non_existing = true;
    } else {
      queried_existing = true;
    }

254
    Handle<Object> expected_handler(handler->GetHeapObjectOrSmi(), isolate);
255 256 257 258 259 260 261 262
    ft.CheckTrue(receiver, name, expected_handler);
  }
  // Ensure we performed both kind of queries.
  CHECK(queried_existing && queried_non_existing);
}

}  // namespace internal
}  // namespace v8