package goblint

  1. Overview
  2. Docs
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module BitfieldDomain.BitfieldArith

Parameters

Signature

include sig ... end
val (&:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (|:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (^:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (!:) : Ints_t.t -> Ints_t.t
val (<<:) : Ints_t.t -> int -> Ints_t.t
val (>>:) : Ints_t.t -> int -> Ints_t.t
val (<:) : Ints_t.t -> Ints_t.t -> bool
val (=:) : Ints_t.t -> Ints_t.t -> bool
val (>:) : Ints_t.t -> Ints_t.t -> bool
val (<>:) : Ints_t.t -> Ints_t.t -> bool
val (+:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (-:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (*:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (/:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (%:) : Ints_t.t -> Ints_t.t -> Ints_t.t
val (>>.) : Ints_t.t -> int -> Ints_t.t
val zero_mask : Ints_t.t
val one_mask : Ints_t.t
val of_int : Ints_t.t -> Ints_t.t * Ints_t.t
val join : (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val meet : (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val one : Ints_t.t * Ints_t.t
val zero : Ints_t.t * Ints_t.t
val top_bool : Ints_t.t * Ints_t.t
val bits_known : (Ints_t.t * Ints_t.t) -> Ints_t.t
val bits_invalid : (Ints_t.t * Ints_t.t) -> Ints_t.t
val is_const : (Ints_t.t * Ints_t.t) -> bool
val is_invalid : (Ints_t.t * Ints_t.t) -> bool
val nabla : Ints_t.t -> Ints_t.t -> Ints_t.t
val widen : (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val lognot : ('a * 'b) -> 'b * 'a
val logxor : (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val logand : (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val logor : (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val bitmask_up_to : int -> Ints_t.t
val min : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> Z.t
val max : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> Z.t
val concretize : (Ints_t.t * Ints_t.t) -> int list
val bit_width_of : GoblintCil.Cil.ikind -> int
val constrain_to_bit_width_of : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val join_shifts : (GoblintCil.Cil.ikind -> 'a -> int -> Ints_t.t * Ints_t.t) -> GoblintCil.Cil.ikind -> 'a -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val shift_left : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val shift_right : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> (Ints_t.t * Ints_t.t) -> Ints_t.t * Ints_t.t
val nth_bit : Ints_t.t -> int -> Ints_t.t
val is_power_of_two : Ints_t.t -> bool
val has_neg_values : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> bool
val has_only_neg_values : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> bool
val exceeds_bit_width_of : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> bool
val equals_bit_width_of : GoblintCil.Cil.ikind -> (Ints_t.t * Ints_t.t) -> bool
OCaml

Innovation. Community. Security.