2012-01-18 19:43:34 +01:00
|
|
|
{ stdenv, fetchurl, m4, cxx ? true }:
|
2010-08-04 14:36:35 +02:00
|
|
|
|
2012-01-18 19:43:34 +01:00
|
|
|
stdenv.mkDerivation rec {
|
2010-06-15 11:14:16 +02:00
|
|
|
name = "gmp-4.3.2";
|
|
|
|
|
|
|
|
src = fetchurl {
|
|
|
|
url = "mirror://gnu/gmp/${name}.tar.bz2";
|
|
|
|
sha256 = "0x8prpqi9amfcmi7r4zrza609ai9529pjaq0h4aw51i867064qck";
|
|
|
|
};
|
|
|
|
|
2012-12-28 19:20:09 +01:00
|
|
|
nativeBuildInputs = [ m4 ];
|
2010-06-15 11:14:16 +02:00
|
|
|
|
|
|
|
# Prevent the build system from using sub-architecture-specific
|
|
|
|
# instructions (e.g., SSE2 on i686).
|
2011-01-22 21:26:50 +01:00
|
|
|
#
|
|
|
|
# This is not a problem for Apple machines, which are all alike. In
|
|
|
|
# addition, `configfsf.guess' would return `i386-apple-darwin10.2.0' on
|
|
|
|
# `x86_64-darwin', leading to a 32-bit ABI build, which is undesirable.
|
|
|
|
preConfigure =
|
|
|
|
if !stdenv.isDarwin
|
|
|
|
then "ln -sf configfsf.guess config.guess"
|
|
|
|
else ''echo "Darwin host is `./config.guess`."'';
|
2010-06-15 11:14:16 +02:00
|
|
|
|
2012-01-18 19:43:34 +01:00
|
|
|
configureFlags = if cxx then "--enable-cxx" else "--disable-cxx";
|
2010-08-04 14:36:35 +02:00
|
|
|
|
2013-04-05 08:48:34 +02:00
|
|
|
# The test t-lucnum_ui fails (on Linux/x86_64) when built with GCC 4.8.
|
|
|
|
# Newer versions of GMP don't have that issue anymore.
|
|
|
|
doCheck = false;
|
2010-06-15 11:14:16 +02:00
|
|
|
|
|
|
|
meta = {
|
2014-11-03 12:09:48 +01:00
|
|
|
branch = "4";
|
2014-08-24 16:21:08 +02:00
|
|
|
description = "GNU multiple precision arithmetic library";
|
2010-06-15 11:14:16 +02:00
|
|
|
|
|
|
|
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.
|
|
|
|
'';
|
|
|
|
|
|
|
|
homepage = http://gmplib.org/;
|
2014-06-19 06:19:00 +02:00
|
|
|
license = stdenv.lib.licenses.lgpl3Plus;
|
2010-06-15 11:14:16 +02:00
|
|
|
|
|
|
|
maintainers = [ stdenv.lib.maintainers.ludo ];
|
|
|
|
platforms = stdenv.lib.platforms.all;
|
|
|
|
};
|
|
|
|
}
|