package dolmen
Module Builtin.BitvSource
type _ t = | T of {}(*
*)Bitv.T{n}: ttype: type constructor for bitvectors of lengthn. Ensures thatn > 0.| Binary_lit of string(*
*)Lit s: Bitv.T: bitvector litteral. The stringsshould be a binary representation of bitvectors using characters'0', and'1'(lsb last)| To_int of {}(*
*)To_int{n; signed; }: Bitv.T{n} -> Int: conversion from bitvectors to signed integers.| Of_int of {}(*
*)Of_int{n}: Int -> Bitv.T{n}: conversion fromm (signed) integers to bitvectors.| Concat of {}(*
*)Concat{n;m}: Bitv.T{n} -> Bitv.T{m} -> Bitv.T{n+m}: concatenation operator on bitvectors.| Extract of {}(*
*)Extract{n; i; j}: Bitv.T{n} -> Bitv.T{i - j + 1}: bitvector extraction, from indexjup toi(both included). Ensures that0 <= j <= i < n.| Repeat of {}(*
*)Repeat{n;k}: Bitv.T{n} -> Bitv.T{n*k}: bitvector repeatition.| Zero_extend of {}(*
*)Zero_extend{n;k}: Bitv.T{n} -> Bitv.T{n + k}: zero extension for bitvectors (produces a representation of the same unsigned integer).| Sign_extend of {}(*
*)Sign_extend{n;k}: Bitv.T{n} -> Bitv.T{n + k}: sign extension for bitvectors ((produces a representation of the same signed integer).| Rotate_right of {}(*
*)Rotate_right{n;i}: Bitv.T{n} -> Bitv.T{n}: logical rotate right for bitvectors byi.| Rotate_left of {}(*
*)Rotate_left{n;i}: Bitv.T{n} -> Bitv.T{n}: logical rotate left for bitvectors byi.| Not of {}(*
*)Not{n}: Bitv.T{n} -> Bitv.T{n}: bitwise negation for bitvectors.| And of {}(*
*)And{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: bitwise conjunction for bitvectors.| Or of {}(*
*)Or{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: bitwise disjunction for bitvectors.| Nand of {}(*
*)Nand{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: bitwise negated conjunction for bitvectors.Nand s tabbreviatesNot (And s t)).| Nor of {}(*
*)Nor{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: bitwise negated disjunction for bitvectors.Nor s tabbreviatesNot (Or s t)).| Xor of {}(*
*)Xor{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: bitwise exclusive disjunction for bitvectors.Xor s tabbreviatesOr (And s (Not t)) (And (Not s) t).| Xnor of {}(*
*)Xnor{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: bitwise negated exclusive disjunction for bitvectors.Xnor s tabbreviatesOr (And s t) (And (Not s) (Not t)).| Comp of {}(*
*)Comp{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{1}: Returns the constant bitvector"1"is all bits are equal, and the bitvector"0"if not.| Neg of {}(*
*)Neg{n}: Bitv.T{n} -> Bitv.T{n}: 2's complement unary minus.| Add of {}(*
*)Add{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: addition modulo 2^n.| Sub of {}(*
*)Sub{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: 2's complement subtraction modulo 2^n.| Mul of {}(*
*)Mul{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: multiplication modulo 2^n.| Udiv of {}(*
*)Udiv{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: unsigned division, truncating towards 0.| Urem of {}(*
*)Urem{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: unsigned remainder from truncating division.| Sdiv of {}(*
*)Sdiv{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: 2's complement signed division.| Srem of {}(*
*)Srem{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: 2's complement signed remainder (sign follows dividend).| Smod of {}(*
*)Smod{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: 2's complement signed remainder (sign follows divisor).| Shl of {}(*
*)Shl{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: shift left (equivalent to multiplication by 2^x where x is the value of the second argument).| Lshr of {}(*
*)Lshr{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: logical shift right (equivalent to unsigned division by 2^x, where x is the value of the second argument).| Ashr of {}(*
*)Ashr{n}: Bitv.T{n} -> Bitv.T{n} -> Bitv.T{n}: Arithmetic shift right, like logical shift right except that the most significant bits of the result always copy the most significant bit of the first argument.| Ult of {}(*
*)Ult{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for unsigned less-than.| Ule of {}(*
*)Ule{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for unsigned less than or equal.| Ugt of {}(*
*)Ugt{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for unsigned greater-than.| Uge of {}(*
*)Uge{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for unsigned greater than or equal.| Slt of {}(*
*)Slt{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for signed less-than.| Sle of {}(*
*)Sle{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for signed less than or equal.| Sgt of {}(*
*)Sgt{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for signed greater-than.| Sge of {}(*
*)Sge{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary predicate for signed greater than or equal.| Overflow_neg of {}(*
*)Overflow_neg{n} : Bitv.T{n} -> Prop.T: unary overflow predicate for signed unary minus (i.e. returnstrueif the negation would overflow)| Overflow_add of {}(*
*)Overflow_add{n;signed} : Bitv.T{n} -> Bitv.T{n} -> Prop.T: binary overflow predicate for signed/unsigned addition (i.e. returnstrueif the operation would overflow)| Overflow_sub of {}(*
*)Overflow_sub{n;signed}: Bitv.T{n} -> Bitv.T{n} -> Prop.T binary overflow predicate for signed/unsigned subtraction (i.e. returns [true] if the operation would overflow)| Overflow_mul of {}(*
*)Overflow_mul{n;signed}: Bitv.T{n} -> Bitv.T{n} -> Prop.T binary overflow predicate for signed/unsigned multiplication (i.e. returns [true] if the operation would overflow)| Overflow_div of {}(*
*)Overflow_div{n}: Bitv.T{n} -> Bitv.T{n} -> Prop.T binary overflow predicate for signed division (i.e. returns [true] if the operation would overflow)