package codex
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
The Codex library for building static analysers based on abstract interpretation
Install
dune-project
Dependency
Authors
Maintainers
Sources
1.0-rc4.tar.gz
md5=bc7266a140c6886add673ede90e335d3
sha512=8da42c0ff2c1098c5f9cb2b5b43b306faf7ac93b8f5ae00c176918cee761f249ff45b29309f31a05bbcf6312304f86a0d5a000eb3f1094d3d3c2b9b4c7f5c386
doc/src/codex.operator/flags.ml.html
Source file flags.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74(**************************************************************************) (* This file is part of the Codex semantics library. *) (* *) (* Copyright (C) 2013-2025 *) (* CEA (Commissariat à l'énergie atomique et aux énergies *) (* alternatives) *) (* *) (* you can redistribute it and/or modify it under the terms of the GNU *) (* Lesser General Public License as published by the Free Software *) (* Foundation, version 2.1. *) (* *) (* It is distributed in the hope that it will be useful, *) (* but WITHOUT ANY WARRANTY; without even the implied warranty of *) (* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *) (* GNU Lesser General Public License for more details. *) (* *) (* See the GNU Lesser General Public License version 2.1 *) (* for more details (enclosed in the file LICENSE). *) (* *) (**************************************************************************) (* We pack the flags as a single integer, not only for performance, but also so that it is easy to add or remove flags. *) (* Note: - nsw means no signed wrap: the result does not overflow in a signed representation. - nuw means no unsigned wrap: the result does not overflow in an unsigned representation. - nusw means no unsigned/signed wrap: the first argument is unsigned, the second is signed, and the computation must not overflow. *) module Bimul:sig type t = private int type unpacked = {nsw:bool;nuw:bool} val pack: nsw:bool -> nuw:bool -> t val unpack: t -> unpacked end = struct type t = int type unpacked = {nsw:bool;nuw:bool} let pack ~nsw ~nuw = (if nuw then 2 else 0) + (if nsw then 1 else 0) let is_nsw f = (f land 1) = 1 let is_nuw f = (f land 2) = 2 let unpack f = {nsw=is_nsw f;nuw=is_nuw f} end module Bshl:module type of Bimul = Bimul module Biadd:sig type t = private int type unpacked = {nsw:bool;nuw:bool;nusw:bool} val no_overflow: t val pack: nsw:bool -> nuw:bool -> nusw:bool -> t val unpack: t -> unpacked val is_nsw: t -> bool val is_nuw: t -> bool end = struct type t = int type unpacked = {nsw:bool;nuw:bool;nusw:bool} let pack ~nsw ~nuw ~nusw = (if nusw then 4 else 0) lor (if nuw then 2 else 0) lor (if nsw then 1 else 0) let no_overflow = pack ~nsw:false ~nuw:false ~nusw:false let is_nsw f = (f land 1) = 1 let is_nuw f = (f land 2) = 2 let is_nusw f = (f land 4) = 4 let unpack f = {nsw=is_nsw f;nuw=is_nuw f;nusw=is_nusw f} end module Bisub = Biadd
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>