Module `Flambda_primitive.Eligible_for_cse`

type t

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 := t

val free_names : t -> Flambda2_nominal.Name_occurrences.t

Compute the free names of a term. Such computation covers all kinds of bindable names (variables, continuations, ...)

val apply_renaming : t -> Flambda2_nominal.Renaming.t -> t

Apply a renaming throughout a term.

val create : primitive_application -> t option

val create_exn : primitive_application -> t

val create_is_int : 
  variant_only:bool ->
  immediate_or_block:Flambda2_identifiers.Name.t ->
  t

val create_get_tag : block:Flambda2_identifiers.Name.t -> t

val eligible : primitive_application -> bool

val to_primitive : t -> primitive_application

val fold_args : 
  t ->
  init:'a ->
  f:('a -> Flambda2_term_basics.Simple.t -> 'a * Flambda2_term_basics.Simple.t) ->
  'a * t

val filter_map_args : 
  t ->
  f:(Flambda2_term_basics.Simple.t -> Flambda2_term_basics.Simple.t option) ->
  t option

include Flambda2_algorithms.Container_types.S with type t := t

module T : Flambda2_algorithms.Container_types_intf.Thing with type t = t

include Flambda2_algorithms.Container_types_intf.Thing with type t := T.t

include Hashtbl.HashedType with type t := T.t

val equal : T.t -> T.t -> bool

The equality predicate used to compare keys.

val hash : T.t -> int

A 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 handling Stdlib.nan correctly
((==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).

include Map.OrderedType with type t := T.t

val compare : T.t -> T.t -> int

A 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 : Format.formatter -> T.t -> unit

module Set : Flambda2_algorithms.Container_types_intf.Set with type elt = t

module Map : 
  Flambda2_algorithms.Container_types_intf.Map
    with type key = t
     and module Set = Set

Module Flambda_primitive.Eligible_for_cse

Module `Flambda_primitive.Eligible_for_cse`