/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- * vim: set ts=8 sts=4 et sw=4 tw=99: * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ #include "gc/Barrier.h" #include "jscompartment.h" #include "jsobj.h" #include "builtin/TypedObject.h" #include "gc/Policy.h" #include "gc/Zone.h" #include "js/HashTable.h" #include "js/Value.h" #include "vm/EnvironmentObject.h" #include "vm/SharedArrayObject.h" #include "vm/Symbol.h" #include "wasm/WasmJS.h" namespace js { bool RuntimeFromMainThreadIsHeapMajorCollecting(JS::shadow::Zone* shadowZone) { return shadowZone->runtimeFromMainThread()->isHeapMajorCollecting(); } #ifdef DEBUG bool IsMarkedBlack(NativeObject* obj) { // Note: we assume conservatively that Nursery things will be live. if (!obj->isTenured()) return true; gc::TenuredCell& tenured = obj->asTenured(); return (tenured.isMarked(gc::BLACK) && !tenured.isMarked(gc::GRAY)) || tenured.arena()->allocatedDuringIncremental; } bool HeapSlot::preconditionForSet(NativeObject* owner, Kind kind, uint32_t slot) const { return kind == Slot ? &owner->getSlotRef(slot) == this : &owner->getDenseElement(slot) == (const Value*)this; } bool HeapSlot::preconditionForWriteBarrierPost(NativeObject* obj, Kind kind, uint32_t slot, const Value& target) const { bool isCorrectSlot = kind == Slot ? obj->getSlotAddressUnchecked(slot)->get() == target : static_cast(obj->getDenseElements() + slot)->get() == target; bool isBlackToGray = target.isGCThing() && IsMarkedBlack(obj) && JS::GCThingIsMarkedGray(JS::GCCellPtr(target)); return isCorrectSlot && !isBlackToGray; } bool CurrentThreadIsIonCompiling() { return TlsPerThreadData.get()->ionCompiling; } bool CurrentThreadIsIonCompilingSafeForMinorGC() { return TlsPerThreadData.get()->ionCompilingSafeForMinorGC; } bool CurrentThreadIsGCSweeping() { return TlsPerThreadData.get()->gcSweeping; } #endif // DEBUG template template void ReadBarrierFunctor::operator()(T* t) { InternalBarrierMethods::readBarrier(t); } // All GC things may be held in a Value, either publicly or as a private GC // thing. #define JS_EXPAND_DEF(name, type, _) \ template void ReadBarrierFunctor::operator()(type*); JS_FOR_EACH_TRACEKIND(JS_EXPAND_DEF); #undef JS_EXPAND_DEF template template void PreBarrierFunctor::operator()(T* t) { InternalBarrierMethods::preBarrier(t); } // All GC things may be held in a Value, either publicly or as a private GC // thing. #define JS_EXPAND_DEF(name, type, _) \ template void PreBarrierFunctor::operator()(type*); JS_FOR_EACH_TRACEKIND(JS_EXPAND_DEF); #undef JS_EXPAND_DEF template void PreBarrierFunctor::operator()(JS::Symbol*); template void PreBarrierFunctor::operator()(JSString*); template /* static */ bool MovableCellHasher::hasHash(const Lookup& l) { if (!l) return true; return l->zoneFromAnyThread()->hasUniqueId(l); } template /* static */ bool MovableCellHasher::ensureHash(const Lookup& l) { if (!l) return true; uint64_t unusedId; return l->zoneFromAnyThread()->getUniqueId(l, &unusedId); } template /* static */ HashNumber MovableCellHasher::hash(const Lookup& l) { if (!l) return 0; // We have to access the zone from-any-thread here: a worker thread may be // cloning a self-hosted object from the main-thread-runtime-owned self- // hosting zone into the off-main-thread runtime. The zone's uid lock will // protect against multiple workers doing this simultaneously. MOZ_ASSERT(CurrentThreadCanAccessZone(l->zoneFromAnyThread()) || l->zoneFromAnyThread()->isSelfHostingZone()); return l->zoneFromAnyThread()->getHashCodeInfallible(l); } template /* static */ bool MovableCellHasher::match(const Key& k, const Lookup& l) { // Return true if both are null or false if only one is null. if (!k) return !l; if (!l) return false; MOZ_ASSERT(k); MOZ_ASSERT(l); MOZ_ASSERT(CurrentThreadCanAccessZone(l->zoneFromAnyThread()) || l->zoneFromAnyThread()->isSelfHostingZone()); Zone* zone = k->zoneFromAnyThread(); if (zone != l->zoneFromAnyThread()) return false; MOZ_ASSERT(zone->hasUniqueId(k)); MOZ_ASSERT(zone->hasUniqueId(l)); // Since both already have a uid (from hash), the get is infallible. return zone->getUniqueIdInfallible(k) == zone->getUniqueIdInfallible(l); } #ifdef JS_BROKEN_GCC_ATTRIBUTE_WARNING #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wattributes" #endif // JS_BROKEN_GCC_ATTRIBUTE_WARNING template struct JS_PUBLIC_API(MovableCellHasher); template struct JS_PUBLIC_API(MovableCellHasher); template struct JS_PUBLIC_API(MovableCellHasher); template struct JS_PUBLIC_API(MovableCellHasher); template struct JS_PUBLIC_API(MovableCellHasher); template struct JS_PUBLIC_API(MovableCellHasher); #ifdef JS_BROKEN_GCC_ATTRIBUTE_WARNING #pragma GCC diagnostic pop #endif // JS_BROKEN_GCC_ATTRIBUTE_WARNING } // namespace js JS_PUBLIC_API(void) JS::HeapObjectPostBarrier(JSObject** objp, JSObject* prev, JSObject* next) { MOZ_ASSERT(objp); js::InternalBarrierMethods::postBarrier(objp, prev, next); } JS_PUBLIC_API(void) JS::HeapValuePostBarrier(JS::Value* valuep, const Value& prev, const Value& next) { MOZ_ASSERT(valuep); js::InternalBarrierMethods::postBarrier(valuep, prev, next); }