Daniel Andersson
ea46192ca3
Make the compact linked hash map, which is the default implementation for Map (including map literals), a VM-internal class. This makes it easy to have more efficient serialization of maps (although for now, the implementation is straight-forward). Refactor the compact hash class hierarchy to enable the VM-internal class and the rest (also the Set classes) to share a maximal amount of code, by using two different bases for implicit/explicit fields. Remove existing proof-of-concept, C++-based internal VM-class. BUG=http://dartbug.com/22982 R=asiva@google.com Review URL: https://codereview.chromium.org//1151523002
111 lines
3.0 KiB
C++
111 lines
3.0 KiB
C++
// Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file
|
|
// for details. All rights reserved. Use of this source code is governed by a
|
|
// BSD-style license that can be found in the LICENSE file.
|
|
|
|
#include "platform/assert.h"
|
|
|
|
#include "vm/assembler.h"
|
|
#include "vm/bootstrap_natives.h"
|
|
#include "vm/exceptions.h"
|
|
#include "vm/flags.h"
|
|
#include "vm/native_entry.h"
|
|
#include "vm/object.h"
|
|
|
|
namespace dart {
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_allocate, 1) {
|
|
const TypeArguments& type_arguments =
|
|
TypeArguments::CheckedHandle(arguments->NativeArgAt(0));
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::Handle(LinkedHashMap::NewDefault());
|
|
map.SetTypeArguments(type_arguments);
|
|
return map.raw();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_getIndex, 1) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
return map.index();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_setIndex, 2) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
const TypedData& index =
|
|
TypedData::CheckedHandle(arguments->NativeArgAt(1));
|
|
map.SetIndex(index);
|
|
return Object::null();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_getData, 1) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
return map.data();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_setData, 2) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
const Array& data =
|
|
Array::CheckedHandle(arguments->NativeArgAt(1));
|
|
map.SetData(data);
|
|
return Object::null();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_getHashMask, 1) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
return map.hash_mask();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_setHashMask, 2) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
const Smi& hashMask =
|
|
Smi::CheckedHandle(arguments->NativeArgAt(1));
|
|
map.SetHashMask(hashMask.Value());
|
|
return Object::null();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_getDeletedKeys, 1) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
return map.deleted_keys();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_setDeletedKeys, 2) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
const Smi& deletedKeys =
|
|
Smi::CheckedHandle(arguments->NativeArgAt(1));
|
|
map.SetDeletedKeys(deletedKeys.Value());
|
|
return Object::null();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_getUsedData, 1) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
return map.used_data();
|
|
}
|
|
|
|
|
|
DEFINE_NATIVE_ENTRY(LinkedHashMap_setUsedData, 2) {
|
|
const LinkedHashMap& map =
|
|
LinkedHashMap::CheckedHandle(arguments->NativeArgAt(0));
|
|
const Smi& usedData =
|
|
Smi::CheckedHandle(arguments->NativeArgAt(1));
|
|
map.SetUsedData(usedData.Value());
|
|
return Object::null();
|
|
}
|
|
|
|
} // namespace dart
|