Commit f6853f9a194e145ebeb67cca2451a4ec48b68dfb - gsl

+21

-0

ChangeLog less more

	0	2008-09-26 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* configure.ac: handle test for SSE in cross-compilation (fall
	3	back to checking if the ldmxcsr instruction compiles)
	4
	5	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	6
	7	* Makefile.am: added gsl_inline.h and build.h
	8
	9	* gsl_mode.h gsl_pow_int.h: use new inline declarations
	10
	11	* gsl_minmax.h: new header file for minmax functions, use new
	12	inline declarations
	13
	14	* gsl_math.h: moved minmax functions to separate header file
	15
	16	* configure.ac: test for C99 inline as well
	17
	18	* build.h gsl_inline.h: added new header to handle GNU-style and
	19	C99 inlines
	20
0	21	2008-03-17 Brian Gough <bjg@network-theory.co.uk>
1	22
2	23	* configure.ac: remove hack to disable search for Fortran, Java,

+14

-3

INSTALL less more

97	97
98	98	to allow C++ exceptions to be handled.
99	99
100		3) With gcc-2.95/2.96 the tests fail in the eigen/ directory. This is
	100	3) With gcc-4.3.2 the tests in the poly/ directory fail due to a
	101	compiler optimization bug which is fixed in later versions of GCC
	102	(http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38478).
	103
	104	FAIL: y.real, gsl_complex_poly_complex_eval ({-2.31 + 0.44i, 4.21 - 3.19i, 0.93 + 1.04i, -0.42 + 0.68i}, 0.49 + 0.95i) (-1.68450788000000018 observed vs 1.82462012000000007 expected) [9]
	105	FAIL: y.imag, gsl_complex_poly_complex_eval ({-2.31 + 0.44i, 4.21 - 3.19i, 0.93 + 1.04i, -0.42 + 0.68i}, 0.49 + 0.95i) (-0.30943988 observed vs 2.30389411999999982 expected) [10]
	106
	107	With gcc-2.95/2.96 the tests fail in the eigen/ directory. This is
101	108	due to a compiler optimization bug which causes errors in the
102	109	manipulation of complex numbers.
103	110
104		This is fixed in more recent versions of gcc. Do not use the library
105		if you encounter this problem---install a newer version of gcc.
	111	If you encounter these problems, install a different version of gcc.
106	112
107	113	4) Attempts to run 'strip' on the static library libgsl.a will probably
108	114	produce a broken library (it is known to happen with GNU binutils

139	145	setenv CFLAGS '-O -qmaxmem=8192'
140	146	./configure --disable-shared
141	147	make
	148
	149	If you compile with higher optimisation -O3 you will also need
	150	-qstrict. The -O3 flag causes the -nostrict option to be
	151	enabled. This affects the accuracy of the results and causes some of
	152	the tests to fail.
142	153
143	154	If you get the error,
144	155

+2

-2

Makefile.am less more

5	5
6	6	SUBLIBS = block/libgslblock.la blas/libgslblas.la bspline/libgslbspline.la complex/libgslcomplex.la cheb/libgslcheb.la dht/libgsldht.la diff/libgsldiff.la deriv/libgslderiv.la eigen/libgsleigen.la err/libgslerr.la fft/libgslfft.la fit/libgslfit.la histogram/libgslhistogram.la ieee-utils/libgslieeeutils.la integration/libgslintegration.la interpolation/libgslinterpolation.la linalg/libgsllinalg.la matrix/libgslmatrix.la min/libgslmin.la monte/libgslmonte.la multifit/libgslmultifit.la multimin/libgslmultimin.la multiroots/libgslmultiroots.la ntuple/libgslntuple.la ode-initval/libgslodeiv.la permutation/libgslpermutation.la combination/libgslcombination.la poly/libgslpoly.la qrng/libgslqrng.la randist/libgslrandist.la rng/libgslrng.la roots/libgslroots.la siman/libgslsiman.la sort/libgslsort.la specfunc/libgslspecfunc.la statistics/libgslstatistics.la sum/libgslsum.la sys/libgslsys.la test/libgsltest.la utils/libutils.la vector/libgslvector.la cdf/libgslcdf.la wavelet/libgslwavelet.la
7	7
8		pkginclude_HEADERS = gsl_math.h gsl_pow_int.h gsl_nan.h gsl_machine.h gsl_mode.h gsl_precision.h gsl_types.h gsl_version.h
	8	pkginclude_HEADERS = gsl_math.h gsl_pow_int.h gsl_nan.h gsl_machine.h gsl_mode.h gsl_precision.h gsl_types.h gsl_version.h gsl_minmax.h gsl_inline.h
9	9
10	10	bin_SCRIPTS = gsl-config
11	11

18	18	libgsl_la_SOURCES = version.c
19	19	libgsl_la_LIBADD = $(SUBLIBS)
20	20	libgsl_la_LDFLAGS = -version-info $(GSL_LT_VERSION)
21		noinst_HEADERS = templates_on.h templates_off.h
	21	noinst_HEADERS = templates_on.h templates_off.h build.h
22	22
23	23	MINGW32_HOST = @MINGW32_HOST@
24	24	if MINGW32_HOST

+8

-4

Makefile.in less more

47	47	$(srcdir)/gsl-config.in $(srcdir)/gsl.pc.in \
48	48	$(srcdir)/gsl.spec.in $(srcdir)/gsl_version.h.in \
49	49	$(top_srcdir)/configure AUTHORS COPYING ChangeLog INSTALL NEWS \
50		THANKS TODO config.guess config.sub install-sh ltmain.sh \
51		mdate-sh missing mkinstalldirs
	50	THANKS TODO config.guess config.sub depcomp install-sh \
	51	ltmain.sh mdate-sh missing mkinstalldirs
52	52	ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
53	53	am__aclocal_m4_deps = $(top_srcdir)/configure.ac
54	54	am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \

182	182	LIBOBJS = @LIBOBJS@
183	183	LIBS = @LIBS@
184	184	LIBTOOL = @LIBTOOL@
	185	LIPO = @LIPO@
185	186	LN_S = @LN_S@
186	187	LTLIBOBJS = @LTLIBOBJS@
187	188	MAINT = @MAINT@

189	190	MKDIR_P = @MKDIR_P@
190	191	NM = @NM@
191	192	NMEDIT = @NMEDIT@
	193	OBJDUMP = @OBJDUMP@
192	194	OBJEXT = @OBJEXT@
	195	OTOOL = @OTOOL@
	196	OTOOL64 = @OTOOL64@
193	197	PACKAGE = @PACKAGE@
194	198	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
195	199	PACKAGE_NAME = @PACKAGE_NAME@

254	258	top_srcdir = @top_srcdir@
255	259	SUBDIRS = gsl utils sys test err const complex cheb block vector matrix permutation combination sort ieee-utils cblas blas linalg eigen specfunc dht qrng rng randist fft poly fit multifit statistics siman sum integration interpolation histogram ode-initval roots multiroots min multimin monte ntuple diff deriv cdf wavelet bspline doc
256	260	SUBLIBS = block/libgslblock.la blas/libgslblas.la bspline/libgslbspline.la complex/libgslcomplex.la cheb/libgslcheb.la dht/libgsldht.la diff/libgsldiff.la deriv/libgslderiv.la eigen/libgsleigen.la err/libgslerr.la fft/libgslfft.la fit/libgslfit.la histogram/libgslhistogram.la ieee-utils/libgslieeeutils.la integration/libgslintegration.la interpolation/libgslinterpolation.la linalg/libgsllinalg.la matrix/libgslmatrix.la min/libgslmin.la monte/libgslmonte.la multifit/libgslmultifit.la multimin/libgslmultimin.la multiroots/libgslmultiroots.la ntuple/libgslntuple.la ode-initval/libgslodeiv.la permutation/libgslpermutation.la combination/libgslcombination.la poly/libgslpoly.la qrng/libgslqrng.la randist/libgslrandist.la rng/libgslrng.la roots/libgslroots.la siman/libgslsiman.la sort/libgslsort.la specfunc/libgslspecfunc.la statistics/libgslstatistics.la sum/libgslsum.la sys/libgslsys.la test/libgsltest.la utils/libutils.la vector/libgslvector.la cdf/libgslcdf.la wavelet/libgslwavelet.la
257		pkginclude_HEADERS = gsl_math.h gsl_pow_int.h gsl_nan.h gsl_machine.h gsl_mode.h gsl_precision.h gsl_types.h gsl_version.h
	261	pkginclude_HEADERS = gsl_math.h gsl_pow_int.h gsl_nan.h gsl_machine.h gsl_mode.h gsl_precision.h gsl_types.h gsl_version.h gsl_minmax.h gsl_inline.h
258	262	bin_SCRIPTS = gsl-config
259	263	pkgconfigdir = $(libdir)/pkgconfig
260	264	pkgconfig_DATA = gsl.pc

263	267	libgsl_la_SOURCES = version.c
264	268	libgsl_la_LIBADD = $(SUBLIBS) $(am__append_1)
265	269	libgsl_la_LDFLAGS = -version-info $(GSL_LT_VERSION) $(am__append_2)
266		noinst_HEADERS = templates_on.h templates_off.h
	270	noinst_HEADERS = templates_on.h templates_off.h build.h
267	271	MINGW32_HOST = @MINGW32_HOST@
268	272	m4datadir = $(datadir)/aclocal
269	273	m4data_DATA = gsl.m4

+72

-1

NEWS less more

0		* What is new in gsl-1.11:
	0	* What is new in gsl-1.12:
	1
	2	** Upgraded to latest libtool, autoconf and automake (libtool-2.2.6,
	3	autoconf-2.63, automake-1.10.2)
	4
	5	** Improved the convergence of gsl_sf_gamma_inc_P for x/a ~=~ 1 and
	6	large x,a. Fixes problems with large arguments in cdf functions
	7	such as gsl_cdf_chisq_Pinv(x,nu) [bug 24704].
	8
	9	** Fixed gsl_ran_gamma_knuth to handle the case of a >= UINT_MAX [bug
	10	#24897]
	11
	12	** Added gsl_bspline_eval_deriv to compute bspline derivatives
	13	(Rhys Ulerich)
	14
	15	** Added a faster simplex mininimser gsl_multimin_fminimizer_nmsimplex2
	16	which is O(N) instead of O(N^2) [bug #24418]
	17
	18	** Improved the original chi-squared formula in gsl_monte_vegas to
	19	avoid catastrophic cancellation [bug #24510]. The previous formula
	20	could return incorrect or negative values for relative errors <
	21	1e-8, which could occur when integrating very smooth functions.
	22
	23	** Added new auxiliary functions gsl_cheb_order, gsl_cheb_size,
	24	gsl_cheb_coeffs for Chebyshev series [bug #21830]
	25
	26	** Updated license of the reference manual to GNU FDL version 1.3.
	27
	28	** Fixed a bug where the gsl_isinf function would return +1 for -Inf
	29	on systems where isinf(-Inf) returns the non-standard value +1.
	30	[bug #24489]
	31
	32	** Added missing functions gsl_vector_complex_{isnonneg,add,sub,mul,
	33	div,scale,add_constant} and gsl_matrix_complex_float_isnonneg [bug
	34	#22478]
	35
	36	** Cross compilation should now work for x86 hosts.
	37
	38	** Fixed a bug in gsl_interp_accel_find() where values lying on the
	39	upper boundary between interpolation points could return the index
	40	from the lower side. [bug #24211]
	41
	42	** Fixed gsl_linalg_solve_cyc_tridiag so that its output respects the
	43	solution vector's stride. Previously the x_stride value was ignored
	44	causing the output to be incorrect for non-unit stride. [bug #24162]
	45
	46	** Corrected a bug in the series calculation of gsl_sf_ellint_Kcomp
	47	for k close to 1. [bug #24146]
	48
	49	** Extended gsl_linalg_QRPT_update to handle rectangular matrices.
	50	Corrected definition of the update formula in the manual for
	51	both gsl_linalg_QR_update and gsl_linalg_QRPT_update.
	52
	53	** Added routine gsl_linalg_cholesky_invert
	54
	55	** Fixed a bug the simplex algorithm which caused the second highest
	56	point to be incorrectly equal to the first when the first value was
	57	the highest, which could cause suboptimal convergence. [bug #23192]
	58
	59	** Fixed a problem with convergence for inverse gamma and chisq
	60	distribitions, gsl_cdf_gamma_{P,Q}inv and gsl_cdf_chisq_{P,Q}inv.
	61	[bug #23101]
	62
	63	** Improved the handling of constant regions in Vegas by eliminating
	64	spurious excess precision when computing box variances.
	65
	66	** Fixed a potential division by zero in gsl_monte_miser when the
	67	left/right weight factors decrease below 1.
	68
	69	** Fixed incorrect dimensions check in gsl_matrix_sub{row,column}
	70
	71	* What was new in gsl-1.11:
1	72
2	73	** The GSL repository and bug database are now hosted at Savannah
3	74	http://savannah.gnu.org/projects/gsl/

+11

-0

THANKS less more

445	445	gsl_cdf_hypergeometric_{P,Q}
446	446
447	447	* Claude Dion <claude.dion@tp.umu.se> documentation bug reports
	448
	449	* Michael Kuklik <mkuklik@gmail.com> bug report for simplex
	450
	451	* Paul Accisano, bug report and fix for cyclic solver
	452
	453	* Thomas Weber <thomas.weber.mail@gmail.com> bug and patch for interp
	454	accelerator
	455
	456	* Lori A. Pritchett-Sheats bug report for vegas chisq.
	457
	458	* Frank Wang <frank.wang@validusre.bm> bug report for gsl_ran_gamma_knuth.

+19

-8

TODO less more

39	39
40	40	* Cumulative Distribution functions for discrete random distributions
41	41
	42
	43	Changes for Release 2.0
	44
	45	Break binary compatibility, but keep source compatibility.
	46
	47	* Add a 'void *' to all workspaces, to allow for future changes.
	48
	49	* Disable deprecated functions
	50
	51	* Fix up the workspace_alloc functions so they have consistent names
	52	(add functions where needed, don't remove)
	53
	54	* Standardize function names, in particular VERB vs NOUN (e.g. _invert
	55	vs _inverse). Also adopt a convection for functions which can operate
	56	in place vs use of workspace (e.g linalg_solve functions).
	57
	58
	59
42	60	Other tasks:
43	61
44	62	* Remove use of long double internally, e.g. as an accumulator in

73	91	the outermost layer which may have been missed. Everything should be
74	92	of the form #define foo(x) (....) so there is no possibility of bad
75	93	parsing. Need a perl script to check this!
76
77		* Clean up the ordering of lines in the Makefile.am's so that they are
78		all consistent. At the moment the lines are in any order.
79	94
80	95	* Eliminate use of volatile where it has been used to force rounding
81	96	(integration/). It is better to write the code to avoid dependence on

138	153	* Go through the matrix and vector functions systematically and decide
139	154	what should be provided outside of BLAS.
140	155
141		* Standardize function names, in particular VERB vs NOUN (e.g. _invert
142		vs _inverse). Also adopt a convection for functions which can operate
143		in place vs use of workspace (e.g linalg_solve functions).
144
145	156	* Change from gsl-ref.texi to gsl.texi since it is the main file?
146	157	Also, put under dir section "Math" (which seems to be the appropriate
147	158	one for Debian, as Octave, Gnuplot etc are in that)

174	185	of size_t for vectors and matrices, or at least vectors and matrices
175	186	of size_t in addition to long, int, etc.
176	187
177		* Fix up the workspace_alloc functions so they have consistent names
178	188
	189

+246

-140

aclocal.m4 less more

654	654	# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
655	655	])
656	656
657		# serial 54 LT_INIT
	657	# serial 56 LT_INIT
658	658
659	659
660	660	# LT_PREREQ(VERSION)

674	674	m4_defun([_LT_CHECK_BUILDDIR],
675	675	[case `pwd` in
676	676	\ \| \ )
677		AC_MSG_WARN([Libtool does not cope well with whitespace in \`pwd\`]) ;;
	677	AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;;
678	678	esac
679	679	])
680	680

772	772	_LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl
773	773	dnl
774	774	AC_REQUIRE([LT_CMD_MAX_LEN])dnl
775		AC_REQUIRE([AC_OBJEXT])dnl
776	775	_LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl
777		AC_REQUIRE([AC_EXEEXT])dnl
778	776	_LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl
779	777	dnl
780	778	m4_require([_LT_FILEUTILS_DEFAULTS])dnl

993	991	# lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...])
994	992	# ---------------------------------------------------
995	993	m4_define([lt_decl_varnames_tagged],
996		[_$0(m4_quote(m4_default([$1], [[, ]])),
997		m4_quote(m4_if([$2], [],
998		m4_quote(lt_decl_tag_varnames),
999		m4_quote(m4_shift($@)))),
1000		m4_split(m4_normalize(m4_quote(_LT_TAGS))))])
1001		m4_define([_lt_decl_varnames_tagged], [lt_combine([$1], [$2], [_], $3)])
	994	[m4_assert([$# <= 2])dnl
	995	_$0(m4_quote(m4_default([$1], [[, ]])),
	996	m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]),
	997	m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))])
	998	m4_define([_lt_decl_varnames_tagged],
	999	[m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])])
1002	1000
1003	1001
1004	1002	# lt_decl_all_varnames([SEPARATOR], [VARNAME1...])

1296	1294	#! $SHELL
1297	1295
1298	1296	# `$ECHO "$ofile" \| sed 's%^.*/%%'` - Provide generalized library-building support services.
1299		# Generated automatically by $as_me (GNU $PACKAGE$TIMESTAMP) $VERSION
	1297	# Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION
1300	1298	# Libtool was configured on host `(hostname \|\| uname -n) 2>/dev/null \| sed 1q`:
1301	1299	# NOTE: Changes made to this file will be lost: look at ltmain.sh.
1302	1300	#

1506	1504	rhapsody* \| darwin*)
1507	1505	AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:])
1508	1506	AC_CHECK_TOOL([NMEDIT], [nmedit], [:])
	1507	AC_CHECK_TOOL([LIPO], [lipo], [:])
	1508	AC_CHECK_TOOL([OTOOL], [otool], [:])
	1509	AC_CHECK_TOOL([OTOOL64], [otool64], [:])
1509	1510	_LT_DECL([], [DSYMUTIL], [1],
1510	1511	[Tool to manipulate archived DWARF debug symbol files on Mac OS X])
1511	1512	_LT_DECL([], [NMEDIT], [1],
1512	1513	[Tool to change global to local symbols on Mac OS X])
	1514	_LT_DECL([], [LIPO], [1],
	1515	[Tool to manipulate fat objects and archives on Mac OS X])
	1516	_LT_DECL([], [OTOOL], [1],
	1517	[ldd/readelf like tool for Mach-O binaries on Mac OS X])
	1518	_LT_DECL([], [OTOOL64], [1],
	1519	[ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4])
1513	1520
1514	1521	AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod],
1515	1522	[lt_cv_apple_cc_single_mod=no

1518	1525	# by either setting the environment variable LT_MULTI_MODULE
1519	1526	# non-empty at configure time, or by adding -multi_module to the
1520	1527	# link flags.
	1528	rm -rf libconftest.dylib*
1521	1529	echo "int foo(void){return 1;}" > conftest.c
	1530	echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
	1531	-dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD
1522	1532	$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
1523		-dynamiclib ${wl}-single_module conftest.c
1524		if test -f libconftest.dylib; then
	1533	-dynamiclib -Wl,-single_module conftest.c 2>conftest.err
	1534	_lt_result=$?
	1535	if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then
1525	1536	lt_cv_apple_cc_single_mod=yes
1526		rm -rf libconftest.dylib*
	1537	else
	1538	cat conftest.err >&AS_MESSAGE_LOG_FD
1527	1539	fi
1528		rm conftest.c
	1540	rm -rf libconftest.dylib*
	1541	rm -f conftest.*
1529	1542	fi])
1530	1543	AC_CACHE_CHECK([for -exported_symbols_list linker flag],
1531	1544	[lt_cv_ld_exported_symbols_list],

1543	1556	_lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;;
1544	1557	darwin1.*)
1545	1558	_lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;;
1546		darwin*) # darwin 5.x on
	1559	darwin*) # darwin 5.x on
1547	1560	# if running on 10.5 or later, the deployment target defaults
1548	1561	# to the OS version, if on x86, and 10.4, the deployment
1549		# target defaults to 10.4. Don't you love it?
	1562	# target defaults to 10.4. Don't you love it?
1550	1563	case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in
1551	1564	10.0,86-darwin8\|10.0,-darwin[[91]]*)
1552	1565	_lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;;

1588	1601	_LT_TAGVAR(whole_archive_flag_spec, $1)=''
1589	1602	_LT_TAGVAR(link_all_deplibs, $1)=yes
1590	1603	_LT_TAGVAR(allow_undefined_flag, $1)="$_lt_dar_allow_undefined"
1591		if test "$GCC" = "yes"; then
	1604	case $cc_basename in
	1605	ifort*) _lt_dar_can_shared=yes ;;
	1606	*) _lt_dar_can_shared=$GCC ;;
	1607	esac
	1608	if test "$_lt_dar_can_shared" = "yes"; then
1592	1609	output_verbose_link_cmd=echo
1593	1610	_LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}"
1594	1611	_LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}"

1805	1822	# _LT_ENABLE_LOCK
1806	1823	# ---------------
1807	1824	m4_defun([_LT_ENABLE_LOCK],
1808		[AC_REQUIRE([AC_OBJEXT])dnl
1809		AC_ARG_ENABLE([libtool-lock],
	1825	[AC_ARG_ENABLE([libtool-lock],
1810	1826	[AS_HELP_STRING([--disable-libtool-lock],
1811	1827	[avoid locking (might break parallel builds)])])
1812	1828	test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes

1995	2011	# ----------------------------------------------------------------
1996	2012	# Check whether the given compiler option works
1997	2013	AC_DEFUN([_LT_COMPILER_OPTION],
1998		[AC_REQUIRE([AC_OBJEXT])dnl
1999		m4_require([_LT_FILEUTILS_DEFAULTS])dnl
	2014	[m4_require([_LT_FILEUTILS_DEFAULTS])dnl
2000	2015	m4_require([_LT_DECL_SED])dnl
2001	2016	AC_CACHE_CHECK([$1], [$2],
2002	2017	[$2=no

2112	2127	lt_cv_sys_max_cmd_len=-1;
2113	2128	;;
2114	2129
2115		cygwin* \| mingw*)
	2130	cygwin* \| mingw* \| cegcc*)
2116	2131	# On Win9x/ME, this test blows up -- it succeeds, but takes
2117	2132	# about 5 minutes as the teststring grows exponentially.
2118	2133	# Worse, since 9x/ME are not pre-emptively multitasking,

2280	2295	# endif
2281	2296	#endif
2282	2297
2283		#ifdef __cplusplus
2284		extern "C" void exit (int);
2285		#endif
2286
2287	2298	void fnord() { int i=42;}
2288	2299	int main ()
2289	2300	{

2299	2310	else
2300	2311	puts (dlerror ());
2301	2312
2302		exit (status);
	2313	return status;
2303	2314	}]
2304	2315	_LT_EOF
2305	2316	if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then

2338	2349	lt_cv_dlopen_self=yes
2339	2350	;;
2340	2351
2341		mingw* \| pw32*)
	2352	mingw* \| pw32* \| cegcc*)
2342	2353	lt_cv_dlopen="LoadLibrary"
2343	2354	lt_cv_dlopen_libs=
2344	2355	;;

2448	2459	# Check to see if options -c and -o are simultaneously supported by compiler.
2449	2460	# This macro does not hard code the compiler like AC_PROG_CC_C_O.
2450	2461	m4_defun([_LT_COMPILER_C_O],
2451		[AC_REQUIRE([AC_OBJEXT])dnl
2452		m4_require([_LT_DECL_SED])dnl
	2462	[m4_require([_LT_DECL_SED])dnl
2453	2463	m4_require([_LT_FILEUTILS_DEFAULTS])dnl
2454	2464	m4_require([_LT_TAG_COMPILER])dnl
2455	2465	AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext],

2636	2646	[AC_REQUIRE([AC_CANONICAL_HOST])dnl
2637	2647	m4_require([_LT_DECL_EGREP])dnl
2638	2648	m4_require([_LT_FILEUTILS_DEFAULTS])dnl
	2649	m4_require([_LT_DECL_OBJDUMP])dnl
2639	2650	m4_require([_LT_DECL_SED])dnl
2640	2651	AC_MSG_CHECKING([dynamic linker characteristics])
2641	2652	m4_if([$1],

2766	2777	;;
2767	2778
2768	2779	amigaos*)
2769		if test "$host_cpu" = m68k; then
	2780	case $host_cpu in
	2781	powerpc)
	2782	# Since July 2007 AmigaOS4 officially supports .so libraries.
	2783	# When compiling the executable, add -use-dynld -Lsobjs: to the compileline.
	2784	library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
	2785	;;
	2786	m68k)
2770	2787	library_names_spec='$libname.ixlibrary $libname.a'
2771	2788	# Create ${libname}_ixlibrary.a entries in /sys/libs.
2772	2789	finish_eval='for lib in `ls $libdir/.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" \| $Xsed -e '\''s%^./$[[^/]]*$\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a \|\| exit 1; done'
2773		else
2774		dynamic_linker=no
2775		fi
	2790	;;
	2791	esac
2776	2792	;;
2777	2793
2778	2794	beos*)

2795	2811	# libtool to hard-code these into programs
2796	2812	;;
2797	2813
2798		cygwin* \| mingw* \| pw32*)
	2814	cygwin* \| mingw* \| pw32* \| cegcc*)
2799	2815	version_type=windows
2800	2816	shrext_cmds=".dll"
2801	2817	need_version=no
2802	2818	need_lib_prefix=no
2803	2819
2804	2820	case $GCC,$host_os in
2805		yes,cygwin* \| yes,mingw* \| yes,pw32*)
	2821	yes,cygwin* \| yes,mingw* \| yes,pw32* \| yes,cegcc*)
2806	2822	library_names_spec='$libname.dll.a'
2807	2823	# DLL is installed to $(libdir)/../bin by postinstall_cmds
2808	2824	postinstall_cmds='base_file=`basename \${file}`~

2825	2841	soname_spec='`echo ${libname} \| sed -e 's/^lib/cyg/'``echo ${release} \| $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
2826	2842	sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib"
2827	2843	;;
2828		mingw*)
	2844	mingw* \| cegcc*)
2829	2845	# MinGW DLLs use traditional 'lib' prefix
2830	2846	soname_spec='${libname}`echo ${release} \| $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}'
2831	2847	sys_lib_search_path_spec=`$CC -print-search-dirs \| $GREP "^libraries:" \| $SED -e "s/^libraries://" -e "s,=/,/,g"`

3251	3267	version_type=linux
3252	3268	need_lib_prefix=no
3253	3269	need_version=no
3254		library_name_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
	3270	library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
3255	3271	shlibpath_var=LD_LIBRARY_PATH
3256	3272	shlibpath_overrides_runpath=no
3257	3273	hardcode_into_libs=yes

3275	3291	if test "$GCC" = yes; then
3276	3292	variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH"
3277	3293	fi
3278
	3294
3279	3295	if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then
3280	3296	sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec"
3281	3297	fi

3552	3568	# -- PORTME fill in with the dynamic library characteristics
3553	3569	m4_defun([_LT_CHECK_MAGIC_METHOD],
3554	3570	[m4_require([_LT_DECL_EGREP])
	3571	m4_require([_LT_DECL_OBJDUMP])
3555	3572	AC_CACHE_CHECK([how to recognize dependent libraries],
3556	3573	lt_cv_deplibs_check_method,
3557	3574	[lt_cv_file_magic_cmd='$MAGIC_CMD'

3600	3617	lt_cv_deplibs_check_method='file_magic file format pei-i386(.architecture: i386)?'
3601	3618	lt_cv_file_magic_cmd='$OBJDUMP -f'
3602	3619	fi
	3620	;;
	3621
	3622	cegcc)
	3623	# use the weaker test based on 'objdump'. See mingw*.
	3624	lt_cv_deplibs_check_method='file_magic file format pe-arm-.little(.architecture: arm)?'
	3625	lt_cv_file_magic_cmd='$OBJDUMP -f'
3603	3626	;;
3604	3627
3605	3628	darwin* \| rhapsody*)

3754	3777	# find the pathname to a BSD- or MS-compatible name lister
3755	3778	AC_DEFUN([LT_PATH_NM],
3756	3779	[AC_REQUIRE([AC_PROG_CC])dnl
3757		AC_REQUIRE([AC_OBJEXT])dnl
3758	3780	AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM,
3759	3781	[if test -n "$NM"; then
3760	3782	# Let the user override the test.

3890	3912	m4_defun([_LT_CMD_GLOBAL_SYMBOLS],
3891	3913	[AC_REQUIRE([AC_CANONICAL_HOST])dnl
3892	3914	AC_REQUIRE([AC_PROG_CC])dnl
3893		AC_REQUIRE([AC_OBJEXT])dnl
3894	3915	AC_REQUIRE([LT_PATH_NM])dnl
3895	3916	AC_REQUIRE([LT_PATH_LD])dnl
3896	3917	m4_require([_LT_DECL_SED])dnl

3915	3936	aix*)
3916	3937	symcode='[[BCDT]]'
3917	3938	;;
3918		cygwin* \| mingw* \| pw32*)
	3939	cygwin* \| mingw* \| pw32* \| cegcc*)
3919	3940	symcode='[[ABCDGISTW]]'
3920	3941	;;
3921	3942	hpux*)

4142	4163	_LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic'
4143	4164	fi
4144	4165	;;
	4166
4145	4167	amigaos*)
4146		if test "$host_cpu" = m68k; then
4147		# FIXME: we need at least 68020 code to build shared libraries, but
4148		# adding the `-m68020' flag to GCC prevents building anything better,
4149		# like `-m68040'.
4150		_LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
4151		fi
4152		;;
	4168	case $host_cpu in
	4169	powerpc)
	4170	# see comment about AmigaOS4 .so support
	4171	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
	4172	;;
	4173	m68k)
	4174	# FIXME: we need at least 68020 code to build shared libraries, but
	4175	# adding the `-m68020' flag to GCC prevents building anything better,
	4176	# like `-m68040'.
	4177	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
	4178	;;
	4179	esac
	4180	;;
	4181
4153	4182	beos* \| irix5* \| irix6* \| nonstopux* \| osf3* \| osf4* \| osf5*)
4154	4183	# PIC is the default for these OSes.
4155	4184	;;
4156		mingw* \| cygwin* \| os2* \| pw32*)
	4185	mingw* \| cygwin* \| os2* \| pw32* \| cegcc*)
4157	4186	# This hack is so that the source file can tell whether it is being
4158	4187	# built for inclusion in a dll (and should export symbols for example).
4159	4188	# Although the cygwin gcc ignores -fPIC, still need this for old-style

4180	4209	fi
4181	4210	;;
4182	4211	hpux*)
4183		# PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
4184		# not for PA HP-UX.
	4212	# PIC is the default for 64-bit PA HP-UX, but not for 32-bit
	4213	# PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag
	4214	# sets the default TLS model and affects inlining.
4185	4215	case $host_cpu in
4186		hppa64\|ia64*)
	4216	hppa64)
4187	4217	;;
4188	4218	*)
4189	4219	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'

4281	4311	_LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,'
4282	4312	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
4283	4313	;;
4284		icpc* \| ecpc* )
4285		# Intel C++
	4314	ecpc* )
	4315	# old Intel C++ for x86_64 which still supported -KPIC.
4286	4316	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
4287	4317	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
	4318	_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
	4319	;;
	4320	icpc* )
	4321	# Intel C++, used to be incompatible with GCC.
	4322	# ICC 10 doesn't accept -KPIC any more.
	4323	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
	4324	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
4288	4325	_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
4289	4326	;;
4290	4327	pgCC* \| pgcpp*)

4434	4471	;;
4435	4472
4436	4473	amigaos*)
4437		if test "$host_cpu" = m68k; then
4438		# FIXME: we need at least 68020 code to build shared libraries, but
4439		# adding the `-m68020' flag to GCC prevents building anything better,
4440		# like `-m68040'.
4441		_LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
4442		fi
	4474	case $host_cpu in
	4475	powerpc)
	4476	# see comment about AmigaOS4 .so support
	4477	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
	4478	;;
	4479	m68k)
	4480	# FIXME: we need at least 68020 code to build shared libraries, but
	4481	# adding the `-m68020' flag to GCC prevents building anything better,
	4482	# like `-m68040'.
	4483	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4'
	4484	;;
	4485	esac
4443	4486	;;
4444	4487
4445	4488	beos* \| irix5* \| irix6* \| nonstopux* \| osf3* \| osf4* \| osf5*)
4446	4489	# PIC is the default for these OSes.
4447	4490	;;
4448	4491
4449		mingw* \| cygwin* \| pw32* \| os2*)
	4492	mingw* \| cygwin* \| pw32* \| os2* \| cegcc*)
4450	4493	# This hack is so that the source file can tell whether it is being
4451	4494	# built for inclusion in a dll (and should export symbols for example).
4452	4495	# Although the cygwin gcc ignores -fPIC, still need this for old-style

4462	4505	;;
4463	4506
4464	4507	hpux*)
4465		# PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
4466		# not for PA HP-UX.
	4508	# PIC is the default for 64-bit PA HP-UX, but not for 32-bit
	4509	# PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag
	4510	# sets the default TLS model and affects inlining.
4467	4511	case $host_cpu in
4468		hppa64\|ia64*)
	4512	hppa64)
4469	4513	# +Z the default
4470	4514	;;
4471	4515	*)

4515	4559	fi
4516	4560	;;
4517	4561
4518		mingw* \| cygwin* \| pw32* \| os2*)
	4562	mingw* \| cygwin* \| pw32* \| os2* \| cegcc*)
4519	4563	# This hack is so that the source file can tell whether it is being
4520	4564	# built for inclusion in a dll (and should export symbols for example).
4521	4565	m4_if([$1], [GCJ], [],

4546	4590
4547	4591	linux* \| kbsd-gnu)
4548	4592	case $cc_basename in
4549		icc* \| ecc* \| ifort*)
	4593	# old Intel for x86_64 which still supported -KPIC.
	4594	ecc*)
4550	4595	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
4551	4596	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC'
4552	4597	_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
4553	4598	;;
	4599	# icc used to be incompatible with GCC.
	4600	# ICC 10 doesn't accept -KPIC any more.
	4601	icc* \| ifort*)
	4602	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
	4603	_LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC'
	4604	_LT_TAGVAR(lt_prog_compiler_static, $1)='-static'
	4605	;;
	4606	# Lahey Fortran 8.1.
	4607	lf95*)
	4608	_LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,'
	4609	_LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared'
	4610	_LT_TAGVAR(lt_prog_compiler_static, $1)='--static'
	4611	;;
4554	4612	pgcc* \| pgf77* \| pgf90* \| pgf95*)
4555	4613	# Portland Group compilers (not the Pentium gcc compiler,
4556	4614	# which looks to be a dead project)

4732	4790	pw32*)
4733	4791	_LT_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds"
4734	4792	;;
4735		cygwin* \| mingw*)
	4793	cygwin* \| mingw* \| cegcc*)
4736	4794	_LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience \| $global_symbol_pipe \| $SED -e '\''/^[[BCDGRS]][[ ]]/s/.[[ ]]$[[^ ]]$/\1 DATA/;/^.[[ ]]__nm__/s/^.[[ ]]__nm__$[[^ ]]$[[ ]][[^ ]]/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' \| sort \| uniq > $export_symbols'
4737	4795	;;
4738	4796	*)

4784	4842	extract_expsyms_cmds=
4785	4843
4786	4844	case $host_os in
4787		cygwin* \| mingw* \| pw32*)
	4845	cygwin* \| mingw* \| pw32* \| cegcc*)
4788	4846	# FIXME: the MSVC++ port hasn't been tested in a loooong time
4789	4847	# When not using gcc, we currently assume that we are using
4790	4848	# Microsoft Visual C++.

4846	4904	;;
4847	4905
4848	4906	amigaos*)
4849		if test "$host_cpu" = m68k; then
4850		_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
4851		_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
4852		_LT_TAGVAR(hardcode_minus_L, $1)=yes
4853		fi
4854
4855		# Samuel A. Falvo II <kc5tja@dolphin.openprojects.net> reports
4856		# that the semantics of dynamic libraries on AmigaOS, at least up
4857		# to version 4, is to share data among multiple programs linked
4858		# with the same dynamic library. Since this doesn't match the
4859		# behavior of shared libraries on other platforms, we can't use
4860		# them.
4861		_LT_TAGVAR(ld_shlibs, $1)=no
	4907	case $host_cpu in
	4908	powerpc)
	4909	# see comment about AmigaOS4 .so support
	4910	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
	4911	_LT_TAGVAR(archive_expsym_cmds, $1)=''
	4912	;;
	4913	m68k)
	4914	_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
	4915	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
	4916	_LT_TAGVAR(hardcode_minus_L, $1)=yes
	4917	;;
	4918	esac
4862	4919	;;
4863	4920
4864	4921	beos*)

4872	4929	fi
4873	4930	;;
4874	4931
4875		cygwin* \| mingw* \| pw32*)
	4932	cygwin* \| mingw* \| pw32* \| cegcc*)
4876	4933	# _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,
4877	4934	# as there is no search path for DLLs.
4878	4935	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'

4938	4995	tmp_addflag=' -i_dynamic -nofor_main' ;;
4939	4996	ifc* \| ifort*) # Intel Fortran compiler
4940	4997	tmp_addflag=' -nofor_main' ;;
	4998	lf95*) # Lahey Fortran 8.1
	4999	_LT_TAGVAR(whole_archive_flag_spec, $1)=
	5000	tmp_sharedflag='--shared' ;;
4941	5001	xl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below)
4942	5002	tmp_sharedflag='-qmkshrobj'
4943	5003	tmp_addflag= ;;

5169	5229	fi
5170	5230	fi
5171	5231
	5232	_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall'
5172	5233	# It seems that -bexpall does not export symbols beginning with
5173	5234	# underscore (_), so it is better to generate a list of symbols to export.
5174	5235	_LT_TAGVAR(always_export_symbols, $1)=yes

5205	5266	;;
5206	5267
5207	5268	amigaos*)
5208		if test "$host_cpu" = m68k; then
5209		_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
5210		_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
5211		_LT_TAGVAR(hardcode_minus_L, $1)=yes
5212		fi
5213		# see comment about different semantics on the GNU ld section
5214		_LT_TAGVAR(ld_shlibs, $1)=no
	5269	case $host_cpu in
	5270	powerpc)
	5271	# see comment about AmigaOS4 .so support
	5272	_LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
	5273	_LT_TAGVAR(archive_expsym_cmds, $1)=''
	5274	;;
	5275	m68k)
	5276	_LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
	5277	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'
	5278	_LT_TAGVAR(hardcode_minus_L, $1)=yes
	5279	;;
	5280	esac
5215	5281	;;
5216	5282
5217	5283	bsdi[[45]]*)
5218	5284	_LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic
5219	5285	;;
5220	5286
5221		cygwin* \| mingw* \| pw32*)
	5287	cygwin* \| mingw* \| pw32* \| cegcc*)
5222	5288	# When not using gcc, we currently assume that we are using
5223	5289	# Microsoft Visual C++.
5224	5290	# hardcode_libdir_flag_spec is actually meaningless, as there is

5322	5388	_LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
5323	5389	;;
5324	5390	ia64*)
5325		_LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
	5391	_LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
5326	5392	;;
5327	5393	*)
5328	5394	_LT_TAGVAR(archive_cmds, $1)='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'

6103	6169	fi
6104	6170	fi
6105	6171
	6172	_LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall'
6106	6173	# It seems that -bexpall does not export symbols beginning with
6107	6174	# underscore (_), so it is better to generate a list of symbols to
6108	6175	# export.

6161	6228	esac
6162	6229	;;
6163	6230
6164		cygwin* \| mingw* \| pw32*)
	6231	cygwin* \| mingw* \| pw32* \| cegcc*)
6165	6232	# _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless,
6166	6233	# as there is no search path for DLLs.
6167	6234	_LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir'

7422	7489	CC=${GCJ-"gcj"}
7423	7490	compiler=$CC
7424	7491	_LT_TAGVAR(compiler, $1)=$CC
	7492	_LT_TAGVAR(LD, $1)="$LD"
7425	7493	_LT_CC_BASENAME([$compiler])
7426	7494
7427	7495	# GCJ did not exist at the time GCC didn't implicitly link libc in.

7538	7606	_LT_DECL([], [FGREP], [1], [A literal string matcher])
7539	7607	dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too
7540	7608	AC_SUBST([GREP])
	7609	])
	7610
	7611
	7612	# _LT_DECL_OBJDUMP
	7613	# --------------
	7614	# If we don't have a new enough Autoconf to choose the best objdump
	7615	# available, choose the one first in the user's PATH.
	7616	m4_defun([_LT_DECL_OBJDUMP],
	7617	[AC_CHECK_TOOL(OBJDUMP, objdump, false)
	7618	test -z "$OBJDUMP" && OBJDUMP=objdump
	7619	_LT_DECL([], [OBJDUMP], [1], [An object symbol dumper])
	7620	AC_SUBST([OBJDUMP])
7541	7621	])
7542	7622
7543	7623

7632	7712	xsi_shell=no
7633	7713	( _lt_dummy="a/b/c"
7634	7714	test "${_lt_dummy##/},${_lt_dummy%/},"${_lt_dummy%"$_lt_dummy"}, \
7635		= c,a/b,, ) >/dev/null 2>&1 \
	7715	= c,a/b,, \
	7716	&& eval 'test $(( 1 + 1 )) -eq 2 \
	7717	&& test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \
7636	7718	&& xsi_shell=yes
7637	7719	AC_MSG_RESULT([$xsi_shell])
7638	7720	_LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell'])

7676	7758	[case $xsi_shell in
7677	7759	yes)
7678	7760	cat << \_LT_EOF >> "$cfgfile"
	7761
7679	7762	# func_dirname file append nondir_replacement
7680	7763	# Compute the dirname of FILE. If nonempty, add APPEND to the result,
7681	7764	# otherwise set result to NONDIR_REPLACEMENT.

7743	7826	*) func_lo2o_result=${1} ;;
7744	7827	esac
7745	7828	}
	7829
	7830	# func_xform libobj-or-source
	7831	func_xform ()
	7832	{
	7833	func_xform_result=${1%.*}.lo
	7834	}
	7835
	7836	# func_arith arithmetic-term...
	7837	func_arith ()
	7838	{
	7839	func_arith_result=$(( $[*] ))
	7840	}
	7841
	7842	# func_len string
	7843	# STRING may not start with a hyphen.
	7844	func_len ()
	7845	{
	7846	func_len_result=${#1}
	7847	}
	7848
7746	7849	_LT_EOF
7747	7850	;;
7748	7851	*) # Bourne compatible functions.
7749	7852	cat << \_LT_EOF >> "$cfgfile"
	7853
7750	7854	# func_dirname file append nondir_replacement
7751	7855	# Compute the dirname of FILE. If nonempty, add APPEND to the result,
7752	7856	# otherwise set result to NONDIR_REPLACEMENT.

7767	7871	func_basename_result=`$ECHO "X${1}" \| $Xsed -e "$basename"`
7768	7872	}
7769	7873
7770		# func_dirname_and_basename file append nondir_replacement
7771		# perform func_basename and func_dirname in a single function
7772		# call:
7773		# dirname: Compute the dirname of FILE. If nonempty,
7774		# add APPEND to the result, otherwise set result
7775		# to NONDIR_REPLACEMENT.
7776		# value returned in "$func_dirname_result"
7777		# basename: Compute filename of FILE.
7778		# value retuned in "$func_basename_result"
7779		# Implementation must be kept synchronized with func_dirname
7780		# and func_basename. For efficiency, we do not delegate to
7781		# those functions but instead duplicate the functionality here.
7782		func_dirname_and_basename ()
7783		{
7784		# Extract subdirectory from the argument.
7785		func_dirname_result=`$ECHO "X${1}" \| $Xsed -e "$dirname"`
7786		if test "X$func_dirname_result" = "X${1}"; then
7787		func_dirname_result="${3}"
7788		else
7789		func_dirname_result="$func_dirname_result${2}"
7790		fi
7791		func_basename_result=`$ECHO "X${1}" \| $Xsed -e "$basename"`
7792		}
	7874	dnl func_dirname_and_basename
	7875	dnl A portable version of this function is already defined in general.m4sh
	7876	dnl so there is no need for it here.
7793	7877
7794	7878	# func_stripname prefix suffix name
7795	7879	# strip PREFIX and SUFFIX off of NAME.

7823	7907	{
7824	7908	func_lo2o_result=`$ECHO "X${1}" \| $Xsed -e "$lo2o"`
7825	7909	}
	7910
	7911	# func_xform libobj-or-source
	7912	func_xform ()
	7913	{
	7914	func_xform_result=`$ECHO "X${1}" \| $Xsed -e 's/\.[[^.]]*$/.lo/'`
	7915	}
	7916
	7917	# func_arith arithmetic-term...
	7918	func_arith ()
	7919	{
	7920	func_arith_result=`expr "$[@]"`
	7921	}
	7922
	7923	# func_len string
	7924	# STRING may not start with a hyphen.
	7925	func_len ()
	7926	{
	7927	func_len_result=`expr "$[1]" : ".*" 2>/dev/null \|\| echo $max_cmd_len`
	7928	}
	7929
7826	7930	_LT_EOF
7827	7931	esac
7828	7932

7847	7951	{
7848	7952	eval "$[1]=\$$[1]\$[2]"
7849	7953	}
	7954
7850	7955	_LT_EOF
7851	7956	;;
7852	7957	esac

7861	7966	# unlimited permission to copy and/or distribute it, with or without
7862	7967	# modifications, as long as this notice is preserved.
7863	7968
7864		# serial 4 ltoptions.m4
	7969	# serial 6 ltoptions.m4
7865	7970
7866	7971	# This is to help aclocal find these macros, as it can't see m4_define.
7867	7972	AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])])

7976	8081	[enable_win32_dll=yes
7977	8082
7978	8083	case $host in
7979		--cygwin* \| --mingw* \| --pw32*)
	8084	--cygwin* \| --mingw* \| --pw32* \| -cegcc)
7980	8085	AC_CHECK_TOOL(AS, as, false)
7981	8086	AC_CHECK_TOOL(DLLTOOL, dlltool, false)
7982	8087	AC_CHECK_TOOL(OBJDUMP, objdump, false)

7994	8099	])# win32-dll
7995	8100
7996	8101	AU_DEFUN([AC_LIBTOOL_WIN32_DLL],
7997		[_LT_SET_OPTION([LT_INIT], [win32-dll])
	8102	[AC_REQUIRE([AC_CANONICAL_HOST])dnl
	8103	_LT_SET_OPTION([LT_INIT], [win32-dll])
7998	8104	AC_DIAGNOSE([obsolete],
7999	8105	[$0: Remove this warning and the call to _LT_SET_OPTION when you
8000	8106	put the `win32-dll' option into LT_INIT's first parameter.])

8042	8148
8043	8149	# Old names:
8044	8150	AC_DEFUN([AC_ENABLE_SHARED],
8045		[_LT_SET_OPTION([LT_INIT], [shared])
	8151	[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared])
8046	8152	])
8047	8153
8048	8154	AC_DEFUN([AC_DISABLE_SHARED],

8096	8202
8097	8203	# Old names:
8098	8204	AC_DEFUN([AC_ENABLE_STATIC],
8099		[_LT_SET_OPTION([LT_INIT], [static])
	8205	[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static])
8100	8206	])
8101	8207
8102	8208	AC_DEFUN([AC_DISABLE_STATIC],

8150	8256
8151	8257	# Old names:
8152	8258	AU_DEFUN([AC_ENABLE_FAST_INSTALL],
8153		[_LT_SET_OPTION([LT_INIT], [fast-install])
	8259	[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install])
8154	8260	AC_DIAGNOSE([obsolete],
8155	8261	[$0: Remove this warning and the call to _LT_SET_OPTION when you put
8156	8262	the `fast-install' option into LT_INIT's first parameter.])

8216	8322
8217	8323	# ltsugar.m4 -- libtool m4 base layer. --Autoconf--
8218	8324	#
8219		# Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc.
8220		# Written by Gary V. Vaughan, 2004
	8325	# Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc.
	8326	# Written by Gary V. Vaughan, 2004
8221	8327	#
8222	8328	# This file is free software; the Free Software Foundation gives
8223	8329	# unlimited permission to copy and/or distribute it, with or without
8224	8330	# modifications, as long as this notice is preserved.
8225	8331
8226		# serial 5 ltsugar.m4
	8332	# serial 6 ltsugar.m4
8227	8333
8228	8334	# This is to help aclocal find these macros, as it can't see m4_define.
8229	8335	AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])])

8279	8385	# Produce a SEP delimited list of all paired combinations of elements of
8280	8386	# PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list
8281	8387	# has the form PREFIXmINFIXSUFFIXn.
	8388	# Needed until we can rely on m4_combine added in Autoconf 2.62.
8282	8389	m4_define([lt_combine],
8283		[m4_if([$2], [], [],
8284		[m4_if([$4], [], [],
8285		[lt_join(m4_quote(m4_default([$1], [[, ]])),
8286		lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_prefix, [$2],
8287		[m4_foreach(_Lt_suffix, lt_car([m4_shiftn(3, $@)]),
8288		[_Lt_prefix[]$3[]_Lt_suffix ])])))))])])dnl
8289		])
	8390	[m4_if(m4_eval([$# > 3]), [1],
	8391	[m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl
	8392	[[m4_foreach([_Lt_prefix], [$2],
	8393	[m4_foreach([_Lt_suffix],
	8394	]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[,
	8395	[_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])])
8290	8396
8291	8397
8292	8398	# lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ])

8349	8455
8350	8456	# Generated from ltversion.in.
8351	8457
8352		# serial 2599 ltversion.m4
	8458	# serial 3012 ltversion.m4
8353	8459	# This file is part of GNU Libtool
8354	8460
8355		m4_define([LT_PACKAGE_VERSION], [2.2])
8356		m4_define([LT_PACKAGE_REVISION], [1.2599])
	8461	m4_define([LT_PACKAGE_VERSION], [2.2.6])
	8462	m4_define([LT_PACKAGE_REVISION], [1.3012])
8357	8463
8358	8464	AC_DEFUN([LTVERSION_VERSION],
8359		[macro_version='2.2'
8360		macro_revision='1.2599'
	8465	[macro_version='2.2.6'
	8466	macro_revision='1.3012'
8361	8467	_LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?])
8362	8468	_LT_DECL(, macro_revision, 0)
8363	8469	])

8371	8477	# unlimited permission to copy and/or distribute it, with or without
8372	8478	# modifications, as long as this notice is preserved.
8373	8479
8374		# serial 3
	8480	# serial 4 lt~obsolete.m4
8375	8481
8376	8482	# These exist entirely to fool aclocal when bootstrapping libtool.
8377	8483	#

+1

-0

autogen.sh less more

4	4
5	5	libtoolize --automake
6	6	aclocal
	7	autoheader
7	8	automake --add-missing --gnu
8	9	autoconf
9	10	echo "Now use ./configure --enable-maintainer-mode"

+1

-1

blas/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_blas.h gsl_blas_types.h
3	3
4		INCLUDES= -I$(top_srcdir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslblas_la_SOURCES = blas.c
7	7

+4

-0

blas/Makefile.in less more

125	125	LIBOBJS = @LIBOBJS@
126	126	LIBS = @LIBS@
127	127	LIBTOOL = @LIBTOOL@
	128	LIPO = @LIPO@
128	129	LN_S = @LN_S@
129	130	LTLIBOBJS = @LTLIBOBJS@
130	131	MAINT = @MAINT@

132	133	MKDIR_P = @MKDIR_P@
133	134	NM = @NM@
134	135	NMEDIT = @NMEDIT@
	136	OBJDUMP = @OBJDUMP@
135	137	OBJEXT = @OBJEXT@
	138	OTOOL = @OTOOL@
	139	OTOOL64 = @OTOOL64@
136	140	PACKAGE = @PACKAGE@
137	141	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
138	142	PACKAGE_NAME = @PACKAGE_NAME@

+4

-0

block/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): remove top_builddir
	3
0	4	2005-05-21 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* Makefile.am (pkginclude_HEADERS): removed unused file

+1

-1

block/Makefile.am less more

3	3
4	4	pkginclude_HEADERS = gsl_block.h gsl_block_char.h gsl_block_complex_double.h gsl_block_complex_float.h gsl_block_complex_long_double.h gsl_block_double.h gsl_block_float.h gsl_block_int.h gsl_block_long.h gsl_block_long_double.h gsl_block_short.h gsl_block_uchar.h gsl_block_uint.h gsl_block_ulong.h gsl_block_ushort.h gsl_check_range.h
5	5
6		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	TESTS = $(check_PROGRAMS)
9	9

+5

-1

block/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

203	207	top_srcdir = @top_srcdir@
204	208	noinst_LTLIBRARIES = libgslblock.la
205	209	pkginclude_HEADERS = gsl_block.h gsl_block_char.h gsl_block_complex_double.h gsl_block_complex_float.h gsl_block_complex_long_double.h gsl_block_double.h gsl_block_float.h gsl_block_int.h gsl_block_long.h gsl_block_long_double.h gsl_block_short.h gsl_block_uchar.h gsl_block_uint.h gsl_block_ulong.h gsl_block_ushort.h gsl_check_range.h
206		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
	210	INCLUDES = -I$(top_srcdir)
207	211	TESTS = $(check_PROGRAMS)
208	212	test_LDADD = libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
209	213	test_SOURCES = test.c

+13

-0

bspline/ChangeLog less more

	0	2008-12-09 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* bspline.c (gsl_bspline_deriv_alloc): add size to derivative
	3	struct
	4
	5	2008-12-08 Brian Gough <bjg@network-theory.co.uk>
	6
	7	* gsl_bspline.h: preserve binary compatibility in workspaces
	8
	9	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	10
	11	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	12
0	13	2006-11-02 Brian Gough <bjg@network-theory.co.uk>
1	14
2	15	* added test program

+3

-1

bspline/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_bspline.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslbspline_la_SOURCES = bspline.c
	7
	8	noinst_HEADERS = bspline.h
7	9
8	10	check_PROGRAMS = test
9	11

+9

-4

bspline/Makefile.in less more

34	34	host_triplet = @host@
35	35	check_PROGRAMS = test$(EXEEXT)
36	36	subdir = bspline
37		DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \
38		$(srcdir)/Makefile.in ChangeLog TODO
	37	DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) \
	38	$(srcdir)/Makefile.am $(srcdir)/Makefile.in ChangeLog TODO
39	39	ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
40	40	am__aclocal_m4_deps = $(top_srcdir)/configure.ac
41	41	am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \

78	78	am__strip_dir = `echo $$p \| sed -e 's\|^.*/\|\|'`;
79	79	am__installdirs = "$(DESTDIR)$(pkgincludedir)"
80	80	pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER)
81		HEADERS = $(pkginclude_HEADERS)
	81	HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS)
82	82	ETAGS = etags
83	83	CTAGS = ctags
84	84	DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)

135	135	LIBOBJS = @LIBOBJS@
136	136	LIBS = @LIBS@
137	137	LIBTOOL = @LIBTOOL@
	138	LIPO = @LIPO@
138	139	LN_S = @LN_S@
139	140	LTLIBOBJS = @LTLIBOBJS@
140	141	MAINT = @MAINT@

142	143	MKDIR_P = @MKDIR_P@
143	144	NM = @NM@
144	145	NMEDIT = @NMEDIT@
	146	OBJDUMP = @OBJDUMP@
145	147	OBJEXT = @OBJEXT@
	148	OTOOL = @OTOOL@
	149	OTOOL64 = @OTOOL64@
146	150	PACKAGE = @PACKAGE@
147	151	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
148	152	PACKAGE_NAME = @PACKAGE_NAME@

207	211	top_srcdir = @top_srcdir@
208	212	noinst_LTLIBRARIES = libgslbspline.la
209	213	pkginclude_HEADERS = gsl_bspline.h
210		INCLUDES = -I$(top_builddir)
	214	INCLUDES = -I$(top_srcdir)
211	215	libgslbspline_la_SOURCES = bspline.c
	216	noinst_HEADERS = bspline.h
212	217	TESTS = $(check_PROGRAMS)
213	218	test_LDADD = libgslbspline.la ../linalg/libgsllinalg.la ../permutation/libgslpermutation.la ../blas/libgslblas.la ../matrix/libgslmatrix.la ../vector/libgslvector.la ../block/libgslblock.la ../complex/libgslcomplex.la ../cblas/libgslcblas.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
214	219	test_SOURCES = test.c

+0

-2

bspline/TODO less more

0	0	Add functions:
1
2		gsl_bspline_eval_deriv (see pppack bsplvd) to compute B-spline derivatives
3	1
4	2	gsl_bspline_smooth to fit smoothing splines to data more efficiently
5	3	than the standard least squares inversion (see pppack l2appr and

+772

-270

bspline/bspline.c less more

0	0	/* bspline/bspline.c
1		*
	1	*
2	2	* Copyright (C) 2006, 2007, 2008 Patrick Alken
3		*
	3	* Copyright (C) 2008 Rhys Ulerich
	4	*
4	5	* This program is free software; you can redistribute it and/or modify
5	6	* it under the terms of the GNU General Public License as published by
6	7	* the Free Software Foundation; either version 3 of the License, or (at
7	8	* your option) any later version.
8		*
	9	*
9	10	* This program is distributed in the hope that it will be useful, but
10	11	* WITHOUT ANY WARRANTY; without even the implied warranty of
11	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12	13	* General Public License for more details.
13		*
	14	*
14	15	* You should have received a copy of the GNU General Public License
15	16	* along with this program; if not, write to the Free Software
16	17	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

26	27	*
27	28	* [1] Carl de Boor, "A Practical Guide to Splines", Springer
28	29	* Verlag, 1978.
	30	*
	31	* The bspline_pppack_* internal routines contain code adapted from
	32	*
	33	* [2] "PPPACK - Piecewise Polynomial Package",
	34	* http://www.netlib.org/pppack/
	35	*
29	36	*/
30	37
31		static int bspline_eval_all(const double x, gsl_vector B, size_t idx,
32		gsl_bspline_workspace *w);
33
34		static inline size_t bspline_find_interval(const double x, int *flag,
35		gsl_bspline_workspace *w);
	38	#include "bspline.h"
36	39
37	40	/*
38	41	gsl_bspline_alloc()

46	49	*/
47	50
48	51	gsl_bspline_workspace *
49		gsl_bspline_alloc(const size_t k, const size_t nbreak)
	52	gsl_bspline_alloc (const size_t k, const size_t nbreak)
50	53	{
51	54	if (k == 0)
52	55	{
53		GSL_ERROR_NULL("k must be at least 1", GSL_EINVAL);
	56	GSL_ERROR_NULL ("k must be at least 1", GSL_EINVAL);
54	57	}
55	58	else if (nbreak < 2)
56	59	{
57		GSL_ERROR_NULL("nbreak must be at least 2", GSL_EINVAL);
	60	GSL_ERROR_NULL ("nbreak must be at least 2", GSL_EINVAL);
58	61	}
59	62	else
60	63	{
61	64	gsl_bspline_workspace *w;
62	65
63		w = (gsl_bspline_workspace *)
64		calloc(1, sizeof(gsl_bspline_workspace));
	66	w = (gsl_bspline_workspace *) malloc (sizeof (gsl_bspline_workspace));
	67
65	68	if (w == 0)
66		{
67		GSL_ERROR_NULL("failed to allocate space for workspace", GSL_ENOMEM);
68		}
	69	{
	70	GSL_ERROR_NULL ("failed to allocate space for workspace",
	71	GSL_ENOMEM);
	72	}
69	73
70	74	w->k = k;
71	75	w->km1 = k - 1;

73	77	w->l = nbreak - 1;
74	78	w->n = w->l + k - 1;
75	79
76		w->knots = gsl_vector_alloc(w->n + k);
	80	w->knots = gsl_vector_alloc (w->n + k);
77	81	if (w->knots == 0)
78		{
79		gsl_bspline_free(w);
80		GSL_ERROR_NULL("failed to allocate space for knots vector", GSL_ENOMEM);
81		}
82
83		w->deltal = gsl_vector_alloc(k);
84		w->deltar = gsl_vector_alloc(k);
85		if (!w->deltal \|\| !w->deltar)
86		{
87		gsl_bspline_free(w);
88		GSL_ERROR_NULL("failed to allocate space for delta vectors", GSL_ENOMEM);
89		}
90
91		w->B = gsl_vector_alloc(k);
	82	{
	83	free (w);
	84	GSL_ERROR_NULL ("failed to allocate space for knots vector",
	85	GSL_ENOMEM);
	86	}
	87
	88	w->deltal = gsl_vector_alloc (k);
	89	if (w->deltal == 0)
	90	{
	91	free (w->knots);
	92	free (w);
	93	GSL_ERROR_NULL ("failed to allocate space for deltal vector",
	94	GSL_ENOMEM);
	95	}
	96
	97	w->deltar = gsl_vector_alloc (k);
	98	if (w->deltar == 0)
	99	{
	100	free (w->deltal);
	101	free (w->knots);
	102	free (w);
	103	GSL_ERROR_NULL ("failed to allocate space for deltar vector",
	104	GSL_ENOMEM);
	105	}
	106
	107
	108	w->B = gsl_vector_alloc (k);
92	109	if (w->B == 0)
93		{
94		gsl_bspline_free(w);
95		GSL_ERROR_NULL("failed to allocate space for temporary spline vector", GSL_ENOMEM);
96		}
97
98		return (w);
99		}
100		} /* gsl_bspline_alloc() */
	110	{
	111	free (w->deltar);;
	112	free (w->deltal);
	113	free (w->knots);
	114	free (w);
	115	GSL_ERROR_NULL
	116	("failed to allocate space for temporary spline vector",
	117	GSL_ENOMEM);
	118	}
	119
	120	return w;
	121	}
	122	} /* gsl_bspline_alloc() */
	123
	124	/*
	125	gsl_bspline_deriv_alloc()
	126	Allocate space for a bspline derivative workspace. The size of the
	127	workspace is O(2k^2)
	128
	129	Inputs: k - spline order (cubic = 4)
	130
	131	Return: pointer to workspace
	132	*/
	133
	134	gsl_bspline_deriv_workspace *
	135	gsl_bspline_deriv_alloc (const size_t k)
	136	{
	137	if (k == 0)
	138	{
	139	GSL_ERROR_NULL ("k must be at least 1", GSL_EINVAL);
	140	}
	141	else
	142	{
	143	gsl_bspline_deriv_workspace *dw;
	144
	145	dw =
	146	(gsl_bspline_deriv_workspace *)
	147	malloc (sizeof (gsl_bspline_deriv_workspace));
	148
	149	if (dw == 0)
	150	{
	151	GSL_ERROR_NULL ("failed to allocate space for workspace",
	152	GSL_ENOMEM);
	153	}
	154
	155	dw->A = gsl_matrix_alloc (k, k);
	156	if (dw->A == 0)
	157	{
	158	free (dw);
	159	GSL_ERROR_NULL
	160	("failed to allocate space for derivative work matrix",
	161	GSL_ENOMEM);
	162	}
	163
	164	dw->dB = gsl_matrix_alloc (k, k + 1);
	165	if (dw->dB == 0)
	166	{
	167	free (dw->A);
	168	free (dw);
	169	GSL_ERROR_NULL
	170	("failed to allocate space for temporary derivative matrix",
	171	GSL_ENOMEM);
	172	}
	173
	174	dw->k = k;
	175
	176	return dw;
	177	}
	178	} /* gsl_bspline_deriv_alloc() */
101	179
102	180	/* Return number of coefficients */
103	181	size_t

120	198	return w->nbreak;
121	199	}
122	200
	201	/* Return the location of the i-th breakpoint*/
123	202	double
124	203	gsl_bspline_breakpoint (size_t i, gsl_bspline_workspace * w)
125	204	{
126	205	size_t j = i + w->k - 1;
127		return gsl_vector_get(w->knots, j);
	206	return gsl_vector_get (w->knots, j);
128	207	}
129	208
130	209	/*
131	210	gsl_bspline_free()
132		Free a bspline workspace
	211	Free a gsl_bspline_workspace.
133	212
134	213	Inputs: w - workspace to free
135	214

137	216	*/
138	217
139	218	void
140		gsl_bspline_free(gsl_bspline_workspace *w)
141		{
142		if (w->knots)
143		gsl_vector_free(w->knots);
144
145		if (w->deltal)
146		gsl_vector_free(w->deltal);
147
148		if (w->deltar)
149		gsl_vector_free(w->deltar);
150
151		if (w->B)
152		gsl_vector_free(w->B);
153
154		free(w);
155		} /* gsl_bspline_free() */
	219	gsl_bspline_free (gsl_bspline_workspace * w)
	220	{
	221	gsl_vector_free (w->knots);
	222	gsl_vector_free (w->deltal);
	223	gsl_vector_free (w->deltar);
	224	gsl_vector_free (w->B);
	225	free (w);
	226	} /* gsl_bspline_free() */
	227
	228	/*
	229	gsl_bspline_deriv_free()
	230	Free a gsl_bspline_deriv_workspace.
	231
	232	Inputs: dw - workspace to free
	233
	234	Return: none
	235	*/
	236
	237	void
	238	gsl_bspline_deriv_free (gsl_bspline_deriv_workspace * dw)
	239	{
	240	gsl_matrix_free (dw->A);
	241	gsl_matrix_free (dw->dB);
	242	free (dw);
	243	} /* gsl_bspline_deriv_free() */
156	244
157	245	/*
158	246	gsl_bspline_knots()
159	247	Compute the knots from the given breakpoints:
160	248
161		knots(1:k) = breakpts(1)
162		knots(k+1:k+l-1) = breakpts(i), i = 2 .. l
163		knots(n+1:n+k) = breakpts(l + 1)
	249	knots(1:k) = breakpts(1)
	250	knots(k+1:k+l-1) = breakpts(i), i = 2 .. l
	251	knots(n+1:n+k) = breakpts(l + 1)
164	252
165	253	where l is the number of polynomial pieces (l = nbreak - 1) and
166		n = k + l - 1
	254	n = k + l - 1
167	255	(using matlab syntax for the arrays)
168	256
169	257	The repeated knots at the beginning and end of the interval

177	265	*/
178	266
179	267	int
180		gsl_bspline_knots(const gsl_vector breakpts, gsl_bspline_workspace w)
	268	gsl_bspline_knots (const gsl_vector * breakpts, gsl_bspline_workspace * w)
181	269	{
182	270	if (breakpts->size != w->nbreak)
183	271	{
184		GSL_ERROR("breakpts vector has wrong size", GSL_EBADLEN);
	272	GSL_ERROR ("breakpts vector has wrong size", GSL_EBADLEN);
185	273	}
186	274	else
187	275	{
188		size_t i; /* looping */
189
190		for (i = 0; i < w->k; ++i)
191		gsl_vector_set(w->knots, i, gsl_vector_get(breakpts, 0));
192
193		for (i = 1; i < w->l; ++i)
194		{
195		gsl_vector_set(w->knots, w->k - 1 + i,
196		gsl_vector_get(breakpts, i));
197		}
198
199		for (i = w->n; i < w->n + w->k; ++i)
200		gsl_vector_set(w->knots, i, gsl_vector_get(breakpts, w->l));
	276	size_t i; /* looping */
	277
	278	for (i = 0; i < w->k; i++)
	279	gsl_vector_set (w->knots, i, gsl_vector_get (breakpts, 0));
	280
	281	for (i = 1; i < w->l; i++)
	282	{
	283	gsl_vector_set (w->knots, w->k - 1 + i,
	284	gsl_vector_get (breakpts, i));
	285	}
	286
	287	for (i = w->n; i < w->n + w->k; i++)
	288	gsl_vector_set (w->knots, i, gsl_vector_get (breakpts, w->l));
201	289
202	290	return GSL_SUCCESS;
203	291	}
204		} /* gsl_bspline_knots() */
	292	} /* gsl_bspline_knots() */
205	293
206	294	/*
207	295	gsl_bspline_knots_uniform()

227	315	*/
228	316
229	317	int
230		gsl_bspline_knots_uniform(const double a, const double b,
231		gsl_bspline_workspace *w)
232		{
233		size_t i; /* looping */
234		double delta; /* interval spacing */
	318	gsl_bspline_knots_uniform (const double a, const double b,
	319	gsl_bspline_workspace * w)
	320	{
	321	size_t i; /* looping */
	322	double delta; /* interval spacing */
235	323	double x;
236	324
237	325	delta = (b - a) / (double) w->l;
238	326
239		for (i = 0; i < w->k; ++i)
240		gsl_vector_set(w->knots, i, a);
	327	for (i = 0; i < w->k; i++)
	328	gsl_vector_set (w->knots, i, a);
241	329
242	330	x = a + delta;
243		for (i = 0; i < w->l - 1; ++i)
244		{
245		gsl_vector_set(w->knots, w->k + i, x);
	331	for (i = 0; i < w->l - 1; i++)
	332	{
	333	gsl_vector_set (w->knots, w->k + i, x);
246	334	x += delta;
247	335	}
248	336
249		for (i = w->n; i < w->n + w->k; ++i)
250		gsl_vector_set(w->knots, i, b);
	337	for (i = w->n; i < w->n + w->k; i++)
	338	gsl_vector_set (w->knots, i, b);
251	339
252	340	return GSL_SUCCESS;
253		} /* gsl_bspline_knots_uniform() */
	341	} /* gsl_bspline_knots_uniform() */
254	342
255	343	/*
256	344	gsl_bspline_eval()
257	345	Evaluate the basis functions B_i(x) for all i. This is
258		basically a wrapper function for bspline_eval_all()
259		which formats the output in a nice way.
	346	a wrapper function for gsl_bspline_eval_nonzero() which
	347	formats the output in a nice way.
260	348
261	349	Inputs: x - point for evaluation
262	350	B - (output) where to store B_i(x) values

271	359	*/
272	360
273	361	int
274		gsl_bspline_eval(const double x, gsl_vector *B,
275		gsl_bspline_workspace *w)
	362	gsl_bspline_eval (const double x, gsl_vector * B, gsl_bspline_workspace * w)
276	363	{
277	364	if (B->size != w->n)
278	365	{
279		GSL_ERROR("B vector length does not match n", GSL_EBADLEN);
	366	GSL_ERROR ("vector B not of length n", GSL_EBADLEN);
280	367	}
281	368	else
282	369	{
283		size_t i; /* looping */
284		size_t idx = 0;
285		size_t start; /* first non-zero spline */
	370	size_t i; /* looping */
	371	size_t istart; /* first non-zero spline for x */
	372	size_t iend; /* last non-zero spline for x, knot for x */
	373	int error; /* error handling */
286	374
287	375	/* find all non-zero B_i(x) values */
288		bspline_eval_all(x, w->B, &idx, w);
	376	error = gsl_bspline_eval_nonzero (x, w->B, &istart, &iend, w);
	377	if (error)
	378	{
	379	return error;
	380	}
289	381
290	382	/* store values in appropriate part of given vector */
291
292		start = idx - w->k + 1;
293		for (i = 0; i < start; ++i)
294		gsl_vector_set(B, i, 0.0);
295
296		for (i = start; i <= idx; ++i)
297		gsl_vector_set(B, i, gsl_vector_get(w->B, i - start));
298
299		for (i = idx + 1; i < w->n; ++i)
300		gsl_vector_set(B, i, 0.0);
	383	for (i = 0; i < istart; i++)
	384	gsl_vector_set (B, i, 0.0);
	385
	386	for (i = istart; i <= iend; i++)
	387	gsl_vector_set (B, i, gsl_vector_get (w->B, i - istart));
	388
	389	for (i = iend + 1; i < w->n; i++)
	390	gsl_vector_set (B, i, 0.0);
301	391
302	392	return GSL_SUCCESS;
303	393	}
304		} /* gsl_bspline_eval() */
	394	} /* gsl_bspline_eval() */
	395
	396	/*
	397	gsl_bspline_eval_nonzero()
	398	Evaluate all non-zero B-spline functions at point x.
	399	These are the B_i(x) for i in [istart, iend].
	400	Always B_i(x) = 0 for i < istart and for i > iend.
	401
	402	Inputs: x - point at which to evaluate splines
	403	Bk - (output) where to store B-spline values (length k)
	404	istart - (output) B-spline function index of
	405	first non-zero basis for given x
	406	iend - (output) B-spline function index of
	407	last non-zero basis for given x.
	408	This is also the knot index corresponding to x.
	409	w - bspline workspace
	410
	411	Return: success or error
	412
	413	Notes: 1) the w->knots vector must be initialized before calling
	414	this function
	415
	416	2) On output, B contains
	417
	418	[B_{istart,k}, B_{istart+1,k},
	419	..., B_{iend-1,k}, B_{iend,k}]
	420
	421	evaluated at the given x.
	422	*/
	423
	424	int
	425	gsl_bspline_eval_nonzero (const double x, gsl_vector * Bk, size_t * istart,
	426	size_t * iend, gsl_bspline_workspace * w)
	427	{
	428	if (Bk->size != w->k)
	429	{
	430	GSL_ERROR ("Bk vector length does not match order k", GSL_EBADLEN);
	431	}
	432	else
	433	{
	434	size_t i; /* spline index */
	435	size_t j; /* looping */
	436	int flag = 0; /* interval search flag */
	437	int error = 0; /* error flag */
	438
	439	i = bspline_find_interval (x, &flag, w);
	440	error = bspline_process_interval_for_eval (x, &i, flag, w);
	441	if (error)
	442	{
	443	return error;
	444	}
	445
	446	*istart = i - w->k + 1;
	447	*iend = i;
	448
	449	bspline_pppack_bsplvb (w->knots, w->k, 1, x, *iend, &j, w->deltal,
	450	w->deltar, Bk);
	451
	452	return GSL_SUCCESS;
	453	}
	454	} /* gsl_bspline_eval_nonzero() */
	455
	456	/*
	457	gsl_bspline_deriv_eval()
	458	Evaluate d^j/dx^j B_i(x) for all i, 0 <= j <= nderiv.
	459	This is a wrapper function for gsl_bspline_deriv_eval_nonzero()
	460	which formats the output in a nice way.
	461
	462	Inputs: x - point for evaluation
	463	nderiv - number of derivatives to compute, inclusive.
	464	dB - (output) where to store d^j/dx^j B_i(x)
	465	values. the size of this matrix is
	466	(n = nbreak + k - 2 = l + k - 1 = w->n)
	467	by (nderiv + 1)
	468	w - bspline derivative workspace
	469
	470	Return: success or error
	471
	472	Notes: 1) The w->knots vector must be initialized prior to calling
	473	this function (see gsl_bspline_knots())
	474
	475	2) based on PPPACK's bsplvd
	476	*/
	477
	478	int
	479	gsl_bspline_deriv_eval (const double x, const size_t nderiv, gsl_matrix * dB,
	480	gsl_bspline_workspace * w,
	481	gsl_bspline_deriv_workspace * dw)
	482	{
	483	if (dB->size1 != w->n)
	484	{
	485	GSL_ERROR ("dB matrix first dimension not of length n", GSL_EBADLEN);
	486	}
	487	else if (dB->size2 < nderiv + 1)
	488	{
	489	GSL_ERROR
	490	("dB matrix second dimension must be at least length nderiv+1",
	491	GSL_EBADLEN);
	492	}
	493	else if (dw->k < w->k)
	494	{
	495	GSL_ERROR ("derivative workspace is too small", GSL_EBADLEN);
	496	}
	497	else
	498	{
	499	size_t i; /* looping */
	500	size_t j; /* looping */
	501	size_t istart; /* first non-zero spline for x */
	502	size_t iend; /* last non-zero spline for x, knot for x */
	503	int error; /* error handling */
	504
	505	/* find all non-zero d^j/dx^j B_i(x) values */
	506	error =
	507	gsl_bspline_deriv_eval_nonzero (x, nderiv, dw->dB, &istart, &iend, w,
	508	dw);
	509	if (error)
	510	{
	511	return error;
	512	}
	513
	514	/* store values in appropriate part of given matrix */
	515	for (j = 0; j <= nderiv; j++)
	516	{
	517	for (i = 0; i < istart; i++)
	518	gsl_matrix_set (dB, i, j, 0.0);
	519
	520	for (i = istart; i <= iend; i++)
	521	gsl_matrix_set (dB, i, j, gsl_matrix_get (dw->dB, i - istart, j));
	522
	523	for (i = iend + 1; i < w->n; i++)
	524	gsl_matrix_set (dB, i, j, 0.0);
	525	}
	526
	527	return GSL_SUCCESS;
	528	}
	529	} /* gsl_bspline_deriv_eval() */
	530
	531	/*
	532	gsl_bspline_deriv_eval_nonzero()
	533	At point x evaluate all requested, non-zero B-spline function
	534	derivatives and store them in dB. These are the
	535	d^j/dx^j B_i(x) with i in [istart, iend] and j in [0, nderiv].
	536	Always d^j/dx^j B_i(x) = 0 for i < istart and for i > iend.
	537
	538	Inputs: x - point at which to evaluate splines
	539	nderiv - number of derivatives to request, inclusive
	540	dB - (output) where to store dB-spline derivatives
	541	(size k by nderiv + 1)
	542	istart - (output) B-spline function index of
	543	first non-zero basis for given x
	544	iend - (output) B-spline function index of
	545	last non-zero basis for given x.
	546	This is also the knot index corresponding to x.
	547	w - bspline derivative workspace
	548
	549	Return: success or error
	550
	551	Notes: 1) the w->knots vector must be initialized before calling
	552	this function
	553
	554	2) On output, dB contains
	555
	556	[[B_{istart, k}, ..., d^nderiv/dx^nderiv B_{istart ,k}],
	557	[B_{istart+1,k}, ..., d^nderiv/dx^nderiv B_{istart+1,k}],
	558	...
	559	[B_{iend-1, k}, ..., d^nderiv/dx^nderiv B_{iend-1, k}],
	560	[B_{iend, k}, ..., d^nderiv/dx^nderiv B_{iend, k}]]
	561
	562	evaluated at x. B_{istart, k} is stored in dB(0,0).
	563	Each additional column contains an additional derivative.
	564
	565	3) Note that the zero-th column of the result contains the
	566	0th derivative, which is simply a function evaluation.
	567
	568	4) based on PPPACK's bsplvd
	569	*/
	570
	571	int
	572	gsl_bspline_deriv_eval_nonzero (const double x, const size_t nderiv,
	573	gsl_matrix * dB, size_t * istart,
	574	size_t * iend, gsl_bspline_workspace * w,
	575	gsl_bspline_deriv_workspace * dw)
	576	{
	577	if (dB->size1 != w->k)
	578	{
	579	GSL_ERROR ("dB matrix first dimension not of length k", GSL_EBADLEN);
	580	}
	581	else if (dB->size2 < nderiv + 1)
	582	{
	583	GSL_ERROR
	584	("dB matrix second dimension must be at least length nderiv+1",
	585	GSL_EBADLEN);
	586	}
	587	else if (dw->k < w->k)
	588	{
	589	GSL_ERROR ("derivative workspace is too small", GSL_EBADLEN);
	590	}
	591	else
	592	{
	593	size_t i; /* spline index */
	594	size_t j; /* looping */
	595	int flag = 0; /* interval search flag */
	596	int error = 0; /* error flag */
	597	size_t min_nderivk;
	598
	599	i = bspline_find_interval (x, &flag, w);
	600	error = bspline_process_interval_for_eval (x, &i, flag, w);
	601	if (error)
	602	{
	603	return error;
	604	}
	605
	606	*istart = i - w->k + 1;
	607	*iend = i;
	608
	609	bspline_pppack_bsplvd (w->knots, w->k, x, *iend,
	610	w->deltal, w->deltar, dw->A, dB, nderiv);
	611
	612	/* An order k b-spline has at most k-1 nonzero derivatives
	613	so we need to zero all requested higher order derivatives */
	614	min_nderivk = GSL_MIN_INT (nderiv, w->k - 1);
	615	for (j = min_nderivk + 1; j <= nderiv; j++)
	616	{
	617	for (i = 0; i < w->k; i++)
	618	{
	619	gsl_matrix_set (dB, i, j, 0.0);
	620	}
	621	}
	622
	623	return GSL_SUCCESS;
	624	}
	625	} /* gsl_bspline_deriv_eval_nonzero() */
305	626
306	627	/****************************************
307	628	* INTERNAL ROUTINES *
308	629	****************************************/
309	630
310	631	/*
311		bspline_eval_all()
312		Evaluate all non-zero B-splines B_i(x) using algorithm (8)
313		of chapter X of [1]
314
315		The idea is something like this. Given x \in [t_i, t_{i+1}]
316		with t_i < t_{i+1} and the t_i are knots, the values of the
317		B-splines not automatically zero fit into a triangular
318		array as follows:
319		0
320		0
321		0 B_{i-2,3}
322		B_{i-1,2}
323		B_{i,1} B_{i-1,3} ...
324		B_{i,2}
325		0 B_{i,3}
326		0
327		0
328
329		where B_{i,k} is the ith B-spline of order k. The boundary 0s
330		indicate that those B-splines not in the table vanish at x.
331
332		To compute the non-zero B-splines of a given order k, we use
333		Eqs. (4) and (5) of chapter X of [1]:
334
335		(4) B_{i,1}(x) = { 1, t_i <= x < t_{i+1}
336		0, else }
337
338		(5) B_{i,k}(x) = (x - t_i)
339		----------------- B_{i,k-1}(x)
340		(t_{i+k-1} - t_i)
341
342		t_{i+k} - x
343		+ ----------------- B_{i+1,k-1}(x)
344		t_{i+k} - t_{i+1}
345
346		So (4) gives us the first column of the table and we can use
347		the recurrence relation (5) to get the rest of the columns.
348
349		Inputs: x - point at which to evaluate splines
350		B - (output) where to store B-spline values (length k)
351		idx - (output) B-spline function index of last output
352		value (B_{idx}(x) is stored in the last slot of 'B')
353		w - bspline workspace
354
355		Return: success or error
356
357		Notes: 1) the w->knots vector must be initialized before calling
358		this function
359
360		2) On output, B contains:
361
362		B = [B_{i-k+1,k}, B_{i-k+2,k}, ..., B_{i-1,k}, B_{i,k}]
363
364		where 'i' is stored in 'idx' on output
365
366		3) based on PPPACK bsplvb
367		*/
368
369		static int
370		bspline_eval_all(const double x, gsl_vector B, size_t idx,
371		gsl_bspline_workspace *w)
372		{
373		if (B->size != w->k)
374		{
375		GSL_ERROR("B vector not of length k", GSL_EBADLEN);
376		}
377		else
378		{
379		size_t i; /* spline index */
380		size_t j; /* looping */
381		size_t ii; /* looping */
382		int flag = 0; /* error flag */
383		double saved;
384		double term;
385
386		i = bspline_find_interval(x, &flag, w);
387
388		if (flag == -1)
389		{
390		GSL_ERROR("x outside of knot interval", GSL_EINVAL);
391		}
392		else if (flag == 1)
393		{
394		if (x <= gsl_vector_get(w->knots, i) + GSL_DBL_EPSILON)
395		{
396		--i;
397		}
398		else
399		{
400		GSL_ERROR("x outside of knot interval", GSL_EINVAL);
401		}
402		}
403
404		if (gsl_vector_get(w->knots, i) == gsl_vector_get(w->knots, i + 1))
405		{
406		GSL_ERROR("knot(i) = knot(i+1) will result in division by zero",
407		GSL_EINVAL);
408		}
409
410		*idx = i;
411
412		gsl_vector_set(B, 0, 1.0);
413
414		for (j = 0; j < w->k - 1; ++j)
415		{
416		gsl_vector_set(w->deltar, j,
417		gsl_vector_get(w->knots, i + j + 1) - x);
418		gsl_vector_set(w->deltal, j,
419		x - gsl_vector_get(w->knots, i - j));
420
421		saved = 0.0;
422
423		for (ii = 0; ii <= j; ++ii)
424		{
425		term = gsl_vector_get(B, ii) /
426		(gsl_vector_get(w->deltar, ii) +
427		gsl_vector_get(w->deltal, j - ii));
428
429		gsl_vector_set(B, ii,
430		saved +
431		gsl_vector_get(w->deltar, ii) * term);
432
433		saved = gsl_vector_get(w->deltal, j - ii) * term;
434		}
435
436		gsl_vector_set(B, j + 1, saved);
437		}
438
439		return GSL_SUCCESS;
440		}
441		} /* bspline_eval_all() */
442
443		/*
444	632	bspline_find_interval()
445		Find knot interval such that
446
447		t_i <= x < t_{i + 1}
448
	633	Find knot interval such that t_i <= x < t_{i + 1}
449	634	where the t_i are knot values.
450	635
451	636	Inputs: x - x value

456	641
457	642	Notes: The error conditions are reported as follows:
458	643
459		Condition Return value Flag
460		--------- ------------ ----
461		x < t_0 0 -1
462		t_i <= x < t_{i+1} i 0
463		t_i < x = t_{i+1} = t_{n+k-1} i 0
464		t_{n+k-1} < x l+k-1 +1
	644	Condition Return value Flag
	645	--------- ------------ ----
	646	x < t_0 0 -1
	647	t_i <= x < t_{i+1} i 0
	648	t_i < x = t_{i+1} = t_{n+k-1} i 0
	649	t_{n+k-1} < x l+k-1 +1
465	650	*/
466	651
467	652	static inline size_t
468		bspline_find_interval(const double x, int *flag,
469		gsl_bspline_workspace *w)
	653	bspline_find_interval (const double x, int flag, gsl_bspline_workspace w)
470	654	{
471	655	size_t i;
472	656
473		if (x < gsl_vector_get(w->knots, 0))
	657	if (x < gsl_vector_get (w->knots, 0))
474	658	{
475	659	*flag = -1;
476	660	return 0;
477	661	}
478	662
479	663	/* find i such that t_i <= x < t_{i+1} */
480		for (i = w->k - 1; i < w->k + w->l - 1; ++i)
481		{
482		const double ti = gsl_vector_get(w->knots, i);
483		const double tip1 = gsl_vector_get(w->knots, i + 1);
	664	for (i = w->k - 1; i < w->k + w->l - 1; i++)
	665	{
	666	const double ti = gsl_vector_get (w->knots, i);
	667	const double tip1 = gsl_vector_get (w->knots, i + 1);
484	668
485	669	if (tip1 < ti)
486		{
487		GSL_ERROR("knots vector is not increasing", GSL_EINVAL);
488		}
	670	{
	671	GSL_ERROR ("knots vector is not increasing", GSL_EINVAL);
	672	}
489	673
490	674	if (ti <= x && x < tip1)
491		break;
492
493		if (ti < x && x == tip1 &&
494		tip1 == gsl_vector_get(w->knots, w->k + w->l - 1))
495		break;
	675	break;
	676
	677	if (ti < x && x == tip1 && tip1 == gsl_vector_get (w->knots, w->k + w->l
	678	- 1))
	679	break;
496	680	}
497	681
498	682	if (i == w->k + w->l - 1)

501	685	*flag = 0;
502	686
503	687	return i;
504		} /* bspline_find_interval() */
	688	} /* bspline_find_interval() */
	689
	690	/*
	691	bspline_process_interval_for_eval()
	692	Consumes an x location, left knot from bspline_find_interval, flag
	693	from bspline_find_interval, and a workspace. Checks that x lies within
	694	the splines' knots, enforces some endpoint continuity requirements, and
	695	avoids divide by zero errors in the underlying bspline_pppack_* functions.
	696	*/
	697	static inline int
	698	bspline_process_interval_for_eval (const double x, size_t * i, const int flag,
	699	gsl_bspline_workspace * w)
	700	{
	701	if (flag == -1)
	702	{
	703	GSL_ERROR ("x outside of knot interval", GSL_EINVAL);
	704	}
	705	else if (flag == 1)
	706	{
	707	if (x <= gsl_vector_get (w->knots, *i) + GSL_DBL_EPSILON)
	708	{
	709	*i -= 1;
	710	}
	711	else
	712	{
	713	GSL_ERROR ("x outside of knot interval", GSL_EINVAL);
	714	}
	715	}
	716
	717	if (gsl_vector_get (w->knots, i) == gsl_vector_get (w->knots, i + 1))
	718	{
	719	GSL_ERROR ("knot(i) = knot(i+1) will result in division by zero",
	720	GSL_EINVAL);
	721	}
	722
	723	return GSL_SUCCESS;
	724	} /* bspline_process_interval_for_eval */
	725
	726	/********************************************************************
	727	* PPPACK ROUTINES
	728	*
	729	* The routines herein deliberately avoid using the bspline workspace,
	730	* choosing instead to pass all work areas explicitly. This allows
	731	* others to more easily adapt these routines to low memory or
	732	* parallel scenarios.
	733	********************************************************************/
	734
	735	/*
	736	bspline_pppack_bsplvb()
	737	calculates the value of all possibly nonzero b-splines at x of order
	738	jout = max( jhigh , (j+1)*(index-1) ) with knot sequence t.
	739
	740	Parameters:
	741	t - knot sequence, of length left + jout , assumed to be
	742	nondecreasing. assumption t(left).lt.t(left + 1).
	743	division by zero will result if t(left) = t(left+1)
	744	jhigh -
	745	index - integers which determine the order jout = max(jhigh,
	746	(j+1)*(index-1)) of the b-splines whose values at x
	747	are to be returned. index is used to avoid
	748	recalculations when several columns of the triangular
	749	array of b-spline values are needed (e.g., in bsplpp
	750	or in bsplvd ). precisely,
	751
	752	if index = 1 ,
	753	the calculation starts from scratch and the entire
	754	triangular array of b-spline values of orders
	755	1,2,...,jhigh is generated order by order , i.e.,
	756	column by column .
	757
	758	if index = 2 ,
	759	only the b-spline values of order j+1, j+2, ..., jout
	760	are generated, the assumption being that biatx, j,
	761	deltal, deltar are, on entry, as they were on exit
	762	at the previous call.
	763
	764	in particular, if jhigh = 0, then jout = j+1, i.e.,
	765	just the next column of b-spline values is generated.
	766	x - the point at which the b-splines are to be evaluated.
	767	left - an integer chosen (usually) so that
	768	t(left) .le. x .le. t(left+1).
	769	j - (output) a working scalar for indexing
	770	deltal - (output) a working area which must be of length at least jout
	771	deltar - (output) a working area which must be of length at least jout
	772	biatx - (output) array of length jout, with biatx(i)
	773	containing the value at x of the polynomial of order
	774	jout which agrees with the b-spline b(left-jout+i,jout,t)
	775	on the interval (t(left), t(left+1)) .
	776
	777	Method:
	778	the recurrence relation
	779
	780	x - t(i) t(i+j+1) - x
	781	b(i,j+1)(x) = -----------b(i,j)(x) + ---------------b(i+1,j)(x)
	782	t(i+j)-t(i) t(i+j+1)-t(i+1)
	783
	784	is used (repeatedly) to generate the (j+1)-vector b(left-j,j+1)(x),
	785	...,b(left,j+1)(x) from the j-vector b(left-j+1,j)(x),...,
	786	b(left,j)(x), storing the new values in biatx over the old. the
	787	facts that
	788
	789	b(i,1) = 1 if t(i) .le. x .lt. t(i+1)
	790
	791	and that
	792
	793	b(i,j)(x) = 0 unless t(i) .le. x .lt. t(i+j)
	794
	795	are used. the particular organization of the calculations follows
	796	algorithm (8) in chapter x of [1].
	797
	798	Notes:
	799
	800	(1) This is a direct translation of PPPACK's bsplvb routine with
	801	j, deltal, deltar rewritten as input parameters and
	802	utilizing zero-based indexing.
	803
	804	(2) This routine contains no error checking. Please use routines
	805	like gsl_bspline_eval().
	806	*/
	807
	808	static void
	809	bspline_pppack_bsplvb (const gsl_vector * t,
	810	const size_t jhigh,
	811	const size_t index,
	812	const double x,
	813	const size_t left,
	814	size_t * j,
	815	gsl_vector * deltal,
	816	gsl_vector * deltar, gsl_vector * biatx)
	817	{
	818	size_t i; /* looping */
	819	double saved;
	820	double term;
	821
	822	if (index == 1)
	823	{
	824	*j = 0;
	825	gsl_vector_set (biatx, 0, 1.0);
	826	}
	827
	828	for ( /* NOP / ; j < jhigh - 1; *j += 1)
	829	{
	830	gsl_vector_set (deltar, j, gsl_vector_get (t, left + j + 1) - x);
	831	gsl_vector_set (deltal, j, x - gsl_vector_get (t, left - j));
	832
	833	saved = 0.0;
	834
	835	for (i = 0; i <= *j; i++)
	836	{
	837	term = gsl_vector_get (biatx, i) / (gsl_vector_get (deltar, i)
	838	+ gsl_vector_get (deltal,
	839	*j - i));
	840
	841	gsl_vector_set (biatx, i,
	842	saved + gsl_vector_get (deltar, i) * term);
	843
	844	saved = gsl_vector_get (deltal, j - i) term;
	845	}
	846
	847	gsl_vector_set (biatx, *j + 1, saved);
	848	}
	849
	850	return;
	851	} /* gsl_bspline_pppack_bsplvb */
	852
	853	/*
	854	bspline_pppack_bsplvd()
	855	calculates value and derivs of all b-splines which do not vanish at x
	856
	857	Parameters:
	858	t - the knot array, of length left+k (at least)
	859	k - the order of the b-splines to be evaluated
	860	x - the point at which these values are sought
	861	left - an integer indicating the left endpoint of the interval
	862	of interest. the k b-splines whose support contains the
	863	interval (t(left), t(left+1)) are to be considered.
	864	it is assumed that t(left) .lt. t(left+1)
	865	division by zero will result otherwise (in bsplvb).
	866	also, the output is as advertised only if
	867	t(left) .le. x .le. t(left+1) .
	868	deltal - a working area which must be of length at least k
	869	deltar - a working area which must be of length at least k
	870	a - an array of order (k,k), to contain b-coeffs of the
	871	derivatives of a certain order of the k b-splines
	872	of interest.
	873	dbiatx - an array of order (k,nderiv). its entry (i,m) contains
	874	value of (m)th derivative of (left-k+i)-th b-spline
	875	of order k for knot sequence t, i=1,...,k, m=0,...,nderiv.
	876	nderiv - an integer indicating that values of b-splines and
	877	their derivatives up to AND INCLUDING the nderiv-th
	878	are asked for. (nderiv is replaced internally by the
	879	integer mhigh in (1,k) closest to it.)
	880
	881	Method:
	882	values at x of all the relevant b-splines of order k,k-1,..., k+1-nderiv
	883	are generated via bsplvb and stored temporarily in dbiatx. then, the
	884	b-coeffs of the required derivatives of the b-splines of interest are
	885	generated by differencing, each from the preceeding one of lower order,
	886	and combined with the values of b-splines of corresponding order in
	887	dbiatx to produce the desired values .
	888
	889	Notes:
	890
	891	(1) This is a direct translation of PPPACK's bsplvd routine with
	892	deltal, deltar rewritten as input parameters (to later feed them
	893	to bspline_pppack_bsplvb) and utilizing zero-based indexing.
	894
	895	(2) This routine contains no error checking.
	896	*/
	897
	898	static void
	899	bspline_pppack_bsplvd (const gsl_vector * t,
	900	const size_t k,
	901	const double x,
	902	const size_t left,
	903	gsl_vector * deltal,
	904	gsl_vector * deltar,
	905	gsl_matrix * a,
	906	gsl_matrix * dbiatx, const size_t nderiv)
	907	{
	908	int i, ideriv, il, j, jlow, jp1mid, kmm, ldummy, m, mhigh;
	909	double factor, fkmm, sum;
	910
	911	size_t bsplvb_j;
	912	gsl_vector_view dbcol = gsl_matrix_column (dbiatx, 0);
	913
	914	mhigh = GSL_MIN_INT (nderiv, k - 1);
	915	bspline_pppack_bsplvb (t, k - mhigh, 1, x, left, &bsplvb_j, deltal, deltar,
	916	&dbcol.vector);
	917	if (mhigh > 0)
	918	{
	919	/* the first column of dbiatx always contains the b-spline
	920	values for the current order. these are stored in column
	921	k-current order before bsplvb is called to put values
	922	for the next higher order on top of it. */
	923	ideriv = mhigh;
	924	for (m = 1; m <= mhigh; m++)
	925	{
	926	for (j = ideriv, jp1mid = 0; j < (int) k; j++, jp1mid++)
	927	{
	928	gsl_matrix_set (dbiatx, j, ideriv,
	929	gsl_matrix_get (dbiatx, jp1mid, 0));
	930	}
	931	ideriv--;
	932	bspline_pppack_bsplvb (t, k - ideriv, 2, x, left, &bsplvb_j, deltal,
	933	deltar, &dbcol.vector);
	934	}
	935
	936	/* at this point, b(left-k+i, k+1-j)(x) is in dbiatx(i,j)
	937	for i=j,...,k-1 and j=0,...,mhigh. in particular, the
	938	first column of dbiatx is already in final form. to obtain
	939	corresponding derivatives of b-splines in subsequent columns,
	940	generate their b-repr. by differencing, then evaluate at x. */
	941	jlow = 0;
	942	for (i = 0; i < (int) k; i++)
	943	{
	944	for (j = jlow; j < (int) k; j++)
	945	{
	946	gsl_matrix_set (a, j, i, 0.0);
	947	}
	948	jlow = i;
	949	gsl_matrix_set (a, i, i, 1.0);
	950	}
	951
	952	/* at this point, a(.,j) contains the b-coeffs for the j-th of the
	953	k b-splines of interest here. */
	954	for (m = 1; m <= mhigh; m++)
	955	{
	956	kmm = k - m;
	957	fkmm = (float) kmm;
	958	il = left;
	959	i = k - 1;
	960
	961	/* for j=1,...,k, construct b-coeffs of (m)th derivative
	962	of b-splines from those for preceding derivative by
	963	differencing and store again in a(.,j) . the fact that
	964	a(i,j) = 0 for i .lt. j is used. */
	965	for (ldummy = 0; ldummy < kmm; ldummy++)
	966	{
	967	factor =
	968	fkmm / (gsl_vector_get (t, il + kmm) -
	969	gsl_vector_get (t, il));
	970	/* the assumption that t(left).lt.t(left+1) makes
	971	denominator in factor nonzero. */
	972	for (j = 0; j <= i; j++)
	973	{
	974	gsl_matrix_set (a, i, j, factor * (gsl_matrix_get (a, i, j)
	975	- gsl_matrix_get (a,
	976	i - 1,
	977	j)));
	978	}
	979	il--;
	980	i--;
	981	}
	982
	983	/* for i=1,...,k, combine b-coeffs a(.,i) with b-spline values
	984	stored in dbiatx(.,m) to get value of (m)th derivative
	985	of i-th b-spline (of interest here) at x, and store in
	986	dbiatx(i,m). storage of this value over the value of a
	987	b-spline of order m there is safe since the remaining
	988	b-spline derivatives of the same order do not use this
	989	value due to the fact that a(j,i) = 0 for j .lt. i . */
	990	for (i = 0; i < (int) k; i++)
	991	{
	992	sum = 0;
	993	jlow = GSL_MAX_INT (i, m);
	994	for (j = jlow; j < (int) k; j++)
	995	{
	996	sum +=
	997	gsl_matrix_get (a, j, i) * gsl_matrix_get (dbiatx, j, m);
	998	}
	999	gsl_matrix_set (dbiatx, i, m, sum);
	1000	}
	1001	}
	1002	}
	1003
	1004	return;
	1005
	1006	} /* bspline_pppack_bsplvd */

+26

-0

bspline/bspline.h less more

	0	static inline size_t
	1	bspline_find_interval (const double x, int flag, gsl_bspline_workspace w);
	2
	3	static inline int
	4	bspline_process_interval_for_eval (const double x, size_t * i, int flag,
	5	gsl_bspline_workspace * w);
	6
	7	static void
	8	bspline_pppack_bsplvb (const gsl_vector * t,
	9	const size_t jhigh,
	10	const size_t index,
	11	const double x,
	12	const size_t left,
	13	size_t * j,
	14	gsl_vector * deltal,
	15	gsl_vector * deltar, gsl_vector * biatx);
	16
	17	static void
	18	bspline_pppack_bsplvd (const gsl_vector * t,
	19	const size_t k,
	20	const double x,
	21	const size_t left,
	22	gsl_vector * deltal,
	23	gsl_vector * deltar,
	24	gsl_matrix * a,
	25	gsl_matrix * dbiatx, const size_t nderiv);

+56

-18

bspline/gsl_bspline.h less more

0	0	/* bspline/gsl_bspline.h
1		*
	1	*
2	2	* Copyright (C) 2006 Patrick Alken
3		*
	3	* Copyright (C) 2008 Rhys Ulerich
	4	*
4	5	* This program is free software; you can redistribute it and/or modify
5	6	* it under the terms of the GNU General Public License as published by
6	7	* the Free Software Foundation; either version 3 of the License, or (at
7	8	* your option) any later version.
8		*
	9	*
9	10	* This program is distributed in the hope that it will be useful, but
10	11	* WITHOUT ANY WARRANTY; without even the implied warranty of
11	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12	13	* General Public License for more details.
13		*
	14	*
14	15	* You should have received a copy of the GNU General Public License
15	16	* along with this program; if not, write to the Free Software
16	17	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

22	23	#include <stdlib.h>
23	24	#include <gsl/gsl_math.h>
24	25	#include <gsl/gsl_vector.h>
	26	#include <gsl/gsl_matrix.h>
25	27
26	28	#undef __BEGIN_DECLS
27	29	#undef __END_DECLS

37	39
38	40	typedef struct
39	41	{
40		size_t k; /* spline order */
41		size_t km1; /* k - 1 (polynomial order) */
42		size_t l; /* number of polynomial pieces on interval */
43		size_t nbreak; /* number of breakpoints (l + 1) */
44		size_t n; /* number of bspline basis functions (l + k - 1) */
	42	size_t k; /* spline order */
	43	size_t km1; /* k - 1 (polynomial order) */
	44	size_t l; /* number of polynomial pieces on interval */
	45	size_t nbreak; /* number of breakpoints (l + 1) */
	46	size_t n; /* number of bspline basis functions (l + k - 1) */
45	47
46		gsl_vector knots; / knots vector */
47		gsl_vector deltal; / left delta */
48		gsl_vector deltar; / right delta */
49		gsl_vector B; / temporary spline results */
	48	gsl_vector knots; / knots vector */
	49	gsl_vector deltal; / left delta */
	50	gsl_vector deltar; / right delta */
	51	gsl_vector B; / temporary spline results */
50	52	} gsl_bspline_workspace;
	53
	54	typedef struct
	55	{
	56	size_t k; /* spline order */
	57	gsl_matrix A; / work matrix */
	58	gsl_matrix dB; / temporary derivative results */
	59	} gsl_bspline_deriv_workspace;
51	60
52	61	gsl_bspline_workspace *
53	62	gsl_bspline_alloc(const size_t k, const size_t nbreak);
54	63
55	64	void gsl_bspline_free(gsl_bspline_workspace *w);
56	65
57		size_t gsl_bspline_ncoeffs (gsl_bspline_workspace * w);
58		size_t gsl_bspline_order (gsl_bspline_workspace * w);
59		size_t gsl_bspline_nbreak (gsl_bspline_workspace * w);
60		double gsl_bspline_breakpoint (size_t i, gsl_bspline_workspace * w);
	66	size_t gsl_bspline_ncoeffs(gsl_bspline_workspace * w);
	67	size_t gsl_bspline_order(gsl_bspline_workspace * w);
	68	size_t gsl_bspline_nbreak(gsl_bspline_workspace * w);
	69	double gsl_bspline_breakpoint(size_t i, gsl_bspline_workspace * w);
61	70
62	71	int
63	72	gsl_bspline_knots(const gsl_vector breakpts, gsl_bspline_workspace w);

66	75	gsl_bspline_workspace *w);
67	76
68	77	int
69		gsl_bspline_eval(const double x, gsl_vector *B,
	78	gsl_bspline_eval(const double x, gsl_vector *B,
70	79	gsl_bspline_workspace *w);
	80
	81	int
	82	gsl_bspline_eval_nonzero(const double x,
	83	gsl_vector *Bk,
	84	size_t *istart,
	85	size_t *iend,
	86	gsl_bspline_workspace *w);
	87
	88	gsl_bspline_deriv_workspace *
	89	gsl_bspline_deriv_alloc(const size_t k);
	90
	91	void
	92	gsl_bspline_deriv_free(gsl_bspline_deriv_workspace *w);
	93
	94	int
	95	gsl_bspline_deriv_eval(const double x,
	96	const size_t nderiv,
	97	gsl_matrix *dB,
	98	gsl_bspline_workspace *w,
	99	gsl_bspline_deriv_workspace *dw);
	100
	101	int
	102	gsl_bspline_deriv_eval_nonzero(const double x,
	103	const size_t nderiv,
	104	gsl_matrix *dB,
	105	size_t *istart,
	106	size_t *iend,
	107	gsl_bspline_workspace *w,
	108	gsl_bspline_deriv_workspace *dw);
71	109
72	110	__END_DECLS
73	111

+204

-44

bspline/test.c less more

0	0	/* bspline/test.c
1		*
	1	*
2	2	* Copyright (C) 2006, 2007 Brian Gough
3		*
	3	* Copyright (C) 2008 Rhys Ulerich
	4	*
4	5	* This program is free software; you can redistribute it and/or modify
5	6	* it under the terms of the GNU General Public License as published by
6	7	* the Free Software Foundation; either version 3 of the License, or (at
7	8	* your option) any later version.
8		*
	9	*
9	10	* This program is distributed in the hope that it will be useful, but
10	11	* WITHOUT ANY WARRANTY; without even the implied warranty of
11	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12	13	* General Public License for more details.
13		*
	14	*
14	15	* You should have received a copy of the GNU General Public License
15	16	* along with this program; if not, write to the Free Software
16	17	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

21	22	#include <gsl/gsl_errno.h>
22	23	#include <gsl/gsl_bspline.h>
23	24	#include <gsl/gsl_ieee_utils.h>
	25	#include <gsl/gsl_nan.h>
24	26
25	27	void
26		test_bspline (gsl_bspline_workspace * bw)
	28	test_bspline(gsl_bspline_workspace * bw, gsl_bspline_deriv_workspace * dbw)
27	29	{
28	30	gsl_vector *B;
	31	gsl_matrix *dB;
29	32	size_t i, j;
30	33	size_t n = 100;
31		size_t ncoeffs = gsl_bspline_ncoeffs (bw);
32		size_t order = gsl_bspline_order (bw);
33		size_t nbreak = gsl_bspline_nbreak (bw);
34		double a = gsl_bspline_breakpoint (0, bw);
35		double b = gsl_bspline_breakpoint (nbreak - 1, bw);
36
37		B = gsl_vector_alloc (ncoeffs);
38
	34	size_t ncoeffs = gsl_bspline_ncoeffs(bw);
	35	size_t order = gsl_bspline_order(bw);
	36	size_t nbreak = gsl_bspline_nbreak(bw);
	37	double a = gsl_bspline_breakpoint(0, bw);
	38	double b = gsl_bspline_breakpoint(nbreak - 1, bw);
	39
	40	B = gsl_vector_alloc(ncoeffs);
	41	dB = gsl_matrix_alloc(ncoeffs, 1);
	42
	43	/* Ensure B-splines form a partition of unity */
39	44	for (i = 0; i < n; i++)
40	45	{
41	46	double xi = a + (b - a) * (i / (n - 1.0));
42	47	double sum = 0;
43		gsl_bspline_eval (xi, B, bw);
	48	gsl_bspline_eval(xi, B, bw);
44	49
45	50	for (j = 0; j < ncoeffs; j++)
46	51	{
47		double Bj = gsl_vector_get (B, j);
	52	double Bj = gsl_vector_get(B, j);
48	53	int s = (Bj < 0 \|\| Bj > 1);
49		gsl_test (s,
50		"basis-spline coefficient %u is in range [0,1] for x=%g",
51		j, xi);
	54	gsl_test(s,
	55	"basis-spline coefficient %u is in range [0,1] for x=%g",
	56	j, xi);
52	57	sum += Bj;
53	58	}
54	59
55		gsl_test_rel (sum, 1.0, order * GSL_DBL_EPSILON,
56		"basis-spline order %u is normalized for x=%g", order,
57		xi);
58		}
59
60		gsl_vector_free (B);
	60	gsl_test_rel(sum, 1.0, order * GSL_DBL_EPSILON,
	61	"basis-spline order %u is normalized for x=%g", order,
	62	xi);
	63	}
	64
	65	/* Ensure B-splines 0th derivatives agree with regular evaluation */
	66	for (i = 0; i < n; i++)
	67	{
	68	double xi = a + (b - a) * (i / (n - 1.0));
	69	gsl_bspline_eval(xi, B, bw);
	70	gsl_bspline_deriv_eval(xi, 0, dB, bw, dbw);
	71
	72	for (j = 0; j < ncoeffs; j++)
	73	{
	74	gsl_test_abs(gsl_matrix_get(dB, j, 0), gsl_vector_get(B, j),
	75	GSL_DBL_EPSILON,
	76	"b-spline order %d basis #%d evaluation and 0th derivative consistent for x=%g",
	77	order, j, xi);
	78	}
	79
	80	}
	81
	82	gsl_vector_free(B);
	83	gsl_matrix_free(dB);
61	84	}
62	85
63
64
65	86	int
66		main (int argc, char **argv)
	87	main(int argc, char **argv)
67	88	{
68	89	size_t order, breakpoints, i;
69	90
70		gsl_ieee_env_setup ();
	91	gsl_ieee_env_setup();
71	92
72	93	argc = 0; /* prevent warnings about unused parameters */
73	94	argv = 0;

77	98	for (breakpoints = 2; breakpoints < 100; breakpoints++)
78	99	{
79	100	double a = -1.23 * order, b = 45.6 * order;
80		gsl_bspline_workspace *bw = gsl_bspline_alloc (order, breakpoints);
81		gsl_bspline_knots_uniform (a, b, bw);
82		test_bspline (bw);
83		gsl_bspline_free (bw);
	101	gsl_bspline_workspace *bw = gsl_bspline_alloc(order, breakpoints);
	102	gsl_bspline_deriv_workspace *dbw = gsl_bspline_deriv_alloc(order);
	103	gsl_bspline_knots_uniform(a, b, bw);
	104	test_bspline(bw, dbw);
	105	gsl_bspline_deriv_free(dbw);
	106	gsl_bspline_free(bw);
84	107	}
85	108	}
86	109

90	113	for (breakpoints = 2; breakpoints < 100; breakpoints++)
91	114	{
92	115	double a = -1.23 * order, b = 45.6 * order;
93		gsl_bspline_workspace *bw = gsl_bspline_alloc (order, breakpoints);
94		gsl_vector *k = gsl_vector_alloc (breakpoints);
	116	gsl_bspline_workspace *bw = gsl_bspline_alloc(order, breakpoints);
	117	gsl_bspline_deriv_workspace *dbw = gsl_bspline_deriv_alloc(order);
	118	gsl_vector *k = gsl_vector_alloc(breakpoints);
95	119	for (i = 0; i < breakpoints; i++)
96	120	{
97	121	double f, x;
98		f = sqrt (i / (breakpoints - 1.0));
	122	f = sqrt(i / (breakpoints - 1.0));
99	123	x = (1 - f) * a + f * b;
100		gsl_vector_set (k, i, x);
	124	gsl_vector_set(k, i, x);
101	125	};
102		gsl_bspline_knots (k, bw);
103		test_bspline (bw);
104		gsl_vector_free (k);
105		gsl_bspline_free (bw);
106		}
107		}
108
109		exit (gsl_test_summary ());
	126	gsl_bspline_knots(k, bw);
	127	test_bspline(bw, dbw);
	128	gsl_vector_free(k);
	129	gsl_bspline_deriv_free(dbw);
	130	gsl_bspline_free(bw);
	131	}
	132	}
	133
	134	/* Spot check known 0th, 1st, 2nd derivative
	135	evaluations for a particular k = 2 case. */
	136	{
	137	size_t i, j; /* looping */
	138
	139	const double xloc[4] = { 0.0, 1.0, 6.0, 7.0};
	140	const double deriv[4][3] =
	141	{
	142	{ -1.0/2.0, 1.0/2.0, 0.0 },
	143	{ -1.0/2.0, 1.0/2.0, 0.0 },
	144	{ 0.0, -1.0/5.0, 1.0/5.0 },
	145	{ 0.0, -1.0/5.0, 1.0/5.0 }
	146	};
	147
	148	gsl_bspline_workspace *bw = gsl_bspline_alloc(2, 3);
	149	gsl_bspline_deriv_workspace *dbw = gsl_bspline_deriv_alloc(2);
	150	gsl_matrix *dB = gsl_matrix_alloc(gsl_bspline_ncoeffs(bw),
	151	gsl_bspline_order(bw) + 1);
	152
	153	gsl_vector *breakpts = gsl_vector_alloc(3);
	154	gsl_vector_set(breakpts, 0, 0.0);
	155	gsl_vector_set(breakpts, 1, 2.0);
	156	gsl_vector_set(breakpts, 2, 7.0);
	157	gsl_bspline_knots(breakpts, bw);
	158
	159
	160	for (i = 0; i < 4; ++i) /* at each location */
	161	{
	162	/* Initialize dB with poison to ensure we overwrite it */
	163	gsl_matrix_set_all(dB, GSL_NAN);
	164
	165	gsl_bspline_deriv_eval(xloc[i], gsl_bspline_order(bw), dB, bw, dbw);
	166	for (j = 0; j < gsl_bspline_ncoeffs(bw) ; ++j)
	167	{
	168	/* check basis function 1st deriv */
	169	gsl_test_abs(gsl_matrix_get(dB, j, 1), deriv[i][j], GSL_DBL_EPSILON,
	170	"b-spline k=%d basis #%d derivative %d at x = %f",
	171	gsl_bspline_order(bw), j, 1, xloc[i]);
	172	}
	173	for (j = 0; j < gsl_bspline_ncoeffs(bw); ++j)
	174	{
	175	/* check k order basis function has k-th deriv equal to 0 */
	176	gsl_test_abs(gsl_matrix_get(dB, j, gsl_bspline_order(bw)), 0.0,
	177	GSL_DBL_EPSILON,
	178	"b-spline k=%d basis #%d derivative %d at x = %f",
	179	gsl_bspline_order(bw), j, gsl_bspline_order(bw),
	180	xloc[i]);
	181	}
	182	}
	183
	184	gsl_matrix_free(dB);
	185	gsl_bspline_deriv_free(dbw);
	186	gsl_bspline_free(bw);
	187	gsl_vector_free(breakpts);
	188	}
	189
	190	/* Spot check known 0th, 1st, 2nd derivative
	191	evaluations for a particular k = 3 case. */
	192	{
	193	size_t i, j; /* looping */
	194	const double xloc[5] = { 0.0, 5.0, 9.0, 12.0, 15.0 };
	195	const double eval[5][6] =
	196	{
	197	{ 4./25., 69./100., 3./ 20. , 0. , 0. , 0. },
	198	{ 0. , 4./21. , 143./210. , 9./70., 0. , 0. },
	199	{ 0. , 0. , 3./ 10. , 7./10., 0. , 0. },
	200	{ 0. , 0. , 0. , 3./4. , 1./4., 0. },
	201	{ 0. , 0. , 0. , 1./3. , 5./9., 1./9. }
	202	};
	203	const double deriv[5][6] =
	204	{
	205	{ -4./25., 3./50., 1./ 10., 0. , 0. , 0. },
	206	{ 0. , -2./21., 1./105., 3./35., 0. , 0. },
	207	{ 0. , 0. , -1./5. , 1./ 5., 0. , 0. },
	208	{ 0. , 0. , 0. , -1./ 6., 1./6. , 0. },
	209	{ 0. , 0. , 0. , -1./ 9., 1./27., 2./27. }
	210	};
	211	const double deriv2[5][6] =
	212	{
	213	{ 2./25., -17./150., 1.0/30.0 , 0.0 , 0. , 0. },
	214	{ 0. , 1./ 42., -11.0/210.0, 1.0/35.0, 0. , 0. },
	215	{ 0. , 0. , 1.0/15.0 ,-11.0/90.0, 1./18. , 0. },
	216	{ 0. , 0. , 0.0 , 1.0/54.0, -7./162., 2./81. },
	217	{ 0. , 0. , 0.0 , 1.0/54.0, -7./162., 2./81. }
	218	};
	219
	220	gsl_bspline_workspace *bw = gsl_bspline_alloc(3, 5);
	221	gsl_bspline_deriv_workspace *dbw = gsl_bspline_deriv_alloc(3);
	222
	223	gsl_matrix *dB = gsl_matrix_alloc(gsl_bspline_ncoeffs(bw),
	224	gsl_bspline_order(bw) + 1);
	225
	226	gsl_vector *breakpts = gsl_vector_alloc(5);
	227	gsl_vector_set(breakpts, 0, -3.0);
	228	gsl_vector_set(breakpts, 1, 2.0);
	229	gsl_vector_set(breakpts, 2, 9.0);
	230	gsl_vector_set(breakpts, 3, 12.0);
	231	gsl_vector_set(breakpts, 4, 21.0);
	232	gsl_bspline_knots(breakpts, bw);
	233
	234	for (i = 0; i < 5; ++i) /* at each location */
	235	{
	236	/* Initialize dB with poison to ensure we overwrite it */
	237	gsl_matrix_set_all(dB, GSL_NAN);
	238	gsl_bspline_deriv_eval(xloc[i], gsl_bspline_order(bw), dB, bw, dbw);
	239
	240	/* check basis function evaluation */
	241	for (j = 0; j < gsl_bspline_ncoeffs(bw); ++j)
	242	{
	243	gsl_test_abs(gsl_matrix_get(dB, j, 0), eval[i][j], GSL_DBL_EPSILON,
	244	"b-spline k=%d basis #%d derivative %d at x = %f",
	245	gsl_bspline_order(bw), j, 0, xloc[i]);
	246	}
	247	/* check 1st derivative evaluation */
	248	for (j = 0; j < gsl_bspline_ncoeffs(bw); ++j)
	249	{
	250	gsl_test_abs(gsl_matrix_get(dB, j, 1), deriv[i][j], GSL_DBL_EPSILON,
	251	"b-spline k=%d basis #%d derivative %d at x = %f",
	252	gsl_bspline_order(bw), j, 1, xloc[i]);
	253	}
	254	/* check 2nd derivative evaluation */
	255	for (j = 0; j < gsl_bspline_ncoeffs(bw); ++j)
	256	{
	257	gsl_test_abs(gsl_matrix_get(dB, j, 2), deriv2[i][j], GSL_DBL_EPSILON,
	258	"b-spline k=%d basis #%d derivative %d at x = %f",
	259	gsl_bspline_order(bw), j, 2, xloc[i]);
	260	}
	261	}
	262
	263	gsl_matrix_free(dB);
	264	gsl_bspline_deriv_free(dbw);
	265	gsl_bspline_free(bw);
	266	gsl_vector_free(breakpts);
	267	}
	268
	269	exit(gsl_test_summary());
110	270	}

+37

-0

build.h less more

	0	/* Compile subsequent inline functions as static functions */
	1
	2	#ifdef __GSL_BUILD_H__
	3	#error build.h must not be included multiple times
	4	#endif
	5
	6	#define __GSL_BUILD_H__
	7
	8	#ifdef COMPILE_INLINE_STATIC
	9	#ifndef HIDE_INLINE_STATIC /* skip if inline functions are hidden */
	10
	11	#undef __GSL_INLINE_H__
	12	#define __GSL_INLINE_H__ /* first, ignore the gsl_inline.h header file */
	13
	14	#undef INLINE_DECL
	15	#define INLINE_DECL /* disable inline in declarations */
	16
	17	#undef INLINE_FUN
	18	#define INLINE_FUN /* disable inline in definitions */
	19
	20	#ifndef HAVE_INLINE /* enable compilation of definitions in .h files */
	21	#define HAVE_INLINE
	22	#endif
	23
	24	/* Compile range checking code for inline functions used in the library */
	25	#undef GSL_RANGE_CHECK
	26	#define GSL_RANGE_CHECK 1
	27
	28	/* Use the global variable gsl_check_range to enable/disable range checking at
	29	runtime */
	30	#undef GSL_RANGE_COND
	31	#define GSL_RANGE_COND(x) (gsl_check_range && (x))
	32
	33	#endif
	34	#else
	35	#error must be called with COMPILE_INLINE_STATIC
	36	#endif

+1

-1

cblas/Makefile.am less more

7	7
8	8	pkginclude_HEADERS = gsl_cblas.h
9	9
10		INCLUDES= -I$(top_srcdir)
	10	INCLUDES = -I$(top_srcdir)
11	11
12	12	libgslcblas_la_SOURCES = sasum.c saxpy.c scasum.c scnrm2.c scopy.c sdot.c sdsdot.c sgbmv.c sgemm.c sgemv.c sger.c snrm2.c srot.c srotg.c srotm.c srotmg.c ssbmv.c sscal.c sspmv.c sspr.c sspr2.c sswap.c ssymm.c ssymv.c ssyr.c ssyr2.c ssyr2k.c ssyrk.c stbmv.c stbsv.c stpmv.c stpsv.c strmm.c strmv.c strsm.c strsv.c dasum.c daxpy.c dcopy.c ddot.c dgbmv.c dgemm.c dgemv.c dger.c dnrm2.c drot.c drotg.c drotm.c drotmg.c dsbmv.c dscal.c dsdot.c dspmv.c dspr.c dspr2.c dswap.c dsymm.c dsymv.c dsyr.c dsyr2.c dsyr2k.c dsyrk.c dtbmv.c dtbsv.c dtpmv.c dtpsv.c dtrmm.c dtrmv.c dtrsm.c dtrsv.c dzasum.c dznrm2.c caxpy.c ccopy.c cdotc_sub.c cdotu_sub.c cgbmv.c cgemm.c cgemv.c cgerc.c cgeru.c chbmv.c chemm.c chemv.c cher.c cher2.c cher2k.c cherk.c chpmv.c chpr.c chpr2.c cscal.c csscal.c cswap.c csymm.c csyr2k.c csyrk.c ctbmv.c ctbsv.c ctpmv.c ctpsv.c ctrmm.c ctrmv.c ctrsm.c ctrsv.c zaxpy.c zcopy.c zdotc_sub.c zdotu_sub.c zdscal.c zgbmv.c zgemm.c zgemv.c zgerc.c zgeru.c zhbmv.c zhemm.c zhemv.c zher.c zher2.c zher2k.c zherk.c zhpmv.c zhpr.c zhpr2.c zscal.c zswap.c zsymm.c zsyr2k.c zsyrk.c ztbmv.c ztbsv.c ztpmv.c ztpsv.c ztrmm.c ztrmv.c ztrsm.c ztrsv.c icamax.c idamax.c isamax.c izamax.c xerbla.c
13	13

+4

-0

cblas/Makefile.in less more

171	171	LIBOBJS = @LIBOBJS@
172	172	LIBS = @LIBS@
173	173	LIBTOOL = @LIBTOOL@
	174	LIPO = @LIPO@
174	175	LN_S = @LN_S@
175	176	LTLIBOBJS = @LTLIBOBJS@
176	177	MAINT = @MAINT@

178	179	MKDIR_P = @MKDIR_P@
179	180	NM = @NM@
180	181	NMEDIT = @NMEDIT@
	182	OBJDUMP = @OBJDUMP@
181	183	OBJEXT = @OBJEXT@
	184	OTOOL = @OTOOL@
	185	OTOOL64 = @OTOOL64@
182	186	PACKAGE = @PACKAGE@
183	187	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
184	188	PACKAGE_NAME = @PACKAGE_NAME@

+16

-0

cdf/ChangeLog less more

	0	2008-12-03 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* gammainv.c (gsl_cdf_gamma_Pinv): keep iterating if P is still
	3	changing (fix for bug 24704)
	4
	5	* test.c (test_chisqinv): added test cases for bug 24704
	6
	7	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	8
	9	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	10
	11	2008-04-29 Brian Gough <bjg@network-theory.co.uk>
	12
	13	* gammainv.c (gsl_cdf_gamma_Pinv, gsl_cdf_gamma_Qinv): restrict
	14	the range of the gaussian approximation
	15
0	16	2008-02-20 Brian Gough <bjg@network-theory.co.uk>
1	17
2	18	* beta_inc.c (beta_inc_AXPY): add some handling for large

+1

-1

cdf/Makefile.am less more

2	2
3	3	pkginclude_HEADERS= gsl_cdf.h
4	4
5		INCLUDES= -I$(top_builddir)
	5	INCLUDES = -I$(top_srcdir)
6	6
7	7	libgslcdf_la_SOURCES = beta.c betainv.c cauchy.c cauchyinv.c chisq.c chisqinv.c exponential.c exponentialinv.c exppow.c fdist.c fdistinv.c flat.c flatinv.c gamma.c gammainv.c gauss.c gaussinv.c gumbel1.c gumbel1inv.c gumbel2.c gumbel2inv.c laplace.c laplaceinv.c logistic.c logisticinv.c lognormal.c lognormalinv.c pareto.c paretoinv.c rayleigh.c rayleighinv.c tdist.c tdistinv.c weibull.c weibullinv.c binomial.c poisson.c geometric.c nbinomial.c pascal.c hypergeometric.c
8	8

+5

-1

cdf/Makefile.in less more

141	141	LIBOBJS = @LIBOBJS@
142	142	LIBS = @LIBS@
143	143	LIBTOOL = @LIBTOOL@
	144	LIPO = @LIPO@
144	145	LN_S = @LN_S@
145	146	LTLIBOBJS = @LTLIBOBJS@
146	147	MAINT = @MAINT@

148	149	MKDIR_P = @MKDIR_P@
149	150	NM = @NM@
150	151	NMEDIT = @NMEDIT@
	152	OBJDUMP = @OBJDUMP@
151	153	OBJEXT = @OBJEXT@
	154	OTOOL = @OTOOL@
	155	OTOOL64 = @OTOOL64@
152	156	PACKAGE = @PACKAGE@
153	157	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
154	158	PACKAGE_NAME = @PACKAGE_NAME@

213	217	top_srcdir = @top_srcdir@
214	218	noinst_LTLIBRARIES = libgslcdf.la
215	219	pkginclude_HEADERS = gsl_cdf.h
216		INCLUDES = -I$(top_builddir)
	220	INCLUDES = -I$(top_srcdir)
217	221	libgslcdf_la_SOURCES = beta.c betainv.c cauchy.c cauchyinv.c chisq.c chisqinv.c exponential.c exponentialinv.c exppow.c fdist.c fdistinv.c flat.c flatinv.c gamma.c gammainv.c gauss.c gaussinv.c gumbel1.c gumbel1inv.c gumbel2.c gumbel2inv.c laplace.c laplaceinv.c logistic.c logisticinv.c lognormal.c lognormalinv.c pareto.c paretoinv.c rayleigh.c rayleighinv.c tdist.c tdistinv.c weibull.c weibullinv.c binomial.c poisson.c geometric.c nbinomial.c pascal.c hypergeometric.c
218	222	noinst_HEADERS = beta_inc.c rat_eval.h test_auto.c error.h
219	223	TESTS = $(check_PROGRAMS)

+12

-6

cdf/gammainv.c less more

41	41
42	42	/* Consider, small, large and intermediate cases separately. The
43	43	boundaries at 0.05 and 0.95 have not been optimised, but seem ok
44		for an initial approximation. */
	44	for an initial approximation.
	45
	46	BJG: These approximations aren't really valid, the relevant
	47	criterion is P*gamma(a+1) < 1. Need to rework these routines and
	48	use a single bisection style solver for all the inverse
	49	functions.
	50	*/
45	51
46	52	if (P < 0.05)
47	53	{

56	62	else
57	63	{
58	64	double xg = gsl_cdf_ugaussian_Pinv (P);
59		double x0 = (xg < -sqrt (a)) ? a : sqrt (a) * xg + a;
	65	double x0 = (xg < -0.5sqrt (a)) ? a : sqrt (a) xg + a;
60	66	x = x0;
61	67	}
62	68

84	90	double step1 = -((a - 1) / x - 1) * lambda * lambda / 4.0;
85	91
86	92	double step = step0;
87		if (fabs (step1) < fabs (step0))
	93	if (fabs (step1) < 0.5 * fabs (step0))
88	94	step += step1;
89	95
90	96	if (x + step > 0)

94	100	x /= 2.0;
95	101	}
96	102
97		if (fabs (step0) > 1e-10 * x)
	103	if (fabs (step0) > 1e-10 * x \|\| fabs(step0 * phi) > 1e-10 * P)
98	104	goto start;
99	105	}
100	106

139	145	else
140	146	{
141	147	double xg = gsl_cdf_ugaussian_Qinv (Q);
142		double x0 = (xg < -sqrt (a)) ? a : sqrt (a) * xg + a;
	148	double x0 = (xg < -0.5sqrt (a)) ? a : sqrt (a) xg + a;
143	149	x = x0;
144	150	}
145	151

167	173	double step1 = -((a - 1) / x - 1) * lambda * lambda / 4.0;
168	174
169	175	double step = step0;
170		if (fabs (step1) < fabs (step0))
	176	if (fabs (step1) < 0.5 * fabs (step0))
171	177	step += step1;
172	178
173	179	if (x + step > 0)

+7

-0

cdf/test.c less more

1241	1241	TEST (gsl_cdf_chisq_Pinv, (9.99999999999998341e-1, 13.0), 100.0, 0.01);
1242	1242	TEST (gsl_cdf_chisq_Pinv, (1e0, 13.0), GSL_POSINF, 0.0);
1243	1243
	1244	TEST (gsl_cdf_chisq_Pinv, (1.93238145206123590e-01, 1.5), 0.211980092931799521729407, TEST_TOL6);
	1245	TEST (gsl_cdf_chisq_Pinv, (4.83e-8, 19.19), 1.632280186860266704532868343, TEST_TOL6);
	1246
	1247	/* Test cases for bug 24704 */
	1248	TEST (gsl_cdf_chisq_Pinv, (0.05, 1263131.0), 1260517.771133388726131469059, TEST_TOL6);
	1249	TEST (gsl_cdf_chisq_Pinv, (0.05, 2526262.0), 2522565.864973351096735720202, TEST_TOL6);
	1250
1244	1251	TEST (gsl_cdf_chisq_Qinv, (0.0, 13.0), GSL_POSINF, TEST_TOL6);
1245	1252	TEST (gsl_cdf_chisq_Qinv, (1.65902608070858809e-15, 13.0), 100.0, TEST_TOL6);
1246	1253	TEST (gsl_cdf_chisq_Qinv, (9.52102560780915127e-2, 13.0), 20.0, TEST_TOL6);

+11

-0

cheb/ChangeLog less more

	0	2008-11-18 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* gsl_chebyshev.h: added auxiliary functions
	3
	4	* init.c (gsl_cheb_order, gsl_cheb_size, gsl_cheb_coeffs): added
	5	auxiliary functions
	6
	7	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	8
	9	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	10
0	11	2007-01-29 Brian Gough <bjg@network-theory.co.uk>
1	12
2	13	* eval.c (gsl_cheb_eval_mode_e): compute error consistently with

+1

-1

cheb/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_chebyshev.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslcheb_la_SOURCES = deriv.c eval.c init.c integ.c
7	7

+5

-1

cheb/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

203	207	top_srcdir = @top_srcdir@
204	208	noinst_LTLIBRARIES = libgslcheb.la
205	209	pkginclude_HEADERS = gsl_chebyshev.h
206		INCLUDES = -I$(top_builddir)
	210	INCLUDES = -I$(top_srcdir)
207	211	libgslcheb_la_SOURCES = deriv.c eval.c init.c integ.c
208	212	TESTS = $(check_PROGRAMS)
209	213	test_LDADD = libgslcheb.la ../ieee-utils/libgslieeeutils.la ../test/libgsltest.la ../sys/libgslsys.la ../err/libgslerr.la ../utils/libutils.la

+2

-3

cheb/deriv.c less more

38	38	deriv->a = f->a;
39	39	deriv->b = f->b;
40	40
41		#ifdef ERR
42		deriv->err = n * n * f->c[n-1]; /* error in derivative is n^2 c_n */
43		#endif
	41	/* error in derivative is n^2 c_n */
	42	/* deriv->err = n * n * f->c[n-1];*/
44	43
45	44	/* FIXME: should probably set deriv->f[] as well */
46	45

+4

-0

cheb/gsl_chebyshev.h less more

81	81	int gsl_cheb_init(gsl_cheb_series * cs, const gsl_function * func,
82	82	const double a, const double b);
83	83
	84	/* Return the order, size of coefficient array and coefficient array ptr */
	85	size_t gsl_cheb_order (const gsl_cheb_series * cs);
	86	size_t gsl_cheb_size (const gsl_cheb_series * cs);
	87	double gsl_cheb_coeffs (const gsl_cheb_series cs);
84	88
85	89	/* Evaluate a Chebyshev series at a given point.
86	90	* No errors can occur for a struct obtained from gsl_cheb_new().

+15

-1

cheb/init.c less more

94	94	return GSL_SUCCESS;
95	95	}
96	96
	97	size_t
	98	gsl_cheb_order (const gsl_cheb_series * cs)
	99	{
	100	return cs->order;
	101	}
97	102
	103	size_t
	104	gsl_cheb_size (const gsl_cheb_series * cs)
	105	{
	106	return (cs->order + 1);
	107	}
98	108
	109	double *
	110	gsl_cheb_coeffs (const gsl_cheb_series * cs)
	111	{
	112	return cs->c;
	113	}
99	114
100

+10

-0

cheb/test.c less more

74	74
75	75	gsl_cheb_init(cs, &F_T0, -1.0, 1.0);
76	76
	77	{
	78	size_t expected = 40;
	79	size_t order = gsl_cheb_order (cs);
	80	size_t size = gsl_cheb_size (cs);
	81	double * p = gsl_cheb_coeffs (cs);
	82	gsl_test(order != expected, "gsl_cheb_order");
	83	gsl_test(size != expected + 1, "gsl_cheb_size");
	84	gsl_test(p != cs->c, "gsl_cheb_coeffs");
	85	}
	86
77	87	for (i = 0; i<cs->order; i++)
78	88	{
79	89	double c_exp = (i == 0) ? 2.0 : 0.0;

+11

-0

combination/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* gsl_combination.h: added gsl_inline.h, use INLINE_DECL and
	3	GSL_RANGE_COND for gsl_combination_get
	4
	5	* combination.c: moved gsl_combination_get to inline.c
	6
	7	* inline.c: separate file for inline function object code
	8
	9	* Makefile.am (INCLUDES): use top_srcdir only, remove top_builddir
	10
0	11	2003-07-30 Brian Gough <bjg@network-theory.co.uk>
1	12
2	13	* init.c (gsl_combination_alloc): set c->data to NULL when k=0

+2

-2

combination/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_combination.h
3	3
4		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6		libgslcombination_la_SOURCES = init.c file.c combination.c
	6	libgslcombination_la_SOURCES = init.c file.c combination.c inline.c
7	7
8	8	noinst_HEADERS =
9	9

+8

-3

combination/Makefile.in less more

45	45	CONFIG_CLEAN_FILES =
46	46	LTLIBRARIES = $(noinst_LTLIBRARIES)
47	47	libgslcombination_la_LIBADD =
48		am_libgslcombination_la_OBJECTS = init.lo file.lo combination.lo
	48	am_libgslcombination_la_OBJECTS = init.lo file.lo combination.lo \
	49	inline.lo
49	50	libgslcombination_la_OBJECTS = $(am_libgslcombination_la_OBJECTS)
50	51	am_test_OBJECTS = test.$(OBJEXT)
51	52	test_OBJECTS = $(am_test_OBJECTS)

132	133	LIBOBJS = @LIBOBJS@
133	134	LIBS = @LIBS@
134	135	LIBTOOL = @LIBTOOL@
	136	LIPO = @LIPO@
135	137	LN_S = @LN_S@
136	138	LTLIBOBJS = @LTLIBOBJS@
137	139	MAINT = @MAINT@

139	141	MKDIR_P = @MKDIR_P@
140	142	NM = @NM@
141	143	NMEDIT = @NMEDIT@
	144	OBJDUMP = @OBJDUMP@
142	145	OBJEXT = @OBJEXT@
	146	OTOOL = @OTOOL@
	147	OTOOL64 = @OTOOL64@
143	148	PACKAGE = @PACKAGE@
144	149	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
145	150	PACKAGE_NAME = @PACKAGE_NAME@

204	209	top_srcdir = @top_srcdir@
205	210	noinst_LTLIBRARIES = libgslcombination.la
206	211	pkginclude_HEADERS = gsl_combination.h
207		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
208		libgslcombination_la_SOURCES = init.c file.c combination.c
	212	INCLUDES = -I$(top_srcdir)
	213	libgslcombination_la_SOURCES = init.c file.c combination.c inline.c
209	214	noinst_HEADERS =
210	215	TESTS = $(check_PROGRAMS)
211	216	test_SOURCES = test.c

+0

-17

combination/combination.c less more

38	38	{
39	39	return c->data ;
40	40	}
41
42		#ifndef HIDE_INLINE_STATIC
43		size_t
44		gsl_combination_get (const gsl_combination * c, const size_t i)
45		{
46		if (gsl_check_range)
47		{
48		if (i >= c->k) /* size_t is unsigned, can't be negative */
49		{
50		GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
51		}
52		}
53
54		return c->data[i];
55		}
56		#endif
57
58	41
59	42	int
60	43	gsl_combination_valid (gsl_combination * c)

+5

-4

combination/gsl_combination.h less more

23	23	#include <stdlib.h>
24	24	#include <gsl/gsl_errno.h>
25	25	#include <gsl/gsl_types.h>
	26	#include <gsl/gsl_inline.h>
26	27	#include <gsl/gsl_check_range.h>
27	28
28	29	#undef __BEGIN_DECLS

62	63	size_t gsl_combination_k (const gsl_combination * c);
63	64	size_t * gsl_combination_data (const gsl_combination * c);
64	65
65		size_t gsl_combination_get (const gsl_combination * c, const size_t i);
66
67	66	int gsl_combination_valid (gsl_combination * c);
68	67	int gsl_combination_next (gsl_combination * c);
69	68	int gsl_combination_prev (gsl_combination * c);
70	69
	70	INLINE_DECL size_t gsl_combination_get (const gsl_combination * c, const size_t i);
	71
71	72	#ifdef HAVE_INLINE
72	73
73		extern inline
	74	INLINE_FUN
74	75	size_t
75	76	gsl_combination_get (const gsl_combination * c, const size_t i)
76	77	{
77	78	#if GSL_RANGE_CHECK
78		if (i >= c->k)
	79	if (GSL_RANGE_COND(i >= c->k)) /* size_t is unsigned, can't be negative */
79	80	{
80	81	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
81	82	}

+24

-0

combination/inline.c less more

	0	/* combination/inline.c
	1	*
	2	* Copyright (C) 2008 Brian Gough
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	/* Compile all the inline functions */
	20
	21	#define COMPILE_INLINE_STATIC
	22	#include "build.h"
	23	#include <gsl/gsl_combination.h>

+10

-0

complex/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* math.c: handle inline functions separately
	3
	4	* gsl_complex_math.h: add declarations for inline functions
	5
	6	* inline.c: separate file for inline functions
	7
	8	* Makefile.am (INCLUDES): use top_srcdir
	9
0	10	2007-09-14 Brian Gough <bjg@network-theory.co.uk>
1	11
2	12	* test.c: add a margin of safety on tests for released versions,

+1

-2

complex/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_complex.h gsl_complex_math.h
3	3
4		#INCLUDES = -I$(top_builddir) -I$(top_srcdir)
5	4	INCLUDES = -I$(top_srcdir)
6	5
7		libgslcomplex_la_SOURCES = math.c
	6	libgslcomplex_la_SOURCES = math.c inline.c
8	7
9	8	TESTS = $(check_PROGRAMS)
10	9	check_PROGRAMS = test

+6

-4

complex/Makefile.in less more

45	45	CONFIG_CLEAN_FILES =
46	46	LTLIBRARIES = $(noinst_LTLIBRARIES)
47	47	libgslcomplex_la_LIBADD =
48		am_libgslcomplex_la_OBJECTS = math.lo
	48	am_libgslcomplex_la_OBJECTS = math.lo inline.lo
49	49	libgslcomplex_la_OBJECTS = $(am_libgslcomplex_la_OBJECTS)
50	50	am_test_OBJECTS = test.$(OBJEXT)
51	51	test_OBJECTS = $(am_test_OBJECTS)

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

203	207	top_srcdir = @top_srcdir@
204	208	noinst_LTLIBRARIES = libgslcomplex.la
205	209	pkginclude_HEADERS = gsl_complex.h gsl_complex_math.h
206
207		#INCLUDES = -I$(top_builddir) -I$(top_srcdir)
208	210	INCLUDES = -I$(top_srcdir)
209		libgslcomplex_la_SOURCES = math.c
	211	libgslcomplex_la_SOURCES = math.c inline.c
210	212	TESTS = $(check_PROGRAMS)
211	213	test_SOURCES = test.c results.h results1.h results2.h results_real.h
212	214	test_LDADD = libgslcomplex.la ../err/libgslerr.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la

+4

-2

complex/gsl_complex_math.h less more

18	18
19	19	#ifndef __GSL_COMPLEX_MATH_H__
20	20	#define __GSL_COMPLEX_MATH_H__
	21	#include <gsl/gsl_inline.h>
21	22	#include <gsl/gsl_complex.h>
22	23
23	24	#undef __BEGIN_DECLS

34	35
35	36	/* Complex numbers */
36	37
37		gsl_complex gsl_complex_rect (double x, double y); /* r= real+iimag /
38	38	gsl_complex gsl_complex_polar (double r, double theta); /* r= r e^(i theta) */
39	39
	40	INLINE_DECL gsl_complex gsl_complex_rect (double x, double y); /* r= real+iimag /
	41
40	42	#ifdef HAVE_INLINE
41		extern inline gsl_complex
	43	INLINE_FUN gsl_complex
42	44	gsl_complex_rect (double x, double y)
43	45	{ /* return z = x + i y */
44	46	gsl_complex z;

+24

-0

complex/inline.c less more

	0	/* complex/inline.c
	1	*
	2	* Copyright (C) 2008 Brian Gough
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	/* Compile all the inline functions */
	20
	21	#define COMPILE_INLINE_STATIC
	22	#include "build.h"
	23	#include <gsl/gsl_complex_math.h>

+0

-10

complex/math.c less more

50	50	* Complex numbers
51	51	**********************************************************************/
52	52
53		#ifndef HIDE_INLINE_STATIC
54		gsl_complex
55		gsl_complex_rect (double x, double y)
56		{ /* return z = x + i y */
57		gsl_complex z;
58		GSL_SET_COMPLEX (&z, x, y);
59		return z;
60		}
61		#endif
62
63	53	gsl_complex
64	54	gsl_complex_polar (double r, double theta)
65	55	{ /* return z = r exp(i theta) */

+1516

-0

config.guess less more

	0	#! /bin/sh
	1	# Attempt to guess a canonical system name.
	2	# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
	3	# 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation,
	4	# Inc.
	5
	6	timestamp='2007-05-17'
	7
	8	# This file is free software; you can redistribute it and/or modify it
	9	# under the terms of the GNU General Public License as published by
	10	# the Free Software Foundation; either version 2 of the License, or
	11	# (at your option) any later version.
	12	#
	13	# This program is distributed in the hope that it will be useful, but
	14	# WITHOUT ANY WARRANTY; without even the implied warranty of
	15	# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	16	# General Public License for more details.
	17	#
	18	# You should have received a copy of the GNU General Public License
	19	# along with this program; if not, write to the Free Software
	20	# Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
	21	# 02110-1301, USA.
	22	#
	23	# As a special exception to the GNU General Public License, if you
	24	# distribute this file as part of a program that contains a
	25	# configuration script generated by Autoconf, you may include it under
	26	# the same distribution terms that you use for the rest of that program.
	27
	28
	29	# Originally written by Per Bothner <per@bothner.com>.
	30	# Please send patches to <config-patches@gnu.org>. Submit a context
	31	# diff and a properly formatted ChangeLog entry.
	32	#
	33	# This script attempts to guess a canonical system name similar to
	34	# config.sub. If it succeeds, it prints the system name on stdout, and
	35	# exits with 0. Otherwise, it exits with 1.
	36	#
	37	# The plan is that this can be called by configure scripts if you
	38	# don't specify an explicit build system type.
	39
	40	me=`echo "$0" \| sed -e 's,.*/,,'`
	41
	42	usage="\
	43	Usage: $0 [OPTION]
	44
	45	Output the configuration name of the system \`$me' is run on.
	46
	47	Operation modes:
	48	-h, --help print this help, then exit
	49	-t, --time-stamp print date of last modification, then exit
	50	-v, --version print version number, then exit
	51
	52	Report bugs and patches to <config-patches@gnu.org>."
	53
	54	version="\
	55	GNU config.guess ($timestamp)
	56
	57	Originally written by Per Bothner.
	58	Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
	59	Free Software Foundation, Inc.
	60
	61	This is free software; see the source for copying conditions. There is NO
	62	warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
	63
	64	help="
	65	Try \`$me --help' for more information."
	66
	67	# Parse command line
	68	while test $# -gt 0 ; do
	69	case $1 in
	70	--time-stamp \| --time* \| -t )
	71	echo "$timestamp" ; exit ;;
	72	--version \| -v )
	73	echo "$version" ; exit ;;
	74	--help \| --h* \| -h )
	75	echo "$usage"; exit ;;
	76	-- ) # Stop option processing
	77	shift; break ;;
	78	- ) # Use stdin as input.
	79	break ;;
	80	-* )
	81	echo "$me: invalid option $1$help" >&2
	82	exit 1 ;;
	83	* )
	84	break ;;
	85	esac
	86	done
	87
	88	if test $# != 0; then
	89	echo "$me: too many arguments$help" >&2
	90	exit 1
	91	fi
	92
	93	trap 'exit 1' 1 2 15
	94
	95	# CC_FOR_BUILD -- compiler used by this script. Note that the use of a
	96	# compiler to aid in system detection is discouraged as it requires
	97	# temporary files to be created and, as you can see below, it is a
	98	# headache to deal with in a portable fashion.
	99
	100	# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still
	101	# use `HOST_CC' if defined, but it is deprecated.
	102
	103	# Portable tmp directory creation inspired by the Autoconf team.
	104
	105	set_cc_for_build='
	106	trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ;
	107	trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ;
	108	: ${TMPDIR=/tmp} ;
	109	{ tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } \|\|
	110	{ test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } \|\|
	111	{ tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } \|\|
	112	{ echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ;
	113	dummy=$tmp/dummy ;
	114	tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ;
	115	case $CC_FOR_BUILD,$HOST_CC,$CC in
	116	,,) echo "int x;" > $dummy.c ;
	117	for c in cc gcc c89 c99 ; do
	118	if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then
	119	CC_FOR_BUILD="$c"; break ;
	120	fi ;
	121	done ;
	122	if test x"$CC_FOR_BUILD" = x ; then
	123	CC_FOR_BUILD=no_compiler_found ;
	124	fi
	125	;;
	126	,,*) CC_FOR_BUILD=$CC ;;
	127	,,) CC_FOR_BUILD=$HOST_CC ;;
	128	esac ; set_cc_for_build= ;'
	129
	130	# This is needed to find uname on a Pyramid OSx when run in the BSD universe.
	131	# (ghazi@noc.rutgers.edu 1994-08-24)
	132	if (test -f /.attbin/uname) >/dev/null 2>&1 ; then
	133	PATH=$PATH:/.attbin ; export PATH
	134	fi
	135
	136	UNAME_MACHINE=`(uname -m) 2>/dev/null` \|\| UNAME_MACHINE=unknown
	137	UNAME_RELEASE=`(uname -r) 2>/dev/null` \|\| UNAME_RELEASE=unknown
	138	UNAME_SYSTEM=`(uname -s) 2>/dev/null` \|\| UNAME_SYSTEM=unknown
	139	UNAME_VERSION=`(uname -v) 2>/dev/null` \|\| UNAME_VERSION=unknown
	140
	141	# Note: order is significant - the case branches are not exclusive.
	142
	143	case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in
	144	:NetBSD::*)
	145	# NetBSD (nbsd) targets should (where applicable) match one or
	146	# more of the tupples: --netbsdelf, --netbsdaout,
	147	# --netbsdecoff* and --netbsd*. For targets that recently
	148	# switched to ELF, --netbsd* would select the old
	149	# object file format. This provides both forward
	150	# compatibility and a consistent mechanism for selecting the
	151	# object file format.
	152	#
	153	# Note: NetBSD doesn't particularly care about the vendor
	154	# portion of the name. We always set it to "unknown".
	155	sysctl="sysctl -n hw.machine_arch"
	156	UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null \|\| \
	157	/usr/sbin/$sysctl 2>/dev/null \|\| echo unknown)`
	158	case "${UNAME_MACHINE_ARCH}" in
	159	armeb) machine=armeb-unknown ;;
	160	arm*) machine=arm-unknown ;;
	161	sh3el) machine=shl-unknown ;;
	162	sh3eb) machine=sh-unknown ;;
	163	sh5el) machine=sh5le-unknown ;;
	164	*) machine=${UNAME_MACHINE_ARCH}-unknown ;;
	165	esac
	166	# The Operating System including object format, if it has switched
	167	# to ELF recently, or will in the future.
	168	case "${UNAME_MACHINE_ARCH}" in
	169	arm\|i386\|m68k\|ns32k\|sh3\|sparc\|vax)
	170	eval $set_cc_for_build
	171	if echo __ELF__ \| $CC_FOR_BUILD -E - 2>/dev/null \
	172	\| grep __ELF__ >/dev/null
	173	then
	174	# Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).
	175	# Return netbsd for either. FIX?
	176	os=netbsd
	177	else
	178	os=netbsdelf
	179	fi
	180	;;
	181	*)
	182	os=netbsd
	183	;;
	184	esac
	185	# The OS release
	186	# Debian GNU/NetBSD machines have a different userland, and
	187	# thus, need a distinct triplet. However, they do not need
	188	# kernel version information, so it can be replaced with a
	189	# suitable tag, in the style of linux-gnu.
	190	case "${UNAME_VERSION}" in
	191	Debian*)
	192	release='-gnu'
	193	;;
	194	*)
	195	release=`echo ${UNAME_RELEASE}\|sed -e 's/[-_].*/\./'`
	196	;;
	197	esac
	198	# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:
	199	# contains redundant information, the shorter form:
	200	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.
	201	echo "${machine}-${os}${release}"
	202	exit ;;
	203	:OpenBSD::*)
	204	UNAME_MACHINE_ARCH=`arch \| sed 's/OpenBSD.//'`
	205	echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}
	206	exit ;;
	207	:ekkoBSD::*)
	208	echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}
	209	exit ;;
	210	:SolidBSD::*)
	211	echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}
	212	exit ;;
	213	macppc:MirBSD::)
	214	echo powerpc-unknown-mirbsd${UNAME_RELEASE}
	215	exit ;;
	216	:MirBSD::*)
	217	echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}
	218	exit ;;
	219	alpha:OSF1::)
	220	case $UNAME_RELEASE in
	221	*4.0)
	222	UNAME_RELEASE=`/usr/sbin/sizer -v \| awk '{print $3}'`
	223	;;
	224	5.)
	225	UNAME_RELEASE=`/usr/sbin/sizer -v \| awk '{print $4}'`
	226	;;
	227	esac
	228	# According to Compaq, /usr/sbin/psrinfo has been available on
	229	# OSF/1 and Tru64 systems produced since 1995. I hope that
	230	# covers most systems running today. This code pipes the CPU
	231	# types through head -n 1, so we only detect the type of CPU 0.
	232	ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v \| sed -n -e 's/^ The alpha $.$ processor.$/\1/p' \| head -n 1`
	233	case "$ALPHA_CPU_TYPE" in
	234	"EV4 (21064)")
	235	UNAME_MACHINE="alpha" ;;
	236	"EV4.5 (21064)")
	237	UNAME_MACHINE="alpha" ;;
	238	"LCA4 (21066/21068)")
	239	UNAME_MACHINE="alpha" ;;
	240	"EV5 (21164)")
	241	UNAME_MACHINE="alphaev5" ;;
	242	"EV5.6 (21164A)")
	243	UNAME_MACHINE="alphaev56" ;;
	244	"EV5.6 (21164PC)")
	245	UNAME_MACHINE="alphapca56" ;;
	246	"EV5.7 (21164PC)")
	247	UNAME_MACHINE="alphapca57" ;;
	248	"EV6 (21264)")
	249	UNAME_MACHINE="alphaev6" ;;
	250	"EV6.7 (21264A)")
	251	UNAME_MACHINE="alphaev67" ;;
	252	"EV6.8CB (21264C)")
	253	UNAME_MACHINE="alphaev68" ;;
	254	"EV6.8AL (21264B)")
	255	UNAME_MACHINE="alphaev68" ;;
	256	"EV6.8CX (21264D)")
	257	UNAME_MACHINE="alphaev68" ;;
	258	"EV6.9A (21264/EV69A)")
	259	UNAME_MACHINE="alphaev69" ;;
	260	"EV7 (21364)")
	261	UNAME_MACHINE="alphaev7" ;;
	262	"EV7.9 (21364A)")
	263	UNAME_MACHINE="alphaev79" ;;
	264	esac
	265	# A Pn.n version is a patched version.
	266	# A Vn.n version is a released version.
	267	# A Tn.n version is a released field test version.
	268	# A Xn.n version is an unreleased experimental baselevel.
	269	# 1.2 uses "1.2" for uname -r.
	270	echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} \| sed -e 's/^[PVTX]//' \| tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`
	271	exit ;;
	272	Alpha\ :Windows_NT:*)
	273	# How do we know it's Interix rather than the generic POSIX subsystem?
	274	# Should we change UNAME_MACHINE based on the output of uname instead
	275	# of the specific Alpha model?
	276	echo alpha-pc-interix
	277	exit ;;
	278	21064:Windows_NT:50:3)
	279	echo alpha-dec-winnt3.5
	280	exit ;;
	281	Amiga:UNIX_System_V:4.0:)
	282	echo m68k-unknown-sysv4
	283	exit ;;
	284	:[Aa]miga[Oo][Ss]::*)
	285	echo ${UNAME_MACHINE}-unknown-amigaos
	286	exit ;;
	287	:[Mm]orph[Oo][Ss]::*)
	288	echo ${UNAME_MACHINE}-unknown-morphos
	289	exit ;;
	290	:OS/390::*)
	291	echo i370-ibm-openedition
	292	exit ;;
	293	:z/VM::*)
	294	echo s390-ibm-zvmoe
	295	exit ;;
	296	:OS400::*)
	297	echo powerpc-ibm-os400
	298	exit ;;
	299	arm:RISC:1.[012]:\|arm:riscix:1.[012]:*)
	300	echo arm-acorn-riscix${UNAME_RELEASE}
	301	exit ;;
	302	arm:riscos::\|arm:RISCOS::)
	303	echo arm-unknown-riscos
	304	exit ;;
	305	SR2?01:HI-UX/MPP:: \| SR8000:HI-UX/MPP::)
	306	echo hppa1.1-hitachi-hiuxmpp
	307	exit ;;
	308	Pyramid:OSx:: \| MIS:OSx:: \| MIS:SMP_DC-OSx::)
	309	# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.
	310	if test "`(/bin/universe) 2>/dev/null`" = att ; then
	311	echo pyramid-pyramid-sysv3
	312	else
	313	echo pyramid-pyramid-bsd
	314	fi
	315	exit ;;
	316	NILE::*:dcosx)
	317	echo pyramid-pyramid-svr4
	318	exit ;;
	319	DRS?6000:unix:4.0:6*)
	320	echo sparc-icl-nx6
	321	exit ;;
	322	DRS?6000:UNIX_SV:4.2:7 \| DRS?6000:isis:4.2:7)
	323	case `/usr/bin/uname -p` in
	324	sparc) echo sparc-icl-nx7; exit ;;
	325	esac ;;
	326	sun4H:SunOS:5.:)
	327	echo sparc-hal-solaris2`echo ${UNAME_RELEASE}\|sed -e 's/[^.]*//'`
	328	exit ;;
	329	sun4:SunOS:5.:* \| tadpole:SunOS:5.:*)
	330	echo sparc-sun-solaris2`echo ${UNAME_RELEASE}\|sed -e 's/[^.]*//'`
	331	exit ;;
	332	i86pc:SunOS:5.: \| ix86xen:SunOS:5.:)
	333	echo i386-pc-solaris2`echo ${UNAME_RELEASE}\|sed -e 's/[^.]*//'`
	334	exit ;;
	335	sun4:SunOS:6:*)
	336	# According to config.sub, this is the proper way to canonicalize
	337	# SunOS6. Hard to guess exactly what SunOS6 will be like, but
	338	# it's likely to be more like Solaris than SunOS4.
	339	echo sparc-sun-solaris3`echo ${UNAME_RELEASE}\|sed -e 's/[^.]*//'`
	340	exit ;;
	341	sun4:SunOS::*)
	342	case "`/usr/bin/arch -k`" in
	343	Series\|S4)
	344	UNAME_RELEASE=`uname -v`
	345	;;
	346	esac
	347	# Japanese Language versions have a version number like `4.1.3-JL'.
	348	echo sparc-sun-sunos`echo ${UNAME_RELEASE}\|sed -e 's/-/_/'`
	349	exit ;;
	350	sun3:SunOS::*)
	351	echo m68k-sun-sunos${UNAME_RELEASE}
	352	exit ;;
	353	sun::4.2BSD:*)
	354	UNAME_RELEASE=`(sed 1q /etc/motd \| awk '{print substr($5,1,3)}') 2>/dev/null`
	355	test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3
	356	case "`/bin/arch`" in
	357	sun3)
	358	echo m68k-sun-sunos${UNAME_RELEASE}
	359	;;
	360	sun4)
	361	echo sparc-sun-sunos${UNAME_RELEASE}
	362	;;
	363	esac
	364	exit ;;
	365	aushp:SunOS::)
	366	echo sparc-auspex-sunos${UNAME_RELEASE}
	367	exit ;;
	368	# The situation for MiNT is a little confusing. The machine name
	369	# can be virtually everything (everything which is not
	370	# "atarist" or "atariste" at least should have a processor
	371	# > m68000). The system name ranges from "MiNT" over "FreeMiNT"
	372	# to the lowercase version "mint" (or "freemint"). Finally
	373	# the system name "TOS" denotes a system which is actually not
	374	# MiNT. But MiNT is downward compatible to TOS, so this should
	375	# be no problem.
	376	atarist[e]:MiNT::* \| atarist[e]:mint::* \| atarist[e]:TOS::*)
	377	echo m68k-atari-mint${UNAME_RELEASE}
	378	exit ;;
	379	atari:MiNT:: \| atari:mint:: \| atarist[e]:TOS::*)
	380	echo m68k-atari-mint${UNAME_RELEASE}
	381	exit ;;
	382	falcon:MiNT::* \| falcon:mint::* \| falcon:TOS::*)
	383	echo m68k-atari-mint${UNAME_RELEASE}
	384	exit ;;
	385	milan:MiNT:: \| milan:mint:: \| milan:TOS::*)
	386	echo m68k-milan-mint${UNAME_RELEASE}
	387	exit ;;
	388	hades:MiNT:: \| hades:mint:: \| hades:TOS::*)
	389	echo m68k-hades-mint${UNAME_RELEASE}
	390	exit ;;
	391	:MiNT:: \| :mint:: \| :TOS::)
	392	echo m68k-unknown-mint${UNAME_RELEASE}
	393	exit ;;
	394	m68k:machten::)
	395	echo m68k-apple-machten${UNAME_RELEASE}
	396	exit ;;
	397	powerpc:machten::)
	398	echo powerpc-apple-machten${UNAME_RELEASE}
	399	exit ;;
	400	RISC:Mach::*)
	401	echo mips-dec-mach_bsd4.3
	402	exit ;;
	403	RISC:ULTRIX::*)
	404	echo mips-dec-ultrix${UNAME_RELEASE}
	405	exit ;;
	406	VAX:ULTRIX::)
	407	echo vax-dec-ultrix${UNAME_RELEASE}
	408	exit ;;
	409	2020:CLIX:: \| 2430:CLIX::)
	410	echo clipper-intergraph-clix${UNAME_RELEASE}
	411	exit ;;
	412	mips:::UMIPS \| mips:::RISCos)
	413	eval $set_cc_for_build
	414	sed 's/^ //' << EOF >$dummy.c
	415	#ifdef __cplusplus
	416	#include <stdio.h> /* for printf() prototype */
	417	int main (int argc, char *argv[]) {
	418	#else
	419	int main (argc, argv) int argc; char *argv[]; {
	420	#endif
	421	#if defined (host_mips) && defined (MIPSEB)
	422	#if defined (SYSTYPE_SYSV)
	423	printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0);
	424	#endif
	425	#if defined (SYSTYPE_SVR4)
	426	printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0);
	427	#endif
	428	#if defined (SYSTYPE_BSD43) \|\| defined(SYSTYPE_BSD)
	429	printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0);
	430	#endif
	431	#endif
	432	exit (-1);
	433	}
	434	EOF
	435	$CC_FOR_BUILD -o $dummy $dummy.c &&
	436	dummyarg=`echo "${UNAME_RELEASE}" \| sed -n 's/$[0-9]$./\1/p'` &&
	437	SYSTEM_NAME=`$dummy $dummyarg` &&
	438	{ echo "$SYSTEM_NAME"; exit; }
	439	echo mips-mips-riscos${UNAME_RELEASE}
	440	exit ;;
	441	Motorola:PowerMAX_OS::)
	442	echo powerpc-motorola-powermax
	443	exit ;;
	444	Motorola::4.3:PL8-)
	445	echo powerpc-harris-powermax
	446	exit ;;
	447	Night_Hawk:::PowerMAX_OS \| Synergy:PowerMAX_OS::)
	448	echo powerpc-harris-powermax
	449	exit ;;
	450	Night_Hawk:Power_UNIX::)
	451	echo powerpc-harris-powerunix
	452	exit ;;
	453	m88k:CX/UX:7:)
	454	echo m88k-harris-cxux7
	455	exit ;;
	456	m88k::4:R4*)
	457	echo m88k-motorola-sysv4
	458	exit ;;
	459	m88k::3:R3*)
	460	echo m88k-motorola-sysv3
	461	exit ;;
	462	AViiON:dgux::)
	463	# DG/UX returns AViiON for all architectures
	464	UNAME_PROCESSOR=`/usr/bin/uname -p`
	465	if [ $UNAME_PROCESSOR = mc88100 ] \|\| [ $UNAME_PROCESSOR = mc88110 ]
	466	then
	467	if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] \|\| \
	468	[ ${TARGET_BINARY_INTERFACE}x = x ]
	469	then
	470	echo m88k-dg-dgux${UNAME_RELEASE}
	471	else
	472	echo m88k-dg-dguxbcs${UNAME_RELEASE}
	473	fi
	474	else
	475	echo i586-dg-dgux${UNAME_RELEASE}
	476	fi
	477	exit ;;
	478	M88:DolphinOS::*) # DolphinOS (SVR3)
	479	echo m88k-dolphin-sysv3
	480	exit ;;
	481	M88::R3:)
	482	# Delta 88k system running SVR3
	483	echo m88k-motorola-sysv3
	484	exit ;;
	485	XD88:::) # Tektronix XD88 system running UTekV (SVR3)
	486	echo m88k-tektronix-sysv3
	487	exit ;;
	488	Tek43[0-9][0-9]:UTek::) # Tektronix 4300 system running UTek (BSD)
	489	echo m68k-tektronix-bsd
	490	exit ;;
	491	:IRIX::)
	492	echo mips-sgi-irix`echo ${UNAME_RELEASE}\|sed -e 's/-/_/g'`
	493	exit ;;
	494	????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.
	495	echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id
	496	exit ;; # Note that: echo "'`uname -s`'" gives 'AIX '
	497	i86:AIX::*)
	498	echo i386-ibm-aix
	499	exit ;;
	500	ia64:AIX::)
	501	if [ -x /usr/bin/oslevel ] ; then
	502	IBM_REV=`/usr/bin/oslevel`
	503	else
	504	IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
	505	fi
	506	echo ${UNAME_MACHINE}-ibm-aix${IBM_REV}
	507	exit ;;
	508	*:AIX:2:3)
	509	if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then
	510	eval $set_cc_for_build
	511	sed 's/^ //' << EOF >$dummy.c
	512	#include <sys/systemcfg.h>
	513
	514	main()
	515	{
	516	if (!__power_pc())
	517	exit(1);
	518	puts("powerpc-ibm-aix3.2.5");
	519	exit(0);
	520	}
	521	EOF
	522	if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`
	523	then
	524	echo "$SYSTEM_NAME"
	525	else
	526	echo rs6000-ibm-aix3.2.5
	527	fi
	528	elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then
	529	echo rs6000-ibm-aix3.2.4
	530	else
	531	echo rs6000-ibm-aix3.2
	532	fi
	533	exit ;;
	534	:AIX::[45])
	535	IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available \| sed 1q \| awk '{ print $1 }'`
	536	if /usr/sbin/lsattr -El ${IBM_CPU_ID} \| grep ' POWER' >/dev/null 2>&1; then
	537	IBM_ARCH=rs6000
	538	else
	539	IBM_ARCH=powerpc
	540	fi
	541	if [ -x /usr/bin/oslevel ] ; then
	542	IBM_REV=`/usr/bin/oslevel`
	543	else
	544	IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
	545	fi
	546	echo ${IBM_ARCH}-ibm-aix${IBM_REV}
	547	exit ;;
	548	:AIX::*)
	549	echo rs6000-ibm-aix
	550	exit ;;
	551	ibmrt:4.4BSD:\|romp-ibm:BSD:)
	552	echo romp-ibm-bsd4.4
	553	exit ;;
	554	ibmrt:BSD:\|romp-ibm:BSD:*) # covers RT/PC BSD and
	555	echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to
	556	exit ;; # report: romp-ibm BSD 4.3
	557	:BOSX::*)
	558	echo rs6000-bull-bosx
	559	exit ;;
	560	DPX/2?00:B.O.S.::)
	561	echo m68k-bull-sysv3
	562	exit ;;
	563	9000/[34]??:4.3bsd:1.:)
	564	echo m68k-hp-bsd
	565	exit ;;
	566	hp300:4.4BSD:: \| 9000/[34]??:4.3bsd:2.:)
	567	echo m68k-hp-bsd4.4
	568	exit ;;
	569	9000/[34678]??:HP-UX::)
	570	HPUX_REV=`echo ${UNAME_RELEASE}\|sed -e 's/[^.].[0B]//'`
	571	case "${UNAME_MACHINE}" in
	572	9000/31? ) HP_ARCH=m68000 ;;
	573	9000/[34]?? ) HP_ARCH=m68k ;;
	574	9000/[678][0-9][0-9])
	575	if [ -x /usr/bin/getconf ]; then
	576	sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`
	577	sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`
	578	case "${sc_cpu_version}" in
	579	523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0
	580	528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1
	581	532) # CPU_PA_RISC2_0
	582	case "${sc_kernel_bits}" in
	583	32) HP_ARCH="hppa2.0n" ;;
	584	64) HP_ARCH="hppa2.0w" ;;
	585	'') HP_ARCH="hppa2.0" ;; # HP-UX 10.20
	586	esac ;;
	587	esac
	588	fi
	589	if [ "${HP_ARCH}" = "" ]; then
	590	eval $set_cc_for_build
	591	sed 's/^ //' << EOF >$dummy.c
	592
	593	#define _HPUX_SOURCE
	594	#include <stdlib.h>
	595	#include <unistd.h>
	596
	597	int main ()
	598	{
	599	#if defined(_SC_KERNEL_BITS)
	600	long bits = sysconf(_SC_KERNEL_BITS);
	601	#endif
	602	long cpu = sysconf (_SC_CPU_VERSION);
	603
	604	switch (cpu)
	605	{
	606	case CPU_PA_RISC1_0: puts ("hppa1.0"); break;
	607	case CPU_PA_RISC1_1: puts ("hppa1.1"); break;
	608	case CPU_PA_RISC2_0:
	609	#if defined(_SC_KERNEL_BITS)
	610	switch (bits)
	611	{
	612	case 64: puts ("hppa2.0w"); break;
	613	case 32: puts ("hppa2.0n"); break;
	614	default: puts ("hppa2.0"); break;
	615	} break;
	616	#else /* !defined(_SC_KERNEL_BITS) */
	617	puts ("hppa2.0"); break;
	618	#endif
	619	default: puts ("hppa1.0"); break;
	620	}
	621	exit (0);
	622	}
	623	EOF
	624	(CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`
	625	test -z "$HP_ARCH" && HP_ARCH=hppa
	626	fi ;;
	627	esac
	628	if [ ${HP_ARCH} = "hppa2.0w" ]
	629	then
	630	eval $set_cc_for_build
	631
	632	# hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating
	633	# 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler
	634	# generating 64-bit code. GNU and HP use different nomenclature:
	635	#
	636	# $ CC_FOR_BUILD=cc ./config.guess
	637	# => hppa2.0w-hp-hpux11.23
	638	# $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess
	639	# => hppa64-hp-hpux11.23
	640
	641	if echo __LP64__ \| (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) \|
	642	grep __LP64__ >/dev/null
	643	then
	644	HP_ARCH="hppa2.0w"
	645	else
	646	HP_ARCH="hppa64"
	647	fi
	648	fi
	649	echo ${HP_ARCH}-hp-hpux${HPUX_REV}
	650	exit ;;
	651	ia64:HP-UX::)
	652	HPUX_REV=`echo ${UNAME_RELEASE}\|sed -e 's/[^.].[0B]//'`
	653	echo ia64-hp-hpux${HPUX_REV}
	654	exit ;;
	655	3050:HI-UX::*)
	656	eval $set_cc_for_build
	657	sed 's/^ //' << EOF >$dummy.c
	658	#include <unistd.h>
	659	int
	660	main ()
	661	{
	662	long cpu = sysconf (_SC_CPU_VERSION);
	663	/* The order matters, because CPU_IS_HP_MC68K erroneously returns
	664	true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct
	665	results, however. */
	666	if (CPU_IS_PA_RISC (cpu))
	667	{
	668	switch (cpu)
	669	{
	670	case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break;
	671	case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break;
	672	case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break;
	673	default: puts ("hppa-hitachi-hiuxwe2"); break;
	674	}
	675	}
	676	else if (CPU_IS_HP_MC68K (cpu))
	677	puts ("m68k-hitachi-hiuxwe2");
	678	else puts ("unknown-hitachi-hiuxwe2");
	679	exit (0);
	680	}
	681	EOF
	682	$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&
	683	{ echo "$SYSTEM_NAME"; exit; }
	684	echo unknown-hitachi-hiuxwe2
	685	exit ;;
	686	9000/7??:4.3bsd:: \| 9000/8?[79]:4.3bsd:: )
	687	echo hppa1.1-hp-bsd
	688	exit ;;
	689	9000/8??:4.3bsd::)
	690	echo hppa1.0-hp-bsd
	691	exit ;;
	692	9??:MPE/iX:: \| 3000:MPE/iX::)
	693	echo hppa1.0-hp-mpeix
	694	exit ;;
	695	hp7??:OSF1:: \| hp8?[79]:OSF1:: )
	696	echo hppa1.1-hp-osf
	697	exit ;;
	698	hp8??:OSF1::)
	699	echo hppa1.0-hp-osf
	700	exit ;;
	701	i86:OSF1::*)
	702	if [ -x /usr/sbin/sysversion ] ; then
	703	echo ${UNAME_MACHINE}-unknown-osf1mk
	704	else
	705	echo ${UNAME_MACHINE}-unknown-osf1
	706	fi
	707	exit ;;
	708	parisc:Lites::)
	709	echo hppa1.1-hp-lites
	710	exit ;;
	711	C1:ConvexOS::* \| convex:ConvexOS:C1:)
	712	echo c1-convex-bsd
	713	exit ;;
	714	C2:ConvexOS::* \| convex:ConvexOS:C2:)
	715	if getsysinfo -f scalar_acc
	716	then echo c32-convex-bsd
	717	else echo c2-convex-bsd
	718	fi
	719	exit ;;
	720	C34:ConvexOS::* \| convex:ConvexOS:C34:)
	721	echo c34-convex-bsd
	722	exit ;;
	723	C38:ConvexOS::* \| convex:ConvexOS:C38:)
	724	echo c38-convex-bsd
	725	exit ;;
	726	C4:ConvexOS::* \| convex:ConvexOS:C4:)
	727	echo c4-convex-bsd
	728	exit ;;
	729	CRAYY-MP:::)
	730	echo ymp-cray-unicos${UNAME_RELEASE} \| sed -e 's/\.[^.]*$/.X/'
	731	exit ;;
	732	CRAY[A-Z]90:::)
	733	echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \
	734	\| sed -e 's/CRAY.*$[A-Z]90$/\1/' \
	735	-e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \
	736	-e 's/\.[^.]*$/.X/'
	737	exit ;;
	738	CRAYTS:::)
	739	echo t90-cray-unicos${UNAME_RELEASE} \| sed -e 's/\.[^.]*$/.X/'
	740	exit ;;
	741	CRAYT3E:::)
	742	echo alphaev5-cray-unicosmk${UNAME_RELEASE} \| sed -e 's/\.[^.]*$/.X/'
	743	exit ;;
	744	CRAYSV1:::)
	745	echo sv1-cray-unicos${UNAME_RELEASE} \| sed -e 's/\.[^.]*$/.X/'
	746	exit ;;
	747	:UNICOS/mp::*)
	748	echo craynv-cray-unicosmp${UNAME_RELEASE} \| sed -e 's/\.[^.]*$/.X/'
	749	exit ;;
	750	F30[01]:UNIX_System_V:: \| F700:UNIX_System_V::)
	751	FUJITSU_PROC=`uname -m \| tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`
	752	FUJITSU_SYS=`uname -p \| tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' \| sed -e 's/\///'`
	753	FUJITSU_REL=`echo ${UNAME_RELEASE} \| sed -e 's/ /_/'`
	754	echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
	755	exit ;;
	756	5000:UNIX_System_V:4.:)
	757	FUJITSU_SYS=`uname -p \| tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' \| sed -e 's/\///'`
	758	FUJITSU_REL=`echo ${UNAME_RELEASE} \| tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' \| sed -e 's/ /_/'`
	759	echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
	760	exit ;;
	761	i86:BSD/386::* \| i86:BSD/OS::* \| :Ascend\ Embedded/OS::*)
	762	echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}
	763	exit ;;
	764	sparc:BSD/OS::*)
	765	echo sparc-unknown-bsdi${UNAME_RELEASE}
	766	exit ;;
	767	:BSD/OS::*)
	768	echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}
	769	exit ;;
	770	:FreeBSD::*)
	771	case ${UNAME_MACHINE} in
	772	pc98)
	773	echo i386-unknown-freebsd`echo ${UNAME_RELEASE}\|sed -e 's/[-(].*//'` ;;
	774	amd64)
	775	echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}\|sed -e 's/[-(].*//'` ;;
	776	*)
	777	echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}\|sed -e 's/[-(].*//'` ;;
	778	esac
	779	exit ;;
	780	i:CYGWIN:*)
	781	echo ${UNAME_MACHINE}-pc-cygwin
	782	exit ;;
	783	:MINGW:*)
	784	echo ${UNAME_MACHINE}-pc-mingw32
	785	exit ;;
	786	i:windows32:*)
	787	# uname -m includes "-pc" on this system.
	788	echo ${UNAME_MACHINE}-mingw32
	789	exit ;;
	790	i:PW:*)
	791	echo ${UNAME_MACHINE}-pc-pw32
	792	exit ;;
	793	:Interix:[3456]*)
	794	case ${UNAME_MACHINE} in
	795	x86)
	796	echo i586-pc-interix${UNAME_RELEASE}
	797	exit ;;
	798	EM64T \| authenticamd)
	799	echo x86_64-unknown-interix${UNAME_RELEASE}
	800	exit ;;
	801	esac ;;
	802	[345]86:Windows_95:* \| [345]86:Windows_98:* \| [345]86:Windows_NT:*)
	803	echo i${UNAME_MACHINE}-pc-mks
	804	exit ;;
	805	i:Windows_NT:* \| Pentium:Windows_NT:*)
	806	# How do we know it's Interix rather than the generic POSIX subsystem?
	807	# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we
	808	# UNAME_MACHINE based on the output of uname instead of i386?
	809	echo i586-pc-interix
	810	exit ;;
	811	i:UWIN:*)
	812	echo ${UNAME_MACHINE}-pc-uwin
	813	exit ;;
	814	amd64:CYGWIN::* \| x86_64:CYGWIN::*)
	815	echo x86_64-unknown-cygwin
	816	exit ;;
	817	p:CYGWIN:*)
	818	echo powerpcle-unknown-cygwin
	819	exit ;;
	820	prep:SunOS:5.:*)
	821	echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}\|sed -e 's/[^.]*//'`
	822	exit ;;
	823	:GNU::*)
	824	# the GNU system
	825	echo `echo ${UNAME_MACHINE}\|sed -e 's,[-/].$,,'`-unknown-gnu`echo ${UNAME_RELEASE}\|sed -e 's,/.$,,'`
	826	exit ;;
	827	:GNU/::)
	828	# other systems with GNU libc and userland
	829	echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} \| sed 's,^[^/]/,,' \| tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}\|sed -e 's/[-(].//'`-gnu
	830	exit ;;
	831	i86:Minix::*)
	832	echo ${UNAME_MACHINE}-pc-minix
	833	exit ;;
	834	arm:Linux::*)
	835	echo ${UNAME_MACHINE}-unknown-linux-gnu
	836	exit ;;
	837	avr32:Linux::*)
	838	echo ${UNAME_MACHINE}-unknown-linux-gnu
	839	exit ;;
	840	cris:Linux::)
	841	echo cris-axis-linux-gnu
	842	exit ;;
	843	crisv32:Linux::)
	844	echo crisv32-axis-linux-gnu
	845	exit ;;
	846	frv:Linux::)
	847	echo frv-unknown-linux-gnu
	848	exit ;;
	849	ia64:Linux::)
	850	echo ${UNAME_MACHINE}-unknown-linux-gnu
	851	exit ;;
	852	m32r:Linux::*)
	853	echo ${UNAME_MACHINE}-unknown-linux-gnu
	854	exit ;;
	855	m68:Linux::*)
	856	echo ${UNAME_MACHINE}-unknown-linux-gnu
	857	exit ;;
	858	mips:Linux::)
	859	eval $set_cc_for_build
	860	sed 's/^ //' << EOF >$dummy.c
	861	#undef CPU
	862	#undef mips
	863	#undef mipsel
	864	#if defined(__MIPSEL__) \|\| defined(__MIPSEL) \|\| defined(_MIPSEL) \|\| defined(MIPSEL)
	865	CPU=mipsel
	866	#else
	867	#if defined(__MIPSEB__) \|\| defined(__MIPSEB) \|\| defined(_MIPSEB) \|\| defined(MIPSEB)
	868	CPU=mips
	869	#else
	870	CPU=
	871	#endif
	872	#endif
	873	EOF
	874	eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null \| sed -n '
	875	/^CPU/{
	876	s: ::g
	877	p
	878	}'`"
	879	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; }
	880	;;
	881	mips64:Linux::)
	882	eval $set_cc_for_build
	883	sed 's/^ //' << EOF >$dummy.c
	884	#undef CPU
	885	#undef mips64
	886	#undef mips64el
	887	#if defined(__MIPSEL__) \|\| defined(__MIPSEL) \|\| defined(_MIPSEL) \|\| defined(MIPSEL)
	888	CPU=mips64el
	889	#else
	890	#if defined(__MIPSEB__) \|\| defined(__MIPSEB) \|\| defined(_MIPSEB) \|\| defined(MIPSEB)
	891	CPU=mips64
	892	#else
	893	CPU=
	894	#endif
	895	#endif
	896	EOF
	897	eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null \| sed -n '
	898	/^CPU/{
	899	s: ::g
	900	p
	901	}'`"
	902	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; }
	903	;;
	904	or32:Linux::)
	905	echo or32-unknown-linux-gnu
	906	exit ;;
	907	ppc:Linux::)
	908	echo powerpc-unknown-linux-gnu
	909	exit ;;
	910	ppc64:Linux::)
	911	echo powerpc64-unknown-linux-gnu
	912	exit ;;
	913	alpha:Linux::)
	914	case `sed -n '/^cpu model/s/^.: $.$/\1/p' < /proc/cpuinfo` in
	915	EV5) UNAME_MACHINE=alphaev5 ;;
	916	EV56) UNAME_MACHINE=alphaev56 ;;
	917	PCA56) UNAME_MACHINE=alphapca56 ;;
	918	PCA57) UNAME_MACHINE=alphapca56 ;;
	919	EV6) UNAME_MACHINE=alphaev6 ;;
	920	EV67) UNAME_MACHINE=alphaev67 ;;
	921	EV68*) UNAME_MACHINE=alphaev68 ;;
	922	esac
	923	objdump --private-headers /bin/sh \| grep ld.so.1 >/dev/null
	924	if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi
	925	echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC}
	926	exit ;;
	927	parisc:Linux:: \| hppa:Linux::)
	928	# Look for CPU level
	929	case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null \| cut -d' ' -f2` in
	930	PA7*) echo hppa1.1-unknown-linux-gnu ;;
	931	PA8*) echo hppa2.0-unknown-linux-gnu ;;
	932	*) echo hppa-unknown-linux-gnu ;;
	933	esac
	934	exit ;;
	935	parisc64:Linux:: \| hppa64:Linux::)
	936	echo hppa64-unknown-linux-gnu
	937	exit ;;
	938	s390:Linux:: \| s390x:Linux::)
	939	echo ${UNAME_MACHINE}-ibm-linux
	940	exit ;;
	941	sh64:Linux::*)
	942	echo ${UNAME_MACHINE}-unknown-linux-gnu
	943	exit ;;
	944	sh:Linux::*)
	945	echo ${UNAME_MACHINE}-unknown-linux-gnu
	946	exit ;;
	947	sparc:Linux:: \| sparc64:Linux::)
	948	echo ${UNAME_MACHINE}-unknown-linux-gnu
	949	exit ;;
	950	vax:Linux::)
	951	echo ${UNAME_MACHINE}-dec-linux-gnu
	952	exit ;;
	953	x86_64:Linux::)
	954	echo x86_64-unknown-linux-gnu
	955	exit ;;
	956	xtensa:Linux::)
	957	echo xtensa-unknown-linux-gnu
	958	exit ;;
	959	i86:Linux::*)
	960	# The BFD linker knows what the default object file format is, so
	961	# first see if it will tell us. cd to the root directory to prevent
	962	# problems with other programs or directories called `ld' in the path.
	963	# Set LC_ALL=C to ensure ld outputs messages in English.
	964	ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \
	965	\| sed -ne '/supported targets:/!d
	966	s/[ ][ ]*/ /g
	967	s/.supported targets: //
	968	s/ .*//
	969	p'`
	970	case "$ld_supported_targets" in
	971	elf32-i386)
	972	TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu"
	973	;;
	974	a.out-i386-linux)
	975	echo "${UNAME_MACHINE}-pc-linux-gnuaout"
	976	exit ;;
	977	coff-i386)
	978	echo "${UNAME_MACHINE}-pc-linux-gnucoff"
	979	exit ;;
	980	"")
	981	# Either a pre-BFD a.out linker (linux-gnuoldld) or
	982	# one that does not give us useful --help.
	983	echo "${UNAME_MACHINE}-pc-linux-gnuoldld"
	984	exit ;;
	985	esac
	986	# Determine whether the default compiler is a.out or elf
	987	eval $set_cc_for_build
	988	sed 's/^ //' << EOF >$dummy.c
	989	#include <features.h>
	990	#ifdef __ELF__
	991	# ifdef __GLIBC__
	992	# if __GLIBC__ >= 2
	993	LIBC=gnu
	994	# else
	995	LIBC=gnulibc1
	996	# endif
	997	# else
	998	LIBC=gnulibc1
	999	# endif
	1000	#else
	1001	#if defined(__INTEL_COMPILER) \|\| defined(__PGI) \|\| defined(__SUNPRO_C) \|\| defined(__SUNPRO_CC)
	1002	LIBC=gnu
	1003	#else
	1004	LIBC=gnuaout
	1005	#endif
	1006	#endif
	1007	#ifdef __dietlibc__
	1008	LIBC=dietlibc
	1009	#endif
	1010	EOF
	1011	eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null \| sed -n '
	1012	/^LIBC/{
	1013	s: ::g
	1014	p
	1015	}'`"
	1016	test x"${LIBC}" != x && {
	1017	echo "${UNAME_MACHINE}-pc-linux-${LIBC}"
	1018	exit
	1019	}
	1020	test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; }
	1021	;;
	1022	i86:DYNIX/ptx:4:*)
	1023	# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.
	1024	# earlier versions are messed up and put the nodename in both
	1025	# sysname and nodename.
	1026	echo i386-sequent-sysv4
	1027	exit ;;
	1028	i86:UNIX_SV:4.2MP:2.)
	1029	# Unixware is an offshoot of SVR4, but it has its own version
	1030	# number series starting with 2...
	1031	# I am not positive that other SVR4 systems won't match this,
	1032	# I just have to hope. -- rms.
	1033	# Use sysv4.2uw... so that sysv4* matches it.
	1034	echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}
	1035	exit ;;
	1036	i86:OS/2::*)
	1037	# If we were able to find `uname', then EMX Unix compatibility
	1038	# is probably installed.
	1039	echo ${UNAME_MACHINE}-pc-os2-emx
	1040	exit ;;
	1041	i86:XTS-300::STOP)
	1042	echo ${UNAME_MACHINE}-unknown-stop
	1043	exit ;;
	1044	i86:atheos::*)
	1045	echo ${UNAME_MACHINE}-unknown-atheos
	1046	exit ;;
	1047	i86:syllable::*)
	1048	echo ${UNAME_MACHINE}-pc-syllable
	1049	exit ;;
	1050	i86:LynxOS:2.:* \| i86:LynxOS:3.[01]:* \| i86:LynxOS:4.0:*)
	1051	echo i386-unknown-lynxos${UNAME_RELEASE}
	1052	exit ;;
	1053	i86:DOS::)
	1054	echo ${UNAME_MACHINE}-pc-msdosdjgpp
	1055	exit ;;
	1056	i86::4.: \| i86:SYSTEM_V:4.:*)
	1057	UNAME_REL=`echo ${UNAME_RELEASE} \| sed 's/\/MP$//'`
	1058	if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then
	1059	echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}
	1060	else
	1061	echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}
	1062	fi
	1063	exit ;;
	1064	i86::5:[678]*)
	1065	# UnixWare 7.x, OpenUNIX and OpenServer 6.
	1066	case `/bin/uname -X \| grep "^Machine"` in
	1067	486) UNAME_MACHINE=i486 ;;
	1068	*Pentium) UNAME_MACHINE=i586 ;;
	1069	Pent\|*Celeron) UNAME_MACHINE=i686 ;;
	1070	esac
	1071	echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}
	1072	exit ;;
	1073	i86::3.2:*)
	1074	if test -f /usr/options/cb.name; then
	1075	UNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`
	1076	echo ${UNAME_MACHINE}-pc-isc$UNAME_REL
	1077	elif /bin/uname -X 2>/dev/null >/dev/null ; then
	1078	UNAME_REL=`(/bin/uname -X\|grep Release\|sed -e 's/.*= //')`
	1079	(/bin/uname -X\|grep i80486 >/dev/null) && UNAME_MACHINE=i486
	1080	(/bin/uname -X\|grep '^Machine.*Pentium' >/dev/null) \
	1081	&& UNAME_MACHINE=i586
	1082	(/bin/uname -X\|grep '^Machine.Pent II' >/dev/null) \
	1083	&& UNAME_MACHINE=i686
	1084	(/bin/uname -X\|grep '^Machine.*Pentium Pro' >/dev/null) \
	1085	&& UNAME_MACHINE=i686
	1086	echo ${UNAME_MACHINE}-pc-sco$UNAME_REL
	1087	else
	1088	echo ${UNAME_MACHINE}-pc-sysv32
	1089	fi
	1090	exit ;;
	1091	pc:::*)
	1092	# Left here for compatibility:
	1093	# uname -m prints for DJGPP always 'pc', but it prints nothing about
	1094	# the processor, so we play safe by assuming i386.
	1095	echo i386-pc-msdosdjgpp
	1096	exit ;;
	1097	Intel:Mach:3:)
	1098	echo i386-pc-mach3
	1099	exit ;;
	1100	paragon:::*)
	1101	echo i860-intel-osf1
	1102	exit ;;
	1103	i860::4.:*) # i860-SVR4
	1104	if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then
	1105	echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4
	1106	else # Add other i860-SVR4 vendors below as they are discovered.
	1107	echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4
	1108	fi
	1109	exit ;;
	1110	mini:CTIX:SYS5:*)
	1111	# "miniframe"
	1112	echo m68010-convergent-sysv
	1113	exit ;;
	1114	mc68k:UNIX:SYSTEM5:3.51m)
	1115	echo m68k-convergent-sysv
	1116	exit ;;
	1117	M680?0:D-NIX:5.3:*)
	1118	echo m68k-diab-dnix
	1119	exit ;;
	1120	M68::R3V[5678]:)
	1121	test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;
	1122	3[345]??::4.0:3.0 \| 3[34]??A::4.0:3.0 \| 3[34]??,::4.0:3.0 \| 3[34]??/::4.0:3.0 \| 4400::4.0:3.0 \| 4850::4.0:3.0 \| SKA40::4.0:3.0 \| SDS2::4.0:3.0 \| SHG2::4.0:3.0 \| S7501:*:4.0:3.0)
	1123	OS_REL=''
	1124	test -r /etc/.relid \
	1125	&& OS_REL=.`sed -n 's/[^ ]* [^ ]* $[0-9][0-9]$.*/\1/p' < /etc/.relid`
	1126	/bin/uname -p 2>/dev/null \| grep 86 >/dev/null \
	1127	&& { echo i486-ncr-sysv4.3${OS_REL}; exit; }
	1128	/bin/uname -p 2>/dev/null \| /bin/grep entium >/dev/null \
	1129	&& { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
	1130	3[34]??::4.0: \| 3[34]??,::4.0:*)
	1131	/bin/uname -p 2>/dev/null \| grep 86 >/dev/null \
	1132	&& { echo i486-ncr-sysv4; exit; } ;;
	1133	m68:LynxOS:2.:* \| m68:LynxOS:3.0:*)
	1134	echo m68k-unknown-lynxos${UNAME_RELEASE}
	1135	exit ;;
	1136	mc68030:UNIX_System_V:4.:)
	1137	echo m68k-atari-sysv4
	1138	exit ;;
	1139	TSUNAMI:LynxOS:2.:)
	1140	echo sparc-unknown-lynxos${UNAME_RELEASE}
	1141	exit ;;
	1142	rs6000:LynxOS:2.:)
	1143	echo rs6000-unknown-lynxos${UNAME_RELEASE}
	1144	exit ;;
	1145	PowerPC:LynxOS:2.: \| PowerPC:LynxOS:3.[01]: \| PowerPC:LynxOS:4.0:)
	1146	echo powerpc-unknown-lynxos${UNAME_RELEASE}
	1147	exit ;;
	1148	SM[BE]S:UNIX_SV::)
	1149	echo mips-dde-sysv${UNAME_RELEASE}
	1150	exit ;;
	1151	RM:ReliantUNIX-::)
	1152	echo mips-sni-sysv4
	1153	exit ;;
	1154	RM:SINIX-::)
	1155	echo mips-sni-sysv4
	1156	exit ;;
	1157	:SINIX-::)
	1158	if uname -p 2>/dev/null >/dev/null ; then
	1159	UNAME_MACHINE=`(uname -p) 2>/dev/null`
	1160	echo ${UNAME_MACHINE}-sni-sysv4
	1161	else
	1162	echo ns32k-sni-sysv
	1163	fi
	1164	exit ;;
	1165	PENTIUM::4.0:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort
	1166	# says <Richard.M.Bartel@ccMail.Census.GOV>
	1167	echo i586-unisys-sysv4
	1168	exit ;;
	1169	:UNIX_System_V:4:FTX*)
	1170	# From Gerald Hewes <hewes@openmarket.com>.
	1171	# How about differentiating between stratus architectures? -djm
	1172	echo hppa1.1-stratus-sysv4
	1173	exit ;;
	1174	:::FTX)
	1175	# From seanf@swdc.stratus.com.
	1176	echo i860-stratus-sysv4
	1177	exit ;;
	1178	i86:VOS::*)
	1179	# From Paul.Green@stratus.com.
	1180	echo ${UNAME_MACHINE}-stratus-vos
	1181	exit ;;
	1182	:VOS::*)
	1183	# From Paul.Green@stratus.com.
	1184	echo hppa1.1-stratus-vos
	1185	exit ;;
	1186	mc68:A/UX::*)
	1187	echo m68k-apple-aux${UNAME_RELEASE}
	1188	exit ;;
	1189	news:NEWS-OS:6:*)
	1190	echo mips-sony-newsos6
	1191	exit ;;
	1192	R[34]000:System_V:: \| R4000:UNIX_SYSV:: \| R000:UNIX_SV::*)
	1193	if [ -d /usr/nec ]; then
	1194	echo mips-nec-sysv${UNAME_RELEASE}
	1195	else
	1196	echo mips-unknown-sysv${UNAME_RELEASE}
	1197	fi
	1198	exit ;;
	1199	BeBox:BeOS::) # BeOS running on hardware made by Be, PPC only.
	1200	echo powerpc-be-beos
	1201	exit ;;
	1202	BeMac:BeOS::) # BeOS running on Mac or Mac clone, PPC only.
	1203	echo powerpc-apple-beos
	1204	exit ;;
	1205	BePC:BeOS::) # BeOS running on Intel PC compatible.
	1206	echo i586-pc-beos
	1207	exit ;;
	1208	SX-4:SUPER-UX::)
	1209	echo sx4-nec-superux${UNAME_RELEASE}
	1210	exit ;;
	1211	SX-5:SUPER-UX::)
	1212	echo sx5-nec-superux${UNAME_RELEASE}
	1213	exit ;;
	1214	SX-6:SUPER-UX::)
	1215	echo sx6-nec-superux${UNAME_RELEASE}
	1216	exit ;;
	1217	SX-7:SUPER-UX::)
	1218	echo sx7-nec-superux${UNAME_RELEASE}
	1219	exit ;;
	1220	SX-8:SUPER-UX::)
	1221	echo sx8-nec-superux${UNAME_RELEASE}
	1222	exit ;;
	1223	SX-8R:SUPER-UX::)
	1224	echo sx8r-nec-superux${UNAME_RELEASE}
	1225	exit ;;
	1226	Power:Rhapsody::*)
	1227	echo powerpc-apple-rhapsody${UNAME_RELEASE}
	1228	exit ;;
	1229	:Rhapsody::*)
	1230	echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}
	1231	exit ;;
	1232	:Darwin::*)
	1233	UNAME_PROCESSOR=`uname -p` \|\| UNAME_PROCESSOR=unknown
	1234	case $UNAME_PROCESSOR in
	1235	unknown) UNAME_PROCESSOR=powerpc ;;
	1236	esac
	1237	echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}
	1238	exit ;;
	1239	:procnto:: \| :QNX:[0123456789]:*)
	1240	UNAME_PROCESSOR=`uname -p`
	1241	if test "$UNAME_PROCESSOR" = "x86"; then
	1242	UNAME_PROCESSOR=i386
	1243	UNAME_MACHINE=pc
	1244	fi
	1245	echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}
	1246	exit ;;
	1247	:QNX::4*)
	1248	echo i386-pc-qnx
	1249	exit ;;
	1250	NSE-?:NONSTOP_KERNEL::)
	1251	echo nse-tandem-nsk${UNAME_RELEASE}
	1252	exit ;;
	1253	NSR-?:NONSTOP_KERNEL::)
	1254	echo nsr-tandem-nsk${UNAME_RELEASE}
	1255	exit ;;
	1256	:NonStop-UX::*)
	1257	echo mips-compaq-nonstopux
	1258	exit ;;
	1259	BS2000:POSIX::*)
	1260	echo bs2000-siemens-sysv
	1261	exit ;;
	1262	DS/:UNIX_System_V::*)
	1263	echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}
	1264	exit ;;
	1265	:Plan9::*)
	1266	# "uname -m" is not consistent, so use $cputype instead. 386
	1267	# is converted to i386 for consistency with other x86
	1268	# operating systems.
	1269	if test "$cputype" = "386"; then
	1270	UNAME_MACHINE=i386
	1271	else
	1272	UNAME_MACHINE="$cputype"
	1273	fi
	1274	echo ${UNAME_MACHINE}-unknown-plan9
	1275	exit ;;
	1276	:TOPS-10::*)
	1277	echo pdp10-unknown-tops10
	1278	exit ;;
	1279	:TENEX::*)
	1280	echo pdp10-unknown-tenex
	1281	exit ;;
	1282	KS10:TOPS-20:: \| KL10:TOPS-20:: \| TYPE4:TOPS-20::)
	1283	echo pdp10-dec-tops20
	1284	exit ;;
	1285	XKL-1:TOPS-20:: \| TYPE5:TOPS-20::)
	1286	echo pdp10-xkl-tops20
	1287	exit ;;
	1288	:TOPS-20::*)
	1289	echo pdp10-unknown-tops20
	1290	exit ;;
	1291	:ITS::*)
	1292	echo pdp10-unknown-its
	1293	exit ;;
	1294	SEI:::SEIUX)
	1295	echo mips-sei-seiux${UNAME_RELEASE}
	1296	exit ;;
	1297	:DragonFly::*)
	1298	echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}\|sed -e 's/[-(].*//'`
	1299	exit ;;
	1300	:VMS::)
	1301	UNAME_MACHINE=`(uname -p) 2>/dev/null`
	1302	case "${UNAME_MACHINE}" in
	1303	A*) echo alpha-dec-vms ; exit ;;
	1304	I*) echo ia64-dec-vms ; exit ;;
	1305	V*) echo vax-dec-vms ; exit ;;
	1306	esac ;;
	1307	:XENIX::SysV)
	1308	echo i386-pc-xenix
	1309	exit ;;
	1310	i86:skyos::*)
	1311	echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` \| sed -e 's/ .*$//'
	1312	exit ;;
	1313	i86:rdos::*)
	1314	echo ${UNAME_MACHINE}-pc-rdos
	1315	exit ;;
	1316	esac
	1317
	1318	#echo '(No uname command or uname output not recognized.)' 1>&2
	1319	#echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2
	1320
	1321	eval $set_cc_for_build
	1322	cat >$dummy.c <<EOF
	1323	#ifdef _SEQUENT_
	1324	# include <sys/types.h>
	1325	# include <sys/utsname.h>
	1326	#endif
	1327	main ()
	1328	{
	1329	#if defined (sony)
	1330	#if defined (MIPSEB)
	1331	/* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed,
	1332	I don't know.... */
	1333	printf ("mips-sony-bsd\n"); exit (0);
	1334	#else
	1335	#include <sys/param.h>
	1336	printf ("m68k-sony-newsos%s\n",
	1337	#ifdef NEWSOS4
	1338	"4"
	1339	#else
	1340	""
	1341	#endif
	1342	); exit (0);
	1343	#endif
	1344	#endif
	1345
	1346	#if defined (__arm) && defined (__acorn) && defined (__unix)
	1347	printf ("arm-acorn-riscix\n"); exit (0);
	1348	#endif
	1349
	1350	#if defined (hp300) && !defined (hpux)
	1351	printf ("m68k-hp-bsd\n"); exit (0);
	1352	#endif
	1353
	1354	#if defined (NeXT)
	1355	#if !defined (__ARCHITECTURE__)
	1356	#define __ARCHITECTURE__ "m68k"
	1357	#endif
	1358	int version;
	1359	version=`(hostinfo \| sed -n 's/.NeXT Mach $[0-9]$.*/\1/p') 2>/dev/null`;
	1360	if (version < 4)
	1361	printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version);
	1362	else
	1363	printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version);
	1364	exit (0);
	1365	#endif
	1366
	1367	#if defined (MULTIMAX) \|\| defined (n16)
	1368	#if defined (UMAXV)
	1369	printf ("ns32k-encore-sysv\n"); exit (0);
	1370	#else
	1371	#if defined (CMU)
	1372	printf ("ns32k-encore-mach\n"); exit (0);
	1373	#else
	1374	printf ("ns32k-encore-bsd\n"); exit (0);
	1375	#endif
	1376	#endif
	1377	#endif
	1378
	1379	#if defined (__386BSD__)
	1380	printf ("i386-pc-bsd\n"); exit (0);
	1381	#endif
	1382
	1383	#if defined (sequent)
	1384	#if defined (i386)
	1385	printf ("i386-sequent-dynix\n"); exit (0);
	1386	#endif
	1387	#if defined (ns32000)
	1388	printf ("ns32k-sequent-dynix\n"); exit (0);
	1389	#endif
	1390	#endif
	1391
	1392	#if defined (_SEQUENT_)
	1393	struct utsname un;
	1394
	1395	uname(&un);
	1396
	1397	if (strncmp(un.version, "V2", 2) == 0) {
	1398	printf ("i386-sequent-ptx2\n"); exit (0);
	1399	}
	1400	if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */
	1401	printf ("i386-sequent-ptx1\n"); exit (0);
	1402	}
	1403	printf ("i386-sequent-ptx\n"); exit (0);
	1404
	1405	#endif
	1406
	1407	#if defined (vax)
	1408	# if !defined (ultrix)
	1409	# include <sys/param.h>
	1410	# if defined (BSD)
	1411	# if BSD == 43
	1412	printf ("vax-dec-bsd4.3\n"); exit (0);
	1413	# else
	1414	# if BSD == 199006
	1415	printf ("vax-dec-bsd4.3reno\n"); exit (0);
	1416	# else
	1417	printf ("vax-dec-bsd\n"); exit (0);
	1418	# endif
	1419	# endif
	1420	# else
	1421	printf ("vax-dec-bsd\n"); exit (0);
	1422	# endif
	1423	# else
	1424	printf ("vax-dec-ultrix\n"); exit (0);
	1425	# endif
	1426	#endif
	1427
	1428	#if defined (alliant) && defined (i860)
	1429	printf ("i860-alliant-bsd\n"); exit (0);
	1430	#endif
	1431
	1432	exit (1);
	1433	}
	1434	EOF
	1435
	1436	$CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` &&
	1437	{ echo "$SYSTEM_NAME"; exit; }
	1438
	1439	# Apollos put the system type in the environment.
	1440
	1441	test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; }
	1442
	1443	# Convex versions that predate uname can use getsysinfo(1)
	1444
	1445	if [ -x /usr/convex/getsysinfo ]
	1446	then
	1447	case `getsysinfo -f cpu_type` in
	1448	c1*)
	1449	echo c1-convex-bsd
	1450	exit ;;
	1451	c2*)
	1452	if getsysinfo -f scalar_acc
	1453	then echo c32-convex-bsd
	1454	else echo c2-convex-bsd
	1455	fi
	1456	exit ;;
	1457	c34*)
	1458	echo c34-convex-bsd
	1459	exit ;;
	1460	c38*)
	1461	echo c38-convex-bsd
	1462	exit ;;
	1463	c4*)
	1464	echo c4-convex-bsd
	1465	exit ;;
	1466	esac
	1467	fi
	1468
	1469	cat >&2 <<EOF
	1470	$0: unable to guess system type
	1471
	1472	This script, last modified $timestamp, has failed to recognize
	1473	the operating system you are using. It is advised that you
	1474	download the most up to date version of the config scripts from
	1475
	1476	http://savannah.gnu.org/cgi-bin/viewcvs/checkout/config/config/config.guess
	1477	and
	1478	http://savannah.gnu.org/cgi-bin/viewcvs/checkout/config/config/config.sub
	1479
	1480	If the version you run ($0) is already up to date, please
	1481	send the following data and any information you think might be
	1482	pertinent to <config-patches@gnu.org> in order to provide the needed
	1483	information to handle your system.
	1484
	1485	config.guess timestamp = $timestamp
	1486
	1487	uname -m = `(uname -m) 2>/dev/null \|\| echo unknown`
	1488	uname -r = `(uname -r) 2>/dev/null \|\| echo unknown`
	1489	uname -s = `(uname -s) 2>/dev/null \|\| echo unknown`
	1490	uname -v = `(uname -v) 2>/dev/null \|\| echo unknown`
	1491
	1492	/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`
	1493	/bin/uname -X = `(/bin/uname -X) 2>/dev/null`
	1494
	1495	hostinfo = `(hostinfo) 2>/dev/null`
	1496	/bin/universe = `(/bin/universe) 2>/dev/null`
	1497	/usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null`
	1498	/bin/arch = `(/bin/arch) 2>/dev/null`
	1499	/usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null`
	1500	/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`
	1501
	1502	UNAME_MACHINE = ${UNAME_MACHINE}
	1503	UNAME_RELEASE = ${UNAME_RELEASE}
	1504	UNAME_SYSTEM = ${UNAME_SYSTEM}
	1505	UNAME_VERSION = ${UNAME_VERSION}
	1506	EOF
	1507
	1508	exit 1
	1509
	1510	# Local variables:
	1511	# eval: (add-hook 'write-file-hooks 'time-stamp)
	1512	# time-stamp-start: "timestamp='"
	1513	# time-stamp-format: "%:y-%02m-%02d"
	1514	# time-stamp-end: "'"
	1515	# End:

+1626

-0

config.sub less more

	0	#! /bin/sh
	1	# Configuration validation subroutine script.
	2	# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
	3	# 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation,
	4	# Inc.
	5
	6	timestamp='2007-04-29'
	7
	8	# This file is (in principle) common to ALL GNU software.
	9	# The presence of a machine in this file suggests that SOME GNU software
	10	# can handle that machine. It does not imply ALL GNU software can.
	11	#
	12	# This file is free software; you can redistribute it and/or modify
	13	# it under the terms of the GNU General Public License as published by
	14	# the Free Software Foundation; either version 2 of the License, or
	15	# (at your option) any later version.
	16	#
	17	# This program 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 General Public License for more details.
	21	#
	22	# You should have received a copy of the GNU General Public License
	23	# along with this program; if not, write to the Free Software
	24	# Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
	25	# 02110-1301, USA.
	26	#
	27	# As a special exception to the GNU General Public License, if you
	28	# distribute this file as part of a program that contains a
	29	# configuration script generated by Autoconf, you may include it under
	30	# the same distribution terms that you use for the rest of that program.
	31
	32
	33	# Please send patches to <config-patches@gnu.org>. Submit a context
	34	# diff and a properly formatted ChangeLog entry.
	35	#
	36	# Configuration subroutine to validate and canonicalize a configuration type.
	37	# Supply the specified configuration type as an argument.
	38	# If it is invalid, we print an error message on stderr and exit with code 1.
	39	# Otherwise, we print the canonical config type on stdout and succeed.
	40
	41	# This file is supposed to be the same for all GNU packages
	42	# and recognize all the CPU types, system types and aliases
	43	# that are meaningful with any GNU software.
	44	# Each package is responsible for reporting which valid configurations
	45	# it does not support. The user should be able to distinguish
	46	# a failure to support a valid configuration from a meaningless
	47	# configuration.
	48
	49	# The goal of this file is to map all the various variations of a given
	50	# machine specification into a single specification in the form:
	51	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM
	52	# or in some cases, the newer four-part form:
	53	# CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM
	54	# It is wrong to echo any other type of specification.
	55
	56	me=`echo "$0" \| sed -e 's,.*/,,'`
	57
	58	usage="\
	59	Usage: $0 [OPTION] CPU-MFR-OPSYS
	60	$0 [OPTION] ALIAS
	61
	62	Canonicalize a configuration name.
	63
	64	Operation modes:
	65	-h, --help print this help, then exit
	66	-t, --time-stamp print date of last modification, then exit
	67	-v, --version print version number, then exit
	68
	69	Report bugs and patches to <config-patches@gnu.org>."
	70
	71	version="\
	72	GNU config.sub ($timestamp)
	73
	74	Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
	75	Free Software Foundation, Inc.
	76
	77	This is free software; see the source for copying conditions. There is NO
	78	warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
	79
	80	help="
	81	Try \`$me --help' for more information."
	82
	83	# Parse command line
	84	while test $# -gt 0 ; do
	85	case $1 in
	86	--time-stamp \| --time* \| -t )
	87	echo "$timestamp" ; exit ;;
	88	--version \| -v )
	89	echo "$version" ; exit ;;
	90	--help \| --h* \| -h )
	91	echo "$usage"; exit ;;
	92	-- ) # Stop option processing
	93	shift; break ;;
	94	- ) # Use stdin as input.
	95	break ;;
	96	-* )
	97	echo "$me: invalid option $1$help"
	98	exit 1 ;;
	99
	100	local)
	101	# First pass through any local machine types.
	102	echo $1
	103	exit ;;
	104
	105	* )
	106	break ;;
	107	esac
	108	done
	109
	110	case $# in
	111	0) echo "$me: missing argument$help" >&2
	112	exit 1;;
	113	1) ;;
	114	*) echo "$me: too many arguments$help" >&2
	115	exit 1;;
	116	esac
	117
	118	# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any).
	119	# Here we must recognize all the valid KERNEL-OS combinations.
	120	maybe_os=`echo $1 \| sed 's/^$.$-$[^-]-[^-]*$$/\2/'`
	121	case $maybe_os in
	122	nto-qnx* \| linux-gnu* \| linux-dietlibc \| linux-newlib* \| linux-uclibc* \| \
	123	uclinux-uclibc* \| uclinux-gnu* \| kfreebsd-gnu \| knetbsd-gnu \| netbsd-gnu \| \
	124	storm-chaos* \| os2-emx* \| rtmk-nova*)
	125	os=-$maybe_os
	126	basic_machine=`echo $1 \| sed 's/^$.$-$[^-]-[^-]*$$/\1/'`
	127	;;
	128	*)
	129	basic_machine=`echo $1 \| sed 's/-[^-]*$//'`
	130	if [ $basic_machine != $1 ]
	131	then os=`echo $1 \| sed 's/.*-/-/'`
	132	else os=; fi
	133	;;
	134	esac
	135
	136	### Let's recognize common machines as not being operating systems so
	137	### that things like config.sub decstation-3100 work. We also
	138	### recognize some manufacturers as not being operating systems, so we
	139	### can provide default operating systems below.
	140	case $os in
	141	-sunos)
	142	# Prevent following clause from handling this invalid input.
	143	;;
	144	-dec* \| -mips* \| -sequent* \| -encore* \| -pc532* \| -sgi* \| -sony* \| \
	145	-att* \| -7300* \| -3300* \| -delta* \| -motorola* \| -sun[234]* \| \
	146	-unicom* \| -ibm* \| -next \| -hp \| -isi* \| -apollo \| -altos* \| \
	147	-convergent* \| -ncr* \| -news \| -32* \| -3600* \| -3100* \| -hitachi* \|\
	148	-c[123]* \| -convex* \| -sun \| -crds \| -omron* \| -dg \| -ultra \| -tti* \| \
	149	-harris \| -dolphin \| -highlevel \| -gould \| -cbm \| -ns \| -masscomp \| \
	150	-apple \| -axis \| -knuth \| -cray)
	151	os=
	152	basic_machine=$1
	153	;;
	154	-sim \| -cisco \| -oki \| -wec \| -winbond)
	155	os=
	156	basic_machine=$1
	157	;;
	158	-scout)
	159	;;
	160	-wrs)
	161	os=-vxworks
	162	basic_machine=$1
	163	;;
	164	-chorusos*)
	165	os=-chorusos
	166	basic_machine=$1
	167	;;
	168	-chorusrdb)
	169	os=-chorusrdb
	170	basic_machine=$1
	171	;;
	172	-hiux*)
	173	os=-hiuxwe2
	174	;;
	175	-sco6)
	176	os=-sco5v6
	177	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	178	;;
	179	-sco5)
	180	os=-sco3.2v5
	181	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	182	;;
	183	-sco4)
	184	os=-sco3.2v4
	185	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	186	;;
	187	-sco3.2.[4-9]*)
	188	os=`echo $os \| sed -e 's/sco3.2./sco3.2v/'`
	189	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	190	;;
	191	-sco3.2v[4-9]*)
	192	# Don't forget version if it is 3.2v4 or newer.
	193	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	194	;;
	195	-sco5v6*)
	196	# Don't forget version if it is 3.2v4 or newer.
	197	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	198	;;
	199	-sco*)
	200	os=-sco3.2v2
	201	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	202	;;
	203	-udk*)
	204	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	205	;;
	206	-isc)
	207	os=-isc2.2
	208	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	209	;;
	210	-clix*)
	211	basic_machine=clipper-intergraph
	212	;;
	213	-isc*)
	214	basic_machine=`echo $1 \| sed -e 's/86-.*/86-pc/'`
	215	;;
	216	-lynx*)
	217	os=-lynxos
	218	;;
	219	-ptx*)
	220	basic_machine=`echo $1 \| sed -e 's/86-.*/86-sequent/'`
	221	;;
	222	-windowsnt*)
	223	os=`echo $os \| sed -e 's/windowsnt/winnt/'`
	224	;;
	225	-psos*)
	226	os=-psos
	227	;;
	228	-mint \| -mint[0-9]*)
	229	basic_machine=m68k-atari
	230	os=-mint
	231	;;
	232	esac
	233
	234	# Decode aliases for certain CPU-COMPANY combinations.
	235	case $basic_machine in
	236	# Recognize the basic CPU types without company name.
	237	# Some are omitted here because they have special meanings below.
	238	1750a \| 580 \
	239	\| a29k \
	240	\| alpha \| alphaev[4-8] \| alphaev56 \| alphaev6[78] \| alphapca5[67] \
	241	\| alpha64 \| alpha64ev[4-8] \| alpha64ev56 \| alpha64ev6[78] \| alpha64pca5[67] \
	242	\| am33_2.0 \
	243	\| arc \| arm \| arm[bl]e \| arme[lb] \| armv[2345] \| armv[345][lb] \| avr \| avr32 \
	244	\| bfin \
	245	\| c4x \| clipper \
	246	\| d10v \| d30v \| dlx \| dsp16xx \
	247	\| fido \| fr30 \| frv \
	248	\| h8300 \| h8500 \| hppa \| hppa1.[01] \| hppa2.0 \| hppa2.0[nw] \| hppa64 \
	249	\| i370 \| i860 \| i960 \| ia64 \
	250	\| ip2k \| iq2000 \
	251	\| m32c \| m32r \| m32rle \| m68000 \| m68k \| m88k \
	252	\| maxq \| mb \| microblaze \| mcore \| mep \
	253	\| mips \| mipsbe \| mipseb \| mipsel \| mipsle \
	254	\| mips16 \
	255	\| mips64 \| mips64el \
	256	\| mips64vr \| mips64vrel \
	257	\| mips64orion \| mips64orionel \
	258	\| mips64vr4100 \| mips64vr4100el \
	259	\| mips64vr4300 \| mips64vr4300el \
	260	\| mips64vr5000 \| mips64vr5000el \
	261	\| mips64vr5900 \| mips64vr5900el \
	262	\| mipsisa32 \| mipsisa32el \
	263	\| mipsisa32r2 \| mipsisa32r2el \
	264	\| mipsisa64 \| mipsisa64el \
	265	\| mipsisa64r2 \| mipsisa64r2el \
	266	\| mipsisa64sb1 \| mipsisa64sb1el \
	267	\| mipsisa64sr71k \| mipsisa64sr71kel \
	268	\| mipstx39 \| mipstx39el \
	269	\| mn10200 \| mn10300 \
	270	\| mt \
	271	\| msp430 \
	272	\| nios \| nios2 \
	273	\| ns16k \| ns32k \
	274	\| or32 \
	275	\| pdp10 \| pdp11 \| pj \| pjl \
	276	\| powerpc \| powerpc64 \| powerpc64le \| powerpcle \| ppcbe \
	277	\| pyramid \
	278	\| score \
	279	\| sh \| sh[1234] \| sh[24]a \| sh[23]e \| sh[34]eb \| sheb \| shbe \| shle \| sh[1234]le \| sh3ele \
	280	\| sh64 \| sh64le \
	281	\| sparc \| sparc64 \| sparc64b \| sparc64v \| sparc86x \| sparclet \| sparclite \
	282	\| sparcv8 \| sparcv9 \| sparcv9b \| sparcv9v \
	283	\| spu \| strongarm \
	284	\| tahoe \| thumb \| tic4x \| tic80 \| tron \
	285	\| v850 \| v850e \
	286	\| we32k \
	287	\| x86 \| xc16x \| xscale \| xscalee[bl] \| xstormy16 \| xtensa \
	288	\| z8k)
	289	basic_machine=$basic_machine-unknown
	290	;;
	291	m6811 \| m68hc11 \| m6812 \| m68hc12)
	292	# Motorola 68HC11/12.
	293	basic_machine=$basic_machine-unknown
	294	os=-none
	295	;;
	296	m88110 \| m680[12346]0 \| m683?2 \| m68360 \| m5200 \| v70 \| w65 \| z8k)
	297	;;
	298	ms1)
	299	basic_machine=mt-unknown
	300	;;
	301
	302	# We use `pc' rather than `unknown'
	303	# because (1) that's what they normally are, and
	304	# (2) the word "unknown" tends to confuse beginning users.
	305	i*86 \| x86_64)
	306	basic_machine=$basic_machine-pc
	307	;;
	308	# Object if more than one company name word.
	309	--*)
	310	echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
	311	exit 1
	312	;;
	313	# Recognize the basic CPU types with company name.
	314	580-* \
	315	\| a29k-* \
	316	\| alpha-* \| alphaev[4-8]-* \| alphaev56-* \| alphaev6[78]-* \
	317	\| alpha64-* \| alpha64ev[4-8]-* \| alpha64ev56-* \| alpha64ev6[78]-* \
	318	\| alphapca5[67]-* \| alpha64pca5[67]-* \| arc-* \
	319	\| arm-* \| armbe-* \| armle-* \| armeb-* \| armv- \
	320	\| avr-* \| avr32-* \
	321	\| bfin-* \| bs2000-* \
	322	\| c[123]* \| c30-* \| [cjt]90-* \| c4x-* \| c54x-* \| c55x-* \| c6x-* \
	323	\| clipper-* \| craynv-* \| cydra-* \
	324	\| d10v-* \| d30v-* \| dlx-* \
	325	\| elxsi-* \
	326	\| f30[01]-* \| f700-* \| fido-* \| fr30-* \| frv-* \| fx80-* \
	327	\| h8300-* \| h8500-* \
	328	\| hppa-* \| hppa1.[01]-* \| hppa2.0-* \| hppa2.0[nw]-* \| hppa64-* \
	329	\| i86- \| i860-* \| i960-* \| ia64-* \
	330	\| ip2k-* \| iq2000-* \
	331	\| m32c-* \| m32r-* \| m32rle-* \
	332	\| m68000-* \| m680[012346]0-* \| m68360-* \| m683?2-* \| m68k-* \
	333	\| m88110-* \| m88k-* \| maxq-* \| mcore-* \
	334	\| mips-* \| mipsbe-* \| mipseb-* \| mipsel-* \| mipsle-* \
	335	\| mips16-* \
	336	\| mips64-* \| mips64el-* \
	337	\| mips64vr-* \| mips64vrel-* \
	338	\| mips64orion-* \| mips64orionel-* \
	339	\| mips64vr4100-* \| mips64vr4100el-* \
	340	\| mips64vr4300-* \| mips64vr4300el-* \
	341	\| mips64vr5000-* \| mips64vr5000el-* \
	342	\| mips64vr5900-* \| mips64vr5900el-* \
	343	\| mipsisa32-* \| mipsisa32el-* \
	344	\| mipsisa32r2-* \| mipsisa32r2el-* \
	345	\| mipsisa64-* \| mipsisa64el-* \
	346	\| mipsisa64r2-* \| mipsisa64r2el-* \
	347	\| mipsisa64sb1-* \| mipsisa64sb1el-* \
	348	\| mipsisa64sr71k-* \| mipsisa64sr71kel-* \
	349	\| mipstx39-* \| mipstx39el-* \
	350	\| mmix-* \
	351	\| mt-* \
	352	\| msp430-* \
	353	\| nios-* \| nios2-* \
	354	\| none-* \| np1-* \| ns16k-* \| ns32k-* \
	355	\| orion-* \
	356	\| pdp10-* \| pdp11-* \| pj-* \| pjl-* \| pn-* \| power-* \
	357	\| powerpc-* \| powerpc64-* \| powerpc64le-* \| powerpcle-* \| ppcbe-* \
	358	\| pyramid-* \
	359	\| romp-* \| rs6000-* \
	360	\| sh-* \| sh[1234]-* \| sh[24]a-* \| sh[23]e-* \| sh[34]eb-* \| sheb-* \| shbe-* \
	361	\| shle-* \| sh[1234]le-* \| sh3ele-* \| sh64-* \| sh64le-* \
	362	\| sparc-* \| sparc64-* \| sparc64b-* \| sparc64v-* \| sparc86x-* \| sparclet-* \
	363	\| sparclite-* \
	364	\| sparcv8-* \| sparcv9-* \| sparcv9b-* \| sparcv9v-* \| strongarm-* \| sv1-* \| sx?-* \
	365	\| tahoe-* \| thumb-* \
	366	\| tic30-* \| tic4x-* \| tic54x-* \| tic55x-* \| tic6x-* \| tic80-* \
	367	\| tron-* \
	368	\| v850-* \| v850e-* \| vax-* \
	369	\| we32k-* \
	370	\| x86-* \| x86_64-* \| xc16x-* \| xps100-* \| xscale-* \| xscalee[bl]-* \
	371	\| xstormy16-* \| xtensa-* \
	372	\| ymp-* \
	373	\| z8k-*)
	374	;;
	375	# Recognize the various machine names and aliases which stand
	376	# for a CPU type and a company and sometimes even an OS.
	377	386bsd)
	378	basic_machine=i386-unknown
	379	os=-bsd
	380	;;
	381	3b1 \| 7300 \| 7300-att \| att-7300 \| pc7300 \| safari \| unixpc)
	382	basic_machine=m68000-att
	383	;;
	384	3b*)
	385	basic_machine=we32k-att
	386	;;
	387	a29khif)
	388	basic_machine=a29k-amd
	389	os=-udi
	390	;;
	391	abacus)
	392	basic_machine=abacus-unknown
	393	;;
	394	adobe68k)
	395	basic_machine=m68010-adobe
	396	os=-scout
	397	;;
	398	alliant \| fx80)
	399	basic_machine=fx80-alliant
	400	;;
	401	altos \| altos3068)
	402	basic_machine=m68k-altos
	403	;;
	404	am29k)
	405	basic_machine=a29k-none
	406	os=-bsd
	407	;;
	408	amd64)
	409	basic_machine=x86_64-pc
	410	;;
	411	amd64-*)
	412	basic_machine=x86_64-`echo $basic_machine \| sed 's/^[^-]*-//'`
	413	;;
	414	amdahl)
	415	basic_machine=580-amdahl
	416	os=-sysv
	417	;;
	418	amiga \| amiga-*)
	419	basic_machine=m68k-unknown
	420	;;
	421	amigaos \| amigados)
	422	basic_machine=m68k-unknown
	423	os=-amigaos
	424	;;
	425	amigaunix \| amix)
	426	basic_machine=m68k-unknown
	427	os=-sysv4
	428	;;
	429	apollo68)
	430	basic_machine=m68k-apollo
	431	os=-sysv
	432	;;
	433	apollo68bsd)
	434	basic_machine=m68k-apollo
	435	os=-bsd
	436	;;
	437	aux)
	438	basic_machine=m68k-apple
	439	os=-aux
	440	;;
	441	balance)
	442	basic_machine=ns32k-sequent
	443	os=-dynix
	444	;;
	445	c90)
	446	basic_machine=c90-cray
	447	os=-unicos
	448	;;
	449	convex-c1)
	450	basic_machine=c1-convex
	451	os=-bsd
	452	;;
	453	convex-c2)
	454	basic_machine=c2-convex
	455	os=-bsd
	456	;;
	457	convex-c32)
	458	basic_machine=c32-convex
	459	os=-bsd
	460	;;
	461	convex-c34)
	462	basic_machine=c34-convex
	463	os=-bsd
	464	;;
	465	convex-c38)
	466	basic_machine=c38-convex
	467	os=-bsd
	468	;;
	469	cray \| j90)
	470	basic_machine=j90-cray
	471	os=-unicos
	472	;;
	473	craynv)
	474	basic_machine=craynv-cray
	475	os=-unicosmp
	476	;;
	477	cr16c)
	478	basic_machine=cr16c-unknown
	479	os=-elf
	480	;;
	481	crds \| unos)
	482	basic_machine=m68k-crds
	483	;;
	484	crisv32 \| crisv32-* \| etraxfs*)
	485	basic_machine=crisv32-axis
	486	;;
	487	cris \| cris-* \| etrax*)
	488	basic_machine=cris-axis
	489	;;
	490	crx)
	491	basic_machine=crx-unknown
	492	os=-elf
	493	;;
	494	da30 \| da30-*)
	495	basic_machine=m68k-da30
	496	;;
	497	decstation \| decstation-3100 \| pmax \| pmax-* \| pmin \| dec3100 \| decstatn)
	498	basic_machine=mips-dec
	499	;;
	500	decsystem10* \| dec10*)
	501	basic_machine=pdp10-dec
	502	os=-tops10
	503	;;
	504	decsystem20* \| dec20*)
	505	basic_machine=pdp10-dec
	506	os=-tops20
	507	;;
	508	delta \| 3300 \| motorola-3300 \| motorola-delta \
	509	\| 3300-motorola \| delta-motorola)
	510	basic_machine=m68k-motorola
	511	;;
	512	delta88)
	513	basic_machine=m88k-motorola
	514	os=-sysv3
	515	;;
	516	djgpp)
	517	basic_machine=i586-pc
	518	os=-msdosdjgpp
	519	;;
	520	dpx20 \| dpx20-*)
	521	basic_machine=rs6000-bull
	522	os=-bosx
	523	;;
	524	dpx2* \| dpx2*-bull)
	525	basic_machine=m68k-bull
	526	os=-sysv3
	527	;;
	528	ebmon29k)
	529	basic_machine=a29k-amd
	530	os=-ebmon
	531	;;
	532	elxsi)
	533	basic_machine=elxsi-elxsi
	534	os=-bsd
	535	;;
	536	encore \| umax \| mmax)
	537	basic_machine=ns32k-encore
	538	;;
	539	es1800 \| OSE68k \| ose68k \| ose \| OSE)
	540	basic_machine=m68k-ericsson
	541	os=-ose
	542	;;
	543	fx2800)
	544	basic_machine=i860-alliant
	545	;;
	546	genix)
	547	basic_machine=ns32k-ns
	548	;;
	549	gmicro)
	550	basic_machine=tron-gmicro
	551	os=-sysv
	552	;;
	553	go32)
	554	basic_machine=i386-pc
	555	os=-go32
	556	;;
	557	h3050r* \| hiux*)
	558	basic_machine=hppa1.1-hitachi
	559	os=-hiuxwe2
	560	;;
	561	h8300hms)
	562	basic_machine=h8300-hitachi
	563	os=-hms
	564	;;
	565	h8300xray)
	566	basic_machine=h8300-hitachi
	567	os=-xray
	568	;;
	569	h8500hms)
	570	basic_machine=h8500-hitachi
	571	os=-hms
	572	;;
	573	harris)
	574	basic_machine=m88k-harris
	575	os=-sysv3
	576	;;
	577	hp300-*)
	578	basic_machine=m68k-hp
	579	;;
	580	hp300bsd)
	581	basic_machine=m68k-hp
	582	os=-bsd
	583	;;
	584	hp300hpux)
	585	basic_machine=m68k-hp
	586	os=-hpux
	587	;;
	588	hp3k9[0-9][0-9] \| hp9[0-9][0-9])
	589	basic_machine=hppa1.0-hp
	590	;;
	591	hp9k2[0-9][0-9] \| hp9k31[0-9])
	592	basic_machine=m68000-hp
	593	;;
	594	hp9k3[2-9][0-9])
	595	basic_machine=m68k-hp
	596	;;
	597	hp9k6[0-9][0-9] \| hp6[0-9][0-9])
	598	basic_machine=hppa1.0-hp
	599	;;
	600	hp9k7[0-79][0-9] \| hp7[0-79][0-9])
	601	basic_machine=hppa1.1-hp
	602	;;
	603	hp9k78[0-9] \| hp78[0-9])
	604	# FIXME: really hppa2.0-hp
	605	basic_machine=hppa1.1-hp
	606	;;
	607	hp9k8[67]1 \| hp8[67]1 \| hp9k80[24] \| hp80[24] \| hp9k8[78]9 \| hp8[78]9 \| hp9k893 \| hp893)
	608	# FIXME: really hppa2.0-hp
	609	basic_machine=hppa1.1-hp
	610	;;
	611	hp9k8[0-9][13679] \| hp8[0-9][13679])
	612	basic_machine=hppa1.1-hp
	613	;;
	614	hp9k8[0-9][0-9] \| hp8[0-9][0-9])
	615	basic_machine=hppa1.0-hp
	616	;;
	617	hppa-next)
	618	os=-nextstep3
	619	;;
	620	hppaosf)
	621	basic_machine=hppa1.1-hp
	622	os=-osf
	623	;;
	624	hppro)
	625	basic_machine=hppa1.1-hp
	626	os=-proelf
	627	;;
	628	i370-ibm* \| ibm*)
	629	basic_machine=i370-ibm
	630	;;
	631	# I'm not sure what "Sysv32" means. Should this be sysv3.2?
	632	i*86v32)
	633	basic_machine=`echo $1 \| sed -e 's/86.*/86-pc/'`
	634	os=-sysv32
	635	;;
	636	i86v4)
	637	basic_machine=`echo $1 \| sed -e 's/86.*/86-pc/'`
	638	os=-sysv4
	639	;;
	640	i*86v)
	641	basic_machine=`echo $1 \| sed -e 's/86.*/86-pc/'`
	642	os=-sysv
	643	;;
	644	i*86sol2)
	645	basic_machine=`echo $1 \| sed -e 's/86.*/86-pc/'`
	646	os=-solaris2
	647	;;
	648	i386mach)
	649	basic_machine=i386-mach
	650	os=-mach
	651	;;
	652	i386-vsta \| vsta)
	653	basic_machine=i386-unknown
	654	os=-vsta
	655	;;
	656	iris \| iris4d)
	657	basic_machine=mips-sgi
	658	case $os in
	659	-irix*)
	660	;;
	661	*)
	662	os=-irix4
	663	;;
	664	esac
	665	;;
	666	isi68 \| isi)
	667	basic_machine=m68k-isi
	668	os=-sysv
	669	;;
	670	m88k-omron*)
	671	basic_machine=m88k-omron
	672	;;
	673	magnum \| m3230)
	674	basic_machine=mips-mips
	675	os=-sysv
	676	;;
	677	merlin)
	678	basic_machine=ns32k-utek
	679	os=-sysv
	680	;;
	681	mingw32)
	682	basic_machine=i386-pc
	683	os=-mingw32
	684	;;
	685	mingw32ce)
	686	basic_machine=arm-unknown
	687	os=-mingw32ce
	688	;;
	689	miniframe)
	690	basic_machine=m68000-convergent
	691	;;
	692	mint \| -mint[0-9] \| MiNT \| MiNT[0-9]*)
	693	basic_machine=m68k-atari
	694	os=-mint
	695	;;
	696	mips3-)
	697	basic_machine=`echo $basic_machine \| sed -e 's/mips3/mips64/'`
	698	;;
	699	mips3*)
	700	basic_machine=`echo $basic_machine \| sed -e 's/mips3/mips64/'`-unknown
	701	;;
	702	monitor)
	703	basic_machine=m68k-rom68k
	704	os=-coff
	705	;;
	706	morphos)
	707	basic_machine=powerpc-unknown
	708	os=-morphos
	709	;;
	710	msdos)
	711	basic_machine=i386-pc
	712	os=-msdos
	713	;;
	714	ms1-*)
	715	basic_machine=`echo $basic_machine \| sed -e 's/ms1-/mt-/'`
	716	;;
	717	mvs)
	718	basic_machine=i370-ibm
	719	os=-mvs
	720	;;
	721	ncr3000)
	722	basic_machine=i486-ncr
	723	os=-sysv4
	724	;;
	725	netbsd386)
	726	basic_machine=i386-unknown
	727	os=-netbsd
	728	;;
	729	netwinder)
	730	basic_machine=armv4l-rebel
	731	os=-linux
	732	;;
	733	news \| news700 \| news800 \| news900)
	734	basic_machine=m68k-sony
	735	os=-newsos
	736	;;
	737	news1000)
	738	basic_machine=m68030-sony
	739	os=-newsos
	740	;;
	741	news-3600 \| risc-news)
	742	basic_machine=mips-sony
	743	os=-newsos
	744	;;
	745	necv70)
	746	basic_machine=v70-nec
	747	os=-sysv
	748	;;
	749	next \| m*-next )
	750	basic_machine=m68k-next
	751	case $os in
	752	-nextstep* )
	753	;;
	754	-ns2*)
	755	os=-nextstep2
	756	;;
	757	*)
	758	os=-nextstep3
	759	;;
	760	esac
	761	;;
	762	nh3000)
	763	basic_machine=m68k-harris
	764	os=-cxux
	765	;;
	766	nh[45]000)
	767	basic_machine=m88k-harris
	768	os=-cxux
	769	;;
	770	nindy960)
	771	basic_machine=i960-intel
	772	os=-nindy
	773	;;
	774	mon960)
	775	basic_machine=i960-intel
	776	os=-mon960
	777	;;
	778	nonstopux)
	779	basic_machine=mips-compaq
	780	os=-nonstopux
	781	;;
	782	np1)
	783	basic_machine=np1-gould
	784	;;
	785	nsr-tandem)
	786	basic_machine=nsr-tandem
	787	;;
	788	op50n-* \| op60c-*)
	789	basic_machine=hppa1.1-oki
	790	os=-proelf
	791	;;
	792	openrisc \| openrisc-*)
	793	basic_machine=or32-unknown
	794	;;
	795	os400)
	796	basic_machine=powerpc-ibm
	797	os=-os400
	798	;;
	799	OSE68000 \| ose68000)
	800	basic_machine=m68000-ericsson
	801	os=-ose
	802	;;
	803	os68k)
	804	basic_machine=m68k-none
	805	os=-os68k
	806	;;
	807	pa-hitachi)
	808	basic_machine=hppa1.1-hitachi
	809	os=-hiuxwe2
	810	;;
	811	paragon)
	812	basic_machine=i860-intel
	813	os=-osf
	814	;;
	815	pbd)
	816	basic_machine=sparc-tti
	817	;;
	818	pbb)
	819	basic_machine=m68k-tti
	820	;;
	821	pc532 \| pc532-*)
	822	basic_machine=ns32k-pc532
	823	;;
	824	pc98)
	825	basic_machine=i386-pc
	826	;;
	827	pc98-*)
	828	basic_machine=i386-`echo $basic_machine \| sed 's/^[^-]*-//'`
	829	;;
	830	pentium \| p5 \| k5 \| k6 \| nexgen \| viac3)
	831	basic_machine=i586-pc
	832	;;
	833	pentiumpro \| p6 \| 6x86 \| athlon \| athlon_*)
	834	basic_machine=i686-pc
	835	;;
	836	pentiumii \| pentium2 \| pentiumiii \| pentium3)
	837	basic_machine=i686-pc
	838	;;
	839	pentium4)
	840	basic_machine=i786-pc
	841	;;
	842	pentium-* \| p5-* \| k5-* \| k6-* \| nexgen-* \| viac3-*)
	843	basic_machine=i586-`echo $basic_machine \| sed 's/^[^-]*-//'`
	844	;;
	845	pentiumpro-* \| p6-* \| 6x86-* \| athlon-*)
	846	basic_machine=i686-`echo $basic_machine \| sed 's/^[^-]*-//'`
	847	;;
	848	pentiumii-* \| pentium2-* \| pentiumiii-* \| pentium3-*)
	849	basic_machine=i686-`echo $basic_machine \| sed 's/^[^-]*-//'`
	850	;;
	851	pentium4-*)
	852	basic_machine=i786-`echo $basic_machine \| sed 's/^[^-]*-//'`
	853	;;
	854	pn)
	855	basic_machine=pn-gould
	856	;;
	857	power) basic_machine=power-ibm
	858	;;
	859	ppc) basic_machine=powerpc-unknown
	860	;;
	861	ppc-) basic_machine=powerpc-`echo $basic_machine \| sed 's/^[^-]-//'`
	862	;;
	863	ppcle \| powerpclittle \| ppc-le \| powerpc-little)
	864	basic_machine=powerpcle-unknown
	865	;;
	866	ppcle-* \| powerpclittle-*)
	867	basic_machine=powerpcle-`echo $basic_machine \| sed 's/^[^-]*-//'`
	868	;;
	869	ppc64) basic_machine=powerpc64-unknown
	870	;;
	871	ppc64-) basic_machine=powerpc64-`echo $basic_machine \| sed 's/^[^-]-//'`
	872	;;
	873	ppc64le \| powerpc64little \| ppc64-le \| powerpc64-little)
	874	basic_machine=powerpc64le-unknown
	875	;;
	876	ppc64le-* \| powerpc64little-*)
	877	basic_machine=powerpc64le-`echo $basic_machine \| sed 's/^[^-]*-//'`
	878	;;
	879	ps2)
	880	basic_machine=i386-ibm
	881	;;
	882	pw32)
	883	basic_machine=i586-unknown
	884	os=-pw32
	885	;;
	886	rdos)
	887	basic_machine=i386-pc
	888	os=-rdos
	889	;;
	890	rom68k)
	891	basic_machine=m68k-rom68k
	892	os=-coff
	893	;;
	894	rm[46]00)
	895	basic_machine=mips-siemens
	896	;;
	897	rtpc \| rtpc-*)
	898	basic_machine=romp-ibm
	899	;;
	900	s390 \| s390-*)
	901	basic_machine=s390-ibm
	902	;;
	903	s390x \| s390x-*)
	904	basic_machine=s390x-ibm
	905	;;
	906	sa29200)
	907	basic_machine=a29k-amd
	908	os=-udi
	909	;;
	910	sb1)
	911	basic_machine=mipsisa64sb1-unknown
	912	;;
	913	sb1el)
	914	basic_machine=mipsisa64sb1el-unknown
	915	;;
	916	sde)
	917	basic_machine=mipsisa32-sde
	918	os=-elf
	919	;;
	920	sei)
	921	basic_machine=mips-sei
	922	os=-seiux
	923	;;
	924	sequent)
	925	basic_machine=i386-sequent
	926	;;
	927	sh)
	928	basic_machine=sh-hitachi
	929	os=-hms
	930	;;
	931	sh5el)
	932	basic_machine=sh5le-unknown
	933	;;
	934	sh64)
	935	basic_machine=sh64-unknown
	936	;;
	937	sparclite-wrs \| simso-wrs)
	938	basic_machine=sparclite-wrs
	939	os=-vxworks
	940	;;
	941	sps7)
	942	basic_machine=m68k-bull
	943	os=-sysv2
	944	;;
	945	spur)
	946	basic_machine=spur-unknown
	947	;;
	948	st2000)
	949	basic_machine=m68k-tandem
	950	;;
	951	stratus)
	952	basic_machine=i860-stratus
	953	os=-sysv4
	954	;;
	955	sun2)
	956	basic_machine=m68000-sun
	957	;;
	958	sun2os3)
	959	basic_machine=m68000-sun
	960	os=-sunos3
	961	;;
	962	sun2os4)
	963	basic_machine=m68000-sun
	964	os=-sunos4
	965	;;
	966	sun3os3)
	967	basic_machine=m68k-sun
	968	os=-sunos3
	969	;;
	970	sun3os4)
	971	basic_machine=m68k-sun
	972	os=-sunos4
	973	;;
	974	sun4os3)
	975	basic_machine=sparc-sun
	976	os=-sunos3
	977	;;
	978	sun4os4)
	979	basic_machine=sparc-sun
	980	os=-sunos4
	981	;;
	982	sun4sol2)
	983	basic_machine=sparc-sun
	984	os=-solaris2
	985	;;
	986	sun3 \| sun3-*)
	987	basic_machine=m68k-sun
	988	;;
	989	sun4)
	990	basic_machine=sparc-sun
	991	;;
	992	sun386 \| sun386i \| roadrunner)
	993	basic_machine=i386-sun
	994	;;
	995	sv1)
	996	basic_machine=sv1-cray
	997	os=-unicos
	998	;;
	999	symmetry)
	1000	basic_machine=i386-sequent
	1001	os=-dynix
	1002	;;
	1003	t3e)
	1004	basic_machine=alphaev5-cray
	1005	os=-unicos
	1006	;;
	1007	t90)
	1008	basic_machine=t90-cray
	1009	os=-unicos
	1010	;;
	1011	tic54x \| c54x*)
	1012	basic_machine=tic54x-unknown
	1013	os=-coff
	1014	;;
	1015	tic55x \| c55x*)
	1016	basic_machine=tic55x-unknown
	1017	os=-coff
	1018	;;
	1019	tic6x \| c6x*)
	1020	basic_machine=tic6x-unknown
	1021	os=-coff
	1022	;;
	1023	tx39)
	1024	basic_machine=mipstx39-unknown
	1025	;;
	1026	tx39el)
	1027	basic_machine=mipstx39el-unknown
	1028	;;
	1029	toad1)
	1030	basic_machine=pdp10-xkl
	1031	os=-tops20
	1032	;;
	1033	tower \| tower-32)
	1034	basic_machine=m68k-ncr
	1035	;;
	1036	tpf)
	1037	basic_machine=s390x-ibm
	1038	os=-tpf
	1039	;;
	1040	udi29k)
	1041	basic_machine=a29k-amd
	1042	os=-udi
	1043	;;
	1044	ultra3)
	1045	basic_machine=a29k-nyu
	1046	os=-sym1
	1047	;;
	1048	v810 \| necv810)
	1049	basic_machine=v810-nec
	1050	os=-none
	1051	;;
	1052	vaxv)
	1053	basic_machine=vax-dec
	1054	os=-sysv
	1055	;;
	1056	vms)
	1057	basic_machine=vax-dec
	1058	os=-vms
	1059	;;
	1060	vpp\|vx\|vx-)
	1061	basic_machine=f301-fujitsu
	1062	;;
	1063	vxworks960)
	1064	basic_machine=i960-wrs
	1065	os=-vxworks
	1066	;;
	1067	vxworks68)
	1068	basic_machine=m68k-wrs
	1069	os=-vxworks
	1070	;;
	1071	vxworks29k)
	1072	basic_machine=a29k-wrs
	1073	os=-vxworks
	1074	;;
	1075	w65*)
	1076	basic_machine=w65-wdc
	1077	os=-none
	1078	;;
	1079	w89k-*)
	1080	basic_machine=hppa1.1-winbond
	1081	os=-proelf
	1082	;;
	1083	xbox)
	1084	basic_machine=i686-pc
	1085	os=-mingw32
	1086	;;
	1087	xps \| xps100)
	1088	basic_machine=xps100-honeywell
	1089	;;
	1090	ymp)
	1091	basic_machine=ymp-cray
	1092	os=-unicos
	1093	;;
	1094	z8k-*-coff)
	1095	basic_machine=z8k-unknown
	1096	os=-sim
	1097	;;
	1098	none)
	1099	basic_machine=none-none
	1100	os=-none
	1101	;;
	1102
	1103	# Here we handle the default manufacturer of certain CPU types. It is in
	1104	# some cases the only manufacturer, in others, it is the most popular.
	1105	w89k)
	1106	basic_machine=hppa1.1-winbond
	1107	;;
	1108	op50n)
	1109	basic_machine=hppa1.1-oki
	1110	;;
	1111	op60c)
	1112	basic_machine=hppa1.1-oki
	1113	;;
	1114	romp)
	1115	basic_machine=romp-ibm
	1116	;;
	1117	mmix)
	1118	basic_machine=mmix-knuth
	1119	;;
	1120	rs6000)
	1121	basic_machine=rs6000-ibm
	1122	;;
	1123	vax)
	1124	basic_machine=vax-dec
	1125	;;
	1126	pdp10)
	1127	# there are many clones, so DEC is not a safe bet
	1128	basic_machine=pdp10-unknown
	1129	;;
	1130	pdp11)
	1131	basic_machine=pdp11-dec
	1132	;;
	1133	we32k)
	1134	basic_machine=we32k-att
	1135	;;
	1136	sh[1234] \| sh[24]a \| sh[34]eb \| sh[1234]le \| sh[23]ele)
	1137	basic_machine=sh-unknown
	1138	;;
	1139	sparc \| sparcv8 \| sparcv9 \| sparcv9b \| sparcv9v)
	1140	basic_machine=sparc-sun
	1141	;;
	1142	cydra)
	1143	basic_machine=cydra-cydrome
	1144	;;
	1145	orion)
	1146	basic_machine=orion-highlevel
	1147	;;
	1148	orion105)
	1149	basic_machine=clipper-highlevel
	1150	;;
	1151	mac \| mpw \| mac-mpw)
	1152	basic_machine=m68k-apple
	1153	;;
	1154	pmac \| pmac-mpw)
	1155	basic_machine=powerpc-apple
	1156	;;
	1157	*-unknown)
	1158	# Make sure to match an already-canonicalized machine name.
	1159	;;
	1160	*)
	1161	echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
	1162	exit 1
	1163	;;
	1164	esac
	1165
	1166	# Here we canonicalize certain aliases for manufacturers.
	1167	case $basic_machine in
	1168	-digital)
	1169	basic_machine=`echo $basic_machine \| sed 's/digital.*/dec/'`
	1170	;;
	1171	-commodore)
	1172	basic_machine=`echo $basic_machine \| sed 's/commodore.*/cbm/'`
	1173	;;
	1174	*)
	1175	;;
	1176	esac
	1177
	1178	# Decode manufacturer-specific aliases for certain operating systems.
	1179
	1180	if [ x"$os" != x"" ]
	1181	then
	1182	case $os in
	1183	# First match some system type aliases
	1184	# that might get confused with valid system types.
	1185	# -solaris* is a basic system type, with this one exception.
	1186	-solaris1 \| -solaris1.*)
	1187	os=`echo $os \| sed -e 's\|solaris1\|sunos4\|'`
	1188	;;
	1189	-solaris)
	1190	os=-solaris2
	1191	;;
	1192	-svr4*)
	1193	os=-sysv4
	1194	;;
	1195	-unixware*)
	1196	os=-sysv4.2uw
	1197	;;
	1198	-gnu/linux*)
	1199	os=`echo $os \| sed -e 's\|gnu/linux\|linux-gnu\|'`
	1200	;;
	1201	# First accept the basic system types.
	1202	# The portable systems comes first.
	1203	# Each alternative MUST END IN A *, to match a version number.
	1204	# -sysv* is not here because it comes later, after sysvr4.
	1205	-gnu* \| -bsd* \| -mach* \| -minix* \| -genix* \| -ultrix* \| -irix* \
	1206	\| -vms \| -sco* \| -esix* \| -isc* \| -aix* \| -sunos \| -sunos[34]*\
	1207	\| -hpux* \| -unos* \| -osf* \| -luna* \| -dgux* \| -solaris* \| -sym* \
	1208	\| -amigaos* \| -amigados* \| -msdos* \| -newsos* \| -unicos* \| -aof* \
	1209	\| -aos* \
	1210	\| -nindy* \| -vxsim* \| -vxworks* \| -ebmon* \| -hms* \| -mvs* \
	1211	\| -clix* \| -riscos* \| -uniplus* \| -iris* \| -rtu* \| -xenix* \
	1212	\| -hiux* \| -386bsd* \| -knetbsd* \| -mirbsd* \| -netbsd* \
	1213	\| -openbsd* \| -solidbsd* \
	1214	\| -ekkobsd* \| -kfreebsd* \| -freebsd* \| -riscix* \| -lynxos* \
	1215	\| -bosx* \| -nextstep* \| -cxux* \| -aout* \| -elf* \| -oabi* \
	1216	\| -ptx* \| -coff* \| -ecoff* \| -winnt* \| -domain* \| -vsta* \
	1217	\| -udi* \| -eabi* \| -lites* \| -ieee* \| -go32* \| -aux* \
	1218	\| -chorusos* \| -chorusrdb* \
	1219	\| -cygwin* \| -pe* \| -psos* \| -moss* \| -proelf* \| -rtems* \
	1220	\| -mingw32* \| -linux-gnu* \| -linux-newlib* \| -linux-uclibc* \
	1221	\| -uxpv* \| -beos* \| -mpeix* \| -udk* \
	1222	\| -interix* \| -uwin* \| -mks* \| -rhapsody* \| -darwin* \| -opened* \
	1223	\| -openstep* \| -oskit* \| -conix* \| -pw32* \| -nonstopux* \
	1224	\| -storm-chaos* \| -tops10* \| -tenex* \| -tops20* \| -its* \
	1225	\| -os2* \| -vos* \| -palmos* \| -uclinux* \| -nucleus* \
	1226	\| -morphos* \| -superux* \| -rtmk* \| -rtmk-nova* \| -windiss* \
	1227	\| -powermax* \| -dnix* \| -nx6 \| -nx7 \| -sei* \| -dragonfly* \
	1228	\| -skyos* \| -haiku* \| -rdos* \| -toppers* \| -drops*)
	1229	# Remember, each alternative MUST END IN *, to match a version number.
	1230	;;
	1231	-qnx*)
	1232	case $basic_machine in
	1233	x86-* \| i86-)
	1234	;;
	1235	*)
	1236	os=-nto$os
	1237	;;
	1238	esac
	1239	;;
	1240	-nto-qnx*)
	1241	;;
	1242	-nto*)
	1243	os=`echo $os \| sed -e 's\|nto\|nto-qnx\|'`
	1244	;;
	1245	-sim \| -es1800* \| -hms* \| -xray \| -os68k* \| -none* \| -v88r* \
	1246	\| -windows* \| -osx \| -abug \| -netware* \| -os9* \| -beos* \| -haiku* \
	1247	\| -macos* \| -mpw* \| -magic* \| -mmixware* \| -mon960* \| -lnews*)
	1248	;;
	1249	-mac*)
	1250	os=`echo $os \| sed -e 's\|mac\|macos\|'`
	1251	;;
	1252	-linux-dietlibc)
	1253	os=-linux-dietlibc
	1254	;;
	1255	-linux*)
	1256	os=`echo $os \| sed -e 's\|linux\|linux-gnu\|'`
	1257	;;
	1258	-sunos5*)
	1259	os=`echo $os \| sed -e 's\|sunos5\|solaris2\|'`
	1260	;;
	1261	-sunos6*)
	1262	os=`echo $os \| sed -e 's\|sunos6\|solaris3\|'`
	1263	;;
	1264	-opened*)
	1265	os=-openedition
	1266	;;
	1267	-os400*)
	1268	os=-os400
	1269	;;
	1270	-wince*)
	1271	os=-wince
	1272	;;
	1273	-osfrose*)
	1274	os=-osfrose
	1275	;;
	1276	-osf*)
	1277	os=-osf
	1278	;;
	1279	-utek*)
	1280	os=-bsd
	1281	;;
	1282	-dynix*)
	1283	os=-bsd
	1284	;;
	1285	-acis*)
	1286	os=-aos
	1287	;;
	1288	-atheos*)
	1289	os=-atheos
	1290	;;
	1291	-syllable*)
	1292	os=-syllable
	1293	;;
	1294	-386bsd)
	1295	os=-bsd
	1296	;;
	1297	-ctix* \| -uts*)
	1298	os=-sysv
	1299	;;
	1300	-nova*)
	1301	os=-rtmk-nova
	1302	;;
	1303	-ns2 )
	1304	os=-nextstep2
	1305	;;
	1306	-nsk*)
	1307	os=-nsk
	1308	;;
	1309	# Preserve the version number of sinix5.
	1310	-sinix5.*)
	1311	os=`echo $os \| sed -e 's\|sinix\|sysv\|'`
	1312	;;
	1313	-sinix*)
	1314	os=-sysv4
	1315	;;
	1316	-tpf*)
	1317	os=-tpf
	1318	;;
	1319	-triton*)
	1320	os=-sysv3
	1321	;;
	1322	-oss*)
	1323	os=-sysv3
	1324	;;
	1325	-svr4)
	1326	os=-sysv4
	1327	;;
	1328	-svr3)
	1329	os=-sysv3
	1330	;;
	1331	-sysvr4)
	1332	os=-sysv4
	1333	;;
	1334	# This must come after -sysvr4.
	1335	-sysv*)
	1336	;;
	1337	-ose*)
	1338	os=-ose
	1339	;;
	1340	-es1800*)
	1341	os=-ose
	1342	;;
	1343	-xenix)
	1344	os=-xenix
	1345	;;
	1346	-mint \| -mint[0-9] \| -MiNT \| -MiNT[0-9])
	1347	os=-mint
	1348	;;
	1349	-aros*)
	1350	os=-aros
	1351	;;
	1352	-kaos*)
	1353	os=-kaos
	1354	;;
	1355	-zvmoe)
	1356	os=-zvmoe
	1357	;;
	1358	-none)
	1359	;;
	1360	*)
	1361	# Get rid of the `-' at the beginning of $os.
	1362	os=`echo $os \| sed 's/[^-]*-//'`
	1363	echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2
	1364	exit 1
	1365	;;
	1366	esac
	1367	else
	1368
	1369	# Here we handle the default operating systems that come with various machines.
	1370	# The value should be what the vendor currently ships out the door with their
	1371	# machine or put another way, the most popular os provided with the machine.
	1372
	1373	# Note that if you're going to try to match "-MANUFACTURER" here (say,
	1374	# "-sun"), then you have to tell the case statement up towards the top
	1375	# that MANUFACTURER isn't an operating system. Otherwise, code above
	1376	# will signal an error saying that MANUFACTURER isn't an operating
	1377	# system, and we'll never get to this point.
	1378
	1379	case $basic_machine in
	1380	score-*)
	1381	os=-elf
	1382	;;
	1383	spu-*)
	1384	os=-elf
	1385	;;
	1386	*-acorn)
	1387	os=-riscix1.2
	1388	;;
	1389	arm*-rebel)
	1390	os=-linux
	1391	;;
	1392	arm*-semi)
	1393	os=-aout
	1394	;;
	1395	c4x-* \| tic4x-*)
	1396	os=-coff
	1397	;;
	1398	# This must come before the *-dec entry.
	1399	pdp10-*)
	1400	os=-tops20
	1401	;;
	1402	pdp11-*)
	1403	os=-none
	1404	;;
	1405	-dec \| vax-)
	1406	os=-ultrix4.2
	1407	;;
	1408	m68*-apollo)
	1409	os=-domain
	1410	;;
	1411	i386-sun)
	1412	os=-sunos4.0.2
	1413	;;
	1414	m68000-sun)
	1415	os=-sunos3
	1416	# This also exists in the configure program, but was not the
	1417	# default.
	1418	# os=-sunos4
	1419	;;
	1420	m68*-cisco)
	1421	os=-aout
	1422	;;
	1423	mep-*)
	1424	os=-elf
	1425	;;
	1426	mips*-cisco)
	1427	os=-elf
	1428	;;
	1429	mips-)
	1430	os=-elf
	1431	;;
	1432	or32-*)
	1433	os=-coff
	1434	;;
	1435	*-tti) # must be before sparc entry or we get the wrong os.
	1436	os=-sysv3
	1437	;;
	1438	sparc-* \| *-sun)
	1439	os=-sunos4.1.1
	1440	;;
	1441	*-be)
	1442	os=-beos
	1443	;;
	1444	*-haiku)
	1445	os=-haiku
	1446	;;
	1447	*-ibm)
	1448	os=-aix
	1449	;;
	1450	*-knuth)
	1451	os=-mmixware
	1452	;;
	1453	*-wec)
	1454	os=-proelf
	1455	;;
	1456	*-winbond)
	1457	os=-proelf
	1458	;;
	1459	*-oki)
	1460	os=-proelf
	1461	;;
	1462	*-hp)
	1463	os=-hpux
	1464	;;
	1465	*-hitachi)
	1466	os=-hiux
	1467	;;
	1468	i860-* \| -att \| -ncr \| -altos \| -motorola \| *-convergent)
	1469	os=-sysv
	1470	;;
	1471	*-cbm)
	1472	os=-amigaos
	1473	;;
	1474	*-dg)
	1475	os=-dgux
	1476	;;
	1477	*-dolphin)
	1478	os=-sysv3
	1479	;;
	1480	m68k-ccur)
	1481	os=-rtu
	1482	;;
	1483	m88k-omron*)
	1484	os=-luna
	1485	;;
	1486	*-next )
	1487	os=-nextstep
	1488	;;
	1489	*-sequent)
	1490	os=-ptx
	1491	;;
	1492	*-crds)
	1493	os=-unos
	1494	;;
	1495	*-ns)
	1496	os=-genix
	1497	;;
	1498	i370-*)
	1499	os=-mvs
	1500	;;
	1501	*-next)
	1502	os=-nextstep3
	1503	;;
	1504	*-gould)
	1505	os=-sysv
	1506	;;
	1507	*-highlevel)
	1508	os=-bsd
	1509	;;
	1510	*-encore)
	1511	os=-bsd
	1512	;;
	1513	*-sgi)
	1514	os=-irix
	1515	;;
	1516	*-siemens)
	1517	os=-sysv4
	1518	;;
	1519	*-masscomp)
	1520	os=-rtu
	1521	;;
	1522	f30[01]-fujitsu \| f700-fujitsu)
	1523	os=-uxpv
	1524	;;
	1525	*-rom68k)
	1526	os=-coff
	1527	;;
	1528	-bug)
	1529	os=-coff
	1530	;;
	1531	*-apple)
	1532	os=-macos
	1533	;;
	1534	-atari)
	1535	os=-mint
	1536	;;
	1537	*)
	1538	os=-none
	1539	;;
	1540	esac
	1541	fi
	1542
	1543	# Here we handle the case where we know the os, and the CPU type, but not the
	1544	# manufacturer. We pick the logical manufacturer.
	1545	vendor=unknown
	1546	case $basic_machine in
	1547	*-unknown)
	1548	case $os in
	1549	-riscix*)
	1550	vendor=acorn
	1551	;;
	1552	-sunos*)
	1553	vendor=sun
	1554	;;
	1555	-aix*)
	1556	vendor=ibm
	1557	;;
	1558	-beos*)
	1559	vendor=be
	1560	;;
	1561	-hpux*)
	1562	vendor=hp
	1563	;;
	1564	-mpeix*)
	1565	vendor=hp
	1566	;;
	1567	-hiux*)
	1568	vendor=hitachi
	1569	;;
	1570	-unos*)
	1571	vendor=crds
	1572	;;
	1573	-dgux*)
	1574	vendor=dg
	1575	;;
	1576	-luna*)
	1577	vendor=omron
	1578	;;
	1579	-genix*)
	1580	vendor=ns
	1581	;;
	1582	-mvs* \| -opened*)
	1583	vendor=ibm
	1584	;;
	1585	-os400*)
	1586	vendor=ibm
	1587	;;
	1588	-ptx*)
	1589	vendor=sequent
	1590	;;
	1591	-tpf*)
	1592	vendor=ibm
	1593	;;
	1594	-vxsim* \| -vxworks* \| -windiss*)
	1595	vendor=wrs
	1596	;;
	1597	-aux*)
	1598	vendor=apple
	1599	;;
	1600	-hms*)
	1601	vendor=hitachi
	1602	;;
	1603	-mpw* \| -macos*)
	1604	vendor=apple
	1605	;;
	1606	-mint \| -mint[0-9] \| -MiNT \| -MiNT[0-9])
	1607	vendor=atari
	1608	;;
	1609	-vos*)
	1610	vendor=stratus
	1611	;;
	1612	esac
	1613	basic_machine=`echo $basic_machine \| sed "s/unknown/$vendor/"`
	1614	;;
	1615	esac
	1616
	1617	echo $basic_machine$os
	1618	exit
	1619
	1620	# Local variables:
	1621	# eval: (add-hook 'write-file-hooks 'time-stamp)
	1622	# time-stamp-start: "timestamp='"
	1623	# time-stamp-format: "%:y-%02m-%02d"
	1624	# time-stamp-end: "'"
	1625	# End:

+732

-128

configure less more

0	0	#! /bin/sh
1	1	# Guess values for system-dependent variables and create Makefiles.
2		# Generated by GNU Autoconf 2.61 for gsl 1.11.
	2	# Generated by GNU Autoconf 2.61 for gsl 1.12.
3	3	#
4	4	# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
5	5	# 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.

720	720	# Identity of this package.
721	721	PACKAGE_NAME='gsl'
722	722	PACKAGE_TARNAME='gsl'
723		PACKAGE_VERSION='1.11'
724		PACKAGE_STRING='gsl 1.11'
	723	PACKAGE_VERSION='1.12'
	724	PACKAGE_STRING='gsl 1.12'
725	725	PACKAGE_BUGREPORT=''
726	726
727	727	ac_unique_file="gsl_math.h"

851	851	DUMPBIN
852	852	ac_ct_DUMPBIN
853	853	NM
	854	OBJDUMP
854	855	AR
855	856	RANLIB
856	857	lt_ECHO
857	858	DSYMUTIL
858	859	NMEDIT
	860	LIPO
	861	OTOOL
	862	OTOOL64
859	863	GSL_CFLAGS
860	864	GSL_LIBS
861	865	MINGW32_HOST_TRUE

1391	1395	# Omit some internal or obsolete options to make the list less imposing.
1392	1396	# This message is too long to be a string in the A/UX 3.1 sh.
1393	1397	cat <<_ACEOF
1394		\`configure' configures gsl 1.11 to adapt to many kinds of systems.
	1398	\`configure' configures gsl 1.12 to adapt to many kinds of systems.
1395	1399
1396	1400	Usage: $0 [OPTION]... [VAR=VALUE]...
1397	1401

1461	1465
1462	1466	if test -n "$ac_init_help"; then
1463	1467	case $ac_init_help in
1464		short \| recursive ) echo "Configuration of gsl 1.11:";;
	1468	short \| recursive ) echo "Configuration of gsl 1.12:";;
1465	1469	esac
1466	1470	cat <<\_ACEOF
1467	1471

1556	1560	test -n "$ac_init_help" && exit $ac_status
1557	1561	if $ac_init_version; then
1558	1562	cat <<\_ACEOF
1559		gsl configure 1.11
	1563	gsl configure 1.12
1560	1564	generated by GNU Autoconf 2.61
1561	1565
1562	1566	Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,

1570	1574	This file contains any messages produced by compilers while
1571	1575	running configure, to aid debugging if configure makes a mistake.
1572	1576
1573		It was created by gsl $as_me 1.11, which was
	1577	It was created by gsl $as_me 1.12, which was
1574	1578	generated by GNU Autoconf 2.61. Invocation command line was
1575	1579
1576	1580	$ $0 $@

2262	2266
2263	2267	# Define the identity of the package.
2264	2268	PACKAGE='gsl'
2265		VERSION='1.11'
	2269	VERSION='1.12'
2266	2270
2267	2271
2268	2272	cat >>confdefs.h <<_ACEOF

2434	2438
2435	2439
2436	2440
2437		GSL_CURRENT=12
	2441	GSL_CURRENT=13
2438	2442	GSL_REVISION=0
2439		GSL_AGE=12
	2443	GSL_AGE=13
2440	2444	CBLAS_CURRENT=0
2441	2445	CBLAS_REVISION=0
2442	2446	CBLAS_AGE=0

3828	3832
3829	3833
3830	3834
3831		macro_version='2.2'
3832		macro_revision='1.2599'
	3835	macro_version='2.2.6'
	3836	macro_revision='1.3012'
3833	3837
3834	3838
3835	3839

4320	4324
4321	4325
4322	4326
4323
4324	4327	{ echo "$as_me:$LINENO: checking for BSD- or MS-compatible name lister (nm)" >&5
4325	4328	echo $ECHO_N "checking for BSD- or MS-compatible name lister (nm)... $ECHO_C" >&6; }
4326	4329	if test "${lt_cv_path_NM+set}" = set; then

4499	4502	else
4500	4503	lt_cv_nm_interface="BSD nm"
4501	4504	echo "int some_variable = 0;" > conftest.$ac_ext
4502		(eval echo "\"\$as_me:4503: $ac_compile\"" >&5)
	4505	(eval echo "\"\$as_me:4506: $ac_compile\"" >&5)
4503	4506	(eval "$ac_compile" 2>conftest.err)
4504	4507	cat conftest.err >&5
4505		(eval echo "\"\$as_me:4506: $NM \\\"conftest.$ac_objext\\\"\"" >&5)
	4508	(eval echo "\"\$as_me:4509: $NM \\\"conftest.$ac_objext\\\"\"" >&5)
4506	4509	(eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out)
4507	4510	cat conftest.err >&5
4508		(eval echo "\"\$as_me:4509: output\"" >&5)
	4511	(eval echo "\"\$as_me:4512: output\"" >&5)
4509	4512	cat conftest.out >&5
4510	4513	if $GREP 'External.*some_variable' conftest.out > /dev/null; then
4511	4514	lt_cv_nm_interface="MS dumpbin"

4540	4543	lt_cv_sys_max_cmd_len=-1;
4541	4544	;;
4542	4545
4543		cygwin* \| mingw*)
	4546	cygwin* \| mingw* \| cegcc*)
4544	4547	# On Win9x/ME, this test blows up -- it succeeds, but takes
4545	4548	# about 5 minutes as the teststring grows exponentially.
4546	4549	# Worse, since 9x/ME are not pre-emptively multitasking,

4649	4652
4650	4653
4651	4654
4652
4653	4655	: ${CP="cp -f"}
4654	4656	: ${MV="mv -f"}
4655	4657	: ${RM="rm -f"}

4660	4662	xsi_shell=no
4661	4663	( _lt_dummy="a/b/c"
4662	4664	test "${_lt_dummy##/},${_lt_dummy%/},"${_lt_dummy%"$_lt_dummy"}, \
4663		= c,a/b,, ) >/dev/null 2>&1 \
	4665	= c,a/b,, \
	4666	&& eval 'test $(( 1 + 1 )) -eq 2 \
	4667	&& test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \
4664	4668	&& xsi_shell=yes
4665	4669	{ echo "$as_me:$LINENO: result: $xsi_shell" >&5
4666	4670	echo "${ECHO_T}$xsi_shell" >&6; }

4740	4744
4741	4745
4742	4746
	4747	if test -n "$ac_tool_prefix"; then
	4748	# Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args.
	4749	set dummy ${ac_tool_prefix}objdump; ac_word=$2
	4750	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	4751	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	4752	if test "${ac_cv_prog_OBJDUMP+set}" = set; then
	4753	echo $ECHO_N "(cached) $ECHO_C" >&6
	4754	else
	4755	if test -n "$OBJDUMP"; then
	4756	ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test.
	4757	else
	4758	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	4759	for as_dir in $PATH
	4760	do
	4761	IFS=$as_save_IFS
	4762	test -z "$as_dir" && as_dir=.
	4763	for ac_exec_ext in '' $ac_executable_extensions; do
	4764	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	4765	ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump"
	4766	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	4767	break 2
	4768	fi
	4769	done
	4770	done
	4771	IFS=$as_save_IFS
	4772
	4773	fi
	4774	fi
	4775	OBJDUMP=$ac_cv_prog_OBJDUMP
	4776	if test -n "$OBJDUMP"; then
	4777	{ echo "$as_me:$LINENO: result: $OBJDUMP" >&5
	4778	echo "${ECHO_T}$OBJDUMP" >&6; }
	4779	else
	4780	{ echo "$as_me:$LINENO: result: no" >&5
	4781	echo "${ECHO_T}no" >&6; }
	4782	fi
	4783
	4784
	4785	fi
	4786	if test -z "$ac_cv_prog_OBJDUMP"; then
	4787	ac_ct_OBJDUMP=$OBJDUMP
	4788	# Extract the first word of "objdump", so it can be a program name with args.
	4789	set dummy objdump; ac_word=$2
	4790	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	4791	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	4792	if test "${ac_cv_prog_ac_ct_OBJDUMP+set}" = set; then
	4793	echo $ECHO_N "(cached) $ECHO_C" >&6
	4794	else
	4795	if test -n "$ac_ct_OBJDUMP"; then
	4796	ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test.
	4797	else
	4798	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	4799	for as_dir in $PATH
	4800	do
	4801	IFS=$as_save_IFS
	4802	test -z "$as_dir" && as_dir=.
	4803	for ac_exec_ext in '' $ac_executable_extensions; do
	4804	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	4805	ac_cv_prog_ac_ct_OBJDUMP="objdump"
	4806	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	4807	break 2
	4808	fi
	4809	done
	4810	done
	4811	IFS=$as_save_IFS
	4812
	4813	fi
	4814	fi
	4815	ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP
	4816	if test -n "$ac_ct_OBJDUMP"; then
	4817	{ echo "$as_me:$LINENO: result: $ac_ct_OBJDUMP" >&5
	4818	echo "${ECHO_T}$ac_ct_OBJDUMP" >&6; }
	4819	else
	4820	{ echo "$as_me:$LINENO: result: no" >&5
	4821	echo "${ECHO_T}no" >&6; }
	4822	fi
	4823
	4824	if test "x$ac_ct_OBJDUMP" = x; then
	4825	OBJDUMP="false"
	4826	else
	4827	case $cross_compiling:$ac_tool_warned in
	4828	yes:)
	4829	{ echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools
	4830	whose name does not start with the host triplet. If you think this
	4831	configuration is useful to you, please write to autoconf@gnu.org." >&5
	4832	echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools
	4833	whose name does not start with the host triplet. If you think this
	4834	configuration is useful to you, please write to autoconf@gnu.org." >&2;}
	4835	ac_tool_warned=yes ;;
	4836	esac
	4837	OBJDUMP=$ac_ct_OBJDUMP
	4838	fi
	4839	else
	4840	OBJDUMP="$ac_cv_prog_OBJDUMP"
	4841	fi
	4842
	4843	test -z "$OBJDUMP" && OBJDUMP=objdump
	4844
	4845
	4846
	4847
	4848
	4849
	4850
	4851
4743	4852
4744	4853	{ echo "$as_me:$LINENO: checking how to recognize dependent libraries" >&5
4745	4854	echo $ECHO_N "checking how to recognize dependent libraries... $ECHO_C" >&6; }

4792	4901	lt_cv_deplibs_check_method='file_magic file format pei-i386(.architecture: i386)?'
4793	4902	lt_cv_file_magic_cmd='$OBJDUMP -f'
4794	4903	fi
	4904	;;
	4905
	4906	cegcc)
	4907	# use the weaker test based on 'objdump'. See mingw*.
	4908	lt_cv_deplibs_check_method='file_magic file format pe-arm-.little(.architecture: arm)?'
	4909	lt_cv_file_magic_cmd='$OBJDUMP -f'
4795	4910	;;
4796	4911
4797	4912	darwin* \| rhapsody*)

5344	5459	aix*)
5345	5460	symcode='[BCDT]'
5346	5461	;;
5347		cygwin* \| mingw* \| pw32*)
	5462	cygwin* \| mingw* \| pw32* \| cegcc*)
5348	5463	symcode='[ABCDGISTW]'
5349	5464	;;
5350	5465	hpux*)

5604	5719	;;
5605	5720	--irix6*)
5606	5721	# Find out which ABI we are using.
5607		echo '#line 5608 "configure"' > conftest.$ac_ext
	5722	echo '#line 5723 "configure"' > conftest.$ac_ext
5608	5723	if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5
5609	5724	(eval $ac_compile) 2>&5
5610	5725	ac_status=$?

5986	6101	NMEDIT="$ac_cv_prog_NMEDIT"
5987	6102	fi
5988	6103
	6104	if test -n "$ac_tool_prefix"; then
	6105	# Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args.
	6106	set dummy ${ac_tool_prefix}lipo; ac_word=$2
	6107	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	6108	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	6109	if test "${ac_cv_prog_LIPO+set}" = set; then
	6110	echo $ECHO_N "(cached) $ECHO_C" >&6
	6111	else
	6112	if test -n "$LIPO"; then
	6113	ac_cv_prog_LIPO="$LIPO" # Let the user override the test.
	6114	else
	6115	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	6116	for as_dir in $PATH
	6117	do
	6118	IFS=$as_save_IFS
	6119	test -z "$as_dir" && as_dir=.
	6120	for ac_exec_ext in '' $ac_executable_extensions; do
	6121	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	6122	ac_cv_prog_LIPO="${ac_tool_prefix}lipo"
	6123	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	6124	break 2
	6125	fi
	6126	done
	6127	done
	6128	IFS=$as_save_IFS
	6129
	6130	fi
	6131	fi
	6132	LIPO=$ac_cv_prog_LIPO
	6133	if test -n "$LIPO"; then
	6134	{ echo "$as_me:$LINENO: result: $LIPO" >&5
	6135	echo "${ECHO_T}$LIPO" >&6; }
	6136	else
	6137	{ echo "$as_me:$LINENO: result: no" >&5
	6138	echo "${ECHO_T}no" >&6; }
	6139	fi
	6140
	6141
	6142	fi
	6143	if test -z "$ac_cv_prog_LIPO"; then
	6144	ac_ct_LIPO=$LIPO
	6145	# Extract the first word of "lipo", so it can be a program name with args.
	6146	set dummy lipo; ac_word=$2
	6147	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	6148	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	6149	if test "${ac_cv_prog_ac_ct_LIPO+set}" = set; then
	6150	echo $ECHO_N "(cached) $ECHO_C" >&6
	6151	else
	6152	if test -n "$ac_ct_LIPO"; then
	6153	ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test.
	6154	else
	6155	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	6156	for as_dir in $PATH
	6157	do
	6158	IFS=$as_save_IFS
	6159	test -z "$as_dir" && as_dir=.
	6160	for ac_exec_ext in '' $ac_executable_extensions; do
	6161	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	6162	ac_cv_prog_ac_ct_LIPO="lipo"
	6163	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	6164	break 2
	6165	fi
	6166	done
	6167	done
	6168	IFS=$as_save_IFS
	6169
	6170	fi
	6171	fi
	6172	ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO
	6173	if test -n "$ac_ct_LIPO"; then
	6174	{ echo "$as_me:$LINENO: result: $ac_ct_LIPO" >&5
	6175	echo "${ECHO_T}$ac_ct_LIPO" >&6; }
	6176	else
	6177	{ echo "$as_me:$LINENO: result: no" >&5
	6178	echo "${ECHO_T}no" >&6; }
	6179	fi
	6180
	6181	if test "x$ac_ct_LIPO" = x; then
	6182	LIPO=":"
	6183	else
	6184	case $cross_compiling:$ac_tool_warned in
	6185	yes:)
	6186	{ echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools
	6187	whose name does not start with the host triplet. If you think this
	6188	configuration is useful to you, please write to autoconf@gnu.org." >&5
	6189	echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools
	6190	whose name does not start with the host triplet. If you think this
	6191	configuration is useful to you, please write to autoconf@gnu.org." >&2;}
	6192	ac_tool_warned=yes ;;
	6193	esac
	6194	LIPO=$ac_ct_LIPO
	6195	fi
	6196	else
	6197	LIPO="$ac_cv_prog_LIPO"
	6198	fi
	6199
	6200	if test -n "$ac_tool_prefix"; then
	6201	# Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args.
	6202	set dummy ${ac_tool_prefix}otool; ac_word=$2
	6203	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	6204	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	6205	if test "${ac_cv_prog_OTOOL+set}" = set; then
	6206	echo $ECHO_N "(cached) $ECHO_C" >&6
	6207	else
	6208	if test -n "$OTOOL"; then
	6209	ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test.
	6210	else
	6211	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	6212	for as_dir in $PATH
	6213	do
	6214	IFS=$as_save_IFS
	6215	test -z "$as_dir" && as_dir=.
	6216	for ac_exec_ext in '' $ac_executable_extensions; do
	6217	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	6218	ac_cv_prog_OTOOL="${ac_tool_prefix}otool"
	6219	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	6220	break 2
	6221	fi
	6222	done
	6223	done
	6224	IFS=$as_save_IFS
	6225
	6226	fi
	6227	fi
	6228	OTOOL=$ac_cv_prog_OTOOL
	6229	if test -n "$OTOOL"; then
	6230	{ echo "$as_me:$LINENO: result: $OTOOL" >&5
	6231	echo "${ECHO_T}$OTOOL" >&6; }
	6232	else
	6233	{ echo "$as_me:$LINENO: result: no" >&5
	6234	echo "${ECHO_T}no" >&6; }
	6235	fi
	6236
	6237
	6238	fi
	6239	if test -z "$ac_cv_prog_OTOOL"; then
	6240	ac_ct_OTOOL=$OTOOL
	6241	# Extract the first word of "otool", so it can be a program name with args.
	6242	set dummy otool; ac_word=$2
	6243	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	6244	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	6245	if test "${ac_cv_prog_ac_ct_OTOOL+set}" = set; then
	6246	echo $ECHO_N "(cached) $ECHO_C" >&6
	6247	else
	6248	if test -n "$ac_ct_OTOOL"; then
	6249	ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test.
	6250	else
	6251	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	6252	for as_dir in $PATH
	6253	do
	6254	IFS=$as_save_IFS
	6255	test -z "$as_dir" && as_dir=.
	6256	for ac_exec_ext in '' $ac_executable_extensions; do
	6257	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	6258	ac_cv_prog_ac_ct_OTOOL="otool"
	6259	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	6260	break 2
	6261	fi
	6262	done
	6263	done
	6264	IFS=$as_save_IFS
	6265
	6266	fi
	6267	fi
	6268	ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL
	6269	if test -n "$ac_ct_OTOOL"; then
	6270	{ echo "$as_me:$LINENO: result: $ac_ct_OTOOL" >&5
	6271	echo "${ECHO_T}$ac_ct_OTOOL" >&6; }
	6272	else
	6273	{ echo "$as_me:$LINENO: result: no" >&5
	6274	echo "${ECHO_T}no" >&6; }
	6275	fi
	6276
	6277	if test "x$ac_ct_OTOOL" = x; then
	6278	OTOOL=":"
	6279	else
	6280	case $cross_compiling:$ac_tool_warned in
	6281	yes:)
	6282	{ echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools
	6283	whose name does not start with the host triplet. If you think this
	6284	configuration is useful to you, please write to autoconf@gnu.org." >&5
	6285	echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools
	6286	whose name does not start with the host triplet. If you think this
	6287	configuration is useful to you, please write to autoconf@gnu.org." >&2;}
	6288	ac_tool_warned=yes ;;
	6289	esac
	6290	OTOOL=$ac_ct_OTOOL
	6291	fi
	6292	else
	6293	OTOOL="$ac_cv_prog_OTOOL"
	6294	fi
	6295
	6296	if test -n "$ac_tool_prefix"; then
	6297	# Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args.
	6298	set dummy ${ac_tool_prefix}otool64; ac_word=$2
	6299	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	6300	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	6301	if test "${ac_cv_prog_OTOOL64+set}" = set; then
	6302	echo $ECHO_N "(cached) $ECHO_C" >&6
	6303	else
	6304	if test -n "$OTOOL64"; then
	6305	ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test.
	6306	else
	6307	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	6308	for as_dir in $PATH
	6309	do
	6310	IFS=$as_save_IFS
	6311	test -z "$as_dir" && as_dir=.
	6312	for ac_exec_ext in '' $ac_executable_extensions; do
	6313	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	6314	ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64"
	6315	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	6316	break 2
	6317	fi
	6318	done
	6319	done
	6320	IFS=$as_save_IFS
	6321
	6322	fi
	6323	fi
	6324	OTOOL64=$ac_cv_prog_OTOOL64
	6325	if test -n "$OTOOL64"; then
	6326	{ echo "$as_me:$LINENO: result: $OTOOL64" >&5
	6327	echo "${ECHO_T}$OTOOL64" >&6; }
	6328	else
	6329	{ echo "$as_me:$LINENO: result: no" >&5
	6330	echo "${ECHO_T}no" >&6; }
	6331	fi
	6332
	6333
	6334	fi
	6335	if test -z "$ac_cv_prog_OTOOL64"; then
	6336	ac_ct_OTOOL64=$OTOOL64
	6337	# Extract the first word of "otool64", so it can be a program name with args.
	6338	set dummy otool64; ac_word=$2
	6339	{ echo "$as_me:$LINENO: checking for $ac_word" >&5
	6340	echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
	6341	if test "${ac_cv_prog_ac_ct_OTOOL64+set}" = set; then
	6342	echo $ECHO_N "(cached) $ECHO_C" >&6
	6343	else
	6344	if test -n "$ac_ct_OTOOL64"; then
	6345	ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test.
	6346	else
	6347	as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
	6348	for as_dir in $PATH
	6349	do
	6350	IFS=$as_save_IFS
	6351	test -z "$as_dir" && as_dir=.
	6352	for ac_exec_ext in '' $ac_executable_extensions; do
	6353	if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
	6354	ac_cv_prog_ac_ct_OTOOL64="otool64"
	6355	echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
	6356	break 2
	6357	fi
	6358	done
	6359	done
	6360	IFS=$as_save_IFS
	6361
	6362	fi
	6363	fi
	6364	ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64
	6365	if test -n "$ac_ct_OTOOL64"; then
	6366	{ echo "$as_me:$LINENO: result: $ac_ct_OTOOL64" >&5
	6367	echo "${ECHO_T}$ac_ct_OTOOL64" >&6; }
	6368	else
	6369	{ echo "$as_me:$LINENO: result: no" >&5
	6370	echo "${ECHO_T}no" >&6; }
	6371	fi
	6372
	6373	if test "x$ac_ct_OTOOL64" = x; then
	6374	OTOOL64=":"
	6375	else
	6376	case $cross_compiling:$ac_tool_warned in
	6377	yes:)
	6378	{ echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools
	6379	whose name does not start with the host triplet. If you think this
	6380	configuration is useful to you, please write to autoconf@gnu.org." >&5
	6381	echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools
	6382	whose name does not start with the host triplet. If you think this
	6383	configuration is useful to you, please write to autoconf@gnu.org." >&2;}
	6384	ac_tool_warned=yes ;;
	6385	esac
	6386	OTOOL64=$ac_ct_OTOOL64
	6387	fi
	6388	else
	6389	OTOOL64="$ac_cv_prog_OTOOL64"
	6390	fi
	6391
	6392
	6393
	6394
	6395
	6396
	6397
	6398
	6399
	6400
	6401
	6402
	6403
	6404
	6405
	6406
5989	6407
5990	6408
5991	6409

6008	6426	# by either setting the environment variable LT_MULTI_MODULE
6009	6427	# non-empty at configure time, or by adding -multi_module to the
6010	6428	# link flags.
	6429	rm -rf libconftest.dylib*
6011	6430	echo "int foo(void){return 1;}" > conftest.c
	6431	echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
	6432	-dynamiclib -Wl,-single_module conftest.c" >&5
6012	6433	$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \
6013		-dynamiclib ${wl}-single_module conftest.c
6014		if test -f libconftest.dylib; then
	6434	-dynamiclib -Wl,-single_module conftest.c 2>conftest.err
	6435	_lt_result=$?
	6436	if test -f libconftest.dylib && test ! -s conftest.err && test $_lt_result = 0; then
6015	6437	lt_cv_apple_cc_single_mod=yes
6016		rm -rf libconftest.dylib*
	6438	else
	6439	cat conftest.err >&5
6017	6440	fi
6018		rm conftest.c
	6441	rm -rf libconftest.dylib*
	6442	rm -f conftest.*
6019	6443	fi
6020	6444	fi
6021	6445	{ echo "$as_me:$LINENO: result: $lt_cv_apple_cc_single_mod" >&5

6912	7336	-e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
6913	7337	-e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
6914	7338	-e 's:$: $lt_compiler_flag:'`
6915		(eval echo "\"\$as_me:6916: $lt_compile\"" >&5)
	7339	(eval echo "\"\$as_me:7340: $lt_compile\"" >&5)
6916	7340	(eval "$lt_compile" 2>conftest.err)
6917	7341	ac_status=$?
6918	7342	cat conftest.err >&5
6919		echo "$as_me:6920: \$? = $ac_status" >&5
	7343	echo "$as_me:7344: \$? = $ac_status" >&5
6920	7344	if (exit $ac_status) && test -s "$ac_outfile"; then
6921	7345	# The compiler can only warn and ignore the option if not recognized
6922	7346	# So say no if there are warnings other than the usual output.

6966	7390	;;
6967	7391
6968	7392	amigaos*)
6969		if test "$host_cpu" = m68k; then
6970		# FIXME: we need at least 68020 code to build shared libraries, but
6971		# adding the `-m68020' flag to GCC prevents building anything better,
6972		# like `-m68040'.
6973		lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4'
6974		fi
	7393	case $host_cpu in
	7394	powerpc)
	7395	# see comment about AmigaOS4 .so support
	7396	lt_prog_compiler_pic='-fPIC'
	7397	;;
	7398	m68k)
	7399	# FIXME: we need at least 68020 code to build shared libraries, but
	7400	# adding the `-m68020' flag to GCC prevents building anything better,
	7401	# like `-m68040'.
	7402	lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4'
	7403	;;
	7404	esac
6975	7405	;;
6976	7406
6977	7407	beos* \| irix5* \| irix6* \| nonstopux* \| osf3* \| osf4* \| osf5*)
6978	7408	# PIC is the default for these OSes.
6979	7409	;;
6980	7410
6981		mingw* \| cygwin* \| pw32* \| os2*)
	7411	mingw* \| cygwin* \| pw32* \| os2* \| cegcc*)
6982	7412	# This hack is so that the source file can tell whether it is being
6983	7413	# built for inclusion in a dll (and should export symbols for example).
6984	7414	# Although the cygwin gcc ignores -fPIC, still need this for old-style

6993	7423	;;
6994	7424
6995	7425	hpux*)
6996		# PIC is the default for IA64 HP-UX and 64-bit HP-UX, but
6997		# not for PA HP-UX.
	7426	# PIC is the default for 64-bit PA HP-UX, but not for 32-bit
	7427	# PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag
	7428	# sets the default TLS model and affects inlining.
6998	7429	case $host_cpu in
6999		hppa64\|ia64*)
	7430	hppa64)
7000	7431	# +Z the default
7001	7432	;;
7002	7433	*)

7046	7477	fi
7047	7478	;;
7048	7479
7049		mingw* \| cygwin* \| pw32* \| os2*)
	7480	mingw* \| cygwin* \| pw32* \| os2* \| cegcc*)
7050	7481	# This hack is so that the source file can tell whether it is being
7051	7482	# built for inclusion in a dll (and should export symbols for example).
7052	7483	lt_prog_compiler_pic='-DDLL_EXPORT'

7076	7507
7077	7508	linux* \| kbsd-gnu)
7078	7509	case $cc_basename in
7079		icc* \| ecc* \| ifort*)
	7510	# old Intel for x86_64 which still supported -KPIC.
	7511	ecc*)
7080	7512	lt_prog_compiler_wl='-Wl,'
7081	7513	lt_prog_compiler_pic='-KPIC'
7082	7514	lt_prog_compiler_static='-static'
7083	7515	;;
	7516	# icc used to be incompatible with GCC.
	7517	# ICC 10 doesn't accept -KPIC any more.
	7518	icc* \| ifort*)
	7519	lt_prog_compiler_wl='-Wl,'
	7520	lt_prog_compiler_pic='-fPIC'
	7521	lt_prog_compiler_static='-static'
	7522	;;
	7523	# Lahey Fortran 8.1.
	7524	lf95*)
	7525	lt_prog_compiler_wl='-Wl,'
	7526	lt_prog_compiler_pic='--shared'
	7527	lt_prog_compiler_static='--static'
	7528	;;
7084	7529	pgcc* \| pgf77* \| pgf90* \| pgf95*)
7085	7530	# Portland Group compilers (not the Pentium gcc compiler,
7086	7531	# which looks to be a dead project)

7230	7675	-e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
7231	7676	-e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
7232	7677	-e 's:$: $lt_compiler_flag:'`
7233		(eval echo "\"\$as_me:7234: $lt_compile\"" >&5)
	7678	(eval echo "\"\$as_me:7679: $lt_compile\"" >&5)
7234	7679	(eval "$lt_compile" 2>conftest.err)
7235	7680	ac_status=$?
7236	7681	cat conftest.err >&5
7237		echo "$as_me:7238: \$? = $ac_status" >&5
	7682	echo "$as_me:7683: \$? = $ac_status" >&5
7238	7683	if (exit $ac_status) && test -s "$ac_outfile"; then
7239	7684	# The compiler can only warn and ignore the option if not recognized
7240	7685	# So say no if there are warnings other than the usual output.

7335	7780	-e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
7336	7781	-e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
7337	7782	-e 's:$: $lt_compiler_flag:'`
7338		(eval echo "\"\$as_me:7339: $lt_compile\"" >&5)
	7783	(eval echo "\"\$as_me:7784: $lt_compile\"" >&5)
7339	7784	(eval "$lt_compile" 2>out/conftest.err)
7340	7785	ac_status=$?
7341	7786	cat out/conftest.err >&5
7342		echo "$as_me:7343: \$? = $ac_status" >&5
	7787	echo "$as_me:7788: \$? = $ac_status" >&5
7343	7788	if (exit $ac_status) && test -s out/conftest2.$ac_objext
7344	7789	then
7345	7790	# The compiler can only warn and ignore the option if not recognized

7390	7835	-e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \
7391	7836	-e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \
7392	7837	-e 's:$: $lt_compiler_flag:'`
7393		(eval echo "\"\$as_me:7394: $lt_compile\"" >&5)
	7838	(eval echo "\"\$as_me:7839: $lt_compile\"" >&5)
7394	7839	(eval "$lt_compile" 2>out/conftest.err)
7395	7840	ac_status=$?
7396	7841	cat out/conftest.err >&5
7397		echo "$as_me:7398: \$? = $ac_status" >&5
	7842	echo "$as_me:7843: \$? = $ac_status" >&5
7398	7843	if (exit $ac_status) && test -s out/conftest2.$ac_objext
7399	7844	then
7400	7845	# The compiler can only warn and ignore the option if not recognized

7494	7939	extract_expsyms_cmds=
7495	7940
7496	7941	case $host_os in
7497		cygwin* \| mingw* \| pw32*)
	7942	cygwin* \| mingw* \| pw32* \| cegcc*)
7498	7943	# FIXME: the MSVC++ port hasn't been tested in a loooong time
7499	7944	# When not using gcc, we currently assume that we are using
7500	7945	# Microsoft Visual C++.

7556	8001	;;
7557	8002
7558	8003	amigaos*)
7559		if test "$host_cpu" = m68k; then
7560		archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
7561		hardcode_libdir_flag_spec='-L$libdir'
7562		hardcode_minus_L=yes
7563		fi
7564
7565		# Samuel A. Falvo II <kc5tja@dolphin.openprojects.net> reports
7566		# that the semantics of dynamic libraries on AmigaOS, at least up
7567		# to version 4, is to share data among multiple programs linked
7568		# with the same dynamic library. Since this doesn't match the
7569		# behavior of shared libraries on other platforms, we can't use
7570		# them.
7571		ld_shlibs=no
	8004	case $host_cpu in
	8005	powerpc)
	8006	# see comment about AmigaOS4 .so support
	8007	archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
	8008	archive_expsym_cmds=''
	8009	;;
	8010	m68k)
	8011	archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
	8012	hardcode_libdir_flag_spec='-L$libdir'
	8013	hardcode_minus_L=yes
	8014	;;
	8015	esac
7572	8016	;;
7573	8017
7574	8018	beos*)

7582	8026	fi
7583	8027	;;
7584	8028
7585		cygwin* \| mingw* \| pw32*)
	8029	cygwin* \| mingw* \| pw32* \| cegcc*)
7586	8030	# _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless,
7587	8031	# as there is no search path for DLLs.
7588	8032	hardcode_libdir_flag_spec='-L$libdir'

7648	8092	tmp_addflag=' -i_dynamic -nofor_main' ;;
7649	8093	ifc* \| ifort*) # Intel Fortran compiler
7650	8094	tmp_addflag=' -nofor_main' ;;
	8095	lf95*) # Lahey Fortran 8.1
	8096	whole_archive_flag_spec=
	8097	tmp_sharedflag='--shared' ;;
7651	8098	xl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below)
7652	8099	tmp_sharedflag='-qmkshrobj'
7653	8100	tmp_addflag= ;;

7879	8326	fi
7880	8327	fi
7881	8328
	8329	export_dynamic_flag_spec='${wl}-bexpall'
7882	8330	# It seems that -bexpall does not export symbols beginning with
7883	8331	# underscore (_), so it is better to generate a list of symbols to export.
7884	8332	always_export_symbols=yes

8027	8475	;;
8028	8476
8029	8477	amigaos*)
8030		if test "$host_cpu" = m68k; then
8031		archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
8032		hardcode_libdir_flag_spec='-L$libdir'
8033		hardcode_minus_L=yes
8034		fi
8035		# see comment about different semantics on the GNU ld section
8036		ld_shlibs=no
	8478	case $host_cpu in
	8479	powerpc)
	8480	# see comment about AmigaOS4 .so support
	8481	archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib'
	8482	archive_expsym_cmds=''
	8483	;;
	8484	m68k)
	8485	archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)'
	8486	hardcode_libdir_flag_spec='-L$libdir'
	8487	hardcode_minus_L=yes
	8488	;;
	8489	esac
8037	8490	;;
8038	8491
8039	8492	bsdi[45]*)
8040	8493	export_dynamic_flag_spec=-rdynamic
8041	8494	;;
8042	8495
8043		cygwin* \| mingw* \| pw32*)
	8496	cygwin* \| mingw* \| pw32* \| cegcc*)
8044	8497	# When not using gcc, we currently assume that we are using
8045	8498	# Microsoft Visual C++.
8046	8499	# hardcode_libdir_flag_spec is actually meaningless, as there is

8071	8524	whole_archive_flag_spec=''
8072	8525	link_all_deplibs=yes
8073	8526	allow_undefined_flag="$_lt_dar_allow_undefined"
8074		if test "$GCC" = "yes"; then
	8527	case $cc_basename in
	8528	ifort*) _lt_dar_can_shared=yes ;;
	8529	*) _lt_dar_can_shared=$GCC ;;
	8530	esac
	8531	if test "$_lt_dar_can_shared" = "yes"; then
8075	8532	output_verbose_link_cmd=echo
8076	8533	archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}"
8077	8534	module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}"

8163	8620	archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags'
8164	8621	;;
8165	8622	ia64*)
8166		archive_cmds='$CC -shared ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
	8623	archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags'
8167	8624	;;
8168	8625	*)
8169	8626	archive_cmds='$CC -shared -fPIC ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'

8867	9324	;;
8868	9325
8869	9326	amigaos*)
8870		if test "$host_cpu" = m68k; then
	9327	case $host_cpu in
	9328	powerpc)
	9329	# Since July 2007 AmigaOS4 officially supports .so libraries.
	9330	# When compiling the executable, add -use-dynld -Lsobjs: to the compileline.
	9331	library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
	9332	;;
	9333	m68k)
8871	9334	library_names_spec='$libname.ixlibrary $libname.a'
8872	9335	# Create ${libname}_ixlibrary.a entries in /sys/libs.
8873	9336	finish_eval='for lib in `ls $libdir/.ixlibrary 2>/dev/null`; do libname=`$ECHO "X$lib" \| $Xsed -e '\''s%^./$[^/]*$\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a \|\| exit 1; done'
8874		else
8875		dynamic_linker=no
8876		fi
	9337	;;
	9338	esac
8877	9339	;;
8878	9340
8879	9341	beos*)

8896	9358	# libtool to hard-code these into programs
8897	9359	;;
8898	9360
8899		cygwin* \| mingw* \| pw32*)
	9361	cygwin* \| mingw* \| pw32* \| cegcc*)
8900	9362	version_type=windows
8901	9363	shrext_cmds=".dll"
8902	9364	need_version=no
8903	9365	need_lib_prefix=no
8904	9366
8905	9367	case $GCC,$host_os in
8906		yes,cygwin* \| yes,mingw* \| yes,pw32*)
	9368	yes,cygwin* \| yes,mingw* \| yes,pw32* \| yes,cegcc*)
8907	9369	library_names_spec='$libname.dll.a'
8908	9370	# DLL is installed to $(libdir)/../bin by postinstall_cmds
8909	9371	postinstall_cmds='base_file=`basename \${file}`~

8926	9388	soname_spec='`echo ${libname} \| sed -e 's/^lib/cyg/'``echo ${release} \| $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
8927	9389	sys_lib_search_path_spec="/usr/lib /lib/w32api /lib /usr/local/lib"
8928	9390	;;
8929		mingw*)
	9391	mingw* \| cegcc*)
8930	9392	# MinGW DLLs use traditional 'lib' prefix
8931	9393	soname_spec='${libname}`echo ${release} \| $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}'
8932	9394	sys_lib_search_path_spec=`$CC -print-search-dirs \| $GREP "^libraries:" \| $SED -e "s/^libraries://" -e "s,=/,/,g"`

9395	9857	version_type=linux
9396	9858	need_lib_prefix=no
9397	9859	need_version=no
9398		library_name_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
	9860	library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}'
9399	9861	shlibpath_var=LD_LIBRARY_PATH
9400	9862	shlibpath_overrides_runpath=no
9401	9863	hardcode_into_libs=yes

9572	10034	lt_cv_dlopen_self=yes
9573	10035	;;
9574	10036
9575		mingw* \| pw32*)
	10037	mingw* \| pw32* \| cegcc*)
9576	10038	lt_cv_dlopen="LoadLibrary"
9577	10039	lt_cv_dlopen_libs=
9578	10040	;;

10129	10591	lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2
10130	10592	lt_status=$lt_dlunknown
10131	10593	cat > conftest.$ac_ext <<_LT_EOF
10132		#line 10133 "configure"
	10594	#line 10595 "configure"
10133	10595	#include "confdefs.h"
10134	10596
10135	10597	#if HAVE_DLFCN_H

10170	10632	# endif
10171	10633	#endif
10172	10634
10173		#ifdef __cplusplus
10174		extern "C" void exit (int);
10175		#endif
10176
10177	10635	void fnord() { int i=42;}
10178	10636	int main ()
10179	10637	{

10189	10647	else
10190	10648	puts (dlerror ());
10191	10649
10192		exit (status);
	10650	return status;
10193	10651	}
10194	10652	_LT_EOF
10195	10653	if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5

10229	10687	lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2
10230	10688	lt_status=$lt_dlunknown
10231	10689	cat > conftest.$ac_ext <<_LT_EOF
10232		#line 10233 "configure"
	10690	#line 10691 "configure"
10233	10691	#include "confdefs.h"
10234	10692
10235	10693	#if HAVE_DLFCN_H

10270	10728	# endif
10271	10729	#endif
10272	10730
10273		#ifdef __cplusplus
10274		extern "C" void exit (int);
10275		#endif
10276
10277	10731	void fnord() { int i=42;}
10278	10732	int main ()
10279	10733	{

10289	10743	else
10290	10744	puts (dlerror ());
10291	10745
10292		exit (status);
	10746	return status;
10293	10747	}
10294	10748	_LT_EOF
10295	10749	if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5

10719	11173
10720	11174
10721	11175
10722		{ echo "$as_me:$LINENO: checking for extern inline" >&5
10723		echo $ECHO_N "checking for extern inline... $ECHO_C" >&6; }
	11176	{ echo "$as_me:$LINENO: checking for GNU-style extern inline" >&5
	11177	echo $ECHO_N "checking for GNU-style extern inline... $ECHO_C" >&6; }
10724	11178	if test "${ac_cv_c_extern_inline+set}" = set; then
10725	11179	echo $ECHO_N "(cached) $ECHO_C" >&6
10726	11180	else

10779	11233	#define HAVE_INLINE
10780	11234	_ACEOF
10781	11235
	11236	else
	11237	{ echo "$as_me:$LINENO: checking for C99-style inline" >&5
	11238	echo $ECHO_N "checking for C99-style inline... $ECHO_C" >&6; }
	11239	if test "${ac_cv_c_c99inline+set}" = set; then
	11240	echo $ECHO_N "(cached) $ECHO_C" >&6
	11241	else
	11242	ac_cv_c_c99inline=no
	11243	cat >conftest.$ac_ext <<_ACEOF
	11244	/* confdefs.h. */
	11245	_ACEOF
	11246	cat confdefs.h >>conftest.$ac_ext
	11247	cat >>conftest.$ac_ext <<_ACEOF
	11248	/* end confdefs.h. */
	11249	#ifdef __GNUC_STDC_INLINE__
	11250	inline double foo(double x);
	11251	inline double foo(double x) { return x + 1.0 ; };
	11252	#endif
	11253	int
	11254	main ()
	11255	{
	11256	foo(1.0)
	11257	;
	11258	return 0;
	11259	}
	11260	_ACEOF
	11261	rm -f conftest.$ac_objext
	11262	if { (ac_try="$ac_compile"
	11263	case "(($ac_try" in
	11264	\" \| \` \| \\) ac_try_echo=\$ac_try;;
	11265	*) ac_try_echo=$ac_try;;
	11266	esac
	11267	eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
	11268	(eval "$ac_compile") 2>conftest.er1
	11269	ac_status=$?
	11270	grep -v '^ *+' conftest.er1 >conftest.err
	11271	rm -f conftest.er1
	11272	cat conftest.err >&5
	11273	echo "$as_me:$LINENO: \$? = $ac_status" >&5
	11274	(exit $ac_status); } && {
	11275	test -z "$ac_c_werror_flag" \|\|
	11276	test ! -s conftest.err
	11277	} && test -s conftest.$ac_objext; then
	11278	ac_cv_c_c99inline="yes"
	11279	else
	11280	echo "$as_me: failed program was:" >&5
	11281	sed 's/^/\| /' conftest.$ac_ext >&5
	11282
	11283
	11284	fi
	11285
	11286	rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
	11287
	11288	fi
	11289	{ echo "$as_me:$LINENO: result: $ac_cv_c_c99inline" >&5
	11290	echo "${ECHO_T}$ac_cv_c_c99inline" >&6; }
	11291
	11292	if test "$ac_cv_c_c99inline" != no ; then
	11293
	11294	cat >>confdefs.h <<\_ACEOF
	11295	#define HAVE_INLINE
	11296	_ACEOF
	11297
	11298	fi
10782	11299	fi
10783	11300
10784	11301

12573	13090	else
12574	13091	ac_cv_c_fpu_sse=no
12575	13092	if test "$cross_compiling" = yes; then
12576		{ { echo "$as_me:$LINENO: error: cannot run test program while cross compiling
12577		See \`config.log' for more details." >&5
12578		echo "$as_me: error: cannot run test program while cross compiling
12579		See \`config.log' for more details." >&2;}
12580		{ (exit 1); exit 1; }; }
	13093
	13094	cat >conftest.$ac_ext <<_ACEOF
	13095	/* confdefs.h. */
	13096	_ACEOF
	13097	cat confdefs.h >>conftest.$ac_ext
	13098	cat >>conftest.$ac_ext <<_ACEOF
	13099	/* end confdefs.h. */
	13100
	13101	#include <stdlib.h>
	13102	#define _FPU_SETMXCSR(cw_sse) asm volatile ("ldmxcsr %0" : : "m" (*&cw_sse))
	13103
	13104	int
	13105	main ()
	13106	{
	13107	unsigned int mode = 0x1f80 ; _FPU_SETMXCSR(mode); exit(0);
	13108	;
	13109	return 0;
	13110	}
	13111	_ACEOF
	13112	rm -f conftest.$ac_objext
	13113	if { (ac_try="$ac_compile"
	13114	case "(($ac_try" in
	13115	\" \| \` \| \\) ac_try_echo=\$ac_try;;
	13116	*) ac_try_echo=$ac_try;;
	13117	esac
	13118	eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
	13119	(eval "$ac_compile") 2>conftest.er1
	13120	ac_status=$?
	13121	grep -v '^ *+' conftest.er1 >conftest.err
	13122	rm -f conftest.er1
	13123	cat conftest.err >&5
	13124	echo "$as_me:$LINENO: \$? = $ac_status" >&5
	13125	(exit $ac_status); } && {
	13126	test -z "$ac_c_werror_flag" \|\|
	13127	test ! -s conftest.err
	13128	} && test -s conftest.$ac_objext; then
	13129	ac_cv_c_fpu_sse="yes"
	13130	else
	13131	echo "$as_me: failed program was:" >&5
	13132	sed 's/^/\| /' conftest.$ac_ext >&5
	13133
	13134	ac_cv_c_fpu_sse="no"
	13135	fi
	13136
	13137	rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
	13138
12581	13139	else
12582	13140	cat >conftest.$ac_ext <<_ACEOF
12583	13141	/* confdefs.h. */

12623	13181	echo "$as_me: failed program was:" >&5
12624	13182	sed 's/^/\| /' conftest.$ac_ext >&5
12625	13183
	13184	( exit $ac_status )
	13185	ac_cv_c_fpu_sse="no"
12626	13186	fi
12627	13187	rm -f core .core core.conftest. gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext
12628	13188	fi
12629
12630	13189
12631	13190
12632	13191	fi
12633	13192	{ echo "$as_me:$LINENO: result: $ac_cv_c_fpu_sse" >&5
12634	13193	echo "${ECHO_T}$ac_cv_c_fpu_sse" >&6; }
	13194
12635	13195	if test $ac_cv_c_fpu_sse = yes; then
12636	13196
12637	13197	cat >>confdefs.h <<\_ACEOF

13319	13879	# report actual input values of CONFIG_FILES etc. instead of their
13320	13880	# values after options handling.
13321	13881	ac_log="
13322		This file was extended by gsl $as_me 1.11, which was
	13882	This file was extended by gsl $as_me 1.12, which was
13323	13883	generated by GNU Autoconf 2.61. Invocation command line was
13324	13884
13325	13885	CONFIG_FILES = $CONFIG_FILES

13372	13932	_ACEOF
13373	13933	cat >>$CONFIG_STATUS <<_ACEOF
13374	13934	ac_cs_version="\\
13375		gsl config.status 1.11
	13935	gsl config.status 1.12
13376	13936	configured by $0, generated by GNU Autoconf 2.61,
13377	13937	with options \\"`echo "$ac_configure_args" \| sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`\\"
13378	13938

13513	14073	lt_NL2SP='`$ECHO "X$lt_NL2SP" \| $Xsed -e "$delay_single_quote_subst"`'
13514	14074	reload_flag='`$ECHO "X$reload_flag" \| $Xsed -e "$delay_single_quote_subst"`'
13515	14075	reload_cmds='`$ECHO "X$reload_cmds" \| $Xsed -e "$delay_single_quote_subst"`'
	14076	OBJDUMP='`$ECHO "X$OBJDUMP" \| $Xsed -e "$delay_single_quote_subst"`'
13516	14077	deplibs_check_method='`$ECHO "X$deplibs_check_method" \| $Xsed -e "$delay_single_quote_subst"`'
13517	14078	file_magic_cmd='`$ECHO "X$file_magic_cmd" \| $Xsed -e "$delay_single_quote_subst"`'
13518	14079	AR='`$ECHO "X$AR" \| $Xsed -e "$delay_single_quote_subst"`'

13542	14103	need_locks='`$ECHO "X$need_locks" \| $Xsed -e "$delay_single_quote_subst"`'
13543	14104	DSYMUTIL='`$ECHO "X$DSYMUTIL" \| $Xsed -e "$delay_single_quote_subst"`'
13544	14105	NMEDIT='`$ECHO "X$NMEDIT" \| $Xsed -e "$delay_single_quote_subst"`'
	14106	LIPO='`$ECHO "X$LIPO" \| $Xsed -e "$delay_single_quote_subst"`'
	14107	OTOOL='`$ECHO "X$OTOOL" \| $Xsed -e "$delay_single_quote_subst"`'
	14108	OTOOL64='`$ECHO "X$OTOOL64" \| $Xsed -e "$delay_single_quote_subst"`'
13545	14109	libext='`$ECHO "X$libext" \| $Xsed -e "$delay_single_quote_subst"`'
13546	14110	shrext_cmds='`$ECHO "X$shrext_cmds" \| $Xsed -e "$delay_single_quote_subst"`'
13547	14111	extract_expsyms_cmds='`$ECHO "X$extract_expsyms_cmds" \| $Xsed -e "$delay_single_quote_subst"`'

13615	14179	lt_SP2NL \
13616	14180	lt_NL2SP \
13617	14181	reload_flag \
	14182	OBJDUMP \
13618	14183	deplibs_check_method \
13619	14184	file_magic_cmd \
13620	14185	AR \

13638	14203	need_locks \
13639	14204	DSYMUTIL \
13640	14205	NMEDIT \
	14206	LIPO \
	14207	OTOOL \
	14208	OTOOL64 \
13641	14209	shrext_cmds \
13642	14210	export_dynamic_flag_spec \
13643	14211	whole_archive_flag_spec \

13938	14506	DUMPBIN!$DUMPBIN$ac_delim
13939	14507	ac_ct_DUMPBIN!$ac_ct_DUMPBIN$ac_delim
13940	14508	NM!$NM$ac_delim
	14509	OBJDUMP!$OBJDUMP$ac_delim
13941	14510	AR!$AR$ac_delim
13942	14511	RANLIB!$RANLIB$ac_delim
13943	14512	lt_ECHO!$lt_ECHO$ac_delim
13944	14513	DSYMUTIL!$DSYMUTIL$ac_delim
13945	14514	NMEDIT!$NMEDIT$ac_delim
13946		GSL_CFLAGS!$GSL_CFLAGS$ac_delim
13947		GSL_LIBS!$GSL_LIBS$ac_delim
	14515	LIPO!$LIPO$ac_delim
13948	14516	_ACEOF
13949	14517
13950	14518	if test `sed -n "s/.*$ac_delim\$/X/p" conf$$subs.sed \| grep -c X` = 97; then

13986	14554	ac_delim='%!_!# '
13987	14555	for ac_last_try in false false false false false :; do
13988	14556	cat >conf$$subs.sed <<_ACEOF
	14557	OTOOL!$OTOOL$ac_delim
	14558	OTOOL64!$OTOOL64$ac_delim
	14559	GSL_CFLAGS!$GSL_CFLAGS$ac_delim
	14560	GSL_LIBS!$GSL_LIBS$ac_delim
13989	14561	MINGW32_HOST_TRUE!$MINGW32_HOST_TRUE$ac_delim
13990	14562	MINGW32_HOST_FALSE!$MINGW32_HOST_FALSE$ac_delim
13991	14563	LIBOBJS!$LIBOBJS$ac_delim

14009	14581	LTLIBOBJS!$LTLIBOBJS$ac_delim
14010	14582	_ACEOF
14011	14583
14012		if test `sed -n "s/.*$ac_delim\$/X/p" conf$$subs.sed \| grep -c X` = 21; then
	14584	if test `sed -n "s/.*$ac_delim\$/X/p" conf$$subs.sed \| grep -c X` = 25; then
14013	14585	break
14014	14586	elif $ac_last_try; then
14015	14587	{ { echo "$as_me:$LINENO: error: could not make $CONFIG_STATUS" >&5

14468	15040	#! $SHELL
14469	15041
14470	15042	# `$ECHO "$ofile" \| sed 's%^.*/%%'` - Provide generalized library-building support services.
14471		# Generated automatically by $as_me (GNU $PACKAGE$TIMESTAMP) $VERSION
	15043	# Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION
14472	15044	# Libtool was configured on host `(hostname \|\| uname -n) 2>/dev/null \| sed 1q`:
14473	15045	# NOTE: Changes made to this file will be lost: look at ltmain.sh.
14474	15046	#

14574	15146	reload_flag=$lt_reload_flag
14575	15147	reload_cmds=$lt_reload_cmds
14576	15148
	15149	# An object symbol dumper.
	15150	OBJDUMP=$lt_OBJDUMP
	15151
14577	15152	# Method to check whether dependent libraries are shared objects.
14578	15153	deplibs_check_method=$lt_deplibs_check_method
14579	15154

14630	15205
14631	15206	# Tool to change global to local symbols on Mac OS X.
14632	15207	NMEDIT=$lt_NMEDIT
	15208
	15209	# Tool to manipulate fat objects and archives on Mac OS X.
	15210	LIPO=$lt_LIPO
	15211
	15212	# ldd/readelf like tool for Mach-O binaries on Mac OS X.
	15213	OTOOL=$lt_OTOOL
	15214
	15215	# ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4.
	15216	OTOOL64=$lt_OTOOL64
14633	15217
14634	15218	# Old archive suffix (normally "a").
14635	15219	libext=$libext

14871	15455	case $xsi_shell in
14872	15456	yes)
14873	15457	cat << \_LT_EOF >> "$cfgfile"
	15458
14874	15459	# func_dirname file append nondir_replacement
14875	15460	# Compute the dirname of FILE. If nonempty, add APPEND to the result,
14876	15461	# otherwise set result to NONDIR_REPLACEMENT.

14938	15523	*) func_lo2o_result=${1} ;;
14939	15524	esac
14940	15525	}
	15526
	15527	# func_xform libobj-or-source
	15528	func_xform ()
	15529	{
	15530	func_xform_result=${1%.*}.lo
	15531	}
	15532
	15533	# func_arith arithmetic-term...
	15534	func_arith ()
	15535	{
	15536	func_arith_result=$(( $* ))
	15537	}
	15538
	15539	# func_len string
	15540	# STRING may not start with a hyphen.
	15541	func_len ()
	15542	{
	15543	func_len_result=${#1}
	15544	}
	15545
14941	15546	_LT_EOF
14942	15547	;;
14943	15548	*) # Bourne compatible functions.
14944	15549	cat << \_LT_EOF >> "$cfgfile"
	15550
14945	15551	# func_dirname file append nondir_replacement
14946	15552	# Compute the dirname of FILE. If nonempty, add APPEND to the result,
14947	15553	# otherwise set result to NONDIR_REPLACEMENT.

14962	15568	func_basename_result=`$ECHO "X${1}" \| $Xsed -e "$basename"`
14963	15569	}
14964	15570
14965		# func_dirname_and_basename file append nondir_replacement
14966		# perform func_basename and func_dirname in a single function
14967		# call:
14968		# dirname: Compute the dirname of FILE. If nonempty,
14969		# add APPEND to the result, otherwise set result
14970		# to NONDIR_REPLACEMENT.
14971		# value returned in "$func_dirname_result"
14972		# basename: Compute filename of FILE.
14973		# value retuned in "$func_basename_result"
14974		# Implementation must be kept synchronized with func_dirname
14975		# and func_basename. For efficiency, we do not delegate to
14976		# those functions but instead duplicate the functionality here.
14977		func_dirname_and_basename ()
14978		{
14979		# Extract subdirectory from the argument.
14980		func_dirname_result=`$ECHO "X${1}" \| $Xsed -e "$dirname"`
14981		if test "X$func_dirname_result" = "X${1}"; then
14982		func_dirname_result="${3}"
14983		else
14984		func_dirname_result="$func_dirname_result${2}"
14985		fi
14986		func_basename_result=`$ECHO "X${1}" \| $Xsed -e "$basename"`
14987		}
14988	15571
14989	15572	# func_stripname prefix suffix name
14990	15573	# strip PREFIX and SUFFIX off of NAME.

15018	15601	{
15019	15602	func_lo2o_result=`$ECHO "X${1}" \| $Xsed -e "$lo2o"`
15020	15603	}
	15604
	15605	# func_xform libobj-or-source
	15606	func_xform ()
	15607	{
	15608	func_xform_result=`$ECHO "X${1}" \| $Xsed -e 's/\.[^.]*$/.lo/'`
	15609	}
	15610
	15611	# func_arith arithmetic-term...
	15612	func_arith ()
	15613	{
	15614	func_arith_result=`expr "$@"`
	15615	}
	15616
	15617	# func_len string
	15618	# STRING may not start with a hyphen.
	15619	func_len ()
	15620	{
	15621	func_len_result=`expr "$1" : ".*" 2>/dev/null \|\| echo $max_cmd_len`
	15622	}
	15623
15021	15624	_LT_EOF
15022	15625	esac
15023	15626

15042	15645	{
15043	15646	eval "$1=\$$1\$2"
15044	15647	}
	15648
15045	15649	_LT_EOF
15046	15650	;;
15047	15651	esac

+25

-6

configure.ac less more

0	0	dnl Process this file with autoconf to produce a configure script.
1	1
2		AC_INIT([gsl],[1.11])
	2	AC_INIT([gsl],[1.12])
3	3	AC_CONFIG_SRCDIR(gsl_math.h)
4	4
5	5	AM_INIT_AUTOMAKE([gnu no-dependencies])

22	22	dnl gsl-1.9 libgsl 10:0:10 libgslcblas 0:0:0
23	23	dnl gsl-1.10 libgsl 10:0:10 (*) libgslcblas 0:0:0
24	24	dnl gsl-1.11 libgsl 12:0:12 libgslcblas 0:0:0
	25	dnl gsl-1.12 libgsl 13:0:13 libgslcblas 0:0:0
25	26	dnl
26	27	dnl (*) There was an error on this release. Firstly, the versioning
27	28	dnl numbers were not updated. Secondly, 2 functions were removed, but

42	43	dnl so set to 0 if both happened.
43	44
44	45	dnl
45		GSL_CURRENT=12
	46	GSL_CURRENT=13
46	47	GSL_REVISION=0
47		GSL_AGE=12
	48	GSL_AGE=13
48	49	dnl
49	50	CBLAS_CURRENT=0
50	51	CBLAS_REVISION=0

95	96	dnl Check for "extern inline", using a modified version of the test
96	97	dnl for AC_C_INLINE from acspecific.mt
97	98	dnl
98		AC_CACHE_CHECK([for extern inline], ac_cv_c_extern_inline,
	99	AC_CACHE_CHECK([for GNU-style extern inline], ac_cv_c_extern_inline,
99	100	[ac_cv_c_extern_inline=no
100	101	AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[extern $ac_cv_c_inline double foo(double x);
101	102	extern $ac_cv_c_inline double foo(double x) { return x + 1.0 ; } ;

104	105
105	106	if test "$ac_cv_c_extern_inline" != no ; then
106	107	AC_DEFINE(HAVE_INLINE,[],[Define if you have inline])
	108	else
	109	AC_CACHE_CHECK([for C99-style inline], ac_cv_c_c99inline,
	110	[ac_cv_c_c99inline=no
	111	AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#ifdef __GNUC_STDC_INLINE__
	112	inline double foo(double x);
	113	inline double foo(double x) { return x + 1.0 ; };
	114	#endif]],
	115	[[ foo(1.0) ]])],[ac_cv_c_c99inline="yes"],[])
	116	])
	117
	118	if test "$ac_cv_c_c99inline" != no ; then
	119	AC_DEFINE(HAVE_INLINE,[],[Define if you have inline])
	120	fi
107	121	fi
108	122
109	123	dnl Checks for header files.

310	324	AC_RUN_IFELSE([AC_LANG_PROGRAM([[
311	325	#include <stdlib.h>
312	326	#define _FPU_SETMXCSR(cw_sse) asm volatile ("ldmxcsr %0" : : "m" (*&cw_sse))
313		]], [[ unsigned int mode = 0x1f80 ; _FPU_SETMXCSR(mode); exit(0); ]])],[ac_cv_c_fpu_sse="yes"])
314		])
	327	]], [[ unsigned int mode = 0x1f80 ; _FPU_SETMXCSR(mode); exit(0); ]])],[ac_cv_c_fpu_sse="yes"],[ac_cv_c_fpu_sse="no"],[
	328	AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
	329	#include <stdlib.h>
	330	#define _FPU_SETMXCSR(cw_sse) asm volatile ("ldmxcsr %0" : : "m" (*&cw_sse))
	331	]], [[ unsigned int mode = 0x1f80 ; _FPU_SETMXCSR(mode); exit(0); ]])],[ac_cv_c_fpu_sse="yes"],[ac_cv_c_fpu_sse="no"])
	332	])])
	333
315	334	if test $ac_cv_c_fpu_sse = yes; then
316	335	AC_DEFINE([HAVE_FPU_X86_SSE], 1,
317	336	[Define if x86 processor has sse extensions.])

+4

-0

const/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2006-03-21 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* test.c (main): added some extra tests

+1

-1

const/Makefile.am less more

0	0	pkginclude_HEADERS = gsl_const.h gsl_const_cgs.h gsl_const_mks.h gsl_const_cgsm.h gsl_const_mksa.h gsl_const_num.h
1	1
2		INCLUDES= -I$(top_builddir)
	2	INCLUDES = -I$(top_srcdir)
3	3
4	4	TESTS = $(check_PROGRAMS)
5	5

+5

-1

const/Makefile.in less more

126	126	LIBOBJS = @LIBOBJS@
127	127	LIBS = @LIBS@
128	128	LIBTOOL = @LIBTOOL@
	129	LIPO = @LIPO@
129	130	LN_S = @LN_S@
130	131	LTLIBOBJS = @LTLIBOBJS@
131	132	MAINT = @MAINT@

133	134	MKDIR_P = @MKDIR_P@
134	135	NM = @NM@
135	136	NMEDIT = @NMEDIT@
	137	OBJDUMP = @OBJDUMP@
136	138	OBJEXT = @OBJEXT@
	139	OTOOL = @OTOOL@
	140	OTOOL64 = @OTOOL64@
137	141	PACKAGE = @PACKAGE@
138	142	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
139	143	PACKAGE_NAME = @PACKAGE_NAME@

197	201	top_builddir = @top_builddir@
198	202	top_srcdir = @top_srcdir@
199	203	pkginclude_HEADERS = gsl_const.h gsl_const_cgs.h gsl_const_mks.h gsl_const_cgsm.h gsl_const_mksa.h gsl_const_num.h
200		INCLUDES = -I$(top_builddir)
	204	INCLUDES = -I$(top_srcdir)
201	205	TESTS = $(check_PROGRAMS)
202	206	test_SOURCES = test.c
203	207	test_LDADD = ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la

+9

-0

debian/changelog less more

	0	gsl (1.12+dfsg-1) unstable; urgency=low
	1
	2	* New upstream version released today
	3
	4	* doc/*: As before, removed the 'non-free' documentation to create a
	5	source package that complies with Debian's interpretation of what is free.
	6
	7	-- Dirk Eddelbuettel <edd@debian.org> Tue, 16 Dec 2008 06:17:55 -0600
	8
0	9	gsl (1.11+dfsg-2) unstable; urgency=low
1	10
2	11	* debian/*: Applied patch by Matthew Vernon for building an optional package

+589

-0

depcomp less more

	0	#! /bin/sh
	1	# depcomp - compile a program generating dependencies as side-effects
	2
	3	scriptversion=2007-03-29.01
	4
	5	# Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007 Free Software
	6	# Foundation, Inc.
	7
	8	# This program is free software; you can redistribute it and/or modify
	9	# it under the terms of the GNU General Public License as published by
	10	# the Free Software Foundation; either version 2, or (at your option)
	11	# any later version.
	12
	13	# This program is distributed in the hope that it will be useful,
	14	# but WITHOUT ANY WARRANTY; without even the implied warranty of
	15	# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	16	# GNU General Public License for more details.
	17
	18	# You should have received a copy of the GNU General Public License
	19	# along with this program; if not, write to the Free Software
	20	# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
	21	# 02110-1301, USA.
	22
	23	# As a special exception to the GNU General Public License, if you
	24	# distribute this file as part of a program that contains a
	25	# configuration script generated by Autoconf, you may include it under
	26	# the same distribution terms that you use for the rest of that program.
	27
	28	# Originally written by Alexandre Oliva <oliva@dcc.unicamp.br>.
	29
	30	case $1 in
	31	'')
	32	echo "$0: No command. Try \`$0 --help' for more information." 1>&2
	33	exit 1;
	34	;;
	35	-h \| --h*)
	36	cat <<\EOF
	37	Usage: depcomp [--help] [--version] PROGRAM [ARGS]
	38
	39	Run PROGRAMS ARGS to compile a file, generating dependencies
	40	as side-effects.
	41
	42	Environment variables:
	43	depmode Dependency tracking mode.
	44	source Source file read by `PROGRAMS ARGS'.
	45	object Object file output by `PROGRAMS ARGS'.
	46	DEPDIR directory where to store dependencies.
	47	depfile Dependency file to output.
	48	tmpdepfile Temporary file to use when outputing dependencies.
	49	libtool Whether libtool is used (yes/no).
	50
	51	Report bugs to <bug-automake@gnu.org>.
	52	EOF
	53	exit $?
	54	;;
	55	-v \| --v*)
	56	echo "depcomp $scriptversion"
	57	exit $?
	58	;;
	59	esac
	60
	61	if test -z "$depmode" \|\| test -z "$source" \|\| test -z "$object"; then
	62	echo "depcomp: Variables source, object and depmode must be set" 1>&2
	63	exit 1
	64	fi
	65
	66	# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po.
	67	depfile=${depfile-`echo "$object" \|
	68	sed 's\|[^\\/]$\|'${DEPDIR-.deps}'/&\|;s\|\.$[^.]$$\|.P\1\|;s\|Pobj$\|Po\|'`}
	69	tmpdepfile=${tmpdepfile-`echo "$depfile" \| sed 's/\.$[^.]*$$/.T\1/'`}
	70
	71	rm -f "$tmpdepfile"
	72
	73	# Some modes work just like other modes, but use different flags. We
	74	# parameterize here, but still list the modes in the big case below,
	75	# to make depend.m4 easier to write. Note that we cannot use a case
	76	# here, because this file can only contain one case statement.
	77	if test "$depmode" = hp; then
	78	# HP compiler uses -M and no extra arg.
	79	gccflag=-M
	80	depmode=gcc
	81	fi
	82
	83	if test "$depmode" = dashXmstdout; then
	84	# This is just like dashmstdout with a different argument.
	85	dashmflag=-xM
	86	depmode=dashmstdout
	87	fi
	88
	89	case "$depmode" in
	90	gcc3)
	91	## gcc 3 implements dependency tracking that does exactly what
	92	## we want. Yay! Note: for some reason libtool 1.4 doesn't like
	93	## it if -MD -MP comes after the -MF stuff. Hmm.
	94	## Unfortunately, FreeBSD c89 acceptance of flags depends upon
	95	## the command line argument order; so add the flags where they
	96	## appear in depend2.am. Note that the slowdown incurred here
	97	## affects only configure: in makefiles, %FASTDEP% shortcuts this.
	98	for arg
	99	do
	100	case $arg in
	101	-c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;;
	102	*) set fnord "$@" "$arg" ;;
	103	esac
	104	shift # fnord
	105	shift # $arg
	106	done
	107	"$@"
	108	stat=$?
	109	if test $stat -eq 0; then :
	110	else
	111	rm -f "$tmpdepfile"
	112	exit $stat
	113	fi
	114	mv "$tmpdepfile" "$depfile"
	115	;;
	116
	117	gcc)
	118	## There are various ways to get dependency output from gcc. Here's
	119	## why we pick this rather obscure method:
	120	## - Don't want to use -MD because we'd like the dependencies to end
	121	## up in a subdir. Having to rename by hand is ugly.
	122	## (We might end up doing this anyway to support other compilers.)
	123	## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like
	124	## -MM, not -M (despite what the docs say).
	125	## - Using -M directly means running the compiler twice (even worse
	126	## than renaming).
	127	if test -z "$gccflag"; then
	128	gccflag=-MD,
	129	fi
	130	"$@" -Wp,"$gccflag$tmpdepfile"
	131	stat=$?
	132	if test $stat -eq 0; then :
	133	else
	134	rm -f "$tmpdepfile"
	135	exit $stat
	136	fi
	137	rm -f "$depfile"
	138	echo "$object : \\" > "$depfile"
	139	alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
	140	## The second -e expression handles DOS-style file names with drive letters.
	141	sed -e 's/^[^:]*: / /' \
	142	-e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile"
	143	## This next piece of magic avoids the `deleted header file' problem.
	144	## The problem is that when a header file which appears in a .P file
	145	## is deleted, the dependency causes make to die (because there is
	146	## typically no way to rebuild the header). We avoid this by adding
	147	## dummy dependencies for each header file. Too bad gcc doesn't do
	148	## this for us directly.
	149	tr ' ' '
	150	' < "$tmpdepfile" \|
	151	## Some versions of gcc put a space before the `:'. On the theory
	152	## that the space means something, we add a space to the output as
	153	## well.
	154	## Some versions of the HPUX 10.20 sed can't process this invocation
	155	## correctly. Breaking it into two sed invocations is a workaround.
	156	sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \| sed -e 's/$/ :/' >> "$depfile"
	157	rm -f "$tmpdepfile"
	158	;;
	159
	160	hp)
	161	# This case exists only to let depend.m4 do its work. It works by
	162	# looking at the text of this script. This case will never be run,
	163	# since it is checked for above.
	164	exit 1
	165	;;
	166
	167	sgi)
	168	if test "$libtool" = yes; then
	169	"$@" "-Wp,-MDupdate,$tmpdepfile"
	170	else
	171	"$@" -MDupdate "$tmpdepfile"
	172	fi
	173	stat=$?
	174	if test $stat -eq 0; then :
	175	else
	176	rm -f "$tmpdepfile"
	177	exit $stat
	178	fi
	179	rm -f "$depfile"
	180
	181	if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files
	182	echo "$object : \\" > "$depfile"
	183
	184	# Clip off the initial element (the dependent). Don't try to be
	185	# clever and replace this with sed code, as IRIX sed won't handle
	186	# lines with more than a fixed number of characters (4096 in
	187	# IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines;
	188	# the IRIX cc adds comments like `#:fec' to the end of the
	189	# dependency line.
	190	tr ' ' '
	191	' < "$tmpdepfile" \
	192	\| sed -e 's/^.\.o://' -e 's/#.$//' -e '/^$/ d' \| \
	193	tr '
	194	' ' ' >> $depfile
	195	echo >> $depfile
	196
	197	# The second pass generates a dummy entry for each header file.
	198	tr ' ' '
	199	' < "$tmpdepfile" \
	200	\| sed -e 's/^.\.o://' -e 's/#.$//' -e '/^$/ d' -e 's/$/:/' \
	201	>> $depfile
	202	else
	203	# The sourcefile does not contain any dependencies, so just
	204	# store a dummy comment line, to avoid errors with the Makefile
	205	# "include basename.Plo" scheme.
	206	echo "#dummy" > "$depfile"
	207	fi
	208	rm -f "$tmpdepfile"
	209	;;
	210
	211	aix)
	212	# The C for AIX Compiler uses -M and outputs the dependencies
	213	# in a .u file. In older versions, this file always lives in the
	214	# current directory. Also, the AIX compiler puts `$object:' at the
	215	# start of each line; $object doesn't have directory information.
	216	# Version 6 uses the directory in both cases.
	217	dir=`echo "$object" \| sed -e 's\|/[^/]*$\|/\|'`
	218	test "x$dir" = "x$object" && dir=
	219	base=`echo "$object" \| sed -e 's\|^.*/\|\|' -e 's/\.o$//' -e 's/\.lo$//'`
	220	if test "$libtool" = yes; then
	221	tmpdepfile1=$dir$base.u
	222	tmpdepfile2=$base.u
	223	tmpdepfile3=$dir.libs/$base.u
	224	"$@" -Wc,-M
	225	else
	226	tmpdepfile1=$dir$base.u
	227	tmpdepfile2=$dir$base.u
	228	tmpdepfile3=$dir$base.u
	229	"$@" -M
	230	fi
	231	stat=$?
	232
	233	if test $stat -eq 0; then :
	234	else
	235	rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
	236	exit $stat
	237	fi
	238
	239	for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
	240	do
	241	test -f "$tmpdepfile" && break
	242	done
	243	if test -f "$tmpdepfile"; then
	244	# Each line is of the form `foo.o: dependent.h'.
	245	# Do two passes, one to just change these to
	246	# `$object: dependent.h' and one to simply `dependent.h:'.
	247	sed -e "s,^.\.[a-z]:,$object:," < "$tmpdepfile" > "$depfile"
	248	# That's a tab and a space in the [].
	249	sed -e 's,^.\.[a-z]:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
	250	else
	251	# The sourcefile does not contain any dependencies, so just
	252	# store a dummy comment line, to avoid errors with the Makefile
	253	# "include basename.Plo" scheme.
	254	echo "#dummy" > "$depfile"
	255	fi
	256	rm -f "$tmpdepfile"
	257	;;
	258
	259	icc)
	260	# Intel's C compiler understands `-MD -MF file'. However on
	261	# icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c
	262	# ICC 7.0 will fill foo.d with something like
	263	# foo.o: sub/foo.c
	264	# foo.o: sub/foo.h
	265	# which is wrong. We want:
	266	# sub/foo.o: sub/foo.c
	267	# sub/foo.o: sub/foo.h
	268	# sub/foo.c:
	269	# sub/foo.h:
	270	# ICC 7.1 will output
	271	# foo.o: sub/foo.c sub/foo.h
	272	# and will wrap long lines using \ :
	273	# foo.o: sub/foo.c ... \
	274	# sub/foo.h ... \
	275	# ...
	276
	277	"$@" -MD -MF "$tmpdepfile"
	278	stat=$?
	279	if test $stat -eq 0; then :
	280	else
	281	rm -f "$tmpdepfile"
	282	exit $stat
	283	fi
	284	rm -f "$depfile"
	285	# Each line is of the form `foo.o: dependent.h',
	286	# or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'.
	287	# Do two passes, one to just change these to
	288	# `$object: dependent.h' and one to simply `dependent.h:'.
	289	sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile"
	290	# Some versions of the HPUX 10.20 sed can't process this invocation
	291	# correctly. Breaking it into two sed invocations is a workaround.
	292	sed 's,^[^:]: $.$$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" \|
	293	sed -e 's/$/ :/' >> "$depfile"
	294	rm -f "$tmpdepfile"
	295	;;
	296
	297	hp2)
	298	# The "hp" stanza above does not work with aCC (C++) and HP's ia64
	299	# compilers, which have integrated preprocessors. The correct option
	300	# to use with these is +Maked; it writes dependencies to a file named
	301	# 'foo.d', which lands next to the object file, wherever that
	302	# happens to be.
	303	# Much of this is similar to the tru64 case; see comments there.
	304	dir=`echo "$object" \| sed -e 's\|/[^/]*$\|/\|'`
	305	test "x$dir" = "x$object" && dir=
	306	base=`echo "$object" \| sed -e 's\|^.*/\|\|' -e 's/\.o$//' -e 's/\.lo$//'`
	307	if test "$libtool" = yes; then
	308	tmpdepfile1=$dir$base.d
	309	tmpdepfile2=$dir.libs/$base.d
	310	"$@" -Wc,+Maked
	311	else
	312	tmpdepfile1=$dir$base.d
	313	tmpdepfile2=$dir$base.d
	314	"$@" +Maked
	315	fi
	316	stat=$?
	317	if test $stat -eq 0; then :
	318	else
	319	rm -f "$tmpdepfile1" "$tmpdepfile2"
	320	exit $stat
	321	fi
	322
	323	for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2"
	324	do
	325	test -f "$tmpdepfile" && break
	326	done
	327	if test -f "$tmpdepfile"; then
	328	sed -e "s,^.\.[a-z]:,$object:," "$tmpdepfile" > "$depfile"
	329	# Add `dependent.h:' lines.
	330	sed -ne '2,${; s/^ //; s/ \\$//; s/$/:/; p;}' "$tmpdepfile" >> "$depfile"
	331	else
	332	echo "#dummy" > "$depfile"
	333	fi
	334	rm -f "$tmpdepfile" "$tmpdepfile2"
	335	;;
	336
	337	tru64)
	338	# The Tru64 compiler uses -MD to generate dependencies as a side
	339	# effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'.
	340	# At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put
	341	# dependencies in `foo.d' instead, so we check for that too.
	342	# Subdirectories are respected.
	343	dir=`echo "$object" \| sed -e 's\|/[^/]*$\|/\|'`
	344	test "x$dir" = "x$object" && dir=
	345	base=`echo "$object" \| sed -e 's\|^.*/\|\|' -e 's/\.o$//' -e 's/\.lo$//'`
	346
	347	if test "$libtool" = yes; then
	348	# With Tru64 cc, shared objects can also be used to make a
	349	# static library. This mechanism is used in libtool 1.4 series to
	350	# handle both shared and static libraries in a single compilation.
	351	# With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d.
	352	#
	353	# With libtool 1.5 this exception was removed, and libtool now
	354	# generates 2 separate objects for the 2 libraries. These two
	355	# compilations output dependencies in $dir.libs/$base.o.d and
	356	# in $dir$base.o.d. We have to check for both files, because
	357	# one of the two compilations can be disabled. We should prefer
	358	# $dir$base.o.d over $dir.libs/$base.o.d because the latter is
	359	# automatically cleaned when .libs/ is deleted, while ignoring
	360	# the former would cause a distcleancheck panic.
	361	tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4
	362	tmpdepfile2=$dir$base.o.d # libtool 1.5
	363	tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5
	364	tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504
	365	"$@" -Wc,-MD
	366	else
	367	tmpdepfile1=$dir$base.o.d
	368	tmpdepfile2=$dir$base.d
	369	tmpdepfile3=$dir$base.d
	370	tmpdepfile4=$dir$base.d
	371	"$@" -MD
	372	fi
	373
	374	stat=$?
	375	if test $stat -eq 0; then :
	376	else
	377	rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
	378	exit $stat
	379	fi
	380
	381	for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
	382	do
	383	test -f "$tmpdepfile" && break
	384	done
	385	if test -f "$tmpdepfile"; then
	386	sed -e "s,^.\.[a-z]:,$object:," < "$tmpdepfile" > "$depfile"
	387	# That's a tab and a space in the [].
	388	sed -e 's,^.\.[a-z]:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
	389	else
	390	echo "#dummy" > "$depfile"
	391	fi
	392	rm -f "$tmpdepfile"
	393	;;
	394
	395	#nosideeffect)
	396	# This comment above is used by automake to tell side-effect
	397	# dependency tracking mechanisms from slower ones.
	398
	399	dashmstdout)
	400	# Important note: in order to support this mode, a compiler must
	401	# always write the preprocessed file to stdout, regardless of -o.
	402	"$@" \|\| exit $?
	403
	404	# Remove the call to Libtool.
	405	if test "$libtool" = yes; then
	406	while test $1 != '--mode=compile'; do
	407	shift
	408	done
	409	shift
	410	fi
	411
	412	# Remove `-o $object'.
	413	IFS=" "
	414	for arg
	415	do
	416	case $arg in
	417	-o)
	418	shift
	419	;;
	420	$object)
	421	shift
	422	;;
	423	*)
	424	set fnord "$@" "$arg"
	425	shift # fnord
	426	shift # $arg
	427	;;
	428	esac
	429	done
	430
	431	test -z "$dashmflag" && dashmflag=-M
	432	# Require at least two characters before searching for `:'
	433	# in the target name. This is to cope with DOS-style filenames:
	434	# a dependency such as `c:/foo/bar' could be seen as target `c' otherwise.
	435	"$@" $dashmflag \|
	436	sed 's:^[ ][^: ][^:][^:]\:[ ]*:'"$object"'\: :' > "$tmpdepfile"
	437	rm -f "$depfile"
	438	cat < "$tmpdepfile" > "$depfile"
	439	tr ' ' '
	440	' < "$tmpdepfile" \| \
	441	## Some versions of the HPUX 10.20 sed can't process this invocation
	442	## correctly. Breaking it into two sed invocations is a workaround.
	443	sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \| sed -e 's/$/ :/' >> "$depfile"
	444	rm -f "$tmpdepfile"
	445	;;
	446
	447	dashXmstdout)
	448	# This case only exists to satisfy depend.m4. It is never actually
	449	# run, as this mode is specially recognized in the preamble.
	450	exit 1
	451	;;
	452
	453	makedepend)
	454	"$@" \|\| exit $?
	455	# Remove any Libtool call
	456	if test "$libtool" = yes; then
	457	while test $1 != '--mode=compile'; do
	458	shift
	459	done
	460	shift
	461	fi
	462	# X makedepend
	463	shift
	464	cleared=no
	465	for arg in "$@"; do
	466	case $cleared in
	467	no)
	468	set ""; shift
	469	cleared=yes ;;
	470	esac
	471	case "$arg" in
	472	-D\|-I)
	473	set fnord "$@" "$arg"; shift ;;
	474	# Strip any option that makedepend may not understand. Remove
	475	# the object too, otherwise makedepend will parse it as a source file.
	476	-*\|$object)
	477	;;
	478	*)
	479	set fnord "$@" "$arg"; shift ;;
	480	esac
	481	done
	482	obj_suffix="`echo $object \| sed 's/^.*\././'`"
	483	touch "$tmpdepfile"
	484	${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@"
	485	rm -f "$depfile"
	486	cat < "$tmpdepfile" > "$depfile"
	487	sed '1,2d' "$tmpdepfile" \| tr ' ' '
	488	' \| \
	489	## Some versions of the HPUX 10.20 sed can't process this invocation
	490	## correctly. Breaking it into two sed invocations is a workaround.
	491	sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \| sed -e 's/$/ :/' >> "$depfile"
	492	rm -f "$tmpdepfile" "$tmpdepfile".bak
	493	;;
	494
	495	cpp)
	496	# Important note: in order to support this mode, a compiler must
	497	# always write the preprocessed file to stdout.
	498	"$@" \|\| exit $?
	499
	500	# Remove the call to Libtool.
	501	if test "$libtool" = yes; then
	502	while test $1 != '--mode=compile'; do
	503	shift
	504	done
	505	shift
	506	fi
	507
	508	# Remove `-o $object'.
	509	IFS=" "
	510	for arg
	511	do
	512	case $arg in
	513	-o)
	514	shift
	515	;;
	516	$object)
	517	shift
	518	;;
	519	*)
	520	set fnord "$@" "$arg"
	521	shift # fnord
	522	shift # $arg
	523	;;
	524	esac
	525	done
	526
	527	"$@" -E \|
	528	sed -n -e '/^# [0-9][0-9]* "$[^"]$"./ s:: \1 \\:p' \
	529	-e '/^#line [0-9][0-9]* "$[^"]$"./ s:: \1 \\:p' \|
	530	sed '$ s: \\$::' > "$tmpdepfile"
	531	rm -f "$depfile"
	532	echo "$object : \\" > "$depfile"
	533	cat < "$tmpdepfile" >> "$depfile"
	534	sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile"
	535	rm -f "$tmpdepfile"
	536	;;
	537
	538	msvisualcpp)
	539	# Important note: in order to support this mode, a compiler must
	540	# always write the preprocessed file to stdout, regardless of -o,
	541	# because we must use -o when running libtool.
	542	"$@" \|\| exit $?
	543	IFS=" "
	544	for arg
	545	do
	546	case "$arg" in
	547	"-Gm"\|"/Gm"\|"-Gi"\|"/Gi"\|"-ZI"\|"/ZI")
	548	set fnord "$@"
	549	shift
	550	shift
	551	;;
	552	*)
	553	set fnord "$@" "$arg"
	554	shift
	555	shift
	556	;;
	557	esac
	558	done
	559	"$@" -E \|
	560	sed -n '/^#line [0-9][0-9]* "$[^"]*$"/ s::echo "`cygpath -u \\"\1\\"`":p' \| sort \| uniq > "$tmpdepfile"
	561	rm -f "$depfile"
	562	echo "$object : \\" > "$depfile"
	563	. "$tmpdepfile" \| sed 's% %\\ %g' \| sed -n '/^$.*$$/ s:: \1 \\:p' >> "$depfile"
	564	echo " " >> "$depfile"
	565	. "$tmpdepfile" \| sed 's% %\\ %g' \| sed -n '/^$.*$$/ s::\1\::p' >> "$depfile"
	566	rm -f "$tmpdepfile"
	567	;;
	568
	569	none)
	570	exec "$@"
	571	;;
	572
	573	*)
	574	echo "Unknown depmode $depmode" 1>&2
	575	exit 1
	576	;;
	577	esac
	578
	579	exit 0
	580
	581	# Local Variables:
	582	# mode: shell-script
	583	# sh-indentation: 2
	584	# eval: (add-hook 'write-file-hooks 'time-stamp)
	585	# time-stamp-start: "scriptversion="
	586	# time-stamp-format: "%:y-%02m-%02d.%02H"
	587	# time-stamp-end: "$"
	588	# End:

+4

-0

deriv/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-08-22 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* deriv.c (central_deriv): corrected dy term for error in h

+1

-1

deriv/Makefile.am less more

0	0	noinst_LTLIBRARIES = libgslderiv.la
1	1
2		INCLUDES= -I$(top_builddir)
	2	INCLUDES = -I$(top_srcdir)
3	3
4	4	libgslderiv_la_SOURCES = deriv.c
5	5

+5

-1

deriv/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

202	206	top_builddir = @top_builddir@
203	207	top_srcdir = @top_srcdir@
204	208	noinst_LTLIBRARIES = libgslderiv.la
205		INCLUDES = -I$(top_builddir)
	209	INCLUDES = -I$(top_srcdir)
206	210	libgslderiv_la_SOURCES = deriv.c
207	211	pkginclude_HEADERS = gsl_deriv.h
208	212	TESTS = $(check_PROGRAMS)

+4

-0

dht/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	Mon Apr 23 10:31:58 2001 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* unified error handling conventions to _e for error handling

+1

-1

dht/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_dht.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	TESTS = $(check_PROGRAMS)
7	7

+5

-1

dht/Makefile.in less more

132	132	LIBOBJS = @LIBOBJS@
133	133	LIBS = @LIBS@
134	134	LIBTOOL = @LIBTOOL@
	135	LIPO = @LIPO@
135	136	LN_S = @LN_S@
136	137	LTLIBOBJS = @LTLIBOBJS@
137	138	MAINT = @MAINT@

139	140	MKDIR_P = @MKDIR_P@
140	141	NM = @NM@
141	142	NMEDIT = @NMEDIT@
	143	OBJDUMP = @OBJDUMP@
142	144	OBJEXT = @OBJEXT@
	145	OTOOL = @OTOOL@
	146	OTOOL64 = @OTOOL64@
143	147	PACKAGE = @PACKAGE@
144	148	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
145	149	PACKAGE_NAME = @PACKAGE_NAME@

204	208	top_srcdir = @top_srcdir@
205	209	noinst_LTLIBRARIES = libgsldht.la
206	210	pkginclude_HEADERS = gsl_dht.h
207		INCLUDES = -I$(top_builddir)
	211	INCLUDES = -I$(top_srcdir)
208	212	TESTS = $(check_PROGRAMS)
209	213	test_LDADD = libgsldht.la ../specfunc/libgslspecfunc.la ../complex/libgslcomplex.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
210	214	test_SOURCES = test.c

+12

-0

diff/ChangeLog less more

	0	2008-09-18 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* diff.c test.c: temporarily enable deprecated functions for
	3	testing
	4
	5	* gsl_diff.h: marked these functions deprecated, use gsl_deriv
	6	instead.
	7
	8	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	9
	10	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	11
0	12	Mon Apr 23 13:26:21 2001 Brian Gough <bjg@network-theory.co.uk>
1	13
2	14	* Makefile.am: removed demo from Makefile

+1

-1

diff/Makefile.am less more

0	0	noinst_LTLIBRARIES = libgsldiff.la
1	1
2		INCLUDES= -I$(top_builddir)
	2	INCLUDES = -I$(top_srcdir)
3	3
4	4	libgsldiff_la_SOURCES = diff.c
5	5

+5

-1

diff/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

202	206	top_builddir = @top_builddir@
203	207	top_srcdir = @top_srcdir@
204	208	noinst_LTLIBRARIES = libgsldiff.la
205		INCLUDES = -I$(top_builddir)
	209	INCLUDES = -I$(top_srcdir)
206	210	libgsldiff_la_SOURCES = diff.c
207	211	pkginclude_HEADERS = gsl_diff.h
208	212	TESTS = $(check_PROGRAMS)

+2

-0

diff/diff.c less more

20	20	#include <stdlib.h>
21	21	#include <gsl/gsl_math.h>
22	22	#include <gsl/gsl_errno.h>
	23
	24	#undef GSL_DISABLE_DEPRECATED
23	25	#include <gsl/gsl_diff.h>
24	26
25	27	int

+2

-0

diff/gsl_diff.h less more

32	32
33	33	__BEGIN_DECLS
34	34
	35	#ifndef GSL_DISABLE_DEPRECATED
35	36	int gsl_diff_central (const gsl_function *f,
36	37	double x,
37	38	double result, double abserr);

43	44	int gsl_diff_forward (const gsl_function *f,
44	45	double x,
45	46	double result, double abserr);
	47	#endif
46	48
47	49	__END_DECLS
48	50

+3

-1

diff/test.c less more

21	21	#include <stdio.h>
22	22	#include <math.h>
23	23	#include <gsl/gsl_math.h>
24		#include <gsl/gsl_diff.h>
25	24	#include <gsl/gsl_errno.h>
26	25	#include <gsl/gsl_test.h>
27	26	#include <gsl/gsl_ieee_utils.h>
	27
	28	#undef GSL_DISABLE_DEPRECATED
	29	#include <gsl/gsl_diff.h>
28	30
29	31	double
30	32	f1 (double x, void *params)

+4

-0

eigen/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-08-30 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* test.c (test_eigen_symm): added new test case for underflow

+2

-1

eigen/Makefile.am less more

3	3
4	4	pkginclude_HEADERS = gsl_eigen.h
5	5	libgsleigen_la_SOURCES = jacobi.c symm.c symmv.c nonsymm.c nonsymmv.c herm.c hermv.c gensymm.c gensymmv.c genherm.c genhermv.c gen.c genv.c sort.c francis.c schur.c
6		INCLUDES= -I$(top_builddir)
	6
	7	INCLUDES = -I$(top_srcdir)
7	8
8	9	noinst_HEADERS = qrstep.c
9	10

+5

-1

eigen/Makefile.in less more

138	138	LIBOBJS = @LIBOBJS@
139	139	LIBS = @LIBS@
140	140	LIBTOOL = @LIBTOOL@
	141	LIPO = @LIPO@
141	142	LN_S = @LN_S@
142	143	LTLIBOBJS = @LTLIBOBJS@
143	144	MAINT = @MAINT@

145	146	MKDIR_P = @MKDIR_P@
146	147	NM = @NM@
147	148	NMEDIT = @NMEDIT@
	149	OBJDUMP = @OBJDUMP@
148	150	OBJEXT = @OBJEXT@
	151	OTOOL = @OTOOL@
	152	OTOOL64 = @OTOOL64@
149	153	PACKAGE = @PACKAGE@
150	154	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
151	155	PACKAGE_NAME = @PACKAGE_NAME@

211	215	noinst_LTLIBRARIES = libgsleigen.la
212	216	pkginclude_HEADERS = gsl_eigen.h
213	217	libgsleigen_la_SOURCES = jacobi.c symm.c symmv.c nonsymm.c nonsymmv.c herm.c hermv.c gensymm.c gensymmv.c genherm.c genhermv.c gen.c genv.c sort.c francis.c schur.c
214		INCLUDES = -I$(top_builddir)
	218	INCLUDES = -I$(top_srcdir)
215	219	noinst_HEADERS = qrstep.c
216	220	TESTS = $(check_PROGRAMS)
217	221	test_LDADD = libgsleigen.la ../test/libgsltest.la ../linalg/libgsllinalg.la ../permutation/libgslpermutation.la ../blas/libgslblas.la ../cblas/libgslcblas.la ../matrix/libgslmatrix.la ../vector/libgslvector.la ../block/libgslblock.la ../complex/libgslcomplex.la ../ieee-utils/libgslieeeutils.la ../sys/libgslsys.la ../err/libgslerr.la ../utils/libutils.la ../rng/libgslrng.la ../sort/libgslsort.la

+1

-1

eigen/gen.c less more

117	117	GSL_EINVAL);
118	118	}
119	119
120		w = calloc (1, sizeof (gsl_eigen_gen_workspace));
	120	w = (gsl_eigen_gen_workspace *) calloc (1, sizeof (gsl_eigen_gen_workspace));
121	121
122	122	if (w == 0)
123	123	{

+1

-1

eigen/genherm.c less more

56	56	GSL_EINVAL);
57	57	}
58	58
59		w = calloc (1, sizeof (gsl_eigen_genherm_workspace));
	59	w = (gsl_eigen_genherm_workspace *) calloc (1, sizeof (gsl_eigen_genherm_workspace));
60	60
61	61	if (w == 0)
62	62	{

+1

-1

eigen/genhermv.c less more

58	58	GSL_EINVAL);
59	59	}
60	60
61		w = calloc (1, sizeof (gsl_eigen_genhermv_workspace));
	61	w = (gsl_eigen_genhermv_workspace *) calloc (1, sizeof (gsl_eigen_genhermv_workspace));
62	62
63	63	if (w == 0)
64	64	{

+1

-1

eigen/gensymm.c less more

54	54	GSL_EINVAL);
55	55	}
56	56
57		w = calloc (1, sizeof (gsl_eigen_gensymm_workspace));
	57	w = (gsl_eigen_gensymm_workspace *) calloc (1, sizeof (gsl_eigen_gensymm_workspace));
58	58
59	59	if (w == 0)
60	60	{

+1

-1

eigen/gensymmv.c less more

56	56	GSL_EINVAL);
57	57	}
58	58
59		w = calloc (1, sizeof (gsl_eigen_gensymmv_workspace));
	59	w = (gsl_eigen_gensymmv_workspace *) calloc (1, sizeof (gsl_eigen_gensymmv_workspace));
60	60
61	61	if (w == 0)
62	62	{

+1

-1

eigen/genv.c less more

67	67	GSL_EINVAL);
68	68	}
69	69
70		w = calloc (1, sizeof (gsl_eigen_genv_workspace));
	70	w = (gsl_eigen_genv_workspace *) calloc (1, sizeof (gsl_eigen_genv_workspace));
71	71
72	72	if (w == 0)
73	73	{

+2

-2

eigen/test.c less more

506	506	= gsl_matrix_complex_const_column(evec, j);
507	507	gsl_complex vivj;
508	508	gsl_blas_zdotc (&vi.vector, &vj.vector, &vivj);
509		gsl_test_abs (gsl_complex_abs(vivj), 0.0, N * GSL_DBL_EPSILON,
	509	gsl_test_abs (gsl_complex_abs(vivj), 0.0, 10.0 * N * GSL_DBL_EPSILON,
510	510	"%s, orthogonal(%d,%d), %s", desc, i, j, desc2);
511	511	}
512	512	}

1057	1057	{
1058	1058	test_eigen_gen_workspace *w;
1059	1059
1060		w = calloc(1, sizeof(test_eigen_gen_workspace));
	1060	w = (test_eigen_gen_workspace *) calloc(1, sizeof(test_eigen_gen_workspace));
1061	1061
1062	1062	w->A = gsl_matrix_alloc(n, n);
1063	1063	w->B = gsl_matrix_alloc(n, n);

+4

-0

err/Makefile.in less more

130	130	LIBOBJS = @LIBOBJS@
131	131	LIBS = @LIBS@
132	132	LIBTOOL = @LIBTOOL@
	133	LIPO = @LIPO@
133	134	LN_S = @LN_S@
134	135	LTLIBOBJS = @LTLIBOBJS@
135	136	MAINT = @MAINT@

137	138	MKDIR_P = @MKDIR_P@
138	139	NM = @NM@
139	140	NMEDIT = @NMEDIT@
	141	OBJDUMP = @OBJDUMP@
140	142	OBJEXT = @OBJEXT@
	143	OTOOL = @OTOOL@
	144	OTOOL64 = @OTOOL64@
141	145	PACKAGE = @PACKAGE@
142	146	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
143	147	PACKAGE_NAME = @PACKAGE_NAME@

+4

-0

fft/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2006-03-16 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* changed to gsl_fft_forward and gsl_fft_backward enums throughout

+1

-1

fft/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_fft.h gsl_fft_complex.h gsl_fft_halfcomplex.h gsl_fft_real.h gsl_dft_complex.h gsl_dft_complex_float.h gsl_fft_complex_float.h gsl_fft_halfcomplex_float.h gsl_fft_real_float.h
3	3
4		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslfft_la_SOURCES = dft.c fft.c
7	7

+5

-1

fft/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

203	207	top_srcdir = @top_srcdir@
204	208	noinst_LTLIBRARIES = libgslfft.la
205	209	pkginclude_HEADERS = gsl_fft.h gsl_fft_complex.h gsl_fft_halfcomplex.h gsl_fft_real.h gsl_dft_complex.h gsl_dft_complex_float.h gsl_fft_complex_float.h gsl_fft_halfcomplex_float.h gsl_fft_real_float.h
206		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
	210	INCLUDES = -I$(top_srcdir)
207	211	libgslfft_la_SOURCES = dft.c fft.c
208	212	noinst_HEADERS = c_pass.h hc_pass.h real_pass.h signals.h signals_source.c c_main.c c_init.c c_pass_2.c c_pass_3.c c_pass_4.c c_pass_5.c c_pass_6.c c_pass_7.c c_pass_n.c c_radix2.c bitreverse.c bitreverse.h factorize.c factorize.h hc_init.c hc_pass_2.c hc_pass_3.c hc_pass_4.c hc_pass_5.c hc_pass_n.c hc_radix2.c hc_unpack.c real_init.c real_pass_2.c real_pass_3.c real_pass_4.c real_pass_5.c real_pass_n.c real_radix2.c real_unpack.c compare.h compare_source.c dft_source.c hc_main.c real_main.c test_complex_source.c test_real_source.c test_trap_source.c urand.c complex_internal.h
209	213	TESTS = $(check_PROGRAMS)

+4

-0

fit/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-05-23 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* gsl_fit.h linear.c (gsl_fit_mul_est, gsl_fit_linear_est): made

+1

-1

fit/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_fit.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslfit_la_SOURCES = linear.c
7	7

+5

-1

fit/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

203	207	top_srcdir = @top_srcdir@
204	208	noinst_LTLIBRARIES = libgslfit.la
205	209	pkginclude_HEADERS = gsl_fit.h
206		INCLUDES = -I$(top_builddir)
	210	INCLUDES = -I$(top_srcdir)
207	211	libgslfit_la_SOURCES = linear.c
208	212	TESTS = $(check_PROGRAMS)
209	213	test_SOURCES = test.c

+4

-0

gsl/Makefile.in less more

97	97	LIBOBJS = @LIBOBJS@
98	98	LIBS = @LIBS@
99	99	LIBTOOL = @LIBTOOL@
	100	LIPO = @LIPO@
100	101	LN_S = @LN_S@
101	102	LTLIBOBJS = @LTLIBOBJS@
102	103	MAINT = @MAINT@

104	105	MKDIR_P = @MKDIR_P@
105	106	NM = @NM@
106	107	NMEDIT = @NMEDIT@
	108	OBJDUMP = @OBJDUMP@
107	109	OBJEXT = @OBJEXT@
	110	OTOOL = @OTOOL@
	111	OTOOL64 = @OTOOL64@
108	112	PACKAGE = @PACKAGE@
109	113	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
110	114	PACKAGE_NAME = @PACKAGE_NAME@

+67

-0

gsl_inline.h less more

	0	/* gsl_inline.h
	1	*
	2	* Copyright (C) 2008 Brian Gough
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	#ifndef __GSL_INLINE_H__
	20	#define __GSL_INLINE_H__
	21
	22	/* In recent versiions of GCC, the inline keyword has two different
	23	forms: GNU and C99.
	24
	25	In GNU mode we can use 'extern inline' to make inline functions
	26	work like macros. The function is only inlined--it is never output
	27	as a definition in an object file.
	28
	29	In the new C99 mode 'extern inline' has a different meaning--it
	30	causes the definition of the function to be output in each object
	31	file where it is used. This will result in multiple-definition
	32	errors on linking. The 'inline' keyword on its own (without
	33	extern) has the same behavior as the original GNU 'extern inline'.
	34
	35	The C99 style is the default with -std=c99 in GCC 4.3.
	36
	37	This header file allows either form of inline to be used by
	38	redefining the macros INLINE_DECL and INLINE_FUN. These are used
	39	in the public header files as
	40
	41	INLINE_DECL double gsl_foo (double x);
	42	#ifdef HAVE_INLINE
	43	INLINE_FUN double gsl_foo (double x) { return x+1.0; } ;
	44	#endif
	45
	46	*/
	47
	48	#ifdef HAVE_INLINE
	49	# if defined(__GNUC_STDC_INLINE__) \|\| defined(GSL_C99_INLINE)
	50	# define INLINE_DECL inline /* use C99 inline */
	51	# define INLINE_FUN inline
	52	# else
	53	# define INLINE_DECL /* use GNU extern inline */
	54	# define INLINE_FUN extern inline
	55	# endif
	56	#else
	57	# define INLINE_DECL /* */
	58	#endif
	59
	60	/* Range checking conditions in headers do not require any run-time
	61	tests of the global variable gsl_check_range. They are enabled or
	62	disabled in user code at compile time with GSL_RANGE_CHECK macro.
	63	See also build.h. */
	64	#define GSL_RANGE_COND(x) (x)
	65
	66	#endif /* __GSL_INLINE_H__ */

+2

-64

gsl_math.h less more

20	20	#define __GSL_MATH_H__
21	21	#include <math.h>
22	22	#include <gsl/gsl_sys.h>
	23	#include <gsl/gsl_inline.h>
23	24	#include <gsl/gsl_machine.h>
24	25	#include <gsl/gsl_precision.h>
25	26	#include <gsl/gsl_nan.h>
26	27	#include <gsl/gsl_pow_int.h>
	28	#include <gsl/gsl_minmax.h>
27	29
28	30	#ifndef M_E
29	31	#define M_E 2.71828182845904523536028747135 /* e */

115	117	/* Return nonzero if x is a real number, i.e. non NaN or infinite. */
116	118	#define GSL_IS_REAL(x) (gsl_finite(x))
117	119
118		/* Define MAX and MIN macros/functions if they don't exist. */
119
120		/* plain old macros for general use */
121		#define GSL_MAX(a,b) ((a) > (b) ? (a) : (b))
122		#define GSL_MIN(a,b) ((a) < (b) ? (a) : (b))
123
124		/* function versions of the above, in case they are needed */
125		double gsl_max (double a, double b);
126		double gsl_min (double a, double b);
127
128		/* inline-friendly strongly typed versions */
129		#ifdef HAVE_INLINE
130
131		extern inline int GSL_MAX_INT (int a, int b);
132		extern inline int GSL_MIN_INT (int a, int b);
133		extern inline double GSL_MAX_DBL (double a, double b);
134		extern inline double GSL_MIN_DBL (double a, double b);
135		extern inline long double GSL_MAX_LDBL (long double a, long double b);
136		extern inline long double GSL_MIN_LDBL (long double a, long double b);
137
138		extern inline int
139		GSL_MAX_INT (int a, int b)
140		{
141		return GSL_MAX (a, b);
142		}
143
144		extern inline int
145		GSL_MIN_INT (int a, int b)
146		{
147		return GSL_MIN (a, b);
148		}
149
150		extern inline double
151		GSL_MAX_DBL (double a, double b)
152		{
153		return GSL_MAX (a, b);
154		}
155
156		extern inline double
157		GSL_MIN_DBL (double a, double b)
158		{
159		return GSL_MIN (a, b);
160		}
161
162		extern inline long double
163		GSL_MAX_LDBL (long double a, long double b)
164		{
165		return GSL_MAX (a, b);
166		}
167
168		extern inline long double
169		GSL_MIN_LDBL (long double a, long double b)
170		{
171		return GSL_MIN (a, b);
172		}
173		#else
174		#define GSL_MAX_INT(a,b) GSL_MAX(a,b)
175		#define GSL_MIN_INT(a,b) GSL_MIN(a,b)
176		#define GSL_MAX_DBL(a,b) GSL_MAX(a,b)
177		#define GSL_MIN_DBL(a,b) GSL_MIN(a,b)
178		#define GSL_MAX_LDBL(a,b) GSL_MAX(a,b)
179		#define GSL_MIN_LDBL(a,b) GSL_MIN(a,b)
180		#endif /* HAVE_INLINE */
181
182	120	/* Definition of an arbitrary function with parameters */
183	121
184	122	struct gsl_function_struct

+102

-0

gsl_minmax.h less more

	0	/* gsl_minmax.h
	1	*
	2	* Copyright (C) 2008 Gerard Jungman, Brian Gough
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	#ifndef __GSL_MINMAX_H__
	20	#define __GSL_MINMAX_H__
	21	#include <gsl/gsl_inline.h>
	22
	23	#undef __BEGIN_DECLS
	24	#undef __END_DECLS
	25	#ifdef __cplusplus
	26	# define __BEGIN_DECLS extern "C" {
	27	# define __END_DECLS }
	28	#else
	29	# define __BEGIN_DECLS /* empty */
	30	# define __END_DECLS /* empty */
	31	#endif
	32
	33	__BEGIN_DECLS
	34
	35	/* Define MAX and MIN macros/functions if they don't exist. */
	36
	37	/* plain old macros for general use */
	38	#define GSL_MAX(a,b) ((a) > (b) ? (a) : (b))
	39	#define GSL_MIN(a,b) ((a) < (b) ? (a) : (b))
	40
	41	/* function versions of the above, in case they are needed */
	42	double gsl_max (double a, double b);
	43	double gsl_min (double a, double b);
	44
	45	/* inline-friendly strongly typed versions */
	46	#ifdef HAVE_INLINE
	47
	48	INLINE_FUN int GSL_MAX_INT (int a, int b);
	49	INLINE_FUN int GSL_MIN_INT (int a, int b);
	50	INLINE_FUN double GSL_MAX_DBL (double a, double b);
	51	INLINE_FUN double GSL_MIN_DBL (double a, double b);
	52	INLINE_FUN long double GSL_MAX_LDBL (long double a, long double b);
	53	INLINE_FUN long double GSL_MIN_LDBL (long double a, long double b);
	54
	55	INLINE_FUN int
	56	GSL_MAX_INT (int a, int b)
	57	{
	58	return GSL_MAX (a, b);
	59	}
	60
	61	INLINE_FUN int
	62	GSL_MIN_INT (int a, int b)
	63	{
	64	return GSL_MIN (a, b);
	65	}
	66
	67	INLINE_FUN double
	68	GSL_MAX_DBL (double a, double b)
	69	{
	70	return GSL_MAX (a, b);
	71	}
	72
	73	INLINE_FUN double
	74	GSL_MIN_DBL (double a, double b)
	75	{
	76	return GSL_MIN (a, b);
	77	}
	78
	79	INLINE_FUN long double
	80	GSL_MAX_LDBL (long double a, long double b)
	81	{
	82	return GSL_MAX (a, b);
	83	}
	84
	85	INLINE_FUN long double
	86	GSL_MIN_LDBL (long double a, long double b)
	87	{
	88	return GSL_MIN (a, b);
	89	}
	90	#else
	91	#define GSL_MAX_INT(a,b) GSL_MAX(a,b)
	92	#define GSL_MIN_INT(a,b) GSL_MIN(a,b)
	93	#define GSL_MAX_DBL(a,b) GSL_MAX(a,b)
	94	#define GSL_MIN_DBL(a,b) GSL_MIN(a,b)
	95	#define GSL_MAX_LDBL(a,b) GSL_MAX(a,b)
	96	#define GSL_MIN_LDBL(a,b) GSL_MIN(a,b)
	97	#endif /* HAVE_INLINE */
	98
	99	__END_DECLS
	100
	101	#endif /* __GSL_POW_INT_H__ */

+3

-2

gsl_mode.h less more

20	20
21	21	#ifndef __GSL_MODE_H__
22	22	#define __GSL_MODE_H__
	23	#include <gsl/gsl_inline.h>
23	24
24	25	#undef __BEGIN_DECLS
25	26	#undef __END_DECLS

66	67	#define GSL_PREC_APPROX 2
67	68
68	69	#ifdef HAVE_INLINE
69		extern inline unsigned int GSL_MODE_PREC(gsl_mode_t mt);
	70	INLINE_FUN unsigned int GSL_MODE_PREC(gsl_mode_t mt);
70	71
71		extern inline unsigned int
	72	INLINE_FUN unsigned int
72	73	GSL_MODE_PREC(gsl_mode_t mt)
73	74	{ return (mt & (unsigned int)7); }
74	75	#else /* HAVE_INLINE */

+18

-26

gsl_pow_int.h less more

18	18
19	19	#ifndef __GSL_POW_INT_H__
20	20	#define __GSL_POW_INT_H__
	21	#include <gsl/gsl_inline.h>
21	22
22	23	#undef __BEGIN_DECLS
23	24	#undef __END_DECLS

31	32
32	33	__BEGIN_DECLS
33	34
	35	INLINE_DECL double gsl_pow_2(const double x);
	36	INLINE_DECL double gsl_pow_3(const double x);
	37	INLINE_DECL double gsl_pow_4(const double x);
	38	INLINE_DECL double gsl_pow_5(const double x);
	39	INLINE_DECL double gsl_pow_6(const double x);
	40	INLINE_DECL double gsl_pow_7(const double x);
	41	INLINE_DECL double gsl_pow_8(const double x);
	42	INLINE_DECL double gsl_pow_9(const double x);
	43
34	44	#ifdef HAVE_INLINE
35		extern inline double gsl_pow_2(const double x);
36		extern inline double gsl_pow_3(const double x);
37		extern inline double gsl_pow_4(const double x);
38		extern inline double gsl_pow_5(const double x);
39		extern inline double gsl_pow_6(const double x);
40		extern inline double gsl_pow_7(const double x);
41		extern inline double gsl_pow_8(const double x);
42		extern inline double gsl_pow_9(const double x);
43
44		extern inline double gsl_pow_2(const double x) { return x*x; }
45		extern inline double gsl_pow_3(const double x) { return xxx; }
46		extern inline double gsl_pow_4(const double x) { double x2 = xx; return x2x2; }
47		extern inline double gsl_pow_5(const double x) { double x2 = xx; return x2x2*x; }
48		extern inline double gsl_pow_6(const double x) { double x2 = xx; return x2x2*x2; }
49		extern inline double gsl_pow_7(const double x) { double x3 = xxx; return x3x3x; }
50		extern inline double gsl_pow_8(const double x) { double x2 = xx; double x4 = x2x2; return x4*x4; }
51		extern inline double gsl_pow_9(const double x) { double x3 = xxx; return x3x3x3; }
52		#else
53		double gsl_pow_2(const double x);
54		double gsl_pow_3(const double x);
55		double gsl_pow_4(const double x);
56		double gsl_pow_5(const double x);
57		double gsl_pow_6(const double x);
58		double gsl_pow_7(const double x);
59		double gsl_pow_8(const double x);
60		double gsl_pow_9(const double x);
	45	INLINE_FUN double gsl_pow_2(const double x) { return x*x; }
	46	INLINE_FUN double gsl_pow_3(const double x) { return xxx; }
	47	INLINE_FUN double gsl_pow_4(const double x) { double x2 = xx; return x2x2; }
	48	INLINE_FUN double gsl_pow_5(const double x) { double x2 = xx; return x2x2*x; }
	49	INLINE_FUN double gsl_pow_6(const double x) { double x2 = xx; return x2x2*x2; }
	50	INLINE_FUN double gsl_pow_7(const double x) { double x3 = xxx; return x3x3x; }
	51	INLINE_FUN double gsl_pow_8(const double x) { double x2 = xx; double x4 = x2x2; return x4*x4; }
	52	INLINE_FUN double gsl_pow_9(const double x) { double x3 = xxx; return x3x3x3; }
61	53	#endif
62	54
63	55	double gsl_pow_int(double x, int n);

+1

-1

gsl_version.h less more

14	14	__BEGIN_DECLS
15	15
16	16
17		#define GSL_VERSION "1.11"
	17	#define GSL_VERSION "1.12"
18	18
19	19	GSL_VAR const char * gsl_version;
20	20

+4

-0

histogram/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2004-11-28 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* init2d.c (make_uniform): compute uniform range without

+1

-1

histogram/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_histogram.h gsl_histogram2d.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslhistogram_la_SOURCES = add.c get.c init.c params.c reset.c file.c pdf.c gsl_histogram.h add2d.c get2d.c init2d.c params2d.c reset2d.c file2d.c pdf2d.c gsl_histogram2d.h calloc_range.c calloc_range2d.c copy.c copy2d.c maxval.c maxval2d.c oper.c oper2d.c stat.c stat2d.c
7	7

+5

-1

histogram/Makefile.in less more

137	137	LIBOBJS = @LIBOBJS@
138	138	LIBS = @LIBS@
139	139	LIBTOOL = @LIBTOOL@
	140	LIPO = @LIPO@
140	141	LN_S = @LN_S@
141	142	LTLIBOBJS = @LTLIBOBJS@
142	143	MAINT = @MAINT@

144	145	MKDIR_P = @MKDIR_P@
145	146	NM = @NM@
146	147	NMEDIT = @NMEDIT@
	148	OBJDUMP = @OBJDUMP@
147	149	OBJEXT = @OBJEXT@
	150	OTOOL = @OTOOL@
	151	OTOOL64 = @OTOOL64@
148	152	PACKAGE = @PACKAGE@
149	153	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
150	154	PACKAGE_NAME = @PACKAGE_NAME@

209	213	top_srcdir = @top_srcdir@
210	214	noinst_LTLIBRARIES = libgslhistogram.la
211	215	pkginclude_HEADERS = gsl_histogram.h gsl_histogram2d.h
212		INCLUDES = -I$(top_builddir)
	216	INCLUDES = -I$(top_srcdir)
213	217	libgslhistogram_la_SOURCES = add.c get.c init.c params.c reset.c file.c pdf.c gsl_histogram.h add2d.c get2d.c init2d.c params2d.c reset2d.c file2d.c pdf2d.c gsl_histogram2d.h calloc_range.c calloc_range2d.c copy.c copy2d.c maxval.c maxval2d.c oper.c oper2d.c stat.c stat2d.c
214	218	noinst_HEADERS = urand.c find.c find2d.c
215	219	TESTS = $(check_PROGRAMS)

+4

-0

ieee-utils/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-06-21 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* fp.c: allow universal binaries by checking __ppc__ and __i386__

+1

-1

ieee-utils/Makefile.am less more

5	5
6	6	noinst_HEADERS = fp-aix.c fp-darwin.c fp-darwin86.c fp-hpux.c fp-hpux11.c fp-irix.c fp-gnum68k.c fp-gnuppc.c fp-solaris.c fp-gnusparc.c fp-sunos4.c fp-tru64.c fp-unknown.c fp-gnux86.c fp-freebsd.c fp-os2emx.c fp-netbsd.c fp-openbsd.c fp-gnuc99.c endian.c standardize.c
7	7
8		INCLUDES= -I$(top_builddir)
	8	INCLUDES = -I$(top_srcdir)
9	9
10	10	TESTS = $(check_PROGRAMS)
11	11	check_PROGRAMS = test

+5

-1

ieee-utils/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

205	209	pkginclude_HEADERS = gsl_ieee_utils.h
206	210	libgslieeeutils_la_SOURCES = print.c make_rep.c gsl_ieee_utils.h env.c fp.c read.c
207	211	noinst_HEADERS = fp-aix.c fp-darwin.c fp-darwin86.c fp-hpux.c fp-hpux11.c fp-irix.c fp-gnum68k.c fp-gnuppc.c fp-solaris.c fp-gnusparc.c fp-sunos4.c fp-tru64.c fp-unknown.c fp-gnux86.c fp-freebsd.c fp-os2emx.c fp-netbsd.c fp-openbsd.c fp-gnuc99.c endian.c standardize.c
208		INCLUDES = -I$(top_builddir)
	212	INCLUDES = -I$(top_srcdir)
209	213	TESTS = $(check_PROGRAMS)
210	214	test_LDADD = libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
211	215	test_SOURCES = test.c

+4

-0

integration/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2003-01-12 Brian Gough <brian.gough@network-theory.co.uk>
1	5
2	6	* qawc.c (gsl_integration_qawc): fixed bisection condition to

+1

-1

integration/Makefile.am less more

0	0	noinst_LTLIBRARIES = libgslintegration.la
1	1
2		INCLUDES= -I$(top_builddir)
	2	INCLUDES = -I$(top_srcdir)
3	3
4	4	libgslintegration_la_SOURCES = qk15.c qk21.c qk31.c qk41.c qk51.c qk61.c qk.c qng.c qng.h qag.c qags.c qagp.c workspace.c qcheb.c qawc.c qmomo.c qaws.c qmomof.c qawo.c qawf.c
5	5

+5

-1

integration/Makefile.in less more

134	134	LIBOBJS = @LIBOBJS@
135	135	LIBS = @LIBS@
136	136	LIBTOOL = @LIBTOOL@
	137	LIPO = @LIPO@
137	138	LN_S = @LN_S@
138	139	LTLIBOBJS = @LTLIBOBJS@
139	140	MAINT = @MAINT@

141	142	MKDIR_P = @MKDIR_P@
142	143	NM = @NM@
143	144	NMEDIT = @NMEDIT@
	145	OBJDUMP = @OBJDUMP@
144	146	OBJEXT = @OBJEXT@
	147	OTOOL = @OTOOL@
	148	OTOOL64 = @OTOOL64@
145	149	PACKAGE = @PACKAGE@
146	150	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
147	151	PACKAGE_NAME = @PACKAGE_NAME@

205	209	top_builddir = @top_builddir@
206	210	top_srcdir = @top_srcdir@
207	211	noinst_LTLIBRARIES = libgslintegration.la
208		INCLUDES = -I$(top_builddir)
	212	INCLUDES = -I$(top_srcdir)
209	213	libgslintegration_la_SOURCES = qk15.c qk21.c qk31.c qk41.c qk51.c qk61.c qk.c qng.c qng.h qag.c qags.c qagp.c workspace.c qcheb.c qawc.c qmomo.c qaws.c qmomof.c qawo.c qawf.c
210	214	pkginclude_HEADERS = gsl_integration.h
211	215	noinst_HEADERS = qpsrt.c qpsrt2.c qelg.c qc25c.c qc25s.c qc25f.c ptsort.c util.c err.c positivity.c append.c initialise.c set_initial.c reset.c

+15

-0

interpolation/ChangeLog less more

	0	2008-09-05 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* gsl_interp.h (gsl_interp_accel_find): corrected condition for
	3	x>=xa.
	4
	5	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	6
	7	* gsl_interp.h: added inline declarations
	8
	9	* accel.c: moved gsl_interp_accel_find to inline.c
	10
	11	* bsearch.h bsearch.c: removed, moved to inline.c
	12
	13	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	14
0	15	2007-03-14 Brian Gough <bjg@network-theory.co.uk>
1	16
2	17	* interp.c (gsl_interp_init): added check for monotonically

+2

-4

interpolation/Makefile.am less more

3	3
4	4	pkginclude_HEADERS = gsl_interp.h gsl_spline.h
5	5
6		libgslinterpolation_la_SOURCES = accel.c akima.c bsearch.c cspline.c interp.c linear.c integ_eval.h spline.c poly.c
	6	libgslinterpolation_la_SOURCES = accel.c akima.c cspline.c interp.c linear.c integ_eval.h spline.c poly.c inline.c
7	7
8		noinst_HEADERS = bsearch.h
9
10		INCLUDES= -I$(top_builddir)
	8	INCLUDES = -I$(top_srcdir)
11	9
12	10	TESTS = $(check_PROGRAMS)
13	11

+11

-8

interpolation/Makefile.in less more

34	34	host_triplet = @host@
35	35	check_PROGRAMS = test$(EXEEXT)
36	36	subdir = interpolation
37		DIST_COMMON = $(noinst_HEADERS) $(pkginclude_HEADERS) \
38		$(srcdir)/Makefile.am $(srcdir)/Makefile.in ChangeLog TODO
	37	DIST_COMMON = $(pkginclude_HEADERS) $(srcdir)/Makefile.am \
	38	$(srcdir)/Makefile.in ChangeLog TODO
39	39	ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
40	40	am__aclocal_m4_deps = $(top_srcdir)/configure.ac
41	41	am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \

45	45	CONFIG_CLEAN_FILES =
46	46	LTLIBRARIES = $(noinst_LTLIBRARIES)
47	47	libgslinterpolation_la_LIBADD =
48		am_libgslinterpolation_la_OBJECTS = accel.lo akima.lo bsearch.lo \
49		cspline.lo interp.lo linear.lo spline.lo poly.lo
	48	am_libgslinterpolation_la_OBJECTS = accel.lo akima.lo cspline.lo \
	49	interp.lo linear.lo spline.lo poly.lo inline.lo
50	50	libgslinterpolation_la_OBJECTS = $(am_libgslinterpolation_la_OBJECTS)
51	51	am_test_OBJECTS = test.$(OBJEXT)
52	52	test_OBJECTS = $(am_test_OBJECTS)

79	79	am__strip_dir = `echo $$p \| sed -e 's\|^.*/\|\|'`;
80	80	am__installdirs = "$(DESTDIR)$(pkgincludedir)"
81	81	pkgincludeHEADERS_INSTALL = $(INSTALL_HEADER)
82		HEADERS = $(noinst_HEADERS) $(pkginclude_HEADERS)
	82	HEADERS = $(pkginclude_HEADERS)
83	83	ETAGS = etags
84	84	CTAGS = ctags
85	85	DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)

136	136	LIBOBJS = @LIBOBJS@
137	137	LIBS = @LIBS@
138	138	LIBTOOL = @LIBTOOL@
	139	LIPO = @LIPO@
139	140	LN_S = @LN_S@
140	141	LTLIBOBJS = @LTLIBOBJS@
141	142	MAINT = @MAINT@

143	144	MKDIR_P = @MKDIR_P@
144	145	NM = @NM@
145	146	NMEDIT = @NMEDIT@
	147	OBJDUMP = @OBJDUMP@
146	148	OBJEXT = @OBJEXT@
	149	OTOOL = @OTOOL@
	150	OTOOL64 = @OTOOL64@
147	151	PACKAGE = @PACKAGE@
148	152	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
149	153	PACKAGE_NAME = @PACKAGE_NAME@

208	212	top_srcdir = @top_srcdir@
209	213	noinst_LTLIBRARIES = libgslinterpolation.la
210	214	pkginclude_HEADERS = gsl_interp.h gsl_spline.h
211		libgslinterpolation_la_SOURCES = accel.c akima.c bsearch.c cspline.c interp.c linear.c integ_eval.h spline.c poly.c
212		noinst_HEADERS = bsearch.h
213		INCLUDES = -I$(top_builddir)
	215	libgslinterpolation_la_SOURCES = accel.c akima.c cspline.c interp.c linear.c integ_eval.h spline.c poly.c inline.c
	216	INCLUDES = -I$(top_srcdir)
214	217	TESTS = $(check_PROGRAMS)
215	218	test_LDADD = libgslinterpolation.la ../poly/libgslpoly.la ../linalg/libgsllinalg.la ../permutation/libgslpermutation.la ../blas/libgslblas.la ../matrix/libgslmatrix.la ../vector/libgslvector.la ../block/libgslblock.la ../complex/libgslcomplex.la ../cblas/libgslcblas.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
216	219	test_SOURCES = test.c

+0

-25

interpolation/accel.c less more

49	49	return GSL_SUCCESS;
50	50	}
51	51
52		#ifndef HIDE_INLINE_STATIC
53		size_t
54		gsl_interp_accel_find (gsl_interp_accel * a, const double xa[], size_t len, double x)
55		{
56		size_t x_index = a->cache;
57
58		if (x < xa[x_index])
59		{
60		a->miss_count++;
61		a->cache = gsl_interp_bsearch (xa, x, 0, x_index);
62		}
63		else if (x > xa[x_index + 1])
64		{
65		a->miss_count++;
66		a->cache = gsl_interp_bsearch (xa, x, x_index, len - 1);
67		}
68		else
69		{
70		a->hit_count++;
71		}
72
73		return a->cache;
74		}
75		#endif
76
77	52	void
78	53	gsl_interp_accel_free (gsl_interp_accel * a)
79	54	{

+0

-47

~~interpolation/bsearch.c~~ less more

0		/* interpolation/bsearch.c
1		*
2		* Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman
3		*
4		* This program is free software; you can redistribute it and/or modify
5		* it under the terms of the GNU General Public License as published by
6		* the Free Software Foundation; either version 3 of the License, or (at
7		* your option) any later version.
8		*
9		* This program is distributed in the hope that it will be useful, but
10		* WITHOUT ANY WARRANTY; without even the implied warranty of
11		* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12		* General Public License for more details.
13		*
14		* You should have received a copy of the GNU General Public License
15		* along with this program; if not, write to the Free Software
16		* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17		*/
18
19		/* Author: G. Jungman
20		*/
21		#include <config.h>
22		#include <stdlib.h>
23		#include <gsl/gsl_interp.h>
24
25		#ifndef HIDE_INLINE_STATIC
26		size_t
27		gsl_interp_bsearch (
28		const double x_array[], double x,
29		size_t index_lo,
30		size_t index_hi
31		)
32		{
33		size_t ilo = index_lo;
34		size_t ihi = index_hi;
35		while (ihi > ilo + 1)
36		{
37		size_t i = (ihi + ilo) / 2;
38		if (x_array[i] > x)
39		ihi = i;
40		else
41		ilo = i;
42		}
43
44		return ilo;
45		}
46		#endif

+0

-80

~~interpolation/bsearch.h~~ less more

0		/* interpolation/bsearch.h
1		*
2		* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2004 Gerard Jungman
3		*
4		* This program is free software; you can redistribute it and/or modify
5		* it under the terms of the GNU General Public License as published by
6		* the Free Software Foundation; either version 3 of the License, or (at
7		* your option) any later version.
8		*
9		* This program is distributed in the hope that it will be useful, but
10		* WITHOUT ANY WARRANTY; without even the implied warranty of
11		* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12		* General Public License for more details.
13		*
14		* You should have received a copy of the GNU General Public License
15		* along with this program; if not, write to the Free Software
16		* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17		*/
18
19		/* Author: G. Jungman
20		*/
21		#ifndef __GSL_INTERP_BSEARCH_H__
22		#define __GSL_INTERP_BSEARCH_H__
23
24
25		/* Perform a binary search of an array of values.
26		*
27		* The parameters index_lo and index_hi provide an initial bracket,
28		* and it is assumed that index_lo < index_hi. The resulting index
29		* is guaranteed to be strictly less than index_hi and greater than
30		* or equal to index_lo, so that the implicit bracket [index, index+1]
31		* always corresponds to a region within the implicit value range of
32		* the value array.
33		*
34		* Note that this means the relationship of 'x' to x_array[index]
35		* and x_array[index+1] depends on the result region, i.e. the
36		* behaviour at the boundaries may not correspond to what you
37		* expect. We have the following complete specification of the
38		* behaviour.
39		* Suppose the input is x_array[] = { x0, x1, ..., xN }
40		* if ( x == x0 ) then index == 0
41		* if ( x > x0 && x <= x1 ) then index == 0, and sim. for other interior pts
42		* if ( x == xN ) then index == N-1
43		* if ( x > xN ) then index == N-1
44		* if ( x < x0 ) then index == 0
45		*/
46		size_t
47		gsl_interp_bsearch(
48		const double x_array[], double x,
49		size_t index_lo,
50		size_t index_hi
51		);
52
53
54		#ifdef HAVE_INLINE
55		extern
56		inline
57		size_t
58		gsl_interp_bsearch(
59		const double x_array[], double x,
60		size_t index_lo,
61		size_t index_hi
62		)
63		{
64		size_t ilo = index_lo;
65		size_t ihi = index_hi;
66		while(ihi > ilo + 1) {
67		size_t i = (ihi + ilo)/2;
68		if(x_array[i] > x)
69		ihi = i;
70		else
71		ilo = i;
72		}
73
74		return ilo;
75		}
76		#endif /* HAVE_INLINE */
77
78
79		#endif /* __GSL_INTERP_BSEARCH_H__ */

+32

-11

interpolation/gsl_interp.h less more

21	21	#ifndef __GSL_INTERP_H__
22	22	#define __GSL_INTERP_H__
23	23	#include <stdlib.h>
	24	#include <gsl/gsl_inline.h>
24	25	#include <gsl/gsl_types.h>
25	26
26	27	#undef __BEGIN_DECLS

80	81	gsl_interp_accel *
81	82	gsl_interp_accel_alloc(void);
82	83
83		size_t
84		gsl_interp_accel_find(gsl_interp_accel * a, const double x_array[], size_t size, double x);
85
86	84	int
87	85	gsl_interp_accel_reset (gsl_interp_accel * a);
88	86

147	145	void
148	146	gsl_interp_free(gsl_interp * interp);
149	147
150		size_t gsl_interp_bsearch(const double x_array[], double x,
151		size_t index_lo, size_t index_hi);
152
153		#ifdef HAVE_INLINE
154		extern inline size_t
	148	INLINE_DECL size_t
155	149	gsl_interp_bsearch(const double x_array[], double x,
156	150	size_t index_lo, size_t index_hi);
157	151
158		extern inline size_t
	152	#ifdef HAVE_INLINE
	153
	154	/* Perform a binary search of an array of values.
	155	*
	156	* The parameters index_lo and index_hi provide an initial bracket,
	157	* and it is assumed that index_lo < index_hi. The resulting index
	158	* is guaranteed to be strictly less than index_hi and greater than
	159	* or equal to index_lo, so that the implicit bracket [index, index+1]
	160	* always corresponds to a region within the implicit value range of
	161	* the value array.
	162	*
	163	* Note that this means the relationship of 'x' to x_array[index]
	164	* and x_array[index+1] depends on the result region, i.e. the
	165	* behaviour at the boundaries may not correspond to what you
	166	* expect. We have the following complete specification of the
	167	* behaviour.
	168	* Suppose the input is x_array[] = { x0, x1, ..., xN }
	169	* if ( x == x0 ) then index == 0
	170	* if ( x > x0 && x <= x1 ) then index == 0, and sim. for other interior pts
	171	* if ( x == xN ) then index == N-1
	172	* if ( x > xN ) then index == N-1
	173	* if ( x < x0 ) then index == 0
	174	*/
	175
	176	INLINE_FUN size_t
159	177	gsl_interp_bsearch(const double x_array[], double x,
160	178	size_t index_lo, size_t index_hi)
161	179	{

173	191	}
174	192	#endif
175	193
	194	INLINE_DECL size_t
	195	gsl_interp_accel_find(gsl_interp_accel * a, const double x_array[], size_t size, double x);
	196
176	197	#ifdef HAVE_INLINE
177		extern inline size_t
	198	INLINE_FUN size_t
178	199	gsl_interp_accel_find(gsl_interp_accel * a, const double xa[], size_t len, double x)
179	200	{
180	201	size_t x_index = a->cache;

183	204	a->miss_count++;
184	205	a->cache = gsl_interp_bsearch(xa, x, 0, x_index);
185	206	}
186		else if(x > xa[x_index + 1]) {
	207	else if(x >= xa[x_index + 1]) {
187	208	a->miss_count++;
188	209	a->cache = gsl_interp_bsearch(xa, x, x_index, len-1);
189	210	}

+30

-0

interpolation/inline.c less more

	0	/* interpolation/bsearch.c
	1	*
	2	* Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	/* Author: G. Jungman
	20	*/
	21	#include <config.h>
	22	#include <stdlib.h>
	23
	24	/* Compile all the inline functions */
	25
	26	#define COMPILE_INLINE_STATIC
	27	#include "build.h"
	28	#include <gsl/gsl_interp.h>
	29

+34

-0

interpolation/test.c less more

72	72	s = (index_result != 0);
73	73	status += s;
74	74	gsl_test (s, "out of bounds bsearch -");
	75
	76	/* Test the accelerator */
	77
	78	{
	79	size_t i, j, k1 = 0, k2 = 0;
	80	int t = 0;
	81	double x = 0;
	82	double r[16] = { -0.2, 0.0, 0.1, 0.7,
	83	1.0, 1.3, 1.9,
	84	2.0, 2.2, 2.7,
	85	3.0, 3.1, 3.6,
	86	4.0, 4.1, 4.9 };
	87
	88	gsl_interp_accel *a = gsl_interp_accel_alloc ();
	89
	90	/* Run through all the pairs of points */
	91
	92	while (k1 < 16 && k2 < 16) {
	93
	94	x = r[t ? k1 : k2];
	95	t = !t;
	96
	97	if (t == 0) {
	98	k1 = (k1 + 1) % 16;
	99	if (k1 == 0) k2++;
	100	};
	101
	102	i = gsl_interp_accel_find(a, x_array, 5, x);
	103	j = gsl_interp_bsearch(x_array, x, 0, 4);
	104	gsl_test(i != j, "(%u,%u) accelerated lookup vs bsearch (x = %g)", i, j, x);
	105	}
	106
	107	gsl_interp_accel_free(a);
	108	}
75	109
76	110	return status;
77	111	}

+50

-0

linalg/ChangeLog less more

	0	2008-10-20 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* svd.c (gsl_linalg_SV_decomp_jacobi): change use of
	3	gsl_coerce_double to macro so it is not called unnecessarily
	4
	5	2008-08-30 Brian Gough <bjg@network-theory.co.uk>
	6
	7	* tridiag.c (solve_cyc_tridiag_nonsym): use x_stride when storing
	8	in x[] (fixes bug #24162)
	9
	10	2008-08-26 Brian Gough <bjg@network-theory.co.uk>
	11
	12	* test.c (test_QRPT_update_dim): added tests for
	13	gsl_linalg_QRPT_update
	14
	15	* qrpt.c (gsl_linalg_QRPT_update): handle rectangular matrices
	16
	17	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	18
	19	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	20
	21	2008-04-28 Brian Gough <bjg@network-theory.co.uk>
	22
	23	* bidiag.c (gsl_linalg_bidiag_unpack, gsl_linalg_bidiag_unpack2):
	24	use new descending loop convention
	25
	26	* hermtd.c (gsl_linalg_hermtd_unpack): use new descending loop
	27	convention
	28
	29	* hh.c (gsl_linalg_HH_svx): use new descending loop convention
	30
	31	* lq.c (gsl_linalg_LQ_vecQ, gsl_linalg_LQ_unpack): use new
	32	descending loop convention
	33
	34	* qr.c (gsl_linalg_QR_Qvec, gsl_linalg_QR_unpack): use new
	35	descending loop convention
	36
	37	* svd.c (gsl_linalg_SV_decomp_mod): use new descending loop
	38	convention
	39
	40	* svdstep.c (chase_out_trailing_zero): use new descending loop
	41	convention
	42
	43	* symmtd.c (gsl_linalg_symmtd_unpack): use new descending loop
	44	convention
	45
	46	2008-04-03 Brian Gough <bjg@network-theory.co.uk>
	47
	48	* qr.c lq.c: removed unused definition of REAL
	49
0	50	2007-08-27 Brian Gough <bjg@network-theory.co.uk>
1	51
2	52	* tridiag.c: use GSL_ERROR for failed allocation, signal

+1

-1

linalg/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_linalg.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgsllinalg_la_SOURCES = multiply.c exponential.c tridiag.c tridiag.h lu.c luc.c hh.c qr.c qrpt.c lq.c ptlq.c svd.c householder.c householdercomplex.c hessenberg.c hesstri.c cholesky.c choleskyc.c symmtd.c hermtd.c bidiag.c balance.c balancemat.c
7	7

+5

-1

linalg/Makefile.in less more

138	138	LIBOBJS = @LIBOBJS@
139	139	LIBS = @LIBS@
140	140	LIBTOOL = @LIBTOOL@
	141	LIPO = @LIPO@
141	142	LN_S = @LN_S@
142	143	LTLIBOBJS = @LTLIBOBJS@
143	144	MAINT = @MAINT@

145	146	MKDIR_P = @MKDIR_P@
146	147	NM = @NM@
147	148	NMEDIT = @NMEDIT@
	149	OBJDUMP = @OBJDUMP@
148	150	OBJEXT = @OBJEXT@
	151	OTOOL = @OTOOL@
	152	OTOOL64 = @OTOOL64@
149	153	PACKAGE = @PACKAGE@
150	154	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
151	155	PACKAGE_NAME = @PACKAGE_NAME@

210	214	top_srcdir = @top_srcdir@
211	215	noinst_LTLIBRARIES = libgsllinalg.la
212	216	pkginclude_HEADERS = gsl_linalg.h
213		INCLUDES = -I$(top_builddir)
	217	INCLUDES = -I$(top_srcdir)
214	218	libgsllinalg_la_SOURCES = multiply.c exponential.c tridiag.c tridiag.h lu.c luc.c hh.c qr.c qrpt.c lq.c ptlq.c svd.c householder.c householdercomplex.c hessenberg.c hesstri.c cholesky.c choleskyc.c symmtd.c hermtd.c bidiag.c balance.c balancemat.c
215	219	noinst_HEADERS = givens.c apply_givens.c svdstep.c tridiag.h
216	220	TESTS = $(check_PROGRAMS)

+4

-4

linalg/bidiag.c less more

207	207
208	208	gsl_matrix_set_identity (V);
209	209
210		for (i = N - 1; i > 0 && i--;)
	210	for (i = N - 1; i-- > 0;)
211	211	{
212	212	/* Householder row transformation to accumulate V */
213	213	gsl_vector_const_view r = gsl_matrix_const_row (A, i);

226	226
227	227	gsl_matrix_set_identity (U);
228	228
229		for (j = N; j > 0 && j--;)
	229	for (j = N; j-- > 0;)
230	230	{
231	231	/* Householder column transformation to accumulate U */
232	232	gsl_vector_const_view c = gsl_matrix_const_column (A, j);

278	278
279	279	gsl_matrix_set_identity (V);
280	280
281		for (i = N - 1; i > 0 && i--;)
	281	for (i = N - 1; i-- > 0;)
282	282	{
283	283	/* Householder row transformation to accumulate V */
284	284	gsl_vector_const_view r = gsl_matrix_const_row (A, i);

304	304	/* Allow U to be unpacked into the same memory as A, copy
305	305	diagonal into tau_U */
306	306
307		for (j = N; j > 0 && j--;)
	307	for (j = N; j-- > 0;)
308	308	{
309	309	/* Householder column transformation to accumulate U */
310	310	double tj = gsl_vector_get (tau_U, j);

+92

-0

linalg/cholesky.c less more

223	223	}
224	224	}
225	225
	226	/*
	227	gsl_linalg_cholesky_invert()
	228	Compute the inverse of a symmetric positive definite matrix in
	229	Cholesky form.
	230
	231	Inputs: LLT - matrix in cholesky form on input
	232	A^{-1} = L^{-t} L^{-1} on output
	233
	234	Return: success or error
	235	*/
	236
	237	int
	238	gsl_linalg_cholesky_invert(gsl_matrix * LLT)
	239	{
	240	if (LLT->size1 != LLT->size2)
	241	{
	242	GSL_ERROR ("cholesky matrix must be square", GSL_ENOTSQR);
	243	}
	244	else
	245	{
	246	size_t N = LLT->size1;
	247	size_t i, j;
	248	double sum;
	249	gsl_vector_view v1, v2;
	250
	251	/* invert the lower triangle of LLT */
	252	for (i = 0; i < N; ++i)
	253	{
	254	double ajj;
	255
	256	j = N - i - 1;
	257
	258	gsl_matrix_set(LLT, j, j, 1.0 / gsl_matrix_get(LLT, j, j));
	259	ajj = -gsl_matrix_get(LLT, j, j);
	260
	261	if (j < N - 1)
	262	{
	263	gsl_matrix_view m;
	264
	265	m = gsl_matrix_submatrix(LLT, j + 1, j + 1,
	266	N - j - 1, N - j - 1);
	267	v1 = gsl_matrix_subcolumn(LLT, j, j + 1, N - j - 1);
	268
	269	gsl_blas_dtrmv(CblasLower, CblasNoTrans, CblasNonUnit,
	270	&m.matrix, &v1.vector);
	271
	272	gsl_blas_dscal(ajj, &v1.vector);
	273	}
	274	} /* for (i = 0; i < N; ++i) */
	275
	276	/*
	277	* The lower triangle of LLT now contains L^{-1}. Now compute
	278	* A^{-1} = L^{-t} L^{-1}
	279	*
	280	* The (ij) element of A^{-1} is column i of L^{-1} dotted into
	281	* column j of L^{-1}
	282	*/
	283
	284	for (i = 0; i < N; ++i)
	285	{
	286	for (j = i + 1; j < N; ++j)
	287	{
	288	v1 = gsl_matrix_subcolumn(LLT, i, j, N - j);
	289	v2 = gsl_matrix_subcolumn(LLT, j, j, N - j);
	290
	291	/* compute Ainv_{ij} = sum_k Linv_{ki} Linv_{kj} */
	292	gsl_blas_ddot(&v1.vector, &v2.vector, &sum);
	293
	294	/* store in upper triangle */
	295	gsl_matrix_set(LLT, i, j, sum);
	296	}
	297
	298	/* now compute the diagonal element */
	299	v1 = gsl_matrix_subcolumn(LLT, i, i, N - i);
	300	gsl_blas_ddot(&v1.vector, &v1.vector, &sum);
	301	gsl_matrix_set(LLT, i, i, sum);
	302	}
	303
	304	/* copy the transposed upper triangle to the lower triangle */
	305
	306	for (j = 1; j < N; j++)
	307	{
	308	for (i = 0; i < j; i++)
	309	{
	310	double A_ij = gsl_matrix_get (LLT, i, j);
	311	gsl_matrix_set (LLT, j, i, A_ij);
	312	}
	313	}
	314
	315	return GSL_SUCCESS;
	316	}
	317	} /* gsl_linalg_cholesky_invert() */
226	318
227	319	int
228	320	gsl_linalg_cholesky_decomp_unit(gsl_matrix * A, gsl_vector * D)

+1

-0

linalg/gsl_linalg.h less more

428	428	int gsl_linalg_cholesky_svx (const gsl_matrix * cholesky,
429	429	gsl_vector * x);
430	430
	431	int gsl_linalg_cholesky_invert(gsl_matrix * cholesky);
431	432
432	433	/* Cholesky decomposition with unit-diagonal triangular parts.
433	434	* A = L D L^T, where diag(L) = (1,1,...,1).

+1

-1

linalg/hermtd.c less more

160	160
161	161	gsl_matrix_complex_set_identity (Q);
162	162
163		for (i = N - 1; i > 0 && i--;)
	163	for (i = N - 1; i-- > 0;)
164	164	{
165	165	gsl_complex ti = gsl_vector_complex_get (tau, i);
166	166

+1

-1

linalg/hh.c less more

159	159
160	160	/* Perform back-substitution. */
161	161
162		for (i = N; i > 0 && i--;)
	162	for (i = N; i-- > 0;)
163	163	{
164	164	REAL xi = gsl_vector_get (x, i);
165	165	REAL sum = 0.0;

+3

-5

linalg/lq.c less more

27	27
28	28	#include <gsl/gsl_linalg.h>
29	29
30		#define REAL double
31
32	30	#include "givens.c"
33	31	#include "apply_givens.c"
34	32

384	382
385	383	/* compute v Q^T */
386	384
387		for (i = GSL_MIN (M, N); i > 0 && i--;)
	385	for (i = GSL_MIN (M, N); i-- > 0;)
388	386	{
389	387	gsl_vector_const_view c = gsl_matrix_const_row (LQ, i);
390	388	gsl_vector_const_view h = gsl_vector_const_subvector (&(c.vector),

426	424
427	425	gsl_matrix_set_identity (Q);
428	426
429		for (i = GSL_MIN (M, N); i > 0 && i--;)
	427	for (i = GSL_MIN (M, N); i-- > 0;)
430	428	{
431	429	gsl_vector_const_view c = gsl_matrix_const_row (LQ, i);
432	430	gsl_vector_const_view h = gsl_vector_const_subvector (&c.vector,

496	494	simultaneously applied to L, H = J_1^T ... J^T_(n-1) L
497	495	so that H is upper Hessenberg. (12.5.2) */
498	496
499		for (k = M - 1; k > 0; k--)
	497	for (k = M - 1; k > 0; k--) /* loop from k = M-1 to 1 */
500	498	{
501	499	double c, s;
502	500	double wk = gsl_vector_get (w, k);

+3

-5

linalg/qr.c less more

28	28
29	29	#include <gsl/gsl_linalg.h>
30	30
31		#define REAL double
32
33	31	#include "givens.c"
34	32	#include "apply_givens.c"
35	33

384	382
385	383	/* compute Q^T v */
386	384
387		for (i = GSL_MIN (M, N); i > 0 && i--;)
	385	for (i = GSL_MIN (M, N); i-- > 0;)
388	386	{
389	387	gsl_vector_const_view c = gsl_matrix_const_column (QR, i);
390	388	gsl_vector_const_view h = gsl_vector_const_subvector (&(c.vector),

460	458
461	459	gsl_matrix_set_identity (Q);
462	460
463		for (i = GSL_MIN (M, N); i > 0 && i--;)
	461	for (i = GSL_MIN (M, N); i-- > 0;)
464	462	{
465	463	gsl_vector_const_view c = gsl_matrix_const_column (QR, i);
466	464	gsl_vector_const_view h = gsl_vector_const_subvector (&c.vector,

529	527	simultaneously applied to R, H = J_1^T ... J^T_(n-1) R
530	528	so that H is upper Hessenberg. (12.5.2) */
531	529
532		for (k = M - 1; k > 0; k--)
	530	for (k = M - 1; k > 0; k--) /* loop from k = M-1 to 1 */
533	531	{
534	532	double c, s;
535	533	double wk = gsl_vector_get (w, k);

+18

-11

linalg/qrpt.c less more

422	422	const gsl_permutation * p,
423	423	gsl_vector * w, const gsl_vector * v)
424	424	{
425		if (Q->size1 != Q->size2 \|\| R->size1 != R->size2)
426		{
427		return GSL_ENOTSQR;
428		}
429		else if (R->size1 != Q->size2 \|\| v->size != Q->size2 \|\| w->size != Q->size2)
430		{
431		return GSL_EBADLEN;
	425	const size_t M = R->size1;
	426	const size_t N = R->size2;
	427
	428	if (Q->size1 != M \|\| Q->size2 != M)
	429	{
	430	GSL_ERROR ("Q matrix must be M x M if R is M x N", GSL_ENOTSQR);
	431	}
	432	else if (w->size != M)
	433	{
	434	GSL_ERROR ("w must be length M if R is M x N", GSL_EBADLEN);
	435	}
	436	else if (v->size != N)
	437	{
	438	GSL_ERROR ("v must be length N if R is M x N", GSL_EBADLEN);
432	439	}
433	440	else
434	441	{
435	442	size_t j, k;
436		const size_t M = Q->size1;
437		const size_t N = Q->size2;
438	443	double w0;
439	444
440	445	/* Apply Given's rotations to reduce w to (\|w\|, 0, 0, ... , 0)

444	449	simultaneously applied to R, H = J_1^T ... J^T_(n-1) R
445	450	so that H is upper Hessenberg. (12.5.2) */
446	451
447		for (k = N - 1; k > 0; k--)
	452	for (k = M - 1; k > 0; k--)
448	453	{
449	454	double c, s;
450	455	double wk = gsl_vector_get (w, k);

470	475	/* Apply Givens transformations R' = G_(n-1)^T ... G_1^T H
471	476	Equation 12.5.4 */
472	477
473		for (k = 1; k < N; k++)
	478	for (k = 1; k < GSL_MIN(M,N+1); k++)
474	479	{
475	480	double c, s;
476	481	double diag = gsl_matrix_get (R, k - 1, k - 1);

478	483
479	484	create_givens (diag, offdiag, &c, &s);
480	485	apply_givens_qr (M, N, Q, R, k - 1, k, c, s);
	486
	487	gsl_matrix_set (R, k, k - 1, 0.0); /* exact zero of G^T */
481	488	}
482	489
483	490	return GSL_SUCCESS;

+3

-3

linalg/svd.c less more

322	322
323	323	/* Convert A into an orthogonal matrix L */
324	324
325		for (j = N; j > 0 && j--;)
	325	for (j = N; j-- > 0;)
326	326	{
327	327	/* Householder column transformation to accumulate L */
328	328	double tj = gsl_vector_get (S, j);

532	532	abserr_a = gsl_vector_get(S,j);
533	533	abserr_b = gsl_vector_get(S,k);
534	534
535		sorted = (gsl_coerce_double(a) >= gsl_coerce_double(b));
536		orthog = (fabs (p) <= tolerance * gsl_coerce_double(a * b));
	535	sorted = (GSL_COERCE_DBL(a) >= GSL_COERCE_DBL(b));
	536	orthog = (fabs (p) <= tolerance * GSL_COERCE_DBL(a * b));
537	537	noisya = (a < abserr_a);
538	538	noisyb = (b < abserr_b);
539	539

+1

-1

linalg/svdstep.c less more

322	322	x = gsl_vector_get (d, n - 2);
323	323	y = gsl_vector_get (f, n - 2);
324	324
325		for (k = n - 1; k > 0 && k--;)
	325	for (k = n - 1; k-- > 0;)
326	326	{
327	327	create_givens (x, y, &c, &s);
328	328

+1

-1

linalg/symmtd.c less more

156	156
157	157	gsl_matrix_set_identity (Q);
158	158
159		for (i = N - 2; i > 0 && i--;)
	159	for (i = N - 2; i-- > 0;)
160	160	{
161	161	gsl_vector_const_view c = gsl_matrix_const_column (A, i);
162	162	gsl_vector_const_view h = gsl_vector_const_subvector (&c.vector, i + 1, N - (i+1));

+300

-42

linalg/test.c less more

61	61	int test_QRPT_decomp(void);
62	62	int test_QR_update_dim(const gsl_matrix * m, double eps);
63	63	int test_QR_update(void);
	64	int test_QRPT_update_dim(const gsl_matrix * m, double eps);
	65	int test_QRPT_update(void);
64	66
65	67	int test_LQ_solve_dim(const gsl_matrix * m, const double * actual, double eps);
66	68	int test_LQ_solve(void);

91	93	int test_cholesky_solve(void);
92	94	int test_cholesky_decomp_dim(const gsl_matrix * m, double eps);
93	95	int test_cholesky_decomp(void);
	96	int test_cholesky_invert_dim(const gsl_matrix * m, double eps);
	97	int test_cholesky_invert(void);
94	98	int test_HH_solve_dim(const gsl_matrix * m, const double * actual, double eps);
95	99	int test_HH_solve(void);
96	100	int test_TDS_solve_dim(unsigned long dim, double d, double od, const double * actual, double eps);

122	126	}
123	127	}
124	128
	129
	130	gsl_vector *
	131	vector_alloc (size_t n)
	132	{
	133	size_t p[5] = {3, 5, 7, 11, 13};
	134	static size_t k = 0;
	135
	136	size_t stride = p[k];
	137	k = (k + 1) % 5;
	138
	139	{
	140	gsl_block * b = gsl_block_alloc (n * stride);
	141	gsl_vector * v = gsl_vector_alloc_from_block (b, 0, n, stride);
	142	v->owner = 1;
	143	return v;
	144	}
	145	}
	146
	147	void
	148	vector_free (gsl_vector * v)
	149	{
	150	gsl_vector_free (v);
	151	}
	152
125	153	gsl_matrix *
126	154	create_hilbert_matrix(unsigned long size)
127	155	{

1226	1254	int s = 0;
1227	1255	unsigned long i,j,k, M = m->size1, N = m->size2;
1228	1256
1229		gsl_vector * rhs = gsl_vector_alloc(N);
1230	1257	gsl_matrix * qr1 = gsl_matrix_alloc(M,N);
1231	1258	gsl_matrix * qr2 = gsl_matrix_alloc(M,N);
1232	1259	gsl_matrix * q1 = gsl_matrix_alloc(M,M);

1242	1269
1243	1270	gsl_matrix_memcpy(qr1,m);
1244	1271	gsl_matrix_memcpy(qr2,m);
1245		for(i=0; i<N; i++) gsl_vector_set(rhs, i, i+1.0);
	1272
1246	1273	for(i=0; i<M; i++) gsl_vector_set(u, i, sin(i+1.0));
1247	1274	for(i=0; i<N; i++) gsl_vector_set(v, i, cos(i+2.0) + sin(i*i+3.0));
1248	1275

1314	1341	gsl_matrix_free(r1);
1315	1342	gsl_matrix_free(q2);
1316	1343	gsl_matrix_free(r2);
1317		gsl_vector_free(rhs);
1318	1344
1319	1345	return s;
1320	1346	}

1362	1388
1363	1389	f = test_QR_update_dim(vander12, 0.0005); /* FIXME: bad accuracy */
1364	1390	gsl_test(f, " QR_update vander(12)");
	1391	s += f;
	1392
	1393	return s;
	1394	}
	1395
	1396
	1397	int
	1398	test_QRPT_update_dim(const gsl_matrix * m, double eps)
	1399	{
	1400	int s = 0, signum;
	1401	unsigned long i,j,k, M = m->size1, N = m->size2;
	1402
	1403	gsl_matrix * qr1 = gsl_matrix_alloc(M,N);
	1404	gsl_matrix * qr2 = gsl_matrix_alloc(M,N);
	1405	gsl_matrix * q1 = gsl_matrix_alloc(M,M);
	1406	gsl_matrix * r1 = gsl_matrix_alloc(M,N);
	1407	gsl_matrix * q2 = gsl_matrix_alloc(M,M);
	1408	gsl_matrix * r2 = gsl_matrix_alloc(M,N);
	1409	gsl_vector * d = gsl_vector_alloc(GSL_MIN(M,N));
	1410	gsl_vector * u = gsl_vector_alloc(M);
	1411	gsl_vector * v = gsl_vector_alloc(N);
	1412	gsl_vector * w = gsl_vector_alloc(M);
	1413
	1414	gsl_vector * norm = gsl_vector_alloc(N);
	1415	gsl_permutation * perm = gsl_permutation_alloc(N);
	1416
	1417	gsl_matrix_memcpy(qr1,m);
	1418	gsl_matrix_memcpy(qr2,m);
	1419	for(i=0; i<M; i++) gsl_vector_set(u, i, sin(i+1.0));
	1420	for(i=0; i<N; i++) gsl_vector_set(v, i, cos(i+2.0) + sin(i*i+3.0));
	1421
	1422	for(i=0; i<M; i++)
	1423	{
	1424	double ui = gsl_vector_get(u, i);
	1425	for(j=0; j<N; j++)
	1426	{
	1427	double vj = gsl_vector_get(v, j);
	1428	double qij = gsl_matrix_get(qr1, i, j);
	1429	gsl_matrix_set(qr1, i, j, qij + ui * vj);
	1430	}
	1431	}
	1432
	1433	s += gsl_linalg_QRPT_decomp(qr2, d, perm, &signum, norm);
	1434	s += gsl_linalg_QR_unpack(qr2, d, q2, r2);
	1435
	1436	/* compute w = Q^T u */
	1437
	1438	for (j = 0; j < M; j++)
	1439	{
	1440	double sum = 0;
	1441	for (i = 0; i < M; i++)
	1442	sum += gsl_matrix_get (q2, i, j) * gsl_vector_get (u, i);
	1443	gsl_vector_set (w, j, sum);
	1444	}
	1445
	1446	s += gsl_linalg_QRPT_update(q2, r2, perm, w, v);
	1447
	1448	/* Now compute qr2 = q2 * r2 * p^T */
	1449
	1450	/* first multiply q2 * r2 */
	1451
	1452	for (i = 0; i < M; i++)
	1453	{
	1454	for (j = 0; j< N; j++)
	1455	{
	1456	double sum = 0;
	1457	for (k = 0; k <= GSL_MIN(j,M-1); k++)
	1458	{
	1459	double qik = gsl_matrix_get(q2, i, k);
	1460	double rkj = gsl_matrix_get(r2, k, j);
	1461	sum += qik * rkj ;
	1462	}
	1463	gsl_matrix_set (qr2, i, j, sum);
	1464	}
	1465	}
	1466
	1467	/* now apply permutation to get qr2 = q2 * r2 * p^T */
	1468
	1469	for (i = 0; i < M ; i++)
	1470	{
	1471	gsl_vector_view r_i = gsl_matrix_row(qr2, i);
	1472	gsl_permute_vector_inverse(perm, &r_i.vector);
	1473	}
	1474
	1475
	1476	for(i=0; i<M; i++) {
	1477	for(j=0; j<N; j++) {
	1478	double s1 = gsl_matrix_get(qr1, i, j);
	1479	double s2 = gsl_matrix_get(qr2, i, j);
	1480
	1481	int foo = check(s1, s2, eps);
	1482	if(foo) {
	1483	printf("(%3lu,%3lu)[%lu,%lu]: %22.18g %22.18g\n", M, N, i,j, s1, s2);
	1484	}
	1485	s += foo;
	1486	}
	1487	}
	1488
	1489	gsl_permutation_free (perm);
	1490	gsl_vector_free(norm);
	1491	gsl_vector_free(d);
	1492	gsl_vector_free(u);
	1493	gsl_vector_free(v);
	1494	gsl_vector_free(w);
	1495	gsl_matrix_free(qr1);
	1496	gsl_matrix_free(qr2);
	1497	gsl_matrix_free(q1);
	1498	gsl_matrix_free(r1);
	1499	gsl_matrix_free(q2);
	1500	gsl_matrix_free(r2);
	1501
	1502	return s;
	1503	}
	1504
	1505	int test_QRPT_update(void)
	1506	{
	1507	int f;
	1508	int s = 0;
	1509
	1510	f = test_QRPT_update_dim(m35, 2 * 512.0 * GSL_DBL_EPSILON);
	1511	gsl_test(f, " QRPT_update m(3,5)");
	1512	s += f;
	1513
	1514	f = test_QRPT_update_dim(m53, 2 * 512.0 * GSL_DBL_EPSILON);
	1515	gsl_test(f, " QRPT_update m(5,3)");
	1516	s += f;
	1517
	1518	f = test_QRPT_update_dim(hilb2, 2 * 512.0 * GSL_DBL_EPSILON);
	1519	gsl_test(f, " QRPT_update hilbert(2)");
	1520	s += f;
	1521
	1522	f = test_QRPT_update_dim(hilb3, 2 * 512.0 * GSL_DBL_EPSILON);
	1523	gsl_test(f, " QRPT_update hilbert(3)");
	1524	s += f;
	1525
	1526	f = test_QRPT_update_dim(hilb4, 2 * 1024.0 * GSL_DBL_EPSILON);
	1527	gsl_test(f, " QRPT_update hilbert(4)");
	1528	s += f;
	1529
	1530	f = test_QRPT_update_dim(hilb12, 2 * 1024.0 * GSL_DBL_EPSILON);
	1531	gsl_test(f, " QRPT_update hilbert(12)");
	1532	s += f;
	1533
	1534	f = test_QRPT_update_dim(vander2, 8.0 * GSL_DBL_EPSILON);
	1535	gsl_test(f, " QRPT_update vander(2)");
	1536	s += f;
	1537
	1538	f = test_QRPT_update_dim(vander3, 64.0 * GSL_DBL_EPSILON);
	1539	gsl_test(f, " QRPT_update vander(3)");
	1540	s += f;
	1541
	1542	f = test_QRPT_update_dim(vander4, 1024.0 * GSL_DBL_EPSILON);
	1543	gsl_test(f, " QRPT_update vander(4)");
	1544	s += f;
	1545
	1546	f = test_QRPT_update_dim(vander12, 0.0005); /* FIXME: bad accuracy */
	1547	gsl_test(f, " QRPT_update vander(12)");
1365	1548	s += f;
1366	1549
1367	1550	return s;

3079	3262	return s;
3080	3263	}
3081	3264
	3265	int
	3266	test_cholesky_invert_dim(const gsl_matrix * m, double eps)
	3267	{
	3268	int s = 0;
	3269	unsigned long i, j, N = m->size1;
	3270
	3271	gsl_matrix * v = gsl_matrix_alloc(N, N);
	3272	gsl_matrix * c = gsl_matrix_alloc(N, N);
	3273
	3274	gsl_matrix_memcpy(v,m);
	3275
	3276	s += gsl_linalg_cholesky_decomp(v);
	3277	s += gsl_linalg_cholesky_invert(v);
	3278
	3279	gsl_blas_dsymm(CblasLeft, CblasUpper, 1.0, m, v, 0.0, c);
	3280
	3281	/* c should be the identity matrix */
	3282
	3283	for (i = 0; i < N; ++i)
	3284	{
	3285	for (j = 0; j < N; ++j)
	3286	{
	3287	int foo;
	3288	double cij = gsl_matrix_get(c, i, j);
	3289	double expected;
	3290
	3291	if (i == j)
	3292	expected = 1.0;
	3293	else
	3294	expected = 0.0;
	3295
	3296	foo = check(cij, expected, eps);
	3297
	3298	if (foo)
	3299	printf("(%3lu,%3lu)[%lu,%lu]: %22.18g %22.18g\n", N, N, i,j, cij, expected);
	3300
	3301	s += foo;
	3302	}
	3303	}
	3304
	3305	gsl_matrix_free(v);
	3306	gsl_matrix_free(c);
	3307
	3308	return s;
	3309	}
	3310
	3311	int
	3312	test_cholesky_invert(void)
	3313	{
	3314	int f;
	3315	int s = 0;
	3316
	3317	f = test_cholesky_invert_dim(hilb2, 2 * 8.0 * GSL_DBL_EPSILON);
	3318	gsl_test(f, " cholesky_invert hilbert(2)");
	3319	s += f;
	3320
	3321	f = test_cholesky_invert_dim(hilb3, 2 * 64.0 * GSL_DBL_EPSILON);
	3322	gsl_test(f, " cholesky_invert hilbert(3)");
	3323	s += f;
	3324
	3325	f = test_cholesky_invert_dim(hilb4, 2 * 1024.0 * GSL_DBL_EPSILON);
	3326	gsl_test(f, " cholesky_invert hilbert(4)");
	3327	s += f;
	3328
	3329	return s;
	3330	}
	3331
3082	3332
3083	3333	int
3084	3334	test_cholesky_decomp_unit_dim(const gsl_matrix * m, double eps)

3403	3653	int s = 0;
3404	3654	unsigned long i;
3405	3655
3406		gsl_vector * offdiag = gsl_vector_alloc(dim-1);
3407		gsl_vector * diag = gsl_vector_alloc(dim);
3408		gsl_vector * rhs = gsl_vector_alloc(dim);
3409		gsl_vector * x = gsl_vector_alloc(dim);
	3656	gsl_vector * offdiag = vector_alloc(dim-1);
	3657	gsl_vector * diag = vector_alloc(dim);
	3658	gsl_vector * rhs = vector_alloc(dim);
	3659	gsl_vector * x = vector_alloc(dim);
3410	3660
3411	3661	for(i=0; i<dim; i++) {
3412	3662	gsl_vector_set(diag, i, d);

3428	3678	s += foo;
3429	3679	}
3430	3680
3431		gsl_vector_free(x);
3432		gsl_vector_free(rhs);
3433		gsl_vector_free(diag);
3434		gsl_vector_free(offdiag);
	3681	vector_free(x);
	3682	vector_free(rhs);
	3683	vector_free(diag);
	3684	vector_free(offdiag);
3435	3685
3436	3686	return s;
3437	3687	}

3441	3691	{
3442	3692	int f;
3443	3693	int s = 0;
3444
	3694
3445	3695	{
3446	3696	double actual[] = {0.0, 2.0};
3447	3697	f = test_TDS_solve_dim(2, 1.0, 0.5, actual, 8.0 * GSL_DBL_EPSILON);

3467	3717	}
3468	3718
3469	3719	int
3470		test_TDS_cyc_solve_one(const unsigned long dim, const double * d, const double * od,
3471		const double * r, const double * actual, double eps)
	3720	test_TDS_cyc_solve_one(const unsigned long dim,
	3721	const double * d, const double * od,
	3722	const double * r, const double * actual, double eps)
3472	3723	{
3473	3724	int s = 0;
3474	3725	unsigned long i;
3475	3726
3476		gsl_vector * offdiag = gsl_vector_alloc(dim);
3477		gsl_vector * diag = gsl_vector_alloc(dim);
3478		gsl_vector * rhs = gsl_vector_alloc(dim);
3479		gsl_vector * x = gsl_vector_alloc(dim);
	3727	gsl_vector * offdiag = vector_alloc(dim);
	3728	gsl_vector * diag = vector_alloc(dim);
	3729	gsl_vector * rhs = vector_alloc(dim);
	3730	gsl_vector * x = vector_alloc(dim);
3480	3731
3481	3732	for(i=0; i<dim; i++) {
3482	3733	gsl_vector_set(diag, i, d[i]);

3496	3747	s += foo;
3497	3748	}
3498	3749
3499		gsl_vector_free(x);
3500		gsl_vector_free(rhs);
3501		gsl_vector_free(diag);
3502		gsl_vector_free(offdiag);
	3750	vector_free(x);
	3751	vector_free(rhs);
	3752	vector_free(diag);
	3753	vector_free(offdiag);
3503	3754
3504	3755	return s;
3505	3756	}

3570	3821	int s = 0;
3571	3822	unsigned long i;
3572	3823
3573		gsl_vector * abovediag = gsl_vector_alloc(dim-1);
3574		gsl_vector * belowdiag = gsl_vector_alloc(dim-1);
3575		gsl_vector * diag = gsl_vector_alloc(dim);
3576		gsl_vector * rhs = gsl_vector_alloc(dim);
3577		gsl_vector * x = gsl_vector_alloc(dim);
	3824	gsl_vector * abovediag = vector_alloc(dim-1);
	3825	gsl_vector * belowdiag = vector_alloc(dim-1);
	3826	gsl_vector * diag = vector_alloc(dim);
	3827	gsl_vector * rhs = vector_alloc(dim);
	3828	gsl_vector * x = vector_alloc(dim);
3578	3829
3579	3830	for(i=0; i<dim; i++) {
3580	3831	gsl_vector_set(diag, i, d);

3597	3848	s += foo;
3598	3849	}
3599	3850
3600		gsl_vector_free(x);
3601		gsl_vector_free(rhs);
3602		gsl_vector_free(diag);
3603		gsl_vector_free(abovediag);
3604		gsl_vector_free(belowdiag);
	3851	vector_free(x);
	3852	vector_free(rhs);
	3853	vector_free(diag);
	3854	vector_free(abovediag);
	3855	vector_free(belowdiag);
3605	3856
3606	3857	return s;
3607	3858	}

3623	3874	actual[0] = 0.75;
3624	3875	actual[1] = 0.75;
3625	3876	actual[2] = 2.625;
	3877
3626	3878	f = test_TDN_solve_dim(3, 1.0, 1.0/3.0, 1.0/2.0, actual, 2.0 * GSL_DBL_EPSILON);
3627	3879	gsl_test(f, " solve_TDN dim=2 B");
3628	3880	s += f;

3645	3897	int s = 0;
3646	3898	unsigned long i;
3647	3899
3648		gsl_vector * abovediag = gsl_vector_alloc(dim);
3649		gsl_vector * belowdiag = gsl_vector_alloc(dim);
3650		gsl_vector * diag = gsl_vector_alloc(dim);
3651		gsl_vector * rhs = gsl_vector_alloc(dim);
3652		gsl_vector * x = gsl_vector_alloc(dim);
	3900	gsl_vector * abovediag = vector_alloc(dim);
	3901	gsl_vector * belowdiag = vector_alloc(dim);
	3902	gsl_vector * diag = vector_alloc(dim);
	3903	gsl_vector * rhs = vector_alloc(dim);
	3904	gsl_vector * x = vector_alloc(dim);
3653	3905
3654	3906	for(i=0; i<dim; i++) {
3655	3907	gsl_vector_set(diag, i, d);

3672	3924	s += foo;
3673	3925	}
3674	3926
3675		gsl_vector_free(x);
3676		gsl_vector_free(rhs);
3677		gsl_vector_free(diag);
3678		gsl_vector_free(abovediag);
3679		gsl_vector_free(belowdiag);
	3927	vector_free(x);
	3928	vector_free(rhs);
	3929	vector_free(diag);
	3930	vector_free(abovediag);
	3931	vector_free(belowdiag);
3680	3932
3681	3933	return s;
3682	3934	}

3700	3952	actual[2] = 29.0/22.0;
3701	3953	actual[3] = -9.0/22.0;
3702	3954	actual[4] = 43.0/22.0;
	3955
3703	3956	f = test_TDN_cyc_solve_dim(5, 3.0, 2.0, 1.0, actual, 66.0 * GSL_DBL_EPSILON);
3704	3957	gsl_test(f, " solve_TDN_cyc dim=5");
3705	3958	s += f;

3893	4146	gsl_test(test_QRPT_decomp(), "QRPT Decomposition");
3894	4147	gsl_test(test_QRPT_solve(), "QRPT Solve");
3895	4148	gsl_test(test_QRPT_QRsolve(), "QRPT QR Solve");
	4149	gsl_test(test_QRPT_update(), "QRPT Rank-1 Update");
3896	4150	gsl_test(test_SV_decomp(), "Singular Value Decomposition");
3897	4151	gsl_test(test_SV_decomp_jacobi(), "Singular Value Decomposition (Jacobi)");
3898	4152	gsl_test(test_SV_decomp_mod(), "Singular Value Decomposition (Mod)");

3900	4154	gsl_test(test_cholesky_decomp(), "Cholesky Decomposition");
3901	4155	gsl_test(test_cholesky_decomp_unit(), "Cholesky Decomposition [unit triangular]");
3902	4156	gsl_test(test_cholesky_solve(), "Cholesky Solve");
	4157	gsl_test(test_cholesky_invert(), "Cholesky Inverse");
3903	4158	gsl_test(test_choleskyc_decomp(), "Complex Cholesky Decomposition");
3904	4159	gsl_test(test_choleskyc_solve(), "Complex Cholesky Solve");
3905	4160	gsl_test(test_HH_solve(), "Householder solve");

3941	4196	gsl_matrix_free (inf5);
3942	4197	gsl_matrix_free (nan5);
3943	4198
	4199	gsl_matrix_free (dblmin3);
	4200	gsl_matrix_free (dblmin5);
	4201
3944	4202	exit (gsl_test_summary());
3945	4203	}

+2

-2

linalg/tridiag.c less more

399	399	{
400	400	size_t i, j;
401	401	w[N-1] = zu[N-1]/alpha[N-1];
402		x[N-1] = zb[N-1]/alpha[N-1];
	402	x[x_stride*(N-1)] = zb[N-1]/alpha[N-1];
403	403	for (i = N - 2, j = 0; j <= N - 2; j++, i--)
404	404	{
405	405	w[i] = (zu[i] - abovediag[a_stridei] w[i+1])/alpha[i];

419	419	{
420	420	size_t i;
421	421	for (i = 0; i < N; i++)
422		x[i] -= vx/(1 + vw)*w[i];
	422	x[ix_stride] -= vx/(1 + vw)w[i];
423	423	}
424	424	}
425	425	}

+2142

-1486

ltmain.sh less more

0	0	# Generated from ltmain.m4sh.
1	1
2		# ltmain.sh (GNU libtool) 2.2
	2	# ltmain.sh (GNU libtool) 2.2.6
3	3	# Written by Gordon Matzigkeit <gord@gnu.ai.mit.edu>, 1996
4	4
5	5	# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, 2007 2008 Free Software Foundation, Inc.

64	64	# compiler: $LTCC
65	65	# compiler flags: $LTCFLAGS
66	66	# linker: $LD (gnu? $with_gnu_ld)
67		# $progname: (GNU libtool) 2.2
	67	# $progname: (GNU libtool) 2.2.6
68	68	# automake: $automake_version
69	69	# autoconf: $autoconf_version
70	70	#

72	72
73	73	PROGRAM=ltmain.sh
74	74	PACKAGE=libtool
75		VERSION=2.2
	75	VERSION=2.2.6
76	76	TIMESTAMP=""
77		package_revision=1.2599
	77	package_revision=1.3012
78	78
79	79	# Be Bourne compatible
80	80	if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then

94	94	# Only set LANG and LC_ALL to C if already set.
95	95	# These must not be set unconditionally because not all systems understand
96	96	# e.g. LANG=C (notably SCO).
	97	lt_user_locale=
	98	lt_safe_locale=
97	99	for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES
98	100	do
99	101	eval "if test \"\${$lt_var+set}\" = set; then
100	102	save_$lt_var=\$$lt_var
101	103	$lt_var=C
102	104	export $lt_var
	105	lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\"
	106	lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\"
103	107	fi"
104	108	done
105	109

119	123	: ${MKDIR="mkdir"}
120	124	: ${MV="mv -f"}
121	125	: ${RM="rm -f"}
122		: ${SED="/usr/bin/sed"}
	126	: ${SED="/opt/local/bin/gsed"}
123	127	: ${SHELL="${CONFIG_SHELL-/bin/sh}"}
124	128	: ${Xsed="$SED -e 1s/^X//"}
125	129

138	142
139	143	dirname="s,/[^/]*$,,"
140	144	basename="s,^.*/,,"
	145
	146	# func_dirname_and_basename file append nondir_replacement
	147	# perform func_basename and func_dirname in a single function
	148	# call:
	149	# dirname: Compute the dirname of FILE. If nonempty,
	150	# add APPEND to the result, otherwise set result
	151	# to NONDIR_REPLACEMENT.
	152	# value returned in "$func_dirname_result"
	153	# basename: Compute filename of FILE.
	154	# value retuned in "$func_basename_result"
	155	# Implementation must be kept synchronized with func_dirname
	156	# and func_basename. For efficiency, we do not delegate to
	157	# those functions but instead duplicate the functionality here.
	158	func_dirname_and_basename ()
	159	{
	160	# Extract subdirectory from the argument.
	161	func_dirname_result=`$ECHO "X${1}" \| $Xsed -e "$dirname"`
	162	if test "X$func_dirname_result" = "X${1}"; then
	163	func_dirname_result="${3}"
	164	else
	165	func_dirname_result="$func_dirname_result${2}"
	166	fi
	167	func_basename_result=`$ECHO "X${1}" \| $Xsed -e "$basename"`
	168	}
	169
	170	# Generated shell functions inserted here.
141	171
142	172	# Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh
143	173	# is ksh but when the shell is invoked as "sh" and the current value of

149	179	# The name of this program:
150	180	# In the unlikely event $progname began with a '-', it would play havoc with
151	181	# func_echo (imagine progname=-n), so we prepend ./ in that case:
152		progname=`$ECHO "X$progpath" \| $Xsed -e "$basename" -e 's,^-,./-,'`
	182	func_dirname_and_basename "$progpath"
	183	progname=$func_basename_result
	184	case $progname in
	185	-*) progname=./$progname ;;
	186	esac
153	187
154	188	# Make sure we have an absolute path for reexecution:
155	189	case $progpath in
156	190	[\\/]\|[A-Za-z]:\\) ;;
157	191	[\\/])
158		progdir=`$ECHO "X$progpath" \| $Xsed -e "$dirname"`
	192	progdir=$func_dirname_result
159	193	progdir=`cd "$progdir" && pwd`
160	194	progpath="$progdir/$progname"
161	195	;;

201	235	opt_help=false
202	236	opt_quiet=false
203	237	opt_verbose=false
	238	opt_warning=:
204	239
205	240	# func_echo arg...
206	241	# Echo program name prefixed message, along with the current mode

233	268	# Echo program name prefixed warning message to standard error.
234	269	func_warning ()
235	270	{
236		$ECHO "$progname${mode+: }$mode: warning: "${1+"$@"} 1>&2
	271	$opt_warning && $ECHO "$progname${mode+: }$mode: warning: "${1+"$@"} 1>&2
	272
	273	# bash bug again:
	274	:
237	275	}
238	276
239	277	# func_fatal_error arg...

417	455	if ${opt_dry_run-false}; then :; else
418	456	eval "$my_cmd"
419	457	my_status=$?
	458	if test "$my_status" -eq 0; then :; else
	459	eval "(exit $my_status); $my_fail_exp"
	460	fi
	461	fi
	462	}
	463
	464
	465	# func_show_eval_locale cmd [fail_exp]
	466	# Unless opt_silent is true, then output CMD. Then, if opt_dryrun is
	467	# not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP
	468	# is given, then evaluate it. Use the saved locale for evaluation.
	469	func_show_eval_locale ()
	470	{
	471	my_cmd="$1"
	472	my_fail_exp="${2-:}"
	473
	474	${opt_silent-false} \|\| {
	475	func_quote_for_expand "$my_cmd"
	476	eval "func_echo $func_quote_for_expand_result"
	477	}
	478
	479	if ${opt_dry_run-false}; then :; else
	480	eval "$lt_user_locale
	481	$my_cmd"
	482	my_status=$?
	483	eval "$lt_safe_locale"
420	484	if test "$my_status" -eq 0; then :; else
421	485	eval "(exit $my_status); $my_fail_exp"
422	486	fi

626	690	;;
627	691	esac
628	692	}
629
630
631		func_mode_help ()
632		{
633		# We need to display help for each of the modes.
634		case $mode in
635		"")
636		# Generic help is extracted from the usage comments
637		# at the start of this file.
638		func_help
639		;;
640
641		clean)
642		$ECHO \
643		"Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE...
644
645		Remove files from the build directory.
646
647		RM is the name of the program to use to delete files associated with each FILE
648		(typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed
649		to RM.
650
651		If FILE is a libtool library, object or program, all the files associated
652		with it are deleted. Otherwise, only FILE itself is deleted using RM."
653		;;
654
655		compile)
656		$ECHO \
657		"Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE
658
659		Compile a source file into a libtool library object.
660
661		This mode accepts the following additional options:
662
663		-o OUTPUT-FILE set the output file name to OUTPUT-FILE
664		-no-suppress do not suppress compiler output for multiple passes
665		-prefer-pic try to building PIC objects only
666		-prefer-non-pic try to building non-PIC objects only
667		-shared do not build a \`.o' file suitable for static linking
668		-static only build a \`.o' file suitable for static linking
669
670		COMPILE-COMMAND is a command to be used in creating a \`standard' object file
671		from the given SOURCEFILE.
672
673		The output file name is determined by removing the directory component from
674		SOURCEFILE, then substituting the C source code suffix \`.c' with the
675		library object suffix, \`.lo'."
676		;;
677
678		execute)
679		$ECHO \
680		"Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]...
681
682		Automatically set library path, then run a program.
683
684		This mode accepts the following additional options:
685
686		-dlopen FILE add the directory containing FILE to the library path
687
688		This mode sets the library path environment variable according to \`-dlopen'
689		flags.
690
691		If any of the ARGS are libtool executable wrappers, then they are translated
692		into their corresponding uninstalled binary, and any of their required library
693		directories are added to the library path.
694
695		Then, COMMAND is executed, with ARGS as arguments."
696		;;
697
698		finish)
699		$ECHO \
700		"Usage: $progname [OPTION]... --mode=finish [LIBDIR]...
701
702		Complete the installation of libtool libraries.
703
704		Each LIBDIR is a directory that contains libtool libraries.
705
706		The commands that this mode executes may require superuser privileges. Use
707		the \`--dry-run' option if you just want to see what would be executed."
708		;;
709
710		install)
711		$ECHO \
712		"Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND...
713
714		Install executables or libraries.
715
716		INSTALL-COMMAND is the installation command. The first component should be
717		either the \`install' or \`cp' program.
718
719		The following components of INSTALL-COMMAND are treated specially:
720
721		-inst-prefix PREFIX-DIR Use PREFIX-DIR as a staging area for installation
722
723		The rest of the components are interpreted as arguments to that command (only
724		BSD-compatible install options are recognized)."
725		;;
726
727		link)
728		$ECHO \
729		"Usage: $progname [OPTION]... --mode=link LINK-COMMAND...
730
731		Link object files or libraries together to form another library, or to
732		create an executable program.
733
734		LINK-COMMAND is a command using the C compiler that you would use to create
735		a program from several object files.
736
737		The following components of LINK-COMMAND are treated specially:
738
739		-all-static do not do any dynamic linking at all
740		-avoid-version do not add a version suffix if possible
741		-dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime
742		-dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols
743		-export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3)
744		-export-symbols SYMFILE
745		try to export only the symbols listed in SYMFILE
746		-export-symbols-regex REGEX
747		try to export only the symbols matching REGEX
748		-LLIBDIR search LIBDIR for required installed libraries
749		-lNAME OUTPUT-FILE requires the installed library libNAME
750		-module build a library that can dlopened
751		-no-fast-install disable the fast-install mode
752		-no-install link a not-installable executable
753		-no-undefined declare that a library does not refer to external symbols
754		-o OUTPUT-FILE create OUTPUT-FILE from the specified objects
755		-objectlist FILE Use a list of object files found in FILE to specify objects
756		-precious-files-regex REGEX
757		don't remove output files matching REGEX
758		-release RELEASE specify package release information
759		-rpath LIBDIR the created library will eventually be installed in LIBDIR
760		-R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries
761		-shared only do dynamic linking of libtool libraries
762		-shrext SUFFIX override the standard shared library file extension
763		-static do not do any dynamic linking of uninstalled libtool libraries
764		-static-libtool-libs
765		do not do any dynamic linking of libtool libraries
766		-version-info CURRENT[:REVISION[:AGE]]
767		specify library version info [each variable defaults to 0]
768		-weak LIBNAME declare that the target provides the LIBNAME interface
769
770		All other options (arguments beginning with \`-') are ignored.
771
772		Every other argument is treated as a filename. Files ending in \`.la' are
773		treated as uninstalled libtool libraries, other files are standard or library
774		object files.
775
776		If the OUTPUT-FILE ends in \`.la', then a libtool library is created,
777		only library objects (\`.lo' files) may be specified, and \`-rpath' is
778		required, except when creating a convenience library.
779
780		If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created
781		using \`ar' and \`ranlib', or on Windows using \`lib'.
782
783		If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file
784		is created, otherwise an executable program is created."
785		;;
786
787		uninstall)
788		$ECHO \
789		"Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE...
790
791		Remove libraries from an installation directory.
792
793		RM is the name of the program to use to delete files associated with each FILE
794		(typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed
795		to RM.
796
797		If FILE is a libtool library, all the files associated with it are deleted.
798		Otherwise, only FILE itself is deleted using RM."
799		;;
800
801		*)
802		func_fatal_help "invalid operation mode \`$mode'"
803		;;
804		esac
805
806		$ECHO
807		$ECHO "Try \`$progname --help' for more information about other modes."
808
809		exit $?
810		}
811
812		# Generated shell functions inserted here.
813
814	693
815	694	# Parse options once, thoroughly. This comes as soon as possible in
816	695	# the script to make things like `libtool --version' happen quickly.

923	802	esac
924	803	done
925	804
926		# Now that we've collected a possible --mode arg, show help if necessary
927		$opt_help && func_mode_help
928	805
929	806	case $host in
930		cygwin \| mingw \| pw32)
	807	cygwin \| mingw \| pw32 \| cegcc)
931	808	# don't eliminate duplications in $postdeps and $predeps
932	809	opt_duplicate_compiler_generated_deps=:
933	810	;;

981	858	## Main. ##
982	859	## ----------- ##
983	860
984		{
	861	$opt_help \|\| {
985	862	# Sanity checks first:
986	863	func_check_version_match
987	864

1015	892	# determined imposters.
1016	893	func_lalib_p ()
1017	894	{
1018		$SED -e 4q "$1" 2>/dev/null \
1019		\| $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1
	895	test -f "$1" &&
	896	$SED -e 4q "$1" 2>/dev/null \
	897	\| $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1
1020	898	}
1021	899
1022	900	# func_lalib_unsafe_p file

1029	907	func_lalib_unsafe_p ()
1030	908	{
1031	909	lalib_p=no
1032		if test -r "$1" && exec 5<&1 <"$1"; then
	910	if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then
1033	911	for lalib_p_l in 1 2 3 4
1034	912	do
1035	913	read lalib_p_line

1037	915	\#\ Generated\ by\ $PACKAGE ) lalib_p=yes; break;;
1038	916	esac
1039	917	done
1040		exec 1<&5 5<&-
	918	exec 0<&5 5<&-
1041	919	fi
1042	920	test "$lalib_p" = yes
1043	921	}

1120	998	*) . "./$1" ;;
1121	999	esac
1122	1000	}
1123
1124
1125		# func_win32_libid arg
1126		# return the library type of file 'arg'
1127		#
1128		# Need a lot of goo to handle both DLLs and import libs
1129		# Has to be a shell function in order to 'eat' the argument
1130		# that is supplied when $file_magic_command is called.
1131		func_win32_libid ()
1132		{
1133		$opt_debug
1134		win32_libid_type="unknown"
1135		win32_fileres=`file -L $1 2>/dev/null`
1136		case $win32_fileres in
1137		ar\ archive\ import\ library) # definitely import
1138		win32_libid_type="x86 archive import"
1139		;;
1140		ar\ archive) # could be an import, or static
1141		if eval $OBJDUMP -f $1 \| $SED -e '10q' 2>/dev/null \|
1142		$EGREP 'file format pe-i386(.*architecture: i386)?' >/dev/null ; then
1143		win32_nmres=`eval $NM -f posix -A $1 \|
1144		$SED -n -e '
1145		1,100{
1146		/ I /{
1147		s,.*,import,
1148		p
1149		q
1150		}
1151		}'`
1152		case $win32_nmres in
1153		import*) win32_libid_type="x86 archive import";;
1154		*) win32_libid_type="x86 archive static";;
1155		esac
1156		fi
1157		;;
1158		DLL)
1159		win32_libid_type="x86 DLL"
1160		;;
1161		executable) # but shell scripts are "executable" too...
1162		case $win32_fileres in
1163		MS\ Windows\ PE\ Intel)
1164		win32_libid_type="x86 DLL"
1165		;;
1166		esac
1167		;;
1168		esac
1169		$ECHO "$win32_libid_type"
1170		}
1171
1172	1001
1173	1002
1174	1003	# func_infer_tag arg

1230	1059
1231	1060
1232	1061
	1062	# func_write_libtool_object output_name pic_name nonpic_name
	1063	# Create a libtool object file (analogous to a ".la" file),
	1064	# but don't create it if we're doing a dry run.
	1065	func_write_libtool_object ()
	1066	{
	1067	write_libobj=${1}
	1068	if test "$build_libtool_libs" = yes; then
	1069	write_lobj=\'${2}\'
	1070	else
	1071	write_lobj=none
	1072	fi
	1073
	1074	if test "$build_old_libs" = yes; then
	1075	write_oldobj=\'${3}\'
	1076	else
	1077	write_oldobj=none
	1078	fi
	1079
	1080	$opt_dry_run \|\| {
	1081	cat >${write_libobj}T <<EOF
	1082	# $write_libobj - a libtool object file
	1083	# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION
	1084	#
	1085	# Please DO NOT delete this file!
	1086	# It is necessary for linking the library.
	1087
	1088	# Name of the PIC object.
	1089	pic_object=$write_lobj
	1090
	1091	# Name of the non-PIC object
	1092	non_pic_object=$write_oldobj
	1093
	1094	EOF
	1095	$MV "${write_libobj}T" "${write_libobj}"
	1096	}
	1097	}
	1098
	1099	# func_mode_compile arg...
	1100	func_mode_compile ()
	1101	{
	1102	$opt_debug
	1103	# Get the compilation command and the source file.
	1104	base_compile=
	1105	srcfile="$nonopt" # always keep a non-empty value in "srcfile"
	1106	suppress_opt=yes
	1107	suppress_output=
	1108	arg_mode=normal
	1109	libobj=
	1110	later=
	1111	pie_flag=
	1112
	1113	for arg
	1114	do
	1115	case $arg_mode in
	1116	arg )
	1117	# do not "continue". Instead, add this to base_compile
	1118	lastarg="$arg"
	1119	arg_mode=normal
	1120	;;
	1121
	1122	target )
	1123	libobj="$arg"
	1124	arg_mode=normal
	1125	continue
	1126	;;
	1127
	1128	normal )
	1129	# Accept any command-line options.
	1130	case $arg in
	1131	-o)
	1132	test -n "$libobj" && \
	1133	func_fatal_error "you cannot specify \`-o' more than once"
	1134	arg_mode=target
	1135	continue
	1136	;;
	1137
	1138	-pie \| -fpie \| -fPIE)
	1139	pie_flag="$pie_flag $arg"
	1140	continue
	1141	;;
	1142
	1143	-shared \| -static \| -prefer-pic \| -prefer-non-pic)
	1144	later="$later $arg"
	1145	continue
	1146	;;
	1147
	1148	-no-suppress)
	1149	suppress_opt=no
	1150	continue
	1151	;;
	1152
	1153	-Xcompiler)
	1154	arg_mode=arg # the next one goes into the "base_compile" arg list
	1155	continue # The current "srcfile" will either be retained or
	1156	;; # replaced later. I would guess that would be a bug.
	1157
	1158	-Wc,*)
	1159	func_stripname '-Wc,' '' "$arg"
	1160	args=$func_stripname_result
	1161	lastarg=
	1162	save_ifs="$IFS"; IFS=','
	1163	for arg in $args; do
	1164	IFS="$save_ifs"
	1165	func_quote_for_eval "$arg"
	1166	lastarg="$lastarg $func_quote_for_eval_result"
	1167	done
	1168	IFS="$save_ifs"
	1169	func_stripname ' ' '' "$lastarg"
	1170	lastarg=$func_stripname_result
	1171
	1172	# Add the arguments to base_compile.
	1173	base_compile="$base_compile $lastarg"
	1174	continue
	1175	;;
	1176
	1177	*)
	1178	# Accept the current argument as the source file.
	1179	# The previous "srcfile" becomes the current argument.
	1180	#
	1181	lastarg="$srcfile"
	1182	srcfile="$arg"
	1183	;;
	1184	esac # case $arg
	1185	;;
	1186	esac # case $arg_mode
	1187
	1188	# Aesthetically quote the previous argument.
	1189	func_quote_for_eval "$lastarg"
	1190	base_compile="$base_compile $func_quote_for_eval_result"
	1191	done # for arg
	1192
	1193	case $arg_mode in
	1194	arg)
	1195	func_fatal_error "you must specify an argument for -Xcompile"
	1196	;;
	1197	target)
	1198	func_fatal_error "you must specify a target with \`-o'"
	1199	;;
	1200	*)
	1201	# Get the name of the library object.
	1202	test -z "$libobj" && {
	1203	func_basename "$srcfile"
	1204	libobj="$func_basename_result"
	1205	}
	1206	;;
	1207	esac
	1208
	1209	# Recognize several different file suffixes.
	1210	# If the user specifies -o file.o, it is replaced with file.lo
	1211	case $libobj in
	1212	*.[cCFSifmso] \| \
	1213	.ada \| .adb \| .ads \| .asm \| \
	1214	.c++ \| .cc \| .ii \| .class \| .cpp \| .cxx \| \
	1215	.[fF][09]? \| .for \| .java \| .obj \| *.sx)
	1216	func_xform "$libobj"
	1217	libobj=$func_xform_result
	1218	;;
	1219	esac
	1220
	1221	case $libobj in
	1222	*.lo) func_lo2o "$libobj"; obj=$func_lo2o_result ;;
	1223	*)
	1224	func_fatal_error "cannot determine name of library object from \`$libobj'"
	1225	;;
	1226	esac
	1227
	1228	func_infer_tag $base_compile
	1229
	1230	for arg in $later; do
	1231	case $arg in
	1232	-shared)
	1233	test "$build_libtool_libs" != yes && \
	1234	func_fatal_configuration "can not build a shared library"
	1235	build_old_libs=no
	1236	continue
	1237	;;
	1238
	1239	-static)
	1240	build_libtool_libs=no
	1241	build_old_libs=yes
	1242	continue
	1243	;;
	1244
	1245	-prefer-pic)
	1246	pic_mode=yes
	1247	continue
	1248	;;
	1249
	1250	-prefer-non-pic)
	1251	pic_mode=no
	1252	continue
	1253	;;
	1254	esac
	1255	done
	1256
	1257	func_quote_for_eval "$libobj"
	1258	test "X$libobj" != "X$func_quote_for_eval_result" \
	1259	&& $ECHO "X$libobj" \| $GREP '[]~#^*{};<>?"'"'"' &()\|`$[]' \
	1260	&& func_warning "libobj name \`$libobj' may not contain shell special characters."
	1261	func_dirname_and_basename "$obj" "/" ""
	1262	objname="$func_basename_result"
	1263	xdir="$func_dirname_result"
	1264	lobj=${xdir}$objdir/$objname
	1265
	1266	test -z "$base_compile" && \
	1267	func_fatal_help "you must specify a compilation command"
	1268
	1269	# Delete any leftover library objects.
	1270	if test "$build_old_libs" = yes; then
	1271	removelist="$obj $lobj $libobj ${libobj}T"
	1272	else
	1273	removelist="$lobj $libobj ${libobj}T"
	1274	fi
	1275
	1276	# On Cygwin there's no "real" PIC flag so we must build both object types
	1277	case $host_os in
	1278	cygwin* \| mingw* \| pw32* \| os2* \| cegcc*)
	1279	pic_mode=default
	1280	;;
	1281	esac
	1282	if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then
	1283	# non-PIC code in shared libraries is not supported
	1284	pic_mode=default
	1285	fi
	1286
	1287	# Calculate the filename of the output object if compiler does
	1288	# not support -o with -c
	1289	if test "$compiler_c_o" = no; then
	1290	output_obj=`$ECHO "X$srcfile" \| $Xsed -e 's%^./%%' -e 's%\.[^.]$%%'`.${objext}
	1291	lockfile="$output_obj.lock"
	1292	else
	1293	output_obj=
	1294	need_locks=no
	1295	lockfile=
	1296	fi
	1297
	1298	# Lock this critical section if it is needed
	1299	# We use this script file to make the link, it avoids creating a new file
	1300	if test "$need_locks" = yes; then
	1301	until $opt_dry_run \|\| ln "$progpath" "$lockfile" 2>/dev/null; do
	1302	func_echo "Waiting for $lockfile to be removed"
	1303	sleep 2
	1304	done
	1305	elif test "$need_locks" = warn; then
	1306	if test -f "$lockfile"; then
	1307	$ECHO "\
	1308	*** ERROR, $lockfile exists and contains:
	1309	`cat $lockfile 2>/dev/null`
	1310
	1311	This indicates that another process is trying to use the same
	1312	temporary object file, and libtool could not work around it because
	1313	your compiler does not support \`-c' and \`-o' together. If you
	1314	repeat this compilation, it may succeed, by chance, but you had better
	1315	avoid parallel builds (make -j) in this platform, or get a better
	1316	compiler."
	1317
	1318	$opt_dry_run \|\| $RM $removelist
	1319	exit $EXIT_FAILURE
	1320	fi
	1321	removelist="$removelist $output_obj"
	1322	$ECHO "$srcfile" > "$lockfile"
	1323	fi
	1324
	1325	$opt_dry_run \|\| $RM $removelist
	1326	removelist="$removelist $lockfile"
	1327	trap '$opt_dry_run \|\| $RM $removelist; exit $EXIT_FAILURE' 1 2 15
	1328
	1329	if test -n "$fix_srcfile_path"; then
	1330	eval srcfile=\"$fix_srcfile_path\"
	1331	fi
	1332	func_quote_for_eval "$srcfile"
	1333	qsrcfile=$func_quote_for_eval_result
	1334
	1335	# Only build a PIC object if we are building libtool libraries.
	1336	if test "$build_libtool_libs" = yes; then
	1337	# Without this assignment, base_compile gets emptied.
	1338	fbsd_hideous_sh_bug=$base_compile
	1339
	1340	if test "$pic_mode" != no; then
	1341	command="$base_compile $qsrcfile $pic_flag"
	1342	else
	1343	# Don't build PIC code
	1344	command="$base_compile $qsrcfile"
	1345	fi
	1346
	1347	func_mkdir_p "$xdir$objdir"
	1348
	1349	if test -z "$output_obj"; then
	1350	# Place PIC objects in $objdir
	1351	command="$command -o $lobj"
	1352	fi
	1353
	1354	func_show_eval_locale "$command" \
	1355	'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE'
	1356
	1357	if test "$need_locks" = warn &&
	1358	test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then
	1359	$ECHO "\
	1360	*** ERROR, $lockfile contains:
	1361	`cat $lockfile 2>/dev/null`
	1362
	1363	but it should contain:
	1364	$srcfile
	1365
	1366	This indicates that another process is trying to use the same
	1367	temporary object file, and libtool could not work around it because
	1368	your compiler does not support \`-c' and \`-o' together. If you
	1369	repeat this compilation, it may succeed, by chance, but you had better
	1370	avoid parallel builds (make -j) in this platform, or get a better
	1371	compiler."
	1372
	1373	$opt_dry_run \|\| $RM $removelist
	1374	exit $EXIT_FAILURE
	1375	fi
	1376
	1377	# Just move the object if needed, then go on to compile the next one
	1378	if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then
	1379	func_show_eval '$MV "$output_obj" "$lobj"' \
	1380	'error=$?; $opt_dry_run \|\| $RM $removelist; exit $error'
	1381	fi
	1382
	1383	# Allow error messages only from the first compilation.
	1384	if test "$suppress_opt" = yes; then
	1385	suppress_output=' >/dev/null 2>&1'
	1386	fi
	1387	fi
	1388
	1389	# Only build a position-dependent object if we build old libraries.
	1390	if test "$build_old_libs" = yes; then
	1391	if test "$pic_mode" != yes; then
	1392	# Don't build PIC code
	1393	command="$base_compile $qsrcfile$pie_flag"
	1394	else
	1395	command="$base_compile $qsrcfile $pic_flag"
	1396	fi
	1397	if test "$compiler_c_o" = yes; then
	1398	command="$command -o $obj"
	1399	fi
	1400
	1401	# Suppress compiler output if we already did a PIC compilation.
	1402	command="$command$suppress_output"
	1403	func_show_eval_locale "$command" \
	1404	'$opt_dry_run \|\| $RM $removelist; exit $EXIT_FAILURE'
	1405
	1406	if test "$need_locks" = warn &&
	1407	test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then
	1408	$ECHO "\
	1409	*** ERROR, $lockfile contains:
	1410	`cat $lockfile 2>/dev/null`
	1411
	1412	but it should contain:
	1413	$srcfile
	1414
	1415	This indicates that another process is trying to use the same
	1416	temporary object file, and libtool could not work around it because
	1417	your compiler does not support \`-c' and \`-o' together. If you
	1418	repeat this compilation, it may succeed, by chance, but you had better
	1419	avoid parallel builds (make -j) in this platform, or get a better
	1420	compiler."
	1421
	1422	$opt_dry_run \|\| $RM $removelist
	1423	exit $EXIT_FAILURE
	1424	fi
	1425
	1426	# Just move the object if needed
	1427	if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then
	1428	func_show_eval '$MV "$output_obj" "$obj"' \
	1429	'error=$?; $opt_dry_run \|\| $RM $removelist; exit $error'
	1430	fi
	1431	fi
	1432
	1433	$opt_dry_run \|\| {
	1434	func_write_libtool_object "$libobj" "$objdir/$objname" "$objname"
	1435
	1436	# Unlock the critical section if it was locked
	1437	if test "$need_locks" != no; then
	1438	removelist=$lockfile
	1439	$RM "$lockfile"
	1440	fi
	1441	}
	1442
	1443	exit $EXIT_SUCCESS
	1444	}
	1445
	1446	$opt_help \|\| {
	1447	test "$mode" = compile && func_mode_compile ${1+"$@"}
	1448	}
	1449
	1450	func_mode_help ()
	1451	{
	1452	# We need to display help for each of the modes.
	1453	case $mode in
	1454	"")
	1455	# Generic help is extracted from the usage comments
	1456	# at the start of this file.
	1457	func_help
	1458	;;
	1459
	1460	clean)
	1461	$ECHO \
	1462	"Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE...
	1463
	1464	Remove files from the build directory.
	1465
	1466	RM is the name of the program to use to delete files associated with each FILE
	1467	(typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed
	1468	to RM.
	1469
	1470	If FILE is a libtool library, object or program, all the files associated
	1471	with it are deleted. Otherwise, only FILE itself is deleted using RM."
	1472	;;
	1473
	1474	compile)
	1475	$ECHO \
	1476	"Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE
	1477
	1478	Compile a source file into a libtool library object.
	1479
	1480	This mode accepts the following additional options:
	1481
	1482	-o OUTPUT-FILE set the output file name to OUTPUT-FILE
	1483	-no-suppress do not suppress compiler output for multiple passes
	1484	-prefer-pic try to building PIC objects only
	1485	-prefer-non-pic try to building non-PIC objects only
	1486	-shared do not build a \`.o' file suitable for static linking
	1487	-static only build a \`.o' file suitable for static linking
	1488
	1489	COMPILE-COMMAND is a command to be used in creating a \`standard' object file
	1490	from the given SOURCEFILE.
	1491
	1492	The output file name is determined by removing the directory component from
	1493	SOURCEFILE, then substituting the C source code suffix \`.c' with the
	1494	library object suffix, \`.lo'."
	1495	;;
	1496
	1497	execute)
	1498	$ECHO \
	1499	"Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]...
	1500
	1501	Automatically set library path, then run a program.
	1502
	1503	This mode accepts the following additional options:
	1504
	1505	-dlopen FILE add the directory containing FILE to the library path
	1506
	1507	This mode sets the library path environment variable according to \`-dlopen'
	1508	flags.
	1509
	1510	If any of the ARGS are libtool executable wrappers, then they are translated
	1511	into their corresponding uninstalled binary, and any of their required library
	1512	directories are added to the library path.
	1513
	1514	Then, COMMAND is executed, with ARGS as arguments."
	1515	;;
	1516
	1517	finish)
	1518	$ECHO \
	1519	"Usage: $progname [OPTION]... --mode=finish [LIBDIR]...
	1520
	1521	Complete the installation of libtool libraries.
	1522
	1523	Each LIBDIR is a directory that contains libtool libraries.
	1524
	1525	The commands that this mode executes may require superuser privileges. Use
	1526	the \`--dry-run' option if you just want to see what would be executed."
	1527	;;
	1528
	1529	install)
	1530	$ECHO \
	1531	"Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND...
	1532
	1533	Install executables or libraries.
	1534
	1535	INSTALL-COMMAND is the installation command. The first component should be
	1536	either the \`install' or \`cp' program.
	1537
	1538	The following components of INSTALL-COMMAND are treated specially:
	1539
	1540	-inst-prefix PREFIX-DIR Use PREFIX-DIR as a staging area for installation
	1541
	1542	The rest of the components are interpreted as arguments to that command (only
	1543	BSD-compatible install options are recognized)."
	1544	;;
	1545
	1546	link)
	1547	$ECHO \
	1548	"Usage: $progname [OPTION]... --mode=link LINK-COMMAND...
	1549
	1550	Link object files or libraries together to form another library, or to
	1551	create an executable program.
	1552
	1553	LINK-COMMAND is a command using the C compiler that you would use to create
	1554	a program from several object files.
	1555
	1556	The following components of LINK-COMMAND are treated specially:
	1557
	1558	-all-static do not do any dynamic linking at all
	1559	-avoid-version do not add a version suffix if possible
	1560	-dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime
	1561	-dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols
	1562	-export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3)
	1563	-export-symbols SYMFILE
	1564	try to export only the symbols listed in SYMFILE
	1565	-export-symbols-regex REGEX
	1566	try to export only the symbols matching REGEX
	1567	-LLIBDIR search LIBDIR for required installed libraries
	1568	-lNAME OUTPUT-FILE requires the installed library libNAME
	1569	-module build a library that can dlopened
	1570	-no-fast-install disable the fast-install mode
	1571	-no-install link a not-installable executable
	1572	-no-undefined declare that a library does not refer to external symbols
	1573	-o OUTPUT-FILE create OUTPUT-FILE from the specified objects
	1574	-objectlist FILE Use a list of object files found in FILE to specify objects
	1575	-precious-files-regex REGEX
	1576	don't remove output files matching REGEX
	1577	-release RELEASE specify package release information
	1578	-rpath LIBDIR the created library will eventually be installed in LIBDIR
	1579	-R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries
	1580	-shared only do dynamic linking of libtool libraries
	1581	-shrext SUFFIX override the standard shared library file extension
	1582	-static do not do any dynamic linking of uninstalled libtool libraries
	1583	-static-libtool-libs
	1584	do not do any dynamic linking of libtool libraries
	1585	-version-info CURRENT[:REVISION[:AGE]]
	1586	specify library version info [each variable defaults to 0]
	1587	-weak LIBNAME declare that the target provides the LIBNAME interface
	1588
	1589	All other options (arguments beginning with \`-') are ignored.
	1590
	1591	Every other argument is treated as a filename. Files ending in \`.la' are
	1592	treated as uninstalled libtool libraries, other files are standard or library
	1593	object files.
	1594
	1595	If the OUTPUT-FILE ends in \`.la', then a libtool library is created,
	1596	only library objects (\`.lo' files) may be specified, and \`-rpath' is
	1597	required, except when creating a convenience library.
	1598
	1599	If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created
	1600	using \`ar' and \`ranlib', or on Windows using \`lib'.
	1601
	1602	If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file
	1603	is created, otherwise an executable program is created."
	1604	;;
	1605
	1606	uninstall)
	1607	$ECHO \
	1608	"Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE...
	1609
	1610	Remove libraries from an installation directory.
	1611
	1612	RM is the name of the program to use to delete files associated with each FILE
	1613	(typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed
	1614	to RM.
	1615
	1616	If FILE is a libtool library, all the files associated with it are deleted.
	1617	Otherwise, only FILE itself is deleted using RM."
	1618	;;
	1619
	1620	*)
	1621	func_fatal_help "invalid operation mode \`$mode'"
	1622	;;
	1623	esac
	1624
	1625	$ECHO
	1626	$ECHO "Try \`$progname --help' for more information about other modes."
	1627
	1628	exit $?
	1629	}
	1630
	1631	# Now that we've collected a possible --mode arg, show help if necessary
	1632	$opt_help && func_mode_help
	1633
	1634
	1635	# func_mode_execute arg...
	1636	func_mode_execute ()
	1637	{
	1638	$opt_debug
	1639	# The first argument is the command name.
	1640	cmd="$nonopt"
	1641	test -z "$cmd" && \
	1642	func_fatal_help "you must specify a COMMAND"
	1643
	1644	# Handle -dlopen flags immediately.
	1645	for file in $execute_dlfiles; do
	1646	test -f "$file" \
	1647	\|\| func_fatal_help "\`$file' is not a file"
	1648
	1649	dir=
	1650	case $file in
	1651	*.la)
	1652	# Check to see that this really is a libtool archive.
	1653	func_lalib_unsafe_p "$file" \
	1654	\|\| func_fatal_help "\`$lib' is not a valid libtool archive"
	1655
	1656	# Read the libtool library.
	1657	dlname=
	1658	library_names=
	1659	func_source "$file"
	1660
	1661	# Skip this library if it cannot be dlopened.
	1662	if test -z "$dlname"; then
	1663	# Warn if it was a shared library.
	1664	test -n "$library_names" && \
	1665	func_warning "\`$file' was not linked with \`-export-dynamic'"
	1666	continue
	1667	fi
	1668
	1669	func_dirname "$file" "" "."
	1670	dir="$func_dirname_result"
	1671
	1672	if test -f "$dir/$objdir/$dlname"; then
	1673	dir="$dir/$objdir"
	1674	else
	1675	if test ! -f "$dir/$dlname"; then
	1676	func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'"
	1677	fi
	1678	fi
	1679	;;
	1680
	1681	*.lo)
	1682	# Just add the directory containing the .lo file.
	1683	func_dirname "$file" "" "."
	1684	dir="$func_dirname_result"
	1685	;;
	1686
	1687	*)
	1688	func_warning "\`-dlopen' is ignored for non-libtool libraries and objects"
	1689	continue
	1690	;;
	1691	esac
	1692
	1693	# Get the absolute pathname.
	1694	absdir=`cd "$dir" && pwd`
	1695	test -n "$absdir" && dir="$absdir"
	1696
	1697	# Now add the directory to shlibpath_var.
	1698	if eval "test -z \"\$$shlibpath_var\""; then
	1699	eval "$shlibpath_var=\"\$dir\""
	1700	else
	1701	eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\""
	1702	fi
	1703	done
	1704
	1705	# This variable tells wrapper scripts just to set shlibpath_var
	1706	# rather than running their programs.
	1707	libtool_execute_magic="$magic"
	1708
	1709	# Check if any of the arguments is a wrapper script.
	1710	args=
	1711	for file
	1712	do
	1713	case $file in
	1714	-*) ;;
	1715	*)
	1716	# Do a test to see if this is really a libtool program.
	1717	if func_ltwrapper_script_p "$file"; then
	1718	func_source "$file"
	1719	# Transform arg to wrapped name.
	1720	file="$progdir/$program"
	1721	elif func_ltwrapper_executable_p "$file"; then
	1722	func_ltwrapper_scriptname "$file"
	1723	func_source "$func_ltwrapper_scriptname_result"
	1724	# Transform arg to wrapped name.
	1725	file="$progdir/$program"
	1726	fi
	1727	;;
	1728	esac
	1729	# Quote arguments (to preserve shell metacharacters).
	1730	func_quote_for_eval "$file"
	1731	args="$args $func_quote_for_eval_result"
	1732	done
	1733
	1734	if test "X$opt_dry_run" = Xfalse; then
	1735	if test -n "$shlibpath_var"; then
	1736	# Export the shlibpath_var.
	1737	eval "export $shlibpath_var"
	1738	fi
	1739
	1740	# Restore saved environment variables
	1741	for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES
	1742	do
	1743	eval "if test \"\${save_$lt_var+set}\" = set; then
	1744	$lt_var=\$save_$lt_var; export $lt_var
	1745	else
	1746	$lt_unset $lt_var
	1747	fi"
	1748	done
	1749
	1750	# Now prepare to actually exec the command.
	1751	exec_cmd="\$cmd$args"
	1752	else
	1753	# Display what would be done.
	1754	if test -n "$shlibpath_var"; then
	1755	eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\""
	1756	$ECHO "export $shlibpath_var"
	1757	fi
	1758	$ECHO "$cmd$args"
	1759	exit $EXIT_SUCCESS
	1760	fi
	1761	}
	1762
	1763	test "$mode" = execute && func_mode_execute ${1+"$@"}
	1764
	1765
	1766	# func_mode_finish arg...
	1767	func_mode_finish ()
	1768	{
	1769	$opt_debug
	1770	libdirs="$nonopt"
	1771	admincmds=
	1772
	1773	if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then
	1774	for dir
	1775	do
	1776	libdirs="$libdirs $dir"
	1777	done
	1778
	1779	for libdir in $libdirs; do
	1780	if test -n "$finish_cmds"; then
	1781	# Do each command in the finish commands.
	1782	func_execute_cmds "$finish_cmds" 'admincmds="$admincmds
	1783	'"$cmd"'"'
	1784	fi
	1785	if test -n "$finish_eval"; then
	1786	# Do the single finish_eval.
	1787	eval cmds=\"$finish_eval\"
	1788	$opt_dry_run \|\| eval "$cmds" \|\| admincmds="$admincmds
	1789	$cmds"
	1790	fi
	1791	done
	1792	fi
	1793
	1794	# Exit here if they wanted silent mode.
	1795	$opt_silent && exit $EXIT_SUCCESS
	1796
	1797	$ECHO "X----------------------------------------------------------------------" \| $Xsed
	1798	$ECHO "Libraries have been installed in:"
	1799	for libdir in $libdirs; do
	1800	$ECHO " $libdir"
	1801	done
	1802	$ECHO
	1803	$ECHO "If you ever happen to want to link against installed libraries"
	1804	$ECHO "in a given directory, LIBDIR, you must either use libtool, and"
	1805	$ECHO "specify the full pathname of the library, or use the \`-LLIBDIR'"
	1806	$ECHO "flag during linking and do at least one of the following:"
	1807	if test -n "$shlibpath_var"; then
	1808	$ECHO " - add LIBDIR to the \`$shlibpath_var' environment variable"
	1809	$ECHO " during execution"
	1810	fi
	1811	if test -n "$runpath_var"; then
	1812	$ECHO " - add LIBDIR to the \`$runpath_var' environment variable"
	1813	$ECHO " during linking"
	1814	fi
	1815	if test -n "$hardcode_libdir_flag_spec"; then
	1816	libdir=LIBDIR
	1817	eval flag=\"$hardcode_libdir_flag_spec\"
	1818
	1819	$ECHO " - use the \`$flag' linker flag"
	1820	fi
	1821	if test -n "$admincmds"; then
	1822	$ECHO " - have your system administrator run these commands:$admincmds"
	1823	fi
	1824	if test -f /etc/ld.so.conf; then
	1825	$ECHO " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'"
	1826	fi
	1827	$ECHO
	1828
	1829	$ECHO "See any operating system documentation about shared libraries for"
	1830	case $host in
	1831	solaris2.[6789]\|solaris2.1[0-9])
	1832	$ECHO "more information, such as the ld(1), crle(1) and ld.so(8) manual"
	1833	$ECHO "pages."
	1834	;;
	1835	*)
	1836	$ECHO "more information, such as the ld(1) and ld.so(8) manual pages."
	1837	;;
	1838	esac
	1839	$ECHO "X----------------------------------------------------------------------" \| $Xsed
	1840	exit $EXIT_SUCCESS
	1841	}
	1842
	1843	test "$mode" = finish && func_mode_finish ${1+"$@"}
	1844
	1845
	1846	# func_mode_install arg...
	1847	func_mode_install ()
	1848	{
	1849	$opt_debug
	1850	# There may be an optional sh(1) argument at the beginning of
	1851	# install_prog (especially on Windows NT).
	1852	if test "$nonopt" = "$SHELL" \|\| test "$nonopt" = /bin/sh \|\|
	1853	# Allow the use of GNU shtool's install command.
	1854	$ECHO "X$nonopt" \| $GREP shtool >/dev/null; then
	1855	# Aesthetically quote it.
	1856	func_quote_for_eval "$nonopt"
	1857	install_prog="$func_quote_for_eval_result "
	1858	arg=$1
	1859	shift
	1860	else
	1861	install_prog=
	1862	arg=$nonopt
	1863	fi
	1864
	1865	# The real first argument should be the name of the installation program.
	1866	# Aesthetically quote it.
	1867	func_quote_for_eval "$arg"
	1868	install_prog="$install_prog$func_quote_for_eval_result"
	1869
	1870	# We need to accept at least all the BSD install flags.
	1871	dest=
	1872	files=
	1873	opts=
	1874	prev=
	1875	install_type=
	1876	isdir=no
	1877	stripme=
	1878	for arg
	1879	do
	1880	if test -n "$dest"; then
	1881	files="$files $dest"
	1882	dest=$arg
	1883	continue
	1884	fi
	1885
	1886	case $arg in
	1887	-d) isdir=yes ;;
	1888	-f)
	1889	case " $install_prog " in
	1890	[\\\ /]cp\ ) ;;
	1891	*) prev=$arg ;;
	1892	esac
	1893	;;
	1894	-g \| -m \| -o)
	1895	prev=$arg
	1896	;;
	1897	-s)
	1898	stripme=" -s"
	1899	continue
	1900	;;
	1901	-*)
	1902	;;
	1903	*)
	1904	# If the previous option needed an argument, then skip it.
	1905	if test -n "$prev"; then
	1906	prev=
	1907	else
	1908	dest=$arg
	1909	continue
	1910	fi
	1911	;;
	1912	esac
	1913
	1914	# Aesthetically quote the argument.
	1915	func_quote_for_eval "$arg"
	1916	install_prog="$install_prog $func_quote_for_eval_result"
	1917	done
	1918
	1919	test -z "$install_prog" && \
	1920	func_fatal_help "you must specify an install program"
	1921
	1922	test -n "$prev" && \
	1923	func_fatal_help "the \`$prev' option requires an argument"
	1924
	1925	if test -z "$files"; then
	1926	if test -z "$dest"; then
	1927	func_fatal_help "no file or destination specified"
	1928	else
	1929	func_fatal_help "you must specify a destination"
	1930	fi
	1931	fi
	1932
	1933	# Strip any trailing slash from the destination.
	1934	func_stripname '' '/' "$dest"
	1935	dest=$func_stripname_result
	1936
	1937	# Check to see that the destination is a directory.
	1938	test -d "$dest" && isdir=yes
	1939	if test "$isdir" = yes; then
	1940	destdir="$dest"
	1941	destname=
	1942	else
	1943	func_dirname_and_basename "$dest" "" "."
	1944	destdir="$func_dirname_result"
	1945	destname="$func_basename_result"
	1946
	1947	# Not a directory, so check to see that there is only one file specified.
	1948	set dummy $files; shift
	1949	test "$#" -gt 1 && \
	1950	func_fatal_help "\`$dest' is not a directory"
	1951	fi
	1952	case $destdir in
	1953	[\\/]* \| [A-Za-z]:[\\/]*) ;;
	1954	*)
	1955	for file in $files; do
	1956	case $file in
	1957	*.lo) ;;
	1958	*)
	1959	func_fatal_help "\`$destdir' must be an absolute directory name"
	1960	;;
	1961	esac
	1962	done
	1963	;;
	1964	esac
	1965
	1966	# This variable tells wrapper scripts just to set variables rather
	1967	# than running their programs.
	1968	libtool_install_magic="$magic"
	1969
	1970	staticlibs=
	1971	future_libdirs=
	1972	current_libdirs=
	1973	for file in $files; do
	1974
	1975	# Do each installation.
	1976	case $file in
	1977	*.$libext)
	1978	# Do the static libraries later.
	1979	staticlibs="$staticlibs $file"
	1980	;;
	1981
	1982	*.la)
	1983	# Check to see that this really is a libtool archive.
	1984	func_lalib_unsafe_p "$file" \
	1985	\|\| func_fatal_help "\`$file' is not a valid libtool archive"
	1986
	1987	library_names=
	1988	old_library=
	1989	relink_command=
	1990	func_source "$file"
	1991
	1992	# Add the libdir to current_libdirs if it is the destination.
	1993	if test "X$destdir" = "X$libdir"; then
	1994	case "$current_libdirs " in
	1995	" $libdir ") ;;
	1996	*) current_libdirs="$current_libdirs $libdir" ;;
	1997	esac
	1998	else
	1999	# Note the libdir as a future libdir.
	2000	case "$future_libdirs " in
	2001	" $libdir ") ;;
	2002	*) future_libdirs="$future_libdirs $libdir" ;;
	2003	esac
	2004	fi
	2005
	2006	func_dirname "$file" "/" ""
	2007	dir="$func_dirname_result"
	2008	dir="$dir$objdir"
	2009
	2010	if test -n "$relink_command"; then
	2011	# Determine the prefix the user has applied to our future dir.
	2012	inst_prefix_dir=`$ECHO "X$destdir" \| $Xsed -e "s%$libdir\$%%"`
	2013
	2014	# Don't allow the user to place us outside of our expected
	2015	# location b/c this prevents finding dependent libraries that
	2016	# are installed to the same prefix.
	2017	# At present, this check doesn't affect windows .dll's that
	2018	# are installed into $libdir/../bin (currently, that works fine)
	2019	# but it's something to keep an eye on.
	2020	test "$inst_prefix_dir" = "$destdir" && \
	2021	func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir"
	2022
	2023	if test -n "$inst_prefix_dir"; then
	2024	# Stick the inst_prefix_dir data into the link command.
	2025	relink_command=`$ECHO "X$relink_command" \| $Xsed -e "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"`
	2026	else
	2027	relink_command=`$ECHO "X$relink_command" \| $Xsed -e "s%@inst_prefix_dir@%%"`
	2028	fi
	2029
	2030	func_warning "relinking \`$file'"
	2031	func_show_eval "$relink_command" \
	2032	'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"'
	2033	fi
	2034
	2035	# See the names of the shared library.
	2036	set dummy $library_names; shift
	2037	if test -n "$1"; then
	2038	realname="$1"
	2039	shift
	2040
	2041	srcname="$realname"
	2042	test -n "$relink_command" && srcname="$realname"T
	2043
	2044	# Install the shared library and build the symlinks.
	2045	func_show_eval "$install_prog $dir/$srcname $destdir/$realname" \
	2046	'exit $?'
	2047	tstripme="$stripme"
	2048	case $host_os in
	2049	cygwin* \| mingw* \| pw32* \| cegcc*)
	2050	case $realname in
	2051	*.dll.a)
	2052	tstripme=""
	2053	;;
	2054	esac
	2055	;;
	2056	esac
	2057	if test -n "$tstripme" && test -n "$striplib"; then
	2058	func_show_eval "$striplib $destdir/$realname" 'exit $?'
	2059	fi
	2060
	2061	if test "$#" -gt 0; then
	2062	# Delete the old symlinks, and create new ones.
	2063	# Try `ln -sf' first, because the `ln' binary might depend on
	2064	# the symlink we replace! Solaris /bin/ln does not understand -f,
	2065	# so we also need to try rm && ln -s.
	2066	for linkname
	2067	do
	2068	test "$linkname" != "$realname" \
	2069	&& func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname \|\| { $RM $linkname && $LN_S $realname $linkname; }; })"
	2070	done
	2071	fi
	2072
	2073	# Do each command in the postinstall commands.
	2074	lib="$destdir/$realname"
	2075	func_execute_cmds "$postinstall_cmds" 'exit $?'
	2076	fi
	2077
	2078	# Install the pseudo-library for information purposes.
	2079	func_basename "$file"
	2080	name="$func_basename_result"
	2081	instname="$dir/$name"i
	2082	func_show_eval "$install_prog $instname $destdir/$name" 'exit $?'
	2083
	2084	# Maybe install the static library, too.
	2085	test -n "$old_library" && staticlibs="$staticlibs $dir/$old_library"
	2086	;;
	2087
	2088	*.lo)
	2089	# Install (i.e. copy) a libtool object.
	2090
	2091	# Figure out destination file name, if it wasn't already specified.
	2092	if test -n "$destname"; then
	2093	destfile="$destdir/$destname"
	2094	else
	2095	func_basename "$file"
	2096	destfile="$func_basename_result"
	2097	destfile="$destdir/$destfile"
	2098	fi
	2099
	2100	# Deduce the name of the destination old-style object file.
	2101	case $destfile in
	2102	*.lo)
	2103	func_lo2o "$destfile"
	2104	staticdest=$func_lo2o_result
	2105	;;
	2106	*.$objext)
	2107	staticdest="$destfile"
	2108	destfile=
	2109	;;
	2110	*)
	2111	func_fatal_help "cannot copy a libtool object to \`$destfile'"
	2112	;;
	2113	esac
	2114
	2115	# Install the libtool object if requested.
	2116	test -n "$destfile" && \
	2117	func_show_eval "$install_prog $file $destfile" 'exit $?'
	2118
	2119	# Install the old object if enabled.
	2120	if test "$build_old_libs" = yes; then
	2121	# Deduce the name of the old-style object file.
	2122	func_lo2o "$file"
	2123	staticobj=$func_lo2o_result
	2124	func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?'
	2125	fi
	2126	exit $EXIT_SUCCESS
	2127	;;
	2128
	2129	*)
	2130	# Figure out destination file name, if it wasn't already specified.
	2131	if test -n "$destname"; then
	2132	destfile="$destdir/$destname"
	2133	else
	2134	func_basename "$file"
	2135	destfile="$func_basename_result"
	2136	destfile="$destdir/$destfile"
	2137	fi
	2138
	2139	# If the file is missing, and there is a .exe on the end, strip it
	2140	# because it is most likely a libtool script we actually want to
	2141	# install
	2142	stripped_ext=""
	2143	case $file in
	2144	*.exe)
	2145	if test ! -f "$file"; then
	2146	func_stripname '' '.exe' "$file"
	2147	file=$func_stripname_result
	2148	stripped_ext=".exe"
	2149	fi
	2150	;;
	2151	esac
	2152
	2153	# Do a test to see if this is really a libtool program.
	2154	case $host in
	2155	cygwin \| mingw)
	2156	if func_ltwrapper_executable_p "$file"; then
	2157	func_ltwrapper_scriptname "$file"
	2158	wrapper=$func_ltwrapper_scriptname_result
	2159	else
	2160	func_stripname '' '.exe' "$file"
	2161	wrapper=$func_stripname_result
	2162	fi
	2163	;;
	2164	*)
	2165	wrapper=$file
	2166	;;
	2167	esac
	2168	if func_ltwrapper_script_p "$wrapper"; then
	2169	notinst_deplibs=
	2170	relink_command=
	2171
	2172	func_source "$wrapper"
	2173
	2174	# Check the variables that should have been set.
	2175	test -z "$generated_by_libtool_version" && \
	2176	func_fatal_error "invalid libtool wrapper script \`$wrapper'"
	2177
	2178	finalize=yes
	2179	for lib in $notinst_deplibs; do
	2180	# Check to see that each library is installed.
	2181	libdir=
	2182	if test -f "$lib"; then
	2183	func_source "$lib"
	2184	fi
	2185	libfile="$libdir/"`$ECHO "X$lib" \| $Xsed -e 's%^.*/%%g'` ### testsuite: skip nested quoting test
	2186	if test -n "$libdir" && test ! -f "$libfile"; then
	2187	func_warning "\`$lib' has not been installed in \`$libdir'"
	2188	finalize=no
	2189	fi
	2190	done
	2191
	2192	relink_command=
	2193	func_source "$wrapper"
	2194
	2195	outputname=
	2196	if test "$fast_install" = no && test -n "$relink_command"; then
	2197	$opt_dry_run \|\| {
	2198	if test "$finalize" = yes; then
	2199	tmpdir=`func_mktempdir`
	2200	func_basename "$file$stripped_ext"
	2201	file="$func_basename_result"
	2202	outputname="$tmpdir/$file"
	2203	# Replace the output file specification.
	2204	relink_command=`$ECHO "X$relink_command" \| $Xsed -e 's%@OUTPUT@%'"$outputname"'%g'`
	2205
	2206	$opt_silent \|\| {
	2207	func_quote_for_expand "$relink_command"
	2208	eval "func_echo $func_quote_for_expand_result"
	2209	}
	2210	if eval "$relink_command"; then :
	2211	else
	2212	func_error "error: relink \`$file' with the above command before installing it"
	2213	$opt_dry_run \|\| ${RM}r "$tmpdir"
	2214	continue
	2215	fi
	2216	file="$outputname"
	2217	else
	2218	func_warning "cannot relink \`$file'"
	2219	fi
	2220	}
	2221	else
	2222	# Install the binary that we compiled earlier.
	2223	file=`$ECHO "X$file$stripped_ext" \| $Xsed -e "s%$[^/]*$$%$objdir/\1%"`
	2224	fi
	2225	fi
	2226
	2227	# remove .exe since cygwin /usr/bin/install will append another
	2228	# one anyway
	2229	case $install_prog,$host in
	2230	/usr/bin/install,cygwin)
	2231	case $file:$destfile in
	2232	.exe:.exe)
	2233	# this is ok
	2234	;;
	2235	.exe:)
	2236	destfile=$destfile.exe
	2237	;;
	2238	:.exe)
	2239	func_stripname '' '.exe' "$destfile"
	2240	destfile=$func_stripname_result
	2241	;;
	2242	esac
	2243	;;
	2244	esac
	2245	func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?'
	2246	$opt_dry_run \|\| if test -n "$outputname"; then
	2247	${RM}r "$tmpdir"
	2248	fi
	2249	;;
	2250	esac
	2251	done
	2252
	2253	for file in $staticlibs; do
	2254	func_basename "$file"
	2255	name="$func_basename_result"
	2256
	2257	# Set up the ranlib parameters.
	2258	oldlib="$destdir/$name"
	2259
	2260	func_show_eval "$install_prog \$file \$oldlib" 'exit $?'
	2261
	2262	if test -n "$stripme" && test -n "$old_striplib"; then
	2263	func_show_eval "$old_striplib $oldlib" 'exit $?'
	2264	fi
	2265
	2266	# Do each command in the postinstall commands.
	2267	func_execute_cmds "$old_postinstall_cmds" 'exit $?'
	2268	done
	2269
	2270	test -n "$future_libdirs" && \
	2271	func_warning "remember to run \`$progname --finish$future_libdirs'"
	2272
	2273	if test -n "$current_libdirs"; then
	2274	# Maybe just do a dry run.
	2275	$opt_dry_run && current_libdirs=" -n$current_libdirs"
	2276	exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs'
	2277	else
	2278	exit $EXIT_SUCCESS
	2279	fi
	2280	}
	2281
	2282	test "$mode" = install && func_mode_install ${1+"$@"}
	2283
	2284
1233	2285	# func_generate_dlsyms outputname originator pic_p
1234	2286	# Extract symbols from dlprefiles and create ${outputname}S.o with
1235	2287	# a dlpreopen symbol table.

1306	2358	$RM $export_symbols
1307	2359	eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* $.*$$/\1/p' "'< "$nlist" > "$export_symbols"'
1308	2360	case $host in
1309		cygwin \| mingw )
	2361	cygwin \| mingw \| cegcc )
1310	2362	eval "echo EXPORTS "'> "$output_objdir/$outputname.def"'
1311	2363	eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"'
1312	2364	;;

1318	2370	eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T'
1319	2371	eval '$MV "$nlist"T "$nlist"'
1320	2372	case $host in
1321		cygwin \| mingw* )
	2373	cygwin \| mingw* \| cegcc )
1322	2374	eval "echo EXPORTS "'> "$output_objdir/$outputname.def"'
1323	2375	eval 'cat "$nlist" >> "$output_objdir/$outputname.def"'
1324	2376	;;

1374	2426	} lt_dlsymlist;
1375	2427	"
1376	2428	case $host in
1377		cygwin \| mingw )
	2429	cygwin \| mingw \| cegcc )
1378	2430	$ECHO >> "$output_objdir/$my_dlsyms" "\
1379	2431	/* DATA imports from DLLs on WIN32 con't be const, because
1380	2432	runtime relocations are performed -- see ld's documentation

1460	2512	# Transform the symbol file into the correct name.
1461	2513	symfileobj="$output_objdir/${my_outputname}S.$objext"
1462	2514	case $host in
1463		cygwin \| mingw )
	2515	cygwin \| mingw \| cegcc )
1464	2516	if test -f "$output_objdir/$my_outputname.def"; then
1465	2517	compile_command=`$ECHO "X$compile_command" \| $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"`
1466	2518	finalize_command=`$ECHO "X$finalize_command" \| $Xsed -e "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"`

1490	2542	fi
1491	2543	}
1492	2544
	2545	# func_win32_libid arg
	2546	# return the library type of file 'arg'
	2547	#
	2548	# Need a lot of goo to handle both DLLs and import libs
	2549	# Has to be a shell function in order to 'eat' the argument
	2550	# that is supplied when $file_magic_command is called.
	2551	func_win32_libid ()
	2552	{
	2553	$opt_debug
	2554	win32_libid_type="unknown"
	2555	win32_fileres=`file -L $1 2>/dev/null`
	2556	case $win32_fileres in
	2557	ar\ archive\ import\ library) # definitely import
	2558	win32_libid_type="x86 archive import"
	2559	;;
	2560	ar\ archive) # could be an import, or static
	2561	if eval $OBJDUMP -f $1 \| $SED -e '10q' 2>/dev/null \|
	2562	$EGREP 'file format pe-i386(.*architecture: i386)?' >/dev/null ; then
	2563	win32_nmres=`eval $NM -f posix -A $1 \|
	2564	$SED -n -e '
	2565	1,100{
	2566	/ I /{
	2567	s,.*,import,
	2568	p
	2569	q
	2570	}
	2571	}'`
	2572	case $win32_nmres in
	2573	import*) win32_libid_type="x86 archive import";;
	2574	*) win32_libid_type="x86 archive static";;
	2575	esac
	2576	fi
	2577	;;
	2578	DLL)
	2579	win32_libid_type="x86 DLL"
	2580	;;
	2581	executable) # but shell scripts are "executable" too...
	2582	case $win32_fileres in
	2583	MS\ Windows\ PE\ Intel)
	2584	win32_libid_type="x86 DLL"
	2585	;;
	2586	esac
	2587	;;
	2588	esac
	2589	$ECHO "$win32_libid_type"
	2590	}
	2591
	2592
	2593
1493	2594	# func_extract_an_archive dir oldlib
1494	2595	func_extract_an_archive ()
1495	2596	{

1528	2629	while :; do
1529	2630	case " $extracted_archives " in
1530	2631	" $my_xlib_u ")
1531		extracted_serial=`expr $extracted_serial + 1`
	2632	func_arith $extracted_serial + 1
	2633	extracted_serial=$func_arith_result
1532	2634	my_xlib_u=lt$extracted_serial-$my_xlib ;;
1533	2635	*) break ;;
1534	2636	esac

1548	2650	darwin_archive=$my_xabs
1549	2651	darwin_curdir=`pwd`
1550	2652	darwin_base_archive=`basename "$darwin_archive"`
1551		darwin_arches=`lipo -info "$darwin_archive" 2>/dev/null \| $GREP Architectures 2>/dev/null \|\| true`
	2653	darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null \| $GREP Architectures 2>/dev/null \|\| true`
1552	2654	if test -n "$darwin_arches"; then
1553	2655	darwin_arches=`$ECHO "$darwin_arches" \| $SED -e 's/.*are://'`
1554	2656	darwin_arch=
1555	2657	func_verbose "$darwin_base_archive has multiple architectures $darwin_arches"
1556	2658	for darwin_arch in $darwin_arches ; do
1557	2659	func_mkdir_p "unfat-$$/${darwin_base_archive}-${darwin_arch}"
1558		lipo -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}"
	2660	$LIPO -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}"
1559	2661	cd "unfat-$$/${darwin_base_archive}-${darwin_arch}"
1560	2662	func_extract_an_archive "`pwd`" "${darwin_base_archive}"
1561	2663	cd "$darwin_curdir"
1562	2664	$RM "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}"
1563	2665	done # $darwin_arches
1564	2666	## Okay now we've a bunch of thin objects, gotta fatten them up :)
1565		darwin_filelist=`find unfat-$$ -type f -name \.o -print -o -name \.lo -print\| xargs basename \| sort -u \| $NL2SP`
	2667	darwin_filelist=`find unfat-$$ -type f -name \.o -print -o -name \.lo -print \| $SED -e "$basename" \| sort -u`
1566	2668	darwin_file=
1567	2669	darwin_files=
1568	2670	for darwin_file in $darwin_filelist; do
1569	2671	darwin_files=`find unfat-$$ -name $darwin_file -print \| $NL2SP`
1570		lipo -create -output "$darwin_file" $darwin_files
	2672	$LIPO -create -output "$darwin_file" $darwin_files
1571	2673	done # $darwin_filelist
1572	2674	$RM -rf unfat-$$
1573	2675	cd "$darwin_orig_dir"

1589	2691
1590	2692
1591	2693
1592		# func_write_libtool_object output_name pic_name nonpic_name
1593		# Create a libtool object file (analogous to a ".la" file),
1594		# but don't create it if we're doing a dry run.
1595		func_write_libtool_object ()
	2694	# func_emit_wrapper_part1 [arg=no]
	2695	#
	2696	# Emit the first part of a libtool wrapper script on stdout.
	2697	# For more information, see the description associated with
	2698	# func_emit_wrapper(), below.
	2699	func_emit_wrapper_part1 ()
1596	2700	{
1597		write_libobj=${1}
1598		if test "$build_libtool_libs" = yes; then
1599		write_lobj=\'${2}\'
1600		else
1601		write_lobj=none
1602		fi
1603
1604		if test "$build_old_libs" = yes; then
1605		write_oldobj=\'${3}\'
1606		else
1607		write_oldobj=none
1608		fi
1609
1610		$opt_dry_run \|\| {
1611		cat >${write_libobj}T <<EOF
1612		# $write_libobj - a libtool object file
1613		# Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION
1614		#
1615		# Please DO NOT delete this file!
1616		# It is necessary for linking the library.
1617
1618		# Name of the PIC object.
1619		pic_object=$write_lobj
1620
1621		# Name of the non-PIC object
1622		non_pic_object=$write_oldobj
1623
1624		EOF
1625		mv -f "${write_libobj}T" "${write_libobj}"
1626		}
1627		}
1628
1629		# func_mode_compile arg...
1630		func_mode_compile ()
1631		{
1632		$opt_debug
1633		# Get the compilation command and the source file.
1634		base_compile=
1635		srcfile="$nonopt" # always keep a non-empty value in "srcfile"
1636		suppress_opt=yes
1637		suppress_output=
1638		arg_mode=normal
1639		libobj=
1640		later=
1641		pie_flag=
1642
1643		for arg
1644		do
1645		case $arg_mode in
1646		arg )
1647		# do not "continue". Instead, add this to base_compile
1648		lastarg="$arg"
1649		arg_mode=normal
1650		;;
1651
1652		target )
1653		libobj="$arg"
1654		arg_mode=normal
1655		continue
1656		;;
1657
1658		normal )
1659		# Accept any command-line options.
1660		case $arg in
1661		-o)
1662		test -n "$libobj" && \
1663		func_fatal_error "you cannot specify \`-o' more than once"
1664		arg_mode=target
1665		continue
1666		;;
1667
1668		-pie \| -fpie \| -fPIE)
1669		pie_flag="$pie_flag $arg"
1670		continue
1671		;;
1672
1673		-shared \| -static \| -prefer-pic \| -prefer-non-pic)
1674		later="$later $arg"
1675		continue
1676		;;
1677
1678		-no-suppress)
1679		suppress_opt=no
1680		continue
1681		;;
1682
1683		-Xcompiler)
1684		arg_mode=arg # the next one goes into the "base_compile" arg list
1685		continue # The current "srcfile" will either be retained or
1686		;; # replaced later. I would guess that would be a bug.
1687
1688		-Wc,*)
1689		func_stripname '-Wc,' '' "$arg"
1690		args=$func_stripname_result
1691		lastarg=
1692		save_ifs="$IFS"; IFS=','
1693		for arg in $args; do
1694		IFS="$save_ifs"
1695		func_quote_for_eval "$arg"
1696		lastarg="$lastarg $func_quote_for_eval_result"
1697		done
1698		IFS="$save_ifs"
1699		func_stripname ' ' '' "$lastarg"
1700		lastarg=$func_stripname_result
1701
1702		# Add the arguments to base_compile.
1703		base_compile="$base_compile $lastarg"
1704		continue
1705		;;
1706
1707		*)
1708		# Accept the current argument as the source file.
1709		# The previous "srcfile" becomes the current argument.
1710		#
1711		lastarg="$srcfile"
1712		srcfile="$arg"
1713		;;
1714		esac # case $arg
1715		;;
1716		esac # case $arg_mode
1717
1718		# Aesthetically quote the previous argument.
1719		func_quote_for_eval "$lastarg"
1720		base_compile="$base_compile $func_quote_for_eval_result"
1721		done # for arg
1722
1723		case $arg_mode in
1724		arg)
1725		func_fatal_error "you must specify an argument for -Xcompile"
1726		;;
1727		target)
1728		func_fatal_error "you must specify a target with \`-o'"
1729		;;
1730		*)
1731		# Get the name of the library object.
1732		test -z "$libobj" && {
1733		func_basename "$srcfile"
1734		libobj="$func_basename_result"
1735		}
1736		;;
1737		esac
1738
1739		# Recognize several different file suffixes.
1740		# If the user specifies -o file.o, it is replaced with file.lo
1741		xform='[cCFSifmso]'
1742		case $libobj in
1743		*.ada) xform=ada ;;
1744		*.adb) xform=adb ;;
1745		*.ads) xform=ads ;;
1746		*.asm) xform=asm ;;
1747		*.c++) xform=c++ ;;
1748		*.cc) xform=cc ;;
1749		*.ii) xform=ii ;;
1750		*.class) xform=class ;;
1751		*.cpp) xform=cpp ;;
1752		*.cxx) xform=cxx ;;
1753		*.[fF][09]?) xform='[fF][09].' ;;
1754		*.for) xform=for ;;
1755		*.java) xform=java ;;
1756		*.obj) xform=obj ;;
1757		*.sx) xform=sx ;;
1758		esac
1759
1760		libobj=`$ECHO "X$libobj" \| $Xsed -e "s/\.$xform$/.lo/"`
1761
1762		case $libobj in
1763		*.lo) func_lo2o "$libobj"; obj=$func_lo2o_result ;;
1764		*)
1765		func_fatal_error "cannot determine name of library object from \`$libobj'"
1766		;;
1767		esac
1768
1769		func_infer_tag $base_compile
1770
1771		for arg in $later; do
1772		case $arg in
1773		-shared)
1774		test "$build_libtool_libs" != yes && \
1775		func_fatal_configuration "can not build a shared library"
1776		build_old_libs=no
1777		continue
1778		;;
1779
1780		-static)
1781		build_libtool_libs=no
1782		build_old_libs=yes
1783		continue
1784		;;
1785
1786		-prefer-pic)
1787		pic_mode=yes
1788		continue
1789		;;
1790
1791		-prefer-non-pic)
1792		pic_mode=no
1793		continue
1794		;;
1795		esac
1796		done
1797
1798		func_quote_for_eval "$libobj"
1799		test "X$libobj" != "X$func_quote_for_eval_result" \
1800		&& $ECHO "X$libobj" \| $GREP '[]~#^*{};<>?"'"'"' &()\|`$[]' \
1801		&& func_warning "libobj name \`$libobj' may not contain shell special characters."
1802		func_dirname_and_basename "$obj" "/" ""
1803		objname="$func_basename_result"
1804		xdir="$func_dirname_result"
1805		lobj=${xdir}$objdir/$objname
1806
1807		test -z "$base_compile" && \
1808		func_fatal_help "you must specify a compilation command"
1809
1810		# Delete any leftover library objects.
1811		if test "$build_old_libs" = yes; then
1812		removelist="$obj $lobj $libobj ${libobj}T"
1813		else
1814		removelist="$lobj $libobj ${libobj}T"
1815		fi
1816
1817		$opt_dry_run \|\| $RM $removelist
1818		trap "$opt_dry_run \|\| $RM $removelist; exit $EXIT_FAILURE" 1 2 15
1819
1820		# On Cygwin there's no "real" PIC flag so we must build both object types
1821		case $host_os in
1822		cygwin* \| mingw* \| pw32* \| os2*)
1823		pic_mode=default
1824		;;
1825		esac
1826		if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then
1827		# non-PIC code in shared libraries is not supported
1828		pic_mode=default
1829		fi
1830
1831		# Calculate the filename of the output object if compiler does
1832		# not support -o with -c
1833		if test "$compiler_c_o" = no; then
1834		output_obj=`$ECHO "X$srcfile" \| $Xsed -e 's%^./%%' -e 's%\.[^.]$%%'`.${objext}
1835		lockfile="$output_obj.lock"
1836		removelist="$removelist $output_obj $lockfile"
1837		trap "$opt_dry_run \|\| $RM $removelist; exit $EXIT_FAILURE" 1 2 15
1838		else
1839		output_obj=
1840		need_locks=no
1841		lockfile=
1842		fi
1843
1844		# Lock this critical section if it is needed
1845		# We use this script file to make the link, it avoids creating a new file
1846		if test "$need_locks" = yes; then
1847		until $opt_dry_run \|\| ln "$progpath" "$lockfile" 2>/dev/null; do
1848		func_echo "Waiting for $lockfile to be removed"
1849		sleep 2
1850		done
1851		elif test "$need_locks" = warn; then
1852		if test -f "$lockfile"; then
1853		$ECHO "\
1854		*** ERROR, $lockfile exists and contains:
1855		`cat $lockfile 2>/dev/null`
1856
1857		This indicates that another process is trying to use the same
1858		temporary object file, and libtool could not work around it because
1859		your compiler does not support \`-c' and \`-o' together. If you
1860		repeat this compilation, it may succeed, by chance, but you had better
1861		avoid parallel builds (make -j) in this platform, or get a better
1862		compiler."
1863
1864		$opt_dry_run \|\| $RM $removelist
1865		exit $EXIT_FAILURE
1866		fi
1867		$ECHO "$srcfile" > "$lockfile"
1868		fi
1869
1870		if test -n "$fix_srcfile_path"; then
1871		eval srcfile=\"$fix_srcfile_path\"
1872		fi
1873		func_quote_for_eval "$srcfile"
1874		qsrcfile=$func_quote_for_eval_result
1875
1876		$opt_dry_run \|\| $RM "$libobj" "${libobj}T"
1877
1878		# Only build a PIC object if we are building libtool libraries.
1879		if test "$build_libtool_libs" = yes; then
1880		# Without this assignment, base_compile gets emptied.
1881		fbsd_hideous_sh_bug=$base_compile
1882
1883		if test "$pic_mode" != no; then
1884		command="$base_compile $qsrcfile $pic_flag"
1885		else
1886		# Don't build PIC code
1887		command="$base_compile $qsrcfile"
1888		fi
1889
1890		func_mkdir_p "$xdir$objdir"
1891
1892		if test -z "$output_obj"; then
1893		# Place PIC objects in $objdir
1894		command="$command -o $lobj"
1895		fi
1896
1897		$opt_dry_run \|\| $RM "$lobj" "$output_obj"
1898
1899		func_show_eval "$command" \
1900		'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE'
1901
1902		if test "$need_locks" = warn &&
1903		test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then
1904		$ECHO "\
1905		*** ERROR, $lockfile contains:
1906		`cat $lockfile 2>/dev/null`
1907
1908		but it should contain:
1909		$srcfile
1910
1911		This indicates that another process is trying to use the same
1912		temporary object file, and libtool could not work around it because
1913		your compiler does not support \`-c' and \`-o' together. If you
1914		repeat this compilation, it may succeed, by chance, but you had better
1915		avoid parallel builds (make -j) in this platform, or get a better
1916		compiler."
1917
1918		$opt_dry_run \|\| $RM $removelist
1919		exit $EXIT_FAILURE
1920		fi
1921
1922		# Just move the object if needed, then go on to compile the next one
1923		if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then
1924		func_show_eval '$MV "$output_obj" "$lobj"' \
1925		'error=$?; $opt_dry_run \|\| $RM $removelist; exit $error'
1926		fi
1927
1928		# Allow error messages only from the first compilation.
1929		if test "$suppress_opt" = yes; then
1930		suppress_output=' >/dev/null 2>&1'
1931		fi
1932		fi
1933
1934		# Only build a position-dependent object if we build old libraries.
1935		if test "$build_old_libs" = yes; then
1936		if test "$pic_mode" != yes; then
1937		# Don't build PIC code
1938		command="$base_compile $qsrcfile$pie_flag"
1939		else
1940		command="$base_compile $qsrcfile $pic_flag"
1941		fi
1942		if test "$compiler_c_o" = yes; then
1943		command="$command -o $obj"
1944		fi
1945
1946		# Suppress compiler output if we already did a PIC compilation.
1947		command="$command$suppress_output"
1948		$opt_dry_run \|\| $RM "$obj" "$output_obj"
1949		func_show_eval "$command" \
1950		'$opt_dry_run \|\| $RM $removelist; exit $EXIT_FAILURE'
1951
1952		if test "$need_locks" = warn &&
1953		test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then
1954		$ECHO "\
1955		*** ERROR, $lockfile contains:
1956		`cat $lockfile 2>/dev/null`
1957
1958		but it should contain:
1959		$srcfile
1960
1961		This indicates that another process is trying to use the same
1962		temporary object file, and libtool could not work around it because
1963		your compiler does not support \`-c' and \`-o' together. If you
1964		repeat this compilation, it may succeed, by chance, but you had better
1965		avoid parallel builds (make -j) in this platform, or get a better
1966		compiler."
1967
1968		$opt_dry_run \|\| $RM $removelist
1969		exit $EXIT_FAILURE
1970		fi
1971
1972		# Just move the object if needed
1973		if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then
1974		func_show_eval '$MV "$output_obj" "$obj"' \
1975		'error=$?; $opt_dry_run \|\| $RM $removelist; exit $error'
1976		fi
1977		fi
1978
1979		$opt_dry_run \|\| {
1980		func_write_libtool_object "$libobj" "$objdir/$objname" "$objname"
1981
1982		# Unlock the critical section if it was locked
1983		if test "$need_locks" != no; then
1984		$RM "$lockfile"
1985		fi
1986		}
1987
1988		exit $EXIT_SUCCESS
1989		}
1990
1991		test "$mode" = compile && func_mode_compile ${1+"$@"}
1992
1993
1994		# func_mode_execute arg...
1995		func_mode_execute ()
1996		{
1997		$opt_debug
1998		# The first argument is the command name.
1999		cmd="$nonopt"
2000		test -z "$cmd" && \
2001		func_fatal_help "you must specify a COMMAND"
2002
2003		# Handle -dlopen flags immediately.
2004		for file in $execute_dlfiles; do
2005		test -f "$file" \
2006		\|\| func_fatal_help "\`$file' is not a file"
2007
2008		dir=
2009		case $file in
2010		*.la)
2011		# Check to see that this really is a libtool archive.
2012		func_lalib_unsafe_p "$file" \
2013		\|\| func_fatal_help "\`$lib' is not a valid libtool archive"
2014
2015		# Read the libtool library.
2016		dlname=
2017		library_names=
2018		func_source "$file"
2019
2020		# Skip this library if it cannot be dlopened.
2021		if test -z "$dlname"; then
2022		# Warn if it was a shared library.
2023		test -n "$library_names" && \
2024		func_warning "\`$file' was not linked with \`-export-dynamic'"
2025		continue
2026		fi
2027
2028		func_dirname "$file" "" "."
2029		dir="$func_dirname_result"
2030
2031		if test -f "$dir/$objdir/$dlname"; then
2032		dir="$dir/$objdir"
2033		else
2034		if test ! -f "$dir/$dlname"; then
2035		func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'"
2036		fi
2037		fi
2038		;;
2039
2040		*.lo)
2041		# Just add the directory containing the .lo file.
2042		func_dirname "$file" "" "."
2043		dir="$func_dirname_result"
2044		;;
2045
2046		*)
2047		func_warning "\`-dlopen' is ignored for non-libtool libraries and objects"
2048		continue
2049		;;
2050		esac
2051
2052		# Get the absolute pathname.
2053		absdir=`cd "$dir" && pwd`
2054		test -n "$absdir" && dir="$absdir"
2055
2056		# Now add the directory to shlibpath_var.
2057		if eval "test -z \"\$$shlibpath_var\""; then
2058		eval "$shlibpath_var=\"\$dir\""
2059		else
2060		eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\""
2061		fi
2062		done
2063
2064		# This variable tells wrapper scripts just to set shlibpath_var
2065		# rather than running their programs.
2066		libtool_execute_magic="$magic"
2067
2068		# Check if any of the arguments is a wrapper script.
2069		args=
2070		for file
2071		do
2072		case $file in
2073		-*) ;;
2074		*)
2075		# Do a test to see if this is really a libtool program.
2076		if func_ltwrapper_script_p "$file"; then
2077		func_source "$file"
2078		elif func_ltwrapper_executable_p "$file"; then
2079		func_ltwrapper_scriptname "$file"
2080		func_source "$func_ltwrapper_scriptname_result"
2081		fi
2082		# Transform arg to wrapped name.
2083		file="$progdir/$program"
2084		;;
2085		esac
2086		# Quote arguments (to preserve shell metacharacters).
2087		func_quote_for_eval "$file"
2088		args="$args $func_quote_for_eval_result"
2089		done
2090
2091		if test "X$opt_dry_run" = Xfalse; then
2092		if test -n "$shlibpath_var"; then
2093		# Export the shlibpath_var.
2094		eval "export $shlibpath_var"
2095		fi
2096
2097		# Restore saved environment variables
2098		for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES
2099		do
2100		eval "if test \"\${save_$lt_var+set}\" = set; then
2101		$lt_var=\$save_$lt_var; export $lt_var
2102		else
2103		$lt_unset $lt_var
2104		fi"
2105		done
2106
2107		# Now prepare to actually exec the command.
2108		exec_cmd="\$cmd$args"
2109		else
2110		# Display what would be done.
2111		if test -n "$shlibpath_var"; then
2112		eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\""
2113		$ECHO "export $shlibpath_var"
2114		fi
2115		$ECHO "$cmd$args"
2116		exit $EXIT_SUCCESS
2117		fi
2118		}
2119
2120		test "$mode" = execute && func_mode_execute ${1+"$@"}
2121
2122
2123		# func_mode_finish arg...
2124		func_mode_finish ()
2125		{
2126		$opt_debug
2127		libdirs="$nonopt"
2128		admincmds=
2129
2130		if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then
2131		for dir
2132		do
2133		libdirs="$libdirs $dir"
2134		done
2135
2136		for libdir in $libdirs; do
2137		if test -n "$finish_cmds"; then
2138		# Do each command in the finish commands.
2139		func_execute_cmds "$finish_cmds" 'admincmds="$admincmds
2140		'"$cmd"'"'
2141		fi
2142		if test -n "$finish_eval"; then
2143		# Do the single finish_eval.
2144		eval cmds=\"$finish_eval\"
2145		$opt_dry_run \|\| eval "$cmds" \|\| admincmds="$admincmds
2146		$cmds"
2147		fi
2148		done
2149		fi
2150
2151		# Exit here if they wanted silent mode.
2152		$opt_silent && exit $EXIT_SUCCESS
2153
2154		$ECHO "X----------------------------------------------------------------------" \| $Xsed
2155		$ECHO "Libraries have been installed in:"
2156		for libdir in $libdirs; do
2157		$ECHO " $libdir"
2158		done
2159		$ECHO
2160		$ECHO "If you ever happen to want to link against installed libraries"
2161		$ECHO "in a given directory, LIBDIR, you must either use libtool, and"
2162		$ECHO "specify the full pathname of the library, or use the \`-LLIBDIR'"
2163		$ECHO "flag during linking and do at least one of the following:"
2164		if test -n "$shlibpath_var"; then
2165		$ECHO " - add LIBDIR to the \`$shlibpath_var' environment variable"
2166		$ECHO " during execution"
2167		fi
2168		if test -n "$runpath_var"; then
2169		$ECHO " - add LIBDIR to the \`$runpath_var' environment variable"
2170		$ECHO " during linking"
2171		fi
2172		if test -n "$hardcode_libdir_flag_spec"; then
2173		libdir=LIBDIR
2174		eval flag=\"$hardcode_libdir_flag_spec\"
2175
2176		$ECHO " - use the \`$flag' linker flag"
2177		fi
2178		if test -n "$admincmds"; then
2179		$ECHO " - have your system administrator run these commands:$admincmds"
2180		fi
2181		if test -f /etc/ld.so.conf; then
2182		$ECHO " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'"
2183		fi
2184		$ECHO
2185
2186		$ECHO "See any operating system documentation about shared libraries for"
2187		case $host in
2188		solaris2.[6789]\|solaris2.1[0-9])
2189		$ECHO "more information, such as the ld(1), crle(1) and ld.so(8) manual"
2190		$ECHO "pages."
2191		;;
2192		*)
2193		$ECHO "more information, such as the ld(1) and ld.so(8) manual pages."
2194		;;
2195		esac
2196		$ECHO "X----------------------------------------------------------------------" \| $Xsed
2197		exit $EXIT_SUCCESS
2198		}
2199
2200		test "$mode" = finish && func_mode_finish ${1+"$@"}
2201
2202
2203		# func_mode_install arg...
2204		func_mode_install ()
2205		{
2206		$opt_debug
2207		# There may be an optional sh(1) argument at the beginning of
2208		# install_prog (especially on Windows NT).
2209		if test "$nonopt" = "$SHELL" \|\| test "$nonopt" = /bin/sh \|\|
2210		# Allow the use of GNU shtool's install command.
2211		$ECHO "X$nonopt" \| $GREP shtool >/dev/null; then
2212		# Aesthetically quote it.
2213		func_quote_for_eval "$nonopt"
2214		install_prog="$func_quote_for_eval_result "
2215		arg=$1
2216		shift
2217		else
2218		install_prog=
2219		arg=$nonopt
2220		fi
2221
2222		# The real first argument should be the name of the installation program.
2223		# Aesthetically quote it.
2224		func_quote_for_eval "$arg"
2225		install_prog="$install_prog$func_quote_for_eval_result"
2226
2227		# We need to accept at least all the BSD install flags.
2228		dest=
2229		files=
2230		opts=
2231		prev=
2232		install_type=
2233		isdir=no
2234		stripme=
2235		for arg
2236		do
2237		if test -n "$dest"; then
2238		files="$files $dest"
2239		dest=$arg
2240		continue
2241		fi
2242
2243		case $arg in
2244		-d) isdir=yes ;;
2245		-f)
2246		case " $install_prog " in
2247		[\\\ /]cp\ ) ;;
2248		*) prev=$arg ;;
2249		esac
2250		;;
2251		-g \| -m \| -o)
2252		prev=$arg
2253		;;
2254		-s)
2255		stripme=" -s"
2256		continue
2257		;;
2258		-*)
2259		;;
2260		*)
2261		# If the previous option needed an argument, then skip it.
2262		if test -n "$prev"; then
2263		prev=
2264		else
2265		dest=$arg
2266		continue
2267		fi
2268		;;
2269		esac
2270
2271		# Aesthetically quote the argument.
2272		func_quote_for_eval "$arg"
2273		install_prog="$install_prog $func_quote_for_eval_result"
2274		done
2275
2276		test -z "$install_prog" && \
2277		func_fatal_help "you must specify an install program"
2278
2279		test -n "$prev" && \
2280		func_fatal_help "the \`$prev' option requires an argument"
2281
2282		if test -z "$files"; then
2283		if test -z "$dest"; then
2284		func_fatal_help "no file or destination specified"
2285		else
2286		func_fatal_help "you must specify a destination"
2287		fi
2288		fi
2289
2290		# Strip any trailing slash from the destination.
2291		func_stripname '' '/' "$dest"
2292		dest=$func_stripname_result
2293
2294		# Check to see that the destination is a directory.
2295		test -d "$dest" && isdir=yes
2296		if test "$isdir" = yes; then
2297		destdir="$dest"
2298		destname=
2299		else
2300		func_dirname_and_basename "$dest" "" "."
2301		destdir="$func_dirname_result"
2302		destname="$func_basename_result"
2303
2304		# Not a directory, so check to see that there is only one file specified.
2305		set dummy $files; shift
2306		test "$#" -gt 1 && \
2307		func_fatal_help "\`$dest' is not a directory"
2308		fi
2309		case $destdir in
2310		[\\/]* \| [A-Za-z]:[\\/]*) ;;
2311		*)
2312		for file in $files; do
2313		case $file in
2314		*.lo) ;;
2315		*)
2316		func_fatal_help "\`$destdir' must be an absolute directory name"
2317		;;
2318		esac
2319		done
2320		;;
2321		esac
2322
2323		# This variable tells wrapper scripts just to set variables rather
2324		# than running their programs.
2325		libtool_install_magic="$magic"
2326
2327		staticlibs=
2328		future_libdirs=
2329		current_libdirs=
2330		for file in $files; do
2331
2332		# Do each installation.
2333		case $file in
2334		*.$libext)
2335		# Do the static libraries later.
2336		staticlibs="$staticlibs $file"
2337		;;
2338
2339		*.la)
2340		# Check to see that this really is a libtool archive.
2341		func_lalib_unsafe_p "$file" \
2342		\|\| func_fatal_help "\`$file' is not a valid libtool archive"
2343
2344		library_names=
2345		old_library=
2346		relink_command=
2347		func_source "$file"
2348
2349		# Add the libdir to current_libdirs if it is the destination.
2350		if test "X$destdir" = "X$libdir"; then
2351		case "$current_libdirs " in
2352		" $libdir ") ;;
2353		*) current_libdirs="$current_libdirs $libdir" ;;
2354		esac
2355		else
2356		# Note the libdir as a future libdir.
2357		case "$future_libdirs " in
2358		" $libdir ") ;;
2359		*) future_libdirs="$future_libdirs $libdir" ;;
2360		esac
2361		fi
2362
2363		func_dirname "$file" "/" ""
2364		dir="$func_dirname_result"
2365		dir="$dir$objdir"
2366
2367		if test -n "$relink_command"; then
2368		# Determine the prefix the user has applied to our future dir.
2369		inst_prefix_dir=`$ECHO "X$destdir" \| $Xsed -e "s%$libdir\$%%"`
2370
2371		# Don't allow the user to place us outside of our expected
2372		# location b/c this prevents finding dependent libraries that
2373		# are installed to the same prefix.
2374		# At present, this check doesn't affect windows .dll's that
2375		# are installed into $libdir/../bin (currently, that works fine)
2376		# but it's something to keep an eye on.
2377		test "$inst_prefix_dir" = "$destdir" && \
2378		func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir"
2379
2380		if test -n "$inst_prefix_dir"; then
2381		# Stick the inst_prefix_dir data into the link command.
2382		relink_command=`$ECHO "X$relink_command" \| $Xsed -e "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"`
2383		else
2384		relink_command=`$ECHO "X$relink_command" \| $Xsed -e "s%@inst_prefix_dir@%%"`
2385		fi
2386
2387		func_warning "relinking \`$file'"
2388		func_show_eval "$relink_command" \
2389		'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"'
2390		fi
2391
2392		# See the names of the shared library.
2393		set dummy $library_names; shift
2394		if test -n "$1"; then
2395		realname="$1"
2396		shift
2397
2398		srcname="$realname"
2399		test -n "$relink_command" && srcname="$realname"T
2400
2401		# Install the shared library and build the symlinks.
2402		func_show_eval "$install_prog $dir/$srcname $destdir/$realname" \
2403		'exit $?'
2404		tstripme="$stripme"
2405		case $host_os in
2406		cygwin* \| mingw* \| pw32*)
2407		case $realname in
2408		*.dll.a)
2409		tstripme=""
2410		;;
2411		esac
2412		;;
2413		esac
2414		if test -n "$tstripme" && test -n "$striplib"; then
2415		func_show_eval "$striplib $destdir/$realname" 'exit $?'
2416		fi
2417
2418		if test "$#" -gt 0; then
2419		# Delete the old symlinks, and create new ones.
2420		# Try `ln -sf' first, because the `ln' binary might depend on
2421		# the symlink we replace! Solaris /bin/ln does not understand -f,
2422		# so we also need to try rm && ln -s.
2423		for linkname
2424		do
2425		test "$linkname" != "$realname" \
2426		&& func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname \|\| { $RM $linkname && $LN_S $realname $linkname; }; })"
2427		done
2428		fi
2429
2430		# Do each command in the postinstall commands.
2431		lib="$destdir/$realname"
2432		func_execute_cmds "$postinstall_cmds" 'exit $?'
2433		fi
2434
2435		# Install the pseudo-library for information purposes.
2436		func_basename "$file"
2437		name="$func_basename_result"
2438		instname="$dir/$name"i
2439		func_show_eval "$install_prog $instname $destdir/$name" 'exit $?'
2440
2441		# Maybe install the static library, too.
2442		test -n "$old_library" && staticlibs="$staticlibs $dir/$old_library"
2443		;;
2444
2445		*.lo)
2446		# Install (i.e. copy) a libtool object.
2447
2448		# Figure out destination file name, if it wasn't already specified.
2449		if test -n "$destname"; then
2450		destfile="$destdir/$destname"
2451		else
2452		func_basename "$file"
2453		destfile="$func_basename_result"
2454		destfile="$destdir/$destfile"
2455		fi
2456
2457		# Deduce the name of the destination old-style object file.
2458		case $destfile in
2459		*.lo)
2460		func_lo2o "$destfile"
2461		staticdest=$func_lo2o_result
2462		;;
2463		*.$objext)
2464		staticdest="$destfile"
2465		destfile=
2466		;;
2467		*)
2468		func_fatal_help "cannot copy a libtool object to \`$destfile'"
2469		;;
2470		esac
2471
2472		# Install the libtool object if requested.
2473		test -n "$destfile" && \
2474		func_show_eval "$install_prog $file $destfile" 'exit $?'
2475
2476		# Install the old object if enabled.
2477		if test "$build_old_libs" = yes; then
2478		# Deduce the name of the old-style object file.
2479		func_lo2o "$file"
2480		staticobj=$func_lo2o_result
2481		func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?'
2482		fi
2483		exit $EXIT_SUCCESS
2484		;;
2485
2486		*)
2487		# Figure out destination file name, if it wasn't already specified.
2488		if test -n "$destname"; then
2489		destfile="$destdir/$destname"
2490		else
2491		func_basename "$file"
2492		destfile="$func_basename_result"
2493		destfile="$destdir/$destfile"
2494		fi
2495
2496		# If the file is missing, and there is a .exe on the end, strip it
2497		# because it is most likely a libtool script we actually want to
2498		# install
2499		stripped_ext=""
2500		case $file in
2501		*.exe)
2502		if test ! -f "$file"; then
2503		func_stripname '' '.exe' "$file"
2504		file=$func_stripname_result
2505		stripped_ext=".exe"
2506		fi
2507		;;
2508		esac
2509
2510		# Do a test to see if this is really a libtool program.
2511		case $host in
2512		cygwin\|mingw)
2513		if func_ltwrapper_executable_p "$file"; then
2514		func_ltwrapper_scriptname "$file"
2515		wrapper=$func_ltwrapper_scriptname_result
2516		else
2517		func_stripname '' '.exe' "$file"
2518		wrapper=$func_stripname_result
2519		fi
2520		;;
2521		*)
2522		wrapper=$file
2523		;;
2524		esac
2525		if func_ltwrapper_script_p "$wrapper"; then
2526		notinst_deplibs=
2527		relink_command=
2528
2529		func_source "$wrapper"
2530
2531		# Check the variables that should have been set.
2532		test -z "$generated_by_libtool_version" && \
2533		func_fatal_error "invalid libtool wrapper script \`$wrapper'"
2534
2535		finalize=yes
2536		for lib in $notinst_deplibs; do
2537		# Check to see that each library is installed.
2538		libdir=
2539		if test -f "$lib"; then
2540		func_source "$lib"
2541		fi
2542		libfile="$libdir/"`$ECHO "X$lib" \| $Xsed -e 's%^.*/%%g'` ### testsuite: skip nested quoting test
2543		if test -n "$libdir" && test ! -f "$libfile"; then
2544		func_warning "\`$lib' has not been installed in \`$libdir'"
2545		finalize=no
2546		fi
2547		done
2548
2549		relink_command=
2550		func_source "$wrapper"
2551
2552		outputname=
2553		if test "$fast_install" = no && test -n "$relink_command"; then
2554		$opt_dry_run \|\| {
2555		if test "$finalize" = yes; then
2556		tmpdir=`func_mktempdir`
2557		func_basename "$file$stripped_ext"
2558		file="$func_basename_result"
2559		outputname="$tmpdir/$file"
2560		# Replace the output file specification.
2561		relink_command=`$ECHO "X$relink_command" \| $Xsed -e 's%@OUTPUT@%'"$outputname"'%g'`
2562
2563		$opt_silent \|\| {
2564		func_quote_for_expand "$relink_command"
2565		eval "func_echo $func_quote_for_expand_result"
2566		}
2567		if eval "$relink_command"; then :
2568		else
2569		func_error "error: relink \`$file' with the above command before installing it"
2570		$opt_dry_run \|\| ${RM}r "$tmpdir"
2571		continue
2572		fi
2573		file="$outputname"
2574		else
2575		func_warning "cannot relink \`$file'"
2576		fi
2577		}
2578		else
2579		# Install the binary that we compiled earlier.
2580		file=`$ECHO "X$file$stripped_ext" \| $Xsed -e "s%$[^/]*$$%$objdir/\1%"`
2581		fi
2582		fi
2583
2584		# remove .exe since cygwin /usr/bin/install will append another
2585		# one anyway
2586		case $install_prog,$host in
2587		/usr/bin/install,cygwin)
2588		case $file:$destfile in
2589		.exe:.exe)
2590		# this is ok
2591		;;
2592		.exe:)
2593		destfile=$destfile.exe
2594		;;
2595		:.exe)
2596		func_stripname '' '.exe' "$destfile"
2597		destfile=$func_stripname_result
2598		;;
2599		esac
2600		;;
2601		esac
2602		func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?'
2603		$opt_dry_run \|\| if test -n "$outputname"; then
2604		${RM}r "$tmpdir"
2605		fi
2606		;;
2607		esac
2608		done
2609
2610		for file in $staticlibs; do
2611		func_basename "$file"
2612		name="$func_basename_result"
2613
2614		# Set up the ranlib parameters.
2615		oldlib="$destdir/$name"
2616
2617		func_show_eval "$install_prog \$file \$oldlib" 'exit $?'
2618
2619		if test -n "$stripme" && test -n "$old_striplib"; then
2620		func_show_eval "$old_striplib $oldlib" 'exit $?'
2621		fi
2622
2623		# Do each command in the postinstall commands.
2624		func_execute_cmds "$old_postinstall_cmds" 'exit $?'
2625		done
2626
2627		test -n "$future_libdirs" && \
2628		func_warning "remember to run \`$progname --finish$future_libdirs'"
2629
2630		if test -n "$current_libdirs"; then
2631		# Maybe just do a dry run.
2632		$opt_dry_run && current_libdirs=" -n$current_libdirs"
2633		exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs'
2634		else
2635		exit $EXIT_SUCCESS
2636		fi
2637		}
2638
2639		test "$mode" = install && func_mode_install ${1+"$@"}
2640
2641
2642		# func_emit_wrapper arg
2643		#
2644		# emit a libtool wrapper script on stdout
2645		# don't directly open a file because we may want to
2646		# incorporate the script contents within a cygwin/mingw
2647		# wrapper executable. Must ONLY be called from within
2648		# func_mode_link because it depends on a number of variable
2649		# set therein.
2650		#
2651		# arg is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR
2652		# variable will take. If 'yes', then the emitted script
2653		# will assume that the directory in which it is stored is
2654		# the '.lib' directory. This is a cygwin/mingw-specific
2655		# behavior.
2656		func_emit_wrapper ()
2657		{
2658		func_emit_wrapper_arg1=no
	2701	func_emit_wrapper_part1_arg1=no
2659	2702	if test -n "$1" ; then
2660		func_emit_wrapper_arg1=$1
	2703	func_emit_wrapper_part1_arg1=$1
2661	2704	fi
2662	2705
2663	2706	$ECHO "\

2742	2785	file=\`\$ECHO \"X\$file\" \| \$Xsed -e 's%^.*/%%'\`
2743	2786	file=\`ls -ld \"\$thisdir/\$file\" \| ${SED} -n 's/.*-> //p'\`
2744	2787	done
	2788	"
	2789	}
	2790	# end: func_emit_wrapper_part1
	2791
	2792	# func_emit_wrapper_part2 [arg=no]
	2793	#
	2794	# Emit the second part of a libtool wrapper script on stdout.
	2795	# For more information, see the description associated with
	2796	# func_emit_wrapper(), below.
	2797	func_emit_wrapper_part2 ()
	2798	{
	2799	func_emit_wrapper_part2_arg1=no
	2800	if test -n "$1" ; then
	2801	func_emit_wrapper_part2_arg1=$1
	2802	fi
	2803
	2804	$ECHO "\
2745	2805
2746	2806	# Usually 'no', except on cygwin/mingw when embedded into
2747	2807	# the cwrapper.
2748		WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1
	2808	WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_part2_arg1
2749	2809	if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then
2750	2810	# special case for '.'
2751	2811	if test \"\$thisdir\" = \".\"; then

2836	2896	"
2837	2897	case $host in
2838	2898	# Backslashes separate directories on plain windows
2839		--mingw \| --os2*)
	2899	--mingw \| --os2* \| -cegcc)
2840	2900	$ECHO "\
2841	2901	exec \"\$progdir\\\\\$program\" \${1+\"\$@\"}
2842	2902	"

2849	2909	;;
2850	2910	esac
2851	2911	$ECHO "\
2852		\$ECHO \"\$0: cannot exec \$program \$*\"
	2912	\$ECHO \"\$0: cannot exec \$program \$*\" 1>&2
2853	2913	exit 1
2854	2914	fi
2855	2915	else

2862	2922	fi\
2863	2923	"
2864	2924	}
2865		# end: func_emit_wrapper
	2925	# end: func_emit_wrapper_part2
	2926
	2927
	2928	# func_emit_wrapper [arg=no]
	2929	#
	2930	# Emit a libtool wrapper script on stdout.
	2931	# Don't directly open a file because we may want to
	2932	# incorporate the script contents within a cygwin/mingw
	2933	# wrapper executable. Must ONLY be called from within
	2934	# func_mode_link because it depends on a number of variables
	2935	# set therein.
	2936	#
	2937	# ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR
	2938	# variable will take. If 'yes', then the emitted script
	2939	# will assume that the directory in which it is stored is
	2940	# the $objdir directory. This is a cygwin/mingw-specific
	2941	# behavior.
	2942	func_emit_wrapper ()
	2943	{
	2944	func_emit_wrapper_arg1=no
	2945	if test -n "$1" ; then
	2946	func_emit_wrapper_arg1=$1
	2947	fi
	2948
	2949	# split this up so that func_emit_cwrapperexe_src
	2950	# can call each part independently.
	2951	func_emit_wrapper_part1 "${func_emit_wrapper_arg1}"
	2952	func_emit_wrapper_part2 "${func_emit_wrapper_arg1}"
	2953	}
	2954
	2955
	2956	# func_to_host_path arg
	2957	#
	2958	# Convert paths to host format when used with build tools.
	2959	# Intended for use with "native" mingw (where libtool itself
	2960	# is running under the msys shell), or in the following cross-
	2961	# build environments:
	2962	# $build $host
	2963	# mingw (msys) mingw [e.g. native]
	2964	# cygwin mingw
	2965	# *nix + wine mingw
	2966	# where wine is equipped with the `winepath' executable.
	2967	# In the native mingw case, the (msys) shell automatically
	2968	# converts paths for any non-msys applications it launches,
	2969	# but that facility isn't available from inside the cwrapper.
	2970	# Similar accommodations are necessary for $host mingw and
	2971	# $build cygwin. Calling this function does no harm for other
	2972	# $host/$build combinations not listed above.
	2973	#
	2974	# ARG is the path (on $build) that should be converted to
	2975	# the proper representation for $host. The result is stored
	2976	# in $func_to_host_path_result.
	2977	func_to_host_path ()
	2978	{
	2979	func_to_host_path_result="$1"
	2980	if test -n "$1" ; then
	2981	case $host in
	2982	mingw )
	2983	lt_sed_naive_backslashify='s\|\\\\*\|\\\|g;s\|/\|\\\|g;s\|\\\|\\\\\|g'
	2984	case $build in
	2985	mingw ) # actually, msys
	2986	# awkward: cmd appends spaces to result
	2987	lt_sed_strip_trailing_spaces="s/[ ]*\$//"
	2988	func_to_host_path_tmp1=`( cmd //c echo "$1" \|\
	2989	$SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null \|\| echo ""`
	2990	func_to_host_path_result=`echo "$func_to_host_path_tmp1" \|\
	2991	$SED -e "$lt_sed_naive_backslashify"`
	2992	;;
	2993	cygwin )
	2994	func_to_host_path_tmp1=`cygpath -w "$1"`
	2995	func_to_host_path_result=`echo "$func_to_host_path_tmp1" \|\
	2996	$SED -e "$lt_sed_naive_backslashify"`
	2997	;;
	2998	* )
	2999	# Unfortunately, winepath does not exit with a non-zero
	3000	# error code, so we are forced to check the contents of
	3001	# stdout. On the other hand, if the command is not
	3002	# found, the shell will set an exit code of 127 and print
	3003	# an error message to stdout. So we must check for both
	3004	# error code of zero AND non-empty stdout, which explains
	3005	# the odd construction:
	3006	func_to_host_path_tmp1=`winepath -w "$1" 2>/dev/null`
	3007	if test "$?" -eq 0 && test -n "${func_to_host_path_tmp1}"; then
	3008	func_to_host_path_result=`echo "$func_to_host_path_tmp1" \|\
	3009	$SED -e "$lt_sed_naive_backslashify"`
	3010	else
	3011	# Allow warning below.
	3012	func_to_host_path_result=""
	3013	fi
	3014	;;
	3015	esac
	3016	if test -z "$func_to_host_path_result" ; then
	3017	func_error "Could not determine host path corresponding to"
	3018	func_error " '$1'"
	3019	func_error "Continuing, but uninstalled executables may not work."
	3020	# Fallback:
	3021	func_to_host_path_result="$1"
	3022	fi
	3023	;;
	3024	esac
	3025	fi
	3026	}
	3027	# end: func_to_host_path
	3028
	3029	# func_to_host_pathlist arg
	3030	#
	3031	# Convert pathlists to host format when used with build tools.
	3032	# See func_to_host_path(), above. This function supports the
	3033	# following $build/$host combinations (but does no harm for
	3034	# combinations not listed here):
	3035	# $build $host
	3036	# mingw (msys) mingw [e.g. native]
	3037	# cygwin mingw
	3038	# *nix + wine mingw
	3039	#
	3040	# Path separators are also converted from $build format to
	3041	# $host format. If ARG begins or ends with a path separator
	3042	# character, it is preserved (but converted to $host format)
	3043	# on output.
	3044	#
	3045	# ARG is a pathlist (on $build) that should be converted to
	3046	# the proper representation on $host. The result is stored
	3047	# in $func_to_host_pathlist_result.
	3048	func_to_host_pathlist ()
	3049	{
	3050	func_to_host_pathlist_result="$1"
	3051	if test -n "$1" ; then
	3052	case $host in
	3053	mingw )
	3054	lt_sed_naive_backslashify='s\|\\\\*\|\\\|g;s\|/\|\\\|g;s\|\\\|\\\\\|g'
	3055	# Remove leading and trailing path separator characters from
	3056	# ARG. msys behavior is inconsistent here, cygpath turns them
	3057	# into '.;' and ';.', and winepath ignores them completely.
	3058	func_to_host_pathlist_tmp2="$1"
	3059	# Once set for this call, this variable should not be
	3060	# reassigned. It is used in tha fallback case.
	3061	func_to_host_pathlist_tmp1=`echo "$func_to_host_pathlist_tmp2" \|\
	3062	$SED -e 's\|^:\|\|' -e 's\|:$\|\|'`
	3063	case $build in
	3064	mingw ) # Actually, msys.
	3065	# Awkward: cmd appends spaces to result.
	3066	lt_sed_strip_trailing_spaces="s/[ ]*\$//"
	3067	func_to_host_pathlist_tmp2=`( cmd //c echo "$func_to_host_pathlist_tmp1" \|\
	3068	$SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null \|\| echo ""`
	3069	func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" \|\
	3070	$SED -e "$lt_sed_naive_backslashify"`
	3071	;;
	3072	cygwin )
	3073	func_to_host_pathlist_tmp2=`cygpath -w -p "$func_to_host_pathlist_tmp1"`
	3074	func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp2" \|\
	3075	$SED -e "$lt_sed_naive_backslashify"`
	3076	;;
	3077	* )
	3078	# unfortunately, winepath doesn't convert pathlists
	3079	func_to_host_pathlist_result=""
	3080	func_to_host_pathlist_oldIFS=$IFS
	3081	IFS=:
	3082	for func_to_host_pathlist_f in $func_to_host_pathlist_tmp1 ; do
	3083	IFS=$func_to_host_pathlist_oldIFS
	3084	if test -n "$func_to_host_pathlist_f" ; then
	3085	func_to_host_path "$func_to_host_pathlist_f"
	3086	if test -n "$func_to_host_path_result" ; then
	3087	if test -z "$func_to_host_pathlist_result" ; then
	3088	func_to_host_pathlist_result="$func_to_host_path_result"
	3089	else
	3090	func_to_host_pathlist_result="$func_to_host_pathlist_result;$func_to_host_path_result"
	3091	fi
	3092	fi
	3093	fi
	3094	IFS=:
	3095	done
	3096	IFS=$func_to_host_pathlist_oldIFS
	3097	;;
	3098	esac
	3099	if test -z "$func_to_host_pathlist_result" ; then
	3100	func_error "Could not determine the host path(s) corresponding to"
	3101	func_error " '$1'"
	3102	func_error "Continuing, but uninstalled executables may not work."
	3103	# Fallback. This may break if $1 contains DOS-style drive
	3104	# specifications. The fix is not to complicate the expression
	3105	# below, but for the user to provide a working wine installation
	3106	# with winepath so that path translation in the cross-to-mingw
	3107	# case works properly.
	3108	lt_replace_pathsep_nix_to_dos="s\|:\|;\|g"
	3109	func_to_host_pathlist_result=`echo "$func_to_host_pathlist_tmp1" \|\
	3110	$SED -e "$lt_replace_pathsep_nix_to_dos"`
	3111	fi
	3112	# Now, add the leading and trailing path separators back
	3113	case "$1" in
	3114	:* ) func_to_host_pathlist_result=";$func_to_host_pathlist_result"
	3115	;;
	3116	esac
	3117	case "$1" in
	3118	*: ) func_to_host_pathlist_result="$func_to_host_pathlist_result;"
	3119	;;
	3120	esac
	3121	;;
	3122	esac
	3123	fi
	3124	}
	3125	# end: func_to_host_pathlist
2866	3126
2867	3127	# func_emit_cwrapperexe_src
2868	3128	# emit the source code for a wrapper executable on stdout

2892	3152	#ifdef _MSC_VER
2893	3153	# include <direct.h>
2894	3154	# include <process.h>
	3155	# include <io.h>
	3156	# define setmode _setmode
2895	3157	#else
2896	3158	# include <unistd.h>
2897	3159	# include <stdint.h>
	3160	# ifdef __CYGWIN__
	3161	# include <io.h>
	3162	# define HAVE_SETENV
	3163	# ifdef __STRICT_ANSI__
	3164	char realpath (const char , char *);
	3165	int putenv (char *);
	3166	int setenv (const char , const char , int);
	3167	# endif
	3168	# endif
2898	3169	#endif
2899	3170	#include <malloc.h>
2900	3171	#include <stdarg.h>

2902	3173	#include <string.h>
2903	3174	#include <ctype.h>
2904	3175	#include <errno.h>
	3176	#include <fcntl.h>
2905	3177	#include <sys/stat.h>
2906	3178
2907	3179	#if defined(PATH_MAX)

2935	3207	#if defined (_WIN32) \|\| defined (__MSDOS__) \|\| defined (__DJGPP__) \|\| \
2936	3208	defined (__OS2__)
2937	3209	# define HAVE_DOS_BASED_FILE_SYSTEM
	3210	# define FOPEN_WB "wb"
2938	3211	# ifndef DIR_SEPARATOR_2
2939	3212	# define DIR_SEPARATOR_2 '\\'
2940	3213	# endif

2955	3228	#else /* PATH_SEPARATOR_2 */
2956	3229	# define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2)
2957	3230	#endif /* PATH_SEPARATOR_2 */
	3231
	3232	#ifdef __CYGWIN__
	3233	# define FOPEN_WB "wb"
	3234	#endif
	3235
	3236	#ifndef FOPEN_WB
	3237	# define FOPEN_WB "w"
	3238	#endif
	3239	#ifndef _O_BINARY
	3240	# define _O_BINARY 0
	3241	#endif
2958	3242
2959	3243	#define XMALLOC(type, num) ((type ) xmalloc ((num) sizeof(type)))
2960	3244	#define XFREE(stale) do { \

2987	3271	int check_executable (const char *path);
2988	3272	char strendzap (char str, const char *pat);
2989	3273	void lt_fatal (const char *message, ...);
2990
2991		static const char *script_text =
	3274	void lt_setenv (const char name, const char value);
	3275	char lt_extend_str (const char orig_value, const char *add, int to_end);
	3276	void lt_opt_process_env_set (const char *arg);
	3277	void lt_opt_process_env_prepend (const char *arg);
	3278	void lt_opt_process_env_append (const char *arg);
	3279	int lt_split_name_value (const char arg, char* name, char** value);
	3280	void lt_update_exe_path (const char name, const char value);
	3281	void lt_update_lib_path (const char name, const char value);
	3282
	3283	static const char *script_text_part1 =
2992	3284	EOF
2993	3285
2994		func_emit_wrapper yes \|
	3286	func_emit_wrapper_part1 yes \|
2995	3287	$SED -e 's/$[\\"]$/\\\1/g' \
2996	3288	-e 's/^/ "/' -e 's/$/\\n"/'
2997	3289	echo ";"
	3290	cat <<EOF
	3291
	3292	static const char *script_text_part2 =
	3293	EOF
	3294	func_emit_wrapper_part2 yes \|
	3295	$SED -e 's/$[\\"]$/\\\1/g' \
	3296	-e 's/^/ "/' -e 's/$/\\n"/'
	3297	echo ";"
2998	3298
2999	3299	cat <<EOF
3000	3300	const char * MAGIC_EXE = "$magic_exe";
	3301	const char * LIB_PATH_VARNAME = "$shlibpath_var";
	3302	EOF
	3303
	3304	if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then
	3305	func_to_host_pathlist "$temp_rpath"
	3306	cat <<EOF
	3307	const char * LIB_PATH_VALUE = "$func_to_host_pathlist_result";
	3308	EOF
	3309	else
	3310	cat <<"EOF"
	3311	const char * LIB_PATH_VALUE = "";
	3312	EOF
	3313	fi
	3314
	3315	if test -n "$dllsearchpath"; then
	3316	func_to_host_pathlist "$dllsearchpath:"
	3317	cat <<EOF
	3318	const char * EXE_PATH_VARNAME = "PATH";
	3319	const char * EXE_PATH_VALUE = "$func_to_host_pathlist_result";
	3320	EOF
	3321	else
	3322	cat <<"EOF"
	3323	const char * EXE_PATH_VARNAME = "";
	3324	const char * EXE_PATH_VALUE = "";
	3325	EOF
	3326	fi
	3327
	3328	if test "$fast_install" = yes; then
	3329	cat <<EOF
	3330	const char * TARGET_PROGRAM_NAME = "lt-$outputname"; /* hopefully, no .exe */
	3331	EOF
	3332	else
	3333	cat <<EOF
	3334	const char * TARGET_PROGRAM_NAME = "$outputname"; /* hopefully, no .exe */
	3335	EOF
	3336	fi
	3337
	3338
	3339	cat <<"EOF"
	3340
	3341	#define LTWRAPPER_OPTION_PREFIX "--lt-"
	3342	#define LTWRAPPER_OPTION_PREFIX_LENGTH 5
	3343
	3344	static const size_t opt_prefix_len = LTWRAPPER_OPTION_PREFIX_LENGTH;
	3345	static const char *ltwrapper_option_prefix = LTWRAPPER_OPTION_PREFIX;
	3346
	3347	static const char *dumpscript_opt = LTWRAPPER_OPTION_PREFIX "dump-script";
	3348
	3349	static const size_t env_set_opt_len = LTWRAPPER_OPTION_PREFIX_LENGTH + 7;
	3350	static const char *env_set_opt = LTWRAPPER_OPTION_PREFIX "env-set";
	3351	/* argument is putenv-style "foo=bar", value of foo is set to bar */
	3352
	3353	static const size_t env_prepend_opt_len = LTWRAPPER_OPTION_PREFIX_LENGTH + 11;
	3354	static const char *env_prepend_opt = LTWRAPPER_OPTION_PREFIX "env-prepend";
	3355	/* argument is putenv-style "foo=bar", new value of foo is bar${foo} */
	3356
	3357	static const size_t env_append_opt_len = LTWRAPPER_OPTION_PREFIX_LENGTH + 10;
	3358	static const char *env_append_opt = LTWRAPPER_OPTION_PREFIX "env-append";
	3359	/* argument is putenv-style "foo=bar", new value of foo is ${foo}bar */
3001	3360
3002	3361	int
3003	3362	main (int argc, char *argv[])
3004	3363	{
3005	3364	char **newargz;
	3365	int newargc;
3006	3366	char *tmp_pathspec;
3007	3367	char *actual_cwrapper_path;
3008		char *shwrapper_name;
	3368	char *actual_cwrapper_name;
	3369	char *target_name;
	3370	char *lt_argv_zero;
3009	3371	intptr_t rval = 127;
3010		FILE *shwrapper;
3011
3012		const char *dumpscript_opt = "--lt-dump-script";
	3372
3013	3373	int i;
3014	3374
3015	3375	program_name = (char *) xstrdup (base_name (argv[0]));

3021	3381	{
3022	3382	if (strcmp (argv[i], dumpscript_opt) == 0)
3023	3383	{
3024		printf ("%s", script_text);
	3384	EOF
	3385	case "$host" in
	3386	mingw \| cygwin )
	3387	# make stdout use "unix" line endings
	3388	echo " setmode(1,_O_BINARY);"
	3389	;;
	3390	esac
	3391
	3392	cat <<"EOF"
	3393	printf ("%s", script_text_part1);
	3394	printf ("%s", script_text_part2);
3025	3395	return 0;
3026	3396	}
3027	3397	}
3028	3398
3029		newargz = XMALLOC (char *, argc + 2);
3030		EOF
3031
3032		if test -n "$TARGETSHELL" ; then
3033		# no path translation at all
3034		lt_newargv0=$TARGETSHELL
3035		else
3036		case "$host" in
3037		mingw )
3038		# awkward: cmd appends spaces to result
3039		lt_sed_strip_trailing_spaces="s/[ ]*\$//"
3040		lt_newargv0=`( cmd //c echo $SHELL \| $SED -e "$lt_sed_strip_trailing_spaces" ) 2>/dev/null \|\| echo $SHELL`
3041		case $lt_newargv0 in
3042		.exe \| .EXE) ;;
3043		*) lt_newargv0=$lt_newargv0.exe ;;
3044		esac
3045		;;
3046		* ) lt_newargv0=$SHELL ;;
3047		esac
3048		fi
3049
3050		cat <<EOF
3051		newargz[0] = (char *) xstrdup ("$lt_newargv0");
3052		EOF
3053
3054		cat <<"EOF"
	3399	newargz = XMALLOC (char *, argc + 1);
3055	3400	tmp_pathspec = find_executable (argv[0]);
3056	3401	if (tmp_pathspec == NULL)
3057	3402	lt_fatal ("Couldn't find %s", argv[0]);

3063	3408	actual_cwrapper_path));
3064	3409	XFREE (tmp_pathspec);
3065	3410
3066		shwrapper_name = (char *) xstrdup (base_name (actual_cwrapper_path));
3067		strendzap (actual_cwrapper_path, shwrapper_name);
3068
3069		/* shwrapper_name transforms */
3070		strendzap (shwrapper_name, ".exe");
3071		tmp_pathspec = XMALLOC (char, (strlen (shwrapper_name) +
3072		strlen ("_ltshwrapperTMP") + 1));
3073		strcpy (tmp_pathspec, shwrapper_name);
3074		strcat (tmp_pathspec, "_ltshwrapperTMP");
3075		XFREE (shwrapper_name);
3076		shwrapper_name = tmp_pathspec;
	3411	actual_cwrapper_name = xstrdup( base_name (actual_cwrapper_path));
	3412	strendzap (actual_cwrapper_path, actual_cwrapper_name);
	3413
	3414	/* wrapper name transforms */
	3415	strendzap (actual_cwrapper_name, ".exe");
	3416	tmp_pathspec = lt_extend_str (actual_cwrapper_name, ".exe", 1);
	3417	XFREE (actual_cwrapper_name);
	3418	actual_cwrapper_name = tmp_pathspec;
3077	3419	tmp_pathspec = 0;
3078		LTWRAPPER_DEBUGPRINTF (("(main) libtool shell wrapper name: %s\n",
3079		shwrapper_name));
	3420
	3421	/* target_name transforms -- use actual target program name; might have lt- prefix */
	3422	target_name = xstrdup (base_name (TARGET_PROGRAM_NAME));
	3423	strendzap (target_name, ".exe");
	3424	tmp_pathspec = lt_extend_str (target_name, ".exe", 1);
	3425	XFREE (target_name);
	3426	target_name = tmp_pathspec;
	3427	tmp_pathspec = 0;
	3428
	3429	LTWRAPPER_DEBUGPRINTF (("(main) libtool target name: %s\n",
	3430	target_name));
3080	3431	EOF
3081	3432
3082	3433	cat <<EOF
3083		newargz[1] =
	3434	newargz[0] =
3084	3435	XMALLOC (char, (strlen (actual_cwrapper_path) +
3085		strlen ("$objdir") + 1 + strlen (shwrapper_name) + 1));
3086		strcpy (newargz[1], actual_cwrapper_path);
3087		strcat (newargz[1], "$objdir");
3088		strcat (newargz[1], "/");
3089		strcat (newargz[1], shwrapper_name);
	3436	strlen ("$objdir") + 1 + strlen (actual_cwrapper_name) + 1));
	3437	strcpy (newargz[0], actual_cwrapper_path);
	3438	strcat (newargz[0], "$objdir");
	3439	strcat (newargz[0], "/");
3090	3440	EOF
3091	3441
	3442	cat <<"EOF"
	3443	/* stop here, and copy so we don't have to do this twice */
	3444	tmp_pathspec = xstrdup (newargz[0]);
	3445
	3446	/* do NOT want the lt- prefix here, so use actual_cwrapper_name */
	3447	strcat (newargz[0], actual_cwrapper_name);
	3448
	3449	/* DO want the lt- prefix here if it exists, so use target_name */
	3450	lt_argv_zero = lt_extend_str (tmp_pathspec, target_name, 1);
	3451	XFREE (tmp_pathspec);
	3452	tmp_pathspec = NULL;
	3453	EOF
3092	3454
3093	3455	case $host_os in
3094	3456	mingw*)
3095	3457	cat <<"EOF"
3096	3458	{
3097	3459	char* p;
3098		while ((p = strchr (newargz[1], '\\')) != NULL)
	3460	while ((p = strchr (newargz[0], '\\')) != NULL)
	3461	{
	3462	*p = '/';
	3463	}
	3464	while ((p = strchr (lt_argv_zero, '\\')) != NULL)
3099	3465	{
3100	3466	*p = '/';
3101	3467	}

3105	3471	esac
3106	3472
3107	3473	cat <<"EOF"
3108		XFREE (shwrapper_name);
	3474	XFREE (target_name);
3109	3475	XFREE (actual_cwrapper_path);
3110
3111		/* note: do NOT use "wt" here! -- defer to underlying
3112		* mount type on cygwin
3113		*/
3114		if ((shwrapper = fopen (newargz[1], "w")) == 0)
	3476	XFREE (actual_cwrapper_name);
	3477
	3478	lt_setenv ("BIN_SH", "xpg4"); /* for Tru64 */
	3479	lt_setenv ("DUALCASE", "1"); /* for MSK sh */
	3480	lt_update_lib_path (LIB_PATH_VARNAME, LIB_PATH_VALUE);
	3481	lt_update_exe_path (EXE_PATH_VARNAME, EXE_PATH_VALUE);
	3482
	3483	newargc=0;
	3484	for (i = 1; i < argc; i++)
3115	3485	{
3116		lt_fatal ("Could not open %s for writing", newargz[1]);
	3486	if (strncmp (argv[i], env_set_opt, env_set_opt_len) == 0)
	3487	{
	3488	if (argv[i][env_set_opt_len] == '=')
	3489	{
	3490	const char *p = argv[i] + env_set_opt_len + 1;
	3491	lt_opt_process_env_set (p);
	3492	}
	3493	else if (argv[i][env_set_opt_len] == '\0' && i + 1 < argc)
	3494	{
	3495	lt_opt_process_env_set (argv[++i]); /* don't copy */
	3496	}
	3497	else
	3498	lt_fatal ("%s missing required argument", env_set_opt);
	3499	continue;
	3500	}
	3501	if (strncmp (argv[i], env_prepend_opt, env_prepend_opt_len) == 0)
	3502	{
	3503	if (argv[i][env_prepend_opt_len] == '=')
	3504	{
	3505	const char *p = argv[i] + env_prepend_opt_len + 1;
	3506	lt_opt_process_env_prepend (p);
	3507	}
	3508	else if (argv[i][env_prepend_opt_len] == '\0' && i + 1 < argc)
	3509	{
	3510	lt_opt_process_env_prepend (argv[++i]); /* don't copy */
	3511	}
	3512	else
	3513	lt_fatal ("%s missing required argument", env_prepend_opt);
	3514	continue;
	3515	}
	3516	if (strncmp (argv[i], env_append_opt, env_append_opt_len) == 0)
	3517	{
	3518	if (argv[i][env_append_opt_len] == '=')
	3519	{
	3520	const char *p = argv[i] + env_append_opt_len + 1;
	3521	lt_opt_process_env_append (p);
	3522	}
	3523	else if (argv[i][env_append_opt_len] == '\0' && i + 1 < argc)
	3524	{
	3525	lt_opt_process_env_append (argv[++i]); /* don't copy */
	3526	}
	3527	else
	3528	lt_fatal ("%s missing required argument", env_append_opt);
	3529	continue;
	3530	}
	3531	if (strncmp (argv[i], ltwrapper_option_prefix, opt_prefix_len) == 0)
	3532	{
	3533	/* however, if there is an option in the LTWRAPPER_OPTION_PREFIX
	3534	namespace, but it is not one of the ones we know about and
	3535	have already dealt with, above (inluding dump-script), then
	3536	report an error. Otherwise, targets might begin to believe
	3537	they are allowed to use options in the LTWRAPPER_OPTION_PREFIX
	3538	namespace. The first time any user complains about this, we'll
	3539	need to make LTWRAPPER_OPTION_PREFIX a configure-time option
	3540	or a configure.ac-settable value.
	3541	*/
	3542	lt_fatal ("Unrecognized option in %s namespace: '%s'",
	3543	ltwrapper_option_prefix, argv[i]);
	3544	}
	3545	/* otherwise ... */
	3546	newargz[++newargc] = xstrdup (argv[i]);
3117	3547	}
3118		fprintf (shwrapper, "%s", script_text);
3119		fclose (shwrapper);
3120
3121		make_executable (newargz[1]);
3122
3123		for (i = 1; i < argc; i++)
3124		newargz[i + 1] = xstrdup (argv[i]);
3125		newargz[argc + 1] = NULL;
3126
3127		for (i = 0; i < argc + 1; i++)
	3548	newargz[++newargc] = NULL;
	3549
	3550	LTWRAPPER_DEBUGPRINTF (("(main) lt_argv_zero : %s\n", (lt_argv_zero ? lt_argv_zero : "<NULL>")));
	3551	for (i = 0; i < newargc; i++)
3128	3552	{
3129		LTWRAPPER_DEBUGPRINTF (("(main) newargz[%d] : %s\n", i, newargz[i]));
	3553	LTWRAPPER_DEBUGPRINTF (("(main) newargz[%d] : %s\n", i, (newargz[i] ? newargz[i] : "<NULL>")));
3130	3554	}
3131	3555
3132	3556	EOF
3133	3557
3134	3558	case $host_os in
3135	3559	mingw*)
3136		cat <<EOF
	3560	cat <<"EOF"
3137	3561	/* execv doesn't actually work on mingw as expected on unix */
3138		rval = _spawnv (_P_WAIT, "$lt_newargv0", (const char * const *) newargz);
	3562	rval = _spawnv (_P_WAIT, lt_argv_zero, (const char * const *) newargz);
3139	3563	if (rval == -1)
3140	3564	{
3141	3565	/* failed to start process */
3142		LTWRAPPER_DEBUGPRINTF (("(main) failed to launch target \"$lt_newargv0\": errno = %d\n", errno));
	3566	LTWRAPPER_DEBUGPRINTF (("(main) failed to launch target \"%s\": errno = %d\n", lt_argv_zero, errno));
3143	3567	return 127;
3144	3568	}
3145	3569	return rval;
3146		}
3147	3570	EOF
3148	3571	;;
3149	3572	*)
3150		cat <<EOF
3151		execv ("$lt_newargv0", newargz);
	3573	cat <<"EOF"
	3574	execv (lt_argv_zero, newargz);
3152	3575	return rval; /* =127, but avoids unused variable warning */
3153		}
3154	3576	EOF
3155	3577	;;
3156	3578	esac
3157	3579
3158	3580	cat <<"EOF"
	3581	}
3159	3582
3160	3583	void *
3161	3584	xmalloc (size_t num)

3429	3852	lt_error_core (EXIT_FAILURE, "FATAL", message, ap);
3430	3853	va_end (ap);
3431	3854	}
	3855
	3856	void
	3857	lt_setenv (const char name, const char value)
	3858	{
	3859	LTWRAPPER_DEBUGPRINTF (("(lt_setenv) setting '%s' to '%s'\n",
	3860	(name ? name : "<NULL>"),
	3861	(value ? value : "<NULL>")));
	3862	{
	3863	#ifdef HAVE_SETENV
	3864	/* always make a copy, for consistency with !HAVE_SETENV */
	3865	char *str = xstrdup (value);
	3866	setenv (name, str, 1);
	3867	#else
	3868	int len = strlen (name) + 1 + strlen (value) + 1;
	3869	char *str = XMALLOC (char, len);
	3870	sprintf (str, "%s=%s", name, value);
	3871	if (putenv (str) != EXIT_SUCCESS)
	3872	{
	3873	XFREE (str);
	3874	}
	3875	#endif
	3876	}
	3877	}
	3878
	3879	char *
	3880	lt_extend_str (const char orig_value, const char add, int to_end)
	3881	{
	3882	char *new_value;
	3883	if (orig_value && *orig_value)
	3884	{
	3885	int orig_value_len = strlen (orig_value);
	3886	int add_len = strlen (add);
	3887	new_value = XMALLOC (char, add_len + orig_value_len + 1);
	3888	if (to_end)
	3889	{
	3890	strcpy (new_value, orig_value);
	3891	strcpy (new_value + orig_value_len, add);
	3892	}
	3893	else
	3894	{
	3895	strcpy (new_value, add);
	3896	strcpy (new_value + add_len, orig_value);
	3897	}
	3898	}
	3899	else
	3900	{
	3901	new_value = xstrdup (add);
	3902	}
	3903	return new_value;
	3904	}
	3905
	3906	int
	3907	lt_split_name_value (const char arg, char* name, char** value)
	3908	{
	3909	const char *p;
	3910	int len;
	3911	if (!arg \|\| !*arg)
	3912	return 1;
	3913
	3914	p = strchr (arg, (int)'=');
	3915
	3916	if (!p)
	3917	return 1;
	3918
	3919	*value = xstrdup (++p);
	3920
	3921	len = strlen (arg) - strlen (*value);
	3922	*name = XMALLOC (char, len);
	3923	strncpy (*name, arg, len-1);
	3924	(*name)[len - 1] = '\0';
	3925
	3926	return 0;
	3927	}
	3928
	3929	void
	3930	lt_opt_process_env_set (const char *arg)
	3931	{
	3932	char *name = NULL;
	3933	char *value = NULL;
	3934
	3935	if (lt_split_name_value (arg, &name, &value) != 0)
	3936	{
	3937	XFREE (name);
	3938	XFREE (value);
	3939	lt_fatal ("bad argument for %s: '%s'", env_set_opt, arg);
	3940	}
	3941
	3942	lt_setenv (name, value);
	3943	XFREE (name);
	3944	XFREE (value);
	3945	}
	3946
	3947	void
	3948	lt_opt_process_env_prepend (const char *arg)
	3949	{
	3950	char *name = NULL;
	3951	char *value = NULL;
	3952	char *new_value = NULL;
	3953
	3954	if (lt_split_name_value (arg, &name, &value) != 0)
	3955	{
	3956	XFREE (name);
	3957	XFREE (value);
	3958	lt_fatal ("bad argument for %s: '%s'", env_prepend_opt, arg);
	3959	}
	3960
	3961	new_value = lt_extend_str (getenv (name), value, 0);
	3962	lt_setenv (name, new_value);
	3963	XFREE (new_value);
	3964	XFREE (name);
	3965	XFREE (value);
	3966	}
	3967
	3968	void
	3969	lt_opt_process_env_append (const char *arg)
	3970	{
	3971	char *name = NULL;
	3972	char *value = NULL;
	3973	char *new_value = NULL;
	3974
	3975	if (lt_split_name_value (arg, &name, &value) != 0)
	3976	{
	3977	XFREE (name);
	3978	XFREE (value);
	3979	lt_fatal ("bad argument for %s: '%s'", env_append_opt, arg);
	3980	}
	3981
	3982	new_value = lt_extend_str (getenv (name), value, 1);
	3983	lt_setenv (name, new_value);
	3984	XFREE (new_value);
	3985	XFREE (name);
	3986	XFREE (value);
	3987	}
	3988
	3989	void
	3990	lt_update_exe_path (const char name, const char value)
	3991	{
	3992	LTWRAPPER_DEBUGPRINTF (("(lt_update_exe_path) modifying '%s' by prepending '%s'\n",
	3993	(name ? name : "<NULL>"),
	3994	(value ? value : "<NULL>")));
	3995
	3996	if (name && name && value && value)
	3997	{
	3998	char *new_value = lt_extend_str (getenv (name), value, 0);
	3999	/* some systems can't cope with a ':'-terminated path #' */
	4000	int len = strlen (new_value);
	4001	while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1]))
	4002	{
	4003	new_value[len-1] = '\0';
	4004	}
	4005	lt_setenv (name, new_value);
	4006	XFREE (new_value);
	4007	}
	4008	}
	4009
	4010	void
	4011	lt_update_lib_path (const char name, const char value)
	4012	{
	4013	LTWRAPPER_DEBUGPRINTF (("(lt_update_lib_path) modifying '%s' by prepending '%s'\n",
	4014	(name ? name : "<NULL>"),
	4015	(value ? value : "<NULL>")));
	4016
	4017	if (name && name && value && value)
	4018	{
	4019	char *new_value = lt_extend_str (getenv (name), value, 0);
	4020	lt_setenv (name, new_value);
	4021	XFREE (new_value);
	4022	}
	4023	}
	4024
	4025
3432	4026	EOF
3433	4027	}
3434	4028	# end: func_emit_cwrapperexe_src

3438	4032	{
3439	4033	$opt_debug
3440	4034	case $host in
3441		--cygwin* \| --mingw* \| --pw32* \| --os2*)
	4035	--cygwin* \| --mingw* \| --pw32* \| --os2* \| -cegcc)
3442	4036	# It is impossible to link a dll without this setting, and
3443	4037	# we shouldn't force the makefile maintainer to figure out
3444	4038	# which system we are compiling for in order to pass an extra

3525	4119	fi
3526	4120	if test -n "$link_static_flag"; then
3527	4121	dlopen_self=$dlopen_self_static
3528		# See comment for -static flag below, for more details.
3529		func_append compile_command " $link_static_flag"
3530		func_append finalize_command " $link_static_flag"
3531	4122	fi
3532	4123	prefer_static_libs=yes
3533	4124	;;

3815	4406
3816	4407	case $arg in
3817	4408	-all-static)
3818		# The effects of -all-static are defined in a previous loop.
	4409	if test -n "$link_static_flag"; then
	4410	# See comment for -static flag below, for more details.
	4411	func_append compile_command " $link_static_flag"
	4412	func_append finalize_command " $link_static_flag"
	4413	fi
3819	4414	continue
3820	4415	;;
3821	4416

3881	4476	-L*)
3882	4477	func_stripname '-L' '' "$arg"
3883	4478	dir=$func_stripname_result
	4479	if test -z "$dir"; then
	4480	if test "$#" -gt 0; then
	4481	func_fatal_error "require no space between \`-L' and \`$1'"
	4482	else
	4483	func_fatal_error "need path for \`-L' option"
	4484	fi
	4485	fi
3884	4486	# We need an absolute path.
3885	4487	case $dir in
3886	4488	[\\/]* \| [A-Za-z]:[\\/]*) ;;

3899	4501	;;
3900	4502	esac
3901	4503	case $host in
3902		--cygwin* \| --mingw* \| --pw32* \| --os2*)
	4504	--cygwin* \| --mingw* \| --pw32* \| --os2* \| -cegcc)
3903	4505	testbindir=`$ECHO "X$dir" \| $Xsed -e 's/lib$/bin*'`
3904	4506	case :$dllsearchpath: in
3905	4507	":$dir:") ;;
	4508	::) dllsearchpath=$dir;;
3906	4509	*) dllsearchpath="$dllsearchpath:$dir";;
3907	4510	esac
3908	4511	case :$dllsearchpath: in
3909	4512	":$testbindir:") ;;
	4513	::) dllsearchpath=$testbindir;;
3910	4514	*) dllsearchpath="$dllsearchpath:$testbindir";;
3911	4515	esac
3912	4516	;;

3917	4521	-l*)
3918	4522	if test "X$arg" = "X-lc" \|\| test "X$arg" = "X-lm"; then
3919	4523	case $host in
3920		--cygwin* \| --mingw* \| --pw32* \| --beos*)
	4524	--cygwin* \| --mingw* \| --pw32* \| --beos* \| -cegcc)
3921	4525	# These systems don't actually have a C or math library (as such)
3922	4526	continue
3923	4527	;;

3994	4598
3995	4599	-no-install)
3996	4600	case $host in
3997		--cygwin* \| --mingw* \| --pw32* \| --os2* \| --darwin*)
	4601	--cygwin* \| --mingw* \| --pw32* \| --os2* \| --darwin* \| -cegcc)
3998	4602	# The PATH hackery in wrapper scripts is required on Windows
3999	4603	# and Darwin in order for the loader to find any dlls it needs.
4000	4604	func_warning "\`-no-install' is ignored for $host"

4951	5555	if test -n "$library_names" &&
4952	5556	{ test "$use_static_libs" = no \|\| test -z "$old_library"; }; then
4953	5557	case $host in
4954		cygwin \| mingw)
	5558	cygwin \| mingw \| cegcc)
4955	5559	# No point in relinking DLLs because paths are not encoded
4956	5560	notinst_deplibs="$notinst_deplibs $lib"
4957	5561	need_relink=no

5021	5625	elif test -n "$soname_spec"; then
5022	5626	# bleh windows
5023	5627	case $host in
5024		cygwin \| mingw*)
5025		major=`expr $current - $age`
	5628	cygwin \| mingw* \| cegcc)
	5629	func_arith $current - $age
	5630	major=$func_arith_result
5026	5631	versuffix="-$major"
5027	5632	;;
5028	5633	esac

5314	5919	done
5315	5920	if test -f "$absdir/$objdir/$depdepl" ; then
5316	5921	depdepl="$absdir/$objdir/$depdepl"
5317		darwin_install_name=`otool -L $depdepl \| $SED -n -e '3q;2,2p' \| $SED -e 's/(.*//'`
5318		darwin_install_name=`$ECHO $darwin_install_name`
	5922	darwin_install_name=`${OTOOL} -L $depdepl \| awk '{if (NR == 2) {print $1;exit}}'`
5319	5923	if test -z "$darwin_install_name"; then
5320		darwin_install_name=`otool64 -L $depdepl \| $SED -n -e '3q;2,2p' \| $SED -e 's/(.*//'`
5321		darwin_install_name=`$ECHO $darwin_install_name`
	5924	darwin_install_name=`${OTOOL64} -L $depdepl \| awk '{if (NR == 2) {print $1;exit}}'`
5322	5925	fi
5323	5926	compiler_flags="$compiler_flags ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}"
5324	5927	linker_flags="$linker_flags -dylib_file ${darwin_install_name}:${depdepl}"

5585	6188	#
5586	6189	case $version_type in
5587	6190	darwin\|linux\|osf\|windows\|none)
5588		current=`expr $number_major + $number_minor`
	6191	func_arith $number_major + $number_minor
	6192	current=$func_arith_result
5589	6193	age="$number_minor"
5590	6194	revision="$number_revision"
5591	6195	;;

5595	6199	age="0"
5596	6200	;;
5597	6201	irix\|nonstopux)
5598		current=`expr $number_major + $number_minor`
	6202	func_arith $number_major + $number_minor
	6203	current=$func_arith_result
5599	6204	age="$number_minor"
5600	6205	revision="$number_minor"
5601	6206	lt_irix_increment=no

5649	6254	darwin)
5650	6255	# Like Linux, but with the current version available in
5651	6256	# verstring for coding it into the library header
5652		major=.`expr $current - $age`
	6257	func_arith $current - $age
	6258	major=.$func_arith_result
5653	6259	versuffix="$major.$age.$revision"
5654	6260	# Darwin ld doesn't like 0 for these options...
5655		minor_current=`expr $current + 1`
	6261	func_arith $current + 1
	6262	minor_current=$func_arith_result
5656	6263	xlcverstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision"
5657	6264	verstring="-compatibility_version $minor_current -current_version $minor_current.$revision"
5658	6265	;;

5669	6276
5670	6277	irix \| nonstopux)
5671	6278	if test "X$lt_irix_increment" = "Xno"; then
5672		major=`expr $current - $age`
	6279	func_arith $current - $age
5673	6280	else
5674		major=`expr $current - $age + 1`
	6281	func_arith $current - $age + 1
5675	6282	fi
	6283	major=$func_arith_result
5676	6284
5677	6285	case $version_type in
5678	6286	nonstopux) verstring_prefix=nonstopux ;;

5683	6291	# Add in all the interfaces that we are compatible with.
5684	6292	loop=$revision
5685	6293	while test "$loop" -ne 0; do
5686		iface=`expr $revision - $loop`
5687		loop=`expr $loop - 1`
	6294	func_arith $revision - $loop
	6295	iface=$func_arith_result
	6296	func_arith $loop - 1
	6297	loop=$func_arith_result
5688	6298	verstring="$verstring_prefix$major.$iface:$verstring"
5689	6299	done
5690	6300

5694	6304	;;
5695	6305
5696	6306	linux)
5697		major=.`expr $current - $age`
	6307	func_arith $current - $age
	6308	major=.$func_arith_result
5698	6309	versuffix="$major.$age.$revision"
5699	6310	;;
5700	6311
5701	6312	osf)
5702		major=.`expr $current - $age`
	6313	func_arith $current - $age
	6314	major=.$func_arith_result
5703	6315	versuffix=".$current.$age.$revision"
5704	6316	verstring="$current.$age.$revision"
5705	6317
5706	6318	# Add in all the interfaces that we are compatible with.
5707	6319	loop=$age
5708	6320	while test "$loop" -ne 0; do
5709		iface=`expr $current - $loop`
5710		loop=`expr $loop - 1`
	6321	func_arith $current - $loop
	6322	iface=$func_arith_result
	6323	func_arith $loop - 1
	6324	loop=$func_arith_result
5711	6325	verstring="$verstring:${iface}.0"
5712	6326	done
5713	6327

5728	6342	windows)
5729	6343	# Use '-' rather than '.', since we only want one
5730	6344	# extension on DOS 8.3 filesystems.
5731		major=`expr $current - $age`
	6345	func_arith $current - $age
	6346	major=$func_arith_result
5732	6347	versuffix="-$major"
5733	6348	;;
5734	6349

5789	6404	tempremovelist=`$ECHO "$output_objdir/*"`
5790	6405	for p in $tempremovelist; do
5791	6406	case $p in
5792		*.$objext)
	6407	.$objext \| .gcno)
5793	6408	;;
5794	6409	$output_objdir/$outputname \| $output_objdir/$libname.* \| $output_objdir/${libname}${release}.*)
5795	6410	if test "X$precious_files_regex" != "X"; then

5860	6475	if test "$build_libtool_libs" = yes; then
5861	6476	if test -n "$rpath"; then
5862	6477	case $host in
5863		--cygwin* \| --mingw* \| --pw32* \| --os2* \| --beos*)
	6478	--cygwin* \| --mingw* \| --pw32* \| --os2* \| --beos* \| -cegcc)
5864	6479	# these systems don't actually have a c library (as such)!
5865	6480	;;
5866	6481	--rhapsody* \| --darwin1.[012])

5924	6539	if $LTCC $LTCFLAGS -o conftest conftest.c $deplibs; then
5925	6540	ldd_output=`ldd conftest`
5926	6541	for i in $deplibs; do
5927		name=`expr $i : '-l$.*$'`
5928		# If $name is empty we are operating on a -L argument.
5929		if test "$name" != "" && test "$name" != "0"; then
	6542	case $i in
	6543	-l*)
	6544	func_stripname -l '' "$i"
	6545	name=$func_stripname_result
5930	6546	if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
5931	6547	case " $predeps $postdeps " in
5932	6548	" $i ")

5953	6569	$ECHO "*** its dynamic dependency list that programs get resolved with at runtime."
5954	6570	fi
5955	6571	fi
5956		else
	6572	;;
	6573	*)
5957	6574	newdeplibs="$newdeplibs $i"
5958		fi
	6575	;;
	6576	esac
5959	6577	done
5960	6578	else
5961	6579	# Error occurred in the first compile. Let's try to salvage
5962	6580	# the situation: Compile a separate program for each library.
5963	6581	for i in $deplibs; do
5964		name=`expr $i : '-l$.*$'`
5965		# If $name is empty we are operating on a -L argument.
5966		if test "$name" != "" && test "$name" != "0"; then
	6582	case $i in
	6583	-l*)
	6584	func_stripname -l '' "$i"
	6585	name=$func_stripname_result
5967	6586	$opt_dry_run \|\| $RM conftest
5968	6587	if $LTCC $LTCFLAGS -o conftest conftest.c $i; then
5969	6588	ldd_output=`ldd conftest`

6001	6620	$ECHO "*** library that it depends on before this library will be fully"
6002	6621	$ECHO "*** functional. Installing it before continuing would be even better."
6003	6622	fi
6004		else
	6623	;;
	6624	*)
6005	6625	newdeplibs="$newdeplibs $i"
6006		fi
	6626	;;
	6627	esac
6007	6628	done
6008	6629	fi
6009	6630	;;

6011	6632	set dummy $deplibs_check_method; shift
6012	6633	file_magic_regex=`expr "$deplibs_check_method" : "$1 $.*$"`
6013	6634	for a_deplib in $deplibs; do
6014		name=`expr $a_deplib : '-l$.*$'`
6015		# If $name is empty we are operating on a -L argument.
6016		if test "$name" != "" && test "$name" != "0"; then
	6635	case $a_deplib in
	6636	-l*)
	6637	func_stripname -l '' "$a_deplib"
	6638	name=$func_stripname_result
6017	6639	if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
6018	6640	case " $predeps $postdeps " in
6019	6641	" $a_deplib ")

6070	6692	$ECHO "*** using a file magic. Last file checked: $potlib"
6071	6693	fi
6072	6694	fi
6073		else
	6695	;;
	6696	*)
6074	6697	# Add a -L argument.
6075	6698	newdeplibs="$newdeplibs $a_deplib"
6076		fi
	6699	;;
	6700	esac
6077	6701	done # Gone through all deplibs.
6078	6702	;;
6079	6703	match_pattern*)
6080	6704	set dummy $deplibs_check_method; shift
6081	6705	match_pattern_regex=`expr "$deplibs_check_method" : "$1 $.*$"`
6082	6706	for a_deplib in $deplibs; do
6083		name=`expr $a_deplib : '-l$.*$'`
6084		# If $name is empty we are operating on a -L argument.
6085		if test -n "$name" && test "$name" != "0"; then
	6707	case $a_deplib in
	6708	-l*)
	6709	func_stripname -l '' "$a_deplib"
	6710	name=$func_stripname_result
6086	6711	if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then
6087	6712	case " $predeps $postdeps " in
6088	6713	" $a_deplib ")

6121	6746	$ECHO "*** using a regex pattern. Last file checked: $potlib"
6122	6747	fi
6123	6748	fi
6124		else
	6749	;;
	6750	*)
6125	6751	# Add a -L argument.
6126	6752	newdeplibs="$newdeplibs $a_deplib"
6127		fi
	6753	;;
	6754	esac
6128	6755	done # Gone through all deplibs.
6129	6756	;;
6130	6757	none \| unknown \| *)

6347	6974
6348	6975	orig_export_symbols=
6349	6976	case $host_os in
6350		cygwin* \| mingw*)
	6977	cygwin* \| mingw* \| cegcc*)
6351	6978	if test -n "$export_symbols" && test -z "$export_symbols_regex"; then
6352	6979	# exporting using user supplied symfile
6353	6980	if test "x`$SED 1q $export_symbols`" != xEXPORTS; then

6376	7003	for cmd in $cmds; do
6377	7004	IFS="$save_ifs"
6378	7005	eval cmd=\"$cmd\"
6379		if len=`expr "X$cmd" : ".*"` &&
6380		test "$len" -le "$max_cmd_len" \|\| test "$max_cmd_len" -le -1; then
	7006	func_len " $cmd"
	7007	len=$func_len_result
	7008	if test "$len" -lt "$max_cmd_len" \|\| test "$max_cmd_len" -le -1; then
6381	7009	func_show_eval "$cmd" 'exit $?'
6382	7010	skipped_export=false
6383	7011	else

6480	7108	fi
6481	7109
6482	7110	if test "X$skipped_export" != "X:" &&
6483		len=`expr "X$test_cmds" : ".*" 2>/dev/null` &&
6484		test "$len" -le "$max_cmd_len" \|\| test "$max_cmd_len" -le -1; then
	7111	func_len " $test_cmds" &&
	7112	len=$func_len_result &&
	7113	test "$len" -lt "$max_cmd_len" \|\| test "$max_cmd_len" -le -1; then
6485	7114	:
6486	7115	else
6487	7116	# The command line is too long to link in one step, link piecewise

6541	7170	if test -n "$save_libobjs"; then
6542	7171	func_verbose "creating reloadable object files..."
6543	7172	output=$output_objdir/$output_la-${k}.$objext
	7173	eval test_cmds=\"$reload_cmds\"
	7174	func_len " $test_cmds"
	7175	len0=$func_len_result
	7176	len=$len0
	7177
6544	7178	# Loop over the list of objects to be linked.
6545	7179	for obj in $save_libobjs
6546	7180	do
6547		eval test_cmds=\"$reload_cmds $objlist $last_robj\"
	7181	func_len " $obj"
	7182	func_arith $len + $func_len_result
	7183	len=$func_arith_result
6548	7184	if test "X$objlist" = X \|\|
6549		{ len=`expr "X$test_cmds" : ".*" 2>/dev/null` &&
6550		test "$len" -le "$max_cmd_len"; }; then
6551		objlist="$objlist $obj"
	7185	test "$len" -lt "$max_cmd_len"; then
	7186	func_append objlist " $obj"
6552	7187	else
6553	7188	# The command $test_cmds is almost too long, add a
6554	7189	# command to the queue.

6561	7196	eval concat_cmds=\"\$concat_cmds~$reload_cmds $objlist $last_robj~\$RM $last_robj\"
6562	7197	fi
6563	7198	last_robj=$output_objdir/$output_la-${k}.$objext
6564		k=`expr $k + 1`
	7199	func_arith $k + 1
	7200	k=$func_arith_result
6565	7201	output=$output_objdir/$output_la-${k}.$objext
6566	7202	objlist=$obj
6567		len=1
	7203	func_len " $last_robj"
	7204	func_arith $len0 + $func_len_result
	7205	len=$func_arith_result
6568	7206	fi
6569	7207	done
6570	7208	# Handle the remaining objects by creating one last

6961	7599	esac
6962	7600	fi
6963	7601	case $host in
6964		--cygwin* \| --mingw* \| --pw32* \| --os2*)
	7602	--cygwin* \| --mingw* \| --pw32* \| --os2* \| -cegcc)
6965	7603	testbindir=`${ECHO} "$libdir" \| ${SED} -e 's/lib$/bin*'`
6966	7604	case :$dllsearchpath: in
6967	7605	":$libdir:") ;;
	7606	::) dllsearchpath=$libdir;;
6968	7607	*) dllsearchpath="$dllsearchpath:$libdir";;
6969	7608	esac
6970	7609	case :$dllsearchpath: in
6971	7610	":$testbindir:") ;;
	7611	::) dllsearchpath=$testbindir;;
6972	7612	*) dllsearchpath="$dllsearchpath:$testbindir";;
6973	7613	esac
6974	7614	;;

7038	7678	wrappers_required=no
7039	7679	fi
7040	7680	;;
	7681	*cegcc)
	7682	# Disable wrappers for cegcc, we are cross compiling anyway.
	7683	wrappers_required=no
	7684	;;
7041	7685	*)
7042	7686	if test "$need_relink" = no \|\| test "$build_libtool_libs" != yes; then
7043	7687	wrappers_required=no

7190	7834
7191	7835	func_emit_cwrapperexe_src > $cwrappersource
7192	7836
7193		# we should really use a build-platform specific compiler
7194		# here, but OTOH, the wrappers (shell script and this C one)
7195		# are only useful if you want to execute the "real" binary.
7196		# Since the "real" binary is built for $host, then this
7197		# wrapper might as well be built for $host, too.
	7837	# The wrapper executable is built using the $host compiler,
	7838	# because it contains $host paths and files. If cross-
	7839	# compiling, it, like the target executable, must be
	7840	# executed on the $host or under an emulation environment.
7198	7841	$opt_dry_run \|\| {
7199	7842	$LTCC $LTCFLAGS -o $cwrapper $cwrappersource
7200	7843	$STRIP $cwrapper

7205	7848	$RM $func_ltwrapper_scriptname_result
7206	7849	trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15
7207	7850	$opt_dry_run \|\| {
7208		$cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result
	7851	# note: this script will not be executed, so do not chmod.
	7852	if test "x$build" = "x$host" ; then
	7853	$cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result
	7854	else
	7855	func_emit_wrapper no > $func_ltwrapper_scriptname_result
	7856	fi
7209	7857	}
7210	7858	;;
7211	7859	* )

7294	7942	# Make sure we don't pick an alternate name that also
7295	7943	# overlaps.
7296	7944	newobj=lt$counter-$objbase
7297		counter=`expr $counter + 1`
	7945	func_arith $counter + 1
	7946	counter=$func_arith_result
7298	7947	case " $oldobjs " in
7299	7948	[\ /]"$newobj ") ;;
7300	7949	*) if test ! -f "$gentop/$newobj"; then break; fi ;;

7309	7958	fi
7310	7959	eval cmds=\"$old_archive_cmds\"
7311	7960
7312		if len=`expr "X$cmds" : ".*" 2>/dev/null` &&
7313		test "$len" -le "$max_cmd_len" \|\| test "$max_cmd_len" -le -1; then
	7961	func_len " $cmds"
	7962	len=$func_len_result
	7963	if test "$len" -lt "$max_cmd_len" \|\| test "$max_cmd_len" -le -1; then
7314	7964	cmds=$old_archive_cmds
7315	7965	else
7316	7966	# the command line is too long to link in one step, link in parts

7320	7970	objlist=
7321	7971	concat_cmds=
7322	7972	save_oldobjs=$oldobjs
	7973	oldobjs=
7323	7974	# Is there a better way of finding the last object in the list?
7324	7975	for obj in $save_oldobjs
7325	7976	do
7326	7977	last_oldobj=$obj
7327	7978	done
	7979	eval test_cmds=\"$old_archive_cmds\"
	7980	func_len " $test_cmds"
	7981	len0=$func_len_result
	7982	len=$len0
7328	7983	for obj in $save_oldobjs
7329	7984	do
7330		oldobjs="$objlist $obj"
7331		objlist="$objlist $obj"
7332		eval test_cmds=\"$old_archive_cmds\"
7333		if len=`expr "X$test_cmds" : ".*" 2>/dev/null` &&
7334		test "$len" -le "$max_cmd_len"; then
	7985	func_len " $obj"
	7986	func_arith $len + $func_len_result
	7987	len=$func_arith_result
	7988	func_append objlist " $obj"
	7989	if test "$len" -lt "$max_cmd_len"; then
7335	7990	:
7336	7991	else
7337	7992	# the above command should be used before it gets too long

7342	7997	test -z "$concat_cmds" \|\| concat_cmds=$concat_cmds~
7343	7998	eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\"
7344	7999	objlist=
	8000	len=$len0
7345	8001	fi
7346	8002	done
7347	8003	RANLIB=$save_RANLIB

7466	8122	# place dlname in correct position for cygwin
7467	8123	tdlname=$dlname
7468	8124	case $host,$output,$installed,$module,$dlname in
7469		cygwin,lai,yes,no,.dll \| mingw,lai,yes,no,.dll) tdlname=../bin/$dlname ;;
	8125	cygwin,lai,yes,no,.dll \| mingw,lai,yes,no,.dll \| cegcc,lai,yes,no,.dll) tdlname=../bin/$dlname ;;
7470	8126	esac
7471	8127	$ECHO > $output "\
7472	8128	# $outputname - a libtool library file

+9

-0

matrix/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* matrix.c: compile all the inline matrix functions from header
	3
	4	* gsl_matrix.h and all related files: use new inline declarations
	5
	6	* Makefile.am (INCLUDES): use top_srcdir, remove top_builddir
	7	(noinst_HEADERS): remove matrix_source.c
	8
0	9	2007-08-21 Brian Gough <bjg@network-theory.co.uk>
1	10
2	11	* prop_source.c (FUNCTION): added gsl_matrix_isnonneg

+2

-2

matrix/Makefile.am less more

3	3
4	4	pkginclude_HEADERS = gsl_matrix.h gsl_matrix_char.h gsl_matrix_complex_double.h gsl_matrix_complex_float.h gsl_matrix_complex_long_double.h gsl_matrix_double.h gsl_matrix_float.h gsl_matrix_int.h gsl_matrix_long.h gsl_matrix_long_double.h gsl_matrix_short.h gsl_matrix_uchar.h gsl_matrix_uint.h gsl_matrix_ulong.h gsl_matrix_ushort.h
5	5
6		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	TESTS = $(check_PROGRAMS)
9	9

16	16
17	17	CLEANFILES = test.txt test.dat
18	18
19		noinst_HEADERS = matrix_source.c init_source.c file_source.c rowcol_source.c swap_source.c copy_source.c test_complex_source.c test_source.c minmax_source.c prop_source.c oper_source.c getset_source.c view_source.c submatrix_source.c oper_complex_source.c
	19	noinst_HEADERS = init_source.c file_source.c rowcol_source.c swap_source.c copy_source.c test_complex_source.c test_source.c minmax_source.c prop_source.c oper_source.c getset_source.c view_source.c submatrix_source.c oper_complex_source.c
20	20
21	21	libgslmatrix_la_SOURCES = init.c matrix.c file.c rowcol.c swap.c copy.c minmax.c prop.c oper.c getset.c view.c submatrix.c view.h
22	22

+6

-2

matrix/Makefile.in less more

142	142	LIBOBJS = @LIBOBJS@
143	143	LIBS = @LIBS@
144	144	LIBTOOL = @LIBTOOL@
	145	LIPO = @LIPO@
145	146	LN_S = @LN_S@
146	147	LTLIBOBJS = @LTLIBOBJS@
147	148	MAINT = @MAINT@

149	150	MKDIR_P = @MKDIR_P@
150	151	NM = @NM@
151	152	NMEDIT = @NMEDIT@
	153	OBJDUMP = @OBJDUMP@
152	154	OBJEXT = @OBJEXT@
	155	OTOOL = @OTOOL@
	156	OTOOL64 = @OTOOL64@
153	157	PACKAGE = @PACKAGE@
154	158	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
155	159	PACKAGE_NAME = @PACKAGE_NAME@

214	218	top_srcdir = @top_srcdir@
215	219	noinst_LTLIBRARIES = libgslmatrix.la
216	220	pkginclude_HEADERS = gsl_matrix.h gsl_matrix_char.h gsl_matrix_complex_double.h gsl_matrix_complex_float.h gsl_matrix_complex_long_double.h gsl_matrix_double.h gsl_matrix_float.h gsl_matrix_int.h gsl_matrix_long.h gsl_matrix_long_double.h gsl_matrix_short.h gsl_matrix_uchar.h gsl_matrix_uint.h gsl_matrix_ulong.h gsl_matrix_ushort.h
217		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
	221	INCLUDES = -I$(top_srcdir)
218	222	TESTS = $(check_PROGRAMS)
219	223	test_LDADD = libgslmatrix.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
220	224	test_static_LDADD = libgslmatrix.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
221	225	test_SOURCES = test.c
222	226	test_static_SOURCES = test_static.c
223	227	CLEANFILES = test.txt test.dat
224		noinst_HEADERS = matrix_source.c init_source.c file_source.c rowcol_source.c swap_source.c copy_source.c test_complex_source.c test_source.c minmax_source.c prop_source.c oper_source.c getset_source.c view_source.c submatrix_source.c oper_complex_source.c
	228	noinst_HEADERS = init_source.c file_source.c rowcol_source.c swap_source.c copy_source.c test_complex_source.c test_source.c minmax_source.c prop_source.c oper_source.c getset_source.c view_source.c submatrix_source.c oper_complex_source.c
225	229	libgslmatrix_la_SOURCES = init.c matrix.c file.c rowcol.c swap.c copy.c minmax.c prop.c oper.c getset.c view.c submatrix.c view.h
226	230	all: all-am
227	231

+47

-34

matrix/gsl_matrix_char.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_char.h>
27	28

203	204
204	205	/* Operations */
205	206
206		char gsl_matrix_char_get(const gsl_matrix_char * m, const size_t i, const size_t j);
207		void gsl_matrix_char_set(gsl_matrix_char * m, const size_t i, const size_t j, const char x);
208
209		char * gsl_matrix_char_ptr(gsl_matrix_char * m, const size_t i, const size_t j);
210		const char * gsl_matrix_char_const_ptr(const gsl_matrix_char * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_char_set_zero (gsl_matrix_char * m);
213	208	void gsl_matrix_char_set_identity (gsl_matrix_char * m);
214	209	void gsl_matrix_char_set_all (gsl_matrix_char * m, char x);

255	250	int gsl_matrix_char_get_col(gsl_vector_char * v, const gsl_matrix_char * m, const size_t j);
256	251	int gsl_matrix_char_set_row(gsl_matrix_char * m, const size_t i, const gsl_vector_char * v);
257	252	int gsl_matrix_char_set_col(gsl_matrix_char * m, const size_t j, const gsl_vector_char * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL char gsl_matrix_char_get(const gsl_matrix_char * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_char_set(gsl_matrix_char * m, const size_t i, const size_t j, const char x);
	259	INLINE_DECL char * gsl_matrix_char_ptr(gsl_matrix_char * m, const size_t i, const size_t j);
	260	INLINE_DECL const char * gsl_matrix_char_const_ptr(const gsl_matrix_char * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	char
264	265	gsl_matrix_char_get(const gsl_matrix_char * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_char_set(gsl_matrix_char * m, const size_t i, const size_t j, const char x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	char *
298	305	gsl_matrix_char_ptr(gsl_matrix_char * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (char ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const char *
315	325	gsl_matrix_char_const_ptr(const gsl_matrix_char * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const char ) (m->data + (i m->tda + j)) ;

+52

-36

matrix/gsl_matrix_complex_double.h less more

204	204
205	205	/* Operations */
206	206
207		gsl_complex gsl_matrix_complex_get(const gsl_matrix_complex * m, const size_t i, const size_t j);
208		void gsl_matrix_complex_set(gsl_matrix_complex * m, const size_t i, const size_t j, const gsl_complex x);
209
210		gsl_complex * gsl_matrix_complex_ptr(gsl_matrix_complex * m, const size_t i, const size_t j);
211		const gsl_complex * gsl_matrix_complex_const_ptr(const gsl_matrix_complex * m, const size_t i, const size_t j);
212
213	207	void gsl_matrix_complex_set_zero (gsl_matrix_complex * m);
214	208	void gsl_matrix_complex_set_identity (gsl_matrix_complex * m);
215	209	void gsl_matrix_complex_set_all (gsl_matrix_complex * m, gsl_complex x);

232	226	int gsl_matrix_complex_isnull (const gsl_matrix_complex * m);
233	227	int gsl_matrix_complex_ispos (const gsl_matrix_complex * m);
234	228	int gsl_matrix_complex_isneg (const gsl_matrix_complex * m);
	229	int gsl_matrix_complex_isnonneg (const gsl_matrix_complex * m);
235	230
236	231	int gsl_matrix_complex_add (gsl_matrix_complex * a, const gsl_matrix_complex * b);
237	232	int gsl_matrix_complex_sub (gsl_matrix_complex * a, const gsl_matrix_complex * b);

248	243	int gsl_matrix_complex_get_col(gsl_vector_complex * v, const gsl_matrix_complex * m, const size_t j);
249	244	int gsl_matrix_complex_set_row(gsl_matrix_complex * m, const size_t i, const gsl_vector_complex * v);
250	245	int gsl_matrix_complex_set_col(gsl_matrix_complex * m, const size_t j, const gsl_vector_complex * v);
	246	/***********************************************************************/
	247
	248	/* inline functions if you are using GCC */
	249
	250	INLINE_DECL gsl_complex gsl_matrix_complex_get(const gsl_matrix_complex * m, const size_t i, const size_t j);
	251	INLINE_DECL void gsl_matrix_complex_set(gsl_matrix_complex * m, const size_t i, const size_t j, const gsl_complex x);
	252
	253	INLINE_DECL gsl_complex * gsl_matrix_complex_ptr(gsl_matrix_complex * m, const size_t i, const size_t j);
	254	INLINE_DECL const gsl_complex * gsl_matrix_complex_const_ptr(const gsl_matrix_complex * m, const size_t i, const size_t j);
251	255
252	256	#ifdef HAVE_INLINE
253	257
254		extern inline
	258	INLINE_FUN
255	259	gsl_complex
256	260	gsl_matrix_complex_get(const gsl_matrix_complex * m,
257	261	const size_t i, const size_t j)
258	262	{
259	263	#if GSL_RANGE_CHECK
260		gsl_complex zero = {{0,0}};
261
262		if (i >= m->size1)
	264	if (GSL_RANGE_COND(1))
263	265	{
264		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, zero) ;
265		}
266		else if (j >= m->size2)
267		{
268		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, zero) ;
	266	gsl_complex zero = {{0,0}};
	267
	268	if (i >= m->size1)
	269	{
	270	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, zero) ;
	271	}
	272	else if (j >= m->size2)
	273	{
	274	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, zero) ;
	275	}
269	276	}
270	277	#endif
271	278	return (gsl_complex )(m->data + 2(i m->tda + j)) ;
272	279	}
273	280
274		extern inline
	281	INLINE_FUN
275	282	void
276	283	gsl_matrix_complex_set(gsl_matrix_complex * m,
277	284	const size_t i, const size_t j, const gsl_complex x)
278	285	{
279	286	#if GSL_RANGE_CHECK
280		if (i >= m->size1)
	287	if (GSL_RANGE_COND(1))
281	288	{
282		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
283		}
284		else if (j >= m->size2)
285		{
286		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	289	if (i >= m->size1)
	290	{
	291	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	292	}
	293	else if (j >= m->size2)
	294	{
	295	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	296	}
287	297	}
288	298	#endif
289	299	(gsl_complex )(m->data + 2(i m->tda + j)) = x ;
290	300	}
291	301
292		extern inline
	302	INLINE_FUN
293	303	gsl_complex *
294	304	gsl_matrix_complex_ptr(gsl_matrix_complex * m,
295	305	const size_t i, const size_t j)
296	306	{
297	307	#if GSL_RANGE_CHECK
298		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
299	309	{
300		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
301		}
302		else if (j >= m->size2)
303		{
304		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
305	318	}
306	319	#endif
307	320	return (gsl_complex )(m->data + 2(i * m->tda + j)) ;
308	321	}
309	322
310		extern inline
	323	INLINE_FUN
311	324	const gsl_complex *
312	325	gsl_matrix_complex_const_ptr(const gsl_matrix_complex * m,
313	326	const size_t i, const size_t j)
314	327	{
315	328	#if GSL_RANGE_CHECK
316		if (i >= m->size1)
	329	if (GSL_RANGE_COND(1))
317	330	{
318		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
319		}
320		else if (j >= m->size2)
321		{
322		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	331	if (i >= m->size1)
	332	{
	333	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	334	}
	335	else if (j >= m->size2)
	336	{
	337	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	338	}
323	339	}
324	340	#endif
325	341	return (const gsl_complex )(m->data + 2(i * m->tda + j)) ;

+52

-36

matrix/gsl_matrix_complex_float.h less more

204	204
205	205	/* Operations */
206	206
207		gsl_complex_float gsl_matrix_complex_float_get(const gsl_matrix_complex_float * m, const size_t i, const size_t j);
208		void gsl_matrix_complex_float_set(gsl_matrix_complex_float * m, const size_t i, const size_t j, const gsl_complex_float x);
209
210		gsl_complex_float * gsl_matrix_complex_float_ptr(gsl_matrix_complex_float * m, const size_t i, const size_t j);
211		const gsl_complex_float * gsl_matrix_complex_float_const_ptr(const gsl_matrix_complex_float * m, const size_t i, const size_t j);
212
213	207	void gsl_matrix_complex_float_set_zero (gsl_matrix_complex_float * m);
214	208	void gsl_matrix_complex_float_set_identity (gsl_matrix_complex_float * m);
215	209	void gsl_matrix_complex_float_set_all (gsl_matrix_complex_float * m, gsl_complex_float x);

232	226	int gsl_matrix_complex_float_isnull (const gsl_matrix_complex_float * m);
233	227	int gsl_matrix_complex_float_ispos (const gsl_matrix_complex_float * m);
234	228	int gsl_matrix_complex_float_isneg (const gsl_matrix_complex_float * m);
	229	int gsl_matrix_complex_float_isnonneg (const gsl_matrix_complex_float * m);
235	230
236	231	int gsl_matrix_complex_float_add (gsl_matrix_complex_float * a, const gsl_matrix_complex_float * b);
237	232	int gsl_matrix_complex_float_sub (gsl_matrix_complex_float * a, const gsl_matrix_complex_float * b);

248	243	int gsl_matrix_complex_float_get_col(gsl_vector_complex_float * v, const gsl_matrix_complex_float * m, const size_t j);
249	244	int gsl_matrix_complex_float_set_row(gsl_matrix_complex_float * m, const size_t i, const gsl_vector_complex_float * v);
250	245	int gsl_matrix_complex_float_set_col(gsl_matrix_complex_float * m, const size_t j, const gsl_vector_complex_float * v);
	246	/***********************************************************************/
	247
	248	/* inline functions if you are using GCC */
	249
	250	INLINE_DECL gsl_complex_float gsl_matrix_complex_float_get(const gsl_matrix_complex_float * m, const size_t i, const size_t j);
	251	INLINE_DECL void gsl_matrix_complex_float_set(gsl_matrix_complex_float * m, const size_t i, const size_t j, const gsl_complex_float x);
	252
	253	INLINE_DECL gsl_complex_float * gsl_matrix_complex_float_ptr(gsl_matrix_complex_float * m, const size_t i, const size_t j);
	254	INLINE_DECL const gsl_complex_float * gsl_matrix_complex_float_const_ptr(const gsl_matrix_complex_float * m, const size_t i, const size_t j);
251	255
252	256	#ifdef HAVE_INLINE
253	257
254		extern inline
	258	INLINE_FUN
255	259	gsl_complex_float
256	260	gsl_matrix_complex_float_get(const gsl_matrix_complex_float * m,
257	261	const size_t i, const size_t j)
258	262	{
259	263	#if GSL_RANGE_CHECK
260		gsl_complex_float zero = {{0,0}};
261
262		if (i >= m->size1)
	264	if (GSL_RANGE_COND(1))
263	265	{
264		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, zero) ;
265		}
266		else if (j >= m->size2)
267		{
268		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, zero) ;
	266	gsl_complex_float zero = {{0,0}};
	267
	268	if (i >= m->size1)
	269	{
	270	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, zero) ;
	271	}
	272	else if (j >= m->size2)
	273	{
	274	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, zero) ;
	275	}
269	276	}
270	277	#endif
271	278	return (gsl_complex_float )(m->data + 2(i m->tda + j)) ;
272	279	}
273	280
274		extern inline
	281	INLINE_FUN
275	282	void
276	283	gsl_matrix_complex_float_set(gsl_matrix_complex_float * m,
277	284	const size_t i, const size_t j, const gsl_complex_float x)
278	285	{
279	286	#if GSL_RANGE_CHECK
280		if (i >= m->size1)
	287	if (GSL_RANGE_COND(1))
281	288	{
282		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
283		}
284		else if (j >= m->size2)
285		{
286		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	289	if (i >= m->size1)
	290	{
	291	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	292	}
	293	else if (j >= m->size2)
	294	{
	295	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	296	}
287	297	}
288	298	#endif
289	299	(gsl_complex_float )(m->data + 2(i m->tda + j)) = x ;
290	300	}
291	301
292		extern inline
	302	INLINE_FUN
293	303	gsl_complex_float *
294	304	gsl_matrix_complex_float_ptr(gsl_matrix_complex_float * m,
295	305	const size_t i, const size_t j)
296	306	{
297	307	#if GSL_RANGE_CHECK
298		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
299	309	{
300		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
301		}
302		else if (j >= m->size2)
303		{
304		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
305	318	}
306	319	#endif
307	320	return (gsl_complex_float )(m->data + 2(i * m->tda + j)) ;
308	321	}
309	322
310		extern inline
	323	INLINE_FUN
311	324	const gsl_complex_float *
312	325	gsl_matrix_complex_float_const_ptr(const gsl_matrix_complex_float * m,
313	326	const size_t i, const size_t j)
314	327	{
315	328	#if GSL_RANGE_CHECK
316		if (i >= m->size1)
	329	if (GSL_RANGE_COND(1))
317	330	{
318		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
319		}
320		else if (j >= m->size2)
321		{
322		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	331	if (i >= m->size1)
	332	{
	333	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	334	}
	335	else if (j >= m->size2)
	336	{
	337	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	338	}
323	339	}
324	340	#endif
325	341	return (const gsl_complex_float )(m->data + 2(i * m->tda + j)) ;

+52

-36

matrix/gsl_matrix_complex_long_double.h less more

204	204
205	205	/* Operations */
206	206
207		gsl_complex_long_double gsl_matrix_complex_long_double_get(const gsl_matrix_complex_long_double * m, const size_t i, const size_t j);
208		void gsl_matrix_complex_long_double_set(gsl_matrix_complex_long_double * m, const size_t i, const size_t j, const gsl_complex_long_double x);
209
210		gsl_complex_long_double * gsl_matrix_complex_long_double_ptr(gsl_matrix_complex_long_double * m, const size_t i, const size_t j);
211		const gsl_complex_long_double * gsl_matrix_complex_long_double_const_ptr(const gsl_matrix_complex_long_double * m, const size_t i, const size_t j);
212
213	207	void gsl_matrix_complex_long_double_set_zero (gsl_matrix_complex_long_double * m);
214	208	void gsl_matrix_complex_long_double_set_identity (gsl_matrix_complex_long_double * m);
215	209	void gsl_matrix_complex_long_double_set_all (gsl_matrix_complex_long_double * m, gsl_complex_long_double x);

232	226	int gsl_matrix_complex_long_double_isnull (const gsl_matrix_complex_long_double * m);
233	227	int gsl_matrix_complex_long_double_ispos (const gsl_matrix_complex_long_double * m);
234	228	int gsl_matrix_complex_long_double_isneg (const gsl_matrix_complex_long_double * m);
	229	int gsl_matrix_complex_long_double_isnonneg (const gsl_matrix_complex_long_double * m);
235	230
236	231	int gsl_matrix_complex_long_double_add (gsl_matrix_complex_long_double * a, const gsl_matrix_complex_long_double * b);
237	232	int gsl_matrix_complex_long_double_sub (gsl_matrix_complex_long_double * a, const gsl_matrix_complex_long_double * b);

248	243	int gsl_matrix_complex_long_double_get_col(gsl_vector_complex_long_double * v, const gsl_matrix_complex_long_double * m, const size_t j);
249	244	int gsl_matrix_complex_long_double_set_row(gsl_matrix_complex_long_double * m, const size_t i, const gsl_vector_complex_long_double * v);
250	245	int gsl_matrix_complex_long_double_set_col(gsl_matrix_complex_long_double * m, const size_t j, const gsl_vector_complex_long_double * v);
	246	/***********************************************************************/
	247
	248	/* inline functions if you are using GCC */
	249
	250	INLINE_DECL gsl_complex_long_double gsl_matrix_complex_long_double_get(const gsl_matrix_complex_long_double * m, const size_t i, const size_t j);
	251	INLINE_DECL void gsl_matrix_complex_long_double_set(gsl_matrix_complex_long_double * m, const size_t i, const size_t j, const gsl_complex_long_double x);
	252
	253	INLINE_DECL gsl_complex_long_double * gsl_matrix_complex_long_double_ptr(gsl_matrix_complex_long_double * m, const size_t i, const size_t j);
	254	INLINE_DECL const gsl_complex_long_double * gsl_matrix_complex_long_double_const_ptr(const gsl_matrix_complex_long_double * m, const size_t i, const size_t j);
251	255
252	256	#ifdef HAVE_INLINE
253	257
254		extern inline
	258	INLINE_FUN
255	259	gsl_complex_long_double
256	260	gsl_matrix_complex_long_double_get(const gsl_matrix_complex_long_double * m,
257	261	const size_t i, const size_t j)
258	262	{
259	263	#if GSL_RANGE_CHECK
260		gsl_complex_long_double zero = {{0,0}};
261
262		if (i >= m->size1)
	264	if (GSL_RANGE_COND(1))
263	265	{
264		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, zero) ;
265		}
266		else if (j >= m->size2)
267		{
268		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, zero) ;
	266	gsl_complex_long_double zero = {{0,0}};
	267
	268	if (i >= m->size1)
	269	{
	270	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, zero) ;
	271	}
	272	else if (j >= m->size2)
	273	{
	274	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, zero) ;
	275	}
269	276	}
270	277	#endif
271	278	return (gsl_complex_long_double )(m->data + 2(i m->tda + j)) ;
272	279	}
273	280
274		extern inline
	281	INLINE_FUN
275	282	void
276	283	gsl_matrix_complex_long_double_set(gsl_matrix_complex_long_double * m,
277	284	const size_t i, const size_t j, const gsl_complex_long_double x)
278	285	{
279	286	#if GSL_RANGE_CHECK
280		if (i >= m->size1)
	287	if (GSL_RANGE_COND(1))
281	288	{
282		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
283		}
284		else if (j >= m->size2)
285		{
286		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	289	if (i >= m->size1)
	290	{
	291	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	292	}
	293	else if (j >= m->size2)
	294	{
	295	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	296	}
287	297	}
288	298	#endif
289	299	(gsl_complex_long_double )(m->data + 2(i m->tda + j)) = x ;
290	300	}
291	301
292		extern inline
	302	INLINE_FUN
293	303	gsl_complex_long_double *
294	304	gsl_matrix_complex_long_double_ptr(gsl_matrix_complex_long_double * m,
295	305	const size_t i, const size_t j)
296	306	{
297	307	#if GSL_RANGE_CHECK
298		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
299	309	{
300		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
301		}
302		else if (j >= m->size2)
303		{
304		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
305	318	}
306	319	#endif
307	320	return (gsl_complex_long_double )(m->data + 2(i * m->tda + j)) ;
308	321	}
309	322
310		extern inline
	323	INLINE_FUN
311	324	const gsl_complex_long_double *
312	325	gsl_matrix_complex_long_double_const_ptr(const gsl_matrix_complex_long_double * m,
313	326	const size_t i, const size_t j)
314	327	{
315	328	#if GSL_RANGE_CHECK
316		if (i >= m->size1)
	329	if (GSL_RANGE_COND(1))
317	330	{
318		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
319		}
320		else if (j >= m->size2)
321		{
322		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	331	if (i >= m->size1)
	332	{
	333	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	334	}
	335	else if (j >= m->size2)
	336	{
	337	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	338	}
323	339	}
324	340	#endif
325	341	return (const gsl_complex_long_double )(m->data + 2(i * m->tda + j)) ;

+47

-34

matrix/gsl_matrix_double.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_double.h>
27	28

203	204
204	205	/* Operations */
205	206
206		double gsl_matrix_get(const gsl_matrix * m, const size_t i, const size_t j);
207		void gsl_matrix_set(gsl_matrix * m, const size_t i, const size_t j, const double x);
208
209		double * gsl_matrix_ptr(gsl_matrix * m, const size_t i, const size_t j);
210		const double * gsl_matrix_const_ptr(const gsl_matrix * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_set_zero (gsl_matrix * m);
213	208	void gsl_matrix_set_identity (gsl_matrix * m);
214	209	void gsl_matrix_set_all (gsl_matrix * m, double x);

255	250	int gsl_matrix_get_col(gsl_vector * v, const gsl_matrix * m, const size_t j);
256	251	int gsl_matrix_set_row(gsl_matrix * m, const size_t i, const gsl_vector * v);
257	252	int gsl_matrix_set_col(gsl_matrix * m, const size_t j, const gsl_vector * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL double gsl_matrix_get(const gsl_matrix * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_set(gsl_matrix * m, const size_t i, const size_t j, const double x);
	259	INLINE_DECL double * gsl_matrix_ptr(gsl_matrix * m, const size_t i, const size_t j);
	260	INLINE_DECL const double * gsl_matrix_const_ptr(const gsl_matrix * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	double
264	265	gsl_matrix_get(const gsl_matrix * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_set(gsl_matrix * m, const size_t i, const size_t j, const double x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	double *
298	305	gsl_matrix_ptr(gsl_matrix * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (double ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const double *
315	325	gsl_matrix_const_ptr(const gsl_matrix * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const double ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_float.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_float.h>
27	28

203	204
204	205	/* Operations */
205	206
206		float gsl_matrix_float_get(const gsl_matrix_float * m, const size_t i, const size_t j);
207		void gsl_matrix_float_set(gsl_matrix_float * m, const size_t i, const size_t j, const float x);
208
209		float * gsl_matrix_float_ptr(gsl_matrix_float * m, const size_t i, const size_t j);
210		const float * gsl_matrix_float_const_ptr(const gsl_matrix_float * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_float_set_zero (gsl_matrix_float * m);
213	208	void gsl_matrix_float_set_identity (gsl_matrix_float * m);
214	209	void gsl_matrix_float_set_all (gsl_matrix_float * m, float x);

255	250	int gsl_matrix_float_get_col(gsl_vector_float * v, const gsl_matrix_float * m, const size_t j);
256	251	int gsl_matrix_float_set_row(gsl_matrix_float * m, const size_t i, const gsl_vector_float * v);
257	252	int gsl_matrix_float_set_col(gsl_matrix_float * m, const size_t j, const gsl_vector_float * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL float gsl_matrix_float_get(const gsl_matrix_float * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_float_set(gsl_matrix_float * m, const size_t i, const size_t j, const float x);
	259	INLINE_DECL float * gsl_matrix_float_ptr(gsl_matrix_float * m, const size_t i, const size_t j);
	260	INLINE_DECL const float * gsl_matrix_float_const_ptr(const gsl_matrix_float * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	float
264	265	gsl_matrix_float_get(const gsl_matrix_float * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_float_set(gsl_matrix_float * m, const size_t i, const size_t j, const float x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	float *
298	305	gsl_matrix_float_ptr(gsl_matrix_float * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (float ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const float *
315	325	gsl_matrix_float_const_ptr(const gsl_matrix_float * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const float ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_int.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_int.h>
27	28

203	204
204	205	/* Operations */
205	206
206		int gsl_matrix_int_get(const gsl_matrix_int * m, const size_t i, const size_t j);
207		void gsl_matrix_int_set(gsl_matrix_int * m, const size_t i, const size_t j, const int x);
208
209		int * gsl_matrix_int_ptr(gsl_matrix_int * m, const size_t i, const size_t j);
210		const int * gsl_matrix_int_const_ptr(const gsl_matrix_int * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_int_set_zero (gsl_matrix_int * m);
213	208	void gsl_matrix_int_set_identity (gsl_matrix_int * m);
214	209	void gsl_matrix_int_set_all (gsl_matrix_int * m, int x);

255	250	int gsl_matrix_int_get_col(gsl_vector_int * v, const gsl_matrix_int * m, const size_t j);
256	251	int gsl_matrix_int_set_row(gsl_matrix_int * m, const size_t i, const gsl_vector_int * v);
257	252	int gsl_matrix_int_set_col(gsl_matrix_int * m, const size_t j, const gsl_vector_int * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL int gsl_matrix_int_get(const gsl_matrix_int * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_int_set(gsl_matrix_int * m, const size_t i, const size_t j, const int x);
	259	INLINE_DECL int * gsl_matrix_int_ptr(gsl_matrix_int * m, const size_t i, const size_t j);
	260	INLINE_DECL const int * gsl_matrix_int_const_ptr(const gsl_matrix_int * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	int
264	265	gsl_matrix_int_get(const gsl_matrix_int * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_int_set(gsl_matrix_int * m, const size_t i, const size_t j, const int x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	int *
298	305	gsl_matrix_int_ptr(gsl_matrix_int * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (int ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const int *
315	325	gsl_matrix_int_const_ptr(const gsl_matrix_int * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const int ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_long.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_long.h>
27	28

203	204
204	205	/* Operations */
205	206
206		long gsl_matrix_long_get(const gsl_matrix_long * m, const size_t i, const size_t j);
207		void gsl_matrix_long_set(gsl_matrix_long * m, const size_t i, const size_t j, const long x);
208
209		long * gsl_matrix_long_ptr(gsl_matrix_long * m, const size_t i, const size_t j);
210		const long * gsl_matrix_long_const_ptr(const gsl_matrix_long * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_long_set_zero (gsl_matrix_long * m);
213	208	void gsl_matrix_long_set_identity (gsl_matrix_long * m);
214	209	void gsl_matrix_long_set_all (gsl_matrix_long * m, long x);

255	250	int gsl_matrix_long_get_col(gsl_vector_long * v, const gsl_matrix_long * m, const size_t j);
256	251	int gsl_matrix_long_set_row(gsl_matrix_long * m, const size_t i, const gsl_vector_long * v);
257	252	int gsl_matrix_long_set_col(gsl_matrix_long * m, const size_t j, const gsl_vector_long * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL long gsl_matrix_long_get(const gsl_matrix_long * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_long_set(gsl_matrix_long * m, const size_t i, const size_t j, const long x);
	259	INLINE_DECL long * gsl_matrix_long_ptr(gsl_matrix_long * m, const size_t i, const size_t j);
	260	INLINE_DECL const long * gsl_matrix_long_const_ptr(const gsl_matrix_long * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	long
264	265	gsl_matrix_long_get(const gsl_matrix_long * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_long_set(gsl_matrix_long * m, const size_t i, const size_t j, const long x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	long *
298	305	gsl_matrix_long_ptr(gsl_matrix_long * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (long ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const long *
315	325	gsl_matrix_long_const_ptr(const gsl_matrix_long * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const long ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_long_double.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_long_double.h>
27	28

203	204
204	205	/* Operations */
205	206
206		long double gsl_matrix_long_double_get(const gsl_matrix_long_double * m, const size_t i, const size_t j);
207		void gsl_matrix_long_double_set(gsl_matrix_long_double * m, const size_t i, const size_t j, const long double x);
208
209		long double * gsl_matrix_long_double_ptr(gsl_matrix_long_double * m, const size_t i, const size_t j);
210		const long double * gsl_matrix_long_double_const_ptr(const gsl_matrix_long_double * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_long_double_set_zero (gsl_matrix_long_double * m);
213	208	void gsl_matrix_long_double_set_identity (gsl_matrix_long_double * m);
214	209	void gsl_matrix_long_double_set_all (gsl_matrix_long_double * m, long double x);

255	250	int gsl_matrix_long_double_get_col(gsl_vector_long_double * v, const gsl_matrix_long_double * m, const size_t j);
256	251	int gsl_matrix_long_double_set_row(gsl_matrix_long_double * m, const size_t i, const gsl_vector_long_double * v);
257	252	int gsl_matrix_long_double_set_col(gsl_matrix_long_double * m, const size_t j, const gsl_vector_long_double * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL long double gsl_matrix_long_double_get(const gsl_matrix_long_double * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_long_double_set(gsl_matrix_long_double * m, const size_t i, const size_t j, const long double x);
	259	INLINE_DECL long double * gsl_matrix_long_double_ptr(gsl_matrix_long_double * m, const size_t i, const size_t j);
	260	INLINE_DECL const long double * gsl_matrix_long_double_const_ptr(const gsl_matrix_long_double * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	long double
264	265	gsl_matrix_long_double_get(const gsl_matrix_long_double * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_long_double_set(gsl_matrix_long_double * m, const size_t i, const size_t j, const long double x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	long double *
298	305	gsl_matrix_long_double_ptr(gsl_matrix_long_double * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (long double ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const long double *
315	325	gsl_matrix_long_double_const_ptr(const gsl_matrix_long_double * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const long double ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_short.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_short.h>
27	28

203	204
204	205	/* Operations */
205	206
206		short gsl_matrix_short_get(const gsl_matrix_short * m, const size_t i, const size_t j);
207		void gsl_matrix_short_set(gsl_matrix_short * m, const size_t i, const size_t j, const short x);
208
209		short * gsl_matrix_short_ptr(gsl_matrix_short * m, const size_t i, const size_t j);
210		const short * gsl_matrix_short_const_ptr(const gsl_matrix_short * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_short_set_zero (gsl_matrix_short * m);
213	208	void gsl_matrix_short_set_identity (gsl_matrix_short * m);
214	209	void gsl_matrix_short_set_all (gsl_matrix_short * m, short x);

255	250	int gsl_matrix_short_get_col(gsl_vector_short * v, const gsl_matrix_short * m, const size_t j);
256	251	int gsl_matrix_short_set_row(gsl_matrix_short * m, const size_t i, const gsl_vector_short * v);
257	252	int gsl_matrix_short_set_col(gsl_matrix_short * m, const size_t j, const gsl_vector_short * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL short gsl_matrix_short_get(const gsl_matrix_short * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_short_set(gsl_matrix_short * m, const size_t i, const size_t j, const short x);
	259	INLINE_DECL short * gsl_matrix_short_ptr(gsl_matrix_short * m, const size_t i, const size_t j);
	260	INLINE_DECL const short * gsl_matrix_short_const_ptr(const gsl_matrix_short * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	short
264	265	gsl_matrix_short_get(const gsl_matrix_short * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_short_set(gsl_matrix_short * m, const size_t i, const size_t j, const short x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	short *
298	305	gsl_matrix_short_ptr(gsl_matrix_short * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (short ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const short *
315	325	gsl_matrix_short_const_ptr(const gsl_matrix_short * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const short ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_uchar.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_uchar.h>
27	28

203	204
204	205	/* Operations */
205	206
206		unsigned char gsl_matrix_uchar_get(const gsl_matrix_uchar * m, const size_t i, const size_t j);
207		void gsl_matrix_uchar_set(gsl_matrix_uchar * m, const size_t i, const size_t j, const unsigned char x);
208
209		unsigned char * gsl_matrix_uchar_ptr(gsl_matrix_uchar * m, const size_t i, const size_t j);
210		const unsigned char * gsl_matrix_uchar_const_ptr(const gsl_matrix_uchar * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_uchar_set_zero (gsl_matrix_uchar * m);
213	208	void gsl_matrix_uchar_set_identity (gsl_matrix_uchar * m);
214	209	void gsl_matrix_uchar_set_all (gsl_matrix_uchar * m, unsigned char x);

255	250	int gsl_matrix_uchar_get_col(gsl_vector_uchar * v, const gsl_matrix_uchar * m, const size_t j);
256	251	int gsl_matrix_uchar_set_row(gsl_matrix_uchar * m, const size_t i, const gsl_vector_uchar * v);
257	252	int gsl_matrix_uchar_set_col(gsl_matrix_uchar * m, const size_t j, const gsl_vector_uchar * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL unsigned char gsl_matrix_uchar_get(const gsl_matrix_uchar * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_uchar_set(gsl_matrix_uchar * m, const size_t i, const size_t j, const unsigned char x);
	259	INLINE_DECL unsigned char * gsl_matrix_uchar_ptr(gsl_matrix_uchar * m, const size_t i, const size_t j);
	260	INLINE_DECL const unsigned char * gsl_matrix_uchar_const_ptr(const gsl_matrix_uchar * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	unsigned char
264	265	gsl_matrix_uchar_get(const gsl_matrix_uchar * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_uchar_set(gsl_matrix_uchar * m, const size_t i, const size_t j, const unsigned char x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	unsigned char *
298	305	gsl_matrix_uchar_ptr(gsl_matrix_uchar * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (unsigned char ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const unsigned char *
315	325	gsl_matrix_uchar_const_ptr(const gsl_matrix_uchar * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const unsigned char ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_uint.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_uint.h>
27	28

203	204
204	205	/* Operations */
205	206
206		unsigned int gsl_matrix_uint_get(const gsl_matrix_uint * m, const size_t i, const size_t j);
207		void gsl_matrix_uint_set(gsl_matrix_uint * m, const size_t i, const size_t j, const unsigned int x);
208
209		unsigned int * gsl_matrix_uint_ptr(gsl_matrix_uint * m, const size_t i, const size_t j);
210		const unsigned int * gsl_matrix_uint_const_ptr(const gsl_matrix_uint * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_uint_set_zero (gsl_matrix_uint * m);
213	208	void gsl_matrix_uint_set_identity (gsl_matrix_uint * m);
214	209	void gsl_matrix_uint_set_all (gsl_matrix_uint * m, unsigned int x);

255	250	int gsl_matrix_uint_get_col(gsl_vector_uint * v, const gsl_matrix_uint * m, const size_t j);
256	251	int gsl_matrix_uint_set_row(gsl_matrix_uint * m, const size_t i, const gsl_vector_uint * v);
257	252	int gsl_matrix_uint_set_col(gsl_matrix_uint * m, const size_t j, const gsl_vector_uint * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL unsigned int gsl_matrix_uint_get(const gsl_matrix_uint * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_uint_set(gsl_matrix_uint * m, const size_t i, const size_t j, const unsigned int x);
	259	INLINE_DECL unsigned int * gsl_matrix_uint_ptr(gsl_matrix_uint * m, const size_t i, const size_t j);
	260	INLINE_DECL const unsigned int * gsl_matrix_uint_const_ptr(const gsl_matrix_uint * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	unsigned int
264	265	gsl_matrix_uint_get(const gsl_matrix_uint * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_uint_set(gsl_matrix_uint * m, const size_t i, const size_t j, const unsigned int x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	unsigned int *
298	305	gsl_matrix_uint_ptr(gsl_matrix_uint * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (unsigned int ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const unsigned int *
315	325	gsl_matrix_uint_const_ptr(const gsl_matrix_uint * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const unsigned int ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_ulong.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_ulong.h>
27	28

203	204
204	205	/* Operations */
205	206
206		unsigned long gsl_matrix_ulong_get(const gsl_matrix_ulong * m, const size_t i, const size_t j);
207		void gsl_matrix_ulong_set(gsl_matrix_ulong * m, const size_t i, const size_t j, const unsigned long x);
208
209		unsigned long * gsl_matrix_ulong_ptr(gsl_matrix_ulong * m, const size_t i, const size_t j);
210		const unsigned long * gsl_matrix_ulong_const_ptr(const gsl_matrix_ulong * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_ulong_set_zero (gsl_matrix_ulong * m);
213	208	void gsl_matrix_ulong_set_identity (gsl_matrix_ulong * m);
214	209	void gsl_matrix_ulong_set_all (gsl_matrix_ulong * m, unsigned long x);

255	250	int gsl_matrix_ulong_get_col(gsl_vector_ulong * v, const gsl_matrix_ulong * m, const size_t j);
256	251	int gsl_matrix_ulong_set_row(gsl_matrix_ulong * m, const size_t i, const gsl_vector_ulong * v);
257	252	int gsl_matrix_ulong_set_col(gsl_matrix_ulong * m, const size_t j, const gsl_vector_ulong * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL unsigned long gsl_matrix_ulong_get(const gsl_matrix_ulong * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_ulong_set(gsl_matrix_ulong * m, const size_t i, const size_t j, const unsigned long x);
	259	INLINE_DECL unsigned long * gsl_matrix_ulong_ptr(gsl_matrix_ulong * m, const size_t i, const size_t j);
	260	INLINE_DECL const unsigned long * gsl_matrix_ulong_const_ptr(const gsl_matrix_ulong * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	unsigned long
264	265	gsl_matrix_ulong_get(const gsl_matrix_ulong * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_ulong_set(gsl_matrix_ulong * m, const size_t i, const size_t j, const unsigned long x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	unsigned long *
298	305	gsl_matrix_ulong_ptr(gsl_matrix_ulong * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (unsigned long ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const unsigned long *
315	325	gsl_matrix_ulong_const_ptr(const gsl_matrix_ulong * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const unsigned long ) (m->data + (i m->tda + j)) ;

+47

-34

matrix/gsl_matrix_ushort.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_vector_ushort.h>
27	28

203	204
204	205	/* Operations */
205	206
206		unsigned short gsl_matrix_ushort_get(const gsl_matrix_ushort * m, const size_t i, const size_t j);
207		void gsl_matrix_ushort_set(gsl_matrix_ushort * m, const size_t i, const size_t j, const unsigned short x);
208
209		unsigned short * gsl_matrix_ushort_ptr(gsl_matrix_ushort * m, const size_t i, const size_t j);
210		const unsigned short * gsl_matrix_ushort_const_ptr(const gsl_matrix_ushort * m, const size_t i, const size_t j);
211
212	207	void gsl_matrix_ushort_set_zero (gsl_matrix_ushort * m);
213	208	void gsl_matrix_ushort_set_identity (gsl_matrix_ushort * m);
214	209	void gsl_matrix_ushort_set_all (gsl_matrix_ushort * m, unsigned short x);

255	250	int gsl_matrix_ushort_get_col(gsl_vector_ushort * v, const gsl_matrix_ushort * m, const size_t j);
256	251	int gsl_matrix_ushort_set_row(gsl_matrix_ushort * m, const size_t i, const gsl_vector_ushort * v);
257	252	int gsl_matrix_ushort_set_col(gsl_matrix_ushort * m, const size_t j, const gsl_vector_ushort * v);
	253	/***********************************************************************/
258	254
259	255	/* inline functions if you are using GCC */
260	256
	257	INLINE_DECL unsigned short gsl_matrix_ushort_get(const gsl_matrix_ushort * m, const size_t i, const size_t j);
	258	INLINE_DECL void gsl_matrix_ushort_set(gsl_matrix_ushort * m, const size_t i, const size_t j, const unsigned short x);
	259	INLINE_DECL unsigned short * gsl_matrix_ushort_ptr(gsl_matrix_ushort * m, const size_t i, const size_t j);
	260	INLINE_DECL const unsigned short * gsl_matrix_ushort_const_ptr(const gsl_matrix_ushort * m, const size_t i, const size_t j);
	261
261	262	#ifdef HAVE_INLINE
262		extern inline
	263	INLINE_FUN
263	264	unsigned short
264	265	gsl_matrix_ushort_get(const gsl_matrix_ushort * m, const size_t i, const size_t j)
265	266	{
266	267	#if GSL_RANGE_CHECK
267		if (i >= m->size1)
	268	if (GSL_RANGE_COND(1))
268	269	{
269		GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
270		}
271		else if (j >= m->size2)
272		{
273		GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	270	if (i >= m->size1)
	271	{
	272	GSL_ERROR_VAL("first index out of range", GSL_EINVAL, 0) ;
	273	}
	274	else if (j >= m->size2)
	275	{
	276	GSL_ERROR_VAL("second index out of range", GSL_EINVAL, 0) ;
	277	}
274	278	}
275	279	#endif
276	280	return m->data[i * m->tda + j] ;
277	281	}
278	282
279		extern inline
	283	INLINE_FUN
280	284	void
281	285	gsl_matrix_ushort_set(gsl_matrix_ushort * m, const size_t i, const size_t j, const unsigned short x)
282	286	{
283	287	#if GSL_RANGE_CHECK
284		if (i >= m->size1)
	288	if (GSL_RANGE_COND(1))
285	289	{
286		GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
287		}
288		else if (j >= m->size2)
289		{
290		GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	290	if (i >= m->size1)
	291	{
	292	GSL_ERROR_VOID("first index out of range", GSL_EINVAL) ;
	293	}
	294	else if (j >= m->size2)
	295	{
	296	GSL_ERROR_VOID("second index out of range", GSL_EINVAL) ;
	297	}
291	298	}
292	299	#endif
293	300	m->data[i * m->tda + j] = x ;
294	301	}
295	302
296		extern inline
	303	INLINE_FUN
297	304	unsigned short *
298	305	gsl_matrix_ushort_ptr(gsl_matrix_ushort * m, const size_t i, const size_t j)
299	306	{
300	307	#if GSL_RANGE_CHECK
301		if (i >= m->size1)
	308	if (GSL_RANGE_COND(1))
302	309	{
303		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
304		}
305		else if (j >= m->size2)
306		{
307		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	310	if (i >= m->size1)
	311	{
	312	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	313	}
	314	else if (j >= m->size2)
	315	{
	316	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	317	}
308	318	}
309	319	#endif
310	320	return (unsigned short ) (m->data + (i m->tda + j)) ;
311	321	}
312	322
313		extern inline
	323	INLINE_FUN
314	324	const unsigned short *
315	325	gsl_matrix_ushort_const_ptr(const gsl_matrix_ushort * m, const size_t i, const size_t j)
316	326	{
317	327	#if GSL_RANGE_CHECK
318		if (i >= m->size1)
	328	if (GSL_RANGE_COND(1))
319	329	{
320		GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
321		}
322		else if (j >= m->size2)
323		{
324		GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	330	if (i >= m->size1)
	331	{
	332	GSL_ERROR_NULL("first index out of range", GSL_EINVAL) ;
	333	}
	334	else if (j >= m->size2)
	335	{
	336	GSL_ERROR_NULL("second index out of range", GSL_EINVAL) ;
	337	}
325	338	}
326	339	#endif
327	340	return (const unsigned short ) (m->data + (i m->tda + j)) ;

+6

-83

matrix/matrix.c less more

0	0	#include <config.h>
1	1	#include <gsl/gsl_errno.h>
	2	#include <gsl/gsl_vector.h>
	3
	4	/* Compile all the inline matrix functions */
	5
	6	#define COMPILE_INLINE_STATIC
	7	#include "build.h"
2	8	#include <gsl/gsl_matrix.h>
3	9
4		#define BASE_GSL_COMPLEX_LONG
5		#include "templates_on.h"
6		#include "matrix_source.c"
7		#include "templates_off.h"
8		#undef BASE_GSL_COMPLEX_LONG
9
10		#define BASE_GSL_COMPLEX
11		#include "templates_on.h"
12		#include "matrix_source.c"
13		#include "templates_off.h"
14		#undef BASE_GSL_COMPLEX
15
16		#define BASE_GSL_COMPLEX_FLOAT
17		#include "templates_on.h"
18		#include "matrix_source.c"
19		#include "templates_off.h"
20		#undef BASE_GSL_COMPLEX_FLOAT
21
22		#define BASE_LONG_DOUBLE
23		#include "templates_on.h"
24		#include "matrix_source.c"
25		#include "templates_off.h"
26		#undef BASE_LONG_DOUBLE
27
28		#define BASE_DOUBLE
29		#include "templates_on.h"
30		#include "matrix_source.c"
31		#include "templates_off.h"
32		#undef BASE_DOUBLE
33
34		#define BASE_FLOAT
35		#include "templates_on.h"
36		#include "matrix_source.c"
37		#include "templates_off.h"
38		#undef BASE_FLOAT
39
40		#define BASE_ULONG
41		#include "templates_on.h"
42		#include "matrix_source.c"
43		#include "templates_off.h"
44		#undef BASE_ULONG
45
46		#define BASE_LONG
47		#include "templates_on.h"
48		#include "matrix_source.c"
49		#include "templates_off.h"
50		#undef BASE_LONG
51
52		#define BASE_UINT
53		#include "templates_on.h"
54		#include "matrix_source.c"
55		#include "templates_off.h"
56		#undef BASE_UINT
57
58		#define BASE_INT
59		#include "templates_on.h"
60		#include "matrix_source.c"
61		#include "templates_off.h"
62		#undef BASE_INT
63
64		#define BASE_USHORT
65		#include "templates_on.h"
66		#include "matrix_source.c"
67		#include "templates_off.h"
68		#undef BASE_USHORT
69
70		#define BASE_SHORT
71		#include "templates_on.h"
72		#include "matrix_source.c"
73		#include "templates_off.h"
74		#undef BASE_SHORT
75
76		#define BASE_UCHAR
77		#include "templates_on.h"
78		#include "matrix_source.c"
79		#include "templates_off.h"
80		#undef BASE_UCHAR
81
82		#define BASE_CHAR
83		#include "templates_on.h"
84		#include "matrix_source.c"
85		#include "templates_off.h"
86		#undef BASE_CHAR

+0

-97

~~matrix/matrix_source.c~~ less more

0		/* matrix/matrix_source.c
1		*
2		* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Gerard Jungman, Brian Gough
3		*
4		* This program is free software; you can redistribute it and/or modify
5		* it under the terms of the GNU General Public License as published by
6		* the Free Software Foundation; either version 3 of the License, or (at
7		* your option) any later version.
8		*
9		* This program is distributed in the hope that it will be useful, but
10		* WITHOUT ANY WARRANTY; without even the implied warranty of
11		* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12		* General Public License for more details.
13		*
14		* You should have received a copy of the GNU General Public License
15		* along with this program; if not, write to the Free Software
16		* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17		*/
18
19		#ifndef HIDE_INLINE_STATIC
20		BASE
21		FUNCTION (gsl_matrix, get) (const TYPE (gsl_matrix) * m,
22		const size_t i, const size_t j)
23		{
24		BASE zero = ZERO;
25
26		if (gsl_check_range)
27		{
28		if (i >= m->size1) /* size_t is unsigned, can't be negative */
29		{
30		GSL_ERROR_VAL ("first index out of range", GSL_EINVAL, zero);
31		}
32		else if (j >= m->size2) /* size_t is unsigned, can't be negative */
33		{
34		GSL_ERROR_VAL ("second index out of range", GSL_EINVAL, zero);
35		}
36		}
37		return (BASE ) (m->data + MULTIPLICITY * (i * m->tda + j));
38		}
39
40		void
41		FUNCTION (gsl_matrix, set) (TYPE (gsl_matrix) * m,
42		const size_t i, const size_t j,
43		const BASE x)
44		{
45		if (gsl_check_range)
46		{
47		if (i >= m->size1) /* size_t is unsigned, can't be negative */
48		{
49		GSL_ERROR_VOID ("first index out of range", GSL_EINVAL);
50		}
51		else if (j >= m->size2) /* size_t is unsigned, can't be negative */
52		{
53		GSL_ERROR_VOID ("second index out of range", GSL_EINVAL);
54		}
55		}
56		(BASE ) (m->data + MULTIPLICITY * (i * m->tda + j)) = x;
57		}
58
59
60		BASE *
61		FUNCTION (gsl_matrix, ptr) (TYPE (gsl_matrix) * m,
62		const size_t i, const size_t j)
63		{
64		if (gsl_check_range)
65		{
66		if (i >= m->size1) /* size_t is unsigned, can't be negative */
67		{
68		GSL_ERROR_NULL ("first index out of range", GSL_EINVAL);
69		}
70		else if (j >= m->size2) /* size_t is unsigned, can't be negative */
71		{
72		GSL_ERROR_NULL ("second index out of range", GSL_EINVAL);
73		}
74		}
75		return (BASE ) (m->data + MULTIPLICITY (i * m->tda + j));
76		}
77
78
79		const BASE *
80		FUNCTION (gsl_matrix, const_ptr) (const TYPE (gsl_matrix) * m,
81		const size_t i, const size_t j)
82		{
83		if (gsl_check_range)
84		{
85		if (i >= m->size1) /* size_t is unsigned, can't be negative */
86		{
87		GSL_ERROR_NULL ("first index out of range", GSL_EINVAL);
88		}
89		else if (j >= m->size2) /* size_t is unsigned, can't be negative */
90		{
91		GSL_ERROR_NULL ("second index out of range", GSL_EINVAL);
92		}
93		}
94		return (const BASE ) (m->data + MULTIPLICITY (i * m->tda + j));
95		}
96		#endif

+2

-2

matrix/rowcol_source.c less more

145	145	GSL_ERROR_VAL ("vector length n must be positive integer",
146	146	GSL_EINVAL, view);
147	147	}
148		else if (offset + n > m->size1)
	148	else if (offset + n > m->size2)
149	149	{
150	150	GSL_ERROR_VAL ("dimension n overflows matrix", GSL_EINVAL, view);
151	151	}

178	178	GSL_ERROR_VAL ("vector length n must be positive integer",
179	179	GSL_EINVAL, view);
180	180	}
181		else if (offset + n > m->size2)
	181	else if (offset + n > m->size1)
182	182	{
183	183	GSL_ERROR_VAL ("dimension n overflows matrix", GSL_EINVAL, view);
184	184	}

+106

-0

matrix/test_complex_source.c less more

589	589	gsl_test (status, NAME (gsl_matrix) "_div_elements division");
590	590	}
591	591
	592	{
	593	BASE s;
	594	GSL_SET_COMPLEX(&s, 2.0, 3.0);
	595
	596	FUNCTION (gsl_matrix, memcpy) (m, a);
	597	FUNCTION (gsl_matrix, scale) (m, s);
	598
	599	k = 0;
	600	status = 0;
	601
	602	for (i = 0; i < P; i++)
	603	{
	604	for (j = 0; j < Q; j++)
	605	{
	606	ATOMIC real = (ATOMIC) (-(ATOMIC)k - 30);
	607	ATOMIC imag = (ATOMIC) (5 * (ATOMIC)k + 20);
	608	BASE z = FUNCTION (gsl_matrix, get) (m, i, j);
	609	if (GSL_REAL (z) != real \|\| GSL_IMAG (z) != imag)
	610	{
	611	status = 1;
	612	}
	613	k++;
	614	}
	615	}
	616	gsl_test (status, NAME (gsl_matrix) "_scale");
	617	}
	618
	619	{
	620	BASE s;
	621	GSL_SET_COMPLEX(&s, 2.0, 3.0);
	622
	623	FUNCTION (gsl_matrix, memcpy) (m, a);
	624	FUNCTION (gsl_matrix, add_constant) (m, s);
	625
	626	k = 0;
	627	status = 0;
	628
	629	for (i = 0; i < P; i++)
	630	{
	631	for (j = 0; j < Q; j++)
	632	{
	633	ATOMIC real = (ATOMIC) ((ATOMIC)k + 2);
	634	ATOMIC imag = (ATOMIC) ((ATOMIC)k + 10 + 3);
	635	BASE z = FUNCTION (gsl_matrix, get) (m, i, j);
	636	if (GSL_REAL (z) != real \|\| GSL_IMAG (z) != imag)
	637	{
	638	status = 1;
	639	}
	640	k++;
	641	}
	642	}
	643	gsl_test (status, NAME (gsl_matrix) "_add_constant");
	644	}
	645
	646	{
	647	BASE s;
	648	GSL_SET_COMPLEX(&s, 2.0, 3.0);
	649
	650	FUNCTION (gsl_matrix, memcpy) (m, a);
	651	FUNCTION (gsl_matrix, add_diagonal) (m, s);
	652
	653	k = 0;
	654	status = 0;
	655
	656	for (i = 0; i < P; i++)
	657	{
	658	for (j = 0; j < Q; j++)
	659	{
	660	ATOMIC real = (ATOMIC) ((ATOMIC)k + ((i==j) ? 2 : 0));
	661	ATOMIC imag = (ATOMIC) ((ATOMIC)k + 10 +((i==j) ? 3 : 0));
	662	BASE z = FUNCTION (gsl_matrix, get) (m, i, j);
	663	if (GSL_REAL (z) != real \|\| GSL_IMAG (z) != imag)
	664	{
	665	status = 1;
	666	}
	667	k++;
	668	}
	669	}
	670	gsl_test (status, NAME (gsl_matrix) "_add_diagonal");
	671	}
	672
	673	{
	674	FUNCTION (gsl_matrix, swap) (a, b);
	675
	676	k = 0;
	677	status = 0;
	678
	679	for (i = 0; i < P; i++)
	680	{
	681	for (j = 0; j < Q; j++)
	682	{
	683	BASE x = FUNCTION (gsl_matrix, get) (a, i, j);
	684	BASE y = FUNCTION (gsl_matrix, get) (b, i, j);
	685	if (GSL_REAL (x) != (ATOMIC) (k + 5) \|\| GSL_IMAG (x) != (ATOMIC) (k + 20) \|\|
	686	GSL_REAL (y) != (ATOMIC) (k) \|\| GSL_IMAG (y) != (ATOMIC) (k + 10))
	687	{
	688	status = 1;
	689	}
	690	k++;
	691	}
	692	}
	693	gsl_test (status, NAME (gsl_matrix) "_swap");
	694	}
	695
	696
	697
592	698	FUNCTION (gsl_matrix, free) (a);
593	699	FUNCTION (gsl_matrix, free) (b);
594	700	FUNCTION (gsl_matrix, free) (m);

+79

-1

matrix/test_source.c less more

505	505	}
506	506
507	507
	508	FUNCTION(gsl_matrix, memcpy) (m, a);
	509	FUNCTION(gsl_matrix, scale) (m, 2.0);
	510
	511	{
	512	int status = 0;
	513
	514	for (i = 0; i < M; i++)
	515	{
	516	for (j = 0; j < N; j++)
	517	{
	518	BASE r = FUNCTION(gsl_matrix,get) (m,i,j);
	519	BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
	520	if (r != (ATOMIC)(2*x))
	521	status = 1;
	522	}
	523	}
	524	gsl_test (status, NAME (gsl_matrix) "_scale");
	525	}
	526
	527	FUNCTION(gsl_matrix, memcpy) (m, a);
	528	FUNCTION(gsl_matrix, add_constant) (m, 3.0);
	529
	530	{
	531	int status = 0;
	532
	533	for (i = 0; i < M; i++)
	534	{
	535	for (j = 0; j < N; j++)
	536	{
	537	BASE r = FUNCTION(gsl_matrix,get) (m,i,j);
	538	BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
	539	BASE y = x + 3.0;
	540	if (fabs(r - y) > 2 * GSL_FLT_EPSILON * fabs(y))
	541	status = 1;
	542	}
	543	}
	544	gsl_test (status, NAME (gsl_matrix) "_add_constant");
	545	}
	546
	547	FUNCTION(gsl_matrix, memcpy) (m, a);
	548	FUNCTION(gsl_matrix, add_diagonal) (m, 5.0);
	549
	550	{
	551	int status = 0;
	552
	553	for (i = 0; i < M; i++)
	554	{
	555	for (j = 0; j < N; j++)
	556	{
	557	BASE r = FUNCTION(gsl_matrix,get) (m,i,j);
	558	BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
	559	BASE y = (i == j) ? (x + 5.0) : x;
	560	if (fabs(r - y) > 2 * GSL_FLT_EPSILON * fabs(y))
	561	status = 1;
	562	}
	563	}
	564	gsl_test (status, NAME (gsl_matrix) "_add_diagonal");
	565	}
	566
	567
	568	FUNCTION(gsl_matrix, swap) (a, b);
	569
	570	{
	571	int status = 0;
	572
	573	for (i = 0; i < M; i++)
	574	{
	575	for (j = 0; j < N; j++)
	576	{
	577	BASE x = FUNCTION(gsl_matrix,get) (a,i,j);
	578	BASE y = FUNCTION(gsl_matrix,get) (b,i,j);
	579	if (y != (BASE)(3 + i + 5 * j) \|\| x != (BASE)(3 + 2 * i + 4 * j))
	580	status = 1;
	581	}
	582	}
	583	gsl_test (status, NAME (gsl_matrix) "_swap");
	584	}
	585
	586
508	587	FUNCTION(gsl_matrix, free) (a);
509	588	FUNCTION(gsl_matrix, free) (b);
510	589	}
511
512	590
513	591	FUNCTION (gsl_matrix, free) (m);
514	592	FUNCTION (gsl_vector, free) (v);

+4

-0

min/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2008-01-09 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* brent.c (brent_iterate): remove spurious early return

+1

-1

min/Makefile.am less more

3	3
4	4	noinst_HEADERS = min.h
5	5
6		INCLUDES= -I$(top_builddir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	libgslmin_la_SOURCES = fsolver.c golden.c brent.c convergence.c bracketing.c
9	9

+5

-1

min/Makefile.in less more

132	132	LIBOBJS = @LIBOBJS@
133	133	LIBS = @LIBS@
134	134	LIBTOOL = @LIBTOOL@
	135	LIPO = @LIPO@
135	136	LN_S = @LN_S@
136	137	LTLIBOBJS = @LTLIBOBJS@
137	138	MAINT = @MAINT@

139	140	MKDIR_P = @MKDIR_P@
140	141	NM = @NM@
141	142	NMEDIT = @NMEDIT@
	143	OBJDUMP = @OBJDUMP@
142	144	OBJEXT = @OBJEXT@
	145	OTOOL = @OTOOL@
	146	OTOOL64 = @OTOOL64@
143	147	PACKAGE = @PACKAGE@
144	148	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
145	149	PACKAGE_NAME = @PACKAGE_NAME@

205	209	noinst_LTLIBRARIES = libgslmin.la
206	210	pkginclude_HEADERS = gsl_min.h
207	211	noinst_HEADERS = min.h
208		INCLUDES = -I$(top_builddir)
	212	INCLUDES = -I$(top_srcdir)
209	213	libgslmin_la_SOURCES = fsolver.c golden.c brent.c convergence.c bracketing.c
210	214	TESTS = $(check_PROGRAMS)
211	215	test_SOURCES = test.c test_funcs.c test.h

+28

-0

monte/ChangeLog less more

	0	2008-11-20 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* vegas.c (gsl_monte_vegas_integrate): improve the chisq
	3	calculation to avoid cancellation errors in the original
	4	formula (fixes bug #24510)
	5
	6	* test.c (MONTE_ERROR_TEST): added test cases for negative chisq
	7	in vegas
	8
	9	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	10
	11	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	12
	13	2008-04-26 Brian Gough <bjg@network-theory.co.uk>
	14
	15	* vegas.c (gsl_monte_vegas_integrate): compute running totals as
	16	volatile double to prevent problems with excess precision, use
	17	meaningful variable names for sum of squares, variance and sigma.
	18
	19	* test_main.c: compute the ensemble mean more accurately for the tests
	20
	21	* test.c: added a test for warm-start vegas, as well as cold-start
	22
	23	* miser.c (gsl_monte_miser_integrate): catch zero weights to avoid
	24	division by zero
	25
	26	* test.c (main): added test for step-type function
	27
0	28	2004-06-02 Brian Gough <bjg@network-theory.co.uk>
1	29
2	30	* test_main.c: handle the case where sd==0 && error[i] !=0 more

+1

-1

monte/Makefile.am less more

3	3
4	4	pkginclude_HEADERS = gsl_monte.h gsl_monte_vegas.h gsl_monte_miser.h gsl_monte_plain.h
5	5
6		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	TESTS = $(check_PROGRAMS)
9	9

+5

-1

monte/Makefile.in less more

131	131	LIBOBJS = @LIBOBJS@
132	132	LIBS = @LIBS@
133	133	LIBTOOL = @LIBTOOL@
	134	LIPO = @LIPO@
134	135	LN_S = @LN_S@
135	136	LTLIBOBJS = @LTLIBOBJS@
136	137	MAINT = @MAINT@

138	139	MKDIR_P = @MKDIR_P@
139	140	NM = @NM@
140	141	NMEDIT = @NMEDIT@
	142	OBJDUMP = @OBJDUMP@
141	143	OBJEXT = @OBJEXT@
	144	OTOOL = @OTOOL@
	145	OTOOL64 = @OTOOL64@
142	146	PACKAGE = @PACKAGE@
143	147	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
144	148	PACKAGE_NAME = @PACKAGE_NAME@

204	208	noinst_LTLIBRARIES = libgslmonte.la
205	209	libgslmonte_la_SOURCES = miser.c plain.c gsl_monte_vegas.h gsl_monte_miser.h gsl_monte_plain.h gsl_monte.h vegas.c
206	210	pkginclude_HEADERS = gsl_monte.h gsl_monte_vegas.h gsl_monte_miser.h gsl_monte_plain.h
207		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
	211	INCLUDES = -I$(top_srcdir)
208	212	TESTS = $(check_PROGRAMS)
209	213	test_SOURCES = test.c
210	214	test_LDADD = libgslmonte.la ../rng/libgslrng.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la

+6

-0

monte/miser.c less more

192	192	i_bisect = i;
193	193	weight_l = pow (sigma_l[i], beta);
194	194	weight_r = pow (sigma_r[i], beta);
	195
	196	if (weight_l == 0 && weight_r == 0)
	197	{
	198	weight_l = 1;
	199	weight_r = 1;
	200	}
195	201	}
196	202	}
197	203	else

+47

-2

monte/test.c less more

33	33	#include <gsl/gsl_monte_vegas.h>
34	34
35	35	#define CONSTANT
	36	#define STEP
36	37	#define PRODUCT
37	38	#define GAUSSIAN
38	39	#define DBLGAUSSIAN

48	49	double xu3[2] = { GSL_DBL_MAX, GSL_DBL_MAX };
49	50
50	51	double fconst (double x[], size_t d, void *params);
	52	double fstep (double x[], size_t d, void *params);
51	53	double f0 (double x[], size_t d, void *params);
52	54	double f1 (double x[], size_t d, void *params);
53	55	double f2 (double x[], size_t d, void *params);

115	117	double c = (1.0 + sqrt (10.0)) / 9.0;
116	118
117	119	gsl_monte_function Fc = make_function(&fconst, 0, 0);
	120	gsl_monte_function Fs = make_function(&fstep, 0, 0);
118	121	gsl_monte_function F0 = make_function(&f0, 0, &a);
119	122	gsl_monte_function F1 = make_function(&f1, 0, &a);
120	123	gsl_monte_function F2 = make_function(&f2, 0, &a);

146	149	add(problems,&n, &Fc, xl, xu, 8, 1000, 1.0, 0.0, "constant, 8d");
147	150	add(problems,&n, &Fc, xl, xu, 9, 1000, 1.0, 0.0, "constant, 9d");
148	151	add(problems,&n, &Fc, xl, xu, 10, 1000, 1.0, 0.0, "constant, 10d");
	152	#endif
	153
	154	#ifdef STEP
	155	/* variance(Fs) = 0.4/sqrt(1000) */
	156	add(problems,&n, &Fs, xl, xu, 1, 100000, 0.8, 1.264e-3, "step, 1d");
	157	add(problems,&n, &Fs, xl, xu, 2, 100000, 0.8, 1.264e-3, "step, 2d");
	158	add(problems,&n, &Fs, xl, xu, 3, 100000, 0.8, 1.264e-3, "step, 3d");
	159	add(problems,&n, &Fs, xl, xu, 4, 100000, 0.8, 1.264e-3, "step, 4d");
	160	add(problems,&n, &Fs, xl, xu, 5, 100000, 0.8, 1.264e-3, "step, 5d");
	161	add(problems,&n, &Fs, xl, xu, 6, 100000, 0.8, 1.264e-3, "step, 6d");
	162	add(problems,&n, &Fs, xl, xu, 7, 100000, 0.8, 1.264e-3, "step, 7d");
	163	add(problems,&n, &Fs, xl, xu, 8, 100000, 0.8, 1.264e-3, "step, 8d");
	164	add(problems,&n, &Fs, xl, xu, 9, 100000, 0.8, 1.264e-3, "step, 9d");
	165	add(problems,&n, &Fs, xl, xu, 10, 100000, 0.8, 1.264e-3, "step, 10d");
149	166	#endif
150	167
151	168	#ifdef PRODUCT

268	285	#define NAME "vegas"
269	286	#define MONTE_STATE gsl_monte_vegas_state
270	287	#define MONTE_ALLOC gsl_monte_vegas_alloc
271		#define MONTE_INTEGRATE(f,xl,xu,dim,calls,r,s,res,err) { gsl_monte_vegas_integrate(f,xl,xu,dim,calls,r,s,res,err) ; if (s->chisq < 0.5 \|\| s->chisq > 2) gsl_monte_vegas_integrate(f,xl,xu,dim,calls,r,s,res,err); }
	288	#define MONTE_INTEGRATE(f,xl,xu,dim,calls,r,s,res,err) { gsl_monte_vegas_integrate(f,xl,xu,dim,calls,r,s,res,err) ; }
272	289	#define MONTE_FREE gsl_monte_vegas_free
273	290	#define MONTE_SPEEDUP 3
274		#define MONTE_ERROR_TEST(err,expected) gsl_test(err > 3.0 * (expected == 0 ? 1.0/(I->calls/MONTE_SPEEDUP) : expected), NAME ", %s, abserr[%d] (obs %g vs exp %g)", I->description, i, err, expected)
	291	#define MONTE_ERROR_TEST(err,expected) gsl_test(err > 3.0 * (expected == 0 ? 1.0/(I->calls/MONTE_SPEEDUP) : expected), NAME ", %s, abserr[%d] (obs %g vs exp %g)", I->description, i, err, expected) ; gsl_test(s->chisq < 0, NAME " returns valid chisq (%g)", s->chisq)
275	292	#include "test_main.c"
276	293	#undef NAME
277	294	#undef MONTE_STATE

281	298	#undef MONTE_ERROR_TEST
282	299	#undef MONTE_SPEEDUP
283	300	#endif
	301
	302
	303	#ifdef VEGAS
	304	#define NAME "vegas(warm)"
	305	#define MONTE_STATE gsl_monte_vegas_state
	306	#define MONTE_ALLOC gsl_monte_vegas_alloc
	307	#define MONTE_INTEGRATE(f,xl,xu,dim,calls,r,s,res,err) { gsl_monte_vegas_integrate(f,xl,xu,dim,calls,r,s,res,err) ; gsl_monte_vegas_integrate(f,xl,xu,dim,calls,r,s,res,err); }
	308	#define MONTE_FREE gsl_monte_vegas_free
	309	#define MONTE_SPEEDUP 3
	310	#define MONTE_ERROR_TEST(err,expected) gsl_test(err > 3.0 * (expected == 0 ? 1.0/(I->calls/MONTE_SPEEDUP) : expected), NAME ", %s, abserr[%d] (obs %g vs exp %g)", I->description, i, err, expected); gsl_test(s->chisq < 0, NAME " returns valid chisq (%g)", s->chisq)
	311	#include "test_main.c"
	312	#undef NAME
	313	#undef MONTE_STATE
	314	#undef MONTE_ALLOC
	315	#undef MONTE_INTEGRATE
	316	#undef MONTE_FREE
	317	#undef MONTE_ERROR_TEST
	318	#undef MONTE_SPEEDUP
	319	#endif
	320
284	321
285	322	exit (gsl_test_summary ());
286	323	}

290	327	fconst (double x[], size_t num_dim, void *params)
291	328	{
292	329	return 1;
	330	}
	331
	332
	333	/* Step-type (pulse) function */
	334	double
	335	fstep (double x[], size_t num_dim, void *params)
	336	{
	337	return (x[0] > 0.1 && x[0] < 0.9) ? 1 : 0;
293	338	}
294	339
295	340	/* Simple product function */

+25

-27

monte/test_main.c less more

0	0	for (I = problems ; I->f != 0; I++)
1	1	{
2	2	size_t i;
3		double sum = 0, mean, sumd2 = 0, sd, res, err;
	3	double res, err;
4	4
5	5	gsl_rng * r;
6	6

33	33	MONTE_FREE (s);
34	34	}
35	35
36		for (i = 0; i < TRIALS; i++)
37		{
38		sum += result[i];
39		}
	36
	37	/* Check the results for consistency as an ensemble */
40	38
41		mean = sum / TRIALS ;
	39	{
	40	double mean = 0, sumd2 = 0, sd;
42	41
43		for (i = 0; i < TRIALS; i++)
44		{
45		sumd2 += pow(result[i] - mean, 2.0);
46		}
	42	/* We need to compute the mean exactly when all terms are equal,
	43	to get an exact zero for the standard deviation (this is a
	44	common case when integrating a constant). */
47	45
48		sd = sqrt(sumd2 / (TRIALS-1.0)) ;
49
50		if (sd < TRIALS * GSL_DBL_EPSILON * fabs (mean))
51		{
52		sd = 0;
53		}
	46	for (i = 0; i < TRIALS; i++)
	47	{
	48	mean += (result[i] - mean) / (i + 1.0);
	49	}
54	50
55		for (i = 0; i < TRIALS; i++)
56		{
57		if (sd == 0 && fabs(error[i]) < GSL_DBL_EPSILON * fabs(result[i]))
58		{
59		error[i] = 0.0;
60		}
61
62		gsl_test_factor (error[i], sd, 5.0,
63		NAME ", %s, abserr[%d] vs sd", I->description, i);
64		}
65
	51	for (i = 0; i < TRIALS; i++)
	52	{
	53	sumd2 += pow(result[i] - mean, 2.0);
	54	}
	55
	56	sd = sqrt(sumd2 / (TRIALS-1.0)) ;
	57
	58	for (i = 0; i < TRIALS; i++)
	59	{
	60	gsl_test_factor (error[i], sd, 5.0,
	61	NAME ", %s, abserr[%d] vs sd", I->description, i);
	62	}
	63	}
66	64
67	65	gsl_rng_free (r);
68	66	}

+41

-17

monte/vegas.c less more

70	70	#define NEW_COORD(s,i) ((s)->xin[(i)])
71	71	#define VALUE(s,i,j) ((s)->d[(i)*(s)->dim + (j)])
72	72
	73	#define USE_ORIGINAL_CHISQ_FORMULA 0
	74
73	75	/* predeclare functions */
74	76
75	77	typedef int coord;

148	150	state->chi_sum = 0;
149	151	state->it_num = 1;
150	152	state->samples = 0;
	153	state->chisq = 0;
151	154	}
152	155
153	156	if (state->stage <= 2)

211	214	cum_int = 0.0;
212	215	cum_sig = 0.0;
213	216
214		state->chisq = 0.0;
215
216	217	for (it = 0; it < state->iterations; it++)
217	218	{
218	219	double intgrl = 0.0, intgrl_sq = 0.0;
219		double sig = 0.0;
220		double wgt;
	220	double tss = 0.0;
	221	double wgt, var, sig;
221	222	size_t calls_per_box = state->calls_per_box;
222	223	double jacbin = state->jac;
223	224	double *x = state->x;

230	231
231	232	do
232	233	{
233		double m = 0, q = 0;
	234	volatile double m = 0, q = 0;
234	235	double f_sq_sum = 0.0;
235	236
236	237	for (k = 0; k < calls_per_box; k++)
237	238	{
238		double fval, bin_vol;
	239	volatile double fval;
	240	double bin_vol;
239	241
240	242	random_point (x, bin, &bin_vol, state->box, xl, xu, state, r);
241	243
242	244	fval = jacbin * bin_vol * GSL_MONTE_FN_EVAL (f, x);
243	245
244		/* recurrence for mean and variance */
	246	/* recurrence for mean and variance (sum of squares) */
245	247
246	248	{
247	249	double d = fval - m;

258	260
259	261	intgrl += m * calls_per_box;
260	262
261		f_sq_sum = q * calls_per_box ;
262
263		sig += f_sq_sum ;
	263	f_sq_sum = q * calls_per_box;
	264
	265	tss += f_sq_sum;
264	266
265	267	if (state->mode == GSL_VEGAS_MODE_STRATIFIED)
266	268	{

271	273
272	274	/* Compute final results for this iteration */
273	275
274		sig = sig / (calls_per_box - 1.0) ;
275
276		if (sig > 0)
277		{
278		wgt = 1.0 / sig;
	276	var = tss / (calls_per_box - 1.0) ;
	277
	278	if (var > 0)
	279	{
	280	wgt = 1.0 / var;
279	281	}
280	282	else if (state->sum_wgts > 0)
281	283	{

288	290
289	291	intgrl_sq = intgrl * intgrl;
290	292
	293	sig = sqrt (var);
	294
291	295	state->result = intgrl;
292		state->sigma = sqrt(sig);
	296	state->sigma = sig;
293	297
294	298	if (wgt > 0.0)
295	299	{
	300	double sum_wgts = state->sum_wgts;
	301	double wtd_int_sum = state->wtd_int_sum;
	302	double m = (sum_wgts > 0) ? (wtd_int_sum / sum_wgts) : 0;
	303	double q = intgrl - m;
	304
296	305	state->samples++ ;
297	306	state->sum_wgts += wgt;
298	307	state->wtd_int_sum += intgrl * wgt;

301	310	cum_int = state->wtd_int_sum / state->sum_wgts;
302	311	cum_sig = sqrt (1 / state->sum_wgts);
303	312
	313	#if USE_ORIGINAL_CHISQ_FORMULA
	314	/* This is the chisq formula from the original Lepage paper. It
	315	computes the variance from <x^2> - <x>^2 and can suffer from
	316	catastrophic cancellations, e.g. returning negative chisq. */
304	317	if (state->samples > 1)
305	318	{
306	319	state->chisq = (state->chi_sum - state->wtd_int_sum * cum_int) /
307	320	(state->samples - 1.0);
308	321	}
	322	#else
	323	/* The new formula below computes exactly the same quantity as above
	324	but using a stable recurrence */
	325	if (state->samples == 1) {
	326	state->chisq = 0;
	327	} else {
	328	state->chisq *= (state->samples - 2.0);
	329	state->chisq += (wgt / (1 + (wgt / sum_wgts))) * q * q;
	330	state->chisq /= (state->samples - 1.0);
	331	}
	332	#endif
309	333	}
310	334	else
311	335	{

317	341	if (state->verbose >= 0)
318	342	{
319	343	print_res (state,
320		state->it_num, intgrl, sqrt (sig), cum_int, cum_sig,
	344	state->it_num, intgrl, sig, cum_int, cum_sig,
321	345	state->chisq);
322	346	if (it + 1 == state->iterations && state->verbose > 0)
323	347	{

+4

-0

multifit/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-07-29 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* lmset.c (set): ensure internal state is zeroed after a set

+1

-1

multifit/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_multifit.h gsl_multifit_nlin.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslmultifit_la_SOURCES = multilinear.c work.c lmder.c fsolver.c fdfsolver.c convergence.c gradient.c covar.c
7	7

+5

-1

multifit/Makefile.in less more

136	136	LIBOBJS = @LIBOBJS@
137	137	LIBS = @LIBS@
138	138	LIBTOOL = @LIBTOOL@
	139	LIPO = @LIPO@
139	140	LN_S = @LN_S@
140	141	LTLIBOBJS = @LTLIBOBJS@
141	142	MAINT = @MAINT@

143	144	MKDIR_P = @MKDIR_P@
144	145	NM = @NM@
145	146	NMEDIT = @NMEDIT@
	147	OBJDUMP = @OBJDUMP@
146	148	OBJEXT = @OBJEXT@
	149	OTOOL = @OTOOL@
	150	OTOOL64 = @OTOOL64@
147	151	PACKAGE = @PACKAGE@
148	152	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
149	153	PACKAGE_NAME = @PACKAGE_NAME@

208	212	top_srcdir = @top_srcdir@
209	213	noinst_LTLIBRARIES = libgslmultifit.la
210	214	pkginclude_HEADERS = gsl_multifit.h gsl_multifit_nlin.h
211		INCLUDES = -I$(top_builddir)
	215	INCLUDES = -I$(top_srcdir)
212	216	libgslmultifit_la_SOURCES = multilinear.c work.c lmder.c fsolver.c fdfsolver.c convergence.c gradient.c covar.c
213	217	noinst_HEADERS = lmutil.c lmpar.c lmset.c lmiterate.c qrsolv.c test_brown.c test_enso.c test_filip.c test_fn.c test_hahn1.c test_kirby2.c test_longley.c test_nelson.c test_pontius.c test_estimator.c
214	218	TESTS = $(check_PROGRAMS)

+18

-0

multimin/ChangeLog less more

	0	2008-11-29 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* test.c (test_f): extended fminimizer test to allow type to be
	3	passed in as a parameter
	4
	5	* simplex2.c: use BLAS, keep track of center in state to avoid
	6	unnecessary computation, compute size as RMS value to allow linear
	7	update.
	8
	9	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	10
	11	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	12
	13	2008-05-06 Brian Gough <bjg@network-theory.co.uk>
	14
	15	* simplex.c (nmsimplex_iterate): fix search for second highest
	16	point
	17
0	18	2007-07-30 Brian Gough <bjg@network-theory.co.uk>
1	19
2	20	* history.c: removed (unused file)

+2

-2

multimin/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_multimin.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6		libgslmultimin_la_SOURCES = fdfminimizer.c steepest_descent.c conjugate_fr.c conjugate_pr.c convergence.c diff.c vector_bfgs.c vector_bfgs2.c fminimizer.c simplex.c
	6	libgslmultimin_la_SOURCES = fdfminimizer.c steepest_descent.c conjugate_fr.c conjugate_pr.c convergence.c diff.c vector_bfgs.c vector_bfgs2.c fminimizer.c simplex.c simplex2.c
7	7
8	8	noinst_HEADERS = directional_minimize.c linear_minimize.c linear_wrapper.c
9	9

+8

-3

multimin/Makefile.in less more

47	47	libgslmultimin_la_LIBADD =
48	48	am_libgslmultimin_la_OBJECTS = fdfminimizer.lo steepest_descent.lo \
49	49	conjugate_fr.lo conjugate_pr.lo convergence.lo diff.lo \
50		vector_bfgs.lo vector_bfgs2.lo fminimizer.lo simplex.lo
	50	vector_bfgs.lo vector_bfgs2.lo fminimizer.lo simplex.lo \
	51	simplex2.lo
51	52	libgslmultimin_la_OBJECTS = $(am_libgslmultimin_la_OBJECTS)
52	53	am_test_OBJECTS = test.$(OBJEXT) test_funcs.$(OBJEXT)
53	54	test_OBJECTS = $(am_test_OBJECTS)

138	139	LIBOBJS = @LIBOBJS@
139	140	LIBS = @LIBS@
140	141	LIBTOOL = @LIBTOOL@
	142	LIPO = @LIPO@
141	143	LN_S = @LN_S@
142	144	LTLIBOBJS = @LTLIBOBJS@
143	145	MAINT = @MAINT@

145	147	MKDIR_P = @MKDIR_P@
146	148	NM = @NM@
147	149	NMEDIT = @NMEDIT@
	150	OBJDUMP = @OBJDUMP@
148	151	OBJEXT = @OBJEXT@
	152	OTOOL = @OTOOL@
	153	OTOOL64 = @OTOOL64@
149	154	PACKAGE = @PACKAGE@
150	155	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
151	156	PACKAGE_NAME = @PACKAGE_NAME@

210	215	top_srcdir = @top_srcdir@
211	216	noinst_LTLIBRARIES = libgslmultimin.la
212	217	pkginclude_HEADERS = gsl_multimin.h
213		INCLUDES = -I$(top_builddir)
214		libgslmultimin_la_SOURCES = fdfminimizer.c steepest_descent.c conjugate_fr.c conjugate_pr.c convergence.c diff.c vector_bfgs.c vector_bfgs2.c fminimizer.c simplex.c
	218	INCLUDES = -I$(top_srcdir)
	219	libgslmultimin_la_SOURCES = fdfminimizer.c steepest_descent.c conjugate_fr.c conjugate_pr.c convergence.c diff.c vector_bfgs.c vector_bfgs2.c fminimizer.c simplex.c simplex2.c
215	220	noinst_HEADERS = directional_minimize.c linear_minimize.c linear_wrapper.c
216	221	TESTS = $(check_PROGRAMS)
217	222	test_SOURCES = test.c test_funcs.c test_funcs.h

+4

-13

multimin/fminimizer.c less more

89	89
90	90	gsl_vector_memcpy (s->x,x);
91	91
92		s->simplex_size_valid = 0;
93
94		return (s->type->set) (s->state, s->f, s->x, step_size);
	92	return (s->type->set) (s->state, s->f, s->x, &(s->size), step_size);
95	93	}
96	94
97	95	void

106	104	int
107	105	gsl_multimin_fminimizer_iterate (gsl_multimin_fminimizer * s)
108	106	{
109		s->simplex_size_valid = 0;
110
111		return (s->type->iterate) (s->state, s->f, s->x, &(s->fval));
	107	return (s->type->iterate) (s->state, s->f, s->x, &(s->size), &(s->fval));
112	108	}
113	109
114	110	const char *

131	127	}
132	128
133	129	double
134		gsl_multimin_fminimizer_size (gsl_multimin_fminimizer * s)
	130	gsl_multimin_fminimizer_size (const gsl_multimin_fminimizer * s)
135	131	{
136		if (!s->simplex_size_valid)
137		{
138		s->simplex_size = (s->type->get_size) (s->state);
139		s->simplex_size_valid = 1;
140		}
141		return s->simplex_size;
	132	return s->size;
142	133	}

+5

-5

multimin/gsl_multimin.h less more

83	83	int (alloc) (void state, size_t n);
84	84	int (set) (void state, gsl_multimin_function * f,
85	85	const gsl_vector * x,
	86	double * size,
86	87	const gsl_vector * step_size);
87	88	int (iterate) (void state, gsl_multimin_function * f,
88	89	gsl_vector * x,
	90	double * size,
89	91	double * fval);
90	92	void (free) (void state);
91		double (get_size) (void state);
92	93	}
93	94	gsl_multimin_fminimizer_type;
94	95

101	102	double fval;
102	103	gsl_vector * x;
103	104
104		int simplex_size_valid;
105		double simplex_size;
	105	double size;
106	106
107	107	void *state;
108	108	}

134	134	gsl_multimin_fminimizer_minimum (const gsl_multimin_fminimizer * s);
135	135
136	136	double
137		gsl_multimin_fminimizer_size (gsl_multimin_fminimizer * s);
	137	gsl_multimin_fminimizer_size (const gsl_multimin_fminimizer * s);
138	138
139	139	/* Convergence test functions */
140	140

217	217	GSL_VAR const gsl_multimin_fdfminimizer_type *gsl_multimin_fdfminimizer_vector_bfgs;
218	218	GSL_VAR const gsl_multimin_fdfminimizer_type *gsl_multimin_fdfminimizer_vector_bfgs2;
219	219	GSL_VAR const gsl_multimin_fminimizer_type *gsl_multimin_fminimizer_nmsimplex;
220
	220	GSL_VAR const gsl_multimin_fminimizer_type *gsl_multimin_fminimizer_nmsimplex2;
221	221
222	222	__END_DECLS
223	223

+19

-10

multimin/simplex.c less more

156	156	}
157	157
158	158	static double
159		nmsimplex_get_size (void *vstate)
160		{
161		nmsimplex_state_t state = (nmsimplex_state_t ) vstate;
162
	159	nmsimplex_size (nmsimplex_state_t * state)
	160	{
163	161	/* calculates simplex size as average sum of length of vectors
164	162	from simplex center to corner points:
165	163

237	235	static int
238	236	nmsimplex_set (void vstate, gsl_multimin_function f,
239	237	const gsl_vector * x,
240		const gsl_vector * step_size)
	238	double size, const gsl_vector step_size)
241	239	{
242	240	int status;
243	241	size_t i;

293	291	gsl_vector_set (state->y1, i + 1, val);
294	292	}
295	293
	294	/* Initialize simplex size */
	295
	296	*size = nmsimplex_size (state);
	297
296	298	return GSL_SUCCESS;
297	299	}
298	300

309	311
310	312	static int
311	313	nmsimplex_iterate (void vstate, gsl_multimin_function f,
312		gsl_vector * x, double *fval)
	314	gsl_vector * x, double size, double fval)
313	315	{
314	316
315	317	/* Simplex iteration tries to minimize function f value */

326	328
327	329	size_t n = y1->size;
328	330	size_t i;
329		size_t hi = 0, s_hi = 0, lo = 0;
	331	size_t hi, s_hi, lo;
330	332	double dhi, ds_hi, dlo;
331	333	int status;
332	334	double val, val2;

339	341
340	342	/* get index of highest, second highest and lowest point */
341	343
342		dhi = ds_hi = dlo = gsl_vector_get (y1, 0);
	344	dhi = dlo = gsl_vector_get (y1, 0);
	345	hi = 0; lo = 0;
	346
	347	ds_hi = gsl_vector_get(y1, 1);
	348	s_hi = 1;
343	349
344	350	for (i = 1; i < n; i++)
345	351	{

439	445	lo = gsl_vector_min_index (y1);
440	446	gsl_matrix_get_row (x, x1, lo);
441	447	*fval = gsl_vector_get (y1, lo);
	448
	449	/* Update simplex size */
	450
	451	*size = nmsimplex_size (state);
442	452
443	453	return GSL_SUCCESS;
444	454	}

449	459	&nmsimplex_alloc,
450	460	&nmsimplex_set,
451	461	&nmsimplex_iterate,
452		&nmsimplex_free,
453		&nmsimplex_get_size
	462	&nmsimplex_free
454	463	};
455	464
456	465	const gsl_multimin_fminimizer_type

+557

-0

multimin/simplex2.c less more

	0	/* multimin/simplex2.c
	1	*
	2	* Copyright (C) 2007, 2008 Brian Gough
	3	* Copyright (C) 2002 Tuomo Keskitalo, Ivo Alxneit
	4	*
	5	* This program is free software; you can redistribute it and/or modify
	6	* it under the terms of the GNU General Public License as published by
	7	* the Free Software Foundation; either version 3 of the License, or (at
	8	* your option) any later version.
	9	*
	10	* This program is distributed in the hope that it will be useful, but
	11	* WITHOUT ANY WARRANTY; without even the implied warranty of
	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	13	* General Public License for more details.
	14	*
	15	* You should have received a copy of the GNU General Public License
	16	* along with this program; if not, write to the Free Software
	17	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	18	*/
	19
	20	/*
	21	- Originally written by Tuomo Keskitalo <tuomo.keskitalo@iki.fi>
	22	- Corrections to nmsimplex_iterate and other functions
	23	by Ivo Alxneit <ivo.alxneit@psi.ch>
	24	- Additional help by Brian Gough <bjg@network-theory.co.uk>
	25	- Optimisations added by Brian Gough <bjg@network-theory.co.uk>
	26	+ use BLAS for frequently-called functions
	27	+ keep track of the center to avoid unnecessary computation
	28	+ compute size as RMS value, allowing linear update on each step
	29	instead of recomputing from all N+1 vectors.
	30	*/
	31
	32	/* The Simplex method of Nelder and Mead, also known as the polytope
	33	search alogorithm. Ref: Nelder, J.A., Mead, R., Computer Journal 7
	34	(1965) pp. 308-313.
	35
	36	This implementation uses n+1 corner points in the simplex.
	37	*/
	38
	39	#include <config.h>
	40	#include <stdlib.h>
	41	#include <gsl/gsl_blas.h>
	42	#include <gsl/gsl_multimin.h>
	43
	44	typedef struct
	45	{
	46	gsl_matrix x1; / simplex corner points */
	47	gsl_vector y1; / function value at corner points */
	48	gsl_vector ws1; / workspace 1 for algorithm */
	49	gsl_vector ws2; / workspace 2 for algorithm */
	50	gsl_vector center; / center of all points */
	51	gsl_vector delta; / current step */
	52	gsl_vector xmc; / x - center (workspace) */
	53	double S2;
	54	}
	55	nmsimplex_state_t;
	56
	57	static double
	58	try_corner_move (const double coeff,
	59	const nmsimplex_state_t * state,
	60	size_t corner,
	61	gsl_vector * xc, const gsl_multimin_function * f)
	62	{
	63	/* moves a simplex corner scaled by coeff (negative value represents
	64	mirroring by the middle point of the "other" corner points)
	65	and gives new corner in xc and function value at xc as a
	66	return value
	67	*/
	68
	69	gsl_matrix *x1 = state->x1;
	70	const size_t P = x1->size1;
	71	double newval;
	72
	73	/* xc = (1-coeff)(P/(P-1)) center(all) + ((Pcoeff-1)/(P-1))x_corner */
	74	{
	75	double alpha = (1 - coeff) * P / (P - 1.0);
	76	double beta = (P * coeff - 1.0) / (P - 1.0);
	77	gsl_vector_const_view row = gsl_matrix_const_row (x1, corner);
	78
	79	gsl_vector_memcpy (xc, state->center);
	80	gsl_blas_dscal (alpha, xc);
	81	gsl_blas_daxpy (beta, &row.vector, xc);
	82	}
	83
	84	newval = GSL_MULTIMIN_FN_EVAL (f, xc);
	85
	86	return newval;
	87	}
	88
	89
	90	static void
	91	update_point (nmsimplex_state_t * state, size_t i,
	92	const gsl_vector * x, double val)
	93	{
	94	gsl_vector_const_view x_orig = gsl_matrix_const_row (state->x1, i);
	95	const size_t P = state->x1->size1;
	96
	97	/* Compute delta = x - x_orig */
	98	gsl_vector_memcpy (state->delta, x);
	99	gsl_blas_daxpy (-1.0, &x_orig.vector, state->delta);
	100
	101	/* Compute xmc = x_orig - c */
	102	gsl_vector_memcpy (state->xmc, &x_orig.vector);
	103	gsl_blas_daxpy (-1.0, state->center, state->xmc);
	104
	105	/* Update size: S2' = S2 + (2/P) * (x_orig - c).delta + (P-1)(delta/P)^2 /
	106	{
	107	double d = gsl_blas_dnrm2 (state->delta);
	108	double xmcd;
	109	gsl_blas_ddot (state->xmc, state->delta, &xmcd);
	110	state->S2 += (2.0 / P) * xmcd + ((P - 1.0) / P) * (d * d / P);
	111	}
	112
	113	/* Update center: c' = c + (x - x_orig) / P */
	114
	115	{
	116	double alpha = 1.0 / P;
	117	gsl_blas_daxpy (-alpha, &x_orig.vector, state->center);
	118	gsl_blas_daxpy (alpha, x, state->center);
	119	}
	120
	121	gsl_matrix_set_row (state->x1, i, x);
	122	gsl_vector_set (state->y1, i, val);
	123	}
	124
	125	static int
	126	contract_by_best (nmsimplex_state_t * state, size_t best,
	127	gsl_vector * xc, gsl_multimin_function * f)
	128	{
	129
	130	/* Function contracts the simplex in respect to best valued
	131	corner. That is, all corners besides the best corner are moved.
	132	(This function is rarely called in practice, since it is the last
	133	choice, hence not optimised - BJG) */
	134
	135	/* the xc vector is simply work space here */
	136
	137	gsl_matrix *x1 = state->x1;
	138	gsl_vector *y1 = state->y1;
	139
	140	size_t i, j;
	141	double newval;
	142
	143	int status = GSL_SUCCESS;
	144
	145	for (i = 0; i < x1->size1; i++)
	146	{
	147	if (i != best)
	148	{
	149	for (j = 0; j < x1->size2; j++)
	150	{
	151	newval = 0.5 * (gsl_matrix_get (x1, i, j)
	152	+ gsl_matrix_get (x1, best, j));
	153	gsl_matrix_set (x1, i, j, newval);
	154	}
	155
	156	/* evaluate function in the new point */
	157
	158	gsl_matrix_get_row (xc, x1, i);
	159	newval = GSL_MULTIMIN_FN_EVAL (f, xc);
	160	gsl_vector_set (y1, i, newval);
	161
	162	/* notify caller that we found at least one bad function value.
	163	we finish the contraction (and do not abort) to allow the user
	164	to handle the situation */
	165
	166	if (!gsl_finite (newval))
	167	{
	168	status = GSL_EBADFUNC;
	169	}
	170	}
	171	}
	172
	173	return status;
	174	}
	175
	176	static int
	177	compute_center (const nmsimplex_state_t * state, gsl_vector * center)
	178	{
	179	/* calculates the center of the simplex and stores in center */
	180
	181	gsl_matrix *x1 = state->x1;
	182	const size_t P = x1->size1;
	183	size_t i;
	184
	185	gsl_vector_set_zero (center);
	186
	187	for (i = 0; i < P; i++)
	188	{
	189	gsl_vector_const_view row = gsl_matrix_const_row (x1, i);
	190	gsl_blas_daxpy (1.0, &row.vector, center);
	191	}
	192
	193	{
	194	const double alpha = 1.0 / P;
	195	gsl_blas_dscal (alpha, center);
	196	}
	197
	198	return GSL_SUCCESS;
	199	}
	200
	201	static double
	202	compute_size (nmsimplex_state_t * state, const gsl_vector * center)
	203	{
	204	/* calculates simplex size as rms sum of length of vectors
	205	from simplex center to corner points:
	206
	207	sqrt( sum ( \|\| y - y_middlepoint \|\|^2 ) / n )
	208	*/
	209
	210	gsl_vector *s = state->ws1;
	211	gsl_matrix *x1 = state->x1;
	212	const size_t P = x1->size1;
	213	size_t i;
	214
	215	double ss = 0.0;
	216
	217	for (i = 0; i < P; i++)
	218	{
	219	double t;
	220	gsl_matrix_get_row (s, x1, i);
	221	gsl_blas_daxpy (-1.0, center, s);
	222	t = gsl_blas_dnrm2 (s);
	223	ss += t * t;
	224	}
	225
	226	/* Store squared size in the state */
	227	state->S2 = (ss / P);
	228
	229	return sqrt (ss / P);
	230	}
	231
	232	static int
	233	nmsimplex_alloc (void *vstate, size_t n)
	234	{
	235	nmsimplex_state_t state = (nmsimplex_state_t ) vstate;
	236
	237	if (n == 0)
	238	{
	239	GSL_ERROR ("invalid number of parameters specified", GSL_EINVAL);
	240	}
	241
	242	state->x1 = gsl_matrix_alloc (n + 1, n);
	243
	244	if (state->x1 == NULL)
	245	{
	246	GSL_ERROR ("failed to allocate space for x1", GSL_ENOMEM);
	247	}
	248
	249	state->y1 = gsl_vector_alloc (n + 1);
	250
	251	if (state->y1 == NULL)
	252	{
	253	gsl_matrix_free (state->x1);
	254	GSL_ERROR ("failed to allocate space for y", GSL_ENOMEM);
	255	}
	256
	257	state->ws1 = gsl_vector_alloc (n);
	258
	259	if (state->ws1 == NULL)
	260	{
	261	gsl_matrix_free (state->x1);
	262	gsl_vector_free (state->y1);
	263	GSL_ERROR ("failed to allocate space for ws1", GSL_ENOMEM);
	264	}
	265
	266	state->ws2 = gsl_vector_alloc (n);
	267
	268	if (state->ws2 == NULL)
	269	{
	270	gsl_matrix_free (state->x1);
	271	gsl_vector_free (state->y1);
	272	gsl_vector_free (state->ws1);
	273	GSL_ERROR ("failed to allocate space for ws2", GSL_ENOMEM);
	274	}
	275
	276	state->center = gsl_vector_alloc (n);
	277
	278	if (state->center == NULL)
	279	{
	280	gsl_matrix_free (state->x1);
	281	gsl_vector_free (state->y1);
	282	gsl_vector_free (state->ws1);
	283	gsl_vector_free (state->ws2);
	284	GSL_ERROR ("failed to allocate space for center", GSL_ENOMEM);
	285	}
	286
	287	state->delta = gsl_vector_alloc (n);
	288
	289	if (state->delta == NULL)
	290	{
	291	gsl_matrix_free (state->x1);
	292	gsl_vector_free (state->y1);
	293	gsl_vector_free (state->ws1);
	294	gsl_vector_free (state->ws2);
	295	gsl_vector_free (state->center);
	296	GSL_ERROR ("failed to allocate space for delta", GSL_ENOMEM);
	297	}
	298
	299	state->xmc = gsl_vector_alloc (n);
	300
	301	if (state->xmc == NULL)
	302	{
	303	gsl_matrix_free (state->x1);
	304	gsl_vector_free (state->y1);
	305	gsl_vector_free (state->ws1);
	306	gsl_vector_free (state->ws2);
	307	gsl_vector_free (state->center);
	308	gsl_vector_free (state->delta);
	309	GSL_ERROR ("failed to allocate space for xmc", GSL_ENOMEM);
	310	}
	311
	312
	313	return GSL_SUCCESS;
	314	}
	315
	316	static void
	317	nmsimplex_free (void *vstate)
	318	{
	319	nmsimplex_state_t state = (nmsimplex_state_t ) vstate;
	320
	321	gsl_matrix_free (state->x1);
	322	gsl_vector_free (state->y1);
	323	gsl_vector_free (state->ws1);
	324	gsl_vector_free (state->ws2);
	325	gsl_vector_free (state->center);
	326	gsl_vector_free (state->delta);
	327	gsl_vector_free (state->xmc);
	328	}
	329
	330	static int
	331	nmsimplex_set (void vstate, gsl_multimin_function f,
	332	const gsl_vector * x,
	333	double size, const gsl_vector step_size)
	334	{
	335	int status;
	336	size_t i;
	337	double val;
	338
	339	nmsimplex_state_t state = (nmsimplex_state_t ) vstate;
	340
	341	gsl_vector *xtemp = state->ws1;
	342
	343	if (xtemp->size != x->size)
	344	{
	345	GSL_ERROR ("incompatible size of x", GSL_EINVAL);
	346	}
	347
	348	if (xtemp->size != step_size->size)
	349	{
	350	GSL_ERROR ("incompatible size of step_size", GSL_EINVAL);
	351	}
	352
	353	/* first point is the original x0 */
	354
	355	val = GSL_MULTIMIN_FN_EVAL (f, x);
	356
	357	if (!gsl_finite (val))
	358	{
	359	GSL_ERROR ("non-finite function value encountered", GSL_EBADFUNC);
	360	}
	361
	362	gsl_matrix_set_row (state->x1, 0, x);
	363	gsl_vector_set (state->y1, 0, val);
	364
	365	/* following points are initialized to x0 + step_size */
	366
	367	for (i = 0; i < x->size; i++)
	368	{
	369	status = gsl_vector_memcpy (xtemp, x);
	370
	371	if (status != 0)
	372	{
	373	GSL_ERROR ("vector memcopy failed", GSL_EFAILED);
	374	}
	375
	376	{
	377	double xi = gsl_vector_get (x, i);
	378	double si = gsl_vector_get (step_size, i);
	379
	380	gsl_vector_set (xtemp, i, xi + si);
	381	val = GSL_MULTIMIN_FN_EVAL (f, xtemp);
	382	}
	383
	384	if (!gsl_finite (val))
	385	{
	386	GSL_ERROR ("non-finite function value encountered", GSL_EBADFUNC);
	387	}
	388
	389	gsl_matrix_set_row (state->x1, i + 1, xtemp);
	390	gsl_vector_set (state->y1, i + 1, val);
	391	}
	392
	393	compute_center (state, state->center);
	394
	395	/* Initialize simplex size */
	396	*size = compute_size (state, state->center);
	397
	398	return GSL_SUCCESS;
	399	}
	400
	401	static int
	402	nmsimplex_iterate (void vstate, gsl_multimin_function f,
	403	gsl_vector * x, double size, double fval)
	404	{
	405
	406	/* Simplex iteration tries to minimize function f value */
	407	/* Includes corrections from Ivo Alxneit <ivo.alxneit@psi.ch> */
	408
	409	nmsimplex_state_t state = (nmsimplex_state_t ) vstate;
	410
	411	/* xc and xc2 vectors store tried corner point coordinates */
	412
	413	gsl_vector *xc = state->ws1;
	414	gsl_vector *xc2 = state->ws2;
	415	gsl_vector *y1 = state->y1;
	416	gsl_matrix *x1 = state->x1;
	417
	418	const size_t n = y1->size;
	419	size_t i;
	420	size_t hi, s_hi, lo;
	421	double dhi, ds_hi, dlo;
	422	int status;
	423	double val, val2;
	424
	425	if (xc->size != x->size)
	426	{
	427	GSL_ERROR ("incompatible size of x", GSL_EINVAL);
	428	}
	429
	430	/* get index of highest, second highest and lowest point */
	431
	432	dhi = dlo = gsl_vector_get (y1, 0);
	433	hi = 0;
	434	lo = 0;
	435
	436	ds_hi = gsl_vector_get (y1, 1);
	437	s_hi = 1;
	438
	439	for (i = 1; i < n; i++)
	440	{
	441	val = (gsl_vector_get (y1, i));
	442	if (val < dlo)
	443	{
	444	dlo = val;
	445	lo = i;
	446	}
	447	else if (val > dhi)
	448	{
	449	ds_hi = dhi;
	450	s_hi = hi;
	451	dhi = val;
	452	hi = i;
	453	}
	454	else if (val > ds_hi)
	455	{
	456	ds_hi = val;
	457	s_hi = i;
	458	}
	459	}
	460
	461	/* try reflecting the highest value point */
	462
	463	val = try_corner_move (-1.0, state, hi, xc, f);
	464
	465	if (gsl_finite (val) && val < gsl_vector_get (y1, lo))
	466	{
	467	/* reflected point is lowest, try expansion */
	468
	469	val2 = try_corner_move (-2.0, state, hi, xc2, f);
	470
	471	if (gsl_finite (val2) && val2 < gsl_vector_get (y1, lo))
	472	{
	473	update_point (state, hi, xc2, val2);
	474	}
	475	else
	476	{
	477	update_point (state, hi, xc, val);
	478	}
	479	}
	480	else if (!gsl_finite (val) \|\| val > gsl_vector_get (y1, s_hi))
	481	{
	482	/* reflection does not improve things enough, or we got a
	483	non-finite function value */
	484
	485	if (gsl_finite (val) && val <= gsl_vector_get (y1, hi))
	486	{
	487	/* if trial point is better than highest point, replace
	488	highest point */
	489
	490	update_point (state, hi, xc, val);
	491	}
	492
	493	/* try one-dimensional contraction */
	494
	495	val2 = try_corner_move (0.5, state, hi, xc2, f);
	496
	497	if (gsl_finite (val2) && val2 <= gsl_vector_get (y1, hi))
	498	{
	499	update_point (state, hi, xc2, val2);
	500	}
	501	else
	502	{
	503	/* contract the whole simplex about the best point */
	504
	505	status = contract_by_best (state, lo, xc, f);
	506
	507	if (status != GSL_SUCCESS)
	508	{
	509	GSL_ERROR ("contraction failed", GSL_EFAILED);
	510	}
	511	}
	512	}
	513	else
	514	{
	515	/* trial point is better than second highest point. Replace
	516	highest point by it */
	517
	518	update_point (state, hi, xc, val);
	519	}
	520
	521	/* return lowest point of simplex as x */
	522
	523	lo = gsl_vector_min_index (y1);
	524	gsl_matrix_get_row (x, x1, lo);
	525	*fval = gsl_vector_get (y1, lo);
	526
	527	/* Update simplex size */
	528
	529	{
	530	double S2 = state->S2;
	531
	532	if (S2 > 0)
	533	{
	534	*size = sqrt (S2);
	535	}
	536	else
	537	{
	538	/* recompute if accumulated error has made size invalid */
	539	*size = compute_size (state, state->center);
	540	}
	541	}
	542
	543	return GSL_SUCCESS;
	544	}
	545
	546	static const gsl_multimin_fminimizer_type nmsimplex_type =
	547	{ "nmsimplex2", /* name */
	548	sizeof (nmsimplex_state_t),
	549	&nmsimplex_alloc,
	550	&nmsimplex_set,
	551	&nmsimplex_iterate,
	552	&nmsimplex_free
	553	};
	554
	555	const gsl_multimin_fminimizer_type
	556	* gsl_multimin_fminimizer_nmsimplex2 = &nmsimplex_type;

+56

-38

multimin/test.c less more

34	34	initpt_function initpt, const gsl_multimin_fdfminimizer_type *T);
35	35
36	36	int
37		test_f(const char * desc, gsl_multimin_function *f, initpt_function initpt);
	37	test_f(const char * desc, gsl_multimin_function *f, initpt_function initpt,
	38	const gsl_multimin_fminimizer_type *T);
38	39
39	40	int
40	41	main (void)
41	42	{
42		const gsl_multimin_fdfminimizer_type *fdfminimizers[6];
43		const gsl_multimin_fdfminimizer_type ** T;
44
45	43	gsl_ieee_env_setup ();
46	44
47		fdfminimizers[0] = gsl_multimin_fdfminimizer_steepest_descent;
48		fdfminimizers[1] = gsl_multimin_fdfminimizer_conjugate_pr;
49		fdfminimizers[2] = gsl_multimin_fdfminimizer_conjugate_fr;
50		fdfminimizers[3] = gsl_multimin_fdfminimizer_vector_bfgs;
51		fdfminimizers[4] = gsl_multimin_fdfminimizer_vector_bfgs2;
52		fdfminimizers[5] = 0;
53
54		T = fdfminimizers;
55
56		while (*T != 0)
57		{
58		test_fdf("Roth", &roth, roth_initpt,*T);
59		test_fdf("Wood", &wood, wood_initpt,*T);
60		test_fdf("Rosenbrock", &rosenbrock, rosenbrock_initpt,*T);
61		T++;
62		}
63
64		test_f("Roth", &roth_fmin, roth_initpt);
65		test_f("Wood", &wood_fmin, wood_initpt);
66		test_f("Rosenbrock", &rosenbrock_fmin, rosenbrock_initpt);
67
68		T = fdfminimizers;
69
70		while (*T != 0)
71		{
72		test_fdf("NRoth", &Nroth, roth_initpt,*T);
73		test_fdf("NWood", &Nwood, wood_initpt,*T);
74		test_fdf("NRosenbrock", &Nrosenbrock, rosenbrock_initpt,*T);
75		T++;
76		}
	45	{
	46	const gsl_multimin_fdfminimizer_type *fdfminimizers[6];
	47	const gsl_multimin_fdfminimizer_type ** T;
	48
	49	fdfminimizers[0] = gsl_multimin_fdfminimizer_steepest_descent;
	50	fdfminimizers[1] = gsl_multimin_fdfminimizer_conjugate_pr;
	51	fdfminimizers[2] = gsl_multimin_fdfminimizer_conjugate_fr;
	52	fdfminimizers[3] = gsl_multimin_fdfminimizer_vector_bfgs;
	53	fdfminimizers[4] = gsl_multimin_fdfminimizer_vector_bfgs2;
	54	fdfminimizers[5] = 0;
	55
	56	T = fdfminimizers;
	57
	58	while (*T != 0)
	59	{
	60	test_fdf("Roth", &roth, roth_initpt,*T);
	61	test_fdf("Wood", &wood, wood_initpt,*T);
	62	test_fdf("Rosenbrock", &rosenbrock, rosenbrock_initpt,*T);
	63	T++;
	64	}
	65
	66	T = fdfminimizers;
	67
	68	while (*T != 0)
	69	{
	70	test_fdf("NRoth", &Nroth, roth_initpt,*T);
	71	test_fdf("NWood", &Nwood, wood_initpt,*T);
	72	test_fdf("NRosenbrock", &Nrosenbrock, rosenbrock_initpt,*T);
	73	T++;
	74	}
	75	}
	76
	77
	78	{
	79	const gsl_multimin_fminimizer_type *fminimizers[3];
	80	const gsl_multimin_fminimizer_type ** T;
	81
	82	fminimizers[0] = gsl_multimin_fminimizer_nmsimplex;
	83	fminimizers[1] = gsl_multimin_fminimizer_nmsimplex2;
	84	fminimizers[2] = 0;
	85
	86	T = fminimizers;
	87
	88	while (*T != 0)
	89	{
	90	test_f("Roth", &roth_fmin, roth_initpt,*T);
	91	test_f("Wood", &wood_fmin, wood_initpt,*T);
	92	test_f("Rosenbrock", &rosenbrock_fmin, rosenbrock_initpt,*T);
	93	T++;
	94	}
	95	}
	96
77	97
78	98	exit (gsl_test_summary());
79	99	}

136	156	}
137	157
138	158	int
139		test_f(const char * desc, gsl_multimin_function *f, initpt_function initpt)
	159	test_f(const char * desc, gsl_multimin_function *f, initpt_function initpt,
	160	const gsl_multimin_fminimizer_type *T)
140	161	{
141		/* currently this function tests only nmsimplex */
142
143	162	int status;
144	163	size_t i, iter = 0;
145		const gsl_multimin_fminimizer_type *T = gsl_multimin_fminimizer_nmsimplex;
146	164
147	165	gsl_vector *x = gsl_vector_alloc (f->n);
148	166

+4

-0

multiroots/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-11-09 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* convergence.c (gsl_multiroot_test_delta): accept dxi = 0

+1

-1

multiroots/Makefile.am less more

5	5
6	6	noinst_HEADERS = enorm.c dogleg.c
7	7
8		INCLUDES= -I$(top_builddir)
	8	INCLUDES = -I$(top_srcdir)
9	9
10	10	libgslmultiroots_la_SOURCES = fdjac.c fsolver.c fdfsolver.c convergence.c newton.c gnewton.c dnewton.c broyden.c hybrid.c hybridj.c
11	11

+5

-1

multiroots/Makefile.in less more

139	139	LIBOBJS = @LIBOBJS@
140	140	LIBS = @LIBS@
141	141	LIBTOOL = @LIBTOOL@
	142	LIPO = @LIPO@
142	143	LN_S = @LN_S@
143	144	LTLIBOBJS = @LTLIBOBJS@
144	145	MAINT = @MAINT@

146	147	MKDIR_P = @MKDIR_P@
147	148	NM = @NM@
148	149	NMEDIT = @NMEDIT@
	150	OBJDUMP = @OBJDUMP@
149	151	OBJEXT = @OBJEXT@
	152	OTOOL = @OTOOL@
	153	OTOOL64 = @OTOOL64@
150	154	PACKAGE = @PACKAGE@
151	155	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
152	156	PACKAGE_NAME = @PACKAGE_NAME@

212	216	noinst_LTLIBRARIES = libgslmultiroots.la
213	217	pkginclude_HEADERS = gsl_multiroots.h
214	218	noinst_HEADERS = enorm.c dogleg.c
215		INCLUDES = -I$(top_builddir)
	219	INCLUDES = -I$(top_srcdir)
216	220	libgslmultiroots_la_SOURCES = fdjac.c fsolver.c fdfsolver.c convergence.c newton.c gnewton.c dnewton.c broyden.c hybrid.c hybridj.c
217	221	TESTS = $(check_PROGRAMS)
218	222	test_SOURCES = test.c test_funcs.c test_funcs.h

+10

-9

multiroots/hybrid.c less more

63	63	gsl_vector * x, gsl_vector * f, gsl_vector * dx);
64	64	static int hybrids_set (void vstate, gsl_multiroot_function func,
65	65	gsl_vector * x, gsl_vector * f, gsl_vector * dx);
66		static int set (void vstate, gsl_multiroot_function func, gsl_vector * x,
	66	static int hybrid_set_impl (void vstate, gsl_multiroot_function func, gsl_vector * x,
67	67	gsl_vector * f, gsl_vector * dx, int scale);
68	68	static int hybrid_iterate (void vstate, gsl_multiroot_function func,
69	69	gsl_vector * x, gsl_vector * f, gsl_vector * dx);
70	70	static void hybrid_free (void *vstate);
71		static int iterate (void vstate, gsl_multiroot_function func,
	71	static int hybrid_iterate_impl (void vstate, gsl_multiroot_function func,
72	72	gsl_vector * x, gsl_vector * f, gsl_vector * dx,
73	73	int scale);
74	74

342	342	hybrid_set (void vstate, gsl_multiroot_function func, gsl_vector * x,
343	343	gsl_vector * f, gsl_vector * dx)
344	344	{
345		int status = set (vstate, func, x, f, dx, 0);
	345	int status = hybrid_set_impl (vstate, func, x, f, dx, 0);
346	346	return status;
347	347	}
348	348

350	350	hybrids_set (void vstate, gsl_multiroot_function func, gsl_vector * x,
351	351	gsl_vector * f, gsl_vector * dx)
352	352	{
353		int status = set (vstate, func, x, f, dx, 1);
	353	int status = hybrid_set_impl (vstate, func, x, f, dx, 1);
354	354	return status;
355	355	}
356	356
357	357	static int
358		set (void vstate, gsl_multiroot_function func, gsl_vector * x,
	358	hybrid_set_impl (void vstate, gsl_multiroot_function func, gsl_vector * x,
359	359	gsl_vector * f, gsl_vector * dx, int scale)
360	360	{
361	361	hybrid_state_t state = (hybrid_state_t ) vstate;

420	420	hybrid_iterate (void vstate, gsl_multiroot_function func, gsl_vector * x,
421	421	gsl_vector * f, gsl_vector * dx)
422	422	{
423		int status = iterate (vstate, func, x, f, dx, 0);
	423	int status = hybrid_iterate_impl (vstate, func, x, f, dx, 0);
424	424	return status;
425	425	}
426	426

428	428	hybrids_iterate (void vstate, gsl_multiroot_function func, gsl_vector * x,
429	429	gsl_vector * f, gsl_vector * dx)
430	430	{
431		int status = iterate (vstate, func, x, f, dx, 1);
	431	int status = hybrid_iterate_impl (vstate, func, x, f, dx, 1);
432	432	return status;
433	433	}
434	434
435	435	static int
436		iterate (void vstate, gsl_multiroot_function func, gsl_vector * x,
437		gsl_vector * f, gsl_vector * dx, int scale)
	436	hybrid_iterate_impl (void vstate, gsl_multiroot_function func,
	437	gsl_vector * x,
	438	gsl_vector * f, gsl_vector * dx, int scale)
438	439	{
439	440	hybrid_state_t state = (hybrid_state_t ) vstate;
440	441

+8

-8

multiroots/hybridj.c less more

60	60	static int hybridj_alloc (void *vstate, size_t n);
61	61	static int hybridj_set (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx);
62	62	static int hybridsj_set (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx);
63		static int set (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale);
	63	static int hybridj_set_impl (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale);
64	64	static int hybridj_iterate (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx);
65	65	static void hybridj_free (void *vstate);
66		static int iterate (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale);
	66	static int hybridj_iterate_impl (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale);
67	67
68	68	static int
69	69	hybridj_alloc (void *vstate, size_t n)

310	310	static int
311	311	hybridj_set (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx)
312	312	{
313		int status = set (vstate, fdf, x, f, J, dx, 0);
	313	int status = hybridj_set_impl (vstate, fdf, x, f, J, dx, 0);
314	314	return status ;
315	315	}
316	316
317	317	static int
318	318	hybridsj_set (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx)
319	319	{
320		int status = set (vstate, fdf, x, f, J, dx, 1);
	320	int status = hybridj_set_impl (vstate, fdf, x, f, J, dx, 1);
321	321	return status ;
322	322	}
323	323
324	324	static int
325		set (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale)
	325	hybridj_set_impl (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale)
326	326	{
327	327	hybridj_state_t state = (hybridj_state_t ) vstate;
328	328

364	364	static int
365	365	hybridj_iterate (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx)
366	366	{
367		int status = iterate (vstate, fdf, x, f, J, dx, 0);
	367	int status = hybridj_iterate_impl (vstate, fdf, x, f, J, dx, 0);
368	368	return status;
369	369	}
370	370
371	371	static int
372	372	hybridsj_iterate (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx)
373	373	{
374		int status = iterate (vstate, fdf, x, f, J, dx, 1);
	374	int status = hybridj_iterate_impl (vstate, fdf, x, f, J, dx, 1);
375	375	return status;
376	376	}
377	377
378	378	static int
379		iterate (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale)
	379	hybridj_iterate_impl (void vstate, gsl_multiroot_function_fdf fdf, gsl_vector * x, gsl_vector * f, gsl_matrix * J, gsl_vector * dx, int scale)
380	380	{
381	381	hybridj_state_t state = (hybridj_state_t ) vstate;
382	382

+4

-0

ntuple/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2004-05-30 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* ntuple/test.c (main): choose ratio 1/(i+1.5) to avoid values

+1

-1

ntuple/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_ntuple.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslntuple_la_SOURCES = ntuple.c
7	7

+5

-1

ntuple/Makefile.in less more

132	132	LIBOBJS = @LIBOBJS@
133	133	LIBS = @LIBS@
134	134	LIBTOOL = @LIBTOOL@
	135	LIPO = @LIPO@
135	136	LN_S = @LN_S@
136	137	LTLIBOBJS = @LTLIBOBJS@
137	138	MAINT = @MAINT@

139	140	MKDIR_P = @MKDIR_P@
140	141	NM = @NM@
141	142	NMEDIT = @NMEDIT@
	143	OBJDUMP = @OBJDUMP@
142	144	OBJEXT = @OBJEXT@
	145	OTOOL = @OTOOL@
	146	OTOOL64 = @OTOOL64@
143	147	PACKAGE = @PACKAGE@
144	148	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
145	149	PACKAGE_NAME = @PACKAGE_NAME@

204	208	top_srcdir = @top_srcdir@
205	209	noinst_LTLIBRARIES = libgslntuple.la
206	210	pkginclude_HEADERS = gsl_ntuple.h
207		INCLUDES = -I$(top_builddir)
	211	INCLUDES = -I$(top_srcdir)
208	212	libgslntuple_la_SOURCES = ntuple.c
209	213	TESTS = $(check_PROGRAMS)
210	214	test_SOURCES = test.c

+4

-0

ode-initval/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2008-01-28 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* test.c (test_evolve_negative_h): test evolution with negative

+1

-1

ode-initval/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_odeiv.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslodeiv_la_SOURCES = control.c cstd.c cscal.c evolve.c step.c rk2.c rk2imp.c rk2simp.c rk4.c rk4imp.c rkf45.c rk8pd.c rkck.c bsimp.c gear1.c gear2.c
7	7

+5

-1

ode-initval/Makefile.in less more

137	137	LIBOBJS = @LIBOBJS@
138	138	LIBS = @LIBS@
139	139	LIBTOOL = @LIBTOOL@
	140	LIPO = @LIPO@
140	141	LN_S = @LN_S@
141	142	LTLIBOBJS = @LTLIBOBJS@
142	143	MAINT = @MAINT@

144	145	MKDIR_P = @MKDIR_P@
145	146	NM = @NM@
146	147	NMEDIT = @NMEDIT@
	148	OBJDUMP = @OBJDUMP@
147	149	OBJEXT = @OBJEXT@
	150	OTOOL = @OTOOL@
	151	OTOOL64 = @OTOOL64@
148	152	PACKAGE = @PACKAGE@
149	153	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
150	154	PACKAGE_NAME = @PACKAGE_NAME@

209	213	top_srcdir = @top_srcdir@
210	214	noinst_LTLIBRARIES = libgslodeiv.la
211	215	pkginclude_HEADERS = gsl_odeiv.h
212		INCLUDES = -I$(top_builddir)
	216	INCLUDES = -I$(top_srcdir)
213	217	libgslodeiv_la_SOURCES = control.c cstd.c cscal.c evolve.c step.c rk2.c rk2imp.c rk2simp.c rk4.c rk4imp.c rkf45.c rk8pd.c rkck.c bsimp.c gear1.c gear2.c
214	218	noinst_HEADERS = odeiv_util.h
215	219	TESTS = $(check_PROGRAMS)

+1

-1

ode-initval/TODO less more

8	8	existing workspaces
9	9
10	10	* Implement other stepping methods from well-known packages such as
11		RKSUITE, etc
	11	RKSUITE, VODE, DASSL, etc
12	12
13	13	* Roundoff error needs to be taken into account to prevent the
14	14	step-size being made arbitrarily small

+10

-0

permutation/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* permutation.c: move gsl_permutation_get to inline.c
	3
	4	* gsl_permutation.h: use new inline declarations
	5
	6	* inline.c: handle inline functions separately
	7
	8	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	9
0	10	2003-02-17 Brian Gough <bjg@network-theory.co.uk>
1	11
2	12	* canonical.c (gsl_permutation_canonical_to_linear): fixed bug

+2

-2

permutation/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_permutation.h gsl_permute.h gsl_permute_char.h gsl_permute_complex_double.h gsl_permute_complex_float.h gsl_permute_complex_long_double.h gsl_permute_double.h gsl_permute_float.h gsl_permute_int.h gsl_permute_long.h gsl_permute_long_double.h gsl_permute_short.h gsl_permute_uchar.h gsl_permute_uint.h gsl_permute_ulong.h gsl_permute_ushort.h gsl_permute_vector.h gsl_permute_vector_char.h gsl_permute_vector_complex_double.h gsl_permute_vector_complex_float.h gsl_permute_vector_complex_long_double.h gsl_permute_vector_double.h gsl_permute_vector_float.h gsl_permute_vector_int.h gsl_permute_vector_long.h gsl_permute_vector_long_double.h gsl_permute_vector_short.h gsl_permute_vector_uchar.h gsl_permute_vector_uint.h gsl_permute_vector_ulong.h gsl_permute_vector_ushort.h
3	3
4		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6		libgslpermutation_la_SOURCES = init.c file.c permutation.c permute.c canonical.c
	6	libgslpermutation_la_SOURCES = init.c file.c permutation.c permute.c canonical.c inline.c
7	7
8	8	noinst_HEADERS = permute_source.c
9	9

+7

-3

permutation/Makefile.in less more

46	46	LTLIBRARIES = $(noinst_LTLIBRARIES)
47	47	libgslpermutation_la_LIBADD =
48	48	am_libgslpermutation_la_OBJECTS = init.lo file.lo permutation.lo \
49		permute.lo canonical.lo
	49	permute.lo canonical.lo inline.lo
50	50	libgslpermutation_la_OBJECTS = $(am_libgslpermutation_la_OBJECTS)
51	51	am_test_OBJECTS = test.$(OBJEXT)
52	52	test_OBJECTS = $(am_test_OBJECTS)

133	133	LIBOBJS = @LIBOBJS@
134	134	LIBS = @LIBS@
135	135	LIBTOOL = @LIBTOOL@
	136	LIPO = @LIPO@
136	137	LN_S = @LN_S@
137	138	LTLIBOBJS = @LTLIBOBJS@
138	139	MAINT = @MAINT@

140	141	MKDIR_P = @MKDIR_P@
141	142	NM = @NM@
142	143	NMEDIT = @NMEDIT@
	144	OBJDUMP = @OBJDUMP@
143	145	OBJEXT = @OBJEXT@
	146	OTOOL = @OTOOL@
	147	OTOOL64 = @OTOOL64@
144	148	PACKAGE = @PACKAGE@
145	149	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
146	150	PACKAGE_NAME = @PACKAGE_NAME@

205	209	top_srcdir = @top_srcdir@
206	210	noinst_LTLIBRARIES = libgslpermutation.la
207	211	pkginclude_HEADERS = gsl_permutation.h gsl_permute.h gsl_permute_char.h gsl_permute_complex_double.h gsl_permute_complex_float.h gsl_permute_complex_long_double.h gsl_permute_double.h gsl_permute_float.h gsl_permute_int.h gsl_permute_long.h gsl_permute_long_double.h gsl_permute_short.h gsl_permute_uchar.h gsl_permute_uint.h gsl_permute_ulong.h gsl_permute_ushort.h gsl_permute_vector.h gsl_permute_vector_char.h gsl_permute_vector_complex_double.h gsl_permute_vector_complex_float.h gsl_permute_vector_complex_long_double.h gsl_permute_vector_double.h gsl_permute_vector_float.h gsl_permute_vector_int.h gsl_permute_vector_long.h gsl_permute_vector_long_double.h gsl_permute_vector_short.h gsl_permute_vector_uchar.h gsl_permute_vector_uint.h gsl_permute_vector_ulong.h gsl_permute_vector_ushort.h
208		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
209		libgslpermutation_la_SOURCES = init.c file.c permutation.c permute.c canonical.c
	212	INCLUDES = -I$(top_srcdir)
	213	libgslpermutation_la_SOURCES = init.c file.c permutation.c permute.c canonical.c inline.c
210	214	noinst_HEADERS = permute_source.c
211	215	TESTS = $(check_PROGRAMS)
212	216	test_SOURCES = test.c

+5

-3

permutation/gsl_permutation.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27
27	28	#undef __BEGIN_DECLS

58	59	size_t gsl_permutation_size (const gsl_permutation * p);
59	60	size_t * gsl_permutation_data (const gsl_permutation * p);
60	61
61		size_t gsl_permutation_get (const gsl_permutation * p, const size_t i);
62	62	int gsl_permutation_swap (gsl_permutation * p, const size_t i, const size_t j);
63	63
64	64	int gsl_permutation_valid (const gsl_permutation * p);

75	75	size_t gsl_permutation_linear_cycles (const gsl_permutation * p);
76	76	size_t gsl_permutation_canonical_cycles (const gsl_permutation * q);
77	77
	78	INLINE_DECL size_t gsl_permutation_get (const gsl_permutation * p, const size_t i);
	79
78	80	#ifdef HAVE_INLINE
79	81
80		extern inline
	82	INLINE_FUN
81	83	size_t
82	84	gsl_permutation_get (const gsl_permutation * p, const size_t i)
83	85	{
84	86	#if GSL_RANGE_CHECK
85		if (i >= p->size)
	87	if (GSL_RANGE_COND(i >= p->size))
86	88	{
87	89	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
88	90	}

+27

-0

permutation/inline.c less more

	0	/* permutation/inline.c
	1	*
	2	* Copyright (C) 2008 Brian Gough
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	#include <config.h>
	20	#include <gsl/gsl_errno.h>
	21
	22	/* Compile all the inline functions */
	23
	24	#define COMPILE_INLINE_STATIC
	25	#include "build.h"
	26	#include <gsl/gsl_permutation.h>

+0

-16

permutation/permutation.c less more

31	31	{
32	32	return p->data ;
33	33	}
34
35		#ifndef HIDE_INLINE_STATIC
36		size_t
37		gsl_permutation_get (const gsl_permutation * p, const size_t i)
38		{
39		if (gsl_check_range)
40		{
41		if (i >= p->size) /* size_t is unsigned, can't be negative */
42		{
43		GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
44		}
45		}
46
47		return p->data[i];
48		}
49		#endif
50	34
51	35	int
52	36	gsl_permutation_swap (gsl_permutation * p, const size_t i, const size_t j)

+14

-0

poly/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* gsl_poly.h: use new inline declarations
	3
	4	* inline.c: handle inline functions in separate file
	5
	6	* dd.c: move gsl_poly_dd_eval to inline.c
	7
	8	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	9
	10	2008-04-28 Brian Gough <bjg@network-theory.co.uk>
	11
	12	* dd.c (gsl_poly_dd_taylor): use new descending loop convention
	13
0	14	2007-12-17 Brian Gough <bjg@network-theory.co.uk>
1	15
2	16	* eval.c: added functions for complex polynomials

+1

-1

poly/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_poly.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslpoly_la_SOURCES = dd.c eval.c solve_quadratic.c solve_cubic.c zsolve_quadratic.c zsolve_cubic.c zsolve.c zsolve_init.c
7	7

+5

-1

poly/Makefile.in less more

133	133	LIBOBJS = @LIBOBJS@
134	134	LIBS = @LIBS@
135	135	LIBTOOL = @LIBTOOL@
	136	LIPO = @LIPO@
136	137	LN_S = @LN_S@
137	138	LTLIBOBJS = @LTLIBOBJS@
138	139	MAINT = @MAINT@

140	141	MKDIR_P = @MKDIR_P@
141	142	NM = @NM@
142	143	NMEDIT = @NMEDIT@
	144	OBJDUMP = @OBJDUMP@
143	145	OBJEXT = @OBJEXT@
	146	OTOOL = @OTOOL@
	147	OTOOL64 = @OTOOL64@
144	148	PACKAGE = @PACKAGE@
145	149	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
146	150	PACKAGE_NAME = @PACKAGE_NAME@

205	209	top_srcdir = @top_srcdir@
206	210	noinst_LTLIBRARIES = libgslpoly.la
207	211	pkginclude_HEADERS = gsl_poly.h
208		INCLUDES = -I$(top_builddir)
	212	INCLUDES = -I$(top_srcdir)
209	213	libgslpoly_la_SOURCES = dd.c eval.c solve_quadratic.c solve_cubic.c zsolve_quadratic.c zsolve_cubic.c zsolve.c zsolve_init.c
210	214	noinst_HEADERS = balance.c companion.c qr.c
211	215	TESTS = $(check_PROGRAMS)

+1

-17

poly/dd.c less more

48	48	return GSL_SUCCESS;
49	49	}
50	50
51		#ifndef HIDE_INLINE_STATIC
52		double
53		gsl_poly_dd_eval (const double dd[], const double xa[], const size_t size, const double x)
54		{
55		size_t i;
56		double y = dd[size - 1];
57
58		for (i = size - 1; i--;)
59		{
60		y = dd[i] + (x - xa[i]) * y;
61		}
62
63		return y;
64		}
65		#endif
66
67	51	int
68	52	gsl_poly_dd_taylor (double c[], double xp,
69	53	const double dd[], const double xa[], size_t size,

81	65
82	66	c[0] = dd[0];
83	67
84		for (i = size - 1; i > 0 && i--;)
	68	for (i = size - 1; i-- > 0;)
85	69	{
86	70	w[i] = -w[i + 1] * (xa[size - 2 - i] - xp);
87	71

+5

-48

poly/eval.c less more

18	18	*/
19	19
20	20	#include <config.h>
	21
	22	/* Compile all the inline functions */
	23
	24	#define COMPILE_INLINE_STATIC
	25	#include "build.h"
21	26	#include <gsl/gsl_poly.h>
22
23		/----------- Functions w/ Natural Prototypes -----------/
24
25		/* checked OK [GJ] Tue May 5 12:19:56 MDT 1998 */
26
27		#ifndef HIDE_INLINE_STATIC
28		double
29		gsl_poly_eval(const double c[], const int len, const double x)
30		{
31		int i;
32		double ans = c[len-1];
33		for(i=len-1; i>0; i--) ans = c[i-1] + x * ans;
34		return ans;
35		}
36
37		gsl_complex
38		gsl_poly_complex_eval(const double c[], const int len, const gsl_complex z)
39		{
40		int i;
41		gsl_complex ans;
42		GSL_SET_COMPLEX (&ans, c[len-1], 0.0);
43		for(i=len-1; i>0; i--) {
44		/* The following three lines are equivalent to
45		ans = gsl_complex_add_real (gsl_complex_mul (z, ans), c[i-1]);
46		but faster */
47		double tmp = c[i-1] + GSL_REAL (z) * GSL_REAL (ans) - GSL_IMAG (z) * GSL_IMAG (ans);
48		GSL_SET_IMAG (&ans, GSL_IMAG (z) * GSL_REAL (ans) + GSL_REAL (z) * GSL_IMAG (ans));
49		GSL_SET_REAL (&ans, tmp);
50		}
51		return ans;
52		}
53
54		gsl_complex
55		gsl_complex_poly_complex_eval(const gsl_complex c[], const int len, const gsl_complex z)
56		{
57		int i;
58		gsl_complex ans = c[len-1];
59		for(i=len-1; i>0; i--) {
60		/* The following three lines are equivalent to
61		ans = gsl_complex_add (c[i-1], gsl_complex_mul (z, ans));
62		but faster */
63		double tmp = GSL_REAL (c[i-1]) + GSL_REAL (z) * GSL_REAL (ans) - GSL_IMAG (z) * GSL_IMAG (ans);
64		GSL_SET_IMAG (&ans, GSL_IMAG (c[i-1]) + GSL_IMAG (z) * GSL_REAL (ans) + GSL_REAL (z) * GSL_IMAG (ans));
65		GSL_SET_REAL (&ans, tmp);
66		}
67		return ans;
68		}
69		#endif

+9

-9

poly/gsl_poly.h less more

20	20	#define __GSL_POLY_H__
21	21
22	22	#include <stdlib.h>
	23	#include <gsl/gsl_inline.h>
23	24	#include <gsl/gsl_complex.h>
24	25
25	26	#undef __BEGIN_DECLS

43	44	*/
44	45
45	46	/* real polynomial, real x */
46		double gsl_poly_eval(const double c[], const int len, const double x);
	47	INLINE_DECL double gsl_poly_eval(const double c[], const int len, const double x);
47	48
48	49	/* real polynomial, complex x */
49		gsl_complex gsl_poly_complex_eval (const double c [], const int len, const gsl_complex z);
	50	INLINE_DECL gsl_complex gsl_poly_complex_eval (const double c [], const int len, const gsl_complex z);
50	51
51	52	/* complex polynomial, complex x */
52		gsl_complex gsl_complex_poly_complex_eval (const gsl_complex c [], const int len, const gsl_complex z);
53
	53	INLINE_DECL gsl_complex gsl_complex_poly_complex_eval (const gsl_complex c [], const int len, const gsl_complex z);
54	54
55	55	#ifdef HAVE_INLINE
56		extern inline
	56	INLINE_FUN
57	57	double
58	58	gsl_poly_eval(const double c[], const int len, const double x)
59	59	{

63	63	return ans;
64	64	}
65	65
66		extern inline
	66	INLINE_FUN
67	67	gsl_complex
68	68	gsl_poly_complex_eval(const double c[], const int len, const gsl_complex z)
69	69	{

81	81	return ans;
82	82	}
83	83
84		extern inline
	84	INLINE_FUN
85	85	gsl_complex
86	86	gsl_complex_poly_complex_eval(const gsl_complex c[], const int len, const gsl_complex z)
87	87	{

105	105	gsl_poly_dd_init (double dd[], const double x[], const double y[],
106	106	size_t size);
107	107
108		double
	108	INLINE_DECL double
109	109	gsl_poly_dd_eval (const double dd[], const double xa[], const size_t size, const double x);
110	110
111	111	#ifdef HAVE_INLINE
112		extern inline
	112	INLINE_FUN
113	113	double
114	114	gsl_poly_dd_eval(const double dd[], const double xa[], const size_t size, const double x)
115	115	{

+10

-0

qrng/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* qrng.c: moved gsl_qrng_get to inline.c
	3
	4	* gsl_qrng.h (gsl_qrng_get): new inline declaration
	5
	6	* inline.c: handle inline functions separately
	7
	8	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	9
0	10	2008-03-17 Brian Gough <bjg@network-theory.co.uk>
1	11
2	12	* reversehalton.c (reversehalton_init): removed unused variable i

+2

-2

qrng/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_qrng.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6		libgslqrng_la_SOURCES = gsl_qrng.h qrng.c niederreiter-2.c sobol.c halton.c reversehalton.c
	6	libgslqrng_la_SOURCES = gsl_qrng.h qrng.c niederreiter-2.c sobol.c halton.c reversehalton.c inline.c
7	7
8	8	TESTS = $(check_PROGRAMS)
9	9	check_PROGRAMS = test

+7

-3

qrng/Makefile.in less more

46	46	LTLIBRARIES = $(noinst_LTLIBRARIES)
47	47	libgslqrng_la_LIBADD =
48	48	am_libgslqrng_la_OBJECTS = qrng.lo niederreiter-2.lo sobol.lo \
49		halton.lo reversehalton.lo
	49	halton.lo reversehalton.lo inline.lo
50	50	libgslqrng_la_OBJECTS = $(am_libgslqrng_la_OBJECTS)
51	51	am_test_OBJECTS = test.$(OBJEXT)
52	52	test_OBJECTS = $(am_test_OBJECTS)

132	132	LIBOBJS = @LIBOBJS@
133	133	LIBS = @LIBS@
134	134	LIBTOOL = @LIBTOOL@
	135	LIPO = @LIPO@
135	136	LN_S = @LN_S@
136	137	LTLIBOBJS = @LTLIBOBJS@
137	138	MAINT = @MAINT@

139	140	MKDIR_P = @MKDIR_P@
140	141	NM = @NM@
141	142	NMEDIT = @NMEDIT@
	143	OBJDUMP = @OBJDUMP@
142	144	OBJEXT = @OBJEXT@
	145	OTOOL = @OTOOL@
	146	OTOOL64 = @OTOOL64@
143	147	PACKAGE = @PACKAGE@
144	148	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
145	149	PACKAGE_NAME = @PACKAGE_NAME@

204	208	top_srcdir = @top_srcdir@
205	209	noinst_LTLIBRARIES = libgslqrng.la
206	210	pkginclude_HEADERS = gsl_qrng.h
207		INCLUDES = -I$(top_builddir)
208		libgslqrng_la_SOURCES = gsl_qrng.h qrng.c niederreiter-2.c sobol.c halton.c reversehalton.c
	211	INCLUDES = -I$(top_srcdir)
	212	libgslqrng_la_SOURCES = gsl_qrng.h qrng.c niederreiter-2.c sobol.c halton.c reversehalton.c inline.c
209	213	TESTS = $(check_PROGRAMS)
210	214	test_SOURCES = test.c
211	215	test_LDADD = libgslqrng.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la

+3

-4

qrng/gsl_qrng.h less more

5	5	#include <stdlib.h>
6	6	#include <gsl/gsl_types.h>
7	7	#include <gsl/gsl_errno.h>
	8	#include <gsl/gsl_inline.h>
8	9
9	10	#undef __BEGIN_DECLS
10	11	#undef __END_DECLS

92	93
93	94
94	95	/* Retrieve next vector in sequence. */
95		int gsl_qrng_get (const gsl_qrng * q, double x[]);
96
	96	INLINE_DECL int gsl_qrng_get (const gsl_qrng * q, double x[]);
97	97
98	98	#ifdef HAVE_INLINE
99		extern inline int gsl_qrng_get (const gsl_qrng * q, double x[]);
100		extern inline int gsl_qrng_get (const gsl_qrng * q, double x[])
	99	INLINE_FUN int gsl_qrng_get (const gsl_qrng * q, double x[])
101	100	{
102	101	return (q->type->get) (q->state, q->dimension, x);
103	102	}

+13

-0

qrng/inline.c less more

	0	/* Author: G. Jungman
	1	*/
	2	#include <config.h>
	3	#include <stdlib.h>
	4	#include <string.h>
	5	#include <gsl/gsl_errno.h>
	6
	7	/* Compile all the inline functions */
	8
	9	#define COMPILE_INLINE_STATIC
	10	#include "build.h"
	11	#include <gsl/gsl_qrng.h>
	12

+0

-8

qrng/qrng.c less more

87	87	return r;
88	88	}
89	89
90		#ifndef HIDE_INLINE_STATIC
91		int
92		gsl_qrng_get (const gsl_qrng * q, double x[])
93		{
94		return (q->type->get) (q->state, q->dimension, x);
95		}
96		#endif
97
98	90	const char *
99	91	gsl_qrng_name (const gsl_qrng * q)
100	92	{

+10

-0

randist/ChangeLog less more

	0	2008-11-30 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* test.c (test_gamma_vlarge): added test for a >= UINT_MAX.
	3
	4	* gamma.c (gsl_ran_gamma_knuth): handle the case a >= UINT_MAX.
	5
	6	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	7
	8	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	9
0	10	2008-02-09 Brian Gough <bjg@network-theory.co.uk>
1	11
2	12	* gausszig.c (gsl_ran_gaussian_ziggurat): handle different

+1

-1

randist/Makefile.am less more

1	1
2	2	pkginclude_HEADERS= gsl_randist.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslrandist_la_SOURCES = bernoulli.c beta.c bigauss.c binomial.c cauchy.c chisq.c dirichlet.c discrete.c erlang.c exponential.c exppow.c fdist.c flat.c gamma.c gauss.c gausszig.c gausstail.c geometric.c gumbel.c hyperg.c laplace.c levy.c logarithmic.c logistic.c lognormal.c multinomial.c nbinomial.c pareto.c pascal.c poisson.c rayleigh.c shuffle.c sphere.c tdist.c weibull.c landau.c binomial_tpe.c
7	7

+5

-1

randist/Makefile.in less more

141	141	LIBOBJS = @LIBOBJS@
142	142	LIBS = @LIBS@
143	143	LIBTOOL = @LIBTOOL@
	144	LIPO = @LIPO@
144	145	LN_S = @LN_S@
145	146	LTLIBOBJS = @LTLIBOBJS@
146	147	MAINT = @MAINT@

148	149	MKDIR_P = @MKDIR_P@
149	150	NM = @NM@
150	151	NMEDIT = @NMEDIT@
	152	OBJDUMP = @OBJDUMP@
151	153	OBJEXT = @OBJEXT@
	154	OTOOL = @OTOOL@
	155	OTOOL64 = @OTOOL64@
152	156	PACKAGE = @PACKAGE@
153	157	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
154	158	PACKAGE_NAME = @PACKAGE_NAME@

213	217	top_srcdir = @top_srcdir@
214	218	noinst_LTLIBRARIES = libgslrandist.la
215	219	pkginclude_HEADERS = gsl_randist.h
216		INCLUDES = -I$(top_builddir)
	220	INCLUDES = -I$(top_srcdir)
217	221	libgslrandist_la_SOURCES = bernoulli.c beta.c bigauss.c binomial.c cauchy.c chisq.c dirichlet.c discrete.c erlang.c exponential.c exppow.c fdist.c flat.c gamma.c gauss.c gausszig.c gausstail.c geometric.c gumbel.c hyperg.c laplace.c levy.c logarithmic.c logistic.c lognormal.c multinomial.c nbinomial.c pareto.c pascal.c poisson.c rayleigh.c shuffle.c sphere.c tdist.c weibull.c landau.c binomial_tpe.c
218	222	TESTS = $(check_PROGRAMS)
219	223	test_SOURCES = test.c

+5

-1

randist/gamma.c less more

42	42	/* assume a > 0 */
43	43	unsigned int na = floor (a);
44	44
45		if (a == na)
	45	if(a >= UINT_MAX)
	46	{
	47	return b * (gamma_large (r, floor (a)) + gamma_frac (r, a - floor (a)));
	48	}
	49	else if (a == na)
46	50	{
47	51	return b * gsl_ran_gamma_int (r, na);
48	52	}

+43

-1

randist/test.c less more

109	109	double test_gamma_int_pdf (double x);
110	110	double test_gamma_large (void);
111	111	double test_gamma_large_pdf (double x);
	112	double test_gamma_vlarge (void);
	113	double test_gamma_vlarge_pdf (double x);
112	114	double test_gamma_small (void);
113	115	double test_gamma_small_pdf (double x);
114	116	double test_gamma_mt (void);

121	123	double test_gamma_mt_large_pdf (double x);
122	124	double test_gamma_mt_small (void);
123	125	double test_gamma_mt_small_pdf (double x);
	126	double test_gamma_knuth_vlarge (void);
	127	double test_gamma_knuth_vlarge_pdf (double x);
124	128	double test_gaussian (void);
125	129	double test_gaussian_pdf (double x);
126	130	double test_gaussian_ratio_method (void);

297	301	testPDF (FUNC2 (gamma1));
298	302	testPDF (FUNC2 (gamma_int));
299	303	testPDF (FUNC2 (gamma_large));
	304	testPDF (FUNC2 (gamma_vlarge));
	305	testPDF (FUNC2 (gamma_knuth_vlarge));
300	306	testPDF (FUNC2 (gamma_small));
301	307	testPDF (FUNC2 (gamma_mt));
302	308	testPDF (FUNC2 (gamma_mt1));

545	551	for (i = 0; i < N; i++)
546	552	{
547	553	double r = f ();
548
549	554	total += r;
550	555
551	556	if (r < b && r > a)

1306	1311	return gsl_ran_gamma_pdf (x, 0.92, 2.17);
1307	1312	}
1308	1313
	1314	double
	1315	test_gamma_vlarge (void)
	1316	{
	1317	/* Scale the distribution to get it into the range [-5,5] */
	1318	double c = 2.71828181565;
	1319	double b = 6.32899304917e-10;
	1320	double d = 1e4;
	1321	return (gsl_ran_gamma (r_global, 4294967296.0, b) - c) * d;
	1322	}
	1323
	1324	double
	1325	test_gamma_vlarge_pdf (double x)
	1326	{
	1327	double c = 2.71828181565;
	1328	double b = 6.32899304917e-10;
	1329	double d = 1e4;
	1330	return gsl_ran_gamma_pdf ((x / d) + c, 4294967296.0, b) / d;
	1331	}
1309	1332
1310	1333	double
1311	1334	test_gamma_mt (void)

1370	1393	return gsl_ran_gamma_pdf (x, 0.92, 2.17);
1371	1394	}
1372	1395
	1396
	1397	double
	1398	test_gamma_knuth_vlarge (void)
	1399	{
	1400	/* Scale the distribution to get it into the range [-5,5] */
	1401	double c = 2.71828181565;
	1402	double b = 6.32899304917e-10;
	1403	double d = 1e4;
	1404	return (gsl_ran_gamma_knuth (r_global, 4294967296.0, b) - c) * d;
	1405	}
	1406
	1407	double
	1408	test_gamma_knuth_vlarge_pdf (double x)
	1409	{
	1410	double c = 2.71828181565;
	1411	double b = 6.32899304917e-10;
	1412	double d = 1e4;
	1413	return gsl_ran_gamma_pdf ((x / d) + c, 4294967296.0, b) / d;
	1414	}
1373	1415
1374	1416	double
1375	1417	test_gaussian (void)

+14

-0

rng/ChangeLog less more

	0	2008-10-13 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* file.c: added (char *) to allow compilation with C++ compiler
	3
	4	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	5
	6	* rng.c: moved inline functions to inline.c
	7
	8	* gsl_rng.h: use new inline declarations
	9
	10	* inline.c: handle inline functions separately
	11
	12	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	13
0	14	2007-01-28 Brian Gough <bjg@network-theory.co.uk>
1	15
2	16	* knuthran2002.c: added revised version from 9th printing

+2

-2

rng/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_rng.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6		libgslrng_la_SOURCES = borosh13.c cmrg.c coveyou.c default.c file.c fishman18.c fishman20.c fishman2x.c gfsr4.c knuthran2.c knuthran.c knuthran2002.c lecuyer21.c minstd.c mrg.c mt.c r250.c ran0.c ran1.c ran2.c ran3.c rand48.c rand.c random.c randu.c ranf.c ranlux.c ranlxd.c ranlxs.c ranmar.c rng.c slatec.c taus.c taus113.c transputer.c tt.c types.c uni32.c uni.c vax.c waterman14.c zuf.c
	6	libgslrng_la_SOURCES = borosh13.c cmrg.c coveyou.c default.c file.c fishman18.c fishman20.c fishman2x.c gfsr4.c knuthran2.c knuthran.c knuthran2002.c lecuyer21.c minstd.c mrg.c mt.c r250.c ran0.c ran1.c ran2.c ran3.c rand48.c rand.c random.c randu.c ranf.c ranlux.c ranlxd.c ranlxs.c ranmar.c rng.c slatec.c taus.c taus113.c transputer.c tt.c types.c uni32.c uni.c vax.c waterman14.c zuf.c inline.c
7	7
8	8	CLEANFILES = test.dat
9	9

+7

-3

rng/Makefile.in less more

52	52	rand48.lo rand.lo random.lo randu.lo ranf.lo ranlux.lo \
53	53	ranlxd.lo ranlxs.lo ranmar.lo rng.lo slatec.lo taus.lo \
54	54	taus113.lo transputer.lo tt.lo types.lo uni32.lo uni.lo vax.lo \
55		waterman14.lo zuf.lo
	55	waterman14.lo zuf.lo inline.lo
56	56	libgslrng_la_OBJECTS = $(am_libgslrng_la_OBJECTS)
57	57	am_test_OBJECTS = test.$(OBJEXT)
58	58	test_OBJECTS = $(am_test_OBJECTS)

138	138	LIBOBJS = @LIBOBJS@
139	139	LIBS = @LIBS@
140	140	LIBTOOL = @LIBTOOL@
	141	LIPO = @LIPO@
141	142	LN_S = @LN_S@
142	143	LTLIBOBJS = @LTLIBOBJS@
143	144	MAINT = @MAINT@

145	146	MKDIR_P = @MKDIR_P@
146	147	NM = @NM@
147	148	NMEDIT = @NMEDIT@
	149	OBJDUMP = @OBJDUMP@
148	150	OBJEXT = @OBJEXT@
	151	OTOOL = @OTOOL@
	152	OTOOL64 = @OTOOL64@
149	153	PACKAGE = @PACKAGE@
150	154	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
151	155	PACKAGE_NAME = @PACKAGE_NAME@

210	214	top_srcdir = @top_srcdir@
211	215	noinst_LTLIBRARIES = libgslrng.la
212	216	pkginclude_HEADERS = gsl_rng.h
213		INCLUDES = -I$(top_builddir)
214		libgslrng_la_SOURCES = borosh13.c cmrg.c coveyou.c default.c file.c fishman18.c fishman20.c fishman2x.c gfsr4.c knuthran2.c knuthran.c knuthran2002.c lecuyer21.c minstd.c mrg.c mt.c r250.c ran0.c ran1.c ran2.c ran3.c rand48.c rand.c random.c randu.c ranf.c ranlux.c ranlxd.c ranlxs.c ranmar.c rng.c slatec.c taus.c taus113.c transputer.c tt.c types.c uni32.c uni.c vax.c waterman14.c zuf.c
	217	INCLUDES = -I$(top_srcdir)
	218	libgslrng_la_SOURCES = borosh13.c cmrg.c coveyou.c default.c file.c fishman18.c fishman20.c fishman2x.c gfsr4.c knuthran2.c knuthran.c knuthran2002.c lecuyer21.c minstd.c mrg.c mt.c r250.c ran0.c ran1.c ran2.c ran3.c rand48.c rand.c random.c randu.c ranf.c ranlux.c ranlxd.c ranlxs.c ranmar.c rng.c slatec.c taus.c taus113.c transputer.c tt.c types.c uni32.c uni.c vax.c waterman14.c zuf.c inline.c
215	219	CLEANFILES = test.dat
216	220	noinst_HEADERS = schrage.c
217	221	test_SOURCES = test.c

+2

-2

rng/file.c less more

26	26	{
27	27	size_t n = r->type->size ;
28	28
29		char * state = r->state;
	29	char * state = (char *)r->state;
30	30
31	31	size_t items = fread (state, 1, n, stream);
32	32

43	43	{
44	44	size_t n = r->type->size ;
45	45
46		char * state = r->state;
	46	char * state = (char *)r->state;
47	47
48	48	size_t items = fwrite (state, 1, n, stream);
49	49

+16

-17

rng/gsl_rng.h less more

21	21	#include <stdlib.h>
22	22	#include <gsl/gsl_types.h>
23	23	#include <gsl/gsl_errno.h>
	24	#include <gsl/gsl_inline.h>
24	25
25	26	#undef __BEGIN_DECLS
26	27	#undef __END_DECLS

146	147
147	148	const gsl_rng_type * gsl_rng_env_setup (void);
148	149
149		unsigned long int gsl_rng_get (const gsl_rng * r);
150		double gsl_rng_uniform (const gsl_rng * r);
151		double gsl_rng_uniform_pos (const gsl_rng * r);
152		unsigned long int gsl_rng_uniform_int (const gsl_rng * r, unsigned long int n);
153
	150	INLINE_DECL unsigned long int gsl_rng_get (const gsl_rng * r);
	151	INLINE_DECL double gsl_rng_uniform (const gsl_rng * r);
	152	INLINE_DECL double gsl_rng_uniform_pos (const gsl_rng * r);
	153	INLINE_DECL unsigned long int gsl_rng_uniform_int (const gsl_rng * r, unsigned long int n);
154	154
155	155	#ifdef HAVE_INLINE
156		extern inline unsigned long int gsl_rng_get (const gsl_rng * r);
157
158		extern inline unsigned long int
	156
	157	INLINE_FUN unsigned long int
159	158	gsl_rng_get (const gsl_rng * r)
160	159	{
161	160	return (r->type->get) (r->state);
162	161	}
163	162
164		extern inline double gsl_rng_uniform (const gsl_rng * r);
165
166		extern inline double
	163	INLINE_FUN double
167	164	gsl_rng_uniform (const gsl_rng * r)
168	165	{
169	166	return (r->type->get_double) (r->state);
170	167	}
171	168
172		extern inline double gsl_rng_uniform_pos (const gsl_rng * r);
173
174		extern inline double
	169	INLINE_FUN double
175	170	gsl_rng_uniform_pos (const gsl_rng * r)
176	171	{
177	172	double x ;

184	179	return x ;
185	180	}
186	181
187		extern inline unsigned long int gsl_rng_uniform_int (const gsl_rng * r, unsigned long int n);
188
189		extern inline unsigned long int
	182	/* Note: to avoid integer overflow in (range+1) we work with scale =
	183	range/n = (max-min)/n rather than scale=(max-min+1)/n, this reduces
	184	efficiency slightly but avoids having to check for the out of range
	185	value. Note that range is typically O(2^32) so the addition of 1
	186	is negligible in most usage. */
	187
	188	INLINE_FUN unsigned long int
190	189	gsl_rng_uniform_int (const gsl_rng * r, unsigned long int n)
191	190	{
192	191	unsigned long int offset = r->type->min;

+30

-0

rng/inline.c less more

	0	/* rng/inline.c
	1	*
	2	* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 James Theiler, Brian Gough
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	#include <config.h>
	20	#include <stdlib.h>
	21	#include <stdio.h>
	22	#include <string.h>
	23	#include <gsl/gsl_errno.h>
	24
	25	/* Compile all the inline functions */
	26
	27	#define COMPILE_INLINE_STATIC
	28	#include "build.h"
	29	#include <gsl/gsl_rng.h>

+0

-58

rng/rng.c less more

99	99	(r->type->set) (r->state, seed);
100	100	}
101	101
102		#ifndef HIDE_INLINE_STATIC
103		unsigned long int
104		gsl_rng_get (const gsl_rng * r)
105		{
106		return (r->type->get) (r->state);
107		}
108
109		double
110		gsl_rng_uniform (const gsl_rng * r)
111		{
112		return (r->type->get_double) (r->state);
113		}
114
115		double
116		gsl_rng_uniform_pos (const gsl_rng * r)
117		{
118		double x ;
119		do
120		{
121		x = (r->type->get_double) (r->state) ;
122		}
123		while (x == 0) ;
124
125		return x ;
126		}
127
128		/* Note: to avoid integer overflow in (range+1) we work with scale =
129		range/n = (max-min)/n rather than scale=(max-min+1)/n, this reduces
130		efficiency slightly but avoids having to check for the out of range
131		value. Note that range is typically O(2^32) so the addition of 1
132		is negligible in most usage. */
133
134		unsigned long int
135		gsl_rng_uniform_int (const gsl_rng * r, unsigned long int n)
136		{
137		unsigned long int offset = r->type->min;
138		unsigned long int range = r->type->max - offset;
139		unsigned long int scale;
140		unsigned long int k;
141
142		if (n > range \|\| n == 0)
143		{
144		GSL_ERROR_VAL ("invalid n, either 0 or exceeds maximum value of generator",
145		GSL_EINVAL, 0) ;
146		}
147
148		scale = range / n;
149
150		do
151		{
152		k = (((r->type->get) (r->state)) - offset) / scale;
153		}
154		while (k >= n);
155
156		return k;
157		}
158		#endif
159
160	102	unsigned long int
161	103	gsl_rng_max (const gsl_rng * r)
162	104	{

+4

-0

roots/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-07-30 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* newton.c (newton_iterate): use gsl_finite instead of finite

+1

-1

roots/Makefile.am less more

5	5
6	6	noinst_HEADERS = roots.h
7	7
8		INCLUDES= -I$(top_builddir)
	8	INCLUDES = -I$(top_srcdir)
9	9
10	10	libgslroots_la_SOURCES = bisection.c brent.c falsepos.c newton.c secant.c steffenson.c convergence.c fsolver.c fdfsolver.c
11	11

+5

-1

roots/Makefile.in less more

135	135	LIBOBJS = @LIBOBJS@
136	136	LIBS = @LIBS@
137	137	LIBTOOL = @LIBTOOL@
	138	LIPO = @LIPO@
138	139	LN_S = @LN_S@
139	140	LTLIBOBJS = @LTLIBOBJS@
140	141	MAINT = @MAINT@

142	143	MKDIR_P = @MKDIR_P@
143	144	NM = @NM@
144	145	NMEDIT = @NMEDIT@
	146	OBJDUMP = @OBJDUMP@
145	147	OBJEXT = @OBJEXT@
	148	OTOOL = @OTOOL@
	149	OTOOL64 = @OTOOL64@
146	150	PACKAGE = @PACKAGE@
147	151	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
148	152	PACKAGE_NAME = @PACKAGE_NAME@

208	212	noinst_LTLIBRARIES = libgslroots.la
209	213	pkginclude_HEADERS = gsl_roots.h
210	214	noinst_HEADERS = roots.h
211		INCLUDES = -I$(top_builddir)
	215	INCLUDES = -I$(top_srcdir)
212	216	libgslroots_la_SOURCES = bisection.c brent.c falsepos.c newton.c secant.c steffenson.c convergence.c fsolver.c fdfsolver.c
213	217	TESTS = $(check_PROGRAMS)
214	218	test_SOURCES = test.c test_funcs.c test.h

+4

-0

siman/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-05-30 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* siman.c (boltzmann): moved safe_exp into boltzmann

+1

-1

siman/Makefile.am less more

17	17	libgslsiman_la_SOURCES = siman.c
18	18	pkginclude_HEADERS = gsl_siman.h
19	19
20		INCLUDES= -I$(top_builddir)
	20	INCLUDES = -I$(top_srcdir)

+5

-1

siman/Makefile.in less more

141	141	LIBOBJS = @LIBOBJS@
142	142	LIBS = @LIBS@
143	143	LIBTOOL = @LIBTOOL@
	144	LIPO = @LIPO@
144	145	LN_S = @LN_S@
145	146	LTLIBOBJS = @LTLIBOBJS@
146	147	MAINT = @MAINT@

148	149	MKDIR_P = @MKDIR_P@
149	150	NM = @NM@
150	151	NMEDIT = @NMEDIT@
	152	OBJDUMP = @OBJDUMP@
151	153	OBJEXT = @OBJEXT@
	154	OTOOL = @OTOOL@
	155	OTOOL64 = @OTOOL64@
152	156	PACKAGE = @PACKAGE@
153	157	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
154	158	PACKAGE_NAME = @PACKAGE_NAME@

221	225	CLEANFILES = siman_test.out
222	226	libgslsiman_la_SOURCES = siman.c
223	227	pkginclude_HEADERS = gsl_siman.h
224		INCLUDES = -I$(top_builddir)
	228	INCLUDES = -I$(top_srcdir)
225	229	all: all-am
226	230
227	231	.SUFFIXES:

+4

-0

sort/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2008-02-09 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* test_source.c: prevent signed overflow in tests

+1

-1

sort/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_heapsort.h gsl_sort.h gsl_sort_char.h gsl_sort_double.h gsl_sort_float.h gsl_sort_int.h gsl_sort_long.h gsl_sort_long_double.h gsl_sort_short.h gsl_sort_uchar.h gsl_sort_uint.h gsl_sort_ulong.h gsl_sort_ushort.h gsl_sort_vector.h gsl_sort_vector_char.h gsl_sort_vector_double.h gsl_sort_vector_float.h gsl_sort_vector_int.h gsl_sort_vector_long.h gsl_sort_vector_long_double.h gsl_sort_vector_short.h gsl_sort_vector_uchar.h gsl_sort_vector_uint.h gsl_sort_vector_ulong.h gsl_sort_vector_ushort.h
3	3
4		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslsort_la_SOURCES = sort.c sortind.c sortvec.c sortvecind.c subset.c subsetind.c
7	7	noinst_HEADERS = sortvec_source.c sortvecind_source.c subset_source.c subsetind_source.c test_source.c test_heapsort.c

+5

-1

sort/Makefile.in less more

133	133	LIBOBJS = @LIBOBJS@
134	134	LIBS = @LIBS@
135	135	LIBTOOL = @LIBTOOL@
	136	LIPO = @LIPO@
136	137	LN_S = @LN_S@
137	138	LTLIBOBJS = @LTLIBOBJS@
138	139	MAINT = @MAINT@

140	141	MKDIR_P = @MKDIR_P@
141	142	NM = @NM@
142	143	NMEDIT = @NMEDIT@
	144	OBJDUMP = @OBJDUMP@
143	145	OBJEXT = @OBJEXT@
	146	OTOOL = @OTOOL@
	147	OTOOL64 = @OTOOL64@
144	148	PACKAGE = @PACKAGE@
145	149	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
146	150	PACKAGE_NAME = @PACKAGE_NAME@

205	209	top_srcdir = @top_srcdir@
206	210	noinst_LTLIBRARIES = libgslsort.la
207	211	pkginclude_HEADERS = gsl_heapsort.h gsl_sort.h gsl_sort_char.h gsl_sort_double.h gsl_sort_float.h gsl_sort_int.h gsl_sort_long.h gsl_sort_long_double.h gsl_sort_short.h gsl_sort_uchar.h gsl_sort_uint.h gsl_sort_ulong.h gsl_sort_ushort.h gsl_sort_vector.h gsl_sort_vector_char.h gsl_sort_vector_double.h gsl_sort_vector_float.h gsl_sort_vector_int.h gsl_sort_vector_long.h gsl_sort_vector_long_double.h gsl_sort_vector_short.h gsl_sort_vector_uchar.h gsl_sort_vector_uint.h gsl_sort_vector_ulong.h gsl_sort_vector_ushort.h
208		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
	212	INCLUDES = -I$(top_srcdir)
209	213	libgslsort_la_SOURCES = sort.c sortind.c sortvec.c sortvecind.c subset.c subsetind.c
210	214	noinst_HEADERS = sortvec_source.c sortvecind_source.c subset_source.c subsetind_source.c test_source.c test_heapsort.c
211	215	TESTS = $(check_PROGRAMS)

+3

-3

sort/test_source.c less more

42	42	TYPE (gsl_vector) * data = FUNCTION (gsl_vector, alloc_from_block) (b2, 0, N, stride);
43	43	TYPE (gsl_vector) * data2 = FUNCTION (gsl_vector, alloc_from_block) (b3, 0, N, stride);
44	44
45		BASE * small = malloc(k * sizeof(BASE));
46		BASE * large = malloc(k * sizeof(BASE));
47		size_t * index = malloc(k * sizeof(size_t));
	45	BASE * small = (BASE )malloc(k sizeof(BASE));
	46	BASE * large = (BASE )malloc(k sizeof(BASE));
	47	size_t * index = (size_t )malloc(k sizeof(size_t));
48	48
49	49	gsl_permutation *p = gsl_permutation_alloc (N);
50	50

+31

-0

specfunc/ChangeLog less more

	0	2008-12-04 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* gamma_inc.c (gamma_inc_D): propagate cancellation error
	3	in (x-a)/x for x close to a
	4
	5	2008-12-03 Brian Gough <bjg@network-theory.co.uk>
	6
	7	* exp.c (exprel_n_CF): changed N to double, to allow non-integer
	8	usage for gamma_inc, double error factor to allow for two
	9	parameters in recurrence.
	10	(gsl_sf_exprel_n_CF_e): exported function to allow calls to
	11	exprel_n_CF
	12
	13	* gamma_inc.c (gamma_inc_P_series): improved convergence condition
	14	using estimate of the remainder of the series, added continued
	15	fraction as a fallback, increased nmax to 10000
	16
	17	2008-08-26 Brian Gough <bjg@network-theory.co.uk>
	18
	19	* ellint.c (gsl_sf_ellint_Kcomp_e): corrected taylor expansion for
	20	k close to 1.
	21
	22	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	23
	24	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	25
	26	2008-06-27 Brian Gough <bjg@network-theory.co.uk>
	27
	28	* legendre_poly.c (gsl_sf_legendre_array_size): removed inline
	29	version of this function in gsl_sf_legendre.h
	30
0	31	2008-03-17 Brian Gough <bjg@network-theory.co.uk>
1	32
2	33	* hyperg_2F1.c (gsl_sf_hyperg_2F1_e): replace duplicate error

+1

-1

specfunc/Makefile.am less more

3	3
4	4	noinst_HEADERS = bessel_amp_phase.h bessel_olver.h bessel_temme.h bessel.h hyperg.h legendre.h eval.h chebyshev.h cheb_eval.c cheb_eval_mode.c check.h error.h
5	5
6		INCLUDES= -I$(top_builddir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	libgslspecfunc_la_SOURCES = airy.c airy_der.c airy_zero.c atanint.c bessel.c bessel.h bessel_I0.c bessel_I1.c bessel_In.c bessel_Inu.c bessel_J0.c bessel_J1.c bessel_Jn.c bessel_Jnu.c bessel_K0.c bessel_K1.c bessel_Kn.c bessel_Knu.c bessel_Y0.c bessel_Y1.c bessel_Yn.c bessel_Ynu.c bessel_amp_phase.c bessel_amp_phase.h bessel_i.c bessel_j.c bessel_k.c bessel_olver.c bessel_temme.c bessel_y.c bessel_zero.c bessel_sequence.c beta.c beta_inc.c clausen.c coulomb.c coupling.c coulomb_bound.c dawson.c debye.c dilog.c elementary.c ellint.c elljac.c erfc.c exp.c expint.c expint3.c fermi_dirac.c gegenbauer.c gamma.c gamma_inc.c hyperg_0F1.c hyperg_2F0.c hyperg_1F1.c hyperg_2F1.c hyperg_U.c hyperg.c laguerre.c lambert.c legendre_H3d.c legendre_Qn.c legendre_con.c legendre_poly.c log.c mathieu_angfunc.c mathieu_charv.c mathieu_coeff.c mathieu_radfunc.c mathieu_workspace.c poch.c pow_int.c psi.c recurse.h result.c shint.c sinint.c synchrotron.c transport.c trig.c zeta.c
9	9

+5

-1

specfunc/Makefile.in less more

156	156	LIBOBJS = @LIBOBJS@
157	157	LIBS = @LIBS@
158	158	LIBTOOL = @LIBTOOL@
	159	LIPO = @LIPO@
159	160	LN_S = @LN_S@
160	161	LTLIBOBJS = @LTLIBOBJS@
161	162	MAINT = @MAINT@

163	164	MKDIR_P = @MKDIR_P@
164	165	NM = @NM@
165	166	NMEDIT = @NMEDIT@
	167	OBJDUMP = @OBJDUMP@
166	168	OBJEXT = @OBJEXT@
	169	OTOOL = @OTOOL@
	170	OTOOL64 = @OTOOL64@
167	171	PACKAGE = @PACKAGE@
168	172	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
169	173	PACKAGE_NAME = @PACKAGE_NAME@

229	233	noinst_LTLIBRARIES = libgslspecfunc.la
230	234	pkginclude_HEADERS = gsl_sf.h gsl_sf_airy.h gsl_sf_bessel.h gsl_sf_clausen.h gsl_sf_coulomb.h gsl_sf_coupling.h gsl_sf_dawson.h gsl_sf_debye.h gsl_sf_dilog.h gsl_sf_elementary.h gsl_sf_ellint.h gsl_sf_elljac.h gsl_sf_erf.h gsl_sf_exp.h gsl_sf_expint.h gsl_sf_fermi_dirac.h gsl_sf_gamma.h gsl_sf_gegenbauer.h gsl_sf_hyperg.h gsl_sf_laguerre.h gsl_sf_lambert.h gsl_sf_legendre.h gsl_sf_log.h gsl_sf_mathieu.h gsl_sf_pow_int.h gsl_sf_psi.h gsl_sf_result.h gsl_sf_synchrotron.h gsl_sf_transport.h gsl_sf_trig.h gsl_sf_zeta.h gsl_specfunc.h
231	235	noinst_HEADERS = bessel_amp_phase.h bessel_olver.h bessel_temme.h bessel.h hyperg.h legendre.h eval.h chebyshev.h cheb_eval.c cheb_eval_mode.c check.h error.h
232		INCLUDES = -I$(top_builddir)
	236	INCLUDES = -I$(top_srcdir)
233	237	libgslspecfunc_la_SOURCES = airy.c airy_der.c airy_zero.c atanint.c bessel.c bessel.h bessel_I0.c bessel_I1.c bessel_In.c bessel_Inu.c bessel_J0.c bessel_J1.c bessel_Jn.c bessel_Jnu.c bessel_K0.c bessel_K1.c bessel_Kn.c bessel_Knu.c bessel_Y0.c bessel_Y1.c bessel_Yn.c bessel_Ynu.c bessel_amp_phase.c bessel_amp_phase.h bessel_i.c bessel_j.c bessel_k.c bessel_olver.c bessel_temme.c bessel_y.c bessel_zero.c bessel_sequence.c beta.c beta_inc.c clausen.c coulomb.c coupling.c coulomb_bound.c dawson.c debye.c dilog.c elementary.c ellint.c elljac.c erfc.c exp.c expint.c expint3.c fermi_dirac.c gegenbauer.c gamma.c gamma_inc.c hyperg_0F1.c hyperg_2F0.c hyperg_1F1.c hyperg_2F1.c hyperg_U.c hyperg.c laguerre.c lambert.c legendre_H3d.c legendre_Qn.c legendre_con.c legendre_poly.c log.c mathieu_angfunc.c mathieu_charv.c mathieu_coeff.c mathieu_radfunc.c mathieu_workspace.c poch.c pow_int.c psi.c recurse.h result.c shint.c sinint.c synchrotron.c transport.c trig.c zeta.c
234	238	TESTS = $(check_PROGRAMS)
235	239	test_LDADD = libgslspecfunc.la ../eigen/libgsleigen.la ../linalg/libgsllinalg.la ../sort/libgslsort.la ../matrix/libgslmatrix.la ../vector/libgslvector.la ../blas/libgslblas.la ../cblas/libgslcblas.la ../block/libgslblock.la ../complex/libgslcomplex.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la

+3

-3

specfunc/ellint.c less more

480	480	DOMAIN_ERROR(result);
481	481	}
482	482	else if(k*k >= 1.0 - GSL_SQRT_DBL_EPSILON) {
483		/* [Abramowitz+Stegun, 17.3.33] */
	483	/* [Abramowitz+Stegun, 17.3.34] */
484	484	const double y = 1.0 - k*k;
485	485	const double a[] = { 1.38629436112, 0.09666344259, 0.03590092383 };
486	486	const double b[] = { 0.5, 0.12498593597, 0.06880248576 };
487	487	const double ta = a[0] + y(a[1] + ya[2]);
488		const double tb = -log(y) * (b[0] * y(b[1] + yb[2]));
	488	const double tb = -log(y) * (b[0] + y(b[1] + yb[2]));
489	489	result->val = ta + tb;
490		result->err = 2.0 * GSL_DBL_EPSILON * result->val;
	490	result->err = 2.0 * GSL_DBL_EPSILON * (fabs(result->val) + fabs(k/y));
491	491	return GSL_SUCCESS;
492	492	}
493	493	else {

+8

-2

specfunc/exp.c less more

31	31	*/
32	32	static
33	33	int
34		exprel_n_CF(const int N, const double x, gsl_sf_result * result)
	34	exprel_n_CF(const double N, const double x, gsl_sf_result * result)
35	35	{
36	36	const double RECUR_BIG = GSL_SQRT_DBL_MAX;
37	37	const int maxiter = 5000;

92	92	}
93	93
94	94	result->val = fn;
95		result->err = 2.0(n+1.0)GSL_DBL_EPSILON*fabs(fn);
	95	result->err = 4.0(n+1.0)GSL_DBL_EPSILON*fabs(fn);
96	96
97	97	if(n == maxiter)
98	98	GSL_ERROR ("error", GSL_EMAXITER);

411	411	}
412	412	}
413	413
	414
	415	int
	416	gsl_sf_exprel_n_CF_e(const double N, const double x, gsl_sf_result * result)
	417	{
	418	return exprel_n_CF(N, x, result);
	419	}
414	420
415	421	int
416	422	gsl_sf_exprel_n_e(const int N, const double x, gsl_sf_result * result)

+66

-18

specfunc/gamma_inc.c less more

58	58	} else {
59	59	double mu = (x-a)/a;
60	60	gsl_sf_log_1plusx_mx_e(mu, &ln_term); /* log(1+mu) - mu */
	61	/* Propagate cancellation error from x-a, since the absolute
	62	error of mu=x-a is DBL_EPSILON */
	63	ln_term.err += GSL_DBL_EPSILON * fabs(mu);
61	64	};
62	65	gsl_sf_gammastar_e(a, &gstar);
63	66	term1 = exp(aln_term.val)/sqrt(2.0M_PI*a);
64	67	result->val = term1/gstar.val;
65	68	result->err = 2.0 * GSL_DBL_EPSILON * (fabs(aln_term.val) + 1.0) fabs(result->val);
	69	/* Include propagated error from log term */
	70	result->err += fabs(a) * ln_term.err * fabs(result->val);
66	71	result->err += gstar.err/fabs(gstar.val) * fabs(result->val);
67	72	return GSL_SUCCESS;
68	73	}

76	81	int
77	82	gamma_inc_P_series(const double a, const double x, gsl_sf_result * result)
78	83	{
79		const int nmax = 5000;
	84	const int nmax = 10000;
80	85
81	86	gsl_sf_result D;
82	87	int stat_D = gamma_inc_D(a, x, &D);
83	88
84		double sum = 1.0;
85		double term = 1.0;
86		int n;
87		for(n=1; n<nmax; n++) {
88		term *= x/(a+n);
89		sum += term;
90		if(fabs(term/sum) < GSL_DBL_EPSILON) break;
91		}
92
93		result->val = D.val * sum;
94		result->err = D.err * fabs(sum);
95		result->err += (1.0 + n) * GSL_DBL_EPSILON * fabs(result->val);
96
97		if(n == nmax)
98		GSL_ERROR ("error", GSL_EMAXITER);
99		else
100		return stat_D;
	89	/* Approximating the terms of the series using Stirling's
	90	approximation gives t_n = (x/a)^n * exp(-n(n+1)/(2a)), so the
	91	convergence condition is n^2 / (2a) + (1-(x/a) + (1/2a)) n >>
	92	-log(GSL_DBL_EPS) if we want t_n < O(1e-16) t_0. The condition
	93	below detects cases where the minimum value of n is > 5000 */
	94
	95	if (x > 0.995 * a && a > 1e5) { /* Difficult case: try continued fraction */
	96	gsl_sf_result cf_res;
	97	int status = gsl_sf_exprel_n_CF_e(a, x, &cf_res);
	98	result->val = D.val * cf_res.val;
	99	result->err = fabs(D.val * cf_res.err) + fabs(D.err * cf_res.val);
	100	return status;
	101	}
	102
	103	/* Series would require excessive number of terms */
	104
	105	if (x > (a + nmax)) {
	106	GSL_ERROR ("gamma_inc_P_series x>>a exceeds range", GSL_EMAXITER);
	107	}
	108
	109	/* Normal case: sum the series */
	110
	111	{
	112	double sum = 1.0;
	113	double term = 1.0;
	114	double remainder;
	115	int n;
	116
	117	/* Handle lower part of the series where t_n is increasing, \|x\| > a+n */
	118
	119	int nlow = (x > a) ? (x - a): 0;
	120
	121	for(n=1; n < nlow; n++) {
	122	term *= x/(a+n);
	123	sum += term;
	124	}
	125
	126	/* Handle upper part of the series where t_n is decreasing, \|x\| < a+n */
	127
	128	for (/* n = previous n */ ; n<nmax; n++) {
	129	term *= x/(a+n);
	130	sum += term;
	131	if(fabs(term/sum) < GSL_DBL_EPSILON) break;
	132	}
	133
	134	/* Estimate remainder of series ~ t_(n+1)/(1-x/(a+n+1)) */
	135	{
	136	double tnp1 = (x/(a+n)) * term;
	137	remainder = tnp1 / (1.0 - x/(a + n + 1.0));
	138	}
	139
	140	result->val = D.val * sum;
	141	result->err = D.err * fabs(sum) + fabs(D.val * remainder);
	142	result->err += (1.0 + n) * GSL_DBL_EPSILON * fabs(result->val);
	143
	144	if(n == nmax && fabs(remainder/sum) > GSL_SQRT_DBL_EPSILON)
	145	GSL_ERROR ("gamma_inc_P_series failed to converge", GSL_EMAXITER);
	146	else
	147	return stat_D;
	148	}
101	149	}
102	150
103	151

+2

-0

specfunc/gsl_sf_exp.h less more

101	101	int gsl_sf_exprel_n_e(const int n, const double x, gsl_sf_result * result);
102	102	double gsl_sf_exprel_n(const int n, const double x);
103	103
	104	int gsl_sf_exprel_n_CF_e(const double n, const double x, gsl_sf_result * result);
	105
104	106
105	107	/* Exponentiate a quantity with an associated error.
106	108	*/

+0

-11

specfunc/gsl_sf_legendre.h less more

192	192	*/
193	193	int gsl_sf_legendre_array_size(const int lmax, const int m);
194	194
195
196	195	/* Irregular Spherical Conical Function
197	196	* P^{1/2}_{-1/2 + I lambda}(x)
198	197	*

310	309	int gsl_sf_legendre_H3d_array(const int lmax, const double lambda, const double eta, double * result_array);
311	310
312	311
313		#ifdef HAVE_INLINE
314		extern inline
315		int
316		gsl_sf_legendre_array_size(const int lmax, const int m)
317		{
318		return lmax-m+1;
319		}
320		#endif /* HAVE_INLINE */
321
322
323	312	__END_DECLS
324	313
325	314	#endif /* __GSL_SF_LEGENDRE_H__ */

+0

-4

specfunc/legendre_poly.c less more

736	736	}
737	737	}
738	738
739
740		#ifndef HIDE_INLINE_STATIC
741	739	int
742	740	gsl_sf_legendre_array_size(const int lmax, const int m)
743	741	{
744	742	return lmax-m+1;
745	743	}
746		#endif
747
748	744
749	745	/--------- Functions w/ Natural Prototypes ----------*/
750	746

+4

-0

specfunc/test_gamma.c less more

201	201
202	202	/* Regression test Martin Jansche <jansche@ling.ohio-state.edu> BUG#12 */
203	203	TEST_SF(s, gsl_sf_gamma_inc_P_e, (10, 1e-16, &r), 2.755731922398588814734648067e-167, TEST_TOL2, GSL_SUCCESS);
	204
	205	/* Regression test for gsl_cdf_chisq_Pinv, (0.05, 1263131.0) */
	206	TEST_SF(s, gsl_sf_gamma_inc_P_e, (1263131.0, 1261282.3637, &r), 0.04994777516935182963821362168, TEST_TOL4, GSL_SUCCESS);
	207	TEST_SF(s, gsl_sf_gamma_inc_P_e, (1263131.0, 1263131.0, &r), 0.500118321758657770672882362502514254, TEST_TOL4, GSL_SUCCESS);
204	208
205	209	TEST_SF(s, gsl_sf_gamma_inc_Q_e, (0.0, 0.001, &r), 0.0, TEST_TOL0, GSL_SUCCESS);
206	210	TEST_SF(s, gsl_sf_gamma_inc_Q_e, (0.001, 0.001, &r), 0.006312353291139709793, TEST_TOL0, GSL_SUCCESS);

+11

-6

specfunc/test_hyperg.c less more

258	258
259	259	TEST_SF(s, gsl_sf_hyperg_1F1_e, (-26, 2.0, 100.0, &r), 1.444786781107436954e+19, TEST_TOL3, GSL_SUCCESS);
260	260
261		#if 0
	261	#ifdef FIXME
262	262	/* This one is computed with a huge error, there is loss of
263	263	precision but the error estimate flags the problem (assuming the
264	264	user looks at it). We should probably trap any return with

275	275
276	276	TEST_SF(s, gsl_sf_hyperg_1F1_e, (1.0, 1000000.5, 1001000.5, &r), 3480.3699557431856166, TEST_TOL4, GSL_SUCCESS);
277	277
278		#if 0 /* FIX THESE NEXT RELEASE */
	278	#ifdef FIXME /* FIX THESE NEXT RELEASE */
279	279	TEST_SF(s, gsl_sf_hyperg_1F1_e, (1.1, 1000000.5, 1001000.5, &r), 7304.6126942641350122, TEST_TOL3, GSL_SUCCESS);
280	280	TEST_SF(s, gsl_sf_hyperg_1F1_e, (0.9, 1000000.5, 1001000.5, &r), 1645.4879293475410982, TEST_TOL3, GSL_SUCCESS);
281	281	#endif

423	423	TEST_SF(s, gsl_sf_hyperg_U_e, (-50.5, 100.1, 70, &r), 3.249026971618851e+84, TEST_TOL2, GSL_SUCCESS);
424	424	TEST_SF(s, gsl_sf_hyperg_U_e, (-50.5, 100.1, 100, &r), 1.003401902126641e+85, TEST_TOL1, GSL_SUCCESS);
425	425
	426	/* Bug report from Stefan Gerlach */
	427
	428	#ifdef FIXME
	429	TEST_SF(s, gsl_sf_hyperg_U_e, (-2.0, 4.0, 1.0, &r), 11.0, TEST_TOL0, GSL_SUCCESS);
	430	#endif
426	431
427	432	/* 2F1 */
428	433

460	465
461	466	/* added special handling with x == 1.0 , Richard J. Mathar, 2008-01-09 */
462	467
463		TEST_SF(s, gsl_sf_hyperg_2F1_e, (1.5, 0.5, 3.0, 1.0, &r), 1.6976527263135502482014268 , TEST_TOL0, GSL_SUCCESS);
464		TEST_SF(s, gsl_sf_hyperg_2F1_e, (1.5, -4.2, 3.0, 1.0, &r), .15583601560025710649555254 , TEST_TOL0, GSL_SUCCESS);
465		TEST_SF(s, gsl_sf_hyperg_2F1_e, (-7.4, 0.7, -1.5, 1.0, &r), -.34478866959246584996859 , TEST_TOL0, GSL_SUCCESS);
466		TEST_SF(s, gsl_sf_hyperg_2F1_e, (0.1, -2.7, -1.5, 1.0, &r), 1.059766766063610122925 , TEST_TOL0, GSL_SUCCESS);
	468	TEST_SF(s, gsl_sf_hyperg_2F1_e, (1.5, 0.5, 3.0, 1.0, &r), 1.6976527263135502482014268 , TEST_TOL2, GSL_SUCCESS);
	469	TEST_SF(s, gsl_sf_hyperg_2F1_e, (1.5, -4.2, 3.0, 1.0, &r), .15583601560025710649555254 , TEST_TOL2, GSL_SUCCESS);
	470	TEST_SF(s, gsl_sf_hyperg_2F1_e, (-7.4, 0.7, -1.5, 1.0, &r), -.34478866959246584996859 , TEST_TOL2, GSL_SUCCESS);
	471	TEST_SF(s, gsl_sf_hyperg_2F1_e, (0.1, -2.7, -1.5, 1.0, &r), 1.059766766063610122925 , TEST_TOL2, GSL_SUCCESS);
467	472
468	473	/* 2F1 conj */
469	474

+1

-1

specfunc/test_legendre.c less more

489	489	TEST_SF(s, gsl_sf_legendre_H3d_e, (5, 1.0e+08, 1.0e-08, &r), 0.00009256115861125841299, TEST_TOL2, GSL_SUCCESS);
490	490	TEST_SF(s, gsl_sf_legendre_H3d_e, (5, 1.0e+08, 100.0, &r), -6.496143209092860765e-52 , 128.0*TEST_SQRT_TOL0, GSL_SUCCESS);
491	491
492		#if 0
	492	#if FIXME
493	493	sa = 0;
494	494	gsl_sf_legendre_H3d_array(100, 1.0, 3.0, L);
495	495	TEST_SF_VAL(sa, L[0], +0.0, gsl_sf_legendre_H3d(0, 1.0, 3.0), 1.0e-12);

+11

-5

specfunc/test_sf.c less more

535	535	TEST_SF(s, gsl_sf_ellint_Kcomp_e, ( 0.50, mode, &r), 1.6857503548125960429, TEST_TOL0, GSL_SUCCESS);
536	536	TEST_SF(s, gsl_sf_ellint_Kcomp_e, (0.010, mode, &r), 1.5708355989121522360, TEST_TOL0, GSL_SUCCESS);
537	537
	538	/* Bug report from Thies Heidecke */
	539	TEST_SF(s, gsl_sf_ellint_Kcomp_e, ( 0.99999999906867742538, mode, &r), 11.4369284843320018031, TEST_SNGL, GSL_SUCCESS);
	540
538	541	TEST_SF(s, gsl_sf_ellint_Ecomp_e, (0.99, mode, &r), 1.0284758090288040010, TEST_TOL0, GSL_SUCCESS);
539	542	TEST_SF(s, gsl_sf_ellint_Ecomp_e, (0.50, mode, &r), 1.4674622093394271555, TEST_TOL0, GSL_SUCCESS);
540	543	TEST_SF(s, gsl_sf_ellint_Ecomp_e, (0.01, mode, &r), 1.5707570561503852873, TEST_TOL0, GSL_SUCCESS);

996	999	/* Test cases from Szymon Jaroszewicz */
997	1000
998	1001	TEST_SF_E10(s, gsl_sf_exp_mult_e10_e, (10000.0, 1.0, &re), 8.806818225662921587261496007, 4342, TEST_TOL5, GSL_SUCCESS);
999		TEST_SF_E10(s, gsl_sf_exp_mult_e10_e, (100.0, 1.0, &re), 2.688117141816135448412625551e43, 0, TEST_TOL1, GSL_SUCCESS);
1000		TEST_SF_E10(s, gsl_sf_exp_e10_e, (100.0, &re), 2.688117141816135448412625551e43, 0, TEST_TOL1, GSL_SUCCESS);
1001		TEST_SF_E10(s, gsl_sf_exp_e10_e, (1000.0, &re), 1.970071114017046993888879352, 434, TEST_TOL1, GSL_SUCCESS);
1002		TEST_SF_E10(s, gsl_sf_exp_e10_e, (-100.0, &re), 3.720075976020835962959695803e-44, 0, TEST_TOL1, GSL_SUCCESS);
1003		TEST_SF_E10(s, gsl_sf_exp_e10_e, (-1000.0, &re), 5.075958897549456765291809479, -435, TEST_TOL1, GSL_SUCCESS);
	1002	TEST_SF_E10(s, gsl_sf_exp_mult_e10_e, (100.0, 1.0, &re), 2.688117141816135448412625551e43, 0, TEST_TOL2, GSL_SUCCESS);
	1003	TEST_SF_E10(s, gsl_sf_exp_e10_e, (100.0, &re), 2.688117141816135448412625551e43, 0, TEST_TOL2, GSL_SUCCESS);
	1004	TEST_SF_E10(s, gsl_sf_exp_e10_e, (1000.0, &re), 1.970071114017046993888879352, 434, TEST_TOL3, GSL_SUCCESS);
	1005	TEST_SF_E10(s, gsl_sf_exp_e10_e, (-100.0, &re), 3.720075976020835962959695803e-44, 0, TEST_TOL2, GSL_SUCCESS);
	1006	TEST_SF_E10(s, gsl_sf_exp_e10_e, (-1000.0, &re), 5.075958897549456765291809479, -435, TEST_TOL3, GSL_SUCCESS);
1004	1007
1005	1008	TEST_SF(s, gsl_sf_expm1_e, (-10.0, &r), exp(-10.0)-1.0, TEST_TOL0, GSL_SUCCESS);
1006	1009	TEST_SF(s, gsl_sf_expm1_e, (-0.001, &r), -0.00099950016662500845, TEST_TOL0, GSL_SUCCESS);

1064	1067	TEST_SF(s, gsl_sf_exprel_n_e, (500, 500.0, &r), 28.363019877927630858, TEST_TOL2, GSL_SUCCESS);
1065	1068	TEST_SF(s, gsl_sf_exprel_n_e, (500, 1000.0, &r), 2.4037563160335300322e+68, TEST_TOL4, GSL_SUCCESS);
1066	1069	TEST_SF(s, gsl_sf_exprel_n_e, (500, 1600.0, &r), 7.899293535320607403e+226, TEST_TOL4, GSL_SUCCESS);
	1070
	1071	TEST_SF(s, gsl_sf_exprel_n_e, (1263131.0, 1261282.3637, &r), 545.0113107238425900305428360, TEST_TOL4, GSL_SUCCESS);
	1072	TEST_SF(s, gsl_sf_exprel_n_CF_e, (6.315655e+05, 6.302583168053568806e+05, &r), 385.425369029433473098652465720, TEST_TOL4, GSL_SUCCESS);
1067	1073
1068	1074	return s;
1069	1075	}

+4

-0

statistics/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	2007-10-02 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* variance_source.c: added functions for sum of squares and

+1

-1

statistics/Makefile.am less more

3	3
4	4	pkginclude_HEADERS = gsl_statistics.h gsl_statistics_char.h gsl_statistics_double.h gsl_statistics_float.h gsl_statistics_int.h gsl_statistics_long.h gsl_statistics_long_double.h gsl_statistics_short.h gsl_statistics_uchar.h gsl_statistics_uint.h gsl_statistics_ulong.h gsl_statistics_ushort.h
5	5
6		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	libgslstatistics_la_SOURCES = mean.c variance.c absdev.c skew.c kurtosis.c lag1.c p_variance.c minmax.c ttest.c median.c covariance.c quantiles.c wmean.c wvariance.c wabsdev.c wskew.c wkurtosis.c
9	9

+5

-1

statistics/Makefile.in less more

134	134	LIBOBJS = @LIBOBJS@
135	135	LIBS = @LIBS@
136	136	LIBTOOL = @LIBTOOL@
	137	LIPO = @LIPO@
137	138	LN_S = @LN_S@
138	139	LTLIBOBJS = @LTLIBOBJS@
139	140	MAINT = @MAINT@

141	142	MKDIR_P = @MKDIR_P@
142	143	NM = @NM@
143	144	NMEDIT = @NMEDIT@
	145	OBJDUMP = @OBJDUMP@
144	146	OBJEXT = @OBJEXT@
	147	OTOOL = @OTOOL@
	148	OTOOL64 = @OTOOL64@
145	149	PACKAGE = @PACKAGE@
146	150	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
147	151	PACKAGE_NAME = @PACKAGE_NAME@

206	210	top_srcdir = @top_srcdir@
207	211	noinst_LTLIBRARIES = libgslstatistics.la
208	212	pkginclude_HEADERS = gsl_statistics.h gsl_statistics_char.h gsl_statistics_double.h gsl_statistics_float.h gsl_statistics_int.h gsl_statistics_long.h gsl_statistics_long_double.h gsl_statistics_short.h gsl_statistics_uchar.h gsl_statistics_uint.h gsl_statistics_ulong.h gsl_statistics_ushort.h
209		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
	213	INCLUDES = -I$(top_srcdir)
210	214	libgslstatistics_la_SOURCES = mean.c variance.c absdev.c skew.c kurtosis.c lag1.c p_variance.c minmax.c ttest.c median.c covariance.c quantiles.c wmean.c wvariance.c wabsdev.c wskew.c wkurtosis.c
211	215	noinst_HEADERS = mean_source.c variance_source.c covariance_source.c absdev_source.c skew_source.c kurtosis_source.c lag1_source.c p_variance_source.c minmax_source.c ttest_source.c median_source.c quantiles_source.c wmean_source.c wvariance_source.c wabsdev_source.c wskew_source.c wkurtosis_source.c test_float_source.c test_int_source.c
212	216	TESTS = $(check_PROGRAMS)

+4

-0

sum/ChangeLog less more

	0	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	1
	2	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	3
0	4	Thu Dec 21 21:46:54 2000 Brian Gough <bjg@network-theory.co.uk>
1	5
2	6	* changed err to abserr, to make it clear that it is an absolute

+1

-1

sum/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_sum.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslsum_la_SOURCES = levin_u.c levin_utrunc.c work_u.c work_utrunc.c
7	7

+5

-1

sum/Makefile.in less more

132	132	LIBOBJS = @LIBOBJS@
133	133	LIBS = @LIBS@
134	134	LIBTOOL = @LIBTOOL@
	135	LIPO = @LIPO@
135	136	LN_S = @LN_S@
136	137	LTLIBOBJS = @LTLIBOBJS@
137	138	MAINT = @MAINT@

139	140	MKDIR_P = @MKDIR_P@
140	141	NM = @NM@
141	142	NMEDIT = @NMEDIT@
	143	OBJDUMP = @OBJDUMP@
142	144	OBJEXT = @OBJEXT@
	145	OTOOL = @OTOOL@
	146	OTOOL64 = @OTOOL64@
143	147	PACKAGE = @PACKAGE@
144	148	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
145	149	PACKAGE_NAME = @PACKAGE_NAME@

204	208	top_srcdir = @top_srcdir@
205	209	noinst_LTLIBRARIES = libgslsum.la
206	210	pkginclude_HEADERS = gsl_sum.h
207		INCLUDES = -I$(top_builddir)
	211	INCLUDES = -I$(top_srcdir)
208	212	libgslsum_la_SOURCES = levin_u.c levin_utrunc.c work_u.c work_utrunc.c
209	213	TESTS = $(check_PROGRAMS)
210	214	test_LDADD = libgslsum.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la

+25

-0

sys/ChangeLog less more

	0	2008-10-13 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* log1p.c: use gsl_sys.h header file
	3
	4	* infnan.c: use gsl_sys.h header file
	5
	6	* hypot.c: use gsl_sys.h header file
	7
	8	* fdiv.c: use gsl_sys.h header file
	9
	10	* coerce.c: use gsl_sys.h header file
	11
	12	2008-10-08 Brian Gough <bjg@network-theory.co.uk>
	13
	14	* infnan.c (gsl_isinf): handle the case where isinf(-inf)
	15	returns +1
	16
	17	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	18
	19	* prec.c: compile inline functions from header here
	20
	21	* pow_int.c: compile inline functions from header here
	22
	23	* minmax.c: compile inline functions from header here
	24
0	25	2008-03-18 Brian Gough <bjg@network-theory.co.uk>
1	26
2	27	* test.c (main): use volatile to avoid extended precision in loop

+1

-1

sys/Makefile.am less more

3	3
4	4	libgslsys_la_SOURCES = minmax.c prec.c hypot.c log1p.c expm1.c coerce.c invhyp.c pow_int.c infnan.c fdiv.c fcmp.c ldfrexp.c
5	5
6		INCLUDES = -I$(top_builddir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	check_PROGRAMS = test
9	9	TESTS = $(check_PROGRAMS)

+5

-1

sys/Makefile.in less more

133	133	LIBOBJS = @LIBOBJS@
134	134	LIBS = @LIBS@
135	135	LIBTOOL = @LIBTOOL@
	136	LIPO = @LIPO@
136	137	LN_S = @LN_S@
137	138	LTLIBOBJS = @LTLIBOBJS@
138	139	MAINT = @MAINT@

140	141	MKDIR_P = @MKDIR_P@
141	142	NM = @NM@
142	143	NMEDIT = @NMEDIT@
	144	OBJDUMP = @OBJDUMP@
143	145	OBJEXT = @OBJEXT@
	146	OTOOL = @OTOOL@
	147	OTOOL64 = @OTOOL64@
144	148	PACKAGE = @PACKAGE@
145	149	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
146	150	PACKAGE_NAME = @PACKAGE_NAME@

206	210	noinst_LTLIBRARIES = libgslsys.la
207	211	pkginclude_HEADERS = gsl_sys.h
208	212	libgslsys_la_SOURCES = minmax.c prec.c hypot.c log1p.c expm1.c coerce.c invhyp.c pow_int.c infnan.c fdiv.c fcmp.c ldfrexp.c
209		INCLUDES = -I$(top_builddir)
	213	INCLUDES = -I$(top_srcdir)
210	214	TESTS = $(check_PROGRAMS)
211	215	test_SOURCES = test.c
212	216	test_LDADD = libgslsys.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la libgslsys.la ../utils/libutils.la

+1

-6

sys/coerce.c less more

18	18
19	19	#include <config.h>
20	20	#include <math.h>
21
22		double gsl_coerce_double (const double x);
	21	#include <gsl/gsl_sys.h>
23	22
24	23	double
25	24	gsl_coerce_double (const double x)

28	27	y = x;
29	28	return y;
30	29	}
31
32		float gsl_coerce_float (const float x);
33	30
34	31	float
35	32	gsl_coerce_float (const float x)

41	38
42	39	/* The following function is not needed, but is included for completeness */
43	40
44		long double gsl_coerce_long_double (const long double x);
45
46	41	long double
47	42	gsl_coerce_long_double (const long double x)
48	43	{

+1

-2

sys/fdiv.c less more

18	18
19	19	#include <config.h>
20	20	#include <math.h>
21
22		double gsl_fdiv (const double x, const double y);
	21	#include <gsl/gsl_sys.h>
23	22
24	23	double
25	24	gsl_fdiv (const double x, const double y)

+0

-3

sys/hypot.c less more

19	19	#include <config.h>
20	20	#include <math.h>
21	21	#include <gsl/gsl_math.h>
22
23		double gsl_hypot (const double x, const double y);
24		double gsl_hypot3 (const double x, const double y, const double z);
25	22
26	23	double gsl_hypot (const double x, const double y)
27	24	{

+13

-5

sys/infnan.c less more

23	23	#include <ieeefp.h>
24	24	#endif
25	25
26		double gsl_nan (void);
27		double gsl_posinf (void);
28		double gsl_neginf (void);
29		double gsl_fdiv (const double x, const double y);
	26	#include <gsl/gsl_sys.h>
30	27
31	28	double gsl_nan (void)
32	29	{

117	114	int
118	115	gsl_isinf (const double x)
119	116	{
120		return isinf(x);
	117	/* isinf(3): In glibc 2.01 and earlier, isinf() returns a
	118	non-zero value (actually: 1) if x is an infinity (positive or
	119	negative). (This is all that C99 requires.) */
	120
	121	if (isinf(x))
	122	{
	123	return (x > 0) ? 1 : -1;
	124	}
	125	else
	126	{
	127	return 0;
	128	}
121	129	}
122	130	# else
123	131

+1

-2

sys/log1p.c less more

18	18
19	19	#include <config.h>
20	20	#include <math.h>
21
22		double gsl_log1p (const double x);
	21	#include <gsl/gsl_sys.h>
23	22
24	23	double gsl_log1p (const double x)
25	24	{

+4

-49

sys/minmax.c less more

18	18
19	19	#include <config.h>
20	20
21		#define GSL_MAX(a,b) ((a) > (b) ? (a) : (b))
22		#define GSL_MIN(a,b) ((a) < (b) ? (a) : (b))
	21	/* Compile all the inline functions */
23	22
24		#ifndef HIDE_INLINE_STATIC
25		int GSL_MAX_INT (int a, int b);
26		int GSL_MIN_INT (int a, int b);
27		double GSL_MAX_DBL (double a, double b);
28		double GSL_MIN_DBL (double a, double b);
29		long double GSL_MAX_LDBL (long double a, long double b);
30		long double GSL_MIN_LDBL (long double a, long double b);
31
32		int
33		GSL_MAX_INT (int a, int b)
34		{
35		return GSL_MAX (a, b);
36		}
37
38		int
39		GSL_MIN_INT (int a, int b)
40		{
41		return GSL_MIN (a, b);
42		}
43
44		double
45		GSL_MAX_DBL (double a, double b)
46		{
47		return GSL_MAX (a, b);
48		}
49
50		double
51		GSL_MIN_DBL (double a, double b)
52		{
53		return GSL_MIN (a, b);
54		}
55
56		long double
57		GSL_MAX_LDBL (long double a, long double b)
58		{
59		return GSL_MAX (a, b);
60		}
61
62		long double
63		GSL_MIN_LDBL (long double a, long double b)
64		{
65		return GSL_MIN (a, b);
66		}
67		#endif
	23	#define COMPILE_INLINE_STATIC
	24	#include "build.h"
	25	#include <gsl/gsl_minmax.h>
68	26
69	27	/* Define some static functions which are always available */
70
71		double gsl_max (double a, double b);
72		double gsl_min (double a, double b);
73	28
74	29	double gsl_max (double a, double b)
75	30	{

+5

-11

sys/pow_int.c less more

17	17	*/
18	18	#include <config.h>
19	19	#include <math.h>
	20
	21	/* Compile all the inline functions */
	22
	23	#define COMPILE_INLINE_STATIC
	24	#include "build.h"
20	25	#include <gsl/gsl_pow_int.h>
21
22		#ifndef HIDE_INLINE_STATIC
23		double gsl_pow_2(const double x) { return x*x; }
24		double gsl_pow_3(const double x) { return xxx; }
25		double gsl_pow_4(const double x) { double x2 = xx; return x2x2; }
26		double gsl_pow_5(const double x) { double x2 = xx; return x2x2*x; }
27		double gsl_pow_6(const double x) { double x2 = xx; return x2x2*x2; }
28		double gsl_pow_7(const double x) { double x3 = xxx; return x3x3x; }
29		double gsl_pow_8(const double x) { double x2 = xx; double x4 = x2x2; return x4*x4; }
30		double gsl_pow_9(const double x) { double x3 = xxx; return x3x3x3; }
31		#endif
32	26
33	27	double gsl_pow_int(double x, int n)
34	28	{

+6

-14

sys/prec.c less more

20	20
21	21	#include <config.h>
22	22	#include <gsl/gsl_machine.h>
	23
	24	/* Compile all the inline functions */
	25
	26	#define COMPILE_INLINE_STATIC
	27	#include "build.h"
23	28	#include <gsl/gsl_precision.h>
	29	#include <gsl/gsl_mode.h>
24	30
25	31	const double gsl_prec_eps[_GSL_PREC_T_NUM] = {
26	32	GSL_DBL_EPSILON,

58	64	GSL_ROOT6_SFLT_EPSILON
59	65	};
60	66
61		typedef unsigned int gsl_mode_t;
62
63		#ifndef HIDE_INLINE_STATIC
64		/* We need this somewhere, in case the inline is ignored.
65		*/
66
67		unsigned int GSL_MODE_PREC(gsl_mode_t mt);
68
69		unsigned int
70		GSL_MODE_PREC(gsl_mode_t mt)
71		{
72		return (mt & (unsigned int)7);
73		}
74		#endif

+1

-5

sys/test.c less more

454	454	s = gsl_isinf (inf);
455	455	gsl_test_int (s, 1, "gsl_isinf(inf)");
456	456
457		/* isinf(3): In glibc 2.01 and earlier, isinf() returns a
458		non-zero value (actually: 1) if x is an infinity (positive or
459		negative). (This is all that C99 requires.) */
460
461	457	s = gsl_isinf (-inf);
462		gsl_test (s == 0, "gsl_isinf(-inf) is non-zero");
	458	gsl_test_int (s, -1, "gsl_isinf(-inf)");
463	459
464	460	s = gsl_isinf (nan);
465	461	gsl_test_int (s, 0, "gsl_isinf(nan)");

+4

-0

test/Makefile.in less more

125	125	LIBOBJS = @LIBOBJS@
126	126	LIBS = @LIBS@
127	127	LIBTOOL = @LIBTOOL@
	128	LIPO = @LIPO@
128	129	LN_S = @LN_S@
129	130	LTLIBOBJS = @LTLIBOBJS@
130	131	MAINT = @MAINT@

132	133	MKDIR_P = @MKDIR_P@
133	134	NM = @NM@
134	135	NMEDIT = @NMEDIT@
	136	OBJDUMP = @OBJDUMP@
135	137	OBJEXT = @OBJEXT@
	138	OTOOL = @OTOOL@
	139	OTOOL64 = @OTOOL64@
136	140	PACKAGE = @PACKAGE@
137	141	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
138	142	PACKAGE_NAME = @PACKAGE_NAME@

+4

-0

utils/Makefile.in less more

115	115	LIBOBJS = @LIBOBJS@
116	116	LIBS = @LIBS@
117	117	LIBTOOL = @LIBTOOL@
	118	LIPO = @LIPO@
118	119	LN_S = @LN_S@
119	120	LTLIBOBJS = @LTLIBOBJS@
120	121	MAINT = @MAINT@

122	123	MKDIR_P = @MKDIR_P@
123	124	NM = @NM@
124	125	NMEDIT = @NMEDIT@
	126	OBJDUMP = @OBJDUMP@
125	127	OBJEXT = @OBJEXT@
	128	OTOOL = @OTOOL@
	129	OTOOL64 = @OTOOL64@
126	130	PACKAGE = @PACKAGE@
127	131	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
128	132	PACKAGE_NAME = @PACKAGE_NAME@

+15

-0

vector/ChangeLog less more

	0	2008-09-27 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* gsl_vector_complex_double.h: added missing functions isnonneg,
	3	add, sub, mul, div, scale, add_constant
	4
	5	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	6
	7	* gsl_vector.h: use new inline declarations in all header files
	8
	9	* vector.c: compile inline functions from header here
	10
	11	* vector_source.c: removed
	12
	13	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	14
0	15	2007-08-21 Brian Gough <bjg@network-theory.co.uk>
1	16
2	17	* prop_source.c (FUNCTION): added gsl_vector_isnonneg

+2

-2

vector/Makefile.am less more

3	3
4	4	pkginclude_HEADERS = gsl_vector.h gsl_vector_char.h gsl_vector_complex.h gsl_vector_complex_double.h gsl_vector_complex_float.h gsl_vector_complex_long_double.h gsl_vector_double.h gsl_vector_float.h gsl_vector_int.h gsl_vector_long.h gsl_vector_long_double.h gsl_vector_short.h gsl_vector_uchar.h gsl_vector_uint.h gsl_vector_ulong.h gsl_vector_ushort.h
5	5
6		INCLUDES= -I$(top_builddir) -I$(top_srcdir)
	6	INCLUDES = -I$(top_srcdir)
7	7
8	8	TESTS = $(check_PROGRAMS)
9	9

15	15
16	16	CLEANFILES = test.txt test.dat
17	17
18		noinst_HEADERS = vector_source.c init_source.c file_source.c copy_source.c swap_source.c prop_source.c test_complex_source.c test_source.c minmax_source.c oper_source.c reim_source.c subvector_source.c view_source.c
	18	noinst_HEADERS = init_source.c file_source.c copy_source.c swap_source.c prop_source.c test_complex_source.c test_source.c minmax_source.c oper_source.c oper_complex_source.c reim_source.c subvector_source.c view_source.c
19	19
20	20	libgslvector_la_SOURCES = init.c file.c vector.c copy.c swap.c prop.c minmax.c oper.c reim.c subvector.c view.c view.h

+6

-2

vector/Makefile.in less more

139	139	LIBOBJS = @LIBOBJS@
140	140	LIBS = @LIBS@
141	141	LIBTOOL = @LIBTOOL@
	142	LIPO = @LIPO@
142	143	LN_S = @LN_S@
143	144	LTLIBOBJS = @LTLIBOBJS@
144	145	MAINT = @MAINT@

146	147	MKDIR_P = @MKDIR_P@
147	148	NM = @NM@
148	149	NMEDIT = @NMEDIT@
	150	OBJDUMP = @OBJDUMP@
149	151	OBJEXT = @OBJEXT@
	152	OTOOL = @OTOOL@
	153	OTOOL64 = @OTOOL64@
150	154	PACKAGE = @PACKAGE@
151	155	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
152	156	PACKAGE_NAME = @PACKAGE_NAME@

211	215	top_srcdir = @top_srcdir@
212	216	noinst_LTLIBRARIES = libgslvector.la
213	217	pkginclude_HEADERS = gsl_vector.h gsl_vector_char.h gsl_vector_complex.h gsl_vector_complex_double.h gsl_vector_complex_float.h gsl_vector_complex_long_double.h gsl_vector_double.h gsl_vector_float.h gsl_vector_int.h gsl_vector_long.h gsl_vector_long_double.h gsl_vector_short.h gsl_vector_uchar.h gsl_vector_uint.h gsl_vector_ulong.h gsl_vector_ushort.h
214		INCLUDES = -I$(top_builddir) -I$(top_srcdir)
	218	INCLUDES = -I$(top_srcdir)
215	219	TESTS = $(check_PROGRAMS)
216	220	test_LDADD = libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
217	221	test_static_LDADD = libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la
218	222	test_SOURCES = test.c
219	223	test_static_SOURCES = test_static.c
220	224	CLEANFILES = test.txt test.dat
221		noinst_HEADERS = vector_source.c init_source.c file_source.c copy_source.c swap_source.c prop_source.c test_complex_source.c test_source.c minmax_source.c oper_source.c reim_source.c subvector_source.c view_source.c
	225	noinst_HEADERS = init_source.c file_source.c copy_source.c swap_source.c prop_source.c test_complex_source.c test_source.c minmax_source.c oper_source.c oper_complex_source.c reim_source.c subvector_source.c view_source.c
222	226	libgslvector_la_SOURCES = init.c file.c vector.c copy.c swap.c prop.c minmax.c oper.c reim.c subvector.c view.c view.h
223	227	all: all-am
224	228

+14

-16

vector/gsl_vector_char.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_char.h>
27	28

121	122
122	123	/* Operations */
123	124
124		char gsl_vector_char_get (const gsl_vector_char * v, const size_t i);
125		void gsl_vector_char_set (gsl_vector_char * v, const size_t i, char x);
126
127		char gsl_vector_char_ptr (gsl_vector_char v, const size_t i);
128		const char gsl_vector_char_const_ptr (const gsl_vector_char v, const size_t i);
129
130	125	void gsl_vector_char_set_zero (gsl_vector_char * v);
131	126	void gsl_vector_char_set_all (gsl_vector_char * v, char x);
132	127	int gsl_vector_char_set_basis (gsl_vector_char * v, size_t i);

164	159	int gsl_vector_char_isneg (const gsl_vector_char * v);
165	160	int gsl_vector_char_isnonneg (const gsl_vector_char * v);
166	161
	162	INLINE_DECL char gsl_vector_char_get (const gsl_vector_char * v, const size_t i);
	163	INLINE_DECL void gsl_vector_char_set (gsl_vector_char * v, const size_t i, char x);
	164	INLINE_DECL char * gsl_vector_char_ptr (gsl_vector_char * v, const size_t i);
	165	INLINE_DECL const char * gsl_vector_char_const_ptr (const gsl_vector_char * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	char
171	171	gsl_vector_char_get (const gsl_vector_char * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_char_set (gsl_vector_char * v, const size_t i, char x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	char *
197	197	gsl_vector_char_ptr (gsl_vector_char * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (char ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const char *
210	210	gsl_vector_char_const_ptr (const gsl_vector_char * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const char ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+21

-20

vector/gsl_vector_complex_double.h less more

140	140
141	141
142	142	/* Operations */
143
144		gsl_complex
145		gsl_vector_complex_get (const gsl_vector_complex * v, const size_t i);
146
147		void gsl_vector_complex_set (gsl_vector_complex * v, const size_t i,
148		gsl_complex z);
149
150		gsl_complex
151		gsl_vector_complex_ptr (gsl_vector_complex v, const size_t i);
152
153		const gsl_complex
154		gsl_vector_complex_const_ptr (const gsl_vector_complex v, const size_t i);
155	143
156	144	void gsl_vector_complex_set_zero (gsl_vector_complex * v);
157	145	void gsl_vector_complex_set_all (gsl_vector_complex * v,

178	166	int gsl_vector_complex_isnull (const gsl_vector_complex * v);
179	167	int gsl_vector_complex_ispos (const gsl_vector_complex * v);
180	168	int gsl_vector_complex_isneg (const gsl_vector_complex * v);
	169	int gsl_vector_complex_isnonneg (const gsl_vector_complex * v);
	170
	171	int gsl_vector_complex_add (gsl_vector_complex * a, const gsl_vector_complex * b);
	172	int gsl_vector_complex_sub (gsl_vector_complex * a, const gsl_vector_complex * b);
	173	int gsl_vector_complex_mul (gsl_vector_complex * a, const gsl_vector_complex * b);
	174	int gsl_vector_complex_div (gsl_vector_complex * a, const gsl_vector_complex * b);
	175	int gsl_vector_complex_scale (gsl_vector_complex * a, const gsl_complex x);
	176	int gsl_vector_complex_add_constant (gsl_vector_complex * a, const gsl_complex x);
	177
	178	INLINE_DECL gsl_complex gsl_vector_complex_get (const gsl_vector_complex * v, const size_t i);
	179	INLINE_DECL void gsl_vector_complex_set (gsl_vector_complex * v, const size_t i, gsl_complex z);
	180	INLINE_DECL gsl_complex gsl_vector_complex_ptr (gsl_vector_complex v, const size_t i);
	181	INLINE_DECL const gsl_complex gsl_vector_complex_const_ptr (const gsl_vector_complex v, const size_t i);
181	182
182	183	#ifdef HAVE_INLINE
183	184
184		extern inline
	185	INLINE_FUN
185	186	gsl_complex
186	187	gsl_vector_complex_get (const gsl_vector_complex * v,
187	188	const size_t i)
188	189	{
189	190	#if GSL_RANGE_CHECK
190		if (i >= v->size)
	191	if (GSL_RANGE_COND(i >= v->size))
191	192	{
192	193	gsl_complex zero = {{0, 0}};
193	194	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, zero);

196	197	return *GSL_COMPLEX_AT (v, i);
197	198	}
198	199
199		extern inline
	200	INLINE_FUN
200	201	void
201	202	gsl_vector_complex_set (gsl_vector_complex * v,
202	203	const size_t i, gsl_complex z)
203	204	{
204	205	#if GSL_RANGE_CHECK
205		if (i >= v->size)
	206	if (GSL_RANGE_COND(i >= v->size))
206	207	{
207	208	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
208	209	}

210	211	*GSL_COMPLEX_AT (v, i) = z;
211	212	}
212	213
213		extern inline
	214	INLINE_FUN
214	215	gsl_complex *
215	216	gsl_vector_complex_ptr (gsl_vector_complex * v,
216	217	const size_t i)
217	218	{
218	219	#if GSL_RANGE_CHECK
219		if (i >= v->size)
	220	if (GSL_RANGE_COND(i >= v->size))
220	221	{
221	222	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
222	223	}

224	225	return GSL_COMPLEX_AT (v, i);
225	226	}
226	227
227		extern inline
	228	INLINE_FUN
228	229	const gsl_complex *
229	230	gsl_vector_complex_const_ptr (const gsl_vector_complex * v,
230	231	const size_t i)
231	232	{
232	233	#if GSL_RANGE_CHECK
233		if (i >= v->size)
	234	if (GSL_RANGE_COND(i >= v->size))
234	235	{
235	236	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
236	237	}

+21

-20

vector/gsl_vector_complex_float.h less more

140	140
141	141
142	142	/* Operations */
143
144		gsl_complex_float
145		gsl_vector_complex_float_get (const gsl_vector_complex_float * v, const size_t i);
146
147		void gsl_vector_complex_float_set (gsl_vector_complex_float * v, const size_t i,
148		gsl_complex_float z);
149
150		gsl_complex_float
151		gsl_vector_complex_float_ptr (gsl_vector_complex_float v, const size_t i);
152
153		const gsl_complex_float
154		gsl_vector_complex_float_const_ptr (const gsl_vector_complex_float v, const size_t i);
155	143
156	144	void gsl_vector_complex_float_set_zero (gsl_vector_complex_float * v);
157	145	void gsl_vector_complex_float_set_all (gsl_vector_complex_float * v,

178	166	int gsl_vector_complex_float_isnull (const gsl_vector_complex_float * v);
179	167	int gsl_vector_complex_float_ispos (const gsl_vector_complex_float * v);
180	168	int gsl_vector_complex_float_isneg (const gsl_vector_complex_float * v);
	169	int gsl_vector_complex_float_isnonneg (const gsl_vector_complex_float * v);
	170
	171	int gsl_vector_complex_float_add (gsl_vector_complex_float * a, const gsl_vector_complex_float * b);
	172	int gsl_vector_complex_float_sub (gsl_vector_complex_float * a, const gsl_vector_complex_float * b);
	173	int gsl_vector_complex_float_mul (gsl_vector_complex_float * a, const gsl_vector_complex_float * b);
	174	int gsl_vector_complex_float_div (gsl_vector_complex_float * a, const gsl_vector_complex_float * b);
	175	int gsl_vector_complex_float_scale (gsl_vector_complex_float * a, const gsl_complex_float x);
	176	int gsl_vector_complex_float_add_constant (gsl_vector_complex_float * a, const gsl_complex_float x);
	177
	178	INLINE_DECL gsl_complex_float gsl_vector_complex_float_get (const gsl_vector_complex_float * v, const size_t i);
	179	INLINE_DECL void gsl_vector_complex_float_set (gsl_vector_complex_float * v, const size_t i, gsl_complex_float z);
	180	INLINE_DECL gsl_complex_float gsl_vector_complex_float_ptr (gsl_vector_complex_float v, const size_t i);
	181	INLINE_DECL const gsl_complex_float gsl_vector_complex_float_const_ptr (const gsl_vector_complex_float v, const size_t i);
181	182
182	183	#ifdef HAVE_INLINE
183	184
184		extern inline
	185	INLINE_FUN
185	186	gsl_complex_float
186	187	gsl_vector_complex_float_get (const gsl_vector_complex_float * v,
187	188	const size_t i)
188	189	{
189	190	#if GSL_RANGE_CHECK
190		if (i >= v->size)
	191	if (GSL_RANGE_COND(i >= v->size))
191	192	{
192	193	gsl_complex_float zero = {{0, 0}};
193	194	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, zero);

196	197	return *GSL_COMPLEX_FLOAT_AT (v, i);
197	198	}
198	199
199		extern inline
	200	INLINE_FUN
200	201	void
201	202	gsl_vector_complex_float_set (gsl_vector_complex_float * v,
202	203	const size_t i, gsl_complex_float z)
203	204	{
204	205	#if GSL_RANGE_CHECK
205		if (i >= v->size)
	206	if (GSL_RANGE_COND(i >= v->size))
206	207	{
207	208	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
208	209	}

210	211	*GSL_COMPLEX_FLOAT_AT (v, i) = z;
211	212	}
212	213
213		extern inline
	214	INLINE_FUN
214	215	gsl_complex_float *
215	216	gsl_vector_complex_float_ptr (gsl_vector_complex_float * v,
216	217	const size_t i)
217	218	{
218	219	#if GSL_RANGE_CHECK
219		if (i >= v->size)
	220	if (GSL_RANGE_COND(i >= v->size))
220	221	{
221	222	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
222	223	}

224	225	return GSL_COMPLEX_FLOAT_AT (v, i);
225	226	}
226	227
227		extern inline
	228	INLINE_FUN
228	229	const gsl_complex_float *
229	230	gsl_vector_complex_float_const_ptr (const gsl_vector_complex_float * v,
230	231	const size_t i)
231	232	{
232	233	#if GSL_RANGE_CHECK
233		if (i >= v->size)
	234	if (GSL_RANGE_COND(i >= v->size))
234	235	{
235	236	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
236	237	}

+21

-20

vector/gsl_vector_complex_long_double.h less more

140	140
141	141
142	142	/* Operations */
143
144		gsl_complex_long_double
145		gsl_vector_complex_long_double_get (const gsl_vector_complex_long_double * v, const size_t i);
146
147		void gsl_vector_complex_long_double_set (gsl_vector_complex_long_double * v, const size_t i,
148		gsl_complex_long_double z);
149
150		gsl_complex_long_double
151		gsl_vector_complex_long_double_ptr (gsl_vector_complex_long_double v, const size_t i);
152
153		const gsl_complex_long_double
154		gsl_vector_complex_long_double_const_ptr (const gsl_vector_complex_long_double v, const size_t i);
155	143
156	144	void gsl_vector_complex_long_double_set_zero (gsl_vector_complex_long_double * v);
157	145	void gsl_vector_complex_long_double_set_all (gsl_vector_complex_long_double * v,

178	166	int gsl_vector_complex_long_double_isnull (const gsl_vector_complex_long_double * v);
179	167	int gsl_vector_complex_long_double_ispos (const gsl_vector_complex_long_double * v);
180	168	int gsl_vector_complex_long_double_isneg (const gsl_vector_complex_long_double * v);
	169	int gsl_vector_complex_long_double_isnonneg (const gsl_vector_complex_long_double * v);
	170
	171	int gsl_vector_complex_long_double_add (gsl_vector_complex_long_double * a, const gsl_vector_complex_long_double * b);
	172	int gsl_vector_complex_long_double_sub (gsl_vector_complex_long_double * a, const gsl_vector_complex_long_double * b);
	173	int gsl_vector_complex_long_double_mul (gsl_vector_complex_long_double * a, const gsl_vector_complex_long_double * b);
	174	int gsl_vector_complex_long_double_div (gsl_vector_complex_long_double * a, const gsl_vector_complex_long_double * b);
	175	int gsl_vector_complex_long_double_scale (gsl_vector_complex_long_double * a, const gsl_complex_long_double x);
	176	int gsl_vector_complex_long_double_add_constant (gsl_vector_complex_long_double * a, const gsl_complex_long_double x);
	177
	178	INLINE_DECL gsl_complex_long_double gsl_vector_complex_long_double_get (const gsl_vector_complex_long_double * v, const size_t i);
	179	INLINE_DECL void gsl_vector_complex_long_double_set (gsl_vector_complex_long_double * v, const size_t i, gsl_complex_long_double z);
	180	INLINE_DECL gsl_complex_long_double gsl_vector_complex_long_double_ptr (gsl_vector_complex_long_double v, const size_t i);
	181	INLINE_DECL const gsl_complex_long_double gsl_vector_complex_long_double_const_ptr (const gsl_vector_complex_long_double v, const size_t i);
181	182
182	183	#ifdef HAVE_INLINE
183	184
184		extern inline
	185	INLINE_FUN
185	186	gsl_complex_long_double
186	187	gsl_vector_complex_long_double_get (const gsl_vector_complex_long_double * v,
187	188	const size_t i)
188	189	{
189	190	#if GSL_RANGE_CHECK
190		if (i >= v->size)
	191	if (GSL_RANGE_COND(i >= v->size))
191	192	{
192	193	gsl_complex_long_double zero = {{0, 0}};
193	194	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, zero);

196	197	return *GSL_COMPLEX_LONG_DOUBLE_AT (v, i);
197	198	}
198	199
199		extern inline
	200	INLINE_FUN
200	201	void
201	202	gsl_vector_complex_long_double_set (gsl_vector_complex_long_double * v,
202	203	const size_t i, gsl_complex_long_double z)
203	204	{
204	205	#if GSL_RANGE_CHECK
205		if (i >= v->size)
	206	if (GSL_RANGE_COND(i >= v->size))
206	207	{
207	208	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
208	209	}

210	211	*GSL_COMPLEX_LONG_DOUBLE_AT (v, i) = z;
211	212	}
212	213
213		extern inline
	214	INLINE_FUN
214	215	gsl_complex_long_double *
215	216	gsl_vector_complex_long_double_ptr (gsl_vector_complex_long_double * v,
216	217	const size_t i)
217	218	{
218	219	#if GSL_RANGE_CHECK
219		if (i >= v->size)
	220	if (GSL_RANGE_COND(i >= v->size))
220	221	{
221	222	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
222	223	}

224	225	return GSL_COMPLEX_LONG_DOUBLE_AT (v, i);
225	226	}
226	227
227		extern inline
	228	INLINE_FUN
228	229	const gsl_complex_long_double *
229	230	gsl_vector_complex_long_double_const_ptr (const gsl_vector_complex_long_double * v,
230	231	const size_t i)
231	232	{
232	233	#if GSL_RANGE_CHECK
233		if (i >= v->size)
	234	if (GSL_RANGE_COND(i >= v->size))
234	235	{
235	236	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
236	237	}

+14

-16

vector/gsl_vector_double.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_double.h>
27	28

121	122
122	123	/* Operations */
123	124
124		double gsl_vector_get (const gsl_vector * v, const size_t i);
125		void gsl_vector_set (gsl_vector * v, const size_t i, double x);
126
127		double gsl_vector_ptr (gsl_vector v, const size_t i);
128		const double gsl_vector_const_ptr (const gsl_vector v, const size_t i);
129
130	125	void gsl_vector_set_zero (gsl_vector * v);
131	126	void gsl_vector_set_all (gsl_vector * v, double x);
132	127	int gsl_vector_set_basis (gsl_vector * v, size_t i);

164	159	int gsl_vector_isneg (const gsl_vector * v);
165	160	int gsl_vector_isnonneg (const gsl_vector * v);
166	161
	162	INLINE_DECL double gsl_vector_get (const gsl_vector * v, const size_t i);
	163	INLINE_DECL void gsl_vector_set (gsl_vector * v, const size_t i, double x);
	164	INLINE_DECL double * gsl_vector_ptr (gsl_vector * v, const size_t i);
	165	INLINE_DECL const double * gsl_vector_const_ptr (const gsl_vector * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	double
171	171	gsl_vector_get (const gsl_vector * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_set (gsl_vector * v, const size_t i, double x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	double *
197	197	gsl_vector_ptr (gsl_vector * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (double ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const double *
210	210	gsl_vector_const_ptr (const gsl_vector * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const double ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_float.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_float.h>
27	28

121	122
122	123	/* Operations */
123	124
124		float gsl_vector_float_get (const gsl_vector_float * v, const size_t i);
125		void gsl_vector_float_set (gsl_vector_float * v, const size_t i, float x);
126
127		float gsl_vector_float_ptr (gsl_vector_float v, const size_t i);
128		const float gsl_vector_float_const_ptr (const gsl_vector_float v, const size_t i);
129
130	125	void gsl_vector_float_set_zero (gsl_vector_float * v);
131	126	void gsl_vector_float_set_all (gsl_vector_float * v, float x);
132	127	int gsl_vector_float_set_basis (gsl_vector_float * v, size_t i);

164	159	int gsl_vector_float_isneg (const gsl_vector_float * v);
165	160	int gsl_vector_float_isnonneg (const gsl_vector_float * v);
166	161
	162	INLINE_DECL float gsl_vector_float_get (const gsl_vector_float * v, const size_t i);
	163	INLINE_DECL void gsl_vector_float_set (gsl_vector_float * v, const size_t i, float x);
	164	INLINE_DECL float * gsl_vector_float_ptr (gsl_vector_float * v, const size_t i);
	165	INLINE_DECL const float * gsl_vector_float_const_ptr (const gsl_vector_float * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	float
171	171	gsl_vector_float_get (const gsl_vector_float * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_float_set (gsl_vector_float * v, const size_t i, float x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	float *
197	197	gsl_vector_float_ptr (gsl_vector_float * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (float ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const float *
210	210	gsl_vector_float_const_ptr (const gsl_vector_float * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const float ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_int.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_int.h>
27	28

121	122
122	123	/* Operations */
123	124
124		int gsl_vector_int_get (const gsl_vector_int * v, const size_t i);
125		void gsl_vector_int_set (gsl_vector_int * v, const size_t i, int x);
126
127		int gsl_vector_int_ptr (gsl_vector_int v, const size_t i);
128		const int gsl_vector_int_const_ptr (const gsl_vector_int v, const size_t i);
129
130	125	void gsl_vector_int_set_zero (gsl_vector_int * v);
131	126	void gsl_vector_int_set_all (gsl_vector_int * v, int x);
132	127	int gsl_vector_int_set_basis (gsl_vector_int * v, size_t i);

164	159	int gsl_vector_int_isneg (const gsl_vector_int * v);
165	160	int gsl_vector_int_isnonneg (const gsl_vector_int * v);
166	161
	162	INLINE_DECL int gsl_vector_int_get (const gsl_vector_int * v, const size_t i);
	163	INLINE_DECL void gsl_vector_int_set (gsl_vector_int * v, const size_t i, int x);
	164	INLINE_DECL int * gsl_vector_int_ptr (gsl_vector_int * v, const size_t i);
	165	INLINE_DECL const int * gsl_vector_int_const_ptr (const gsl_vector_int * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	int
171	171	gsl_vector_int_get (const gsl_vector_int * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_int_set (gsl_vector_int * v, const size_t i, int x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	int *
197	197	gsl_vector_int_ptr (gsl_vector_int * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (int ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const int *
210	210	gsl_vector_int_const_ptr (const gsl_vector_int * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const int ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_long.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_long.h>
27	28

121	122
122	123	/* Operations */
123	124
124		long gsl_vector_long_get (const gsl_vector_long * v, const size_t i);
125		void gsl_vector_long_set (gsl_vector_long * v, const size_t i, long x);
126
127		long gsl_vector_long_ptr (gsl_vector_long v, const size_t i);
128		const long gsl_vector_long_const_ptr (const gsl_vector_long v, const size_t i);
129
130	125	void gsl_vector_long_set_zero (gsl_vector_long * v);
131	126	void gsl_vector_long_set_all (gsl_vector_long * v, long x);
132	127	int gsl_vector_long_set_basis (gsl_vector_long * v, size_t i);

164	159	int gsl_vector_long_isneg (const gsl_vector_long * v);
165	160	int gsl_vector_long_isnonneg (const gsl_vector_long * v);
166	161
	162	INLINE_DECL long gsl_vector_long_get (const gsl_vector_long * v, const size_t i);
	163	INLINE_DECL void gsl_vector_long_set (gsl_vector_long * v, const size_t i, long x);
	164	INLINE_DECL long * gsl_vector_long_ptr (gsl_vector_long * v, const size_t i);
	165	INLINE_DECL const long * gsl_vector_long_const_ptr (const gsl_vector_long * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	long
171	171	gsl_vector_long_get (const gsl_vector_long * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_long_set (gsl_vector_long * v, const size_t i, long x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	long *
197	197	gsl_vector_long_ptr (gsl_vector_long * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (long ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const long *
210	210	gsl_vector_long_const_ptr (const gsl_vector_long * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const long ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_long_double.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_long_double.h>
27	28

121	122
122	123	/* Operations */
123	124
124		long double gsl_vector_long_double_get (const gsl_vector_long_double * v, const size_t i);
125		void gsl_vector_long_double_set (gsl_vector_long_double * v, const size_t i, long double x);
126
127		long double gsl_vector_long_double_ptr (gsl_vector_long_double v, const size_t i);
128		const long double gsl_vector_long_double_const_ptr (const gsl_vector_long_double v, const size_t i);
129
130	125	void gsl_vector_long_double_set_zero (gsl_vector_long_double * v);
131	126	void gsl_vector_long_double_set_all (gsl_vector_long_double * v, long double x);
132	127	int gsl_vector_long_double_set_basis (gsl_vector_long_double * v, size_t i);

164	159	int gsl_vector_long_double_isneg (const gsl_vector_long_double * v);
165	160	int gsl_vector_long_double_isnonneg (const gsl_vector_long_double * v);
166	161
	162	INLINE_DECL long double gsl_vector_long_double_get (const gsl_vector_long_double * v, const size_t i);
	163	INLINE_DECL void gsl_vector_long_double_set (gsl_vector_long_double * v, const size_t i, long double x);
	164	INLINE_DECL long double * gsl_vector_long_double_ptr (gsl_vector_long_double * v, const size_t i);
	165	INLINE_DECL const long double * gsl_vector_long_double_const_ptr (const gsl_vector_long_double * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	long double
171	171	gsl_vector_long_double_get (const gsl_vector_long_double * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_long_double_set (gsl_vector_long_double * v, const size_t i, long double x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	long double *
197	197	gsl_vector_long_double_ptr (gsl_vector_long_double * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (long double ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const long double *
210	210	gsl_vector_long_double_const_ptr (const gsl_vector_long_double * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const long double ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_short.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_short.h>
27	28

121	122
122	123	/* Operations */
123	124
124		short gsl_vector_short_get (const gsl_vector_short * v, const size_t i);
125		void gsl_vector_short_set (gsl_vector_short * v, const size_t i, short x);
126
127		short gsl_vector_short_ptr (gsl_vector_short v, const size_t i);
128		const short gsl_vector_short_const_ptr (const gsl_vector_short v, const size_t i);
129
130	125	void gsl_vector_short_set_zero (gsl_vector_short * v);
131	126	void gsl_vector_short_set_all (gsl_vector_short * v, short x);
132	127	int gsl_vector_short_set_basis (gsl_vector_short * v, size_t i);

164	159	int gsl_vector_short_isneg (const gsl_vector_short * v);
165	160	int gsl_vector_short_isnonneg (const gsl_vector_short * v);
166	161
	162	INLINE_DECL short gsl_vector_short_get (const gsl_vector_short * v, const size_t i);
	163	INLINE_DECL void gsl_vector_short_set (gsl_vector_short * v, const size_t i, short x);
	164	INLINE_DECL short * gsl_vector_short_ptr (gsl_vector_short * v, const size_t i);
	165	INLINE_DECL const short * gsl_vector_short_const_ptr (const gsl_vector_short * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	short
171	171	gsl_vector_short_get (const gsl_vector_short * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_short_set (gsl_vector_short * v, const size_t i, short x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	short *
197	197	gsl_vector_short_ptr (gsl_vector_short * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (short ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const short *
210	210	gsl_vector_short_const_ptr (const gsl_vector_short * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const short ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_uchar.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_uchar.h>
27	28

121	122
122	123	/* Operations */
123	124
124		unsigned char gsl_vector_uchar_get (const gsl_vector_uchar * v, const size_t i);
125		void gsl_vector_uchar_set (gsl_vector_uchar * v, const size_t i, unsigned char x);
126
127		unsigned char gsl_vector_uchar_ptr (gsl_vector_uchar v, const size_t i);
128		const unsigned char gsl_vector_uchar_const_ptr (const gsl_vector_uchar v, const size_t i);
129
130	125	void gsl_vector_uchar_set_zero (gsl_vector_uchar * v);
131	126	void gsl_vector_uchar_set_all (gsl_vector_uchar * v, unsigned char x);
132	127	int gsl_vector_uchar_set_basis (gsl_vector_uchar * v, size_t i);

164	159	int gsl_vector_uchar_isneg (const gsl_vector_uchar * v);
165	160	int gsl_vector_uchar_isnonneg (const gsl_vector_uchar * v);
166	161
	162	INLINE_DECL unsigned char gsl_vector_uchar_get (const gsl_vector_uchar * v, const size_t i);
	163	INLINE_DECL void gsl_vector_uchar_set (gsl_vector_uchar * v, const size_t i, unsigned char x);
	164	INLINE_DECL unsigned char * gsl_vector_uchar_ptr (gsl_vector_uchar * v, const size_t i);
	165	INLINE_DECL const unsigned char * gsl_vector_uchar_const_ptr (const gsl_vector_uchar * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	unsigned char
171	171	gsl_vector_uchar_get (const gsl_vector_uchar * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_uchar_set (gsl_vector_uchar * v, const size_t i, unsigned char x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	unsigned char *
197	197	gsl_vector_uchar_ptr (gsl_vector_uchar * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (unsigned char ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const unsigned char *
210	210	gsl_vector_uchar_const_ptr (const gsl_vector_uchar * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const unsigned char ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_uint.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_uint.h>
27	28

121	122
122	123	/* Operations */
123	124
124		unsigned int gsl_vector_uint_get (const gsl_vector_uint * v, const size_t i);
125		void gsl_vector_uint_set (gsl_vector_uint * v, const size_t i, unsigned int x);
126
127		unsigned int gsl_vector_uint_ptr (gsl_vector_uint v, const size_t i);
128		const unsigned int gsl_vector_uint_const_ptr (const gsl_vector_uint v, const size_t i);
129
130	125	void gsl_vector_uint_set_zero (gsl_vector_uint * v);
131	126	void gsl_vector_uint_set_all (gsl_vector_uint * v, unsigned int x);
132	127	int gsl_vector_uint_set_basis (gsl_vector_uint * v, size_t i);

164	159	int gsl_vector_uint_isneg (const gsl_vector_uint * v);
165	160	int gsl_vector_uint_isnonneg (const gsl_vector_uint * v);
166	161
	162	INLINE_DECL unsigned int gsl_vector_uint_get (const gsl_vector_uint * v, const size_t i);
	163	INLINE_DECL void gsl_vector_uint_set (gsl_vector_uint * v, const size_t i, unsigned int x);
	164	INLINE_DECL unsigned int * gsl_vector_uint_ptr (gsl_vector_uint * v, const size_t i);
	165	INLINE_DECL const unsigned int * gsl_vector_uint_const_ptr (const gsl_vector_uint * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	unsigned int
171	171	gsl_vector_uint_get (const gsl_vector_uint * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_uint_set (gsl_vector_uint * v, const size_t i, unsigned int x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	unsigned int *
197	197	gsl_vector_uint_ptr (gsl_vector_uint * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (unsigned int ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const unsigned int *
210	210	gsl_vector_uint_const_ptr (const gsl_vector_uint * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const unsigned int ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_ulong.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_ulong.h>
27	28

121	122
122	123	/* Operations */
123	124
124		unsigned long gsl_vector_ulong_get (const gsl_vector_ulong * v, const size_t i);
125		void gsl_vector_ulong_set (gsl_vector_ulong * v, const size_t i, unsigned long x);
126
127		unsigned long gsl_vector_ulong_ptr (gsl_vector_ulong v, const size_t i);
128		const unsigned long gsl_vector_ulong_const_ptr (const gsl_vector_ulong v, const size_t i);
129
130	125	void gsl_vector_ulong_set_zero (gsl_vector_ulong * v);
131	126	void gsl_vector_ulong_set_all (gsl_vector_ulong * v, unsigned long x);
132	127	int gsl_vector_ulong_set_basis (gsl_vector_ulong * v, size_t i);

164	159	int gsl_vector_ulong_isneg (const gsl_vector_ulong * v);
165	160	int gsl_vector_ulong_isnonneg (const gsl_vector_ulong * v);
166	161
	162	INLINE_DECL unsigned long gsl_vector_ulong_get (const gsl_vector_ulong * v, const size_t i);
	163	INLINE_DECL void gsl_vector_ulong_set (gsl_vector_ulong * v, const size_t i, unsigned long x);
	164	INLINE_DECL unsigned long * gsl_vector_ulong_ptr (gsl_vector_ulong * v, const size_t i);
	165	INLINE_DECL const unsigned long * gsl_vector_ulong_const_ptr (const gsl_vector_ulong * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	unsigned long
171	171	gsl_vector_ulong_get (const gsl_vector_ulong * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_ulong_set (gsl_vector_ulong * v, const size_t i, unsigned long x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	unsigned long *
197	197	gsl_vector_ulong_ptr (gsl_vector_ulong * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (unsigned long ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const unsigned long *
210	210	gsl_vector_ulong_const_ptr (const gsl_vector_ulong * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const unsigned long ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+14

-16

vector/gsl_vector_ushort.h less more

22	22	#include <stdlib.h>
23	23	#include <gsl/gsl_types.h>
24	24	#include <gsl/gsl_errno.h>
	25	#include <gsl/gsl_inline.h>
25	26	#include <gsl/gsl_check_range.h>
26	27	#include <gsl/gsl_block_ushort.h>
27	28

121	122
122	123	/* Operations */
123	124
124		unsigned short gsl_vector_ushort_get (const gsl_vector_ushort * v, const size_t i);
125		void gsl_vector_ushort_set (gsl_vector_ushort * v, const size_t i, unsigned short x);
126
127		unsigned short gsl_vector_ushort_ptr (gsl_vector_ushort v, const size_t i);
128		const unsigned short gsl_vector_ushort_const_ptr (const gsl_vector_ushort v, const size_t i);
129
130	125	void gsl_vector_ushort_set_zero (gsl_vector_ushort * v);
131	126	void gsl_vector_ushort_set_all (gsl_vector_ushort * v, unsigned short x);
132	127	int gsl_vector_ushort_set_basis (gsl_vector_ushort * v, size_t i);

164	159	int gsl_vector_ushort_isneg (const gsl_vector_ushort * v);
165	160	int gsl_vector_ushort_isnonneg (const gsl_vector_ushort * v);
166	161
	162	INLINE_DECL unsigned short gsl_vector_ushort_get (const gsl_vector_ushort * v, const size_t i);
	163	INLINE_DECL void gsl_vector_ushort_set (gsl_vector_ushort * v, const size_t i, unsigned short x);
	164	INLINE_DECL unsigned short * gsl_vector_ushort_ptr (gsl_vector_ushort * v, const size_t i);
	165	INLINE_DECL const unsigned short * gsl_vector_ushort_const_ptr (const gsl_vector_ushort * v, const size_t i);
	166
167	167	#ifdef HAVE_INLINE
168	168
169		extern inline
	169	INLINE_FUN
170	170	unsigned short
171	171	gsl_vector_ushort_get (const gsl_vector_ushort * v, const size_t i)
172	172	{
173	173	#if GSL_RANGE_CHECK
174		if (i >= v->size)
	174	if (GSL_RANGE_COND(i >= v->size))
175	175	{
176	176	GSL_ERROR_VAL ("index out of range", GSL_EINVAL, 0);
177	177	}

179	179	return v->data[i * v->stride];
180	180	}
181	181
182		extern inline
	182	INLINE_FUN
183	183	void
184	184	gsl_vector_ushort_set (gsl_vector_ushort * v, const size_t i, unsigned short x)
185	185	{
186	186	#if GSL_RANGE_CHECK
187		if (i >= v->size)
	187	if (GSL_RANGE_COND(i >= v->size))
188	188	{
189	189	GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
190	190	}

192	192	v->data[i * v->stride] = x;
193	193	}
194	194
195		extern inline
	195	INLINE_FUN
196	196	unsigned short *
197	197	gsl_vector_ushort_ptr (gsl_vector_ushort * v, const size_t i)
198	198	{
199	199	#if GSL_RANGE_CHECK
200		if (i >= v->size)
	200	if (GSL_RANGE_COND(i >= v->size))
201	201	{
202	202	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
203	203	}

205	205	return (unsigned short ) (v->data + i v->stride);
206	206	}
207	207
208		extern inline
	208	INLINE_FUN
209	209	const unsigned short *
210	210	gsl_vector_ushort_const_ptr (const gsl_vector_ushort * v, const size_t i)
211	211	{
212	212	#if GSL_RANGE_CHECK
213		if (i >= v->size)
	213	if (GSL_RANGE_COND(i >= v->size))
214	214	{
215	215	GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
216	216	}
217	217	#endif
218	218	return (const unsigned short ) (v->data + i v->stride);
219	219	}
220
221
222	220	#endif /* HAVE_INLINE */
223	221
224	222	__END_DECLS

+20

-0

vector/oper.c less more

0	0	#include <config.h>
1	1	#include <stdlib.h>
	2	#include <math.h>
	3	#include <gsl/gsl_math.h>
2	4	#include <gsl/gsl_vector.h>
	5
	6	#define BASE_GSL_COMPLEX_LONG
	7	#include "templates_on.h"
	8	#include "oper_complex_source.c"
	9	#include "templates_off.h"
	10	#undef BASE_GSL_COMPLEX_LONG
	11
	12	#define BASE_GSL_COMPLEX
	13	#include "templates_on.h"
	14	#include "oper_complex_source.c"
	15	#include "templates_off.h"
	16	#undef BASE_GSL_COMPLEX
	17
	18	#define BASE_GSL_COMPLEX_FLOAT
	19	#include "templates_on.h"
	20	#include "oper_complex_source.c"
	21	#include "templates_off.h"
	22	#undef BASE_GSL_COMPLEX_FLOAT
3	23
4	24	#define BASE_LONG_DOUBLE
5	25	#include "templates_on.h"

+182

-0

vector/oper_complex_source.c less more

	0	/* vector/oper_source.c
	1	*
	2	* Copyright (C) 2008 Brian Gough
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License as published by
	6	* the Free Software Foundation; either version 3 of the License, or (at
	7	* your option) any later version.
	8	*
	9	* This program is distributed in the hope that it will be useful, but
	10	* WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	12	* General Public License for more details.
	13	*
	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write to the Free Software
	16	* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
	17	*/
	18
	19	int
	20	FUNCTION(gsl_vector, add) (TYPE(gsl_vector) * a, const TYPE(gsl_vector) * b)
	21	{
	22	const size_t N = a->size;
	23
	24	if (b->size != N)
	25	{
	26	GSL_ERROR ("vectors must have same length", GSL_EBADLEN);
	27	}
	28	else
	29	{
	30	const size_t stride_a = a->stride;
	31	const size_t stride_b = b->stride;
	32
	33	size_t i;
	34
	35	for (i = 0; i < N; i++)
	36	{
	37	a->data[2 * i * stride_a] += b->data[2 * i * stride_b];
	38	a->data[2 * i * stride_a + 1] += b->data[2 * i * stride_b + 1];
	39	}
	40
	41	return GSL_SUCCESS;
	42	}
	43	}
	44
	45	int
	46	FUNCTION(gsl_vector, sub) (TYPE(gsl_vector) * a, const TYPE(gsl_vector) * b)
	47	{
	48	const size_t N = a->size;
	49
	50	if (b->size != N)
	51	{
	52	GSL_ERROR ("vectors must have same length", GSL_EBADLEN);
	53	}
	54	else
	55	{
	56	const size_t stride_a = a->stride;
	57	const size_t stride_b = b->stride;
	58
	59	size_t i;
	60
	61	for (i = 0; i < N; i++)
	62	{
	63	a->data[2 * i * stride_a] -= b->data[2 * i * stride_b];
	64	a->data[2 * i * stride_a + 1] -= b->data[2 * i * stride_b + 1];
	65	}
	66
	67	return GSL_SUCCESS;
	68	}
	69	}
	70
	71	int
	72	FUNCTION(gsl_vector, mul) (TYPE(gsl_vector) * a, const TYPE(gsl_vector) * b)
	73	{
	74	const size_t N = a->size;
	75
	76	if (b->size != N)
	77	{
	78	GSL_ERROR ("vectors must have same length", GSL_EBADLEN);
	79	}
	80	else
	81	{
	82	const size_t stride_a = a->stride;
	83	const size_t stride_b = b->stride;
	84
	85	size_t i;
	86
	87	for (i = 0; i < N; i++)
	88	{
	89	ATOMIC ar = a->data[2 * i * stride_a];
	90	ATOMIC ai = a->data[2 * i * stride_a + 1];
	91
	92	ATOMIC br = b->data[2 * i * stride_b];
	93	ATOMIC bi = b->data[2 * i * stride_b + 1];
	94
	95	a->data[2 * i * stride_a] = ar * br - ai * bi;
	96	a->data[2 * i * stride_a + 1] = ar * bi + ai * br;
	97	}
	98
	99	return GSL_SUCCESS;
	100	}
	101	}
	102
	103	int
	104	FUNCTION(gsl_vector, div) (TYPE(gsl_vector) * a, const TYPE(gsl_vector) * b)
	105	{
	106	const size_t N = a->size;
	107
	108	if (b->size != N)
	109	{
	110	GSL_ERROR ("vectors must have same length", GSL_EBADLEN);
	111	}
	112	else
	113	{
	114	const size_t stride_a = a->stride;
	115	const size_t stride_b = b->stride;
	116
	117	size_t i;
	118
	119	for (i = 0; i < N; i++)
	120	{
	121	ATOMIC ar = a->data[2 * i * stride_a];
	122	ATOMIC ai = a->data[2 * i * stride_a + 1];
	123
	124	ATOMIC br = b->data[2 * i * stride_b];
	125	ATOMIC bi = b->data[2 * i * stride_b + 1];
	126
	127	ATOMIC s = 1.0 / hypot(br, bi);
	128
	129	ATOMIC sbr = s * br;
	130	ATOMIC sbi = s * bi;
	131
	132	a->data[2 * i * stride_a] = (ar * sbr + ai * sbi) * s;
	133	a->data[2 * i * stride_a + 1] = (ai * sbr - ar * sbi) * s;
	134	}
	135
	136	return GSL_SUCCESS;
	137	}
	138	}
	139
	140	int
	141	FUNCTION(gsl_vector, scale) (TYPE(gsl_vector) * a, const BASE x)
	142	{
	143	const size_t N = a->size;
	144	const size_t stride = a->stride;
	145
	146	size_t i;
	147
	148	ATOMIC xr = GSL_REAL(x);
	149	ATOMIC xi = GSL_IMAG(x);
	150
	151	for (i = 0; i < N; i++)
	152	{
	153	ATOMIC ar = a->data[2 * i * stride];
	154	ATOMIC ai = a->data[2 * i * stride + 1];
	155
	156	a->data[2 * i * stride] = ar * xr - ai * xi;
	157	a->data[2 * i * stride + 1] = ar * xi + ai * xr;
	158	}
	159
	160	return GSL_SUCCESS;
	161	}
	162
	163	int
	164	FUNCTION(gsl_vector, add_constant) (TYPE(gsl_vector) * a, const BASE x)
	165	{
	166	const size_t N = a->size;
	167	const size_t stride = a->stride;
	168
	169	size_t i;
	170
	171	ATOMIC xr = GSL_REAL(x);
	172	ATOMIC xi = GSL_IMAG(x);
	173
	174	for (i = 0; i < N; i++)
	175	{
	176	a->data[2 * i * stride] += xr;
	177	a->data[2 * i * stride + 1] += xi;
	178	}
	179
	180	return GSL_SUCCESS;
	181	}

+3

-2

vector/test.c less more

37	37	#define DESC ""
38	38	#endif
39	39
40
41	40	#define BASE_GSL_COMPLEX_LONG
42	41	#include "templates_on.h"
43	42	#include "test_complex_source.c"
44	43	#include "templates_off.h"
45	44	#undef BASE_GSL_COMPLEX_LONG
46
47	45
48	46	#define BASE_GSL_COMPLEX
49	47	#include "templates_on.h"

166	164	test_short_ops (stride, ostride, N);
167	165	test_uchar_ops (stride, ostride, N);
168	166	test_char_ops (stride, ostride, N);
	167	test_complex_ops (stride, ostride, N);
	168	test_complex_float_ops (stride, ostride, N);
	169	test_complex_long_double_ops (stride, ostride, N);
169	170	}
170	171
171	172	test_text (stride, N);

+192

-0

vector/test_complex_source.c less more

266	266	TEST (status, "_setbasis" DESC " over range") ;
267	267	}
268	268
	269	{
	270	int status = 0;
	271
	272	for (i = 0; i < N; i++)
	273	{
	274	BASE x = ZERO;
	275	GSL_REAL (x) = (ATOMIC)i;
	276	GSL_IMAG (x) = (ATOMIC)(i + 1234);
	277	FUNCTION (gsl_vector, set) (v, i, x);
	278	}
	279
	280	{
	281	BASE x = ZERO;
	282	GSL_REAL(x) = 2.0;
	283	GSL_IMAG(x) = 3.0;
	284	FUNCTION (gsl_vector, scale) (v, x);
	285	}
	286
	287	for (i = 0; i < N; i++)
	288	{
	289	BASE r = FUNCTION(gsl_vector,get) (v,i);
	290	ATOMIC real = -(ATOMIC)i-(ATOMIC)3702;
	291	ATOMIC imag = 5*(ATOMIC)i+(ATOMIC)2468;
	292	if (GSL_REAL(r) != real \|\| GSL_IMAG(r) != imag)
	293	status = 1;
	294	};
	295
	296	TEST (status, "_scale" DESC " by 2") ;
	297	}
	298
	299	{
	300	int status = 0;
	301
	302	{
	303	BASE x = ZERO;
	304	GSL_REAL(x) = 7.0;
	305	GSL_IMAG(x) = 13.0;
	306	FUNCTION (gsl_vector, add_constant) (v, x);
	307	}
	308
	309
	310	for (i = 0; i < N; i++)
	311	{
	312	BASE r = FUNCTION(gsl_vector,get) (v,i);
	313	ATOMIC real = -(ATOMIC)i-(ATOMIC)3695;
	314	ATOMIC imag = 5*(ATOMIC)i+(ATOMIC)2481;
	315
	316	if (GSL_REAL(r) != real \|\| GSL_IMAG(r) != imag)
	317	status = 1;
	318	};
	319
	320	TEST (status, "_add_constant" DESC) ;
	321	}
	322
269	323	for (i = 0; i < N; i++)
270	324	{
271	325	BASE x = ZERO;

424	478
425	479
426	480	FUNCTION (gsl_vector, free) (v0); /* free whatever is in v */
	481	}
	482
	483	void
	484	FUNCTION (test, ops) (size_t stride1, size_t stride2, size_t N)
	485	{
	486	size_t i;
	487	TYPE (gsl_vector) * a = FUNCTION (create, vector) (stride1, N);
	488	TYPE (gsl_vector) * b = FUNCTION (create, vector) (stride2, N);
	489	TYPE (gsl_vector) * v = FUNCTION (create, vector) (stride1, N);
	490
	491	for (i = 0; i < N; i++)
	492	{
	493	BASE z, z1;
	494	GSL_REAL (z) = (ATOMIC) 3+i;
	495	GSL_IMAG (z) = (ATOMIC) (3+i + 10);
	496	GSL_REAL (z1) = (ATOMIC) (3 + 2*i + 5);
	497	GSL_IMAG (z1) = (ATOMIC) (3 + 2*i + 20);
	498
	499	FUNCTION (gsl_vector, set) (a, i, z);
	500	FUNCTION (gsl_vector, set) (b, i, z1);
	501	}
	502
	503	FUNCTION(gsl_vector, memcpy) (v, a);
	504	FUNCTION(gsl_vector, add) (v, b);
	505
	506	{
	507	int status = 0;
	508
	509	for (i = 0; i < N; i++)
	510	{
	511	BASE r = FUNCTION(gsl_vector,get) (v,i);
	512	if (GSL_REAL(r) != (ATOMIC) (3*i+11)
	513	\|\| GSL_IMAG(r) != (ATOMIC) (3*i+36))
	514	status = 1;
	515	}
	516	TEST2 (status, "_add vector addition");
	517	}
	518
	519	{
	520	int status = 0;
	521
	522	FUNCTION(gsl_vector, swap) (a, b);
	523
	524	for (i = 0; i < N; i++)
	525	{
	526	BASE z, z1;
	527
	528	BASE x = FUNCTION (gsl_vector, get) (a, i);
	529	BASE y = FUNCTION (gsl_vector, get) (b, i);
	530
	531	GSL_REAL (z) = (ATOMIC) 3+i;
	532	GSL_IMAG (z) = (ATOMIC) (3+i + 10);
	533	GSL_REAL (z1) = (ATOMIC) (3 + 2*i + 5);
	534	GSL_IMAG (z1) = (ATOMIC) (3 + 2*i + 20);
	535
	536	status \|= !GSL_COMPLEX_EQ(z,y);
	537	status \|= !GSL_COMPLEX_EQ(z1,x);
	538	}
	539
	540	FUNCTION(gsl_vector, swap) (a, b);
	541
	542	for (i = 0; i < N; i++)
	543	{
	544	BASE z, z1;
	545
	546	BASE x = FUNCTION (gsl_vector, get) (a, i);
	547	BASE y = FUNCTION (gsl_vector, get) (b, i);
	548
	549	GSL_REAL (z) = (ATOMIC) 3+i;
	550	GSL_IMAG (z) = (ATOMIC) (3+i + 10);
	551	GSL_REAL (z1) = (ATOMIC) (3 + 2*i + 5);
	552	GSL_IMAG (z1) = (ATOMIC) (3 + 2*i + 20);
	553
	554	status \|= !GSL_COMPLEX_EQ(z,x);
	555	status \|= !GSL_COMPLEX_EQ(z1,y);
	556	}
	557
	558	TEST2 (status, "_swap exchange vectors");
	559	}
	560
	561	FUNCTION(gsl_vector, memcpy) (v, a);
	562	FUNCTION(gsl_vector, sub) (v, b);
	563
	564	{
	565	int status = 0;
	566
	567	for (i = 0; i < N; i++)
	568	{
	569	BASE r = FUNCTION(gsl_vector,get) (v,i);
	570	if (GSL_REAL(r) != (-(ATOMIC)i-(ATOMIC)5) \|\| GSL_IMAG(r) != (-(ATOMIC)i-(ATOMIC)10))
	571	status = 1;
	572	}
	573
	574	TEST2 (status, "_sub vector subtraction");
	575	}
	576
	577	FUNCTION(gsl_vector, memcpy) (v, a);
	578	FUNCTION(gsl_vector, mul) (v, b);
	579
	580	{
	581	int status = 0;
	582
	583	for (i = 0; i < N; i++)
	584	{
	585	BASE r = FUNCTION(gsl_vector,get) (v,i);
	586	ATOMIC real = (-35*(ATOMIC)i-275);
	587	ATOMIC imag = (173+((ATOMIC)i)(63+4(ATOMIC)i));
	588	if (fabs(GSL_REAL(r) - real) > 100 * BASE_EPSILON \|\|
	589	fabs(GSL_IMAG(r) - imag) > 100 * BASE_EPSILON)
	590	status = 1;
	591	}
	592
	593	TEST2 (status, "_mul multiplication");
	594	}
	595
	596	FUNCTION(gsl_vector, memcpy) (v, a);
	597	FUNCTION(gsl_vector, div) (v, b);
	598
	599	{
	600	int status = 0;
	601
	602	for (i = 0; i < N; i++)
	603	{
	604	BASE r = FUNCTION(gsl_vector,get) (v,i);
	605	ATOMIC denom = 593 + ((ATOMIC)i)(124+((ATOMIC)i)8);
	606	ATOMIC real = (323+((ATOMIC)i)(63+4((ATOMIC)i))) / denom;
	607	ATOMIC imag = (35 +((ATOMIC)i)*5) / denom;
	608	if (fabs(GSL_REAL(r) - real) > 100 * BASE_EPSILON)
	609	status = 1;
	610	if (fabs(GSL_IMAG(r) - imag) > 100 * BASE_EPSILON)
	611	status = 1;
	612	}
	613	TEST2 (status, "_div division");
	614	}
	615
	616	FUNCTION(gsl_vector, free) (a);
	617	FUNCTION(gsl_vector, free) (b);
	618	FUNCTION(gsl_vector, free) (v);
427	619	}
428	620
429	621	void

+6

-84

vector/vector.c less more

18	18
19	19	#include <config.h>
20	20	#include <gsl/gsl_errno.h>
	21
	22	/* Compile all the inline functions */
	23
	24	#define COMPILE_INLINE_STATIC
	25	#include "build.h"
21	26	#include <gsl/gsl_vector.h>
22	27
23		/* turn off range checking at runtime if zero */
	28	/* turn on range checking at runtime (disabled if zero) */
24	29	int gsl_check_range = 1;
25	30
26		#define BASE_GSL_COMPLEX_LONG
27		#include "templates_on.h"
28		#include "vector_source.c"
29		#include "templates_off.h"
30		#undef BASE_GSL_COMPLEX_LONG
31
32		#define BASE_GSL_COMPLEX
33		#include "templates_on.h"
34		#include "vector_source.c"
35		#include "templates_off.h"
36		#undef BASE_GSL_COMPLEX
37
38		#define BASE_GSL_COMPLEX_FLOAT
39		#include "templates_on.h"
40		#include "vector_source.c"
41		#include "templates_off.h"
42		#undef BASE_GSL_COMPLEX_FLOAT
43
44		#define BASE_LONG_DOUBLE
45		#include "templates_on.h"
46		#include "vector_source.c"
47		#include "templates_off.h"
48		#undef BASE_LONG_DOUBLE
49
50		#define BASE_DOUBLE
51		#include "templates_on.h"
52		#include "vector_source.c"
53		#include "templates_off.h"
54		#undef BASE_DOUBLE
55
56		#define BASE_FLOAT
57		#include "templates_on.h"
58		#include "vector_source.c"
59		#include "templates_off.h"
60		#undef BASE_FLOAT
61
62		#define BASE_ULONG
63		#include "templates_on.h"
64		#include "vector_source.c"
65		#include "templates_off.h"
66		#undef BASE_ULONG
67
68		#define BASE_LONG
69		#include "templates_on.h"
70		#include "vector_source.c"
71		#include "templates_off.h"
72		#undef BASE_LONG
73
74		#define BASE_UINT
75		#include "templates_on.h"
76		#include "vector_source.c"
77		#include "templates_off.h"
78		#undef BASE_UINT
79
80		#define BASE_INT
81		#include "templates_on.h"
82		#include "vector_source.c"
83		#include "templates_off.h"
84		#undef BASE_INT
85
86		#define BASE_USHORT
87		#include "templates_on.h"
88		#include "vector_source.c"
89		#include "templates_off.h"
90		#undef BASE_USHORT
91
92		#define BASE_SHORT
93		#include "templates_on.h"
94		#include "vector_source.c"
95		#include "templates_off.h"
96		#undef BASE_SHORT
97
98		#define BASE_UCHAR
99		#include "templates_on.h"
100		#include "vector_source.c"
101		#include "templates_off.h"
102		#undef BASE_UCHAR
103
104		#define BASE_CHAR
105		#include "templates_on.h"
106		#include "vector_source.c"
107		#include "templates_off.h"
108		#undef BASE_CHAR

+0

-83

~~vector/vector_source.c~~ less more

0		/* vector/vector_source.c
1		*
2		* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 Gerard Jungman, Brian Gough
3		*
4		* This program is free software; you can redistribute it and/or modify
5		* it under the terms of the GNU General Public License as published by
6		* the Free Software Foundation; either version 3 of the License, or (at
7		* your option) any later version.
8		*
9		* This program is distributed in the hope that it will be useful, but
10		* WITHOUT ANY WARRANTY; without even the implied warranty of
11		* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12		* General Public License for more details.
13		*
14		* You should have received a copy of the GNU General Public License
15		* along with this program; if not, write to the Free Software
16		* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17		*/
18
19		#ifndef HIDE_INLINE_STATIC
20		BASE
21		FUNCTION (gsl_vector, get) (const TYPE (gsl_vector) * v, const size_t i)
22		{
23		if (gsl_check_range)
24		{
25		if (i >= v->size) /* size_t is unsigned, can't be negative */
26		{
27		BASE zero = ZERO;
28		GSL_ERROR_VAL ("index out of range", GSL_EINVAL, zero);
29		}
30		}
31
32		/* The following line is a generalization of return v->data[i] */
33
34		return (BASE ) (v->data + MULTIPLICITY * i * v->stride);
35		}
36
37		void
38		FUNCTION (gsl_vector, set) (TYPE (gsl_vector) * v, const size_t i, BASE x)
39		{
40		if (gsl_check_range)
41		{
42		if (i >= v->size) /* size_t is unsigned, can't be negative */
43		{
44		GSL_ERROR_VOID ("index out of range", GSL_EINVAL);
45		}
46		}
47
48		/* The following line is a generalization of v->data[i] = x */
49
50		(BASE ) (v->data + MULTIPLICITY * i * v->stride) = x;
51		}
52
53		BASE *
54		FUNCTION (gsl_vector, ptr) (TYPE (gsl_vector) * v, const size_t i)
55		{
56		if (gsl_check_range)
57		{
58		if (i >= v->size) /* size_t is unsigned, can't be negative */
59		{
60		GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
61		}
62		}
63
64		return (BASE ) (v->data + MULTIPLICITY i * v->stride);
65		}
66
67		const BASE *
68		FUNCTION (gsl_vector, const_ptr) (const TYPE (gsl_vector) * v, const size_t i)
69		{
70		if (gsl_check_range)
71		{
72		if (i >= v->size) /* size_t is unsigned, can't be negative */
73		{
74		GSL_ERROR_NULL ("index out of range", GSL_EINVAL);
75		}
76		}
77
78		/* The following line is a generalization of return v->data[i] */
79
80		return (const BASE ) (v->data + MULTIPLICITY i * v->stride);
81		}
82		#endif

+9

-0

wavelet/ChangeLog less more

	0	2008-10-13 Brian Gough <bjg@network-theory.co.uk>
	1
	2	* test.c (test_2d): change typename variable to name to avoid
	3	conflict with C++ typename keyword
	4
	5	2008-07-03 Brian Gough <bjg@hp2.network-theory.co.uk>
	6
	7	* Makefile.am (INCLUDES): use top_srcdir instead of top_builddir
	8
0	9	2008-01-03 Brian Gough <bjg@network-theory.co.uk>
1	10
2	11	* dwt.c (dwt_step): move pointer dereference out of loop

+1

-1

wavelet/Makefile.am less more

1	1
2	2	pkginclude_HEADERS = gsl_wavelet.h gsl_wavelet2d.h
3	3
4		INCLUDES= -I$(top_builddir)
	4	INCLUDES = -I$(top_srcdir)
5	5
6	6	libgslwavelet_la_SOURCES = dwt.c wavelet.c bspline.c daubechies.c haar.c
7	7

+5

-1

wavelet/Makefile.in less more

134	134	LIBOBJS = @LIBOBJS@
135	135	LIBS = @LIBS@
136	136	LIBTOOL = @LIBTOOL@
	137	LIPO = @LIPO@
137	138	LN_S = @LN_S@
138	139	LTLIBOBJS = @LTLIBOBJS@
139	140	MAINT = @MAINT@

141	142	MKDIR_P = @MKDIR_P@
142	143	NM = @NM@
143	144	NMEDIT = @NMEDIT@
	145	OBJDUMP = @OBJDUMP@
144	146	OBJEXT = @OBJEXT@
	147	OTOOL = @OTOOL@
	148	OTOOL64 = @OTOOL64@
145	149	PACKAGE = @PACKAGE@
146	150	PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
147	151	PACKAGE_NAME = @PACKAGE_NAME@

206	210	top_srcdir = @top_srcdir@
207	211	noinst_LTLIBRARIES = libgslwavelet.la
208	212	pkginclude_HEADERS = gsl_wavelet.h gsl_wavelet2d.h
209		INCLUDES = -I$(top_builddir)
	213	INCLUDES = -I$(top_srcdir)
210	214	libgslwavelet_la_SOURCES = dwt.c wavelet.c bspline.c daubechies.c haar.c
211	215	TESTS = $(check_PROGRAMS)
212	216	test_LDADD = libgslwavelet.la ../blas/libgslblas.la ../cblas/libgslcblas.la ../matrix/libgslmatrix.la ../vector/libgslvector.la ../block/libgslblock.la ../ieee-utils/libgslieeeutils.la ../err/libgslerr.la ../test/libgsltest.la ../sys/libgslsys.la ../utils/libutils.la

+8

-8

wavelet/test.c less more

104	104	gsl_wavelet *w;
105	105
106	106	size_t i;
107		double data = malloc (N stride * sizeof (double));
	107	double data = (double )malloc (N * stride * sizeof (double));
108	108
109	109	for (i = 0; i < N * stride; i++)
110	110	data[i] = 12345.0 + i;

183	183	size_t i;
184	184	size_t j;
185	185
186		double data = malloc (N tda * sizeof (double));
187
188		const char * typename;
189
190		typename = (type == 1) ? "standard" : "nonstd" ;
	186	double data = (double )malloc (N * tda * sizeof (double));
	187
	188	const char * name;
	189
	190	name = (type == 1) ? "standard" : "nonstd" ;
191	191
192	192	for (i = 0; i < N * tda; i++)
193	193	data[i] = 12345.0 + i;

242	242
243	243	gsl_test (fabs (x2 - x1) > N * 1e-15,
244	244	"%s(%d)-2d %s, n = %d, tda = %d, maxerr = %g",
245		gsl_wavelet_name (w), member, typename, N, tda, fabs (x2 - x1));
	245	gsl_wavelet_name (w), member, name, N, tda, fabs (x2 - x1));
246	246	}
247	247
248	248	if (tda > N)

258	258	}
259	259
260	260	gsl_test (status, "%s(%d)-2d %s other data untouched, n = %d, tda = %d",
261		gsl_wavelet_name (w), member, typename, N, tda);
	261	gsl_wavelet_name (w), member, name, N, tda);
262	262	}
263	263
264	264	free (data);