Module Flambda_primitive.Eligible_for_cse
Primitive applications that may be replaced by a variable which is let bound to a single instance of such application. Primitives that are genuine projections (e.g. Block_load, etc.) are not eligible, since the associated information is propagated through types, not CSE.
include Flambda2_nominal.Contains_names.S
with type t := Flambda2_terms.Flambda_primitive.Eligible_for_cse.t
val free_names :
Flambda2_terms.Flambda_primitive.Eligible_for_cse.t ->
Flambda2_nominal.Name_occurrences.tCompute the free names of a term. Such computation covers all kinds of bindable names (variables, continuations, ...)
val apply_renaming :
Flambda2_terms.Flambda_primitive.Eligible_for_cse.t ->
Flambda2_nominal.Renaming.t ->
Flambda2_terms.Flambda_primitive.Eligible_for_cse.tApply a renaming throughout a term.
val create_is_int :
variant_only:bool ->
immediate_or_block:Flambda2_identifiers.Name.t ->
Flambda2_terms.Flambda_primitive.Eligible_for_cse.tval create_get_tag :
block:Flambda2_identifiers.Name.t ->
Flambda2_terms.Flambda_primitive.Eligible_for_cse.tval eligible : Flambda2_terms.Flambda_primitive.primitive_application -> boolval fold_args :
Flambda2_terms.Flambda_primitive.Eligible_for_cse.t ->
init:'a ->
f:('a -> Flambda2_term_basics.Simple.t -> 'a * Flambda2_term_basics.Simple.t) ->
'a * Flambda2_terms.Flambda_primitive.Eligible_for_cse.tval filter_map_args :
Flambda2_terms.Flambda_primitive.Eligible_for_cse.t ->
f:(Flambda2_term_basics.Simple.t -> Flambda2_term_basics.Simple.t option) ->
Flambda2_terms.Flambda_primitive.Eligible_for_cse.t optioninclude Flambda2_algorithms.Container_types.S
with type t := Flambda2_terms.Flambda_primitive.Eligible_for_cse.t
include Flambda2_algorithms.Container_types_intf.Thing
with type t := Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t
include Stdlib.Hashtbl.HashedType
with type t := Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t
val equal :
Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t ->
Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t ->
boolThe equality predicate used to compare keys.
val hash : Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t -> intA hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include
- (
(=),hash) for comparing objects by structure (provided objects do not contain floats) - (
(fun x y -> compare x y = 0),hash) for comparing objects by structure and handlingStdlib.nancorrectly - (
(==),hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
include Stdlib.Map.OrderedType
with type t := Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t
val compare :
Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t ->
Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t ->
intA total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.
val print :
Stdlib.Format.formatter ->
Flambda2_terms.Flambda_primitive.Eligible_for_cse.T.t ->
unit