Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source
Page
Library
Module
Module type
Parameter
Class
Class type
Source
bitstring.ml1 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 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305(* * Bitstring library. * * Copyright (C) 2008-2016 Red Hat Inc., Richard W.M. Jones * Copyright (C) 2016 Red Hat Inc, Richard W.M. Jones, Xavier R. Guerin. * * This library is free software; 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; either * version 2 of the License, or (at your option) any later version, * with the OCaml linking exception described in COPYING.LIB. * * This library 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. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *) open Printf include Bitstring_types include Bitstring_config (* Enable runtime debug messages. Must also have been enabled * in pa_bitstring.ml. *) let debug = ref false (* Exceptions. *) exception Construct_failure of string * string * int * int (* A bitstring is simply the data itself (as a byte sequence), and the * bitoffset and the bitlength within the byte sequence. Note offset/length * are counted in bits, not bytes. *) type bitstring = bytes * int * int type t = bitstring (* Functions to create and load bitstrings. *) let empty_bitstring = Bytes.create 0, 0, 0 let make_bitstring len c = if len >= 0 then Bytes.make ((len+7) lsr 3) c, 0, len else invalid_arg ( sprintf "make_bitstring/create_bitstring: len %d < 0" len ) let create_bitstring len = make_bitstring len '\000' let zeroes_bitstring = create_bitstring let ones_bitstring len = make_bitstring len '\xff' let bitstring_of_string str = Bytes.of_string str, 0, String.length str lsl 3 let bitstring_of_chan chan = let tmpsize = 16384 in let buf = Buffer.create tmpsize in let tmp = Bytes.create tmpsize in let n = ref 0 in while n := input chan tmp 0 tmpsize; !n > 0 do Buffer.add_subbytes buf tmp 0 !n; done; Buffer.to_bytes buf, 0, Buffer.length buf lsl 3 let bitstring_of_chan_max chan max = let tmpsize = 16384 in let buf = Buffer.create tmpsize in let tmp = Bytes.create tmpsize in let len = ref 0 in let rec loop () = if !len < max then ( let r = min tmpsize (max - !len) in let n = input chan tmp 0 r in if n > 0 then ( Buffer.add_subbytes buf tmp 0 n; len := !len + n; loop () ) ) in loop (); Buffer.to_bytes buf, 0, !len lsl 3 let bitstring_of_file_descr fd = let tmpsize = 16384 in let buf = Buffer.create tmpsize in let tmp = Bytes.create tmpsize in let n = ref 0 in while n := Unix.read fd tmp 0 tmpsize; !n > 0 do Buffer.add_subbytes buf tmp 0 !n; done; Buffer.to_bytes buf, 0, Buffer.length buf lsl 3 let bitstring_of_file_descr_max fd max = let tmpsize = 16384 in let buf = Buffer.create tmpsize in let tmp = Bytes.create tmpsize in let len = ref 0 in let rec loop () = if !len < max then ( let r = min tmpsize (max - !len) in let n = Unix.read fd tmp 0 r in if n > 0 then ( Buffer.add_subbytes buf tmp 0 n; len := !len + n; loop () ) ) in loop (); Buffer.to_bytes buf, 0, !len lsl 3 let bitstring_of_file fname = let chan = open_in_bin fname in try let bs = bitstring_of_chan chan in close_in chan; bs with exn -> close_in chan; raise exn let bitstring_length (_, _, len) = len let subbitstring (data, off, len) off' len' = let off = off + off' in if off' < 0 || len' < 0 || off' > len - len' then invalid_arg "subbitstring"; (data, off, len') let dropbits n (data, off, len) = let off = off + n in let len = len - n in if len < 0 || n < 0 then invalid_arg "dropbits"; (data, off, len) let takebits n (data, off, len) = if len < n || n < 0 then invalid_arg "takebits"; (data, off, n) (*----------------------------------------------------------------------*) (* Bitwise functions. * * We try to isolate all bitwise functions within these modules. *) module I = struct (* Bitwise operations on ints. Note that we assume int <= 31 bits. *) external (<<<) : int -> int -> int = "%lslint" external (>>>) : int -> int -> int = "%lsrint" external to_int : int -> int = "%identity" let zero = 0 let one = 1 let minus_one = -1 let ff = 0xff (* Create a mask 0-31 bits wide. *) let mask bits = if bits < 30 || (bits < 32 && Sys.word_size = 64) then (one <<< bits) - 1 else if bits = 30 then max_int else if bits = 31 then minus_one else invalid_arg "Bitstring.I.mask" (* Byte swap an int of a given size. *) let byteswap v bits = if bits <= 8 then v else if bits <= 16 then ( let shift = bits-8 in let v1 = v >>> shift in let v2 = ((v land (mask shift)) <<< 8) in v2 lor v1 ) else if bits <= 24 then ( let shift = bits - 16 in let v1 = v >>> (8+shift) in let v2 = ((v >>> shift) land ff) <<< 8 in let v3 = (v land (mask shift)) <<< 16 in v3 lor v2 lor v1 ) else ( let shift = bits - 24 in let v1 = v >>> (16+shift) in let v2 = ((v >>> (8+shift)) land ff) <<< 8 in let v3 = ((v >>> shift) land ff) <<< 16 in let v4 = (v land (mask shift)) <<< 24 in v4 lor v3 lor v2 lor v1 ) (* Check a value is in range 0 .. 2^bits-1. *) let range_unsigned v bits = let mask = lnot (mask bits) in (v land mask) = zero let range_signed v bits = if v >= zero then range_unsigned v bits else if bits = 31 && Sys.word_size = 32 then v >= min_int else pred (minus_one <<< pred bits) < v (* Call function g on the top bits, then f on each full byte * (big endian - so start at top). *) let rec map_bytes_be g f v bits = if bits >= 8 then ( map_bytes_be g f (v >>> 8) (bits-8); let lsb = v land ff in f (to_int lsb) ) else if bits > 0 then ( let lsb = v land (mask bits) in g (to_int lsb) bits ) (* Call function g on the top bits, then f on each full byte * (little endian - so start at root). *) let rec map_bytes_le g f v bits = if bits >= 8 then ( let lsb = v land ff in f (to_int lsb); map_bytes_le g f (v >>> 8) (bits-8) ) else if bits > 0 then ( let lsb = v land (mask bits) in g (to_int lsb) bits ) end module I32 = struct (* Bitwise operations on int32s. Note we try to keep it as similar * as possible to the I module above, to make it easier to track * down bugs. *) let (<<<) = Int32.shift_left let (>>>) = Int32.shift_right_logical let (land) = Int32.logand let (lor) = Int32.logor let lnot = Int32.lognot let pred = Int32.pred let max_int = Int32.max_int let to_int = Int32.to_int let zero = Int32.zero let one = Int32.one let minus_one = Int32.minus_one let ff = 0xff_l (* Create a mask so many bits wide. *) let mask bits = if bits < 31 then pred (one <<< bits) else if bits = 31 then max_int else if bits = 32 then minus_one else invalid_arg "Bitstring.I32.mask" (* Byte swap an int of a given size. *) let byteswap v bits = if bits <= 8 then v else if bits <= 16 then ( let shift = bits-8 in let v1 = v >>> shift in let v2 = (v land (mask shift)) <<< 8 in v2 lor v1 ) else if bits <= 24 then ( let shift = bits - 16 in let v1 = v >>> (8+shift) in let v2 = ((v >>> shift) land ff) <<< 8 in let v3 = (v land (mask shift)) <<< 16 in v3 lor v2 lor v1 ) else ( let shift = bits - 24 in let v1 = v >>> (16+shift) in let v2 = ((v >>> (8+shift)) land ff) <<< 8 in let v3 = ((v >>> shift) land ff) <<< 16 in let v4 = (v land (mask shift)) <<< 24 in v4 lor v3 lor v2 lor v1 ) (* Check a value is in range 0 .. 2^bits-1. *) let range_unsigned v bits = let mask = lnot (mask bits) in (v land mask) = zero (* Call function g on the top bits, then f on each full byte * (big endian - so start at top). *) let rec map_bytes_be g f v bits = if bits >= 8 then ( map_bytes_be g f (v >>> 8) (bits-8); let lsb = v land ff in f (to_int lsb) ) else if bits > 0 then ( let lsb = v land (mask bits) in g (to_int lsb) bits ) (* Call function g on the top bits, then f on each full byte * (little endian - so start at root). *) let rec map_bytes_le g f v bits = if bits >= 8 then ( let lsb = v land ff in f (to_int lsb); map_bytes_le g f (v >>> 8) (bits-8) ) else if bits > 0 then ( let lsb = v land (mask bits) in g (to_int lsb) bits ) end module I64 = struct (* Bitwise operations on int64s. Note we try to keep it as similar * as possible to the I/I32 modules above, to make it easier to track * down bugs. *) let (<<<) = Int64.shift_left let (>>>) = Int64.shift_right_logical let (land) = Int64.logand let (lor) = Int64.logor let lnot = Int64.lognot let pred = Int64.pred let max_int = Int64.max_int let to_int = Int64.to_int let zero = Int64.zero let one = Int64.one let minus_one = Int64.minus_one let ff = 0xff_L (* Create a mask so many bits wide. *) let mask bits = if bits < 63 then pred (one <<< bits) else if bits = 63 then max_int else if bits = 64 then minus_one else invalid_arg "Bitstring.I64.mask" (* Byte swap an int of a given size. *) (* let byteswap v bits = *) (* Check a value is in range 0 .. 2^bits-1. *) let range_unsigned v bits = let mask = lnot (mask bits) in (v land mask) = zero (* Call function g on the top bits, then f on each full byte * (big endian - so start at top). *) let rec map_bytes_be g f v bits = if bits >= 8 then ( map_bytes_be g f (v >>> 8) (bits-8); let lsb = v land ff in f (to_int lsb) ) else if bits > 0 then ( let lsb = v land (mask bits) in g (to_int lsb) bits ) (* Call function g on the top bits, then f on each full byte * (little endian - so start at root). *) let rec map_bytes_le g f v bits = if bits >= 8 then ( let lsb = v land ff in f (to_int lsb); map_bytes_le g f (v >>> 8) (bits-8) ) else if bits > 0 then ( let lsb = v land (mask bits) in g (to_int lsb) bits ) end (*----------------------------------------------------------------------*) (* Extraction functions. * * NB: internal functions, called from the generated macros, and * the parameters should have been checked for sanity already). *) (* Extract and convert to numeric. A single bit is returned as * a boolean. There are no endianness or signedness considerations. *) let extract_bit data off len _ = (* final param is always 1 *) let byteoff = off lsr 3 in let bitmask = 1 lsl (7 - (off land 7)) in let b = Char.code (Bytes.get data byteoff) land bitmask <> 0 in b (*, off+1, len-1*) (* Returns 8 bit unsigned aligned bytes from the string. * If the string ends then this returns 0's. *) let _get_byte data byteoff strlen = if strlen > byteoff then Char.code (Bytes.get data byteoff) else 0 let _get_byte32 data byteoff strlen = if strlen > byteoff then Int32.of_int (Char.code (Bytes.get data byteoff)) else 0l let _get_byte64 data byteoff strlen = if strlen > byteoff then Int64.of_int (Char.code (Bytes.get data byteoff)) else 0L (* Extend signed [2..31] bits int to 31 bits int or 63 bits int for 64 bits platform*) let extend_sign len v = let b = pred Sys.word_size - len in (v lsl b) asr b let extract_and_extend_sign f data off len flen = let w = f data off len flen in extend_sign flen w (* Extract [2..8] bits. Because the result fits into a single * byte we don't have to worry about endianness, only signedness. *) let extract_char_unsigned data off len flen = let byteoff = off lsr 3 in (* Optimize the common (byte-aligned) case. *) if off land 7 = 0 then ( let byte = Char.code (Bytes.get data byteoff) in byte lsr (8 - flen) (*, off+flen, len-flen*) ) else ( (* Extract the 16 bits at byteoff and byteoff+1 (note that the * second byte might not exist in the original string). *) let strlen = Bytes.length data in let word = (_get_byte data byteoff strlen lsl 8) + _get_byte data (byteoff+1) strlen in (* Mask off the top bits. *) let bitmask = (1 lsl (16 - (off land 7))) - 1 in let word = word land bitmask in (* Shift right to get rid of the bottom bits. *) let shift = 16 - ((off land 7) + flen) in let word = word lsr shift in word (*, off+flen, len-flen*) ) let extract_char_signed = extract_and_extend_sign extract_char_unsigned (* Extract [9..31] bits. We have to consider endianness and signedness. *) let extract_int_be_unsigned data off len flen = let byteoff = off lsr 3 in let strlen = Bytes.length data in let word = (* Optimize the common (byte-aligned) case. *) if off land 7 = 0 then ( let word = (_get_byte data byteoff strlen lsl 23) + (_get_byte data (byteoff+1) strlen lsl 15) + (_get_byte data (byteoff+2) strlen lsl 7) + (_get_byte data (byteoff+3) strlen lsr 1) in word lsr (31 - flen) ) else if flen <= 24 then ( (* Extract the 31 bits at byteoff .. byteoff+3. *) let word = (_get_byte data byteoff strlen lsl 23) + (_get_byte data (byteoff+1) strlen lsl 15) + (_get_byte data (byteoff+2) strlen lsl 7) + (_get_byte data (byteoff+3) strlen lsr 1) in (* Mask off the top bits. *) let bitmask = (1 lsl (31 - (off land 7))) - 1 in let word = word land bitmask in (* Shift right to get rid of the bottom bits. *) let shift = 31 - ((off land 7) + flen) in word lsr shift ) else ( (* Extract the next 31 bits, slow method. *) let word = let c0 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c1 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c2 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c3 = extract_char_unsigned data off len 7 in (c0 lsl 23) + (c1 lsl 15) + (c2 lsl 7) + c3 in word lsr (31 - flen) ) in word (*, off+flen, len-flen*) let extract_int_be_signed = extract_and_extend_sign extract_int_be_unsigned let extract_int_le_unsigned data off len flen = let v = extract_int_be_unsigned data off len flen in let v = I.byteswap v flen in v let extract_int_le_signed = extract_and_extend_sign extract_int_le_unsigned let extract_int_ne_unsigned = if nativeendian = BigEndian then extract_int_be_unsigned else extract_int_le_unsigned let extract_int_ne_signed = extract_and_extend_sign extract_int_ne_unsigned let extract_int_ee_unsigned = function | BigEndian -> extract_int_be_unsigned | LittleEndian -> extract_int_le_unsigned | NativeEndian -> extract_int_ne_unsigned let extract_int_ee_signed e = extract_and_extend_sign (extract_int_ee_unsigned e) let _make_int32_be c0 c1 c2 c3 = Int32.logor (Int32.logor (Int32.logor (Int32.shift_left c0 24) (Int32.shift_left c1 16)) (Int32.shift_left c2 8)) c3 let _make_int32_le c0 c1 c2 c3 = Int32.logor (Int32.logor (Int32.logor (Int32.shift_left c3 24) (Int32.shift_left c2 16)) (Int32.shift_left c1 8)) c0 (* Extract exactly 32 bits. We have to consider endianness and signedness. *) let extract_int32_be_unsigned data off len flen = let byteoff = off lsr 3 in let strlen = Bytes.length data in let word = (* Optimize the common (byte-aligned) case. *) if off land 7 = 0 then ( let word = let c0 = _get_byte32 data byteoff strlen in let c1 = _get_byte32 data (byteoff+1) strlen in let c2 = _get_byte32 data (byteoff+2) strlen in let c3 = _get_byte32 data (byteoff+3) strlen in _make_int32_be c0 c1 c2 c3 in Int32.shift_right_logical word (32 - flen) ) else ( (* Extract the next 32 bits, slow method. *) let word = let c0 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c1 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c2 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c3 = extract_char_unsigned data off len 8 in let c0 = Int32.of_int c0 in let c1 = Int32.of_int c1 in let c2 = Int32.of_int c2 in let c3 = Int32.of_int c3 in _make_int32_be c0 c1 c2 c3 in Int32.shift_right_logical word (32 - flen) ) in word (*, off+flen, len-flen*) let extract_int32_le_unsigned data off len flen = let v = extract_int32_be_unsigned data off len flen in let v = I32.byteswap v flen in v let extract_int32_ne_unsigned = if nativeendian = BigEndian then extract_int32_be_unsigned else extract_int32_le_unsigned let extract_int32_ee_unsigned = function | BigEndian -> extract_int32_be_unsigned | LittleEndian -> extract_int32_le_unsigned | NativeEndian -> extract_int32_ne_unsigned let _make_int64_be c0 c1 c2 c3 c4 c5 c6 c7 = Int64.logor (Int64.logor (Int64.logor (Int64.logor (Int64.logor (Int64.logor (Int64.logor (Int64.shift_left c0 56) (Int64.shift_left c1 48)) (Int64.shift_left c2 40)) (Int64.shift_left c3 32)) (Int64.shift_left c4 24)) (Int64.shift_left c5 16)) (Int64.shift_left c6 8)) c7 let _make_int64_le c0 c1 c2 c3 c4 c5 c6 c7 = _make_int64_be c7 c6 c5 c4 c3 c2 c1 c0 (* Extract [1..64] bits. We have to consider endianness and signedness. *) let extract_int64_be_unsigned data off len flen = let byteoff = off lsr 3 in let strlen = Bytes.length data in let word = (* Optimize the common (byte-aligned) case. *) if off land 7 = 0 then ( let word = let c0 = _get_byte64 data byteoff strlen in let c1 = _get_byte64 data (byteoff+1) strlen in let c2 = _get_byte64 data (byteoff+2) strlen in let c3 = _get_byte64 data (byteoff+3) strlen in let c4 = _get_byte64 data (byteoff+4) strlen in let c5 = _get_byte64 data (byteoff+5) strlen in let c6 = _get_byte64 data (byteoff+6) strlen in let c7 = _get_byte64 data (byteoff+7) strlen in _make_int64_be c0 c1 c2 c3 c4 c5 c6 c7 in Int64.shift_right_logical word (64 - flen) ) else ( (* Extract the next 64 bits, slow method. *) let word = let c0 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c1 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c2 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c3 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c4 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c5 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c6 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c7 = extract_char_unsigned data off len 8 in let c0 = Int64.of_int c0 in let c1 = Int64.of_int c1 in let c2 = Int64.of_int c2 in let c3 = Int64.of_int c3 in let c4 = Int64.of_int c4 in let c5 = Int64.of_int c5 in let c6 = Int64.of_int c6 in let c7 = Int64.of_int c7 in _make_int64_be c0 c1 c2 c3 c4 c5 c6 c7 in Int64.shift_right_logical word (64 - flen) ) in word (*, off+flen, len-flen*) let extract_int64_le_unsigned data off len flen = let byteoff = off lsr 3 in let strlen = Bytes.length data in let word = (* Optimize the common (byte-aligned) case. *) if off land 7 = 0 then ( let word = let c0 = _get_byte64 data byteoff strlen in let c1 = _get_byte64 data (byteoff+1) strlen in let c2 = _get_byte64 data (byteoff+2) strlen in let c3 = _get_byte64 data (byteoff+3) strlen in let c4 = _get_byte64 data (byteoff+4) strlen in let c5 = _get_byte64 data (byteoff+5) strlen in let c6 = _get_byte64 data (byteoff+6) strlen in let c7 = _get_byte64 data (byteoff+7) strlen in _make_int64_le c0 c1 c2 c3 c4 c5 c6 c7 in Int64.logand word (I64.mask flen) ) else ( (* Extract the next 64 bits, slow method. *) let word = let c0 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c1 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c2 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c3 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c4 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c5 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c6 = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in let c7 = extract_char_unsigned data off len 8 in let c0 = Int64.of_int c0 in let c1 = Int64.of_int c1 in let c2 = Int64.of_int c2 in let c3 = Int64.of_int c3 in let c4 = Int64.of_int c4 in let c5 = Int64.of_int c5 in let c6 = Int64.of_int c6 in let c7 = Int64.of_int c7 in _make_int64_le c0 c1 c2 c3 c4 c5 c6 c7 in Int64.logand word (I64.mask flen) ) in word (*, off+flen, len-flen*) let extract_int64_ne_unsigned = if nativeendian = BigEndian then extract_int64_be_unsigned else extract_int64_le_unsigned let extract_int64_ee_unsigned = function | BigEndian -> extract_int64_be_unsigned | LittleEndian -> extract_int64_le_unsigned | NativeEndian -> extract_int64_ne_unsigned external extract_fastpath_int16_be_unsigned : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int16_be_unsigned" external extract_fastpath_int16_le_unsigned : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int16_le_unsigned" external extract_fastpath_int16_ne_unsigned : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int16_ne_unsigned" external extract_fastpath_int16_be_signed : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int16_be_signed" external extract_fastpath_int16_le_signed : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int16_le_signed" external extract_fastpath_int16_ne_signed : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int16_ne_signed" (* external extract_fastpath_int24_be_unsigned : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int24_be_unsigned" external extract_fastpath_int24_le_unsigned : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int24_le_unsigned" external extract_fastpath_int24_ne_unsigned : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int24_ne_unsigned" external extract_fastpath_int24_be_signed : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int24_be_signed" external extract_fastpath_int24_le_signed : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int24_le_signed" external extract_fastpath_int24_ne_signed : bytes -> int -> int = "ocaml_bitstring_extract_fastpath_int24_ne_signed" *) external extract_fastpath_int32_be_unsigned : bytes -> int -> int32 = "ocaml_bitstring_extract_fastpath_int32_be_unsigned" external extract_fastpath_int32_le_unsigned : bytes -> int -> int32 = "ocaml_bitstring_extract_fastpath_int32_le_unsigned" external extract_fastpath_int32_ne_unsigned : bytes -> int -> int32 = "ocaml_bitstring_extract_fastpath_int32_ne_unsigned" external extract_fastpath_int32_be_signed : bytes -> int -> int32 = "ocaml_bitstring_extract_fastpath_int32_be_signed" external extract_fastpath_int32_le_signed : bytes -> int -> int32 = "ocaml_bitstring_extract_fastpath_int32_le_signed" external extract_fastpath_int32_ne_signed : bytes -> int -> int32 = "ocaml_bitstring_extract_fastpath_int32_ne_signed" (* external extract_fastpath_int40_be_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int40_be_unsigned" external extract_fastpath_int40_le_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int40_le_unsigned" external extract_fastpath_int40_ne_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int40_ne_unsigned" external extract_fastpath_int40_be_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int40_be_signed" external extract_fastpath_int40_le_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int40_le_signed" external extract_fastpath_int40_ne_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int40_ne_signed" external extract_fastpath_int48_be_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int48_be_unsigned" external extract_fastpath_int48_le_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int48_le_unsigned" external extract_fastpath_int48_ne_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int48_ne_unsigned" external extract_fastpath_int48_be_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int48_be_signed" external extract_fastpath_int48_le_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int48_le_signed" external extract_fastpath_int48_ne_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int48_ne_signed" external extract_fastpath_int56_be_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int56_be_unsigned" external extract_fastpath_int56_le_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int56_le_unsigned" external extract_fastpath_int56_ne_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int56_ne_unsigned" external extract_fastpath_int56_be_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int56_be_signed" external extract_fastpath_int56_le_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int56_le_signed" external extract_fastpath_int56_ne_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int56_ne_signed" *) external extract_fastpath_int64_be_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int64_be_unsigned" external extract_fastpath_int64_le_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int64_le_unsigned" external extract_fastpath_int64_ne_unsigned : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int64_ne_unsigned" external extract_fastpath_int64_be_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int64_be_signed" external extract_fastpath_int64_le_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int64_le_signed" external extract_fastpath_int64_ne_signed : bytes -> int -> int64 = "ocaml_bitstring_extract_fastpath_int64_ne_signed" (*----------------------------------------------------------------------*) (* Constructor functions. *) module Buffer = struct type t = { buf : Buffer.t; mutable len : int; (* Length in bits. *) (* Last byte in the buffer (if len is not aligned). We store * it outside the buffer because buffers aren't mutable. *) mutable last : int; } let create () = (* XXX We have almost enough information in the generator to * choose a good initial size. *) { buf = Buffer.create 128; len = 0; last = 0 } let contents { buf = buf; len = len; last = last } = let data = if len land 7 = 0 then Buffer.to_bytes buf else Bytes.cat (Buffer.to_bytes buf) (Bytes.make 1 (Char.chr last)) in data, 0, len (* Add exactly 8 bits. *) let add_byte t byte = let {buf; len; last} = t in if byte < 0 || byte > 255 then invalid_arg "Bitstring.Buffer.add_byte"; let shift = len land 7 in if shift = 0 then (* Target buffer is byte-aligned. *) Buffer.add_char buf (Char.chr byte) else ( (* Target buffer is unaligned. 'last' is meaningful. *) let first = byte lsr shift in let second = (byte lsl (8 - shift)) land 0xff in Buffer.add_char buf (Char.chr (last lor first)); t.last <- second ); t.len <- t.len + 8 (* Add exactly 1 bit. *) let add_bit t bit = let {buf; len; last} = t in let shift = 7 - (len land 7) in if shift > 0 then (* Somewhere in the middle of 'last'. *) t.last <- last lor ((if bit then 1 else 0) lsl shift) else ( (* Just a single spare bit in 'last'. *) let last = last lor if bit then 1 else 0 in Buffer.add_char buf (Char.chr last); t.last <- 0 ); t.len <- len + 1 (* Add a small number of bits (definitely < 8). This uses a loop * to call add_bit so it's slow. *) let _add_bits t c slen = if slen < 1 || slen >= 8 then invalid_arg "Bitstring.Buffer._add_bits"; for i = slen-1 downto 0 do let bit = c land (1 lsl i) <> 0 in add_bit t bit done let add_bits t str slen = let {buf; len; _} = t in if slen > 0 then ( if len land 7 = 0 then ( if slen land 7 = 0 then (* Common case - everything is byte-aligned. *) Buffer.add_subbytes buf str 0 (slen lsr 3) else ( (* Target buffer is aligned. Copy whole bytes then leave the * remaining bits in last. *) let slenbytes = slen lsr 3 in if slenbytes > 0 then Buffer.add_subbytes buf str 0 slenbytes; let lastidx = min slenbytes (Bytes.length str - 1) in let last = Char.code (Bytes.get str lastidx) in (* last char *) let mask = 0xff lsl (8 - (slen land 7)) in t.last <- last land mask ); t.len <- len + slen ) else ( (* Target buffer is unaligned. Copy whole bytes using * add_byte which knows how to deal with an unaligned * target buffer, then call add_bit for the remaining < 8 bits. * * XXX This is going to be dog-slow. *) let slenbytes = slen lsr 3 in for i = 0 to slenbytes-1 do let byte = Char.code (Bytes.get str i) in add_byte t byte done; let bitsleft = slen - (slenbytes lsl 3) in if bitsleft > 0 then ( let c = Char.code (Bytes.get str slenbytes) in for i = 0 to bitsleft - 1 do let bit = c land (0x80 lsr i) <> 0 in add_bit t bit done ) ); ) end (* Construct a single bit. *) let construct_bit buf b _ _ = Buffer.add_bit buf b (* Construct a field, flen = [2..8]. *) let construct_char_unsigned buf v flen exn = let max_val = 1 lsl flen in if v < 0 || v >= max_val then raise exn; if flen = 8 then Buffer.add_byte buf v else Buffer._add_bits buf v flen let construct_char_signed buf v flen exn = let max_val = 1 lsl flen and min_val = - (1 lsl pred flen) in if v < min_val || v >= max_val then raise exn; if flen = 8 then Buffer.add_byte buf (if v >= 0 then v else 256 + v) else Buffer._add_bits buf v flen (* Construct a field of up to 31 bits. *) let construct_int check_func map_func buf v flen exn = if not (check_func v flen) then raise exn; map_func (Buffer._add_bits buf) (Buffer.add_byte buf) v flen let construct_int_be_unsigned = construct_int I.range_unsigned I.map_bytes_be let construct_int_be_signed = construct_int I.range_signed I.map_bytes_be let construct_int_le_unsigned = construct_int I.range_unsigned I.map_bytes_le let construct_int_le_signed = construct_int I.range_signed I.map_bytes_le let construct_int_ne_unsigned = if nativeendian = BigEndian then construct_int_be_unsigned else construct_int_le_unsigned let construct_int_ne_signed = if nativeendian = BigEndian then construct_int_be_signed else construct_int_le_signed let construct_int_ee_unsigned = function | BigEndian -> construct_int_be_unsigned | LittleEndian -> construct_int_le_unsigned | NativeEndian -> construct_int_ne_unsigned let construct_int_ee_signed = function | BigEndian -> construct_int_be_signed | LittleEndian -> construct_int_le_signed | NativeEndian -> construct_int_ne_signed (* Construct a field of exactly 32 bits. *) let construct_int32_be_unsigned buf v flen _ = Buffer.add_byte buf (Int32.to_int (Int32.shift_right_logical v 24)); Buffer.add_byte buf (Int32.to_int ((Int32.logand (Int32.shift_right_logical v 16) 0xff_l))); Buffer.add_byte buf (Int32.to_int ((Int32.logand (Int32.shift_right_logical v 8) 0xff_l))); Buffer.add_byte buf (Int32.to_int (Int32.logand v 0xff_l)) let construct_int32_le_unsigned buf v flen _ = Buffer.add_byte buf (Int32.to_int (Int32.logand v 0xff_l)); Buffer.add_byte buf (Int32.to_int ((Int32.logand (Int32.shift_right_logical v 8) 0xff_l))); Buffer.add_byte buf (Int32.to_int ((Int32.logand (Int32.shift_right_logical v 16) 0xff_l))); Buffer.add_byte buf (Int32.to_int (Int32.shift_right_logical v 24)) let construct_int32_ne_unsigned = if nativeendian = BigEndian then construct_int32_be_unsigned else construct_int32_le_unsigned let construct_int32_ee_unsigned = function | BigEndian -> construct_int32_be_unsigned | LittleEndian -> construct_int32_le_unsigned | NativeEndian -> construct_int32_ne_unsigned (* Construct a field of up to 64 bits. *) let construct_int64_be_unsigned buf v flen exn = (* Check value is within range. *) if not (I64.range_unsigned v flen) then raise exn; (* Add the bytes. *) I64.map_bytes_be (Buffer._add_bits buf) (Buffer.add_byte buf) v flen (* Construct a field of up to 64 bits. *) let construct_int64_le_unsigned buf v flen exn = (* Check value is within range. *) if not (I64.range_unsigned v flen) then raise exn; (* Add the bytes. *) I64.map_bytes_le (Buffer._add_bits buf) (Buffer.add_byte buf) v flen let construct_int64_ne_unsigned = if nativeendian = BigEndian then construct_int64_be_unsigned else construct_int64_le_unsigned let construct_int64_ee_unsigned = function | BigEndian -> construct_int64_be_unsigned | LittleEndian -> construct_int64_le_unsigned | NativeEndian -> construct_int64_ne_unsigned (* Construct from a string of bytes, exact multiple of 8 bits * in length of course. *) let construct_string buf str = let len = String.length str in Buffer.add_bits buf (Bytes.unsafe_of_string str) (len lsl 3) (* Construct from a bitstring. *) let construct_bitstring buf (data, off, len) = (* Add individual bits until we get to the next byte boundary of * the underlying string. *) let blen = 7 - ((off + 7) land 7) in let blen = min blen len in let rec loop off len blen = if blen = 0 then (off, len) else ( let b = extract_bit data off len 1 and off = off + 1 and len = len - 1 in Buffer.add_bit buf b; loop off len (blen-1) ) in let off, len = loop off len blen in assert (len = 0 || (off land 7) = 0); (* Add the remaining 'len' bits. *) let data = let off = off lsr 3 in (* XXX dangerous allocation *) if off = 0 then data else Bytes.sub data off (Bytes.length data - off) in Buffer.add_bits buf data len (* Concatenate bitstrings. *) let concat bs = let buf = Buffer.create () in List.iter (construct_bitstring buf) bs; Buffer.contents buf (*----------------------------------------------------------------------*) (* Extract a string from a bitstring. *) let string_of_bitstring (data, off, len) = if off land 7 = 0 && len land 7 = 0 then (* Easy case: everything is byte-aligned. *) String.sub (Bytes.unsafe_to_string data) (off lsr 3) (len lsr 3) else ( (* Bit-twiddling case. *) let strlen = (len + 7) lsr 3 in let str = Bytes.make strlen '\000' in let rec loop data off len i = if len >= 8 then ( let c = extract_char_unsigned data off len 8 and off = off + 8 and len = len - 8 in Bytes.set str i (Char.chr c); loop data off len (i+1) ) else if len > 0 then ( let c = extract_char_unsigned data off len len in Bytes.set str i (Char.chr (c lsl (8-len))) ) in loop data off len 0; Bytes.unsafe_to_string str ) (* To channel. *) let bitstring_to_chan ((data, off, len) as bits) chan = (* Fail if the bitstring length isn't a multiple of 8. *) if len land 7 <> 0 then invalid_arg "bitstring_to_chan"; if off land 7 = 0 then (* Easy case: string is byte-aligned. *) output chan data (off lsr 3) (len lsr 3) else ( (* Bit-twiddling case: reuse string_of_bitstring *) let str = string_of_bitstring bits in output_string chan str ) let bitstring_to_file bits filename = let chan = open_out_bin filename in try bitstring_to_chan bits chan; close_out chan with exn -> close_out chan; raise exn (*----------------------------------------------------------------------*) (* Comparison. *) let compare ((data1, off1, len1) as bs1) ((data2, off2, len2) as bs2) = (* In the fully-aligned case, this is reduced to string comparison ... *) if off1 land 7 = 0 && len1 land 7 = 0 && off2 land 7 = 0 && len2 land 7 = 0 then ( (* ... but we have to do that by hand because the bits may * not extend to the full length of the underlying string. *) let off1 = off1 lsr 3 and off2 = off2 lsr 3 and len1 = len1 lsr 3 and len2 = len2 lsr 3 in let rec loop i = if i < len1 && i < len2 then ( let c1 = Bytes.unsafe_get data1 (off1 + i) and c2 = Bytes.unsafe_get data2 (off2 + i) in let r = compare c1 c2 in if r <> 0 then r else loop (i+1) ) else len1 - len2 in loop 0 ) else ( (* Slow/unaligned. *) let str1 = string_of_bitstring bs1 and str2 = string_of_bitstring bs2 in let r = String.compare str1 str2 in if r <> 0 then r else len1 - len2 ) let equals ((_, _, len1) as bs1) ((_, _, len2) as bs2) = if len1 <> len2 then false else if bs1 = bs2 then true else 0 = compare bs1 bs2 let is_zeroes_bitstring ((data, off, len) as bits) = if off land 7 = 0 && len land 7 = 0 then ( let off = off lsr 3 and len = len lsr 3 in let rec loop i = if i < len then ( if Bytes.unsafe_get data (off + i) <> '\000' then false else loop (i+1) ) else true in loop 0 ) else ( (* Slow/unaligned case. *) let len = bitstring_length bits in let zeroes = zeroes_bitstring len in 0 = compare bits zeroes ) let is_ones_bitstring ((data, off, len) as bits) = if off land 7 = 0 && len land 7 = 0 then ( let off = off lsr 3 and len = len lsr 3 in let rec loop i = if i < len then ( if Bytes.unsafe_get data (off + i) <> '\xff' then false else loop (i+1) ) else true in loop 0 ) else ( (* Slow/unaligned case. *) let len = bitstring_length bits in let ones = ones_bitstring len in 0 = compare bits ones ) external is_prefix_fastpath: bytes -> int -> bytes -> int -> int -> bool = "ocaml_bitstring_is_prefix_fastpath" let is_prefix ((b1, o1, l1) as bs1) ((b2, o2, l2) as bs2) = (* Fail if either bitstring is invalid *) if l2 > l1 || l1 = 0 || l2 = 0 then false (* Use the fast path if the bitstrings are aligned *) else if o1 land 7 = o2 land 7 then is_prefix_fastpath b1 o1 b2 o2 l2 (* Bitstrings are unaligned *) else let re = Str.regexp_string (string_of_bitstring bs2) in Str.string_partial_match re (string_of_bitstring bs1) 0 (*----------------------------------------------------------------------*) (* Bit get/set functions. *) let index_out_of_bounds () = invalid_arg "index out of bounds" let put (data, off, len) n v = if n < 0 || n >= len then index_out_of_bounds () else ( let i = off+n in let si = i lsr 3 and mask = 0x80 lsr (i land 7) in let c = Char.code (Bytes.get data si) in let c = if v <> 0 then c lor mask else c land (lnot mask) in Bytes.set data si (Char.unsafe_chr c) ) let set bits n = put bits n 1 let clear bits n = put bits n 0 let get (data, off, len) n = if n < 0 || n >= len then index_out_of_bounds () else ( let i = off+n in let si = i lsr 3 and mask = 0x80 lsr (i land 7) in let c = Char.code (Bytes.get data si) in c land mask ) let is_set bits n = get bits n <> 0 let is_clear bits n = get bits n = 0 (*----------------------------------------------------------------------*) (* Display functions. *) let isprint c = let c = Char.code c in c >= 32 && c < 127 let hexdump_bitstring chan (data, off, len) = let count = ref 0 in let off = ref off in let len = ref len in let linelen = ref 0 in let linechars = Bytes.make 16 ' ' in fprintf chan "00000000 "; while !len > 0 do let bits = min !len 8 in let byte = extract_char_unsigned data !off !len bits in off := !off + bits; len := !len - bits; let byte = byte lsl (8-bits) in fprintf chan "%02x " byte; incr count; Bytes.set linechars !linelen (let c = Char.chr byte in if isprint c then c else '.'); incr linelen; if !linelen = 8 then fprintf chan " "; if !linelen = 16 then ( fprintf chan " |%s|\n%08x " (Bytes.unsafe_to_string linechars) !count; linelen := 0; for i = 0 to 15 do Bytes.set linechars i ' ' done ) done; if !linelen > 0 then ( let skip = (16 - !linelen) * 3 + if !linelen < 8 then 1 else 0 in for _ = 0 to skip-1 do fprintf chan " " done; fprintf chan " |%s|\n%!" (Bytes.unsafe_to_string linechars) ) else fprintf chan "\n%!" (*----------------------------------------------------------------------*) (* Alias of functions shadowed by Core. *) let char_code = Char.code let int32_of_int = Int32.of_int