Thunks
Related Doc:
package primitives
Base class for all compound nodes with schedule (e.g.
Base class for all compound nodes with schedule (e.g. Lambda, ThunkDef).
The graph is directed acyclic (i.e. DAG) in which edges go from boundVars down to roots.
Base class for most predefined operations.
Base class for most predefined operations.
Base class for virtualized instances of type companions.
Base class for virtualized instances of type companions. Each virtualized entity type (trait or class) may have virtualized companion class.
Default node type for embedding of literal values to graph IR.
Default node type for embedding of literal values to graph IR.
This can be used or those types T when Elem[T] is defined,
but Liftable[_,T] is not, i.e. for non-liftable types.
literal value
type descriptor of IR type T
Base type for all graph nodes (aka computable value definitions).
Base type for all graph nodes (aka computable value definitions). Each graph node or definition represent one operation node of the data flow graph.
Default pass to be used when IR is used without special compiler configuration.
Default pass to be used when IR is used without special compiler configuration.
Base class for all objects generated for virtualized types to support staged evaluation machinery.
Base class for all objects generated for virtualized types to support
staged evaluation machinery.
Each object contains definitions which can be imported when necessary.
All that objects are registered in entityObjects hash map,
which is done while IR cake is constructed.
GraphNode is created for each symbol of the AstGraph and represents graph linking structure
GraphNode is created for each symbol of the AstGraph and represents graph linking structure
Represent lambda expression as IR node.
Represent lambda expression as IR node.
Concrete and default implementation of Transformer using underlying HashMap.
Concrete and default implementation of Transformer using underlying HashMap.
Base class for mirrors of graph nodes.
Base class for mirrors of graph nodes. Provides default implementations which can be overriden if special logic is required.
Base class for all IR nodes/operations/definitions.
Base class for all IR nodes/operations/definitions.
Variants of owner parameter of constructors of nested classes:
1) predefined node classes are owned by IR cake (ScalanOwner)
2) entity classes are owned by enclosing EntityObject
Variants of owner parameter of constructors of nested classes:
1) predefined node classes are owned by IR cake (ScalanOwner)
2) entity classes are owned by enclosing EntityObject
Deboxed function to obtain usages of a given node.
Deboxed function to obtain usages of a given node.
Represents adjacency matrix of the reversed graph g.
Turns partial function into rewriter (i.e.
Turns partial function into rewriter (i.e. set of rewriting rules)
Descriptor of a current compiler pass.
Descriptor of a current compiler pass. Compiler can be configured to perform one pass after another. Each pass has name, configuration parameters, finalizaton logic etc.
Configuration parameters of the Pass descriptor.
Configuration parameters of the Pass descriptor.
Symbols may temporary refer to this node until their target node is updated.
Symbols may temporary refer to this node until their target node is updated.
Immutable graph collected from roots following Ref.node.deps links.
Immutable graph collected from roots following Ref.node.deps links.
Abstract representation of a computable value.
Abstract representation of a computable value.
Default implementation is a simple lightweight reference to the corresponding definition.
Every Ref have direct access to its Def via node property.
Every Ref is typed, and the type is avaliable via elem property.
SingleRep
Type synonim for graph schedules.
Type synonim for graph schedules.
Alternative representation of schedules using node ids.
Alternative representation of schedules using node ids.
A Ref is a symbolic reference used internally to refer to graph nodes.
A Ref is a symbolic reference used internally to refer to graph nodes. Light weight stateless immutable reference to a graph node (Def[T]). Two symbols are equal if they refer to the nodes with the same id, which is due to Def unification means equal symbols refer to the same instance of Def.
Untyped shortcut sinonim of Ref, which is used as untyped reference to graph nodes (definitions).
Untyped shortcut sinonim of Ref, which is used as untyped reference to graph nodes (definitions). Following a tradition in compiler engineering we call references to definitions as symbols.
Base class for Ref to Ref transformations.
Base class for Ref to Ref transformations. Each transformer keeps a mapping data between references to original nodes and references to the corresponding transformed nodes.
Node class for typed variables.
Node class for typed variables. In particular for lambda-bound variables.
is independent from nodeId, shouldn't be used as node id.
type descriptor of the variable type
Helper methods to throw errors
Helper methods to throw errors
Logical AND between two pattern matches of the save value x.
Logical AND between two pattern matches of the save value x.
Can be used to construct patterns like case P1 && P2 => ...
Matcher for lambdas which don't depend on their arguments (but can close over other expressions, unlike VeryConstantLambda).
Matcher for lambdas which don't depend on their arguments (but can close over other expressions, unlike VeryConstantLambda).
Default Mirror instance which is used in core IR methods.
Default Mirror instance which is used in core IR methods.
Zero literal node, which is lazily created and can be efficiently reused.
Zero literal node, which is lazily created and can be efficiently reused.
Much faster alternative to (0: Rep[Int]) or toRep(0).
Data type ST is liftable is there is Liftable[ST, T] instance for some type T.
Data type ST is liftable is there is Liftable[ST, T] instance for some type T.
Liftable typeclass allows to define which types can have values embedded as literals
into graph IR.
Identity rewriter, i.e.
Identity rewriter, i.e. doesn't change the graph when applied.
Matcher for lambdas which return staging-time constants.
Matcher for lambdas which return staging-time constants. VeryConstantLambda(x) should be equivalent to ConstantLambda(Def(Const(x)))
Helper to type cast node references.
Helper to type cast node references.
Called to setup IR before the new pass is executed.
Called to setup IR before the new pass is executed.
Whether IR type descriptors should be cached.
Whether IR type descriptors should be cached.
Whether Tup instances should be cached.
Whether Tup instances should be cached.
Composition of two functions (in mathematical notation), where first g is applied and them f.
Composition of two functions (in mathematical notation), where first g is applied and them f.
Create new definition entry in either given Thunk or in the global hash table.
Create new definition entry in either given Thunk or in the global hash table.
optional thunk scope to put given definition
symbol refering to d
definition node to add to the scope of globally
reference to d (which is s)
IR global current Pass, changes when the compier switches from one pass to the next one.
IR global current Pass, changes when the compier switches from one pass to the next one. Should remain constant during the whole pass execution.
Whether to perform extended checks of correctness, expected invariants and data consistency.
Whether to perform extended checks of correctness, expected invariants and data consistency.
NOTE: Since it may add substantial overhead, set it to false before using in production.
Returns a number of definitions added to this IR context.
Returns a number of definitions added to this IR context.
Called to let this IR context to finalized the given pass.
Called to let this IR context to finalized the given pass.
Lookup definition in this IR context's hash table of definitions.
Lookup definition in this IR context's hash table of definitions.
node reference to an instance stored in hash table, which is equal to d
and null if there is no definition which is equal to d
Lookup d in the heap of nodes.
Lookup d in the heap of nodes. If the lookup is successfull, then
its reference is returned. If the node is not found in the heap, then it is added
and d.self reference is returned.
node to be added to the head of nodes
producer of the reference to be used as the reference to d node.
return a reference to d node in the heap
Get next fresh node id
Get next fresh node id
Lookup of create reference to the given definition.
Lookup of create reference to the given definition.
To lookup d.nodeId is used as the index in the _symbolTable.
If Ref is not found in _symbolTable, then new Ref instance is created
and stored in _symbolTable at d.nodeId index.
Executes given lambda to construct Lambda node.
Executes given lambda to construct Lambda node. The function f can be called with any symbol
and has an effect of growing a graph starting from the argument symbol.
If a reference to Variable node is passed as argument, then the constructed graph nodes
can be collected to Lambda node forming its body and schedule.
function which execution will create body nodes
arguments type descriptor
Returns OwnerKind for the given constructor, using its first parameter.
Returns OwnerKind for the given constructor, using its first parameter.
Lookup node reference by its id.
Lookup node reference by its id. This is simple array access by index O(1) operation.
Global flag governing lambda reification in fun and mkLambda.
Global flag governing lambda reification in fun and mkLambda.
If this flag is true then original f: Ref[A] => Ref[B] function is stored in Lambda node.
As a consequence if f is not stored, then unfoldLambda is done by mirrorLambda.
Log warning message to the log.
Log warning message to the log. This is default and simple implementation, which can be overriden.
Called during resetContext() operation after the core context state has been reset.
Called during resetContext() operation after the core context state has been reset. Derived classes can override to define application specific initialization. Don't forget to call super method in the beginning of your overriding method.
Implicit injection of new definition (graph node) into universum of nodes with collapsing semantics.
Implicit injection of new definition (graph node) into universum of
nodes with collapsing semantics. If there exists node n in this IR
such that obj equals n, then the value of n.self is returned, i.e.
the new node obj is collapsed with already existing one.
This has an effect of Common Subexpression Elimination (CSE) when
an expression tree is transformed to the graph and identical subtrees
are collapsed.
After a reference to the node is obtained, global rewriting rules are
examined and the reference may be replaced with a new one.
Prettyprint exception message
Prettyprint exception message
Updates the universe of symbols and definitions, then rewrites until fix-point
Updates the universe of symbols and definitions, then rewrites until fix-point
A new graph node to add to the universe
A symbol that will be used if d doesn't exist in the universe
The symbol of the graph which is semantically(up to rewrites) equivalent to d
Lifting of data values to IR nodes.
Lifting of data values to IR nodes.
Transforms this object into new one by applying t to every Ref inside
its structure.
Transforms this object into new one by applying t to every Ref inside
its structure. The structure is build out of Seq, Array, Option and Def values.
Other structure items remain unchanged and copied to the new instance.
Turns on/off lambda unfolding using original function f stored in the Lambda node.
Turns on/off lambda unfolding using original function f stored in the Lambda node.
If this flag is false then this function cannot be used even if it is present in the node.
Create or find symbol (node Ref) which refers to the given node in the table of all created symbols.
Create or find symbol (node Ref) which refers to the given node in the table of all created symbols. The d.nodeId is the index in the _symbolTable which is DBuffer (backed by Array)
new of existing symbol
Global lambda equality mode used by default.
Global lambda equality mode used by default. It is used in fun and fun2 lambda builders.
If this flag is true then Lambda nodes are equal if they are the same up to renaming of symbols. (see Lambda.equals()).
Each Lambda node has independent equality mode flag which is setup in the constructor.
Extract data value from Const node or throw an exception.
Extract data value from Const node or throw an exception.