blob: 863ffed429328a84d3e7948064686a8e8f3fbb8c (
plain) (
blame)
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
|
{ fetchurl, fetchpatch, lib, stdenv, gmpxx, perl, gnum4 }:
let version = "1.2"; in
stdenv.mkDerivation {
pname = "ppl";
inherit version;
src = fetchurl {
url = "http://bugseng.com/products/ppl/download/ftp/releases/${version}/ppl-${version}.tar.bz2";
sha256 = "1wgxcbgmijgk11df43aiqfzv31r3bkxmgb4yl68g21194q60nird";
};
patches = [(fetchpatch {
name = "clang5-support.patch";
url = "https://raw.githubusercontent.com/sagemath/sage/9.2/build/pkgs/ppl/patches/clang5-support.patch";
sha256 = "1zj90hm25pkgvk4jlkfzh18ak9b98217gbidl3731fdccbw6hr87";
})];
postPatch = lib.optionalString stdenv.cc.isClang ''
substituteInPlace src/PIP_Tree.cc \
--replace "std::auto_ptr" "std::unique_ptr"
substituteInPlace src/Powerset_inlines.hh src/Pointset_Powerset_inlines.hh \
--replace "std::mem_fun_ref" "std::mem_fn"
'';
nativeBuildInputs = [ perl gnum4 ];
propagatedBuildInputs = [ gmpxx ];
configureFlags = [ "--disable-watchdog" ] ++
lib.optionals stdenv.isDarwin [
"CPPFLAGS=-fexceptions"
"--disable-ppl_lcdd" "--disable-ppl_lpsol" "--disable-ppl_pips"
];
# Beware! It took ~6 hours to compile PPL and run its tests on a 1.2 GHz
# x86_64 box. Nevertheless, being a dependency of GCC, it probably ought
# to be tested.
doCheck = false;
enableParallelBuilding = true;
meta = {
description = "Parma Polyhedra Library";
longDescription = ''
The Parma Polyhedra Library (PPL) provides numerical abstractions
especially targeted at applications in the field of analysis and
verification of complex systems. These abstractions include convex
polyhedra, defined as the intersection of a finite number of (open or
closed) halfspaces, each described by a linear inequality (strict or
non-strict) with rational coefficients; some special classes of
polyhedra shapes that offer interesting complexity/precision tradeoffs;
and grids which represent regularly spaced points that satisfy a set of
linear congruence relations. The library also supports finite
powersets and products of (any kind of) polyhedra and grids and a mixed
integer linear programming problem solver using an exact-arithmetic
version of the simplex algorithm.
'';
homepage = "http://bugseng.com/products/ppl/";
license = lib.licenses.gpl3Plus;
maintainers = [ ];
platforms = lib.platforms.unix;
};
}
|
