mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 21:02:44 +00:00 
			
		
		
		
	 b84f8fb55b
			
		
	
	
		b84f8fb55b
		
	
	
	
	
		
			
			Some of these are allocated upon initialization of the intrinsics, and some lazily, but in neither case the getters actually return a nullptr. This saves us a whole bunch of pointer dereferences (as NonnullGCPtr has an `operator T&()`), and also has the interesting side effect of forcing us to explicitly use the FunctionObject& overload of call(), as passing a NonnullGCPtr is ambigous - it could implicitly be turned into a Value _or_ a FunctionObject& (so we have to dereference manually).
		
			
				
	
	
		
			58 lines
		
	
	
	
		
			1.9 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			58 lines
		
	
	
	
		
			1.9 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2021-2022, Idan Horowitz <idan.horowitz@serenityos.org>
 | |
|  *
 | |
|  * SPDX-License-Identifier: BSD-2-Clause
 | |
|  */
 | |
| 
 | |
| #include <LibJS/Runtime/WeakRef.h>
 | |
| 
 | |
| namespace JS {
 | |
| 
 | |
| NonnullGCPtr<WeakRef> WeakRef::create(Realm& realm, Object& value)
 | |
| {
 | |
|     return realm.heap().allocate<WeakRef>(realm, value, realm.intrinsics().weak_ref_prototype()).release_allocated_value_but_fixme_should_propagate_errors();
 | |
| }
 | |
| 
 | |
| NonnullGCPtr<WeakRef> WeakRef::create(Realm& realm, Symbol& value)
 | |
| {
 | |
|     return realm.heap().allocate<WeakRef>(realm, value, realm.intrinsics().weak_ref_prototype()).release_allocated_value_but_fixme_should_propagate_errors();
 | |
| }
 | |
| 
 | |
| WeakRef::WeakRef(Object& value, Object& prototype)
 | |
|     : Object(ConstructWithPrototypeTag::Tag, prototype)
 | |
|     , WeakContainer(heap())
 | |
|     , m_value(&value)
 | |
|     , m_last_execution_generation(vm().execution_generation())
 | |
| {
 | |
| }
 | |
| 
 | |
| WeakRef::WeakRef(Symbol& value, Object& prototype)
 | |
|     : Object(ConstructWithPrototypeTag::Tag, prototype)
 | |
|     , WeakContainer(heap())
 | |
|     , m_value(&value)
 | |
|     , m_last_execution_generation(vm().execution_generation())
 | |
| {
 | |
| }
 | |
| 
 | |
| void WeakRef::remove_dead_cells(Badge<Heap>)
 | |
| {
 | |
|     if (m_value.visit([](Cell* cell) -> bool { return cell->state() == Cell::State::Live; }, [](Empty) -> bool { VERIFY_NOT_REACHED(); }))
 | |
|         return;
 | |
| 
 | |
|     m_value = Empty {};
 | |
|     // This is an optimization, we deregister from the garbage collector early (even if we were not garbage collected ourself yet)
 | |
|     // to reduce the garbage collection overhead, which we can do because a cleared weak ref cannot be reused.
 | |
|     WeakContainer::deregister();
 | |
| }
 | |
| 
 | |
| void WeakRef::visit_edges(Visitor& visitor)
 | |
| {
 | |
|     Base::visit_edges(visitor);
 | |
| 
 | |
|     if (vm().execution_generation() == m_last_execution_generation) {
 | |
|         auto* cell = m_value.visit([](Cell* cell) -> Cell* { return cell; }, [](Empty) -> Cell* { return nullptr; });
 | |
|         visitor.visit(cell);
 | |
|     }
 | |
| }
 | |
| 
 | |
| }
 |