c0952e3670
We are currently allocating in Set's constructor to create the set's underlying Map. This can cause GC to occur before the member is actually initialized, thus we will crash in Set::visit_edges trying to visit a member that does not exist. Instead, create the Map in Set::initialize, where we can allocate. Also change Map to be stored as a normal JS heap-allocated object, rather than as a stack variable.
47 lines
1.3 KiB
C++
47 lines
1.3 KiB
C++
/*
|
|
* Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <LibJS/Runtime/GlobalObject.h>
|
|
#include <LibJS/Runtime/Map.h>
|
|
#include <LibJS/Runtime/Object.h>
|
|
#include <LibJS/Runtime/Value.h>
|
|
|
|
namespace JS {
|
|
|
|
class Set : public Object {
|
|
JS_OBJECT(Set, Object);
|
|
|
|
public:
|
|
static Set* create(Realm&);
|
|
|
|
virtual void initialize(Realm&) override;
|
|
virtual ~Set() override = default;
|
|
|
|
// NOTE: Unlike what the spec says, we implement Sets using an underlying map,
|
|
// so all the functions below do not directly implement the operations as
|
|
// defined by the specification.
|
|
|
|
void set_clear() { m_values->map_clear(); }
|
|
bool set_remove(Value const& value) { return m_values->map_remove(value); }
|
|
bool set_has(Value const& key) const { return m_values->map_has(key); }
|
|
void set_add(Value const& key) { m_values->map_set(key, js_undefined()); }
|
|
size_t set_size() const { return m_values->map_size(); }
|
|
|
|
auto begin() const { return const_cast<Map const&>(*m_values).begin(); }
|
|
auto begin() { return m_values->begin(); }
|
|
auto end() const { return m_values->end(); }
|
|
|
|
private:
|
|
explicit Set(Object& prototype);
|
|
|
|
virtual void visit_edges(Visitor& visitor) override;
|
|
|
|
GCPtr<Map> m_values;
|
|
};
|
|
|
|
}
|