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 | ###-------------------------------------------------------------------------- |
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 |
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 |
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) |
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 |
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 |
174 | ||
0f00dc4c MW |
175 | ## Low-level multiprecision arithmetic. |
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 | |
0f00dc4c MW |
187 | |
188 | ## A quick-and-dirty parser, used for parsing descriptions of groups, fields, | |
189 | ## etc. | |
190 | pkginclude_HEADERS += qdparse.h | |
191 | libmath_la_SOURCES += qdparse.c | |
192 | ||
193 | ## Pollard's `rho' algorithm for determining discrete logarithms. | |
194 | pkginclude_HEADERS += rho.h | |
195 | libmath_la_SOURCES += rho.c | |
ba57d652 | 196 | TESTS += rho.t$(EXEEXT) |
0f00dc4c MW |
197 | |
198 | ###-------------------------------------------------------------------------- | |
199 | ### Prime number checking, searching, and related jobs. | |
200 | ||
201 | ## Generating Lim--Lee groups, i.e., unit groups of finite fields without | |
202 | ## small subgroups (except for the obvious ones). | |
203 | pkginclude_HEADERS += limlee.h | |
204 | libmath_la_SOURCES += limlee.c | |
205 | ||
206 | ## A table of small prime numbers. | |
c9cfa678 MW |
207 | pkginclude_HEADERS += $(precomp)/math/primetab.h |
208 | nodist_libmath_la_SOURCES += ../precomp/math/primetab.c | |
209 | PRECOMPS += $(precomp)/math/primetab.h \ | |
210 | $(precomp)/math/primetab.c | |
e5b61a8d | 211 | PRECOMP_PROGS += genprimes |
0f00dc4c | 212 | genprimes_LDADD = $(mLib_LIBS) |
e5b61a8d | 213 | if !CROSS_COMPILING |
c9cfa678 MW |
214 | $(precomp)/math/primetab.h: $(precomp)/math/primetab.c |
215 | $(precomp)/math/primetab.c: | |
216 | $(AM_V_at)$(MKDIR_P) $(precomp)/math | |
ba57d652 | 217 | $(AM_V_at)$(MAKE) genprimes$(EXEEXT) |
e5b61a8d | 218 | $(AM_V_GEN)./genprimes -sCATACOMB_PRIMETAB_H \ |
c9cfa678 | 219 | -h$(precomp)/math/primetab.h -c$(precomp)/math/primetab.c \ |
0f00dc4c | 220 | -n256 -t"unsigned short" -iprimetab |
e5b61a8d | 221 | endif |
0f00dc4c MW |
222 | |
223 | ## Filtering candidate prime numbers by checking for small factors | |
224 | ## efficiently. | |
225 | pkginclude_HEADERS += pfilt.h | |
226 | libmath_la_SOURCES += pfilt.c | |
227 | ||
228 | ## Generating prime numbers (and other kinds of numbers which need searching | |
229 | ## for). | |
230 | pkginclude_HEADERS += pgen.h | |
231 | libmath_la_SOURCES += pgen.c | |
232 | libmath_la_SOURCES += pgen-gcd.c | |
233 | libmath_la_SOURCES += pgen-simul.c | |
234 | libmath_la_SOURCES += pgen-stdev.c | |
ba57d652 | 235 | TESTS += pgen.t$(EXEEXT) |
0f00dc4c MW |
236 | EXTRA_DIST += t/pgen |
237 | ||
238 | ## Finding primitive elements in finite fields. | |
239 | pkginclude_HEADERS += prim.h | |
240 | libmath_la_SOURCES += prim.c | |
241 | ||
242 | ## Iterating over all prime numbers from a given starting point. | |
243 | pkginclude_HEADERS += primeiter.h | |
244 | libmath_la_SOURCES += primeiter.c | |
ba57d652 | 245 | TESTS += primeiter.t$(EXEEXT) |
c9cfa678 | 246 | primeiter.lo: $(precomp)/math/wheel.h |
0f00dc4c MW |
247 | |
248 | ## The Miller--Rabin primality test. | |
249 | pkginclude_HEADERS += rabin.h | |
250 | libmath_la_SOURCES += rabin.c | |
251 | ||
252 | ## Finding `strong' primes, using Gordon's algorithm. Once upon a time, | |
253 | ## products of these kinds of numbers were harder to factor. | |
254 | pkginclude_HEADERS += strongprime.h | |
255 | libmath_la_SOURCES += strongprime.c | |
256 | ||
257 | ## A `wheel', used by the prime iteration machinery. | |
c9cfa678 MW |
258 | pkginclude_HEADERS += $(precomp)/math/wheel.h |
259 | nodist_libmath_la_SOURCES += ../precomp/math/wheel.c | |
260 | PRECOMPS += $(precomp)/math/wheel.h $(precomp)/math/wheel.c | |
e5b61a8d | 261 | PRECOMP_PROGS += genwheel |
0f00dc4c | 262 | genwheel_LDADD = $(mLib_LIBS) |
e5b61a8d | 263 | if !CROSS_COMPILING |
c9cfa678 MW |
264 | $(precomp)/math/wheel.h: $(precomp)/math/wheel.c |
265 | $(precomp)/math/wheel.c: | |
266 | $(AM_V_at)$(MKDIR_P) $(precomp)/math | |
ba57d652 | 267 | $(AM_V_at)$(MAKE) genwheel$(EXEEXT) |
e5b61a8d | 268 | $(AM_V_GEN)./genwheel -sCATACOMB_WHEEL_H \ |
c9cfa678 | 269 | -h$(precomp)/math/wheel.h -c$(precomp)/math/wheel.c \ |
0f00dc4c | 270 | -n5 -t"unsigned char" -iwheel |
e5b61a8d | 271 | endif |
0f00dc4c MW |
272 | |
273 | ###-------------------------------------------------------------------------- | |
274 | ### Binary polynomial arithmetic. | |
275 | ||
276 | ## User-visible binary polynomial arithmetic. | |
277 | pkginclude_HEADERS += gf.h | |
278 | libmath_la_SOURCES += gf-arith.c | |
ba57d652 | 279 | TESTS += gf-arith.t$(EXEEXT) |
0f00dc4c MW |
280 | libmath_la_SOURCES += gf-exp.c gf-exp.h |
281 | libmath_la_SOURCES += gf-gcd.c | |
ba57d652 | 282 | TESTS += gf-gcd.t$(EXEEXT) |
0f00dc4c MW |
283 | EXTRA_DIST += t/gf |
284 | ||
285 | ## Low-level binary polynomial arithmetic. | |
286 | pkginclude_HEADERS += gfx.h | |
287 | libmath_la_SOURCES += gfx.c | |
ba57d652 | 288 | TESTS += gfx.t$(EXEEXT) |
0f00dc4c | 289 | libmath_la_SOURCES += gfx-kmul.c |
ba57d652 | 290 | TESTS += gfx-kmul.t$(EXEEXT) |
c9cfa678 MW |
291 | libmath_la_SOURCES += gfx-sqr.c |
292 | nodist_libmath_la_SOURCES += ../precomp/math/gfx-sqrtab.c | |
293 | PRECOMPS += $(precomp)/math/gfx-sqrtab.c | |
e5b61a8d MW |
294 | PRECOMP_PROGS += gfx-sqr-mktab |
295 | if !CROSS_COMPILING | |
c9cfa678 MW |
296 | $(precomp)/math/gfx-sqrtab.c: |
297 | $(AM_V_at)$(MKDIR_P) $(precomp)/math | |
ba57d652 | 298 | $(AM_V_at)$(MAKE) gfx-sqr-mktab$(EXEEXT) |
c9cfa678 MW |
299 | $(AM_V_GEN)./gfx-sqr-mktab >$(precomp)/math/gfx-sqrtab.c.new && \ |
300 | mv $(precomp)/math/gfx-sqrtab.c.new \ | |
301 | $(precomp)/math/gfx-sqrtab.c | |
e5b61a8d | 302 | endif |
ba57d652 | 303 | TESTS += gfx-sqr.t$(EXEEXT) |
0f00dc4c MW |
304 | EXTRA_DIST += t/gfx |
305 | ||
306 | ## Conversions between normal and polynomial basis representations for binary | |
307 | ## fields. | |
308 | pkginclude_HEADERS += gfn.h | |
309 | libmath_la_SOURCES += gfn.c | |
ba57d652 | 310 | TESTS += gfn.t$(EXEEXT) |
0f00dc4c MW |
311 | EXTRA_DIST += t/gfn |
312 | ||
313 | ## Efficient reduction modulo sparse polynomials. | |
314 | pkginclude_HEADERS += gfreduce.h | |
315 | libmath_la_SOURCES += gfreduce.c gfreduce-exp.h | |
ba57d652 | 316 | TESTS += gfreduce.t$(EXEEXT) |
0f00dc4c MW |
317 | EXTRA_DIST += t/gfreduce |
318 | ||
319 | ###-------------------------------------------------------------------------- | |
320 | ### Abstractions for various kinds of algebraic objects. | |
321 | ||
322 | ## Abstract cyclic groups. | |
323 | pkginclude_HEADERS += group.h group-guts.h | |
324 | libmath_la_SOURCES += group-dstr.c | |
325 | libmath_la_SOURCES += group-exp.c group-exp.h | |
326 | libmath_la_SOURCES += group-file.c | |
327 | libmath_la_SOURCES += group-parse.c | |
328 | libmath_la_SOURCES += group-stdops.c | |
329 | libmath_la_SOURCES += group-string.c | |
330 | libmath_la_SOURCES += g-bin.c | |
331 | libmath_la_SOURCES += g-prime.c | |
332 | libmath_la_SOURCES += g-ec.c | |
333 | EXTRA_DIST += group-test.c | |
ba57d652 | 334 | TESTS += group-test.t$(EXEEXT) |
0f00dc4c MW |
335 | EXTRA_DIST += t/group |
336 | ||
337 | ## Abstract finite fields. | |
338 | pkginclude_HEADERS += field.h field-guts.h | |
339 | libmath_la_SOURCES += field.c | |
340 | libmath_la_SOURCES += field-exp.c field-exp.h | |
341 | libmath_la_SOURCES += field-parse.c | |
342 | libmath_la_SOURCES += f-binpoly.c | |
343 | libmath_la_SOURCES += f-niceprime.c | |
344 | libmath_la_SOURCES += f-prime.c | |
345 | ||
346 | ## Table of built-in binary fields. | |
347 | pkginclude_HEADERS += bintab.h | |
1c3d4cf5 | 348 | nodist_libmath_la_SOURCES += bintab.c |
0f00dc4c | 349 | CLEANFILES += bintab.c |
1c3d4cf5 MW |
350 | EXTRA_DIST += bintab.in |
351 | bintab.c: $(mpgen) typeinfo.py bintab.in | |
352 | $(MPGEN) bintab $(srcdir)/bintab.in >bintab.c.new && \ | |
353 | mv bintab.c.new bintab.c | |
0f00dc4c MW |
354 | |
355 | ## Table of built-in prime fields. | |
356 | pkginclude_HEADERS += ptab.h | |
1c3d4cf5 | 357 | nodist_libmath_la_SOURCES += ptab.c |
0f00dc4c | 358 | CLEANFILES += ptab.c |
1c3d4cf5 MW |
359 | EXTRA_DIST += ptab.in |
360 | ptab.c: $(mpgen) typeinfo.py ptab.in | |
361 | $(MPGEN) ptab $(srcdir)/ptab.in >ptab.c.new && \ | |
362 | mv ptab.c.new ptab.c | |
0f00dc4c MW |
363 | |
364 | ###-------------------------------------------------------------------------- | |
365 | ### Elliptic curve arithmetic. | |
366 | ||
367 | ## Basic elliptic curve arithmetic. | |
368 | pkginclude_HEADERS += ec.h ec-guts.h | |
369 | libmath_la_SOURCES += ec.c | |
370 | libmath_la_SOURCES += ec-exp.c ec-exp.h | |
371 | libmath_la_SOURCES += ec-info.c | |
ba57d652 | 372 | TESTS += ec-info.t$(EXEEXT) |
0f00dc4c | 373 | libmath_la_SOURCES += ec-bin.c |
ba57d652 | 374 | TESTS += ec-bin.t$(EXEEXT) |
0f00dc4c | 375 | libmath_la_SOURCES += ec-prime.c |
ba57d652 | 376 | TESTS += ec-prime.t$(EXEEXT) |
0f00dc4c MW |
377 | EXTRA_DIST += t/ec |
378 | ||
379 | ## The standard `raw' encoding (`EC2OSP') of elliptic curve points. | |
380 | pkginclude_HEADERS += ec-raw.h | |
381 | libmath_la_SOURCES += ec-raw.c | |
382 | ||
383 | ## Assistance for elliptic-curve keys. | |
384 | pkginclude_HEADERS += ec-keys.h | |
385 | libmath_la_SOURCES += ec-fetch.c | |
386 | ||
387 | ## Test infrastructure for elliptic curves. | |
388 | pkginclude_HEADERS += ec-test.h | |
389 | libmath_la_SOURCES += ec-test.c | |
ba57d652 | 390 | TESTS += ec-test.t$(EXEEXT) |
0f00dc4c | 391 | |
1c3d4cf5 | 392 | ## Table of built-in elliptic-curve groups. |
0f00dc4c | 393 | pkginclude_HEADERS += ectab.h |
1c3d4cf5 | 394 | nodist_libmath_la_SOURCES += ectab.c |
0f00dc4c | 395 | CLEANFILES += ectab.c |
1c3d4cf5 MW |
396 | EXTRA_DIST += ectab.in |
397 | ectab.c: $(mpgen) typeinfo.py ectab.in | |
398 | $(MPGEN) ectab $(srcdir)/ectab.in >ectab.c.new && \ | |
399 | mv ectab.c.new ectab.c | |
0f00dc4c MW |
400 | |
401 | ###----- That's all, folks -------------------------------------------------- |