Module Cse.ExprSource

Sourcetype nonrec size = Binsec_base.Term.size
Sourcetype nonrec 'a interval = 'a Binsec_base.Term.interval = {
  1. lo : 'a;
  2. hi : 'a;
}
Sourcetype nonrec endianness = Binsec_base.Term.endianness =
  1. | LittleEndian
  2. | BigEndian
Sourcetype ('k, 'a, 'b) term = private ('k, 'a, 'b) Binsec_base.Term.t =
  1. | Var : {
    1. hash : int;
    2. size : size;
    3. name : string;
    4. label : 'a;
    } -> ([< `Var | `Loc | `Exp ], 'a, _) term
  2. | Load : {
    1. hash : int;
    2. len : size;
    3. dir : endianness;
    4. mutable addr : ([ `Exp ], 'a, 'b) term;
    5. label : 'b;
    } -> ([< `Mem | `Loc | `Exp ], 'a, 'b) term
  3. | Cst : Binsec_base.Bitvector.t -> ([< `Cst | `Exp ], _, _) term
  4. | Unary : {
    1. hash : int;
    2. size : size;
    3. f : Binsec_base.Term.unary Binsec_base.Term.operator;
    4. mutable x : ([ `Exp ], 'a, 'b) term;
    } -> ([< `Unary | `Exp ], 'a, 'b) term
  5. | Binary : {
    1. hash : int;
    2. size : size;
    3. f : Binsec_base.Term.binary Binsec_base.Term.operator;
    4. mutable x : ([ `Exp ], 'a, 'b) term;
    5. mutable y : ([ `Exp ], 'a, 'b) term;
    } -> ([< `Binary | `Exp ], 'a, 'b) term
  6. | Ite : {
    1. hash : int;
    2. size : size;
    3. mutable c : ([ `Exp ], 'a, 'b) term;
    4. mutable t : ([ `Exp ], 'a, 'b) term;
    5. mutable e : ([ `Exp ], 'a, 'b) term;
    } -> ([< `Ite | `Exp ], 'a, 'b) term
Sourcetype t = ([ `Exp ], Source.t, Layer.t) term

Smart constructors

Sourceval var : string -> size -> Source.t -> t

var name bitsize label

Sourceval load : size -> endianness -> t -> Layer.t -> t

load nbytes endianness addr label

constant bv creates a constant expression from the bitvector bv.

unary f x creates a unary application of f on x.

Sourceval binary : Binsec_base.Term.binary op -> t -> t -> t

binary f x y creates a binary application of f on x and y.

Sourceval ite : t -> t -> t -> t

ite c t e creates an if-then-else expression c ? t : e.

Sourceval uminus : t -> t
Sourceval add : t -> t -> t
Sourceval sub : t -> t -> t
Sourceval mul : t -> t -> t
Sourceval srem : t -> t -> t
Sourceval urem : t -> t -> t
Sourceval udiv : t -> t -> t
Sourceval sdiv : t -> t -> t
Sourceval append : t -> t -> t
Sourceval equal : t -> t -> t
Sourceval diff : t -> t -> t
Sourceval ule : t -> t -> t
Sourceval uge : t -> t -> t
Sourceval ult : t -> t -> t
Sourceval ugt : t -> t -> t
Sourceval sle : t -> t -> t
Sourceval sge : t -> t -> t
Sourceval slt : t -> t -> t
Sourceval sgt : t -> t -> t
Sourceval logand : t -> t -> t
Sourceval logor : t -> t -> t
Sourceval lognot : t -> t
Sourceval logxor : t -> t -> t
Sourceval shift_left : t -> t -> t
Sourceval shift_right : t -> t -> t
Sourceval shift_right_signed : t -> t -> t

shift_(left|right) e q shifts expression e by quantity q, padding with zeroes

Sourceval rotate_left : t -> t -> t
Sourceval rotate_right : t -> t -> t

rotate_(left|right) e q rotates expression e by quantity q

Sourceval sext : size -> t -> t

sext sz e performs a signed extension of expression e to size sz

Sourceval uext : size -> t -> t

uext sz e performs an unsigned extension expression e to size sz

Sourceval restrict : lo:int -> hi:int -> t -> t

restrict lo hi e creates Dba.ExprUnary(Restrict(lo, hi), e) if hi >= lo && lo >=0.

Sourceval bit_restrict : int -> t -> t

bit_restrict o e is restrict o o e

Sourceval byte_swap : t -> t

byte_swap e reverses the byte order of the expression e

Specific constants

Sourceval zeros : int -> t

zeros n creates a constant expression of value 0 with length n

Sourceval ones : int -> t

ones n creates a constant expression of value 1 with length n. I.e.; it has (n - 1) zeros in binary.

Sourceval one : t
Sourceval zero : t
Sourceval addi : t -> int -> t
Sourceval addz : t -> Z.t -> t
Utils
Sourceval hash : t -> int

hash t returns the hash of t in constant time.

Sourceval is_equal : t -> t -> bool
Sourceval compare : t -> t -> int
Sourceval sizeof : t -> size

sizeof t returns the bit size of t in constant time.

Sourceval map : (string -> int -> 'a -> t) -> (int -> Binsec_base.Machine.endianness -> t -> 'b -> t) -> (_, 'a, 'b) term -> t
Sourceval _unary : Binsec_base.Term.unary op -> t -> t

Raw constructors

_unary f x creates a unary application of f on x.

Sourceval _binary : Binsec_base.Term.binary op -> t -> t -> t

_binary f x y creates a binary application of f on x and y.

Sourceval _ite : t -> t -> t -> t

_ite c t e creates an if-then-else expression c ? t : e.