ladybird/Libraries/LibRegex/RegexBytecodeStreamOptimizer.h

/*
 * Copyright (c) 2021, Ali Mohammad Pur <mpfard@serenityos.org>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 */

#pragma once

#include "Forward.h"
#include <AK/Vector.h>

namespace regex {

class Optimizer {
public:
    static void append_alternation(ByteCode& target, ByteCode&& left, ByteCode&& right);
    static void append_alternation(ByteCode& target, Span<ByteCode> alternatives);
    static void append_character_class(ByteCode& target, Vector<CompareTypeAndValuePair>&& pairs);
};

}
LibRegex: Add a basic optimization pass This currently tries to convert forking loops to atomic groups, and unify the left side of alternations. 2021-09-12 10:00:27 -03:00			`/*`
			`* Copyright (c) 2021, Ali Mohammad Pur <mpfard@serenityos.org>`
			`*`
			`* SPDX-License-Identifier: BSD-2-Clause`
			`*/`

			`#pragma once`

			`#include "Forward.h"`
LibRegex: Use a match table for character classes Generate a sorted, compressed series of ranges in a match table for character classes, and use a binary search to find the matches. This is about a 3-4x speedup for character class match performance. :^) 2021-10-03 12:31:25 -03:00			`#include <AK/Vector.h>`
LibRegex: Add a basic optimization pass This currently tries to convert forking loops to atomic groups, and unify the left side of alternations. 2021-09-12 10:00:27 -03:00
			`namespace regex {`

			`class Optimizer {`
			`public:`
LibRegex: Avoid excessive Vector copy when compiling regexps Previously we would've copied the bytecode instead of moving the chunks around, use the fancy new DisjointChunks<T> abstraction to make that happen automagically. This decreases vector copies and uses of memmove() by nearly 10x :^) 2021-09-13 16:15:22 -03:00			`static void append_alternation(ByteCode& target, ByteCode&& left, ByteCode&& right);`
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 :^) 2022-02-19 20:55:21 -03:00			`static void append_alternation(ByteCode& target, Span<ByteCode> alternatives);`
LibRegex: Use a match table for character classes Generate a sorted, compressed series of ranges in a match table for character classes, and use a binary search to find the matches. This is about a 3-4x speedup for character class match performance. :^) 2021-10-03 12:31:25 -03:00			`static void append_character_class(ByteCode& target, Vector<CompareTypeAndValuePair>&& pairs);`
LibRegex: Add a basic optimization pass This currently tries to convert forking loops to atomic groups, and unify the left side of alternations. 2021-09-12 10:00:27 -03:00			`};`

			`}`