case class ProgramGraph(roots: Seq[Scalan.Sym], mapping: Nullable[Scalan.Transformer], filterNode: Nullable[(Scalan.Sym) ⇒ Boolean]) extends Scalan.AstGraph with Product with Serializable
Immutable graph collected from roots following Ref.node.deps links.
- Alphabetic
- By Inheritance
- ProgramGraph
- Serializable
- Serializable
- AstGraph
- Node
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new ProgramGraph(root: Scalan.Sym)
- new ProgramGraph(roots: Seq[Scalan.Sym], filterNode: Nullable[(Scalan.Sym) ⇒ Boolean] = Nullable.None)
- new ProgramGraph(roots: Seq[Scalan.Sym], mapping: Nullable[Scalan.Transformer], filterNode: Nullable[(Scalan.Sym) ⇒ Boolean])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
lazy val
allNodes: Map[Int, Scalan.GraphNode]
- Definition Classes
- AstGraph
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
boundVars: Nil.type
If this graph represent Lambda abstraction, the boundVars is lambda bound symbols.
If this graph represent Lambda abstraction, the boundVars is lambda bound symbols. otherwise this is empty set.
- Definition Classes
- ProgramGraph → AstGraph
-
final
def
buildFlatSchedule(schedule: Scalan.Schedule, flatBuf: Buffer[Scalan.Sym]): Unit
Flatten the given schedule into single sequence of non-AstGraph definitions.
Flatten the given schedule into single sequence of non-AstGraph definitions. All scope forming definitions like Lambda and ThunkDef are recursively unfolded in the given buffer
flatBuf. NOTE: The symbols of AstGraph-like definitions are added toflatBufAFTER the unfolded body.- Definition Classes
- AstGraph
-
def
buildUsageMap(schedule: Scalan.Schedule, usingDeps: Boolean): Map[Int, Scalan.GraphNode]
Build usage information induced by the given schedule.
Build usage information induced by the given schedule. For each symbol of the schedule a GraphNode is created and usages are collected. HOTSPOT: don't beautify the code
- Definition Classes
- AstGraph
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
final
def
deps: Array[Scalan.Sym]
Dependencies of this definition from other definitions.
Dependencies of this definition from other definitions. If definition is interpreted as an operation, then dependencies are arguments of the operation. If definition if compound (like Lambda of ThunkDef) then
depsis equals to free variables used in the body of the compound definition. This array also refers to predecessors of this graph node, so it is used to build topological ordering (execution schedule) of operations.- returns
array of referencies to other definitions.
- Definition Classes
- Node
-
lazy val
domain: Set[Int]
Set of symbol ids in the schedule.
Set of symbol ids in the schedule. Can be used to quickly recognize symbols belonging to the body of this definition.
- Definition Classes
- AstGraph
-
final
def
elements: Array[AnyRef]
All data elements of this graph node to be used in structural equality.
All data elements of this graph node to be used in structural equality.
- Definition Classes
- Node
- See also
equals where elements are used.
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(other: Any): Boolean
Default equality of definitions.
Default equality of definitions. Two definitions are equal if they have same
elements.- Definition Classes
- Node → Equals → AnyRef → Any
- val filterNode: Nullable[(Scalan.Sym) ⇒ Boolean]
-
lazy val
flatSchedule: Scalan.Schedule
- Definition Classes
- AstGraph
-
def
freeVars: ArraySeq[Scalan.Sym]
Collect a set of symbols used in the graph but which are not part of its schedule.
Collect a set of symbols used in the graph but which are not part of its schedule. If the graph represents a compound definition (Lambda, Thunk etc), then each item in
freeVarsis used in the body, but not part of it. Intersection of free vars with bound vars is empty. HOTSPOT: don't beautify the code- Definition Classes
- ProgramGraph → AstGraph
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
getDeps: Array[Scalan.Sym]
Override to redefine how dependencies are computed.
Override to redefine how dependencies are computed. For example, in
coreimplementation this is overriden in Lambda and ThunkDef using freeVars.- Attributes
- protected
- Definition Classes
- Node
-
def
globalUsagesOf(s: Scalan.Sym): Buffer[Scalan.Sym]
- Definition Classes
- AstGraph
-
def
hasManyUsages(s: Scalan.Sym): Boolean
- Definition Classes
- AstGraph
-
def
hasManyUsagesGlobal(s: Scalan.Sym): Boolean
- Definition Classes
- AstGraph
-
def
hashCode(): Int
Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default.
Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default. If some definition require mutability, this method can be overriden accordingly.
- Definition Classes
- Node → AnyRef → Any
-
def
isBoundVar(s: Scalan.Sym): Boolean
Checks the symbol is lambda bound.
Checks the symbol is lambda bound.
- Definition Classes
- AstGraph
- Annotations
- @inline()
-
def
isIdentity: Boolean
Whether this graph represents identity function.
Whether this graph represents identity function.
- Definition Classes
- ProgramGraph → AstGraph
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isLocalDef(s: Scalan.Sym): Boolean
- Definition Classes
- AstGraph
- Annotations
- @inline()
-
final
def
isLocalDefId(id: Int): Boolean
- Definition Classes
- AstGraph
- Annotations
- @inline()
-
final
def
isRoot(s: Scalan.Sym): Boolean
- Definition Classes
- AstGraph
- Annotations
- @inline()
- val mapping: Nullable[Scalan.Transformer]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
nodeId: Int
Unique id of the graph node assigned for each new instance using
freshIdgenerator.Unique id of the graph node assigned for each new instance using
freshIdgenerator. Doesn't participate in equality of this Def, thus definitions with different ids may still be structurally equal. Used to provide global Def numbering.- Definition Classes
- Node
- Annotations
- @inline()
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
lazy val
rootIds: Buffer[Int]
Extract identifies out of
roots.Extract identifies out of
roots.- Definition Classes
- ProgramGraph → AstGraph
-
val
roots: Seq[Scalan.Sym]
Terminal nodes of the graph.
Terminal nodes of the graph. There are incoming, but no outgoing edges.
- Definition Classes
- ProgramGraph → AstGraph
-
lazy val
schedule: Scalan.Schedule
Sequence of node references forming a schedule.
Sequence of node references forming a schedule. HOTSPOT: don't beautify the code
- Definition Classes
- AstGraph
-
lazy val
scheduleIds: Buffer[Int]
Schedule represents a body of compound definition - topologically ordered sequence of nodes of the graph.
Schedule represents a body of compound definition - topologically ordered sequence of nodes of the graph. It is implemented differently depending on node type.
- Definition Classes
- ProgramGraph → AstGraph
- See also
Lambda, ThunkDef
-
def
show(config: GraphVizConfig): Unit
- Definition Classes
- AstGraph
-
def
show(emitMetadata: Boolean): Unit
- Definition Classes
- AstGraph
-
def
show(): Unit
- Definition Classes
- AstGraph
-
final
def
syms: Array[Scalan.Sym]
References to other nodes in this Def instance.
References to other nodes in this Def instance. Note: This is different form
depsfor compound definitions like Lambda and ThunkDef.- Definition Classes
- Node
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
User readable string representation of this definition.
User readable string representation of this definition. (for debugging only)
- Definition Classes
- ProgramGraph → Node → AnyRef → Any
-
def
transform(m: Scalan.Mirror, rw: Scalan.Rewriter, t: Scalan.Transformer): Scalan.ProgramGraph
Mirror all the nodes of this graph applying transformer and performing rewriting.
Mirror all the nodes of this graph applying transformer and performing rewriting.
- m
mirror instance to be used for mirroring of nodes
- rw
rewriter to be tried for each new created mirrored node
- t
transformer of symbols, to be used for substitution of symbols in the new nodes.
- returns
new graph which is not necessary clone of this graph, but should be semantically equivalent to this graph (provided all rw rules preserve equivalence). If rw is identity, then the resulting graph is alpha-equivalent to this graph as long as t is bijection.
-
lazy val
usageMap: Map[Int, Scalan.GraphNode]
Symbol Usage information for this graph
Symbol Usage information for this graph
- Definition Classes
- AstGraph
-
def
usagesOf(id: Int): Buffer[Int]
HOTSPOT: for performance we return mutable structure, but it should never be changed.
HOTSPOT: for performance we return mutable structure, but it should never be changed.
- Definition Classes
- AstGraph
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
withoutContext: Scalan.ProgramGraph
Remove transformer component of the graph.
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated