mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-07-24 18:02:20 +00:00
399 lines
12 KiB
C++
399 lines
12 KiB
C++
/*
|
|
* Copyright (c) 2021-2024, Tim Flynn <trflynn89@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/ByteString.h>
|
|
#include <AK/HashMap.h>
|
|
#include <AK/NumericLimits.h>
|
|
#include <AK/Optional.h>
|
|
#include <AK/QuickSort.h>
|
|
#include <AK/SourceGenerator.h>
|
|
#include <AK/StringView.h>
|
|
#include <AK/Vector.h>
|
|
#include <LibCore/File.h>
|
|
|
|
template<typename StorageType>
|
|
class UniqueStorage {
|
|
public:
|
|
size_t ensure(StorageType value)
|
|
{
|
|
// We maintain a set of unique values in two structures: a vector which stores the values in
|
|
// the order they are added, and a hash map which maps that value to its index in the vector.
|
|
// The vector is to ensure the values are generated in an easily known order, and the map is
|
|
// to allow quickly deciding if a value is actually unique (otherwise, we'd have to linearly
|
|
// search the vector for each value).
|
|
//
|
|
// Also note that index 0 will be reserved for the default-initialized value, so the index
|
|
// returned from this method is actually the real index in the vector + 1.
|
|
if (auto index = m_storage_indices.get(value); index.has_value())
|
|
return *index;
|
|
|
|
m_storage.append(move(value));
|
|
|
|
auto storage_index = m_storage.size();
|
|
m_storage_indices.set(m_storage.last(), storage_index);
|
|
|
|
return storage_index;
|
|
}
|
|
|
|
StorageType const& get(size_t index) const
|
|
{
|
|
if (index == 0) {
|
|
static StorageType empty {};
|
|
return empty;
|
|
}
|
|
|
|
VERIFY(index <= m_storage.size());
|
|
return m_storage.at(index - 1);
|
|
}
|
|
|
|
StringView type_that_fits() const
|
|
{
|
|
if (m_storage.size() <= NumericLimits<u8>::max())
|
|
return "u8"sv;
|
|
if (m_storage.size() <= NumericLimits<u16>::max())
|
|
return "u16"sv;
|
|
if (m_storage.size() <= NumericLimits<u32>::max())
|
|
return "u32"sv;
|
|
return "u64"sv;
|
|
}
|
|
|
|
protected:
|
|
Vector<StorageType> m_storage;
|
|
HashMap<StorageType, size_t> m_storage_indices;
|
|
};
|
|
|
|
class UniqueStringStorage : public UniqueStorage<ByteString> {
|
|
using Base = UniqueStorage<ByteString>;
|
|
|
|
public:
|
|
// The goal of the string table generator is to ensure the table is located within the read-only
|
|
// section of the shared library. If StringViews are generated directly, the table will be located
|
|
// in the initialized data section. So instead, we generate run-length encoded (RLE) arrays to
|
|
// represent the strings.
|
|
void generate(SourceGenerator& generator) const
|
|
{
|
|
constexpr size_t max_values_per_row = 300;
|
|
size_t values_in_current_row = 0;
|
|
|
|
auto append_hex_value = [&](auto value) {
|
|
if (values_in_current_row++ > 0)
|
|
generator.append(", ");
|
|
|
|
generator.append(ByteString::formatted("{:#x}", value));
|
|
|
|
if (values_in_current_row == max_values_per_row) {
|
|
values_in_current_row = 0;
|
|
generator.append(",\n ");
|
|
}
|
|
};
|
|
|
|
Vector<u32> string_indices;
|
|
string_indices.ensure_capacity(Base::m_storage.size());
|
|
u32 next_index { 0 };
|
|
|
|
for (auto const& string : Base::m_storage) {
|
|
// Ensure the string length may be encoded as two u8s.
|
|
VERIFY(string.length() <= NumericLimits<u16>::max());
|
|
|
|
string_indices.unchecked_append(next_index);
|
|
next_index += string.length() + 2;
|
|
}
|
|
|
|
generator.set("size", ByteString::number(next_index));
|
|
generator.append(R"~~~(
|
|
static constexpr Array<u8, @size@> s_encoded_strings { {
|
|
)~~~");
|
|
|
|
for (auto const& string : Base::m_storage) {
|
|
auto length = string.length();
|
|
append_hex_value((length & 0xff00) >> 8);
|
|
append_hex_value(length & 0x00ff);
|
|
|
|
for (auto ch : string)
|
|
append_hex_value(static_cast<u8>(ch));
|
|
}
|
|
|
|
generator.append(R"~~~(
|
|
} };
|
|
)~~~");
|
|
|
|
generator.set("size", ByteString::number(string_indices.size()));
|
|
generator.append(R"~~~(
|
|
static constexpr Array<u32, @size@> s_encoded_string_indices { {
|
|
)~~~");
|
|
|
|
values_in_current_row = 0;
|
|
for (auto index : string_indices)
|
|
append_hex_value(index);
|
|
|
|
generator.append(R"~~~(
|
|
} };
|
|
|
|
static constexpr StringView decode_string(size_t index)
|
|
{
|
|
if (index == 0)
|
|
return {};
|
|
|
|
index = s_encoded_string_indices[index - 1];
|
|
|
|
auto length_high = s_encoded_strings[index];
|
|
auto length_low = s_encoded_strings[index + 1];
|
|
|
|
size_t length = (length_high << 8) | length_low;
|
|
if (length == 0)
|
|
return {};
|
|
|
|
auto const* start = &s_encoded_strings[index + 2];
|
|
return { reinterpret_cast<char const*>(start), length };
|
|
}
|
|
)~~~");
|
|
}
|
|
};
|
|
|
|
struct Alias {
|
|
ByteString name;
|
|
ByteString alias;
|
|
};
|
|
|
|
inline ErrorOr<NonnullOwnPtr<Core::InputBufferedFile>> open_file(StringView path, Core::File::OpenMode mode)
|
|
{
|
|
if (path.is_empty())
|
|
return Error::from_string_literal("Provided path is empty, please provide all command line options");
|
|
|
|
auto file = TRY(Core::File::open(path, mode));
|
|
return Core::InputBufferedFile::create(move(file));
|
|
}
|
|
|
|
inline void ensure_from_string_types_are_generated(SourceGenerator& generator)
|
|
{
|
|
static bool generated_from_string_types = false;
|
|
if (generated_from_string_types)
|
|
return;
|
|
|
|
generator.append(R"~~~(
|
|
template <typename ValueType>
|
|
struct HashValuePair {
|
|
unsigned hash { 0 };
|
|
ValueType value {};
|
|
};
|
|
|
|
template <typename ValueType>
|
|
struct HashValueComparator
|
|
{
|
|
constexpr int operator()(unsigned hash, HashValuePair<ValueType> const& pair)
|
|
{
|
|
if (hash > pair.hash)
|
|
return 1;
|
|
if (hash < pair.hash)
|
|
return -1;
|
|
return 0;
|
|
}
|
|
};
|
|
)~~~");
|
|
|
|
generated_from_string_types = true;
|
|
}
|
|
|
|
template<typename ValueType>
|
|
using HashValueMap = HashMap<unsigned, ValueType>;
|
|
|
|
struct ValueFromStringOptions {
|
|
Optional<StringView> return_type {};
|
|
StringView return_format { "{}"sv };
|
|
CaseSensitivity sensitivity { CaseSensitivity::CaseSensitive };
|
|
};
|
|
|
|
template<typename ValueType>
|
|
void generate_value_from_string(SourceGenerator& generator, StringView method_name_format, StringView value_type, StringView value_name, HashValueMap<ValueType> hashes, ValueFromStringOptions options = {})
|
|
{
|
|
ensure_from_string_types_are_generated(generator);
|
|
|
|
generator.set("method_name", ByteString::formatted(method_name_format, value_name));
|
|
generator.set("value_type", value_type);
|
|
generator.set("value_name", value_name);
|
|
generator.set("return_type", options.return_type.has_value() ? *options.return_type : value_type);
|
|
generator.set("size", ByteString::number(hashes.size()));
|
|
|
|
generator.append(R"~~~(
|
|
Optional<@return_type@> @method_name@(StringView key)
|
|
{
|
|
constexpr Array<HashValuePair<@value_type@>, @size@> hash_pairs { {
|
|
)~~~");
|
|
|
|
auto hash_keys = hashes.keys();
|
|
quick_sort(hash_keys);
|
|
|
|
constexpr size_t max_values_per_row = 10;
|
|
size_t values_in_current_row = 0;
|
|
|
|
for (auto hash_key : hash_keys) {
|
|
if (values_in_current_row++ > 0)
|
|
generator.append(" ");
|
|
|
|
if constexpr (IsIntegral<ValueType>)
|
|
generator.set("value"sv, ByteString::number(hashes.get(hash_key).value()));
|
|
else
|
|
generator.set("value"sv, ByteString::formatted("{}::{}", value_type, hashes.get(hash_key).value()));
|
|
|
|
generator.set("hash"sv, ByteString::number(hash_key));
|
|
generator.append("{ @hash@U, @value@ },"sv);
|
|
|
|
if (values_in_current_row == max_values_per_row) {
|
|
generator.append("\n ");
|
|
values_in_current_row = 0;
|
|
}
|
|
}
|
|
|
|
generator.set("return_statement", ByteString::formatted(options.return_format, "value->value"sv));
|
|
generator.append(R"~~~(
|
|
} };
|
|
)~~~");
|
|
|
|
if (options.sensitivity == CaseSensitivity::CaseSensitive) {
|
|
generator.append(R"~~~(
|
|
auto hash = key.hash();
|
|
)~~~");
|
|
} else {
|
|
generator.append(R"~~~(
|
|
auto hash = CaseInsensitiveASCIIStringViewTraits::hash(key);
|
|
)~~~");
|
|
}
|
|
|
|
generator.append(R"~~~(
|
|
if (auto const* value = binary_search(hash_pairs, hash, nullptr, HashValueComparator<@value_type@> {}))
|
|
return @return_statement@;
|
|
return {};
|
|
}
|
|
)~~~");
|
|
}
|
|
|
|
template<typename IdentifierFormatter>
|
|
void generate_value_to_string(SourceGenerator& generator, StringView method_name_format, StringView value_type, StringView value_name, IdentifierFormatter&& format_identifier, ReadonlySpan<ByteString> values)
|
|
{
|
|
generator.set("method_name", ByteString::formatted(method_name_format, value_name));
|
|
generator.set("value_type", value_type);
|
|
generator.set("value_name", value_name);
|
|
|
|
generator.append(R"~~~(
|
|
StringView @method_name@(@value_type@ @value_name@)
|
|
{
|
|
using enum @value_type@;
|
|
|
|
switch (@value_name@) {)~~~");
|
|
|
|
for (auto const& value : values) {
|
|
generator.set("enum_value", format_identifier(value_type, value));
|
|
generator.set("string_value", value);
|
|
generator.append(R"~~~(
|
|
case @enum_value@:
|
|
return "@string_value@"sv;)~~~");
|
|
}
|
|
|
|
generator.append(R"~~~(
|
|
}
|
|
|
|
VERIFY_NOT_REACHED();
|
|
}
|
|
)~~~");
|
|
}
|
|
|
|
template<typename IdentifierFormatter>
|
|
void generate_enum(SourceGenerator& generator, IdentifierFormatter&& format_identifier, StringView name, StringView default_, Vector<ByteString>& values, Vector<Alias> aliases = {})
|
|
{
|
|
quick_sort(values, [](auto const& value1, auto const& value2) { return value1.to_lowercase() < value2.to_lowercase(); });
|
|
quick_sort(aliases, [](auto const& alias1, auto const& alias2) { return alias1.alias.to_lowercase() < alias2.alias.to_lowercase(); });
|
|
|
|
generator.set("name", name);
|
|
generator.set("underlying", ((values.size() + !default_.is_empty()) < 256) ? "u8"sv : "u16"sv);
|
|
|
|
generator.append(R"~~~(
|
|
enum class @name@ : @underlying@ {)~~~");
|
|
|
|
if (!default_.is_empty()) {
|
|
generator.set("default", default_);
|
|
generator.append(R"~~~(
|
|
@default@,)~~~");
|
|
}
|
|
|
|
for (auto const& value : values) {
|
|
generator.set("value", format_identifier(name, value));
|
|
generator.append(R"~~~(
|
|
@value@,)~~~");
|
|
}
|
|
|
|
for (auto const& alias : aliases) {
|
|
generator.set("alias", format_identifier(name, alias.alias));
|
|
generator.set("value", format_identifier(name, alias.name));
|
|
generator.append(R"~~~(
|
|
@alias@ = @value@,)~~~");
|
|
}
|
|
|
|
generator.append(R"~~~(
|
|
};
|
|
)~~~");
|
|
}
|
|
|
|
template<typename LocalesType, typename IdentifierFormatter, typename ListFormatter>
|
|
void generate_mapping(SourceGenerator& generator, LocalesType const& locales, StringView type, StringView name, StringView format, IdentifierFormatter&& format_identifier, ListFormatter&& format_list)
|
|
{
|
|
auto format_mapping_name = [&](StringView format, StringView name) {
|
|
ByteString mapping_name;
|
|
|
|
if constexpr (IsNullPointer<IdentifierFormatter>)
|
|
mapping_name = name.replace("-"sv, "_"sv, ReplaceMode::All);
|
|
else
|
|
mapping_name = format_identifier(type, name);
|
|
|
|
return ByteString::formatted(format, mapping_name.to_lowercase());
|
|
};
|
|
|
|
Vector<ByteString> mapping_names;
|
|
|
|
for (auto const& locale : locales) {
|
|
ByteString mapping_name;
|
|
|
|
if constexpr (requires { locale.key; }) {
|
|
mapping_name = format_mapping_name(format, locale.key);
|
|
format_list(mapping_name, locale.value);
|
|
} else {
|
|
mapping_name = format_mapping_name(format, locale);
|
|
format_list(mapping_name, locale);
|
|
}
|
|
|
|
mapping_names.append(move(mapping_name));
|
|
}
|
|
|
|
quick_sort(mapping_names);
|
|
|
|
generator.set("type", type);
|
|
generator.set("name", name);
|
|
generator.set("size", ByteString::number(locales.size()));
|
|
generator.append(R"~~~(
|
|
static constexpr Array<ReadonlySpan<@type@>, @size@> @name@ { {
|
|
)~~~");
|
|
|
|
constexpr size_t max_values_per_row = 10;
|
|
size_t values_in_current_row = 0;
|
|
|
|
for (auto& mapping_name : mapping_names) {
|
|
if (values_in_current_row++ > 0)
|
|
generator.append(" ");
|
|
|
|
generator.set("name", move(mapping_name));
|
|
generator.append("@name@.span(),");
|
|
|
|
if (values_in_current_row == max_values_per_row) {
|
|
values_in_current_row = 0;
|
|
generator.append("\n ");
|
|
}
|
|
}
|
|
|
|
generator.append(R"~~~(
|
|
} };
|
|
)~~~");
|
|
}
|