Libraries/LibJS/Bytecode/RegexTable.cpp

/*
 * Copyright (c) 2023, Andreas Kling <andreas@ladybird.org>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 */

#include <LibJS/Bytecode/RegexTable.h>

namespace JS::Bytecode {

RegexTableIndex RegexTable::insert(ParsedRegex parsed_regex)
{
    Regex<ECMA262> regex(parsed_regex.regex, parsed_regex.pattern.to_byte_string(), parsed_regex.flags);
    m_regexes.append(move(regex));
    return m_regexes.size() - 1;
}

Regex<ECMA262> const& RegexTable::get(RegexTableIndex index) const
{
    return m_regexes[index.value()];
}

void RegexTable::dump() const
{
    outln("Regex Table:");
    for (size_t i = 0; i < m_regexes.size(); i++)
        outln("{}: {}", i, m_regexes[i].pattern_value);
}

}
LibJS/Bytecode: Don't reparse regular expressions on instantiation The RegExpLiteral AST node already has the parsed regex::Parser::Result so let's plumb that over to the bytecode executable instead of reparsing the regex every time NewRegExp is executed. ~12% speed-up on language/literals/regexp/S7.8.5_A2.1_T2.js in test262. 2023-07-13 10:49:07 +02:00			`/*`
Meta: Update my e-mail address everywhere 2024-10-04 13:19:50 +02:00			`* Copyright (c) 2023, Andreas Kling <andreas@ladybird.org>`
LibJS/Bytecode: Don't reparse regular expressions on instantiation The RegExpLiteral AST node already has the parsed regex::Parser::Result so let's plumb that over to the bytecode executable instead of reparsing the regex every time NewRegExp is executed. ~12% speed-up on language/literals/regexp/S7.8.5_A2.1_T2.js in test262. 2023-07-13 10:49:07 +02:00			`*`
			`* SPDX-License-Identifier: BSD-2-Clause`
			`*/`

			`#include <LibJS/Bytecode/RegexTable.h>`

			`namespace JS::Bytecode {`

LibJS: Don't rerun regexp optimizer every time a regexp literal is used 2025-12-12 06:17:37 -06:00			`RegexTableIndex RegexTable::insert(ParsedRegex parsed_regex)`
LibJS/Bytecode: Don't reparse regular expressions on instantiation The RegExpLiteral AST node already has the parsed regex::Parser::Result so let's plumb that over to the bytecode executable instead of reparsing the regex every time NewRegExp is executed. ~12% speed-up on language/literals/regexp/S7.8.5_A2.1_T2.js in test262. 2023-07-13 10:49:07 +02:00			`{`
LibJS: Don't rerun regexp optimizer every time a regexp literal is used 2025-12-12 06:17:37 -06:00			`Regex<ECMA262> regex(parsed_regex.regex, parsed_regex.pattern.to_byte_string(), parsed_regex.flags);`
LibJS/Bytecode: Don't reparse regular expressions on instantiation The RegExpLiteral AST node already has the parsed regex::Parser::Result so let's plumb that over to the bytecode executable instead of reparsing the regex every time NewRegExp is executed. ~12% speed-up on language/literals/regexp/S7.8.5_A2.1_T2.js in test262. 2023-07-13 10:49:07 +02:00			`m_regexes.append(move(regex));`
			`return m_regexes.size() - 1;`
			`}`

LibJS: Don't rerun regexp optimizer every time a regexp literal is used 2025-12-12 06:17:37 -06:00			`Regex<ECMA262> const& RegexTable::get(RegexTableIndex index) const`
LibJS/Bytecode: Don't reparse regular expressions on instantiation The RegExpLiteral AST node already has the parsed regex::Parser::Result so let's plumb that over to the bytecode executable instead of reparsing the regex every time NewRegExp is executed. ~12% speed-up on language/literals/regexp/S7.8.5_A2.1_T2.js in test262. 2023-07-13 10:49:07 +02:00			`{`
			`return m_regexes[index.value()];`
			`}`

			`void RegexTable::dump() const`
			`{`
			`outln("Regex Table:");`
			`for (size_t i = 0; i < m_regexes.size(); i++)`
LibJS: Don't rerun regexp optimizer every time a regexp literal is used 2025-12-12 06:17:37 -06:00			`outln("{}: {}", i, m_regexes[i].pattern_value);`
LibJS/Bytecode: Don't reparse regular expressions on instantiation The RegExpLiteral AST node already has the parsed regex::Parser::Result so let's plumb that over to the bytecode executable instead of reparsing the regex every time NewRegExp is executed. ~12% speed-up on language/literals/regexp/S7.8.5_A2.1_T2.js in test262. 2023-07-13 10:49:07 +02:00			`}`

			`}`