nova_vm 1.0.0

Nova Virtual Machine
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

// 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 https://mozilla.org/MPL/2.0/.

use ahash::AHashSet;

use crate::{
    ecmascript::{execution::WeakKey, types::OrdinaryObject},
    engine::{Bindable, bindable_handle},
    heap::{CompactionLists, HeapMarkAndSweep, WorkQueues, sweep_side_set},
};

#[derive(Debug, Default)]
pub(crate) struct WeakSetHeapData<'a> {
    pub(crate) object_index: Option<OrdinaryObject<'a>>,
    /// ### \[\[WeakSetData]]
    weak_set_data: AHashSet<WeakKey<'a>>,
}

impl WeakSetHeapData<'_> {
    /// Add a weakly holdable to the WeakSet.
    pub(crate) fn add(&mut self, value: WeakKey) {
        self.weak_set_data.insert(value.unbind());
    }

    /// Remove a weakly holdable from the WeakSet.
    pub(crate) fn delete(&mut self, value: WeakKey) -> bool {
        self.weak_set_data.remove(&value.unbind())
    }

    /// Returns true if the WeakSet contains the given weakly holdable key.
    pub(crate) fn has(&self, value: WeakKey) -> bool {
        self.weak_set_data.contains(&value.unbind())
    }
}

bindable_handle!(WeakSetHeapData);

impl HeapMarkAndSweep for WeakSetHeapData<'static> {
    fn mark_values(&self, queues: &mut WorkQueues) {
        let Self {
            object_index,
            // Note: WeakSet data is never marked on its own; that's its whole
            // point.
            weak_set_data: _,
        } = self;
        object_index.mark_values(queues);
    }

    fn sweep_values(&mut self, compactions: &CompactionLists) {
        let Self {
            object_index,
            weak_set_data,
        } = self;
        object_index.sweep_values(compactions);
        sweep_side_set(weak_set_data, compactions);
    }
}