bool
WatchpointMap::triggerWatchpoint(JSContext* cx, HandleObject obj, HandleId id, MutableHandleValue vp)
{
Map::Ptr p = map.lookup(WatchKey(obj, id));
if (!p || p->value().held)
return true;
AutoEntryHolder holder(cx, map, p);
/* Copy the entry, since GC would invalidate p. */
JSWatchPointHandler handler = p->value().handler;
RootedObject closure(cx, p->value().closure);
/* Determine the property's old value. */
Value old;
old.setUndefined();
if (obj->isNative()) {
NativeObject* nobj = &obj->as<NativeObject>();
if (Shape* shape = nobj->lookup(cx, id)) {
if (shape->hasSlot())
old = nobj->getSlot(shape->slot());
}
}
// Read barrier to prevent an incorrectly gray closure from escaping the
// watchpoint. See the comment before UnmarkGrayChildren in gc/Marking.cpp
JS::ExposeObjectToActiveJS(closure);
/* Call the handler. */
return handler(cx, obj, id, old, vp.address(), closure);
}
void
InnerViewTable::sweepAfterMinorGC(JSRuntime* rt)
{
MOZ_ASSERT(needsSweepAfterMinorGC());
if (nurseryKeysValid) {
for (size_t i = 0; i < nurseryKeys.length(); i++) {
JSObject* key = nurseryKeys[i];
Map::Ptr p = map.lookup(key);
if (!p)
continue;
if (sweepEntry(&key, p->value()))
map.remove(nurseryKeys[i]);
else
map.rekeyIfMoved(nurseryKeys[i], key);
}
nurseryKeys.clear();
} else {
// Do the required sweeping by looking at every map entry.
nurseryKeys.clear();
sweep(rt);
nurseryKeysValid = true;
}
}
TEST(GTestMap, TestClear) {
Map::Ptr m = Map::create();
String::CPtr x = String::create("x");
String::CPtr y = String::create("y");
m->put(x, 123);
m->put(y, 456);
m->put(String::null(), UNDEFINED);
m->clear();
ASSERT_TRUE(m->isEmpty());
}
InnerViewTable::ViewVector*
InnerViewTable::maybeViewsUnbarriered(ArrayBufferObject* buffer)
{
if (!map.initialized())
return nullptr;
Map::Ptr p = map.lookup(buffer);
if (p)
return &p->value();
return nullptr;
}
TEST(GTestMap, TestEntrySet) {
Map::Ptr m = Map::create();
String::CPtr x = String::create("x");
String::CPtr y = String::create("y");
m->put(x, 123);
m->put(y, 456);
TypedSet<Map::Entry::CPtr>::CPtr es = m->entrySet();
// iterator
Iterator::Ptr i = es->iterator();
ASSERT_TRUE(i->hasNext());
Map::Entry::CPtr e1 = toCPtr<Map::Entry>(i->next());
Value key1 = e1->getKey();
Value val1 = e1->getValue();
ASSERT_TRUE(key1.equals(x) || key1.equals(y));
ASSERT_TRUE(val1.equals(123) || val1.equals(456));
ASSERT_TRUE(i->hasNext());
Map::Entry::CPtr e2 = toCPtr<Map::Entry>(i->next());
Value key2 = e2->getKey();
Value val2 = e2->getValue();
ASSERT_FALSE(key2.equals(key1));
ASSERT_FALSE(val2.equals(val1));
ASSERT_TRUE(key2.equals(x) || key2.equals(y));
ASSERT_TRUE(val2.equals(123) || val2.equals(456));
// reuse Map::Entry for better performance
ASSERT_EQ(e1, e2);
ASSERT_FALSE(i->hasNext());
// iteratorTyped
TypedIterator<Map::Entry::CPtr>::Ptr ti = es->iteratorTyped();
ASSERT_TRUE(ti->hasNext());
e1 = ti->next();
key1 = e1->getKey();
val1 = e1->getValue();
ASSERT_TRUE(key1.equals(x) || key1.equals(y));
ASSERT_TRUE(val1.equals(123) || val1.equals(456));
ASSERT_TRUE(ti->hasNext());
e2 = ti->next();
key2 = e2->getKey();
val2 = e2->getValue();
ASSERT_FALSE(key2.equals(key1));
ASSERT_FALSE(val2.equals(val1));
ASSERT_TRUE(key2.equals(x) || key2.equals(y));
ASSERT_TRUE(val2.equals(123) || val2.equals(456));
// reuse Map::Entry for better performance
ASSERT_EQ(e1, e2);
ASSERT_FALSE(ti->hasNext());
}
TEST(GTestMap, TestKeySet) {
Map::Ptr m = Map::create();
String::CPtr x = String::create("x");
String::CPtr y = String::create("y");
m->put(x, 123);
m->put(y, 456);
Set::CPtr ks = m->keySet();
Iterator::Ptr itr = ks->iterator();
ASSERT_TRUE(itr->hasNext());
String::CPtr v1 = toCPtr<String>(itr->next());
ASSERT_TRUE(v1->equals(x) || v1->equals(y));
ASSERT_TRUE(itr->hasNext());
String::CPtr v2 = toCPtr<String>(itr->next());
ASSERT_TRUE(!v1->equals(v2) && (v2->equals(x) || v2->equals(y)));
ASSERT_FALSE(itr->hasNext());
}
TEST(GTestMap, TestContainsKey) {
Map::Ptr m = Map::create();
String::CPtr x = String::create("x");
String::CPtr y = String::create("y");
m->put(x, 123);
ASSERT_TRUE(m->containsKey(x));
ASSERT_FALSE(m->containsKey(y));
ASSERT_FALSE(m->containsKey(String::null()));
m->put(String::null(), 456);
ASSERT_TRUE(m->containsKey(String::null()));
m->put(UNDEFINED, 789);
ASSERT_TRUE(m->containsKey(UNDEFINED));
}
TEST(GTestMap, TestPutAndGet2) {
Map::Ptr m = Map::create();
ASSERT_TRUE(m->put(String::null(), 123).isUndefined());
ASSERT_TRUE(m->get(String::null()).equals(123));
ASSERT_TRUE(m->get(Map::null()).equals(123));
ASSERT_TRUE(m->put(Map::null(), String::null()).equals(123));
ASSERT_TRUE(m->get(String::null()).equals(Map::null()));
ASSERT_TRUE(m->put(UNDEFINED, UNDEFINED).isUndefined());
ASSERT_TRUE(m->get(UNDEFINED).isUndefined());
}
TEST(GTestMap, TestContainsValue) {
Map::Ptr m = Map::create();
String::CPtr x = String::create("x");
String::CPtr y = String::create("y");
String::CPtr z = String::create("z");
m->put(x, 123);
ASSERT_TRUE(m->containsValue(123));
ASSERT_FALSE(m->containsValue(456));
ASSERT_FALSE(m->containsValue(String::null()));
m->put(y, String::null());
ASSERT_TRUE(m->containsValue(String::null()));
m->put(z, UNDEFINED);
ASSERT_TRUE(m->containsValue(UNDEFINED));
}
TEST(GTestMap, TestPutAndGet) {
Map::Ptr m = Map::create();
String::CPtr x = String::create("x");
ASSERT_TRUE(m->put(x, 123).isUndefined());
ASSERT_TRUE(m->get(x).equals(123));
ASSERT_TRUE(m->get(String::create("x")).equals(123));
ASSERT_TRUE(m->put(x, 456).equals(123));
ASSERT_TRUE(m->get(x).equals(456));
ASSERT_TRUE(m->get(String::intern("x")).equals(456));
}
void
InnerViewTable::sweepAfterMinorGC()
{
MOZ_ASSERT(needsSweepAfterMinorGC());
if (nurseryKeysValid) {
for (size_t i = 0; i < nurseryKeys.length(); i++) {
JSObject* buffer = MaybeForwarded(nurseryKeys[i]);
Map::Ptr p = map.lookup(buffer);
if (!p)
continue;
if (sweepEntry(&p->mutableKey(), p->value()))
map.remove(buffer);
}
nurseryKeys.clear();
} else {
// Do the required sweeping by looking at every map entry.
nurseryKeys.clear();
sweep();
nurseryKeysValid = true;
}
}
void deallocateSigId(const Sig& sig, const void* sigId) {
Map::Ptr p = map_.lookup(sig);
MOZ_RELEASE_ASSERT(p && p->key() == sigId && p->value() > 0);
p->value()--;
if (!p->value()) {
js_delete(p->key());
map_.remove(p);
}
}
TEST(GTestMap, TestToString) {
Map::Ptr m = Map::create();
ASSERT_TRUE(m->toString()->equals(String::create("{}")));
String::CPtr x = String::create("x");
String::CPtr y = String::create("y");
String::CPtr z = String::create("z");
m->put(x, 123);
m->put(y, String::null());
m->put(String::null(), z);
m->put(UNDEFINED, UNDEFINED);
ASSERT_TRUE(m->toString()->equals(
String::create("{undefined=undefined, null=z, x=123, y=null}")));
}
TEST(GTestMap, TestSize) {
Map::Ptr m = Map::create();
m->put(String::create("x"), 123);
ASSERT_EQ(1, m->size());
m->put(String::create("y"), 456);
ASSERT_EQ(2, m->size());
m->put(123, String::create("x"));
ASSERT_EQ(3, m->size());
m->put(456, String::create("y"));
ASSERT_EQ(4, m->size());
m->put(Object::null(), String::null());
ASSERT_EQ(5, m->size());
m->put(UNDEFINED, UNDEFINED);
ASSERT_EQ(6, m->size());
}
TEST(GTestMap, TestRemove) {
Map::Ptr m = Map::create();
String::CPtr x = String::create("x");
String::CPtr y = String::create("y");
String::CPtr z = String::create("z");
m->put(x, 123);
m->put(y, String::null());
m->put(String::null(), z);
m->put(UNDEFINED, UNDEFINED);
ASSERT_EQ(4, m->size());
ASSERT_TRUE(m->remove(x).equals(123));
ASSERT_EQ(3, m->size());
ASSERT_TRUE(m->remove(y).equals(String::null()));
ASSERT_EQ(2, m->size());
ASSERT_TRUE(m->remove(String::null()).equals(z));
ASSERT_EQ(1, m->size());
ASSERT_TRUE(m->remove(UNDEFINED).isUndefined());
ASSERT_TRUE(m->isEmpty());
}
TEST(GTestMap, TestInstanceOf) {
Map::Ptr m = Map::create();
ASSERT_TRUE(m->instanceof(Type<Map>::id()));
ASSERT_TRUE(m->instanceof(Type<Mutable>::id()));
ASSERT_TRUE(m->instanceof(Type<Object>::id()));
}