ruby-numtheory 0.0.5 → 0.0.6

data/Gemfile

@@ -0,0 +1,8 @@
+source "http://rubygems.org"
+
+group :development do
+  gem "rake", ">= 0.9"
+  gem "rspec", "~> 2.10.0"
+  gem "bundler", ">= 1.0.0"
+  gem "rake-compiler"
+end

data/LICENSE.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2012 Artem Tarasov
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,22 @@
+# ruby-numtheory
+
+The library is written as C extension and aims to provide fast implementations of common number-theoretical algorithms.
+
+## Currently implemented
+
+* powermod (uses sliding window exponentiation)
+* miller-rabin test for primality
+* standard BPSW primality test
+* eratosthenes sieve
+* factorization (via trial division)
+* factorial (uses PrimeSwing algorithm)
+* sigma (σ)
+* moebius (μ)
+* eulerphi (φ)
+* primepi (π)
+* fibonacci
+* modular inverse
+* extended gcd
+* primitive pythagorean triple generator
+* integer square root
+* square root in Z/pZ (for prime p)

data/Rakefile

@@ -0,0 +1,34 @@
+# encoding: utf-8
+
+require 'rubygems'
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+require 'rake'
+
+spec = Gem::Specification.load('ruby-numtheory.gemspec')
+  
+require 'rspec/core'
+require 'rspec/core/rake_task'
+RSpec::Core::RakeTask.new(:spec) do |spec|
+  spec.pattern = FileList["spec/**/*_spec.rb"]
+end
+
+task :test => :spec
+task :default => :test
+
+require 'rubygems/package_task'
+Gem::PackageTask.new(spec) do |pkg|
+end
+
+task :build => :gem
+
+require 'rake/extensiontask'
+Rake::ExtensionTask.new('numtheory', spec) do |ext|
+  ext.cross_compile = true
+end

data/ext/numtheory/Makefile

@@ -0,0 +1,187 @@
+
+SHELL = /bin/sh
+
+#### Start of system configuration section. ####
+
+srcdir = .
+topdir = /usr/local/include/ruby-1.9.1
+hdrdir = /usr/local/include/ruby-1.9.1
+arch_hdrdir = /usr/local/include/ruby-1.9.1/$(arch)
+VPATH = $(srcdir):$(arch_hdrdir)/ruby:$(hdrdir)/ruby
+prefix = $(DESTDIR)/usr/local
+rubylibprefix = $(libdir)/$(RUBY_BASE_NAME)
+exec_prefix = $(prefix)
+vendorhdrdir = $(rubyhdrdir)/vendor_ruby
+sitehdrdir = $(rubyhdrdir)/site_ruby
+rubyhdrdir = $(includedir)/$(RUBY_BASE_NAME)-$(ruby_version)
+vendordir = $(rubylibprefix)/vendor_ruby
+sitedir = $(rubylibprefix)/site_ruby
+ridir = $(datarootdir)/$(RI_BASE_NAME)
+mandir = $(datarootdir)/man
+localedir = $(datarootdir)/locale
+libdir = $(exec_prefix)/lib
+psdir = $(docdir)
+pdfdir = $(docdir)
+dvidir = $(docdir)
+htmldir = $(docdir)
+infodir = $(datarootdir)/info
+docdir = $(datarootdir)/doc/$(PACKAGE)
+oldincludedir = $(DESTDIR)/usr/include
+includedir = $(prefix)/include
+localstatedir = $(prefix)/var
+sharedstatedir = $(prefix)/com
+sysconfdir = $(prefix)/etc
+datadir = $(datarootdir)
+datarootdir = $(prefix)/share
+libexecdir = $(exec_prefix)/libexec
+sbindir = $(exec_prefix)/sbin
+bindir = $(exec_prefix)/bin
+rubylibdir = $(rubylibprefix)/$(ruby_version)
+archdir = $(rubylibdir)/$(arch)
+sitelibdir = $(sitedir)/$(ruby_version)
+sitearchdir = $(sitelibdir)/$(sitearch)
+vendorlibdir = $(vendordir)/$(ruby_version)
+vendorarchdir = $(vendorlibdir)/$(sitearch)
+
+CC = gcc
+CXX = g++
+LIBRUBY = $(LIBRUBY_A)
+LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a
+LIBRUBYARG_SHARED = -Wl,-R -Wl,$(libdir) -L$(libdir) -l$(RUBY_SO_NAME)
+LIBRUBYARG_STATIC = -Wl,-R -Wl,$(libdir) -L$(libdir) -l$(RUBY_SO_NAME)-static
+OUTFLAG = -o 
+COUTFLAG = -o 
+
+RUBY_EXTCONF_H = 
+cflags   =  $(optflags) $(debugflags) $(warnflags)
+optflags = -O3
+debugflags = -ggdb
+warnflags = -Wextra -Wno-unused-parameter -Wno-parentheses -Wpointer-arith -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long
+CFLAGS   = -fPIC $(cflags) 
+INCFLAGS = -I. -I$(arch_hdrdir) -I$(hdrdir)/ruby/backward -I$(hdrdir) -I$(srcdir)
+DEFS     = -D_FILE_OFFSET_BITS=64
+CPPFLAGS =   $(DEFS) $(cppflags)
+CXXFLAGS = $(CFLAGS) $(cxxflags)
+ldflags  = -L.  -rdynamic -Wl,-export-dynamic
+dldflags = 
+ARCH_FLAG = 
+DLDFLAGS = $(ldflags) $(dldflags)
+LDSHARED = $(CC) -shared
+LDSHAREDXX = $(CXX) -shared
+AR = ar
+EXEEXT = 
+
+RUBY_BASE_NAME = ruby
+RUBY_INSTALL_NAME = ruby
+RUBY_SO_NAME = ruby
+arch = i686-linux
+sitearch = $(arch)
+ruby_version = 1.9.1
+ruby = /usr/local/bin/ruby
+RUBY = $(ruby)
+RM = rm -f
+RM_RF = $(RUBY) -run -e rm -- -rf
+RMDIRS = $(RUBY) -run -e rmdir -- -p
+MAKEDIRS = /bin/mkdir -p
+INSTALL = /usr/bin/install -c
+INSTALL_PROG = $(INSTALL) -m 0755
+INSTALL_DATA = $(INSTALL) -m 644
+COPY = cp
+
+#### End of system configuration section. ####
+
+preload = 
+
+libpath = . $(libdir)
+LIBPATH =  -L. -L$(libdir) -Wl,-R$(libdir)
+DEFFILE = 
+
+CLEANFILES = mkmf.log
+DISTCLEANFILES = 
+DISTCLEANDIRS = 
+
+extout = 
+extout_prefix = 
+target_prefix = 
+LOCAL_LIBS = 
+LIBS =   -lpthread -lrt -ldl -lcrypt -lm   -lc
+SRCS = numtheory_macros.c primes.c queue.c reduce.c numtheory.c
+OBJS = numtheory_macros.o primes.o queue.o reduce.o numtheory.o
+TARGET = numtheory
+DLLIB = $(TARGET).so
+EXTSTATIC = 
+STATIC_LIB = 
+
+BINDIR        = $(bindir)
+RUBYCOMMONDIR = $(sitedir)$(target_prefix)
+RUBYLIBDIR    = $(sitelibdir)$(target_prefix)
+RUBYARCHDIR   = $(sitearchdir)$(target_prefix)
+HDRDIR        = $(rubyhdrdir)/ruby$(target_prefix)
+ARCHHDRDIR    = $(rubyhdrdir)/$(arch)/ruby$(target_prefix)
+
+TARGET_SO     = $(DLLIB)
+CLEANLIBS     = $(TARGET).so 
+CLEANOBJS     = *.o  *.bak
+
+all:    $(DLLIB)
+static: $(STATIC_LIB)
+.PHONY: all install static install-so install-rb
+.PHONY: clean clean-so clean-rb
+
+clean-rb-default::
+clean-rb::
+clean-so::
+clean: clean-so clean-rb-default clean-rb
+		@-$(RM) $(CLEANLIBS) $(CLEANOBJS) $(CLEANFILES)
+
+distclean-rb-default::
+distclean-rb::
+distclean-so::
+distclean: clean distclean-so distclean-rb-default distclean-rb
+		@-$(RM) Makefile $(RUBY_EXTCONF_H) conftest.* mkmf.log
+		@-$(RM) core ruby$(EXEEXT) *~ $(DISTCLEANFILES)
+		@-$(RMDIRS) $(DISTCLEANDIRS)
+
+realclean: distclean
+install: install-so install-rb
+
+install-so: $(RUBYARCHDIR)
+install-so: $(RUBYARCHDIR)/$(DLLIB)
+$(RUBYARCHDIR)/$(DLLIB): $(DLLIB)
+	@-$(MAKEDIRS) $(@D)
+	$(INSTALL_PROG) $(DLLIB) $(@D)
+install-rb: pre-install-rb install-rb-default
+install-rb-default: pre-install-rb-default
+pre-install-rb: Makefile
+pre-install-rb-default: Makefile
+$(RUBYARCHDIR):
+	$(MAKEDIRS) $@
+
+site-install: site-install-so site-install-rb
+site-install-so: install-so
+site-install-rb: install-rb
+
+.SUFFIXES: .c .m .cc .cxx .cpp .C .o
+
+.cc.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.cxx.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.cpp.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.C.o:
+	$(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $<
+
+.c.o:
+	$(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -c $<
+
+$(DLLIB): $(OBJS) Makefile
+	@-$(RM) $(@)
+	$(LDSHARED) -o $@ $(OBJS) $(LIBPATH) $(DLDFLAGS) $(LOCAL_LIBS) $(LIBS)
+
+
+
+$(OBJS): $(hdrdir)/ruby.h $(hdrdir)/ruby/defines.h $(arch_hdrdir)/ruby/config.h

data/ext/numtheory/constants.h

@@ -0,0 +1,24 @@
+unsigned long long numtheory_small_factorials[] = 
+{ 1ULL, 1ULL, 2ULL, 6ULL, 24ULL, 120ULL, 720ULL, 5040ULL, 40320ULL, 
+  362880ULL, 3628800ULL, 39916800ULL, 479001600ULL, 6227020800ULL, 
+  87178291200ULL, 1307674368000ULL, 20922789888000ULL, 355687428096000ULL,
+  6402373705728000ULL, 121645100408832000ULL, 2432902008176640000ULL };
+
+unsigned long long numtheory_small_odd_swings[] = 
+{ 1ULL, 1ULL, 1ULL, 3ULL, 3ULL, 15ULL, 5ULL, 35ULL, 35ULL, 315ULL, 63ULL, 
+  693ULL, 231ULL, 3003ULL, 429ULL, 6435ULL, 6435ULL, 109395ULL, 12155ULL, 
+  230945ULL, 46189ULL, 969969ULL, 88179ULL, 2028117ULL, 676039ULL, 16900975ULL,
+  1300075ULL, 35102025ULL, 5014575ULL, 145422675ULL, 9694845ULL, 300540195ULL,
+  300540195ULL, 9917826435ULL, 583401555ULL, 20419054425ULL, 2268783825ULL, 
+  83945001525ULL, 4418157975ULL, 172308161025ULL, 34461632205ULL, 
+  1412926920405ULL, 67282234305ULL, 2893136075115ULL, 263012370465ULL, 
+  11835556670925ULL, 514589420475ULL, 24185702762325ULL, 8061900920775ULL, 
+  395033145117975ULL, 15801325804719ULL, 805867616040669ULL, 61989816618513ULL,
+  3285460280781189ULL, 121683714103007ULL, 6692604275665385ULL, 
+  956086325095055ULL, 54496920530418135ULL, 1879204156221315ULL,
+  110873045217057585ULL, 7391536347803839ULL, 450883717216034179ULL, 
+  14544636039226909ULL, 916312070471295267ULL, 916312070471295267ULL };
+
+char issquare_mod256[] = { 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 };
+
+char issquare_mod255[] = { 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0 };

data/ext/numtheory/extconf.rb

@@ -1,2 +1,3 @@
 require 'mkmf'
+$CFLAGS = "-g -O3 -funroll-all-loops -fPIC -pedantic -std=c99"
 create_makefile 'numtheory'

data/ext/numtheory/numtheory.c

@@ -1,58 +1,26 @@
-#include <ruby.h>
-#include <stdio.h>
-#include <math.h>
+#include "numtheory.h"
 
 #include "primes.h"
 #include "queue.h"
+#include "reduce.h"
 #include "numtheory_macros.c"
 #include "constants.h"
 
-static VALUE numtheory_powermod(int argc, VALUE *argv);
-static VALUE numtheory_int_powermod(VALUE b, VALUE p, VALUE m);
-static VALUE numtheory_miller_rabin_pseudoprime_p(VALUE n);
-static VALUE numtheory_nextprime(VALUE n);
-static VALUE numtheory_precompute_primes_upto(VALUE obj, VALUE n);
-static VALUE numtheory_prime(VALUE obj, VALUE i);
-static VALUE numtheory_prime_p(VALUE n);
-static VALUE numtheory_primepi(VALUE obj, VALUE n);
-static VALUE numtheory_fibonacci(int argc, VALUE *argv);
-static VALUE numtheory_sigma(int argc, VALUE *argv);
-static VALUE numtheory_eulerphi(VALUE obj, VALUE n);
-static VALUE numtheory_moebius(VALUE obj, VALUE n);
-static VALUE numtheory_prime_division(VALUE n);
-static VALUE numtheory_product(VALUE obj, VALUE arr);
-static VALUE numtheory_primes_upto(VALUE min, VALUE max);
-static VALUE numtheory_factorial_primeswing(VALUE n);
-static VALUE numtheory_extended_gcd(VALUE x, VALUE y);
-static VALUE numtheory_modular_inverse(VALUE x, VALUE y);
-static VALUE numtheory_multiplicative_order(VALUE a, VALUE m);
-static VALUE numtheory_pythagorean_triples(VALUE obj, VALUE max_l);
-static VALUE numtheory_popcount(VALUE n);
-static VALUE numtheory_bitlength(VALUE n);
-static VALUE numtheory_jacobi(VALUE a, VALUE n);
-static VALUE numtheory_sqrtmod(VALUE a, VALUE p);
-static VALUE numtheory_isqrt(VALUE n);
-static VALUE numtheory_perfect_square_p(VALUE n);
-static VALUE numtheory_bpsw_pseudoprime_p(VALUE n);
-
 static VALUE mNumTheory;
 static ID primality_tests_ID;
 
-static ID id_rand, id_mod, id_divmod, 
-          id_gcd, id_lcm, id_pow, id_mul;
-
 static unsigned long PRIMES_UPPER_LIMIT = 3141592;
 static unsigned long NUM_OF_PRIMES;
 
-static const VALUE zero = INT2FIX(0);
-static const VALUE one = INT2FIX(1);
-static const VALUE two = INT2FIX(2);
-static const VALUE three = INT2FIX(3);
-static const VALUE four = INT2FIX(4);
-static const VALUE five = INT2FIX(5);
-static const VALUE six = INT2FIX(6);
-static const VALUE seven = INT2FIX(7);
-static const VALUE eight = INT2FIX(8);
+const VALUE zero = INT2FIX(0);
+const VALUE one = INT2FIX(1);
+const VALUE two = INT2FIX(2);
+const VALUE three = INT2FIX(3);
+const VALUE four = INT2FIX(4);
+const VALUE five = INT2FIX(5);
+const VALUE six = INT2FIX(6);
+const VALUE seven = INT2FIX(7);
+const VALUE eight = INT2FIX(8);
 
 /*
  *  The <code>NumTheory</code> module contains basic number-theoretical
@@ -71,6 +39,7 @@ Init_numtheory()
 
     id_rand = rb_intern("rand");
     id_mod = rb_intern("modulo");
+    id_div = rb_intern("div");
     id_divmod = rb_intern("divmod");
     id_gcd = rb_intern("gcd");
     id_lcm = rb_intern("lcm");
@@ -180,150 +149,6 @@ numtheory_precompute_primes_upto(VALUE obj, VALUE n)
     return Qnil;
 }
 
-
-inline static VALUE TO_BIGNUM(VALUE x) {
-    return FIXNUM_P(x) ? rb_int2big(FIX2LONG(x)) : x;
-}
-
-inline static unsigned long TO_ULONG(VALUE x) {
-    if (!FIXNUM_P(x))
-    { 
-      if (rb_big_cmp(x, ULONG2NUM(ULONG_MAX)) != one) 
-        return rb_big2ulong(x);
-      else 
-        rb_raise(rb_eNotImpError, "Not implemented for numbers >= 2**32");
-    } 
-    return FIX2ULONG(x);
-}
-
-inline static int EVEN_P(VALUE x) {
-    return FIXNUM_P(x) ? !(FIX2ULONG(x)&1) : !(RBIGNUM_DIGITS(x)[0]&1);
-}
-
-inline static int ZERO_P(VALUE x) {
-    return FIXNUM_P(x) ? FIX2LONG(x) == 0 : rb_bigzero_p(x); 
-}
-
-inline static VALUE ADD(VALUE x, VALUE y) {
-    return FIXNUM_P(x) ? FIXNUM_P(y) ? 
-                   LONG2NUM(FIX2LONG(x) + FIX2LONG(y)) : 
-                   rb_big_plus(y, x) : 
-           rb_big_plus(x, y);
-}
-
-inline static VALUE SUB(VALUE x, VALUE y) {
-    return (FIXNUM_P(x) && FIXNUM_P(y)) ? 
-                   LONG2NUM(FIX2LONG(x) - FIX2LONG(y)) : 
-           rb_big_minus(TO_BIGNUM(x), y);
-}
-
-#define NEGATE(x) do { if (FIXNUM_P(x)) x = -x; \
-                       else RBIGNUM_SET_SIGN(x, !RBIGNUM_SIGN(x)); } \
-while(0);
-
-inline static VALUE MUL(VALUE x, VALUE y) { 
-    return rb_funcall(x, id_mul, 1, y);
-}
-
-inline static VALUE POW(VALUE b, VALUE p) {
-    return rb_funcall(b, id_pow, 1, p);
-}
-
-inline static VALUE DIV(VALUE x, VALUE y) {
-    if (ZERO_P(y))
-    {
-        rb_raise(rb_eZeroDivError, "divided by 0");
-    }
-    return FIXNUM_P(x) ? FIXNUM_P(y) ?
-                    INT2FIX( FIX2LONG(x) / FIX2LONG(y)) :
-                    zero :
-                rb_big_div(x, y);
-}
-
-inline static VALUE DIVMOD(VALUE x, VALUE y) {
-    return rb_funcall(x, id_divmod, 1, y);
-}
-
-inline static VALUE MOD(VALUE x, VALUE y) {
-    return rb_funcall(x, id_mod, 1, y);
-}
-
-inline static int MOD_4(VALUE x) {
-    return FIXNUM_P(x) ? FIX2LONG(x) & 3 :
-        RBIGNUM_SIGN(x) ? RBIGNUM_DIGITS(x)[0] & 3 :
-                      4 - RBIGNUM_DIGITS(x)[0] & 3;
-}
-
-inline static int MOD_8(VALUE x) {
-    return FIXNUM_P(x) ? FIX2LONG(x) & 7 :
-        RBIGNUM_SIGN(x) ? RBIGNUM_DIGITS(x)[0] & 7 :
-                      8 - RBIGNUM_DIGITS(x)[0] & 7;
-}
-
-inline static int EQL(VALUE x, VALUE y) {
-    return (FIXNUM_P(x) && FIXNUM_P(y)) ? 
-                   x == y : 
-           rb_big_eq(TO_BIGNUM(x), y) == Qtrue;
-}
-
-inline static int MORE(VALUE x, VALUE y) {
-    return (FIXNUM_P(x) && FIXNUM_P(y)) ?
-                   FIX2LONG(x) > FIX2LONG(y) :
-           rb_big_cmp(TO_BIGNUM(x), y) == one;
-}
-
-inline static int LESS(VALUE x, VALUE y) {
-    return (FIXNUM_P(x) && FIXNUM_P(y)) ?
-                   FIX2LONG(x) < FIX2LONG(y) :
-           rb_big_cmp(TO_BIGNUM(x), y) == INT2FIX(-1);
-}
-
-inline static int MORE_EQL(VALUE x, VALUE y) {
-    return (FIXNUM_P(x) && FIXNUM_P(y)) ?
-                   FIX2LONG(x) >= FIX2LONG(y) :
-           rb_big_cmp(TO_BIGNUM(x), y) != INT2FIX(-1);
-}
-
-inline static VALUE ABS(VALUE x) {
-    if (FIXNUM_P(x))
-        return INT2FIX(abs(FIX2LONG(x)));
-    VALUE v = rb_big_clone(x);
-    RBIGNUM_SET_SIGN(v, 1);
-    return v;
-}
-
-inline static int NEGATIVE_P(VALUE x) {
-    return FIXNUM_P(x) ? FIX2LONG(x) < 0 : RBIGNUM_NEGATIVE_P(x);
-}
-
-inline static VALUE CLONE(VALUE x) {
-    return FIXNUM_P(x) ? x : rb_big_clone(x);
-}
-
-inline static int INTEGER_P(VALUE x) {
-    return (TYPE(x) == T_FIXNUM) || (TYPE(x) == T_BIGNUM);
-}
-
-inline static VALUE DOUBLED(VALUE x) {
-    return FIXNUM_P(x) ? LONG2NUM(FIX2LONG(x) << 1) :
-            rb_big_lshift(x, one);
-}
-
-inline static VALUE HALF(VALUE x) {
-    return FIXNUM_P(x) ? INT2FIX(FIX2LONG(x) >> 1) :
-            rb_big_rshift(x, one);
-}
-
-inline static VALUE RIGHT_SHIFT(VALUE x, int s) {
-    return FIXNUM_P(x) ? INT2FIX(FIX2LONG(x) >> s) :
-            rb_big_rshift(x, INT2FIX(s));
-}
-
-#ifdef min
-#undef min
-#endif
-inline static int min(int a, int b) { return a < b ? a : b; }
-
 /*
  *  call-seq:
  *    NumTheory.powermod(base, power, [modulo, one]) -> obj
@@ -362,6 +187,7 @@ numtheory_powermod(int argc, VALUE *argv)
 }
 
 static VALUE int_powermod_sliding_window(VALUE,VALUE,VALUE);
+static VALUE int_powermod_sliding_window_br(VALUE,VALUE,VALUE);
 
 /*
  *  call-seq:
@@ -395,19 +221,30 @@ numtheory_int_powermod(VALUE b, VALUE p, VALUE m){
     {
         b = MOD(b, m);
     }
-    if (FIXNUM_P(p) || RBIGNUM_LEN(p) < 4)
-    {
-        VALUE result = one;
-        FOR_BITS(p, result = MUL(result, result),
-                    {},
-                    result = MUL(result, b),
-                    result = MOD(result, m));
-        return result;
-    } 
-    else 
-    {
+    const int SLIDING_WINDOW_THRESHOLD = 4;
+    const int BARRETT_REDUCE_THRESHOLD = 4;
+
+    int use_barrett = 0,
+        use_sliding_window = 0;
+
+    if (!FIXNUM_P(p) && RBIGNUM_LEN(p) >= SLIDING_WINDOW_THRESHOLD)
+        use_sliding_window = 1;
+
+    if (!FIXNUM_P(m) && RBIGNUM_LEN(m) >= BARRETT_REDUCE_THRESHOLD)
+        use_barrett = 1;
+
+    if (use_barrett)
+        return int_powermod_sliding_window_br(b, p, m);
+
+    if (use_sliding_window)
         return int_powermod_sliding_window(b, p, m);
-    }
+
+    VALUE result = one;
+    FOR_BITS(p, result = MUL(result, result),
+                {},
+                result = MUL(result, b),
+                result = MOD(result, m));
+    return result;
 }
 
 static int tail_zeros(VALUE n)
@@ -1240,7 +1077,7 @@ numtheory_multiplicative_order(VALUE a, VALUE m)
     return result;
 }
 
-inline VALUE* triple_new(VALUE v1, VALUE v2, VALUE v3)
+static inline VALUE* triple_new(VALUE v1, VALUE v2, VALUE v3)
 {
     VALUE* v = malloc(sizeof(VALUE)*3);
     v[0] = v1; v[1] = v2; v[2] = v3;
@@ -1327,7 +1164,7 @@ numtheory_popcount(VALUE n)
     return ULONG2NUM(k);
 }
 
-static int
+int
 int_bitlength(unsigned int v)
 {   
     // taken from http://graphics.stanford.edu/~seander/bithacks.html
@@ -1762,83 +1599,10 @@ numtheory_bpsw_pseudoprime_p(VALUE n)
     return lucas_pseudoprime_p(num, one, RIGHT_SHIFT(SUB(one, INT2FIX(d)), 2));
 }
 
-static VALUE
-int_powermod_sliding_window(VALUE b, VALUE p, VALUE m){
-    VALUE result = one;
-    /* used when p is bignum only */
-    enum { squaring, collecting } state;
-
-    state = collecting;
-    int len, k;
-    int zeros = 0;
-    int pow = 0;
-
-    /* adjusting window size */
-    len = RBIGNUM_LEN(p);
-    if      (len  <  8) k = 4;
-    else if (len  < 20) k = 5;
-    else if (len  < 48) k = 6;
-    else k = 7;
-
-    len = 0;
-    
-    VALUE b_squared = MOD(MUL(b, b), m);
-    VALUE *powers = ALLOCA_N(VALUE, 1<<(k-1));
-    powers[0] = b;
-    int i;
-    /* precomputation of odd powers;
-       powers[n] = (b ** (2n + 1)) % m        */
-    for (i = 1; i < (1<<(k-1)); ++i)
-        powers[i] = MOD(MUL(powers[i-1], b_squared), m);
-
-    FOR_BITS(p, {},
-                { /* if the bit is zero */
-                    if (state == collecting) {
-                        ++ len;
-                        ++ zeros;
-                        pow <<= 1;
-                        if (len == k) {
-                            pow >>= zeros;
-
-                            for (i = len; i > zeros; i--)
-                                result = MOD(MUL(result, result), m);
-                            result = MOD(MUL(result, powers[pow>>1]), m);     
-                            while (zeros--)
-                                result = MOD(MUL(result, result), m);
-
-                            state = squaring; pow = len = zeros = 0;
-                        }
-                    } else {
-                        result = MOD(MUL(result, result), m);
-                    }
-                }, 
-                { /* the bit is one */
-                    if (state == collecting) {
-                        ++ len;
-                        zeros = 0;
-                        pow = (pow << 1) + 1;
-                        if (len == k) {
-                            while (len--)
-                                result = MOD(MUL(result, result), m);
-                            result = MOD(MUL(result, powers[pow>>1]), m);     
-                            state = squaring;
-                            pow = len = 0;
-                        }
-                    } else {
-                        state = collecting;
-                        pow = 1;
-                        len = 1;
-                        zeros = 0;
-                    }
-                }, {});
-    if (len > 0) {
-        pow >>= zeros;
-
-        for (i = len; i > zeros; i--)
-            result = MOD(MUL(result, result), m);
-        result = MOD(MUL(result, powers[pow>>1]), m);     
-        while (zeros--)
-            result = MOD(MUL(result, result), m);
-    }
-    return result;
-}
+DEFINE_POWERMOD_SLIDING_WINDOW(int_powermod_sliding_window,
+                               {}, 
+                               MOD)
+
+DEFINE_POWERMOD_SLIDING_WINDOW(int_powermod_sliding_window_br,
+                               VALUE mu = rb_big_barrett_mu(m),
+                               BARRETT_MOD)