2011-12-14 15:31:56 +01:00
|
|
|
{ stdenv, fetchurl, m4, cxx ? true }:
|
2006-12-13 23:29:40 +01:00
|
|
|
|
2009-06-22 21:55:47 +02:00
|
|
|
stdenv.mkDerivation rec {
|
2012-05-07 22:03:12 +02:00
|
|
|
name = "gmp-5.0.5";
|
2007-12-14 17:35:31 +01:00
|
|
|
|
2006-12-13 23:29:40 +01:00
|
|
|
src = fetchurl {
|
2009-06-22 21:55:47 +02:00
|
|
|
url = "mirror://gnu/gmp/${name}.tar.bz2";
|
2012-05-07 22:03:12 +02:00
|
|
|
sha256 = "1jfymbr90mpn0zw5sg001llqnvf2462y77vgjknrmfs1rjn8ln0z";
|
2006-12-13 23:29:40 +01:00
|
|
|
};
|
2007-12-14 17:35:31 +01:00
|
|
|
|
2012-04-02 00:17:00 +02:00
|
|
|
patches = [ ./ignore-bad-cpuid.patch ];
|
|
|
|
|
2011-12-14 15:31:56 +01:00
|
|
|
buildNativeInputs = [ m4 ];
|
2009-06-29 13:01:10 +02:00
|
|
|
|
2011-05-04 00:38:52 +02:00
|
|
|
configureFlags =
|
|
|
|
# Build a "fat binary", with routines for several sub-architectures (x86).
|
|
|
|
[ "--enable-fat" ]
|
2011-12-14 15:31:56 +01:00
|
|
|
++ (if cxx then [ "--enable-cxx" ] else [ "--disable-cxx" ]);
|
2009-06-29 13:01:10 +02:00
|
|
|
|
2006-12-13 23:29:40 +01:00
|
|
|
doCheck = true;
|
2007-12-14 17:35:31 +01:00
|
|
|
|
2010-06-23 16:35:18 +02:00
|
|
|
enableParallelBuilding = true;
|
|
|
|
|
2007-12-14 17:35:31 +01:00
|
|
|
meta = {
|
2010-03-12 00:24:56 +01:00
|
|
|
description = "GMP, the GNU multiple precision arithmetic library";
|
|
|
|
|
|
|
|
longDescription =
|
|
|
|
'' GMP is a free library for arbitrary precision arithmetic, operating
|
|
|
|
on signed integers, rational numbers, and floating point numbers.
|
|
|
|
There is no practical limit to the precision except the ones implied
|
|
|
|
by the available memory in the machine GMP runs on. GMP has a rich
|
|
|
|
set of functions, and the functions have a regular interface.
|
|
|
|
|
|
|
|
The main target applications for GMP are cryptography applications
|
|
|
|
and research, Internet security applications, algebra systems,
|
|
|
|
computational algebra research, etc.
|
|
|
|
|
|
|
|
GMP is carefully designed to be as fast as possible, both for small
|
|
|
|
operands and for huge operands. The speed is achieved by using
|
|
|
|
fullwords as the basic arithmetic type, by using fast algorithms,
|
|
|
|
with highly optimised assembly code for the most common inner loops
|
|
|
|
for a lot of CPUs, and by a general emphasis on speed.
|
|
|
|
|
|
|
|
GMP is faster than any other bignum library. The advantage for GMP
|
|
|
|
increases with the operand sizes for many operations, since GMP uses
|
|
|
|
asymptotically faster algorithms.
|
|
|
|
'';
|
|
|
|
|
2007-12-14 17:35:31 +01:00
|
|
|
homepage = http://gmplib.org/;
|
2010-03-12 00:24:56 +01:00
|
|
|
license = "LGPLv3+";
|
|
|
|
|
2012-01-28 15:37:53 +01:00
|
|
|
maintainers = [ stdenv.lib.maintainers.ludo stdenv.lib.maintainers.simons ];
|
2010-02-12 15:14:45 +01:00
|
|
|
platforms = stdenv.lib.platforms.all;
|
2007-12-14 17:35:31 +01:00
|
|
|
};
|
2006-12-13 23:29:40 +01:00
|
|
|
}
|