package frama-c

  1. Overview
  2. Docs
Platform dedicated to the analysis of source code written in C

Install 

dune-project
 Dependency

frama-c.com Readme Edit opam file Versions (25)

Authors

  1. M
    Michele Alberti
  2. T
    Thibaud Antignac
  3. G
    Gergö Barany
  4. P
    Patrick Baudin
  5. T
    Thibaut Benjamin
  6. A
    Allan Blanchard
  7. L
    Lionel Blatter
  8. F
    François Bobot
  9. R
    Richard Bonichon
  10. Q
    Quentin Bouillaguet
  11. D
    David Bühler
  12. Z
    Zakaria Chihani
  13. L
    Loïc Correnson
  14. J
    Julien Crétin
  15. P
    Pascal Cuoq
  16. Z
    Zaynah Dargaye
  17. B
    Basile Desloges
  18. J
    Jean-Christophe Filliâtre
  19. P
    Philippe Herrmann
  20. M
    Maxime Jacquemin
  21. F
    Florent Kirchner
  22. A
    Alexander Kogtenkov
  23. T
    Tristan Le Gall
  24. J
    Jean-Christophe Léchenet
  25. M
    Matthieu Lemerre
  26. D
    Dara Ly
  27. D
    David Maison
  28. C
    Claude Marché
  29. A
    André Maroneze
  30. T
    Thibault Martin
  31. F
    Fonenantsoa Maurica
  32. M
    Melody Méaulle
  33. B
    Benjamin Monate
  34. Y
    Yannick Moy
  35. A
    Anne Pacalet
  36. V
    Valentin Perrelle
  37. G
    Guillaume Petiot
  38. D
    Dario Pinto
  39. V
    Virgile Prevosto
  40. A
    Armand Puccetti
  41. F
    Félix Ridoux
  42. V
    Virgile Robles
  43. M
    Muriel Roger
  44. J
    Julien Signoles
  45. N
    Nicolas Stouls
  46. K
    Kostyantyn Vorobyov
  47. B
    Boris Yakobowski

Maintainers

  1. F
    frama-ci-bot@frama-c.com

Sources

frama-c-27.0-beta-Cobalt.tar.gz
sha256=9c1b14a689ac8ccda9e827c2eede13bb8d781fb8e4e33c1b5360408e312127d2

doc/frama-c.kernel/Frama_c_kernel/Bitvector/index.html

Module Frama_c_kernel.Bitvector

Bitvectors.

  • since Carbon-20101201
type t
val create : int -> t

Create a vector of n bits, with all bits unset.

val create_set : int -> t

Create a vector of n bits, with all bits set.

val capacity : t -> int

Maximum number of bits in the bitvector.

val resize : int -> t -> t

A copy of the bitvector up-to or down-to n bits. Extra bits up to final bitvector capacity are set to zero.

val mem : t -> int -> bool
val set : t -> int -> unit
val clear : t -> int -> unit
val once : t -> int -> bool

return true if unset, then set the bit.

val set_range : t -> int -> int -> unit
val is_empty : t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val hash : t -> int

Bitwise Binary Operations

The first argument is the size of the vectors.

val bnot : int -> t -> t
val band : int -> t -> t -> t
val bor : int -> t -> t -> t
val bxor : int -> t -> t -> t
val beq : int -> t -> t -> t

Generic Bitwise Operations

.

Prefer using these rather than create intermediary bitvectors.

val bitwise_op2 : int -> (int -> int -> int) -> t -> t -> t
val bitwise_op3 : int -> (int -> int -> int -> int) -> t -> t -> t -> t
val bitwise_op4 : int -> (int -> int -> int -> int -> int) -> t -> t -> t -> t -> t

Sized Concatenation

val concat : t -> int -> t -> int -> t

concat b1 s1 b2 s2 concatenates the s1 first bits of b1 with the s2 first bits of b2.

Misc

val iter_true : (int -> unit) -> t -> unit

Iterates on all indexes of the bitvector with their bit set.

val fold_true : ('a -> int -> 'a) -> 'a -> t -> 'a

Iterates on all indexes of the bitvector with their bit set.

val find_next_true : t -> int -> int

find_next_true i a returns the first index greater or equal to i with its bit set. To find the first true element, call find_next_true -1 a. If no next true element exists, or i is larger than the array, then raise Not_found.

val pretty : Format.formatter -> t -> unit

Bit vector, as blocs of 8-bits separated by space, first bits to last bits from left to right.

val pp_bits : Format.formatter -> int -> unit

0b... format, for bytes only, most significant bits on left.