Compute type information for all nodes in the AST.
Compute type information for all nodes in the AST. The actual typing rules are embedded in the nodes themselves.
Ensure that all symbol definitions in a tree are unique.
Ensure that all symbol definitions in a tree are unique. The same symbol can initially occur in multiple sub-trees when some part of a query is reused multiple times. This phase assigns new, uniqe symbols, so that later phases do not have to take scopes into account for identifying the source of a symbol. The rewriting is performed for both, term symbols and type symbols.
A standard skeleton for a code generator phase.
The current state of a compiler run, consisting of the current AST and additional immutable state of individual phases.
The current state of a compiler run, consisting of the current AST and additional immutable state of individual phases. Mutability is confined to the SymbolNamer. The state is tied to a specific compiler instance so that phases can call back into the compiler.
Conversion of basic ASTs to a shape suitable for relational DBs.
Conversion of basic ASTs to a shape suitable for relational DBs. This phase replaces all nodes of types Bind, Filter, SortBy, Take and Drop by Comprehension nodes and merges nested Comprehension nodes.
Create a ResultSetMapping root node, ensure that the top-level server-side node returns a collection, and hoist client-side type conversions into the ResultSetMapping.
An optional phase which rewrites outer joins into more commonly supported operations for use on databases that lack outer join support.
An optional phase which rewrites outer joins into more commonly supported operations for use on databases that lack outer join support.
Full outer joins are always emulated. Right joins can be replaced by left joins (or an emulated version thereof). Left joins can be emulated with inner joins and unions.
Expand multi-column conditional expressions and SilentCasts created by expandSums.
Expand multi-column conditional expressions and SilentCasts created by expandSums. Single-column conditionals involving NULL values are optimized away where possible.
Expand paths of record types to reference all fields individually and recreate the record structure at the call site.
Expand sum types and their catamorphisms to equivalent product type operations.
Expand table-valued expressions in the result type to their star projection.
Inject the proper orderings into the RowNumber nodes produced earlier by the resolveFixJoins phase.
Flatten all Pure node contents into a single StructNode.
Ensure that all collection operations are wrapped in a Bind so that we have a place for expanding references later.
Ensure that all collection operations are wrapped in a Bind so that we have a place for expanding references later. FilteredQueries are allowed on top of collection operations without a Bind in between, unless that operation is a Join or a Pure node.
Fuse sub-comprehensions into their parents.
Lift operations that are preferred to be performed on the client side out of sub-queries.
Infer types and compute missing structural views for all nominal table types.
A custom compiler for INSERT statements.
A custom compiler for INSERT statements. We could reuse the standard phases with a minor modification instead, but this is much faster.
A phase of the query compiler, identified by a unique name
Remove unreferenced fields from StructNodes and convert unreferenced StructNodes to single columns or ProductNodes (which is needed for aggregation functions and at the top level).
An immutable, stateless query compiler consisting of a series of phases
Assign the AnonSymbols of fields from the left side of a Union to the right side.
Assign the AnonSymbols of fields from the left side of a Union to the right side. This ensures that both sides are protected when we prune unused references pointing to left-side Symbols.
Rewrite zip joins into a form suitable for SQL (using inner joins and RowNumber columns.
Rewrite zip joins into a form suitable for SQL (using inner joins and RowNumber columns. We rely on having a Bind around every Join and both of its generators, which should have been generated by Phase.forceOuterBinds. The inner Binds need to select Pure(StructNode(...)) which should be the outcome of Phase.rflattenProjections.
For SQL back-ends which do not support real boolean types for fields and general expressions but which do have special boolean expressions and operators, this phase injects conversions between fake and real boolean values.
For SQL back-ends which do not support real boolean types for fields and general expressions but which do have special boolean expressions and operators, this phase injects conversions between fake and real boolean values.
The default for booleans in the AST is to use the fake type. There are specific places where a real boolean is required or produced, so we inject a call to ToRealBoolean or ToFakeBoolean as needed.
Specialize the AST for edge cases of query parameters.
Specialize the AST for edge cases of query parameters. This is required for
compiling take(0)
for some databases which do not allow LIMIT 0
.
The Phase
companion objects contains ready-to-use Phase
objects for
the standard phases of the query compiler
Slick AST to database query compiler