package binsec
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Semantic analysis of binary executables
Install
dune-project
Dependency
Authors
-
AAdel Djoudi
-
BBenjamin Farinier
-
CChakib Foulani
-
DDorian Lesbre
-
FFrédéric Recoules
-
GGuillaume Girol
-
JJosselin Feist
-
LLesly-Ann Daniel
-
MMahmudul Faisal Al Ameen
-
MManh-Dung Nguyen
-
MMathéo Vergnolle
-
MMathilde Ollivier
-
MMatthieu Lemerre
-
NNicolas Bellec
-
OOlivier Nicole
-
RRichard Bonichon
-
RRobin David
-
SSébastien Bardin
-
SSoline Ducousso
-
TTa Thanh Dinh
-
YYaëlle Vinçont
-
YYanis Sellami
Maintainers
Sources
binsec-0.11.0.tbz
sha256=4cf70a0367fef6f33ee3165f05255914513ea0539b94ddfef0bd46fc9b42fa8a
sha512=cd67a5b7617f661a7786bef0c828ee55307cef5260dfecbb700a618be795d81b1ac49fc1a18c4904fd2eb8a182dc862b0159093028651e78e7dc743f5babf9e3
doc/src/binsec.base/binstream.ml.html
Source file binstream.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 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137(**************************************************************************) (* This file is part of BINSEC. *) (* *) (* Copyright (C) 2016-2026 *) (* 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 licenses/LGPLv2.1). *) (* *) (**************************************************************************) type t = int Sequence.t (* The list is stored in reversed order *) let length = Sequence.length let empty = Sequence.empty let is_byte_value n = n >= 0 && n < 256 let iteri f s = let i = ref 0 in Sequence.iter_forward (fun x -> f !i x; incr i) s let get_byte_exn t n = let exception Byte_found of int in if n < 0 || n > length t then raise Not_found else let find m x = if m = n then raise (Byte_found x) in try iteri find t; raise Not_found with Byte_found x -> x let get_byte t n = match get_byte_exn t n with by -> Some by | exception Not_found -> None let value_of c = let cc = Char.code c in if c <= '9' then cc - Char.code '0' else 10 + cc - Char.code 'a' let add_zeros hs = let len = String.length hs in if len mod 2 = 0 then hs else let b = Buffer.create 8 in let rec add_zero len = if len mod 2 = 0 then Buffer.contents b ^ hs else ( Buffer.add_char b '0'; add_zero (len + 1)) in add_zero len let append_int n h = assert (is_byte_value n); Sequence.push_back n h let append_int64 n64 h = let n = Int64.to_int n64 in append_int n h let prepend_int n h = assert (is_byte_value n); Sequence.push_front n h let prepend_int64 n64 h = prepend_int (Int64.to_int n64) h let prepend_char c = prepend_int (Char.code c) let append_char c = append_int (Char.code c) let of_list l = List.fold_left (fun seq e -> prepend_int e seq) empty l let of_bytes s = let len = String.length s in let rec loop acc idx = if idx >= len then acc else let byte = s.[idx] in let ascii = Char.code byte in let acc = prepend_int ascii acc in loop acc (idx + 1) in loop empty 0 let clean_string s = let len = String.length s in let b = Buffer.create len in (* len is the upper bound *) for i = 0 to len - 1 do let c = s.[i] in if c <> ' ' then Buffer.add_char b (Char.lowercase_ascii c) done; Buffer.contents b let of_nibbles s = let s = clean_string s in let s = add_zeros s in let len = String.length s in assert (len mod 2 = 0); let rec loop acc idx = if idx >= len then acc else let byte_str = String.sub s idx 2 in let v = (16 * value_of byte_str.[0]) + value_of byte_str.[1] in let acc = prepend_int v acc in loop acc (idx + 2) in loop empty 0 let iter = Sequence.iter_forward let map = Sequence.map_forward let fold = Sequence.fold_forward let rev sq = fold Sequence.push_back sq empty let pp ppf t = let open Format in pp_open_hbox ppf (); let pp_space = ref (fun _ () -> ()) in iter (fun by -> Format.fprintf ppf "%a%02x" !pp_space () by; pp_space := pp_print_space) t; pp_close_box ppf () let to_string t = Format.asprintf "%a" pp t
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>