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 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
|
(* Common utilities for OCaml tools in libguestfs.
* Copyright (C) 2010-2019 Red Hat Inc.
*
* 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 Street, Fifth Floor, Boston, MA 02110-1301 USA.
*)
open Printf
module Char = struct
include Char
let lowercase_ascii c =
if (c >= 'A' && c <= 'Z')
then unsafe_chr (code c + 32)
else c
let uppercase_ascii c =
if (c >= 'a' && c <= 'z')
then unsafe_chr (code c - 32)
else c
let isspace c =
c = ' '
(* || c = '\f' *) || c = '\n' || c = '\r' || c = '\t' (* || c = '\v' *)
let isdigit = function
| '0'..'9' -> true
| _ -> false
let isxdigit = function
| '0'..'9' -> true
| 'a'..'f' -> true
| 'A'..'F' -> true
| _ -> false
let isalpha = function
| 'a'..'z' -> true
| 'A'..'Z' -> true
| _ -> false
let isalnum = function
| '0'..'9' -> true
| 'a'..'z' -> true
| 'A'..'Z' -> true
| _ -> false
let hexdigit = function
| '0' -> 0
| '1' -> 1
| '2' -> 2
| '3' -> 3
| '4' -> 4
| '5' -> 5
| '6' -> 6
| '7' -> 7
| '8' -> 8
| '9' -> 9
| 'a' | 'A' -> 10
| 'b' | 'B' -> 11
| 'c' | 'C' -> 12
| 'd' | 'D' -> 13
| 'e' | 'E' -> 14
| 'f' | 'F' -> 15
| _ -> -1
let mem c str = String.contains str c
end
module String = struct
include String
let lowercase_ascii s = map Char.lowercase_ascii s
let uppercase_ascii s = map Char.uppercase_ascii s
let capitalize_ascii s =
let b = Bytes.of_string s in
Bytes.unsafe_set b 0 (Char.uppercase_ascii (Bytes.unsafe_get b 0));
Bytes.to_string b
let is_prefix str prefix =
let n = length prefix in
length str >= n && sub str 0 n = prefix
let is_suffix str suffix =
let sufflen = length suffix
and len = length str in
len >= sufflen && sub str (len - sufflen) sufflen = suffix
let rec find s sub =
let len = length s in
let sublen = length sub in
let rec loop i =
if i <= len-sublen then (
let rec loop2 j =
if j < sublen then (
if s.[i+j] = sub.[j] then loop2 (j+1)
else -1
) else
i (* found *)
in
let r = loop2 0 in
if r = -1 then loop (i+1) else r
) else
-1 (* not found *)
in
loop 0
let rec replace s s1 s2 =
let len = length s in
let sublen = length s1 in
let i = find s s1 in
if i = -1 then s
else (
let s' = sub s 0 i in
let s'' = sub s (i+sublen) (len-i-sublen) in
s' ^ s2 ^ replace s'' s1 s2
)
let replace_char s c1 c2 =
let b2 = Bytes.of_string s in
let r = ref false in
for i = 0 to Bytes.length b2 - 1 do
if Bytes.unsafe_get b2 i = c1 then (
Bytes.unsafe_set b2 i c2;
r := true
)
done;
if not !r then s else Bytes.to_string b2
let rec split sep str =
let len = length sep in
let seplen = length str in
let i = find str sep in
if i = -1 then str, ""
else (
sub str 0 i, sub str (i + len) (seplen - i - len)
)
and nsplit ?(max = 0) sep str =
if max < 0 then
invalid_arg "String.nsplit: max parameter should not be negative";
(* If we reached the limit, OR if the pattern does not match the string
* at all, return the rest of the string as a single element list.
*)
if max = 1 || find str sep = -1 then
[str]
else (
let s1, s2 = split sep str in
let max = if max = 0 then 0 else max - 1 in
s1 :: nsplit ~max sep s2
)
let rec lines_split str =
let buf = Buffer.create 16 in
let len = length str in
let rec loop start len =
try
let i = index_from str start '\n' in
if i > 0 && str.[i-1] = '\\' then (
Buffer.add_substring buf str start (i-start-1);
Buffer.add_char buf '\n';
loop (i+1) len
) else (
Buffer.add_substring buf str start (i-start);
i+1
)
with Not_found ->
if len > 0 && str.[len-1] = '\\' then (
Buffer.add_substring buf str start (len-start-1);
Buffer.add_char buf '\n'
) else
Buffer.add_substring buf str start (len-start);
len+1
in
let endi = loop 0 len in
let line = Buffer.contents buf in
if endi > len then
[line]
else
line :: lines_split (sub str endi (len-endi))
let random8 =
let chars = "abcdefghijklmnopqrstuvwxyz0123456789" in
fun () ->
concat "" (
List.map (
fun _ ->
let c = Random.int 36 in
let c = chars.[c] in
make 1 c
) [1;2;3;4;5;6;7;8]
)
let triml ?(test = Char.isspace) str =
let i = ref 0 in
let n = ref (String.length str) in
while !n > 0 && test str.[!i]; do
decr n;
incr i
done;
if !i = 0 then str
else String.sub str !i !n
let trimr ?(test = Char.isspace) str =
let n = ref (String.length str) in
while !n > 0 && test str.[!n-1]; do
decr n
done;
if !n = String.length str then str
else String.sub str 0 !n
let trim ?(test = Char.isspace) str =
trimr ~test (triml ~test str)
let chomp str =
let n = String.length str in
if n > 0 && str.[n-1] = '\n' then
String.sub str 0 (n-1)
else
str
let count_chars c str =
let count = ref 0 in
for i = 0 to String.length str - 1 do
if c = String.unsafe_get str i then incr count
done;
!count
let explode str =
let r = ref [] in
for i = 0 to String.length str - 1 do
let c = String.unsafe_get str i in
r := c :: !r;
done;
List.rev !r
let map_chars f str =
List.map f (explode str)
let spaces n = String.make n ' '
let span str accept =
let len = String.length str in
let rec loop i =
if i >= len then len
else if Char.mem (String.unsafe_get str i) accept then loop (i+1)
else i
in
loop 0
let cspan str reject =
let len = String.length str in
let rec loop i =
if i >= len then len
else if Char.mem (String.unsafe_get str i) reject then i
else loop (i+1)
in
loop 0
let unix2dos str = replace str "\n" "\r\n"
end
module List = struct
include List
(* Drop elements from a list while a predicate is true. *)
let rec dropwhile f = function
| [] -> []
| x :: xs when f x -> dropwhile f xs
| xs -> xs
(* Take elements from a list while a predicate is true. *)
let rec takewhile f = function
| x :: xs when f x -> x :: takewhile f xs
| _ -> []
let rec filter_map f = function
| [] -> []
| x :: xs ->
match f x with
| Some y -> y :: filter_map f xs
| None -> filter_map f xs
let rec find_map f = function
| [] -> raise Not_found
| x :: xs ->
match f x with
| Some y -> y
| None -> find_map f xs
let rec combine3 xs ys zs =
match xs, ys, zs with
| [], [], [] -> []
| x::xs, y::ys, z::zs -> (x, y, z) :: combine3 xs ys zs
| _ -> invalid_arg "combine3"
let rec assoc_lbl ?(cmp = compare) ~default x = function
| [] -> default
| (y, y') :: _ when cmp x y = 0 -> y'
| _ :: ys -> assoc_lbl ~cmp ~default x ys
let uniq ?(cmp = Pervasives.compare) xs =
let rec loop acc = function
| [] -> acc
| [x] -> x :: acc
| x :: (y :: _ as xs) when cmp x y = 0 ->
loop acc xs
| x :: (y :: _ as xs) ->
loop (x :: acc) xs
in
List.rev (loop [] xs)
(* This is present in OCaml 4.04, so we can remove it when
* we depend on OCaml >= 4.04.
*)
let sort_uniq ?(cmp = Pervasives.compare) xs =
let xs = List.sort cmp xs in
let xs = uniq ~cmp xs in
xs
let remove_duplicates xs =
let h = Hashtbl.create (List.length xs) in
let rec loop = function
| [] -> []
| x :: xs when Hashtbl.mem h x -> xs
| x :: xs -> Hashtbl.add h x true; x :: loop xs
in
loop xs
let push_back xsp x = xsp := !xsp @ [x]
let push_front x xsp = xsp := x :: !xsp
let pop_back xsp =
let x, xs =
match List.rev !xsp with
| x :: xs -> x, xs
| [] -> failwith "pop" in
xsp := List.rev xs;
x
let pop_front xsp =
let x, xs =
match !xsp with
| x :: xs -> x, xs
| [] -> failwith "shift" in
xsp := xs;
x
let push_back_list xsp xs = xsp := !xsp @ xs
let push_front_list xs xsp = xsp := xs @ !xsp
end
module Option = struct
let may f = function
| None -> ()
| Some x -> f x
let map f = function
| None -> None
| Some x -> Some (f x)
let default def = function
| None -> def
| Some x -> x
end
let (//) = Filename.concat
let quote = Filename.quote
let ( +^ ) = Int64.add
let ( -^ ) = Int64.sub
let ( *^ ) = Int64.mul
let ( /^ ) = Int64.div
let ( &^ ) = Int64.logand
let ( ~^ ) = Int64.lognot
external identity : 'a -> 'a = "%identity"
let roundup64 i a = let a = a -^ 1L in (i +^ a) &^ (~^ a)
let div_roundup64 i a = (i +^ a -^ 1L) /^ a
let int_of_le16 str =
assert (String.length str = 2);
let c0 = Char.code (String.unsafe_get str 0) in
let c1 = Char.code (String.unsafe_get str 1) in
Int64.of_int c0 +^
(Int64.shift_left (Int64.of_int c1) 8)
let le16_of_int i =
let c0 = i &^ 0xffL in
let c1 = Int64.shift_right (i &^ 0xff00L) 8 in
let b = Bytes.create 2 in
Bytes.unsafe_set b 0 (Char.unsafe_chr (Int64.to_int c0));
Bytes.unsafe_set b 1 (Char.unsafe_chr (Int64.to_int c1));
Bytes.to_string b
let int_of_le32 str =
assert (String.length str = 4);
let c0 = Char.code (String.unsafe_get str 0) in
let c1 = Char.code (String.unsafe_get str 1) in
let c2 = Char.code (String.unsafe_get str 2) in
let c3 = Char.code (String.unsafe_get str 3) in
Int64.of_int c0 +^
(Int64.shift_left (Int64.of_int c1) 8) +^
(Int64.shift_left (Int64.of_int c2) 16) +^
(Int64.shift_left (Int64.of_int c3) 24)
let le32_of_int i =
let c0 = i &^ 0xffL in
let c1 = Int64.shift_right (i &^ 0xff00L) 8 in
let c2 = Int64.shift_right (i &^ 0xff0000L) 16 in
let c3 = Int64.shift_right (i &^ 0xff000000L) 24 in
let b = Bytes.create 4 in
Bytes.unsafe_set b 0 (Char.unsafe_chr (Int64.to_int c0));
Bytes.unsafe_set b 1 (Char.unsafe_chr (Int64.to_int c1));
Bytes.unsafe_set b 2 (Char.unsafe_chr (Int64.to_int c2));
Bytes.unsafe_set b 3 (Char.unsafe_chr (Int64.to_int c3));
Bytes.to_string b
let int_of_le64 str =
assert (String.length str = 8);
let c0 = Char.code (String.unsafe_get str 0) in
let c1 = Char.code (String.unsafe_get str 1) in
let c2 = Char.code (String.unsafe_get str 2) in
let c3 = Char.code (String.unsafe_get str 3) in
let c4 = Char.code (String.unsafe_get str 4) in
let c5 = Char.code (String.unsafe_get str 5) in
let c6 = Char.code (String.unsafe_get str 6) in
let c7 = Char.code (String.unsafe_get str 7) in
Int64.of_int c0 +^
(Int64.shift_left (Int64.of_int c1) 8) +^
(Int64.shift_left (Int64.of_int c2) 16) +^
(Int64.shift_left (Int64.of_int c3) 24) +^
(Int64.shift_left (Int64.of_int c4) 32) +^
(Int64.shift_left (Int64.of_int c5) 40) +^
(Int64.shift_left (Int64.of_int c6) 48) +^
(Int64.shift_left (Int64.of_int c7) 56)
let le64_of_int i =
let c0 = i &^ 0xffL in
let c1 = Int64.shift_right (i &^ 0xff00L) 8 in
let c2 = Int64.shift_right (i &^ 0xff0000L) 16 in
let c3 = Int64.shift_right (i &^ 0xff000000L) 24 in
let c4 = Int64.shift_right (i &^ 0xff00000000L) 32 in
let c5 = Int64.shift_right (i &^ 0xff0000000000L) 40 in
let c6 = Int64.shift_right (i &^ 0xff000000000000L) 48 in
let c7 = Int64.shift_right (i &^ 0xff00000000000000L) 56 in
let b = Bytes.create 8 in
Bytes.unsafe_set b 0 (Char.unsafe_chr (Int64.to_int c0));
Bytes.unsafe_set b 1 (Char.unsafe_chr (Int64.to_int c1));
Bytes.unsafe_set b 2 (Char.unsafe_chr (Int64.to_int c2));
Bytes.unsafe_set b 3 (Char.unsafe_chr (Int64.to_int c3));
Bytes.unsafe_set b 4 (Char.unsafe_chr (Int64.to_int c4));
Bytes.unsafe_set b 5 (Char.unsafe_chr (Int64.to_int c5));
Bytes.unsafe_set b 6 (Char.unsafe_chr (Int64.to_int c6));
Bytes.unsafe_set b 7 (Char.unsafe_chr (Int64.to_int c7));
Bytes.to_string b
let int_of_be16 str =
assert (String.length str = 2);
let c0 = Char.code (String.unsafe_get str 0) in
let c1 = Char.code (String.unsafe_get str 1) in
Int64.of_int c1 +^
(Int64.shift_left (Int64.of_int c0) 8)
let be16_of_int i =
let c0 = i &^ 0xffL in
let c1 = Int64.shift_right (i &^ 0xff00L) 8 in
let b = Bytes.create 2 in
Bytes.unsafe_set b 0 (Char.unsafe_chr (Int64.to_int c1));
Bytes.unsafe_set b 1 (Char.unsafe_chr (Int64.to_int c0));
Bytes.to_string b
let int_of_be32 str =
assert (String.length str = 4);
let c0 = Char.code (String.unsafe_get str 0) in
let c1 = Char.code (String.unsafe_get str 1) in
let c2 = Char.code (String.unsafe_get str 2) in
let c3 = Char.code (String.unsafe_get str 3) in
Int64.of_int c3 +^
(Int64.shift_left (Int64.of_int c2) 8) +^
(Int64.shift_left (Int64.of_int c1) 16) +^
(Int64.shift_left (Int64.of_int c0) 24)
let be32_of_int i =
let c0 = i &^ 0xffL in
let c1 = Int64.shift_right (i &^ 0xff00L) 8 in
let c2 = Int64.shift_right (i &^ 0xff0000L) 16 in
let c3 = Int64.shift_right (i &^ 0xff000000L) 24 in
let b = Bytes.create 4 in
Bytes.unsafe_set b 0 (Char.unsafe_chr (Int64.to_int c3));
Bytes.unsafe_set b 1 (Char.unsafe_chr (Int64.to_int c2));
Bytes.unsafe_set b 2 (Char.unsafe_chr (Int64.to_int c1));
Bytes.unsafe_set b 3 (Char.unsafe_chr (Int64.to_int c0));
Bytes.to_string b
let int_of_be64 str =
assert (String.length str = 8);
let c0 = Char.code (String.unsafe_get str 0) in
let c1 = Char.code (String.unsafe_get str 1) in
let c2 = Char.code (String.unsafe_get str 2) in
let c3 = Char.code (String.unsafe_get str 3) in
let c4 = Char.code (String.unsafe_get str 4) in
let c5 = Char.code (String.unsafe_get str 5) in
let c6 = Char.code (String.unsafe_get str 6) in
let c7 = Char.code (String.unsafe_get str 7) in
Int64.of_int c7 +^
(Int64.shift_left (Int64.of_int c6) 8) +^
(Int64.shift_left (Int64.of_int c5) 16) +^
(Int64.shift_left (Int64.of_int c4) 24) +^
(Int64.shift_left (Int64.of_int c3) 32) +^
(Int64.shift_left (Int64.of_int c2) 40) +^
(Int64.shift_left (Int64.of_int c1) 48) +^
(Int64.shift_left (Int64.of_int c0) 56)
let be64_of_int i =
let c0 = i &^ 0xffL in
let c1 = Int64.shift_right (i &^ 0xff00L) 8 in
let c2 = Int64.shift_right (i &^ 0xff0000L) 16 in
let c3 = Int64.shift_right (i &^ 0xff000000L) 24 in
let c4 = Int64.shift_right (i &^ 0xff00000000L) 32 in
let c5 = Int64.shift_right (i &^ 0xff0000000000L) 40 in
let c6 = Int64.shift_right (i &^ 0xff000000000000L) 48 in
let c7 = Int64.shift_right (i &^ 0xff00000000000000L) 56 in
let b = Bytes.create 8 in
Bytes.unsafe_set b 0 (Char.unsafe_chr (Int64.to_int c7));
Bytes.unsafe_set b 1 (Char.unsafe_chr (Int64.to_int c6));
Bytes.unsafe_set b 2 (Char.unsafe_chr (Int64.to_int c5));
Bytes.unsafe_set b 3 (Char.unsafe_chr (Int64.to_int c4));
Bytes.unsafe_set b 4 (Char.unsafe_chr (Int64.to_int c3));
Bytes.unsafe_set b 5 (Char.unsafe_chr (Int64.to_int c2));
Bytes.unsafe_set b 6 (Char.unsafe_chr (Int64.to_int c1));
Bytes.unsafe_set b 7 (Char.unsafe_chr (Int64.to_int c0));
Bytes.to_string b
type wrap_break_t = WrapEOS | WrapSpace | WrapNL
let rec wrap ?(chan = stdout) ?(indent = 0) str =
let len = String.length str in
_wrap chan indent 0 0 len str
and _wrap chan indent column i len str =
if i < len then (
let (j, break) = _wrap_find_next_break i len str in
let next_column =
if column + (j-i) >= 76 then (
output_char chan '\n';
output_spaces chan indent;
indent + (j-i) + 1
)
else column + (j-i) + 1 in
output chan (Bytes.of_string str) i (j-i);
match break with
| WrapEOS -> ()
| WrapSpace ->
output_char chan ' ';
_wrap chan indent next_column (j+1) len str
| WrapNL ->
output_char chan '\n';
output_spaces chan indent;
_wrap chan indent indent (j+1) len str
)
and _wrap_find_next_break i len str =
if i >= len then (len, WrapEOS)
else if String.unsafe_get str i = ' ' then (i, WrapSpace)
else if String.unsafe_get str i = '\n' then (i, WrapNL)
else _wrap_find_next_break (i+1) len str
and output_spaces chan n = for i = 0 to n-1 do output_char chan ' ' done
let unique = let i = ref 0 in fun () -> incr i; !i
type ('a, 'b) maybe = Either of 'a | Or of 'b
let protect ~f ~finally =
let r =
try Either (f ())
with exn -> Or exn in
finally ();
match r with Either ret -> ret | Or exn -> raise exn
type 'a return = { return: 'b. 'a -> 'b } (* OCaml >= 4.03: [@@unboxed] *)
(* This requires features in OCaml >= 4.04:
let with_return (type a) f =
let exception Return of a in
try f {return = fun ret -> raise (Return ret)} with Return ret -> ret
*)
(* This should work for any version of OCaml, but it doesn't work
* properly for nested with_return statements. When we can assume
* OCaml >= 4.04 we should use the above definition instead.
*)
let with_return f =
let ret = ref None in
try f {return = fun r -> ret := Some r; raise Exit}
with Exit -> match !ret with None -> assert false | Some r -> r
let failwithf fs = ksprintf failwith fs
exception Executable_not_found of string (* executable *)
let which executable =
if String.find executable Filename.dir_sep <> -1 then (
try Unix.access executable [Unix.X_OK]; executable
with Unix.Unix_error _ -> raise (Executable_not_found executable)
) else (
let paths =
try String.nsplit ":" (Sys.getenv "PATH")
with Not_found -> [] in
let paths = List.filter_map (
fun p ->
let path = p // executable in
try Unix.access path [Unix.X_OK]; Some path
with Unix.Unix_error _ -> None
) paths in
match paths with
| [] -> raise (Executable_not_found executable)
| x :: _ -> x
)
(* Program name. *)
let prog = Filename.basename Sys.executable_name
(* Stores the colours (--colours), quiet (--quiet), trace (-x) and
* verbose (-v) flags in a global variable.
*)
let colours = ref false
let set_colours () = colours := true
let colours () = !colours
let quiet = ref false
let set_quiet () = quiet := true
let quiet () = !quiet
let trace = ref false
let set_trace () = trace := true
let trace () = !trace
let verbose = ref false
let set_verbose () = verbose := true
let verbose () = !verbose
let with_open_in filename f =
let chan = open_in filename in
protect ~f:(fun () -> f chan) ~finally:(fun () -> close_in chan)
let with_open_out filename f =
let chan = open_out filename in
protect ~f:(fun () -> f chan) ~finally:(fun () -> close_out chan)
let with_openfile filename flags perms f =
let fd = Unix.openfile filename flags perms in
protect ~f:(fun () -> f fd) ~finally:(fun () -> Unix.close fd)
let read_whole_file path =
let buf = Buffer.create 16384 in
with_open_in path (
fun chan ->
let maxlen = 16384 in
let b = Bytes.create maxlen in
let rec loop () =
let r = input chan b 0 maxlen in
if r > 0 then (
Buffer.add_substring buf (Bytes.to_string b) 0 r;
loop ()
)
in
loop ()
);
Buffer.contents buf
(* Compare two version strings intelligently. *)
let rex_numbers = Str.regexp "^\\([0-9]+\\)\\(.*\\)$"
let rex_letters = Str.regexp_case_fold "^\\([a-z]+\\)\\(.*\\)$"
let compare_version v1 v2 =
let rec split_version = function
| "" -> []
| str ->
let first, rest =
if Str.string_match rex_numbers str 0 then (
let n = Str.matched_group 1 str in
let rest = Str.matched_group 2 str in
let n =
try `Number (int_of_string n)
with Failure _ -> `String n in
n, rest
)
else if Str.string_match rex_letters str 0 then
`String (Str.matched_group 1 str), Str.matched_group 2 str
else (
let len = String.length str in
`Char str.[0], String.sub str 1 (len-1)
) in
first :: split_version rest
in
compare (split_version v1) (split_version v2)
(* Annoying LVM2 returns a differing UUID strings for different
* function calls (sometimes containing or not containing '-'
* characters), so we have to normalize each string before
* comparison. c.f. 'compare_pvuuids' in virt-filesystem.
*)
let compare_lvm2_uuids uuid1 uuid2 =
let n1 = String.length uuid1 and n2 = String.length uuid2 in
let rec loop i1 i2 =
if i1 = n1 && i2 = n2 then 0 (* matching *)
else if i1 >= n1 then 1 (* different lengths *)
else if i2 >= n2 then -1
else if uuid1.[i1] = '-' then loop (i1+1) i2 (* ignore '-' characters *)
else if uuid2.[i2] = '-' then loop i1 (i2+1)
else (
let c = compare uuid1.[i1] uuid2.[i2] in
if c <> 0 then c (* not matching *)
else loop (i1+1) (i2+1)
)
in
loop 0 0
let stringify_args args =
let rec quote_args = function
| [] -> ""
| x :: xs -> " " ^ Filename.quote x ^ quote_args xs
in
match args with
| [] -> ""
| app :: xs -> app ^ quote_args xs
(* Unlink a temporary file on exit. *)
let unlink_on_exit =
let files = ref [] in
let registered_handlers = ref false in
let rec unlink_files () =
List.iter (
fun file -> try Unix.unlink file with _ -> ()
) !files
and register_handlers () =
(* Unlink on exit. *)
at_exit unlink_files
in
fun file ->
files := file :: !files;
if not !registered_handlers then (
register_handlers ();
registered_handlers := true
)
let is_block_device file =
try (Unix.stat file).Unix.st_kind = Unix.S_BLK
with Unix.Unix_error _ -> false
let is_char_device file =
try (Unix.stat file).Unix.st_kind = Unix.S_CHR
with Unix.Unix_error _ -> false
(* Annoyingly Sys.is_directory throws an exception on failure
* (RHBZ#1022431).
*)
let is_directory path =
try Sys.is_directory path
with Sys_error _ -> false
let absolute_path path =
if not (Filename.is_relative path) then path
else Sys.getcwd () // path
let qemu_input_filename filename =
(* If the filename is something like "file:foo" then qemu-img will
* try to interpret that as "foo" in the file:/// protocol. To
* avoid that, if the path is relative prefix it with "./" since
* qemu-img won't try to interpret such a path.
*)
if String.length filename > 0 && filename.[0] <> '/' then
"./" ^ filename
else
filename
let rec mkdir_p path permissions =
try Unix.mkdir path permissions
with
| Unix.Unix_error (Unix.EEXIST, _, _) -> ()
| Unix.Unix_error (Unix.ENOENT, _, _) ->
(* A component in the path does not exist, so first try
* creating the parent directory, and then again the requested
* directory. *)
mkdir_p (Filename.dirname path) permissions;
Unix.mkdir path permissions
let normalize_arch = function
| "i486" | "i586" | "i686" -> "i386"
| "amd64" -> "x86_64"
| "powerpc" -> "ppc"
| "powerpc64" -> "ppc64"
| "powerpc64le" -> "ppc64le"
| arch -> arch
(* Are guest arch and host_cpu compatible, in terms of being able
* to run commands in the libguestfs appliance?
*)
let guest_arch_compatible guest_arch =
let own = normalize_arch Guestfs_config.host_cpu in
let guest_arch = normalize_arch guest_arch in
match own, guest_arch with
| x, y when x = y -> true
| "x86_64", "i386" -> true
| _ -> false
(* Is the guest OS "Unix-like"? *)
let unix_like = function
| "hurd"
| "linux"
| "minix" -> true
| typ when String.is_suffix typ "bsd" -> true
| _ -> false
(** Return the last part of a string, after the specified separator. *)
let last_part_of str sep =
try
let i = String.rindex str sep in
Some (String.sub str (i+1) (String.length str - (i+1)))
with Not_found -> None
let read_first_line_from_file filename =
with_open_in filename (
fun chan ->
try input_line chan with End_of_file -> ""
)
let is_regular_file path = (* NB: follows symlinks. *)
try (Unix.stat path).Unix.st_kind = Unix.S_REG
with Unix.Unix_error _ -> false
|