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
|
(* Co-installability tools
* http://coinst.irill.org/
* Copyright (C) 2005-2011 Jérôme Vouillon
* Laboratoire PPS - CNRS Université Paris Diderot
*
* These programs are free software; you can redistribute them and/or
* modify them 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*)
type cudf_reason =
R_conflict of int * int
| R_depends of int * Cudf_types.vpkglist
| R_install of Cudf_types.vpkg
type version
type p = Cudf.package
type pool =
{ mutable size : int;
packages : (string * version, p) Hashtbl.t;
packages_by_name : (string, int list ref) Hashtbl.t;
packages_by_num : (int, p) Hashtbl.t;
num_of_package : (Cudf_types.pkgname * Cudf_types.version, int) Hashtbl.t;
provided_packages :
(string, (Cudf_types.version option * p) list ref) Hashtbl.t }
let new_pool () =
{ size = 0;
packages = Hashtbl.create 101;
packages_by_name = Hashtbl.create 101;
packages_by_num = Hashtbl.create 101;
num_of_package = Hashtbl.create 101;
provided_packages = Hashtbl.create 101 }
(****)
let pp_loc ch (start_pos, end_pos) =
let line { Lexing.pos_lnum = l } = l in
if line start_pos = line end_pos
then Format.fprintf ch "line %d, char %d-%d" (line start_pos) start_pos.Lexing.pos_cnum end_pos.Lexing.pos_cnum
else Format.fprintf ch "lines: %d-%d" (line start_pos) (line end_pos)
let load ic =
try
let p = Cudf_parser.from_in_channel ic in
let infos = Cudf_parser.load p in
Cudf_parser.close p;
infos
with Cudf_parser.Parse_error (s, l) as e ->
Format.eprintf "%a: %s@." pp_loc l s;
raise e
let pkgid p = (p.Cudf.package, p.Cudf.version)
let veqpkg p = (p.Cudf.package, Some (`Eq, p.Cudf.version))
(****)
let get_package_list' h n =
try
Hashtbl.find h n
with Not_found ->
let r = ref [] in
Hashtbl.add h n r;
r
let add_to_package_list h n p =
let l = get_package_list' h n in
l := p :: !l
let get_package_list h n = try !(Hashtbl.find h n) with Not_found -> []
(****)
let print_pack pool ch p =
Format.fprintf ch "%s"
(Cudf_types_pp.string_of_veqpkg
(veqpkg (Hashtbl.find pool.packages_by_num p)))
let print_pack_name pool ch p =
Format.fprintf ch "%s"
(Cudf_types_pp.string_of_pkgname
(Hashtbl.find pool.packages_by_num p).Cudf.package)
(****)
let rec remove_duplicates_rec x (l : int list) =
match l with
[] ->
[x]
| y :: r ->
if x = y then
remove_duplicates_rec x r
else
x :: remove_duplicates_rec y r
let remove_duplicates l =
match l with
[] -> []
| x :: r -> remove_duplicates_rec x r
let normalize_set (l : int list) =
remove_duplicates (List.sort (fun x y -> compare x y) l)
(****)
let print_rules = ref false
module Solver = Solver.F (struct type reason = cudf_reason end)
type reason = cudf_reason
let lookup_packages ?(filter=None) dist pkgname =
let packages = get_package_list dist.provided_packages pkgname in
if filter = None then packages else
List.filter
(fun (v, _) ->
match v with
None -> true
| Some v -> Cudf.version_matches v filter)
packages
let resolve_package_dep dist (p, v) =
List.map (fun (_, p) -> Hashtbl.find dist.num_of_package (pkgid p))
(lookup_packages ~filter:v dist p)
(*
(*XXX*)
let rec print_package_disj ch l =
match l with
[] -> ()
| [p] -> Cudf_types_pp.pp_vpkg ch p
| p :: r -> Cudf_types_pp.pp_vpkg ch p; Format.fprintf ch " | ";
print_package_disj ch r
let rec print_package_list_rec print_var ch l =
match l with
[] -> Format.fprintf ch "NOT AVAILABLE"
| [x] -> print_var ch x
| x :: r -> Format.fprintf ch "%a, %a"
print_var x (print_package_list_rec print_var) r
let print_package_list pool ch l =
Format.fprintf ch "{%a}" (print_package_list_rec pool) l
let resolve_package_dep dist p =
let res = resolve_package_dep dist p in
Format.eprintf "%a == %a@." Cudf_types_pp.pp_vpkg p (print_package_list (print_pack dist)) res;
res
*)
let add_conflict st l =
let l = normalize_set l in
if List.length l > 1 then begin
if !print_rules then begin
Format.printf "conflict (";
List.iter (fun c -> Format.printf " %d" c) l;
Format.printf ")@."
end;
let a = Array.of_list l in
let len = Array.length a in
for i = 0 to len - 2 do
for j = i + 1 to len - 1 do
let p = Solver.lit_of_var a.(i) false in
let p' = Solver.lit_of_var a.(j) false in
Solver.add_rule st [|p; p'|] [R_conflict (a.(i), a.(j))]
done
done
end
let add_depend st deps n l =
let l = normalize_set l in
(* Some packages depend on themselves... *)
if not (List.memq n l) then begin
if !print_rules then begin
Format.printf "%d -> any-of (" n;
List.iter (fun c -> Format.printf " %d" c) l;
Format.printf ")@."
end;
Solver.add_rule st
(Array.of_list
(Solver.lit_of_var n false ::
List.map (fun n' -> Solver.lit_of_var n' true) l))
[R_depends (n, deps)]
end
let generate_rules pool =
let pr = Solver.initialize_problem ~print_var:(print_pack pool) pool.size in
Hashtbl.iter
(fun i p ->
if !print_rules then
Format.eprintf "%a@." (print_pack pool) i;
(* Dependences *)
List.iter
(fun l ->
add_depend pr l i
(List.flatten
(List.map (fun p -> resolve_package_dep pool p) l)))
p.Cudf.depends;
(* Conflicts *)
List.iter
(fun n -> add_conflict pr [i; n])
(normalize_set
(List.flatten
(List.map (fun p -> resolve_package_dep pool p)
p.Cudf.conflicts))))
pool.packages_by_num;
Solver.propagate pr;
pr
(****)
let all_packages = ref true
let parse_packages pool ignored_packages ch =
if pool.size <> 0 then invalid_arg "Cudf_lib.parse_packages";
let st = Common.start_parsing true ch in
let (preamble, pkgs, req) = load ch in
let i = ref 0 in
let versions = Hashtbl.create 107 in
Cudf.iter_packages
(fun p ->
try
let v = Hashtbl.find versions p.Cudf.package in
if v < p.Cudf.version then
Hashtbl.replace versions p.Cudf.package p.Cudf.version
with Not_found ->
Hashtbl.replace versions p.Cudf.package p.Cudf.version)
pkgs;
Cudf.iter_packages
(fun p ->
if
!all_packages || p.Cudf.version = Hashtbl.find versions p.Cudf.package
then begin
Common.parsing_tick st;
Hashtbl.add pool.packages_by_num !i p;
let id = pkgid p in
assert (not (Hashtbl.mem pool.num_of_package id));
Hashtbl.add pool.num_of_package id !i;
add_to_package_list pool.packages_by_name p.Cudf.package !i;
add_to_package_list pool.provided_packages p.Cudf.package
(Some p.Cudf.version, p);
List.iter
(fun (q, v) ->
let v = match v with Some (_, v) -> Some v | None -> None in
add_to_package_list pool.provided_packages q (v, p))
p.Cudf.provides;
incr i
end)
pkgs;
Common.stop_parsing st;
pool.size <- !i
(****)
let package_re = Str.regexp "^\\([^ (]+\\) *( *\\([<=>]+\\) *\\([0-9]+\\) *)$"
let parse_package_dependency pool s =
if not (Str.string_match package_re s 0) then
failwith (Format.sprintf "Bad package name '%s'" s);
let name = Str.matched_group 1 s in
let ver =
try
let rel =
match Str.matched_group 2 s with
"<<" -> `Lt
| "<=" | "<" -> `Leq
| "=" -> `Eq
| ">=" | ">" -> `Geq
| ">>" -> `Gt
| s -> failwith (Format.sprintf "Bad relation '%s'" s)
in
Some (rel, int_of_string (Str.matched_group 3 s))
with Not_found ->
None
in
resolve_package_dep pool (name, ver)
let parse_package_name pool s = get_package_list pool.packages_by_name s
(****)
let rec print_package_disj ch l =
match l with
[] -> ()
| [p] -> Format.fprintf ch "%s" (Cudf_types_pp.string_of_vpkg p)
| p :: r -> Format.fprintf ch "%s | %a"
(Cudf_types_pp.string_of_vpkg p) print_package_disj r
let rec print_package_list_rec print_var ch l =
match l with
[] -> Format.fprintf ch "NOT AVAILABLE"
| [x] -> print_var ch x
| x :: r -> Format.fprintf ch "%a, %a"
print_var x (print_package_list_rec print_var) r
let print_package_list pool ch l =
Format.fprintf ch "{%a}" (print_package_list_rec pool) l
let show_reasons pool l =
if l <> [] then begin
Format.printf "The following constraints cannot be satisfied:@.";
List.iter
(fun r ->
match r with
R_conflict (n1, n2) ->
Format.printf " %a conflicts with %a@."
(print_pack pool) n1 (print_pack pool) n2
| R_depends (n, l) ->
Format.printf " %a depends on %a %a@."
(print_pack pool) n print_package_disj l
(print_package_list (print_pack pool))
(List.flatten (List.map (resolve_package_dep pool) l))
| R_install p ->
Format.printf " need to install %s %a@."
(Cudf_types_pp.string_of_vpkg p)
(print_package_list (print_pack pool))
(resolve_package_dep pool p))
l
end
let conflicts_in_reasons rl = List.fold_left (fun cl -> function R_conflict (i,j) -> (min i j, max i j)::cl | _ -> cl) [] rl
(****)
let compute_conflicts pool =
let conflict_pairs = Hashtbl.create 1000 in
let conflicts = Hashtbl.create 1000 in
Hashtbl.iter
(fun i p ->
List.iter
(fun n ->
let pair = (min n i, max n i) in
if n <> i && not (Hashtbl.mem conflict_pairs pair) then begin
Hashtbl.add conflict_pairs pair ();
add_to_package_list conflicts i n;
add_to_package_list conflicts n i
end)
(normalize_set
(List.flatten
(List.map (fun p -> resolve_package_dep pool p)
p.Cudf.conflicts))))
pool.packages_by_num;
Array.init pool.size (fun i -> get_package_list conflicts i)
let compute_deps dist =
Array.init dist.size (fun i ->
let p = Hashtbl.find dist.packages_by_num i in
List.map
(fun l ->
normalize_set
(List.flatten
(List.map (fun p -> resolve_package_dep dist p)
l)))
p.Cudf.depends)
(****)
let pool_size p = p.size
|