gmp 0.5.47 → 0.6.7

data/benchmark/multiply

@@ -1,44 +0,0 @@
-#!/usr/bin/env ruby
-
-require '../ext/gmp'
-
-multiplicands = ARGV
-random_state = GMP::RandState.new
-
-if multiplicands.size > 1
-  m, n = multiplicands[0].to_i, multiplicands[1].to_i
-  x = random_state.urandomb(m)
-  y = random_state.urandomb(n)
-else
-  m = multiplicands[0].to_i
-  x = random_state.urandomb(m)
-  y = x
-end
-
-t = GMP::time { z = x * y }
-iterations = (1 + (1e4 / t)).to_i
-
-if multiplicands.size > 1
-  print "Multiplying %i-bit number with %i-bit number %i times..." % [m, n, iterations]
-else
-  print "Squaring a %i-bit number %i times..." % [m, iterations]
-end
-STDOUT.flush
-
-t0 = GMP::cputime
-iterations.times do
-  z = x * y
-end
-ti = GMP::cputime - t0
-  
-puts "done!"
-ops_per_sec = 1000.0 * iterations / ti
-f = 100.0
-decimals = 0
-while true
-  decimals += 1
-  break if ops_per_sec > f
-  f = f * 0.1
-end
-
-puts "RESULT: %#{decimals}f operations per second\n" % ops_per_sec

data/benchmark/multiply.fnl

@@ -1,47 +0,0 @@
-#!/usr/bin/env ruby
-
-require '../ext/gmp'
-
-multiplicands = ARGV
-random_state = GMP::RandState.new
-
-if multiplicands.size > 1
-  m, n = multiplicands[0].to_i, multiplicands[1].to_i
-  x = random_state.urandomb(m)
-  y = random_state.urandomb(n)
-else
-  m = multiplicands[0].to_i
-  x = random_state.urandomb(m)
-  y = x
-end
-
-z = GMP::Z()
-#t = GMP::time { z = x * y }
-t = GMP::time { GMP::Z.mul(z,x,y) }
-iterations = (1 + (1e4 / t)).to_i
-
-if multiplicands.size > 1
-  print "Multiplying %i-bit number with %i-bit number %i times..." % [m, n, iterations]
-else
-  print "Squaring a %i-bit number %i times..." % [m, iterations]
-end
-STDOUT.flush
-
-t0 = GMP::cputime
-iterations.times do
-  #z = x * y
-  GMP::Z.mul(z,x,y)
-end
-ti = GMP::cputime - t0
-  
-puts "done!"
-ops_per_sec = 1000.0 * iterations / ti
-f = 100.0
-decimals = 0
-while true
-  decimals += 1
-  break if ops_per_sec > f
-  f = f * 0.1
-end
-
-puts "RESULT: %#{decimals}f operations per second\n" % ops_per_sec

data/benchmark/multiply.gc

@@ -1,57 +0,0 @@
-#!/usr/bin/env ruby
-
-require '../ext/gmp'
-
-multiplicands = ARGV
-random_state = GMP::RandState.new
-
-if multiplicands.size > 1
-  m, n = multiplicands[0].to_i, multiplicands[1].to_i
-  x = random_state.urandomb(m)
-  y = random_state.urandomb(n)
-else
-  m = multiplicands[0].to_i
-  x = random_state.urandomb(m)
-  y = x
-end
-
-t = GMP::time { z = x * y }
-iterations = (1 + (1e4 / t)).to_i
-
-if multiplicands.size > 1
-  print "Multiplying %i-bit number with %i-bit number %i times..." % [m, n, iterations]
-else
-  print "Squaring a %i-bit number %i times..." % [m, iterations]
-end
-STDOUT.flush
-
-t0 = GMP::cputime
-#iterations.times do
-#  z = x * y
-#end
-parts = 512
-foo = iterations / parts
-bar = iterations % parts
-foo.times do
-  parts.times do
-    z = x * y
-  end
-  GC.start
-end
-bar.times do
-  z = x * y
-end
-
-ti = GMP::cputime - t0
-  
-puts "done!"
-ops_per_sec = 1000.0 * iterations / ti
-f = 100.0
-decimals = 0
-while true
-  decimals += 1
-  break if ops_per_sec > f
-  f = f * 0.1
-end
-
-puts "RESULT: %#{decimals}f operations per second\n" % ops_per_sec

data/benchmark/pi

@@ -1,126 +0,0 @@
-#!/usr/bin/env ruby
-
-require '../ext/gmp'
-
-A = 13591409
-B = 545140134
-C = 640320
-D = 12
-
-BITS_PER_DIGIT  = 3.32192809488736234787
-DIGITS_PER_ITER = 14.1816474627254776555
-DOUBLE_PREC     = 53
-INIT_FACS       = 32
-
-def my_sqrt_ui(r, x)
-  prec0 = r.prec
-  if prec0 < DOUBLE_PREC
-    r = GMP::F(Math.sqrt(x))
-    return
-  end
-
-  bits = 0
-  prec = prec0
-  while prec > DOUBLE_PREC
-    bit = prec & 1
-    prec = (prec+bit)/2
-    bits = bits*2 + bit
-  end
-
-  @t1.prec_raw=DOUBLE_PREC
-  @t1 = GMP::F(1/Math.sqrt(x))
-
-  while prec < prec0
-    prec *= 2
-    break if prec >= prec0
-    @t2.prec_raw=prec
-    @t2 = @t1 * @t1       # half x half -> full
-    @t2 *= x
-    @t2 = 1 - @t2
-    @t2.prec_raw=prec/2
-    @t2.div_2exp(@t2, 1)
-    @t2 *= @t1            # half x half -> half
-    @t1.prec_raw=prec
-    @t1 += @t2
-
-    prec -= bits & 1
-    bits /= 2
-  end
-
-  @t2.prec_raw=prec0/2
-  @t2 = @t1 * x
-  r = @t2 * @t2         # half * half -> full
-  r = x - r
-  @t1 *= r              # half * half -> half
-  @t1.div_2exp(@t1, 1)
-  r = @t1+@t2
-end
-
-def my_div(r, y, x)
-  prec0 = r.prec
-  if prec0 <= DOUBLE_PREC
-    r = GMP::F(y.to_f / x.to_f)
-    return
-  end
-
-  bits = 0
-  prec = prec0
-  while prec > DOUBLE_PREC
-    bit = prec & 1
-    prec = (prec+bit)/2
-    bits = bits*2 + bit
-  end
-
-  @t1.prec_raw=DOUBLE_PREC
-  @t1 = 1 / x
-
-  while prec < prec0
-    prec *= 2
-    if prec < prec0
-      @t2.prec_raw=prec
-      @t2 = x * @t1        # full x half -> full
-      @t2 = 1 - @t2
-      @t2.prec_raw=prec/2
-      @t2 *= @t1           # half * half -> half
-      @t1.prec_raw=prec
-      @t1 += @t2
-    else
-      prec = prec0
-      @t2.prec_raw=prec/2
-      @t2 = @t1 * y        # half * half -> half
-      r = x * @t2          # full * half -> full
-      r = y - r
-      t1 *= r              # half * half -> half
-      r = t1 + t2
-      break
-    end
-
-    prec -= bits & 1
-    bits /= 2
-  end
-end
-
-def min(x,y); x < y ? x : y; end
-def max(x,y); x > y ? x : y; end
-
-Fac_t = Struct.new(max_facs, num_facs, fac, pow)
-Sieve_t = Struct.new(fac, pow, nxt);
-
-sieve = Sieve_t.new
-ftmp = Fac_t.new
-fmul = Fac_t.new
-
-def fac_show(f)
-  (0...(f.num_facs)).each do |f|
-    if f.pow[i] == 1
-      print "#{f.fac[i]} "
-    else
-      print "#{f.fac[i]}^#{f.pow[i]} "
-    end
-  end
-  puts ""
-end
-
-def fac_reset(f)
-  f.num_facs = 0
-end

data/benchmark/rsa

@@ -1,93 +0,0 @@
-#!/usr/bin/env ruby
-
-require '../ext/gmp'
-
-RSA_EXP = 0x10001
-
-def rsa_sign(msg, p, q, pq, p_i_q, dp, dq)
-  pr = msg.powmod(dp, p)
-  qr = msg.powmod(dq, q)
-  
-  qr_m_pr = qr - pr
-  
-  t = qr_m_pr * p_i_q
-  o = t % q
-  
-  t = o * p
-  smsg = pr + t
-  smsg % pq
-end
-
-n = ARGV[0].to_i
-random_state = GMP::RandState.new
-
-print "Generating p, q, d..."
-STDOUT.flush
-
-pq = GMP::Z()
-while pq != 1
-  p = random_state.urandomb(n/2)
-  p[n/2 - 1] = true
-  p[n/2 - 2] = true
-  p[0]       = true
-  
-  q = random_state.urandomb(n/2)
-  q[n/2 - 1] = true
-  q[n/2 - 2] = true
-  q[0]       = true
-  
-  pq = p.gcd(q)
-end
-
-pq = p * q
-
-e = GMP::Z(RSA_EXP)
-
-pm1 = p - 1
-qm1 = q - 1
-phi = pm1 * qm1
-d = e.invert(phi)
-
-puts "done; pq is %i bits" % pq.sizeinbase(2)
-puts "Precomputing CRT constants"
-
-p_i_q = p.invert(q)
-
-dp = d % pm1
-dq = d % qm1
-
-puts "Generating random messages"
-
-msg = []
-(0...1024).each do |i|
-  msg << random_state.urandomb(n)
-end
-
-print "Calibrating CPU speed..."
-STDOUT.flush
-t = GMP::time { smsg = rsa_sign(msg[0], p, q, pq, p_i_q, dp, dq) }
-puts "done"
-
-iterations = (1e4 / t).to_i
-iterations = 1 if iterations == 0
-
-print "Signing random messages %i times..." % iterations
-STDOUT.flush
-
-t0 = GMP::cputime
-(1..iterations).to_a.reverse.each do |i|
-  smsg = rsa_sign(msg[i % 1024], p, q, pq, p_i_q, dp, dq)
-end
-ti = GMP::cputime - t0
-  
-puts "done!"
-ops_per_sec = 1000.0 * iterations / ti
-f = 100.0
-decimals = 0
-while true
-  decimals += 1
-  break if ops_per_sec > f
-  f = f * 0.1
-end
-
-puts "RESULT: %#{decimals}f operations per second\n" % ops_per_sec

data/benchmark/runbench

@@ -1,147 +0,0 @@
-#! /bin/sh
-
-# Copyright 2003 Free Software Foundation, Inc.
-
-# This file is part of the GNU GMPbench.
-
-# 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., 59 Temple
-# Place - Suite 330, Boston, MA 02111-1307, USA.
-
-
-echo "***** GMPbench version `cat version` *****"
-
-
-default=false
-
-if [ "$1" = -n ]
-  then
-    echo "Suppressing compilation"
-  else
-    if [ -z "$CFLAGS" ]
-      then
-	CFLAGS="-O3 -fomit-frame-pointer"
-	echo "Using default CFLAGS = \"$CFLAGS\""
-	default=true
-      else
-	echo "Using CFLAGS = \"$CFLAGS\" from your environment"
-      fi
-    if [ -z "$CC" ]
-      then
-	CC="gcc"
-	echo "Using default CC = \"$CC\""
-	default=true
-      else
-	echo "Using CC = \"$CC\" from your environment"
-      fi
-    if [ -z "$LIBS" ]
-      then
-	LIBS="-static -lgmp"
-	echo "Using default LIBS = \"$LIBS\""
-	default=true
-      else
-	echo "Using LIBS = \"$LIBS\" from your environment"
-      fi
-
-    echo "Using compilation command: $CC $CFLAGS foo.c -o foo $LIBS"
-
-    if $default
-      then
-	echo "You may want to override CC, CFLAGS, and LIBS"
-      fi
-
-    $CC $CFLAGS gmpver.c $LIBS
-    `mv a.exe a.out`
-    echo "Using `./a.out`"
-
-    echo "Compiling benchmarks"
-    $CC $CFLAGS gcd.c -o gcd $LIBS
-    $CC $CFLAGS gcdext.c -o gcdext $LIBS
-    $CC $CFLAGS multiply.c -o multiply $LIBS
-    $CC $CFLAGS divide.c -o divide $LIBS
-    $CC $CFLAGS rsa.c -o rsa $LIBS
-    $CC $CFLAGS pi.c -o pi $LIBS -lm
-  fi
-
-multiply_args="128 512 8192 131072 2097152 128,128 512,512 8192,8192 131072,131072 2097152,2097152 15000,10000 20000,10000 30000,10000 16777216,512 16777216,262144"
-multiply_weight=1
-
-divide_args="8192,32 8192,64 8192,128 8192,4096 131072,65536 8388608,4194304 8192,8064 16777216,262144"
-divide_weight=1
-
-gcd_args="128,128 512,512 8192,8192 131072,131072 1048576,1048576"
-gcd_weight=0.5
-
-gcdext_args="128,128 512,512 8192,8192 131072,131072 1048576,1048576"
-gcdext_weight=0.5
-
-rsa_args="512 1024 2048"
-rsa_weight=1
-
-pi_args="10000 100000 1000000"
-pi_weight=1
-
-# base_tests="multiply divide gcd gcdext"
-base_tests="multiply divide gcd"
-# app_tests="rsa pi"
-app_tests="rsa"
-
-tests="base app"
-
-echo "Running benchmarks (propagated score accuracy exceeds printed intermediates)"
-
-acc2=1
-n2=0
-for cat in $tests
-  do
-    echo "  Category $cat"
-    eval tests=\$${cat}_tests
-
-    acc1=1
-    n1=0
-    for t in $tests
-      do
-	eval weight=\$${t}_weight
-	echo "    Program $t (weight=$weight)"
-	eval args=\$${t}_args
-
-	acc=1
-	n=0
-	for a in $args
-	  do
-	    ta=`echo $a | sed 's;,; ;g'`
-	    printf '      %-48s' "GMPbench.$cat.$t($a)"
-	    ./$t $ta >RES-$t-$a
-	    res=`grep "^RESULT" RES-$t-$a | sed 's;^RESULT: \([0-9.]*\).*$;\1;'`
-	    printf '%12s\n' `gexpr -prec 4 "$res"`
-	    acc=`gexpr -prec 10 "$acc * $res"`
-	    n=`gexpr $n+1`
-	  done
-
-	out=`gexpr -prec 10 "$acc^(1/$n)"`
-	printf '    %-40s%12s\n' "GMPbench.$cat.$t" `gexpr -prec 5 "$out"`
-	acc1=`gexpr -prec 10 "$acc1 * $out^$weight"`
-	n1=`gexpr $n1+$weight`
-      done
-
-    out=`gexpr -prec 10 "$acc1^(1/$n1)"`
-    printf '  %-32s%12s\n' "GMPbench.$cat" `gexpr -prec 5 "$out"`
-    acc2=`gexpr -prec 10 "$acc2 * $out"`
-    n2=`gexpr $n2+1`
-  done
-
-
-out=`gexpr "$acc2^(1/$n2)"`
-echo "GMPbench:         $out"
-
-exit 0