35 lines
1.2 KiB
OCaml
35 lines
1.2 KiB
OCaml
|
(* Binary data manipulation routines
|
||
|
Copyright (C) 2008 Michael Bacarella <mbac@panix.com>
|
||
|
|
||
|
This program is free software; you can redistribute it and/or modify
|
||
|
it under the terms of the GNU General Public License as published by
|
||
|
the Free Software Foundation; either version 2 of the License, or
|
||
|
(at your option) any later version.
|
||
|
|
||
|
This program 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 General Public License for more details.
|
||
|
|
||
|
You should have received a copy of the GNU General Public License
|
||
|
along with this program; if not, write to the Free Software
|
||
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||
|
*)
|
||
|
|
||
|
|
||
|
let chr x = char_of_int x
|
||
|
|
||
|
let and32 x n = Int32.logand x n
|
||
|
let xor32 x y = Int32.logxor x y
|
||
|
let or32 x y = Int32.logor x y
|
||
|
let right32 x n = Int32.shift_right_logical x n
|
||
|
let left32 x n = Int32.shift_left x n
|
||
|
let add32 x y = Int32.add x y
|
||
|
|
||
|
let add64 x y = Int64.add x y
|
||
|
|
||
|
let int64eq x y = (Int64.compare x y) = 0
|
||
|
let int64true x = (int64eq x 0L) = false
|
||
|
|
||
|
let xor4_32 a b c d = (xor32 a (xor32 b (xor32 c d)))
|