gV      !"#$%&'()*+,-./0123456789:;<=>?@A B C D E F G H I J K L M N O P Q R S T U V W X Y Z[\]^_`abcdefghijkl m n o p q r s t u v w x y z { | } ~         !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                  ! " # $!%!&!'!(!)!*!+!,!-!.!/!0!1!2!3"4"5"6"7"8"9":";<=>?@AB#C$D$E$F$G$H$I$J$K$L$M$N$O$P$Q%R%S%T%U%(&Safe VWXYZ[\]^_`abW]^_`ab VWXYZ[\]^_`abSafe DTransform/format a text so that it is acceptable as a HDL identifier cdefghijk cdefghijkSafeComponent instantiation hole. First argument indicates which function argument to instantiate. Second argument corresponds to output and input assignments, where the first element is the output assignment, and the subsequent elements are the consecutive input assignments.eThe LHS of the tuple is the name of the signal, while the RHS of the tuple is the type of the signalElements of a blackbox contextConstantComponent instantiation hole  Output hole  Input hole  Literal hole  Symbol hole VClock hole (Maybe clk corresponding to input, clk corresponding to output if Nothing) Reset holeType declaration holeType root holeError value hole&Select element type from a vector typeIHole for the name of the component in which the blackbox is instantiatedAIndex data type hole, the field is the (exclusive) maximum indexSize of a type holeLength of a vector hole*Hole containing a filepath for a data fileGHole marking beginning (True) or end (False) of a generative constructHole indicating whether IntWordInteger are 64-Bit)A BlackBox Template is a List of Elements    NoneSParse a text as a BlackBoxTemplate, returns a list of errors in case parsing failsl7Parse a BlackBoxTemplate (Declarations and Expressions)mParse a single Template Elementn!Parse the Text part of a Templateo)Parse a Declaration or Expression elementpParse a Declarationq#Parse the output tag of Declarationr"Parse the input tag of DeclarationsParse an Expression elementtParse a bracketed textu)Parse a token and eat trailing whitespacev/Parse the expression part of Blackbox TemplateswParse an Expression or Textx Parse SigDy(Text excluding square brackets and tildezlmnopqrstuvwxyzlmnopqrstuvwxyNoneUExternally defined primitiveLA primitive that has a template that can be filled out by the backend render Name of the primitive! Either a  declaration or an  expression template."/A primitive that carries additional information#Additional information$Primitive Definitions !"#$% !"#$ $" ! #%" ! #$%None35FIN*(A class that can generate unique numbers+Get a new unique,^Create a TH expression that returns the a formatted string containing the name of the module ,4 is spliced into, and the line where it was spliced.-$Cache the result of a monadic action.ICache the result of a monadic action in a State 3 transformer layers down/Spine-strict cache variant of  mkCachedT30IRun a State-action using the State that is stored in a higher-layer Monad1Functorial version of '(2Functorial version of ')40Performs trace when first argument evaluates to {5Monadic version of *+6Monadic version of *,76Composition of a unary function with a binary function8)if-then-else as a function on an argument9&Applicative version of 'GHC.Types.(:)':Safe indexing, returns a | if the index does not exist;BUnsafe indexing, return a custom error message when indexing fails<5Split the second list at the length of the first list>ceiling (log_2(c))*+,-%The key the action is associated with)The Lens to the HashMap that is the cacheThe action to cache.%The key the action is associated with)The Lens to the HashMap that is the cacheThe action to cache/0+Lens to the State in the higher-layer monadThe State-action to perform123456789:;<=>? }~*+,-./0123456789:;<=>*+?,-./0123456789:;<=>*+,-./0123456789:;<=>?9-NoneMParse a ByteString according to the given JSON template. Prints failures on stdout, and returns | if parsing fails.Bytestring to parseNone@hGenerate a set of primitives that are found in the primitive definition files in the given directories.@/Directories to search for primitive definitions@@@.None357 None027F Type variableG Term variableHVariables in CoreHWIConstructor for type variablesLConstructor for term variablesNChange the name of a variable FGHIJKLMN FGHIJKLMN HILJKJMGFNFGHILJKJMN None02357 ODataCon referenceP:Syntactical position of the DataCon in the type definitionQData ConstructorSName of the DataConT+Syntactical position in the type definitionUType of the 'DataConVmUniversally quantified type-variables, these type variables are also part of the result type of the DataConWExistentially quantified type-variables, these type variables are not part of the result of the DataCon, but only of the arguments.XArgument typesYGiven a DataCon and a list of types, the type variables of the DataCon type are substituted for the list of types. The argument types are returned.NThe list of types should be equal to the number of type variables, otherwise Nothing is returned.OPQRSTUVWXY OPQRSTUVWXY QRSTUVWXOPY OPQRSTUVWXYNone02357&TyCon reference'Type ConstructorZ The RHS of an Algebraic Datatype\The DataCons of a TyCon^The newtype DataCon_The argument type of the newtype DataCon in eta-reduced form, which is just the representation of the TyCon. The TyName's are the type-variables from the corresponding TyCon.`Algorithmic DataConsaName of the TyConbKind of the TyConcNumber of type argumentsdDataCon definitionse$Function TyCons (e.g. type families)f&List of: ([LHS match types], RHS type)gPrimitive TyConsh'To close the loop on the type hierarchyi Create a Kind out of a TyConNamej&Does the TyCon look like a tuple TyConk%Get the DataCons belonging to a TyCon&'Z[\]^_`abcdefghijk&'Z[\]^_`abcdefghijk'`eghabcdabcfabca&Z[]\^_ijk &'`eghabcdabcfabcaZ[]\^_ijk None Builtin Name Builtin Name Builtin Name Builtin Name Builtin Kind Builtin Kind Builtin Kind Builtin Kind Builtin Type Builtin Type Builtin Type Builtin Type Builtin Type Builtin Type Builtin Type Builtin Type&lmnopqrstuvw lmnopqrstuvw lmnopqrstuvw&lmnopqrstuvw None02357x Term Literal Determines the Type of a Literal xyz{|}~ xyz{|}~ xyz{|}~xyz{|}~None02357(Term reference)DTerm representation in the CoreHW language: System F + LetRec + Case+Patterns in the LHS of a case-decompositionVDatatype pattern, '[TyVar]' bind existentially-quantified type-variables of a DataConLiteral patternDefault patternBinding in a LetRec constructVariable referenceDatatype constructorLiteral PrimitiveTerm-abstractionType-abstraction ApplicationType-applicationRecursive let-bindingECase-expression: subject, type of alternatives, list of alternatives()())( () NoneSubstitutes types in a typeSubstitutes a type in a typeSubstitutes kinds in a kindSubstitutes a type in a termSubstitutes types in a termSubstitutes a term in a termSubstitutes terms in a term None 02357%AReference to a KindBReference to a TypeCThe level above typesD/Types in CoreHW: function and polymorphic typesEMake a Type out of a TyConEither a Kind or a Type Literal TypesType Constants TyCon type Function typeAn easier view on types Function type Applied TyConNeither of the above Type variable Type constantPolymorphic TypeType Application Type literalAn easier view on typesA transformation that renders Signal types transparentA view on types in which SignalU types and newtypes are transparent, and type functions are evaluated when possible.ZInstantiate and Apply the RHS/Original of a NewType with the given list of argument types3Make a function type of an argument and result typeDMake a TyCon Application out of a TyCon and a list of argument types6Split a TyCon Application in a TyCon and its argumentsIs a type a Superkind?Determine the kind of a typeIs a type polymorphic?4Split a function type in an argument and result type^Split a poly-function type in a: list of type-binders and argument types, and the result type)Is a type a polymorphic or function type?/Is a type a polymorphic or function type under ?Is a type a function type?AApply a function type to an argument type and get the result type(Substitute the type variable of a type () with another typeCSplit a type application in the applied type and the argument types3ABCDE'ABCDEF'DCABFE'ABCDENone'Gives the free type-variables in a Type'Gives the free term-variables of a Term'Gives the free type-variables of a TermNone 35#Pretty printing Show-like typeclass Print a Pretty thing to a String?7None Kind environment/contextType environment/contextDetermine the type of a term>Split a (Type)Application in the applied term and it argumentsHSplit a (Type)Abstraction in the bound variables and the abstracted termGGet the result type of a polymorphic function given a list of arguments6Get the list of term-binders out of a DataType patternMake a type variableMake a term variable6Abstract a term over a list of term and type variables-Abstract a term over a list of term variables-Abstract a term over a list of type variables)Apply a list of types and terms to a termApply a list of terms to a termApply a list of types to a term!Does a term have a function type?0Does a term have a function or polymorphic type?Is a term a term-abstraction?"Is a term a recursive let-binding?Is a term a variable reference?!Is a term a datatype constructor?Is a term a primitive?,Make variable reference out of term variable0Make a term variable out of a variable reference$Create a vector of supplied elements&Append elements to the supplied vectorCreate let-bindings with case-statements that select elements out of a vector. Returns both the variables to which element-selections are bound and the let-bindings*Determine whether a type is isomorphic to CLaSH.Signal.Internal.Signal' It is i.e.: Signal' clk a(Signal' clk a, Signal' clk b)Vec n (Signal' clk a)data Wrap = W (Signal clk' Int)etc.The Nil constructorThe Cons (:>) constructor Element typeLength of the vectorElements to put in the vectorThe Cons (:>) constructor Element type$The vector to append the elements toLength of the vectorElements to appendThe Cons (:>) constructorThe element type*Char to append to the bound variable namesLength of the vector The vectorNone0CA\Either the name of the identifier, or a tuple of the identifier and the corresponding clock8Context used to fill in the holes of a BlackBox templateResult name and type2Argument names, types, and whether it is a literal&Function arguments (subset of inputs):,(Blackbox Template,Partial Blackbox Concext) Bit literalHighLow UndefinedHigh-impedanceLiterals used in an expressionNumber literal Bit literalBoolean literalVector literalString literal'Expression used in RHS of a declarationLiteral expressionDataCon applicationSignal referenceLeft e : tagToEnum, @Right e@: dataToTag&Instantiation of a BlackBox expressionExpression Modifier@Index the expression: (Type of expression,DataCon tag,Field Tag)JSee expression in a DataCon context: (Type of the expression, DataCon tag)>See the expression in the context of a Vector append operationInternals of a ComponentSignal assignment:Signal to assignAssigned expressionConditional signal assignment:Signal to assignType of the result/alternativesScrutinized expressionType of the scrutineeVList of: (Maybe expression scrutinized expression is compared with,RHS of alternative)"Instantiation of another component%Instantiation of blackbox declarationSignal declarationRepresentable hardware types Empty type String type Boolean typeBitVector of a specified size9Unsigned integer with specified (exclusive) upper bounder"Signed integer of a specified size$Unsigned integer of a specified size Vector type $Sum type: Name and Constructor names "Product type: Name and field types =Sum-of-Product type: Name and Constructor names + field types )Clock type with specified name and period BReset type corresponding to clock with a specified name and period?Size indication of a type (e.g. bit-size or number of elements)!Component: base unit of a NetlistName of the componentBPorts that have no correspondence the original function definition Input ports Output portsInternal declarationsSignal referenceState of the NetlistMonadGlobal bindersType environment/contextNumber of signal declarationsNumber of create componentsCached componentsPrimitive Definitions#Hardcoded Type -> HWType translator  TyCon cache!"Name of the module containing the  topEntity%}Monad that caches generated components (StateT) and remembers hidden inputs of components that are being generated (WriterT)[      !"#$%&'()*+,-./012345678W      !"#$%&'(-./012345678[%&' !"#$,     +*)(876543210/.-        !"#$%&'()*+,-./012345678None357C 9State of a rewriting session;!Number of applied transformations<Global binders=Supply of unique numbers>&Function which is currently normalized? Used for @Additional stateAContext in which a term appearsB#Function position of an applicationC#Argument position of an applicationD'Function position of a type applicationE)RHS of a Let-binder with the sibling LHS'F)Body of a Let-binding with the bound LHS'G2Body of a lambda-term with the abstracted variableH:Body of a TyLambda-term with the abstracted type-variableIMRHS of a case-alternative with the variables bound by the pattern on the LHSJSubject of a case-decompositionK,Read-only environment of a rewriting sessionM(Lvl at which we print debugging messagesN"Hardcode Type -> HWType translatorO TyCon cachePTuple TyCon cacheQ&Hardcoded evaluator (delta-reduction)}RDebug Message VerbositySDon't show debug messagesT&Show completely normalized expressionsU Names of applied transformationsV/Show sub-expressions after a successful rewriteW8Show all sub-expressions on which a rewrite is attempted^A _ action in the context of the `_=Monadic action that transforms a term given a certain context`Monad that keeps track how many transformations have been applied and can generate fresh variables and unique identifiers. In addition, it keeps track if a transformation/rewrite has been successfully applied.89:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnop/9:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefg8ABCDEFGHIJ9:;<=>?@]\[ZYXRSTUVWKLMNOPQgfedc`abponmlkjih_^9:;<=>?@A BCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopNoneyGlobal function binders qrstuvwxy qrstuvwxy yqrstuvwxqrstuvwxyNone z State of the |Global binders}*Cache of previously specialised functions:NKey: (name of the original function, argument position, specialised term/type)AElem: (name of specialised function,type of specialised function)~2Cache of how many times a function was specializedNumber of time a function f can be specialized,Cache of function where inlining took place:'Key: function where inlining took place=Elem: (functions which were inlined, number of times inlined)Number of times a function f can be inlined in a function gKSize of a function below which it is always inlined if it is not recursiveA  Transform action in the context of the ` and 3RewriteSession with extra Normalisation information?State monad that stores specialisation and inlining informationz{|}~z{|}~z{|}~ z{|}~NoneN 1Apply a transformation on the subtrees of an term'Apply two transformations in successionJApply two transformations in succession, and perform a deepseq in between.-Apply a transformation in a topdown traversalOApply a transformation in a topdown traversal. Doesn't freshen bound variables.Apply a transformation in a bottomup traversalPApply a transformation in a bottomup traversal. Doesn't freshen bound variables?Only apply the second transformation if the first one succeeds.<Only apply the second transformation if the first one fails..Keep applying a transformation until it fails.<Only traverse downwards when the assertion evaluates to true /Freshen variable references in abstracted terms+The transformation to apply to the subtrees   None Split a normalized term into: a list of arguments, a list of let-bindings, and a variable reference that is the body of the let-binding. Returns a String containing the error is the term was not in a normalized form.Converts a Core type to a HWType given a function that translates certain builtin types. Errors if the Core type is not translatable.KConverts a Core type to a HWType within the NetlistMonad; errors on failure:Converts a Core type to a HWType within the NetlistMonad; | on failure@Returns the name and period of the clock corresponding to a typeConverts a Core type to a HWType given a function that translates certain builtin types. Returns a string containing the error message when the Core type is not translatable.RConverts an algebraic Core type (split into a TyCon and its argument) to a HWType./Simple check if a TyCon is recursively defined.nDetermines if a Core type is translatable to a HWType given a function that translates certain builtin types. Determines the bitsize of a type3Determines the bitsize of the constructor of a type(Gives the length of length-indexed types}Gives the HWType corresponding to a term. Returns an error if the term has a Core type that is not translatable to a HWType.2Gives the HWType corresponding to a term. Returns |C if the term has a Core type that is not translatable to a HWType._Turns a Core variable reference to a Netlist expression. Errors if the term is not a variable.LUniquely rename all the variables and their references in a normalized termAppend a string to a namePreserve the Netlist  and  when executing a monadic action TyCon cache#Hardcoded Type -> HWType translator TyCon cache9String representation of the Core type for error messages The TyConIts applied argumentsNoneINLift an action working in the @ state to the `1Record if a transformation is succesfully applied"Perform a transformation on a Term,Evaluate a RewriteSession to its inner monad7Notify that a transformation has changed the expression^Identity function that additionally notifies that a transformation has changed the expression>Create a type and kind context out of a transformation contextaCreate a complete type and kind context out of the global binders and the transformation context3Make a new binder and variable reference for a termDMake a new binder and variable reference for either a term or a typeCMake a new, unique, identifier and corresponding variable reference@Inline the binders in a let-binding that have a certain propertyRDetermine whether a binder is a join-point created for a complex case expression.lA join-point is when a local function only occurs in tail-call positions, and when it does, more than once.GCount the number of (only) tail calls of a function in an expression. |B indicates that the function was used in a non-tail call position.Substitute the RHS of the first set of Let-binders for references to the first set of Let-binders in: the second set of Let-binders and the additional termCalculate the localb free variable of an expression: the free variables that are not bound in the global environment.TLift the binders in a let-binding to a global function that have a certain propertyCreate a global function for a Let-binding and return a Let-binding where the RHS is a reference to the new global function applied to the free variables of the original RHS,Make a global function for a name-term tuple+Add a function to the set of global binders@Create a new name out of the given name, but with another unique=Test whether a term is a variable reference to a local binder5Determine if a term cannot be represented in hardware5Determine if a type cannot be represented in hardware1Is the Context a Lambda/Term-abstraction context?+Make a binder that should not be referencedNMake a case-decomposition that extracts a field out of a (Sum-of-)Product type)Specialise an application on its argument)Specialise an application on its argument=Create binders and variable references for free variables in specArgName of the transformationTransformation to be appliedName of the transformationTransformation to performTerm to transform TyCon cacheName of the new binder Term to bind TyCon cacheName of the new binderType or Term to bindName of the identifier Property testG of the local binder'Expression in which the binder is boundFunction to checkExpression to check it inLet-binders to substitute*Let-binders where substitution takes place)Expression where substitution takes place Property testName of the functionTerm bound to the function6Name with a proper unique and the type of the function#Name of the caller of this function TyCon cacheSubject of the case-composition"Lens into previous specialisations$Lens into the specialisation history"Lens into the specialisation limit"Lens into previous specialisations Lens into specialisation history"Lens into the specialisation limit Original term@Function part of the term, split into root and applied argumentsArgument to specialize onNoneUADetermine if a function is already inlined in the context of the  NetlistMonad(Specialize under the Normalization MonadDetermine if a term is closed)Determine if a term represents a constant=Create a call graph for a set of global binders, given a rootIDetermine the sets of recursive components given the edges of a callgraph Function we want to inline1Function in which we want to perform the inliningFunction we want to inline1Function in which we want to perform the inlining.List of functions that should not be inspectedGlobal bindersRoot of the call graph "(calling function,[called function)]Original BindersDependency GraphRecursive blockLambda-dropped BindersDependency GraphRecursive blockRecursive block dominatorOriginal BindersRecursive block dominatorRecursive block dominator rootBlock sank binder   None -/DF  Test if a  collected from an expression indicates that application of a global binder is disjoint: occur in separate branches of a case-expression.7Test if all elements in a list are equal to each other.Collect s for (potentially) disjoint applications of globals out of an expression. Also substitute truly disjoint applications of globals by a reference to a lifted out application.Collect s for (potentially) disjoint applications of globals out of a list of application arguments. Also substitute truly disjoint applications of globals by a reference to a lifted out application.Collect s for (potentially) disjoint applications of globals out of a list of alternatives. Also substitute truly disjoint applications of globals by a reference to a lifted out application.Collect s for (potentially) disjoint applications of globals out of a list of let-bindings. Also substitute truly disjoint applications of globals by a reference to a lifted out application.Given a case-tree corresponding to a disjoint interesting "term-in-a- function-position", return a let-expression: where the let-binding holds a case-expression selecting between the uncommon arguments of the case-tree, and the body is an application of the term applied to the common arguments of the case tree, and projections of let-binding corresponding to the uncommon argument positions. {Create a single selector for all the representable uncommon arguments by selecting between tuples. This selector is only ( j) created when the number of representable uncommmon arguments is larger than one, otherwise it is not (|).It also returns:<For all the non-representable uncommon arguments: a selectorFor all the representable uncommon arguments: a projection out of the tuple created by the larger selector. If this larger selector does not exist, a single selector is created for the single representable uncommon argument. aCreate a list of arguments given a map of positions to common arguments, and a list of arguments WCreate a case-expression that selects between the uncommon arguments given a case-tree _Determine if a term in a function position is interesting to lift out of of a case-expression.]This holds for all global functions, and certain primitives. Currently those primitives are:$All non-power-of-two multiplications<All division-like operations with a non-power-of-two divisorSSubstitution of (applications of) a global binder by a reference to a lifted term.#List of already seen global bindersThe expressionSSubstitution of (applications of) a global binder by a reference to a lifted term.#List of already seen global bindersThe list of argumentsSSubstitution of (applications of) a global binder by a reference to a lifted term.#List of already seen global bindersThe subject termThe list of alternativesSSubstitution of (applications of) a global binder by a reference to a lifted term.#List of already seen global bindersThe list let-bindingsCurrent free variables.5Case-tree of arguments belonging to the applied term. Types of the arguments Current position$map from position to common argument$(projections for) uncommon arguments Type of the alternatives"DataCon to pack multiple argumentsTypes of the argumentsCaseTree of arguments in scope EvaluatorTerm in function position Arguments    None Replace an application of the CLaSH.Sized.Vector.zipWith) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.zipWithReplace an application of the CLaSH.Sized.Vector.map) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.mapReplace an application of the CLaSH.Sized.Vector.traverse#) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.traverse#Create the traversable vectore.g. for a length '2' input vector, we get *(:>) <$> x0 <*> ((:>) <$> x1 <*> pure Nil)Replace an application of the CLaSH.Sized.Vector.foldr) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.foldrReplace an application of the CLaSH.Sized.Vector.fold) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.foldReplace an application of the CLaSH.Sized.Vector.dfold) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.dfoldReplace an application of the CLaSH.Sized.Vector.head) primitive on vectors of a known length n4, by a projection of the first element of a vector.Replace an application of the CLaSH.Sized.Vector.tail) primitive on vectors of a known length n+, by a projection of the tail of a vector.Replace an application of the CLaSH.Sized.Vector.(++)) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.(++)Replace an application of the CLaSH.Sized.Vector.unconcat) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.unconcatReplace an application of the CLaSH.Sized.Vector.transpose) primitive on vectors of a known length n3, by the fully unrolled recursive "definition" of CLaSH.Sized.Vector.transpose Length of the vector(s)Type of the lhs of the functionType of the rhs of the function"Type of the result of the functionThe zipWith'd functionsThe 1st vector argumentThe 2nd vector argumentLength of the vectorArgument type of the functionResult type of the functionThe map'd functionThe map'd over vectorLength of the vector#Element type of the argument vectorThe type of the applicative!Element type of the result vectorThe  Applicative dictionaryThe function to traverse withThe argument vector Vec tconNil conCons con term~ term termb tyLength of the vectorElements of the vectorLength of the vector#Element type of the argument vectorType of the starting elementThe function to fold withThe starting valueThe argument vectorLength of the vector#Element type of the argument vectorThe function to fold withThe argument vectorLength of the vector#Element type of the argument vectorFunction to fold withStarting valueThe vector to foldLength of the vectorElement type of the vectorThe argument vectorLength of the vectorElement type of the vectorThe argument vectorLength of the LHS argLenght of the RHS argElement type of the vectorsThe LHS argumentThe RHS argumentLength of the result vector+Length of the elements of the result vector Element typeArgument vectorLength of the result vector+Length of the elements of the result vector Element typeArgument vector   None EInline non-recursive, non-representable, non-join-point, let-bindings#Lift non-representable let-bindings"Specialize functions on their type8Specialize functions on their non-representable argument@Lift the let-bindings out of the subject of a Case-decompositionVMove a Case-decomposition from the subject of a Case-decomposition to the alternatives\Inline function with a non-representable result if it's the subject of a Case-decompositionSpecialize a Case-decomposition (replace by the RHS of an alternative) if the subject is (an application of) a DataCon; or if there is only a single alternative that doesn't reference variables bound by the pattern.lBring an application of a DataCon or Primitive in ANF, when the argument is is considered non-representablekEnsure that top-level lambda's eventually bind a let-expression of which the body is a variable-reference.Remove unused let-bindingsUInline let-bindings when the RHS is either a local variable reference or is constantInline nullary/closed functionsInline small functions4Specialise functions on arguments which are constant7Propagate arguments of application inwards; except for ' where the argument becomes let-bound.3Flatten ridiculous case-statements generated by GHC+For case-statements in haskell of the form: Rf :: Unsigned 4 -> Unsigned 4 f x = case x of 0 -> 3 1 -> 2 2 -> 1 3 -> 0 #GHC generates Core that looks like: f = (x :: Unsigned 4) -> case x == fromInteger 3 of False -> case x == fromInteger 2 of False -> case x == fromInteger 1 of False -> case x == fromInteger 0 of False -> error "incomplete case" True -> fromInteger 3 True -> fromInteger 2 True -> fromInteger 1 True -> fromInteger 0 ]Which would result in a priority decoder circuit where a normal decoder circuit was desired.;This transformation transforms the above Core to the saner: f = (x :: Unsigned 4) -> case x of _ -> error "incomplete case" 0 -> fromInteger 3 1 -> fromInteger 2 2 -> fromInteger 1 3 -> fromInteger 0 lTurn an expression into a modified ANF-form. As opposed to standard ANF, constants do not become let-bound.9Eta-expand top-level lambda's (DON'T use in a traversal!)Turn a normalized recursive function, where the recursive calls only pass along the unchanged original arguments, into let-recursive function. This means that all recursive calls are replaced by the same variable reference as found in the body of the top-level let-expression.+Inline a function with functional argumentsDSimplified CSE, only works on let-bindings, works from top to bottomReplace primitives by their "definition" if they would lead to let-bindings with a non-representable type when a function is in ANF. This happens for example when CLaSH.Size.Vector.map consumes or produces a vector of non-representable elements.Basically what this transformation does is replace a primitive the completely unrolled recursive definition that it represents. e.g. 8zipWith ($) (xs :: Vec 2 (Int -> Int)) (ys :: Vec 2 Int)is replaced by: let (x0 :: (Int -> Int)) = case xs of (:>) _ x xr -> x (xr0 :: Vec 1 (Int -> Int)) = case xs of (:>) _ x xr -> xr (x1 :: (Int -> Int)( = case xr0 of (:>) _ x xr -> x (y0 :: Int) = case ys of (:>) _ y yr -> y (yr0 :: Vec 1 Int) = case ys of (:>) _ y yr -> xr (y1 :: Int = case yr0 of (:>) _ y yr -> y in (($) x0 y0 :> ($) x1 y1 :> Nil)3Currently, it only handles the following functions: CLaSH.Sized.Vector.mapCLaSH.Sized.Vector.zipWithCLaSH.Sized.Vector.traverse#CLaSH.Sized.Vector.foldrCLaSH.Sized.Vector.foldCLaSH.Sized.Vector.dfoldCLaSH.Sized.Vector.(++)CLaSH.Sized.Vector.headCLaSH.Sized.Vector.tailCLaSH.Sized.Vector.unconcatCLaSH.Sized.Vector.transposeCLaSH.Sized.Vector.replicateaThis transformation lifts applications of global binders out of alternatives of case-statements.e.g. It converts: /case x of A -> f 3 y B -> f x x C -> h x into: let f_arg0 = case x of {A -> 3; B -> x} f_arg1 = case x of {A -> y; B -> x} f_out = f f_arg0 f_arg1 in case x of A -> f_out B -> f_out C -> h x !!NoneNormalisation transformation+Topdown traversal, stops upon first successNone-Run a NormalizeSession in a given environment 7Rewrite a term according to the provided transformation ;Check if the call graph (second argument), starting at the topEnity (first argument) is non-recursive. Returns the list of normalized terms if call graph is indeed non-recursive, errors otherwise. `Perform general "clean up" of the normalized (non-recursive) function hierarchy. This includes:6Inlining functions that simply "wrap" another function Level of debug messages to print UniqueSupplyGlobal Binders#Hardcoded Type -> HWType translator TyCon cacheTuple TyCon cache%Hardcoded evaluator (delta-reduction)NormalizeSession to run Transformation to applyTerm to transform   topEntityList of normalized binders  VisitedGlobal bindersRoot of the call graph                  NoneInitial state for state monad&Location for the primitive definitionsmName of backend, used for directory to put output files in. Should be | constant function / ignore argument."File extension for target langauge!Get the set of types out of state$Generate HDL for a Netlist componentHGenerate a HDL package containing type definitions for the given HWTypes-Convert a Netlist HWType to a target HDL type<Convert a Netlist HWType to an HDL error value for that type9Convert a Netlist HWType to the root of a target HDL typeHCreate a signal declaration from an identifier (Text) and Netlist HWType *Create a generative block statement marker!4Turn a Netlist Declaration to a HDL concurrent block"/Turn a Netlist expression into a HDL expression#Bit-width of IntWordInteger !"# !"# !"# !"#!None 4U$!Determine if the number of normalliteralqfunction inputs of a blackbox context at least matches the number of argument that is expected by the template.&uUpdate all the symbol references in a template, and increment the symbol counter for every newly encountered symbol.+*Get the name of the clock of an identifier,XRender a blackbox given a certain context. Returns a filled out template and a list of hidden9 inputs that must be added to the encompassing component.- Render a single template element0Fill out the template corresponding to an output/input assignment of a component instantiation, and turn it into a single identifier so it can be used for a new blackbox context.2pGive a context and a tagged hole (of a template), returns part of the context that matches the tag of the hole.$Blackbox to verifyTemplate to check against%&'()*+,Blackbox template Context used to fill in the hole-./012$%&'()*+,-./012$%&'()*+,-./012$%&'()*+,-./012"NoneF32Generate the context for a BlackBox instantiation.7Create an template instantiation text and a partial blackbox content for an argument term, given that the term is a function. Errors if the term is not a function8MInstantiate symbols references with a new symbol and increment symbol counter35Identifier binding the primitive/blackbox application/Arguments of the primitive/blackbox application456&Put BlackBox expression in parenthesis(Treat BlackBox expression as declaration7BIdentifier binding the encompassing primitive/blackbox applicationThe function argument term89:3456789:3456789:3456789:NoneFUGenerate an expression for a DataCon application occurring on the RHS of a let-binderFGenerate an expression for a term occurring on the RHS of a let-binder3Generate a component for a given function (caching);EGenerate a hierarchical netlist out of a set of global binders with  topEntity at the top.<0Run a NetlistMonad action in a given environment=)Generate a component for a given function?0Generate a list of Declarations for a let-binder@XGenerate a list of Declarations for a let-binder where the RHS is a function application #HWType of the LHS of the let-binderApplied DataConDataCon Arguments@Returned expression and a list of generate BlackBox declarations(Treat BlackBox expression as declaration!Type of the LHS of the let-binder Term to convert to an expression@Returned expression and a list of generate BlackBox declarationsName of the function$Starting value of the unique counter; (Starting number of the component counterGlobal bindersPrimitive definitions TyCon cache#Hardcoded Type -> HWType translator Symbol count"Name of the module containing the  topEntitySet of collected data-filesIntWordInteger bit-width  Name of the  topEntity< (Starting number of the component counterGlobal bindersPrimitive Definitions TyCon cache"Hardcode Type -> HWType translator"Name of the module containing the  topEntitySet of collected data-filesIntWordInteger bit-width Action to run=Name of the functionCorresponding term$Starting value of the unique counter>?LHS of the let-binderRHS of the let-binder@LHS of the let-binderName of the applied functionFunction argumentsA ;<=>?@A ;<=>?@A ;<=>?@A#NoneBgGenerate a HDL testbench for a component given a set of stimuli and a set of matching expected outputsB PrimitivesGlobal binders Stimuli Expected output "Name of the module containing the  topEntity Set of collected data-files Component to generate TB for !BBB !$(C) 2015, University of TwenteBSD2 (see the file LICENSE)-Christiaan Baaij <christiaan.baaij@gmail.com>NoneF CICreate a wrapper around a component, potentially initiating clock sourcesD(Create extra input ports for the wrapperE)Create extra output ports for the wrapperFGenerate input port mappingsG$Create a Vector chain for a list of sHGenerate output port mappingsICreate clock generatorsKCreate a single clock generatorMCreate a single clock pathNGenerate resetsOYGenerate a reset synchroniser that synchronously de-asserts an asynchronous reset signalPThe  NetListMonad is a transformer stack with " at the bottom. So we must use #.CTopEntity specifications"Name of the module containing the  topEntityIntWordInteger bit-widthEntity to wrapDEFGHIJKLMNOPCDEFGHIJKLMNOPCDEFGHIJKLMNOPCDEFGHIJKLMNOP%NoneNQ7Create a set of target HDL files for a set of functionsR(Pretty print Components to HDL DocumentsSPrepares the directory for writing HDL files. This means creating the dir if it does not exist and removing all existing .hdl files from it.T(Writes a HDL file to the given directoryQ Set of functions Primitive / BlackBox Definitions TyCon cacheTuple TyCon cache Hardcoded D ->  translator%Hardcoded evaluator (delta-reduction)-topEntity bndr + (maybe) TopEntity annotationtestInput bndr expectedOutput bndr 5Debug information level for the normalization processRBackendList of componentsSRemove existing HDL files File extension of the HDL files.TUQRSTUQRSTUQRSTU$/01234556789:;<=>?@ABCDEFGHIJKLMNOPQNRSTUVWXYZ[\]^_`abcdefghijklmno p q r s t u v w u x y v z { | } ~            w      V                ;~ !"#$%&'()*+,-./01E2234567889:;<=>?@ABCDEEFGHIJKLMNOPQRSTUVWXXY9Z[\]^_`abcdefggh?@ijklmnopLqrstuvwxyz{|T}U~      !"#$%&' ( ) * P + , - . / 0 1 2 3 4 5 6!7!8!9!:!;!<!=!>!?!@!A!B!C!D!E"F"G"H"I"J"K"L"MNOPQRST#U$V$W$X$Y$Z$[$\$]$^$_$`$a$b$c%d%e%f%g%h&i&j&k&l&m&n&o&p&q&r&s&t&uvwxyz{|}~'('')-....                                                       !"#$%&'()*+,-./012345#6#7#8#9#:#;<=>?clash_4e4jY9ooprfHcis7lwmB1b CLaSH.UtilCLaSH.Netlist.IdCLaSH.Netlist.BlackBox.TypesCLaSH.Netlist.BlackBox.ParserCLaSH.Primitives.TypesCLaSH.Core.TyConCLaSH.Core.TermCLaSH.Primitives.UtilCLaSH.Core.TypeCLaSH.Core.VarCLaSH.Core.DataConCLaSH.Core.TysPrimCLaSH.Core.LiteralCLaSH.Core.SubstCLaSH.Core.FreeVarsCLaSH.Core.PrettyCLaSH.Core.UtilCLaSH.Netlist.TypesCLaSH.Rewrite.TypesCLaSH.Driver.TypesCLaSH.Normalize.TypesCLaSH.Rewrite.CombinatorsCLaSH.Netlist.UtilCLaSH.Rewrite.UtilCLaSH.Normalize.UtilCLaSH.Normalize.DEC#CLaSH.Normalize.PrimitiveReductionsCLaSH.Normalize.TransformationsCLaSH.Normalize.StrategyCLaSH.Normalize CLaSH.Netlist CLaSH.BackendCLaSH.Netlist.BlackBox.UtilCLaSH.Netlist.BlackBoxCLaSH.Driver.TestbenchGenCLaSH.Driver.TopWrapper CLaSH.DriverPaths_clash_lib Control.Arrowfirstsecond Data.List partition mapAccumLData.Aeson.Extra&Unbound.Generics.LocallyNameless.Extralens_CdZx5sHs9EQARoyiYltihEControl.Lens.TH makeLenses mkBasicId mkBasicId'stripDollarPrefixesDeclElementCDOILSymClkRstTypTypMErrTypElemCompName IndexTypeSizeLengthFilePathGenIFIW64SigDBlackBoxTemplaterunParse PrimitiveBlackBoxnametemplateprimTypePrimMap$fFromJSONPrimitive TyConNameTyConTmNameTerm MonadUnique getUniqueMcurLoc makeCached makeCachedT3 makeCachedT3S liftStatefirstMsecondMcombineMtraceIf partitionM mapAccumLMdot ifThenElse<:> indexMaybe indexNote splitAtListclashLibVersionclog2$fMonadUniqueStateTgeneratePrimMapKiNameTyNameKindType mkTyConTyTyVarIdVarvarNamevarKindvarType modifyVarNameDcNameConTagDataConMkDatadcNamedcTagdcType dcUnivTyVars dcExtTyVarsdcArgTysdataConInstArgTys AlgTyConRhs DataTyCondataConsNewTyCondataCon ntEtadRhsAlgTyCon tyConName tyConKind tyConArityalgTcRhsFunTyCon tyConSubst PrimTyConSuperKindTyCon mkKindTyConisTupleTyConLike tyConDataConsliftedTypeKind typeNatKindtypeSymbolKind intPrimTy integerPrimTy charPrimTy stringPrimTy voidPrimTy wordPrimTy int64PrimTy word64PrimTy tysPrimMapLiteralIntegerLiteral IntLiteral WordLiteral Int64Literal Word64Literal StringLiteralRationalLiteral CharLiteral literalTypePatDataPatLitPat DefaultPat LetBindingDataPrimLamTyLamAppTyAppLetrecCasesubstTyssubstTy substKindWith substTyInTm substTysinTmsubstTmsubstTms KindOrTypeLitTyNumTySymTyConstTyArrowTypeViewFunTyTyConApp OtherTypeVarTyForAllTyAppTytyView transparentTycoreViewmkFunTy mkTyConAppsplitTyConAppMtypeKindisPolyTy splitFunTy splitFunTyssplitFunForallTy isPolyFunTyisPolyFunCoreTyisFunTy applyFunTyapplyTy findFunSubst typeFreeVars termFreeIdstermFreeTyVarsPrettypprpprPrecshowDocDeltaGammatermType collectArgs collectBndrsapplyTypeToArgspatIdsmkTyVarmkId mkAbstractionmkTyLamsmkLamsmkAppsmkTmAppsmkTyAppsisFun isPolyFunisLamisLetisVarisConisPrimidToVarvarToIdtermSizemkVec appendToVec extractElems isSignalType tyNatSizeSyncExprSyncIdentifierBlackBoxContextContextbbResultbbInputs bbFunctionsBitHUZNumLitBitLitBoolLitVecLit StringLitExpr IdentifierDataTag BlackBoxEModifierIndexedDC VecAppend Declaration AssignmentCondAssignmentInstDecl BlackBoxDNetDeclHWTypeVoidStringBool BitVectorIndexSignedUnsignedVectorSumProductSPClockReset Component componentName hiddenPortsinputsoutputs declarations NetlistState _bindings_varEnv _varCount _cmpCount _components _primitives_typeTranslator_tcCache_modNm _curCompNm _dataFiles _intWidth NetlistMonad runNetlistemptyBBContext$fNFDataDeclaration$fNFDataHWType$fHashableHWType$fNFDataComponentbindingscmpCount components curCompNm dataFilesintWidthmodNm primitivestcCachetypeTranslatorvarCountvarEnv RewriteState_transformCounter _uniqSupply_curFun _nameCounter_extra CoreContextAppFunAppArgTyAppCLetBodyLamBody TyLamBodyCaseAlt CaseScrut RewriteEnv _dbgLevel _tupleTcCache _evaluator DebugLevel DebugNone DebugFinal DebugName DebugAppliedDebugAllcurFunextra nameCountertransformCounter uniqSupplyRewrite Transform RewriteMonadRrunRdbgLevel evaluator tupleTcCache$fMonadFixRewriteMonad#$fMonadReaderRewriteEnvRewriteMonad$fMonadWriterAnyRewriteMonad$fMonadUniqueRewriteMonad$fFreshRewriteMonad$$fMonadStateRewriteStateRewriteMonad$fMonadRewriteMonad$fApplicativeRewriteMonad$fFunctorRewriteMonad CLaSHOptsopt_inlineLimit opt_specLimitopt_inlineBelow opt_dbgLevel opt_cleanhdl opt_intWidth BindingMapNormalizeState _normalized_specialisationCache_specialisationHistory_specialisationLimit_inlineHistory _inlineLimit _inlineBelow NormRewriteNormalizeSessionNormalizeMonad inlineBelow inlineHistory inlineLimit normalizedspecialisationCachespecialisationHistoryspecialisationLimitallR>->>-!->topdownRunsafeTopdownR bottomupRunsafeBottomupR!->>-!repeatRwhenR bottomupWhenRsplitNormalizedunsafeCoreTypeToHWTypeunsafeCoreTypeToHWTypeMcoreTypeToHWTypeMsynchronizedClkcoreTypeToHWTypemkADT isRecursiveTyrepresentableTypetypeSizeconSize typeLength termHWType termHWTypeM varToExprmkUniqueNormalized appendToNamepreserveVarEnv dcToLiteral zoomExtraapply runRewriterunRewriteSession setChangedchanged contextEnvmkEnv mkTmBinderFor mkBinderFor mkInternalVar inlineBinders isJoinPointIn tailCallssubstituteBinders localFreeIds liftBinders liftBinding mkFunction addGlobalBindcloneVar isLocalVarisUntranslatableisUntranslatableTypeisLambdaBodyCtxmkWildValBindermkSelectorCase specialise specialise'specArgBndrsAndVarsalreadyInlined addNewInlinespecializeNormisClosed isConstant callGraphrecursiveComponentslambdaDropPrep lambdaDrop dominator blockSink isDisjointcollectGlobalsmkDisjointGroup reduceZipWith reduceMapreduceTraverse mkTravVec reduceFoldr reduceFold reduceDFold reduceHead reduceTail reduceAppendreduceUnconcatreduceTransposereduceReplicate bindNonRep liftNonReptypeSpec nonRepSpeccaseLetcaseCase inlineNonRepcaseCon nonRepANFtopLetdeadCodebindConstantVar inlineClosed inlineSmall constantSpecappPropcaseFlatmakeANFetaExpansionTL recToLetRecinlineHO simpleCSE reduceConstreduceNonRepPrimdisjointExpressionConsolidation normalizationconstantPropgation topdownSucR innerMost applyManyCallTreeCLeafCBranchrunNormalization normalize normalize' rewriteExprcheckNonRecursive cleanupGraph mkCallTree stripArgs flattenNodeflattenCallTreecallTreeToListmkDcApplicationmkExpr genComponentBackend initBackendprimDir extension extractTypesgenHDL mkTyPackagehdlTypehdlTypeErrValue hdlTypeMarkhdlSiggenStmtinstexpriwWidthverifyBlackBoxContextextractLiteralssetSym setCompName setClocksfindAndSetDataFilesrenderFilePath clkSyncIdrenderBlackBox renderElem parseFailsyncIdToSyncExprlineToIdentifier lineToType renderTagmkBlackBoxContextprepareBlackBox mkArgument mkPrimitive mkFunInputinstantiateSyminstantiateCompNamecollectFilePaths genNetlistrunNetlistMonad genComponentTgenComponentNamemkDeclarationsmkFunApp toSimpleVar genTestBench mkTopWrapperextraInextraOutmkInput mkVectorChainmkOutputmkClocks stringToVarmkClock mkClockDecl clockPortsmkResets genSyncResetunsafeRunNetlist generateHDL createHDL prepareDirwriteHDL copyDataFilescatchIOversionbindirlibdirdatadir libexecdir sysconfdir getBinDir getLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName EncodedString UserStringzEncode encodeDigitChencodeChencodeAsUnicodeChar unencodedChar maybeTuple countCommas pBlackBoxDpElementpTextpTagDpDeclpOutputpInputpTagE pBracketspTokenWS pBlackBoxEpElemEpSigD pLimitedTextParserghc-prim GHC.TypesTruebaseGHC.BaseNothing<*>pure Applicative Data.Functor<$> Control.Monad<=<>=>*** Data.FunctionondecodeAndReport $fSubstbText $fAlphaText$fHashableName $fSubstbRatio$fSubstTypeVar$fSubstTermVar $fAlphaVar$fSubstaDataCon$fAlphaDataCon $fOrdDataCon $fEqDataCon $fShowDataCon $fAlphaTyCon $fOrdTyCon $fEqTyCon $fShowTyContySuperKindTyConNameliftedTypeKindTyConNametypeNatKindTyConNametypeSymbolKindTyConName tySuperKindtcliftedTypeKindtc typeNatKindtctypeSymbolKindtc intPrimTc integerPrimTc charPrimTc stringPrimTc voidPrimTc wordPrimTc int64PrimTc word64PrimTc tySuperKindintPrimTyConNameintegerPrimTyConNamestringPrimTyConNamecharPrimTyConNamevoidPrimTyConNamewordPrimTyConNameint64PrimTyConNameword64PrimTyConName liftedPrimTC$fSubstaLiteral$fAlphaLiteral$fSubstTypeTerm$fSubstTermTerm$fSubstTermPat$fSubstTypePat $fAlphaTerm $fOrdTerm$fEqTermnewTyConInstRhs isSuperKind splitTyAppM kindFunResult funSubstsfunSubst $fOrdType$fEqType$fSubstTypeType$fSubstTermType$fSubstaConstTy $fSubstaLitTy $fAlphaTypeTypePrecTopPrecFunPrec TyConPrec BindingSite LambdaBindCaseBindLetBindnoPrecopPrecappPrec prettyParenpprTopLevelBndrdcolonperiodrarrow pprPrecLam pprPrecTyLam pprPrecApp pprPrecTyApp pprPrecLetrec pprPrecCase pprPrecAltpprBndr maybeParenpprType pprParendTypeppr_type pprForAllType pprSigmaType pprForAll pprTvBndrpprKindpprTcApppprTypeNameApp pprInfixApp pprPrefixApp pprPrefixVar pprInfixVar pprArrowChain isSymNameisLexSym isLexConSym isLexVarSym startsConSym startsVarSym isSymbolASCII $fPrettyPat$fPrettyLiteral$fPrettyDataCon $fPrettyVar $fPrettyTerm $fPrettyLitTy $fPrettyTyCon $fPrettyVar0 $fPrettyType $fPretty(,) $fPretty[] $fPrettyNameunbou_Dm9nwTQM44PGMCFNj4SekB&Unbound.Generics.LocallyNameless.FreshFreshCaseTreeallEqualcollectGlobalsArgscollectGlobalsAltscollectGlobalsLbsdisJointSelProjJustmkDJArgsgenCaseinterestingToLiftLeafLBBranch removeEmptyisCommonfmap NormRewriteW caseOneAlt collectFlatisEq isFromInt collectANFreduceBindersFix reduceBindersgenClockgenReset genFinishgenDone genStimuli genVerifierIOGHC.IOunsafePerformIO