LibRegex: Make codegen+optimisation for alternatives much faster

Just a little thinking outside the box, and we can now parse and optimise a million copies of "a|" chained together in just a second :^)
Author: https://github.com/alimpfard Commit: 97a333608e Pull-request: https://github.com/SerenityOS/serenity/pull/12653 Issue: https://github.com/SerenityOS/serenity/issues/12373 Issue: https://github.com/SerenityOS/serenity/issues/12615 Reviewed-by: https://github.com/trflynn89
2025-08-01 05:39:11 +00:00 · 2022-02-20 03:25:21 +03:30 · 2022-02-20 03:25:21 +03:30 · 97a333608e · 2024-07-17 18:29:29 +09:00
commit 97a333608e
parent 4be7239626
5 changed files with 150 additions and 65 deletions
--- a/Userland/Libraries/LibRegex/RegexDebug.h
+++ b/Userland/Libraries/LibRegex/RegexDebug.h
@ -35,9 +35,12 @@ public:
    template<typename T>
    void print_bytecode(Regex<T> const& regex) const
    {
-        MatchState state;
-        auto& bytecode = regex.parser_result.bytecode;
+        print_bytecode(regex.parser_result.bytecode);
+    }

+    void print_bytecode(ByteCode const& bytecode) const
+    {
+        MatchState state;
        for (;;) {
            auto& opcode = bytecode.get_opcode(state);
            print_opcode("PrintBytecode", opcode, state);