[catacomb] / math / Makefile.am

### -*-makefile-*-
###
### Build script for mathematical infrastructure
###
### (c) 2013 Straylight/Edgeware
###

###----- Licensing notice ---------------------------------------------------
###
### This file is part of Catacomb.
###
### Catacomb is free software; you can redistribute it and/or modify
### it under the terms of the GNU Library General Public License as
### published by the Free Software Foundation; either version 2 of the
### License, or (at your option) any later version.
###
### Catacomb 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 Library General Public License for more details.
###
### You should have received a copy of the GNU Library General Public
### License along with Catacomb; if not, write to the Free
### Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
### MA 02111-1307, USA.

include $(top_srcdir)/vars.am

noinst_LTLIBRARIES	 = libmath.la
libmath_la_SOURCES	 =
nodist_libmath_la_SOURCES =
libmath_la_LIBADD	 =

TEST_LIBS		 = libmath.la

###--------------------------------------------------------------------------
### Representation of multiprecision integers.

## The `mpgen' tool for dealing with these things.
mpgen			 = $(srcdir)/mpgen
EXTRA_DIST		+= mpgen
AM_V_MPGEN		 = $(AM_V_MPGEN_$(V))
AM_V_MPGEN_		 = $(AM_V_MPGEN_$(AM_DEFAULT_VERBOSITY))
AM_V_MPGEN_0		 = @echo "  MPGEN  $@";
MPGEN			 = $(AM_V_MPGEN)$(PYTHON) $(mpgen)

## The type information collected by `configure'.
CLEANFILES		+= typeinfo.py
EXTRA_DIST		+= typeinfo.py.in
typeinfo.py: $(srcdir)/typeinfo.py.in Makefile
	$(SUBST) $(srcdir)/typeinfo.py.in >typeinfo.py.new \
		type_bits="@type_bits@" \
		limits="@limits@" && \
	mv typeinfo.py.new typeinfo.py

## The header file containing our representation choices.
BUILT_SOURCES		+= mptypes.h
CLEANFILES		+= mptypes.h
nodist_archinclude_HEADERS += mptypes.h
mptypes.h: $(mpgen) typeinfo.py
	$(MPGEN) mptypes >mptypes.h.in && mv mptypes.h.in mptypes.h

## Limits of C types as multiprecision integers.
BUILT_SOURCES		+= mplimits.h mplimits.c
CLEANFILES		+= mplimits.h mplimits.c
nodist_archinclude_HEADERS += mplimits.h
nodist_libmath_la_SOURCES += mplimits.c
mplimits.h: $(mpgen) typeinfo.py
	$(MPGEN) mplimits_h >mplimits.h.in && mv mplimits.h.in mplimits.h
mplimits.c: $(mpgen) typeinfo.py
	$(MPGEN) mplimits_c >mplimits.c.in && mv mplimits.c.in mplimits.c

###--------------------------------------------------------------------------
### Main multiprecision integer library.

## Additional buffer I/O functions for mathematical objects.
pkginclude_HEADERS	+= buf.h
libmath_la_SOURCES	+= buf.c

## Infrastructure for fast exponentiation.
pkginclude_HEADERS	+= exp.h
libmath_la_SOURCES	+= exp.c

## Main user-visible multiprecision arithmetic.
pkginclude_HEADERS	+= mp.h
libmath_la_SOURCES	+= mp-arith.c
TESTS			+= mp-arith.t$(EXEEXT)
libmath_la_SOURCES	+= mp-const.c
libmath_la_SOURCES	+= mp-exp.c mp-exp.h
libmath_la_SOURCES	+= mp-gcd.c
TESTS			+= mp-gcd.t$(EXEEXT)
libmath_la_SOURCES	+= mp-io.c
libmath_la_SOURCES	+= mp-jacobi.c
TESTS			+= mp-jacobi.t$(EXEEXT)
libmath_la_SOURCES	+= mp-mem.c
libmath_la_SOURCES	+= mp-misc.c
libmath_la_SOURCES	+= mp-modexp.c
TESTS			+= mp-modexp.t$(EXEEXT)
libmath_la_SOURCES	+= mp-modsqrt.c
TESTS			+= mp-modsqrt.t$(EXEEXT)
libmath_la_SOURCES	+= mp-sqrt.c
TESTS			+= mp-sqrt.t$(EXEEXT)
libmath_la_SOURCES	+= mp-test.c
EXTRA_DIST		+= t/mp

## Computing Fibonacci numbers.
pkginclude_HEADERS	+= mp-fibonacci.h
libmath_la_SOURCES	+= mp-fibonacci.c
TESTS			+= mp-fibonacci.t$(EXEEXT)

## Special memory allocation for multiprecision integers.
pkginclude_HEADERS	+= mparena.h
libmath_la_SOURCES	+= mparena.c

## Barrett reduction, an efficient method for modular reduction.
pkginclude_HEADERS	+= mpbarrett.h
libmath_la_SOURCES	+= mpbarrett.c
TESTS			+= mpbarrett.t$(EXEEXT)
libmath_la_SOURCES	+= mpbarrett-exp.c mpbarrett-mexp.c mpbarrett-exp.h
TESTS			+= mpbarrett-exp.t$(EXEEXT) mpbarrett-mexp.t$(EXEEXT)
TESTS			+= mpbarrett.t$(EXEEXT)
EXTRA_DIST		+= t/mpbarrett

## Solving congruences using the Chinese Remainder Theorem.
pkginclude_HEADERS	+= mpcrt.h
libmath_la_SOURCES	+= mpcrt.c
TESTS			+= mpcrt.t$(EXEEXT)
EXTRA_DIST		+= t/mpcrt

## Conversions between machine-native and multiprecision integers.
pkginclude_HEADERS	+= mpint.h
libmath_la_SOURCES	+= mpint.c
TESTS			+= mpint.t$(EXEEXT)
EXTRA_DIST		+= t/mpint

## Montgomery reduction, a clever method for modular arithmetic.
pkginclude_HEADERS	+= mpmont.h
libmath_la_SOURCES	+= mpmont.c
TESTS			+= mpmont.t$(EXEEXT)
libmath_la_SOURCES	+= mpmont-exp.c mpmont-mexp.c mpmont-exp.h
TESTS			+= mpmont-exp.t$(EXEEXT) mpmont-mexp.t$(EXEEXT)
EXTRA_DIST		+= t/mpmont

## Efficient multiplication of many small numbers.
pkginclude_HEADERS	+= mpmul.h
libmath_la_SOURCES	+= mpmul.c
TESTS			+= mpmul.t$(EXEEXT)

## Generating random numbers.
pkginclude_HEADERS	+= mprand.h
libmath_la_SOURCES	+= mprand.c

## Efficient reduction modulo numbers with conveninent binary
## representations.
pkginclude_HEADERS	+= mpreduce.h
libmath_la_SOURCES	+= mpreduce.c mpreduce-exp.h
TESTS			+= mpreduce.t$(EXEEXT)
EXTRA_DIST		+= t/mpreduce

## Iteratiion over the bianry representation of multiprecision integers.
pkginclude_HEADERS	+= mpscan.h
libmath_la_SOURCES	+= mpscan.c

## Conversion between multiprecision integers and their textual
## representations.
pkginclude_HEADERS	+= mptext.h
libmath_la_SOURCES	+= mptext.c
TESTS			+= mptext.t$(EXEEXT)
libmath_la_SOURCES	+= mptext-dstr.c
libmath_la_SOURCES	+= mptext-file.c
libmath_la_SOURCES	+= mptext-len.c
libmath_la_SOURCES	+= mptext-string.c
EXTRA_DIST		+= t/mptext

## Low-level multiprecision arithmetic.
pkginclude_HEADERS	+= mpx.h bitops.h mpw.h
libmath_la_SOURCES	+= mpx.c
TESTS			+= mpx.t$(EXEEXT)
libmath_la_SOURCES	+= karatsuba.h mpx-kmul.c mpx-ksqr.c
TESTS			+= mpx-kmul.t$(EXEEXT) mpx-ksqr.t$(EXEEXT)
noinst_PROGRAMS		+= bittest
TESTS			+= bittest
EXTRA_DIST		+= t/mpx
if CPUFAM_X86
libmath_la_SOURCES	+= mpx-mul4-x86-sse2.S
endif
if CPUFAM_AMD64
libmath_la_SOURCES	+= mpx-mul4-amd64-sse2.S
endif

## A quick-and-dirty parser, used for parsing descriptions of groups, fields,
## etc.
pkginclude_HEADERS	+= qdparse.h
libmath_la_SOURCES	+= qdparse.c

## Pollard's `rho' algorithm for determining discrete logarithms.
pkginclude_HEADERS	+= rho.h
libmath_la_SOURCES	+= rho.c
TESTS			+= rho.t$(EXEEXT)

###--------------------------------------------------------------------------
### Prime number checking, searching, and related jobs.

## Generating Lim--Lee groups, i.e., unit groups of finite fields without
## small subgroups (except for the obvious ones).
pkginclude_HEADERS	+= limlee.h
libmath_la_SOURCES	+= limlee.c

## A table of small prime numbers.
pkginclude_HEADERS	+= $(precomp)/math/primetab.h
nodist_libmath_la_SOURCES += ../precomp/math/primetab.c
PRECOMPS		+= $(precomp)/math/primetab.h \
			   $(precomp)/math/primetab.c
PRECOMP_PROGS		+= genprimes
genprimes_LDADD		 = $(mLib_LIBS)
if !CROSS_COMPILING
$(precomp)/math/primetab.h: $(precomp)/math/primetab.c
$(precomp)/math/primetab.c:
	$(AM_V_at)$(MKDIR_P) $(precomp)/math
	$(AM_V_at)$(MAKE) genprimes$(EXEEXT)
	$(AM_V_GEN)./genprimes -sCATACOMB_PRIMETAB_H \
		-h$(precomp)/math/primetab.h -c$(precomp)/math/primetab.c \
		-n256 -t"unsigned short" -iprimetab
endif

## Filtering candidate prime numbers by checking for small factors
## efficiently.
pkginclude_HEADERS	+= pfilt.h
libmath_la_SOURCES	+= pfilt.c

## Generating prime numbers (and other kinds of numbers which need searching
## for).
pkginclude_HEADERS	+= pgen.h
libmath_la_SOURCES	+= pgen.c
libmath_la_SOURCES	+= pgen-gcd.c
libmath_la_SOURCES	+= pgen-simul.c
libmath_la_SOURCES	+= pgen-stdev.c
TESTS			+= pgen.t$(EXEEXT)
EXTRA_DIST		+= t/pgen

## Finding primitive elements in finite fields.
pkginclude_HEADERS	+= prim.h
libmath_la_SOURCES	+= prim.c

## Iterating over all prime numbers from a given starting point.
pkginclude_HEADERS	+= primeiter.h
libmath_la_SOURCES	+= primeiter.c
TESTS			+= primeiter.t$(EXEEXT)
primeiter.lo: $(precomp)/math/wheel.h

## The Miller--Rabin primality test.
pkginclude_HEADERS	+= rabin.h
libmath_la_SOURCES	+= rabin.c

## Finding `strong' primes, using Gordon's algorithm.  Once upon a time,
## products of these kinds of numbers were harder to factor.
pkginclude_HEADERS	+= strongprime.h
libmath_la_SOURCES	+= strongprime.c

## A `wheel', used by the prime iteration machinery.
pkginclude_HEADERS	+= $(precomp)/math/wheel.h
nodist_libmath_la_SOURCES += ../precomp/math/wheel.c
PRECOMPS		+= $(precomp)/math/wheel.h $(precomp)/math/wheel.c
PRECOMP_PROGS		+= genwheel
genwheel_LDADD		 = $(mLib_LIBS)
if !CROSS_COMPILING
$(precomp)/math/wheel.h: $(precomp)/math/wheel.c
$(precomp)/math/wheel.c:
	$(AM_V_at)$(MKDIR_P) $(precomp)/math
	$(AM_V_at)$(MAKE) genwheel$(EXEEXT)
	$(AM_V_GEN)./genwheel -sCATACOMB_WHEEL_H \
		-h$(precomp)/math/wheel.h -c$(precomp)/math/wheel.c \
		-n5 -t"unsigned char" -iwheel
endif

###--------------------------------------------------------------------------
### Binary polynomial arithmetic.

## User-visible binary polynomial arithmetic.
pkginclude_HEADERS	+= gf.h
libmath_la_SOURCES	+= gf-arith.c
TESTS			+= gf-arith.t$(EXEEXT)
libmath_la_SOURCES	+= gf-exp.c gf-exp.h
libmath_la_SOURCES	+= gf-gcd.c
TESTS			+= gf-gcd.t$(EXEEXT)
EXTRA_DIST		+= t/gf

## Low-level binary polynomial arithmetic.
pkginclude_HEADERS	+= gfx.h
libmath_la_SOURCES	+= gfx.c
TESTS			+= gfx.t$(EXEEXT)
libmath_la_SOURCES	+= gfx-kmul.c
TESTS			+= gfx-kmul.t$(EXEEXT)
libmath_la_SOURCES	+= gfx-sqr.c
nodist_libmath_la_SOURCES += ../precomp/math/gfx-sqrtab.c
PRECOMPS		+= $(precomp)/math/gfx-sqrtab.c
PRECOMP_PROGS		+= gfx-sqr-mktab
if !CROSS_COMPILING
$(precomp)/math/gfx-sqrtab.c:
	$(AM_V_at)$(MKDIR_P) $(precomp)/math
	$(AM_V_at)$(MAKE) gfx-sqr-mktab$(EXEEXT)
	$(AM_V_GEN)./gfx-sqr-mktab >$(precomp)/math/gfx-sqrtab.c.new && \
		mv $(precomp)/math/gfx-sqrtab.c.new \
			$(precomp)/math/gfx-sqrtab.c
endif
TESTS			+= gfx-sqr.t$(EXEEXT)
EXTRA_DIST		+= t/gfx

## Conversions between normal and polynomial basis representations for binary
## fields.
pkginclude_HEADERS	+= gfn.h
libmath_la_SOURCES	+= gfn.c
TESTS			+= gfn.t$(EXEEXT)
EXTRA_DIST		+= t/gfn

## Efficient reduction modulo sparse polynomials.
pkginclude_HEADERS	+= gfreduce.h
libmath_la_SOURCES	+= gfreduce.c gfreduce-exp.h
TESTS			+= gfreduce.t$(EXEEXT)
EXTRA_DIST		+= t/gfreduce

###--------------------------------------------------------------------------
### Abstractions for various kinds of algebraic objects.

## Abstract cyclic groups.
pkginclude_HEADERS	+= group.h group-guts.h
libmath_la_SOURCES	+= group-dstr.c
libmath_la_SOURCES	+= group-exp.c group-exp.h
libmath_la_SOURCES	+= group-file.c
libmath_la_SOURCES	+= group-parse.c
libmath_la_SOURCES	+= group-stdops.c
libmath_la_SOURCES	+= group-string.c
libmath_la_SOURCES	+= g-bin.c
libmath_la_SOURCES	+= g-prime.c
libmath_la_SOURCES	+= g-ec.c
EXTRA_DIST		+= group-test.c
TESTS			+= group-test.t$(EXEEXT)
EXTRA_DIST		+= t/group

## Abstract finite fields.
pkginclude_HEADERS	+= field.h field-guts.h
libmath_la_SOURCES	+= field.c
libmath_la_SOURCES	+= field-exp.c field-exp.h
libmath_la_SOURCES	+= field-parse.c
libmath_la_SOURCES	+= f-binpoly.c
libmath_la_SOURCES	+= f-niceprime.c
libmath_la_SOURCES	+= f-prime.c

## Table of built-in binary fields.
pkginclude_HEADERS	+= bintab.h
nodist_libmath_la_SOURCES += bintab.c
CLEANFILES		+= bintab.c
EXTRA_DIST		+= bintab.in
bintab.c: $(mpgen) typeinfo.py bintab.in
	$(MPGEN) bintab $(srcdir)/bintab.in >bintab.c.new && \
		mv bintab.c.new bintab.c

## Table of built-in prime fields.
pkginclude_HEADERS	+= ptab.h
nodist_libmath_la_SOURCES += ptab.c
CLEANFILES		+= ptab.c
EXTRA_DIST		+= ptab.in
ptab.c: $(mpgen) typeinfo.py ptab.in
	$(MPGEN) ptab $(srcdir)/ptab.in >ptab.c.new && \
		mv ptab.c.new ptab.c

###--------------------------------------------------------------------------
### Elliptic curve arithmetic.

## Basic elliptic curve arithmetic.
pkginclude_HEADERS	+= ec.h ec-guts.h
libmath_la_SOURCES	+= ec.c
libmath_la_SOURCES	+= ec-exp.c ec-exp.h
libmath_la_SOURCES	+= ec-info.c
TESTS			+= ec-info.t$(EXEEXT)
libmath_la_SOURCES	+= ec-bin.c
TESTS			+= ec-bin.t$(EXEEXT)
libmath_la_SOURCES	+= ec-prime.c
TESTS			+= ec-prime.t$(EXEEXT)
EXTRA_DIST		+= t/ec

## The standard `raw' encoding (`EC2OSP') of elliptic curve points.
pkginclude_HEADERS	+= ec-raw.h
libmath_la_SOURCES	+= ec-raw.c

## Assistance for elliptic-curve keys.
pkginclude_HEADERS	+= ec-keys.h
libmath_la_SOURCES	+= ec-fetch.c

## Test infrastructure for elliptic curves.
pkginclude_HEADERS	+= ec-test.h
libmath_la_SOURCES	+= ec-test.c
TESTS			+= ec-test.t$(EXEEXT)

## Table of built-in elliptic-curve groups.
pkginclude_HEADERS	+= ectab.h
nodist_libmath_la_SOURCES += ectab.c
CLEANFILES		+= ectab.c
EXTRA_DIST		+= ectab.in
ectab.c: $(mpgen) typeinfo.py ectab.in
	$(MPGEN) ectab $(srcdir)/ectab.in >ectab.c.new && \
		mv ectab.c.new ectab.c

###----- That's all, folks --------------------------------------------------
Commit	Line	Data
0f00dc4c MW	1	### --makefile--
	2	###
	3	### Build script for mathematical infrastructure
	4	###
	5	### (c) 2013 Straylight/Edgeware
	6	###
	7
	8	###----- Licensing notice ---------------------------------------------------
	9	###
	10	### This file is part of Catacomb.
	11	###
	12	### Catacomb is free software; you can redistribute it and/or modify
	13	### it under the terms of the GNU Library General Public License as
	14	### published by the Free Software Foundation; either version 2 of the
	15	### License, or (at your option) any later version.
	16	###
	17	### Catacomb is distributed in the hope that it will be useful,
	18	### but WITHOUT ANY WARRANTY; without even the implied warranty of
	19	### MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	20	### GNU Library General Public License for more details.
	21	###
	22	### You should have received a copy of the GNU Library General Public
	23	### License along with Catacomb; if not, write to the Free
	24	### Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
	25	### MA 02111-1307, USA.
	26
	27	include $(top_srcdir)/vars.am
	28
	29	noinst_LTLIBRARIES = libmath.la
	30	libmath_la_SOURCES =
	31	nodist_libmath_la_SOURCES =
	32	libmath_la_LIBADD =
	33
	34	TEST_LIBS = libmath.la
	35
	36	###--------------------------------------------------------------------------
1c3d4cf5 MW	37	### Representation of multiprecision integers.
	38
	39	## The `mpgen' tool for dealing with these things.
	40	mpgen = $(srcdir)/mpgen
	41	EXTRA_DIST += mpgen
	42	AM_V_MPGEN = $(AM_V_MPGEN_$(V))
	43	AM_V_MPGEN_ = $(AM_V_MPGEN_$(AM_DEFAULT_VERBOSITY))
	44	AM_V_MPGEN_0 = @echo " MPGEN $@";
	45	MPGEN = $(AM_V_MPGEN)$(PYTHON) $(mpgen)
	46
	47	## The type information collected by `configure'.
	48	CLEANFILES += typeinfo.py
	49	EXTRA_DIST += typeinfo.py.in
	50	typeinfo.py: $(srcdir)/typeinfo.py.in Makefile
	51	$(SUBST) $(srcdir)/typeinfo.py.in >typeinfo.py.new \
	52	type_bits="@type_bits@" \
	53	limits="@limits@" && \
	54	mv typeinfo.py.new typeinfo.py
	55
	56	## The header file containing our representation choices.
	57	BUILT_SOURCES += mptypes.h
	58	CLEANFILES += mptypes.h
	59	nodist_archinclude_HEADERS += mptypes.h
	60	mptypes.h: $(mpgen) typeinfo.py
	61	$(MPGEN) mptypes >mptypes.h.in && mv mptypes.h.in mptypes.h
	62
	63	## Limits of C types as multiprecision integers.
	64	BUILT_SOURCES += mplimits.h mplimits.c
	65	CLEANFILES += mplimits.h mplimits.c
	66	nodist_archinclude_HEADERS += mplimits.h
	67	nodist_libmath_la_SOURCES += mplimits.c
	68	mplimits.h: $(mpgen) typeinfo.py
	69	$(MPGEN) mplimits_h >mplimits.h.in && mv mplimits.h.in mplimits.h
	70	mplimits.c: $(mpgen) typeinfo.py
	71	$(MPGEN) mplimits_c >mplimits.c.in && mv mplimits.c.in mplimits.c
0f00dc4c	72
1c3d4cf5 MW	73	###--------------------------------------------------------------------------
1c3d4cf5 MW	74	### Main multiprecision integer library.
0f00dc4c MW	75
	76	## Additional buffer I/O functions for mathematical objects.
	77	pkginclude_HEADERS += buf.h
	78	libmath_la_SOURCES += buf.c
	79
	80	## Infrastructure for fast exponentiation.
	81	pkginclude_HEADERS += exp.h
	82	libmath_la_SOURCES += exp.c
	83
	84	## Main user-visible multiprecision arithmetic.
	85	pkginclude_HEADERS += mp.h
1c3d4cf5	86	libmath_la_SOURCES += mp-arith.c
ba57d652	87	TESTS += mp-arith.t$(EXEEXT)
1c3d4cf5	88	libmath_la_SOURCES += mp-const.c
0f00dc4c MW	89	libmath_la_SOURCES += mp-exp.c mp-exp.h
0f00dc4c MW	90	libmath_la_SOURCES += mp-gcd.c
ba57d652	91	TESTS += mp-gcd.t$(EXEEXT)
1c3d4cf5	92	libmath_la_SOURCES += mp-io.c
0f00dc4c	93	libmath_la_SOURCES += mp-jacobi.c
ba57d652	94	TESTS += mp-jacobi.t$(EXEEXT)
1c3d4cf5 MW	95	libmath_la_SOURCES += mp-mem.c
1c3d4cf5 MW	96	libmath_la_SOURCES += mp-misc.c
0f00dc4c	97	libmath_la_SOURCES += mp-modexp.c
ba57d652	98	TESTS += mp-modexp.t$(EXEEXT)
0f00dc4c	99	libmath_la_SOURCES += mp-modsqrt.c
ba57d652	100	TESTS += mp-modsqrt.t$(EXEEXT)
0f00dc4c	101	libmath_la_SOURCES += mp-sqrt.c
ba57d652	102	TESTS += mp-sqrt.t$(EXEEXT)
0f00dc4c MW	103	libmath_la_SOURCES += mp-test.c
	104	EXTRA_DIST += t/mp
	105
	106	## Computing Fibonacci numbers.
	107	pkginclude_HEADERS += mp-fibonacci.h
	108	libmath_la_SOURCES += mp-fibonacci.c
ba57d652	109	TESTS += mp-fibonacci.t$(EXEEXT)
0f00dc4c MW	110
	111	## Special memory allocation for multiprecision integers.
	112	pkginclude_HEADERS += mparena.h
1c3d4cf5	113	libmath_la_SOURCES += mparena.c
0f00dc4c MW	114
	115	## Barrett reduction, an efficient method for modular reduction.
	116	pkginclude_HEADERS += mpbarrett.h
	117	libmath_la_SOURCES += mpbarrett.c
ba57d652	118	TESTS += mpbarrett.t$(EXEEXT)
0f00dc4c	119	libmath_la_SOURCES += mpbarrett-exp.c mpbarrett-mexp.c mpbarrett-exp.h
ba57d652 MW	120	TESTS += mpbarrett-exp.t$(EXEEXT) mpbarrett-mexp.t$(EXEEXT)
ba57d652 MW	121	TESTS += mpbarrett.t$(EXEEXT)
0f00dc4c MW	122	EXTRA_DIST += t/mpbarrett
	123
	124	## Solving congruences using the Chinese Remainder Theorem.
	125	pkginclude_HEADERS += mpcrt.h
	126	libmath_la_SOURCES += mpcrt.c
ba57d652	127	TESTS += mpcrt.t$(EXEEXT)
0f00dc4c MW	128	EXTRA_DIST += t/mpcrt
	129
	130	## Conversions between machine-native and multiprecision integers.
	131	pkginclude_HEADERS += mpint.h
	132	libmath_la_SOURCES += mpint.c
ba57d652	133	TESTS += mpint.t$(EXEEXT)
0f00dc4c MW	134	EXTRA_DIST += t/mpint
0f00dc4c MW	135
0f00dc4c MW	136	## Montgomery reduction, a clever method for modular arithmetic.
	137	pkginclude_HEADERS += mpmont.h
	138	libmath_la_SOURCES += mpmont.c
ba57d652	139	TESTS += mpmont.t$(EXEEXT)
0f00dc4c	140	libmath_la_SOURCES += mpmont-exp.c mpmont-mexp.c mpmont-exp.h
ba57d652	141	TESTS += mpmont-exp.t$(EXEEXT) mpmont-mexp.t$(EXEEXT)
0f00dc4c MW	142	EXTRA_DIST += t/mpmont
	143
	144	## Efficient multiplication of many small numbers.
	145	pkginclude_HEADERS += mpmul.h
	146	libmath_la_SOURCES += mpmul.c
ba57d652	147	TESTS += mpmul.t$(EXEEXT)
0f00dc4c MW	148
	149	## Generating random numbers.
	150	pkginclude_HEADERS += mprand.h
	151	libmath_la_SOURCES += mprand.c
	152
	153	## Efficient reduction modulo numbers with conveninent binary
	154	## representations.
	155	pkginclude_HEADERS += mpreduce.h
	156	libmath_la_SOURCES += mpreduce.c mpreduce-exp.h
ba57d652	157	TESTS += mpreduce.t$(EXEEXT)
0f00dc4c MW	158	EXTRA_DIST += t/mpreduce
	159
	160	## Iteratiion over the bianry representation of multiprecision integers.
	161	pkginclude_HEADERS += mpscan.h
1c3d4cf5	162	libmath_la_SOURCES += mpscan.c
0f00dc4c MW	163
	164	## Conversion between multiprecision integers and their textual
	165	## representations.
	166	pkginclude_HEADERS += mptext.h
1c3d4cf5	167	libmath_la_SOURCES += mptext.c
ba57d652	168	TESTS += mptext.t$(EXEEXT)
0f00dc4c MW	169	libmath_la_SOURCES += mptext-dstr.c
	170	libmath_la_SOURCES += mptext-file.c
	171	libmath_la_SOURCES += mptext-len.c
1c3d4cf5	172	libmath_la_SOURCES += mptext-string.c
0f00dc4c MW	173	EXTRA_DIST += t/mptext
0f00dc4c MW	174
0f00dc4c MW	175	## Low-level multiprecision arithmetic.
0f00dc4c MW	176	pkginclude_HEADERS += mpx.h bitops.h mpw.h
1c3d4cf5	177	libmath_la_SOURCES += mpx.c
ba57d652	178	TESTS += mpx.t$(EXEEXT)
1c3d4cf5	179	libmath_la_SOURCES += karatsuba.h mpx-kmul.c mpx-ksqr.c
ba57d652	180	TESTS += mpx-kmul.t$(EXEEXT) mpx-ksqr.t$(EXEEXT)
0f00dc4c MW	181	noinst_PROGRAMS += bittest
	182	TESTS += bittest
	183	EXTRA_DIST += t/mpx
444083ae MW	184	if CPUFAM_X86
	185	libmath_la_SOURCES += mpx-mul4-x86-sse2.S
	186	endif
3119b3ae MW	187	if CPUFAM_AMD64
	188	libmath_la_SOURCES += mpx-mul4-amd64-sse2.S
	189	endif
0f00dc4c MW	190
	191	## A quick-and-dirty parser, used for parsing descriptions of groups, fields,
	192	## etc.
	193	pkginclude_HEADERS += qdparse.h
	194	libmath_la_SOURCES += qdparse.c
	195
	196	## Pollard's `rho' algorithm for determining discrete logarithms.
	197	pkginclude_HEADERS += rho.h
	198	libmath_la_SOURCES += rho.c
ba57d652	199	TESTS += rho.t$(EXEEXT)
0f00dc4c MW	200
	201	###--------------------------------------------------------------------------
	202	### Prime number checking, searching, and related jobs.
	203
	204	## Generating Lim--Lee groups, i.e., unit groups of finite fields without
	205	## small subgroups (except for the obvious ones).
	206	pkginclude_HEADERS += limlee.h
	207	libmath_la_SOURCES += limlee.c
	208
	209	## A table of small prime numbers.
c9cfa678 MW	210	pkginclude_HEADERS += $(precomp)/math/primetab.h
	211	nodist_libmath_la_SOURCES += ../precomp/math/primetab.c
	212	PRECOMPS += $(precomp)/math/primetab.h \
	213	$(precomp)/math/primetab.c
e5b61a8d	214	PRECOMP_PROGS += genprimes
0f00dc4c	215	genprimes_LDADD = $(mLib_LIBS)
e5b61a8d	216	if !CROSS_COMPILING
c9cfa678 MW	217	$(precomp)/math/primetab.h: $(precomp)/math/primetab.c
	218	$(precomp)/math/primetab.c:
	219	$(AM_V_at)$(MKDIR_P) $(precomp)/math
ba57d652	220	$(AM_V_at)$(MAKE) genprimes$(EXEEXT)
e5b61a8d	221	$(AM_V_GEN)./genprimes -sCATACOMB_PRIMETAB_H \
c9cfa678	222	-h$(precomp)/math/primetab.h -c$(precomp)/math/primetab.c \
0f00dc4c	223	-n256 -t"unsigned short" -iprimetab
e5b61a8d	224	endif
0f00dc4c MW	225
	226	## Filtering candidate prime numbers by checking for small factors
	227	## efficiently.
	228	pkginclude_HEADERS += pfilt.h
	229	libmath_la_SOURCES += pfilt.c
	230
	231	## Generating prime numbers (and other kinds of numbers which need searching
	232	## for).
	233	pkginclude_HEADERS += pgen.h
	234	libmath_la_SOURCES += pgen.c
	235	libmath_la_SOURCES += pgen-gcd.c
	236	libmath_la_SOURCES += pgen-simul.c
	237	libmath_la_SOURCES += pgen-stdev.c
ba57d652	238	TESTS += pgen.t$(EXEEXT)
0f00dc4c MW	239	EXTRA_DIST += t/pgen
	240
	241	## Finding primitive elements in finite fields.
	242	pkginclude_HEADERS += prim.h
	243	libmath_la_SOURCES += prim.c
	244
	245	## Iterating over all prime numbers from a given starting point.
	246	pkginclude_HEADERS += primeiter.h
	247	libmath_la_SOURCES += primeiter.c
ba57d652	248	TESTS += primeiter.t$(EXEEXT)
c9cfa678	249	primeiter.lo: $(precomp)/math/wheel.h
0f00dc4c MW	250
	251	## The Miller--Rabin primality test.
	252	pkginclude_HEADERS += rabin.h
	253	libmath_la_SOURCES += rabin.c
	254
	255	## Finding `strong' primes, using Gordon's algorithm. Once upon a time,
	256	## products of these kinds of numbers were harder to factor.
	257	pkginclude_HEADERS += strongprime.h
	258	libmath_la_SOURCES += strongprime.c
	259
	260	## A `wheel', used by the prime iteration machinery.
c9cfa678 MW	261	pkginclude_HEADERS += $(precomp)/math/wheel.h
	262	nodist_libmath_la_SOURCES += ../precomp/math/wheel.c
	263	PRECOMPS += $(precomp)/math/wheel.h $(precomp)/math/wheel.c
e5b61a8d	264	PRECOMP_PROGS += genwheel
0f00dc4c	265	genwheel_LDADD = $(mLib_LIBS)
e5b61a8d	266	if !CROSS_COMPILING
c9cfa678 MW	267	$(precomp)/math/wheel.h: $(precomp)/math/wheel.c
	268	$(precomp)/math/wheel.c:
	269	$(AM_V_at)$(MKDIR_P) $(precomp)/math
ba57d652	270	$(AM_V_at)$(MAKE) genwheel$(EXEEXT)
e5b61a8d	271	$(AM_V_GEN)./genwheel -sCATACOMB_WHEEL_H \
c9cfa678	272	-h$(precomp)/math/wheel.h -c$(precomp)/math/wheel.c \
0f00dc4c	273	-n5 -t"unsigned char" -iwheel
e5b61a8d	274	endif
0f00dc4c MW	275
	276	###--------------------------------------------------------------------------
	277	### Binary polynomial arithmetic.
	278
	279	## User-visible binary polynomial arithmetic.
	280	pkginclude_HEADERS += gf.h
	281	libmath_la_SOURCES += gf-arith.c
ba57d652	282	TESTS += gf-arith.t$(EXEEXT)
0f00dc4c MW	283	libmath_la_SOURCES += gf-exp.c gf-exp.h
0f00dc4c MW	284	libmath_la_SOURCES += gf-gcd.c
ba57d652	285	TESTS += gf-gcd.t$(EXEEXT)
0f00dc4c MW	286	EXTRA_DIST += t/gf
	287
	288	## Low-level binary polynomial arithmetic.
	289	pkginclude_HEADERS += gfx.h
	290	libmath_la_SOURCES += gfx.c
ba57d652	291	TESTS += gfx.t$(EXEEXT)
0f00dc4c	292	libmath_la_SOURCES += gfx-kmul.c
ba57d652	293	TESTS += gfx-kmul.t$(EXEEXT)
c9cfa678 MW	294	libmath_la_SOURCES += gfx-sqr.c
	295	nodist_libmath_la_SOURCES += ../precomp/math/gfx-sqrtab.c
	296	PRECOMPS += $(precomp)/math/gfx-sqrtab.c
e5b61a8d MW	297	PRECOMP_PROGS += gfx-sqr-mktab
e5b61a8d MW	298	if !CROSS_COMPILING
c9cfa678 MW	299	$(precomp)/math/gfx-sqrtab.c:
c9cfa678 MW	300	$(AM_V_at)$(MKDIR_P) $(precomp)/math
ba57d652	301	$(AM_V_at)$(MAKE) gfx-sqr-mktab$(EXEEXT)
c9cfa678 MW	302	$(AM_V_GEN)./gfx-sqr-mktab >$(precomp)/math/gfx-sqrtab.c.new && \
	303	mv $(precomp)/math/gfx-sqrtab.c.new \
	304	$(precomp)/math/gfx-sqrtab.c
e5b61a8d	305	endif
ba57d652	306	TESTS += gfx-sqr.t$(EXEEXT)
0f00dc4c MW	307	EXTRA_DIST += t/gfx
	308
	309	## Conversions between normal and polynomial basis representations for binary
	310	## fields.
	311	pkginclude_HEADERS += gfn.h
	312	libmath_la_SOURCES += gfn.c
ba57d652	313	TESTS += gfn.t$(EXEEXT)
0f00dc4c MW	314	EXTRA_DIST += t/gfn
	315
	316	## Efficient reduction modulo sparse polynomials.
	317	pkginclude_HEADERS += gfreduce.h
	318	libmath_la_SOURCES += gfreduce.c gfreduce-exp.h
ba57d652	319	TESTS += gfreduce.t$(EXEEXT)
0f00dc4c MW	320	EXTRA_DIST += t/gfreduce
	321
	322	###--------------------------------------------------------------------------
	323	### Abstractions for various kinds of algebraic objects.
	324
	325	## Abstract cyclic groups.
	326	pkginclude_HEADERS += group.h group-guts.h
	327	libmath_la_SOURCES += group-dstr.c
	328	libmath_la_SOURCES += group-exp.c group-exp.h
	329	libmath_la_SOURCES += group-file.c
	330	libmath_la_SOURCES += group-parse.c
	331	libmath_la_SOURCES += group-stdops.c
	332	libmath_la_SOURCES += group-string.c
	333	libmath_la_SOURCES += g-bin.c
	334	libmath_la_SOURCES += g-prime.c
	335	libmath_la_SOURCES += g-ec.c
	336	EXTRA_DIST += group-test.c
ba57d652	337	TESTS += group-test.t$(EXEEXT)
0f00dc4c MW	338	EXTRA_DIST += t/group
	339
	340	## Abstract finite fields.
	341	pkginclude_HEADERS += field.h field-guts.h
	342	libmath_la_SOURCES += field.c
	343	libmath_la_SOURCES += field-exp.c field-exp.h
	344	libmath_la_SOURCES += field-parse.c
	345	libmath_la_SOURCES += f-binpoly.c
	346	libmath_la_SOURCES += f-niceprime.c
	347	libmath_la_SOURCES += f-prime.c
	348
	349	## Table of built-in binary fields.
	350	pkginclude_HEADERS += bintab.h
1c3d4cf5	351	nodist_libmath_la_SOURCES += bintab.c
0f00dc4c	352	CLEANFILES += bintab.c
1c3d4cf5 MW	353	EXTRA_DIST += bintab.in
	354	bintab.c: $(mpgen) typeinfo.py bintab.in
	355	$(MPGEN) bintab $(srcdir)/bintab.in >bintab.c.new && \
	356	mv bintab.c.new bintab.c
0f00dc4c MW	357
	358	## Table of built-in prime fields.
	359	pkginclude_HEADERS += ptab.h
1c3d4cf5	360	nodist_libmath_la_SOURCES += ptab.c
0f00dc4c	361	CLEANFILES += ptab.c
1c3d4cf5 MW	362	EXTRA_DIST += ptab.in
	363	ptab.c: $(mpgen) typeinfo.py ptab.in
	364	$(MPGEN) ptab $(srcdir)/ptab.in >ptab.c.new && \
	365	mv ptab.c.new ptab.c
0f00dc4c MW	366
	367	###--------------------------------------------------------------------------
	368	### Elliptic curve arithmetic.
	369
	370	## Basic elliptic curve arithmetic.
	371	pkginclude_HEADERS += ec.h ec-guts.h
	372	libmath_la_SOURCES += ec.c
	373	libmath_la_SOURCES += ec-exp.c ec-exp.h
	374	libmath_la_SOURCES += ec-info.c
ba57d652	375	TESTS += ec-info.t$(EXEEXT)
0f00dc4c	376	libmath_la_SOURCES += ec-bin.c
ba57d652	377	TESTS += ec-bin.t$(EXEEXT)
0f00dc4c	378	libmath_la_SOURCES += ec-prime.c
ba57d652	379	TESTS += ec-prime.t$(EXEEXT)
0f00dc4c MW	380	EXTRA_DIST += t/ec
	381
	382	## The standard `raw' encoding (`EC2OSP') of elliptic curve points.
	383	pkginclude_HEADERS += ec-raw.h
	384	libmath_la_SOURCES += ec-raw.c
	385
	386	## Assistance for elliptic-curve keys.
	387	pkginclude_HEADERS += ec-keys.h
	388	libmath_la_SOURCES += ec-fetch.c
	389
	390	## Test infrastructure for elliptic curves.
	391	pkginclude_HEADERS += ec-test.h
	392	libmath_la_SOURCES += ec-test.c
ba57d652	393	TESTS += ec-test.t$(EXEEXT)
0f00dc4c	394
1c3d4cf5	395	## Table of built-in elliptic-curve groups.
0f00dc4c	396	pkginclude_HEADERS += ectab.h
1c3d4cf5	397	nodist_libmath_la_SOURCES += ectab.c
0f00dc4c	398	CLEANFILES += ectab.c
1c3d4cf5 MW	399	EXTRA_DIST += ectab.in
	400	ectab.c: $(mpgen) typeinfo.py ectab.in
	401	$(MPGEN) ectab $(srcdir)/ectab.in >ectab.c.new && \
	402	mv ectab.c.new ectab.c
0f00dc4c MW	403
0f00dc4c MW	404	###----- That's all, folks --------------------------------------------------