C# Class System.Text.RegularExpressions.RegexWriter

Returns the current position in the emitted code.

Emits a zero-argument operation. Note that the emit functions all run in two modes: they can emit code, or they can just count the size of the code.

Emits a one-argument operation.

Emits a two-argument operation.

The main RegexCode generator. It does a depth-first walk through the tree and calls EmitFragment to emits code before and after each child of an interior node, and at each leaf.

true if the stack is empty.

When generating code on a regex that uses a sparse set of capture slots, we hash them to a dense set of indices for an array of capture slots. Instead of doing the hash at match time, it's done at compile time, here.

Fixes up a jump instruction at the specified offset so that it jumps to the specified jumpDest.

This is the pop.

To avoid recursion, we use a simple integer stack. This is the push.

The top level RegexCode generator. It does a depth-first walk through the tree and calls EmitFragment to emits code before and after each child of an interior node, and at each leaf. It runs two passes, first to count the size of the generated code, and second to generate the code. We should time it against the alternative, which is to just generate the code and grow the array as we go.

Returns an index in the string table for a string; uses a hashtable to eliminate duplicates.

This is the only function that should be called from outside. It takes a RegexTree and creates a corresponding RegexCode.