[file head]:
/* NUMclapack.c */

/* -- LAPACK driver routines (version 3.0) -- Univ. of Tennessee, Univ. of
California Berkeley, NAG Ltd., Courant Institute, Argonne National Lab,
and Rice University October 31, 1999 -- translated by f2c (version
19990503).

Adapted by David Weenink 20021201

djmw 20030205 Latest modification
*/
/* #include "blaswrap.h" */
#include "NUMf2c.h"
#include "NUMclapack.h"
#include "NUMcblas.h"
#include "NUM2.h"
#include "melder.h"

/* Table of constant values */

static long c__0 = 0;
static long c__1 = 1;
static long c_n1 = -1;
static long c__2 = 2;
static long c__3 = 3;
static long c__4 = 4;
static long c__6 = 6;
static long c__10 = 10;
static long c__11 = 11;
static double c_b15 = -.125;
static double c_b49 = 1.;
static double c_b72 = -1.;
static double c_b74 = 0.;
static double c_b108 = 1.;
static double c_b416 = 0.;
static double c_b438 = 1.;

#define MAX(m,n) ((m) > (n) ? (m) : (n))
#define MIN(m,n) ((m) < (n) ? (m) : (n))

#define a_ref(a_1,a_2) a[(a_
... ...

[file tail]:
... ...


ret_val = (long) ((float) MIN (*n1, *n2) * 1.6f);
return ret_val;

L700:

/* ISPEC = 7: number of processors (not used) */

ret_val = 1;
return ret_val;

L800:

/* ISPEC = 8: crossover point for multishift (used by xHSEQR) */

ret_val = 50;
return ret_val;

L900:

/* ISPEC = 9: maximum size of the subproblems at the bottom of the
computation tree in the divide-and-conquer algorithm (used by xGELSD
and xGESDD) */

ret_val = 25;
return ret_val;

L1000:

/* ISPEC = 10: ieee NaN arithmetic can be trusted not to trap

ILAENV = 0 */
ret_val = 1;
if (ret_val == 1)
{
ret_val = NUMlapack_ieeeck (&amt;c__0, &amt;c_b162, &amt;c_b163);
}
return ret_val;

L1100:

/* ISPEC = 11: infinity arithmetic can be trusted not to trap

ILAENV = 0 */
ret_val = 1;
if (ret_val == 1)
{
ret_val = NUMlapack_ieeeck (&amt;c__1, &amt;c_b162, &amt;c_b163);
}
return ret_val;
} /* NUMlapack_ilaenv */

#undef a_ref
#undef c___ref

#undef MAX
#undef MIN

/* End of file NUMclapack.c */