160 lines
4.4 KiB
C++
160 lines
4.4 KiB
C++
/* fortran/ilazlr.f -- translated by f2c (version 20200916).
|
|
You must link the resulting object file with libf2c:
|
|
on Microsoft Windows system, link with libf2c.lib;
|
|
on Linux or Unix systems, link with .../path/to/libf2c.a -lm
|
|
or, if you install libf2c.a in a standard place, with -lf2c -lm
|
|
-- in that order, at the end of the command line, as in
|
|
cc *.o -lf2c -lm
|
|
Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
|
|
|
|
http://www.netlib.org/f2c/libf2c.zip
|
|
*/
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
#include "lmp_f2c.h"
|
|
|
|
/* > \brief \b ILAZLR scans a matrix for its last non-zero row. */
|
|
|
|
/* =========== DOCUMENTATION =========== */
|
|
|
|
/* Online html documentation available at */
|
|
/* http://www.netlib.org/lapack/explore-html/ */
|
|
|
|
/* > \htmlonly */
|
|
/* > Download ILAZLR + dependencies */
|
|
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/ilazlr.
|
|
f"> */
|
|
/* > [TGZ]</a> */
|
|
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/ilazlr.
|
|
f"> */
|
|
/* > [ZIP]</a> */
|
|
/* > <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/ilazlr.
|
|
f"> */
|
|
/* > [TXT]</a> */
|
|
/* > \endhtmlonly */
|
|
|
|
/* Definition: */
|
|
/* =========== */
|
|
|
|
/* INTEGER FUNCTION ILAZLR( M, N, A, LDA ) */
|
|
|
|
/* .. Scalar Arguments .. */
|
|
/* INTEGER M, N, LDA */
|
|
/* .. */
|
|
/* .. Array Arguments .. */
|
|
/* COMPLEX*16 A( LDA, * ) */
|
|
/* .. */
|
|
|
|
|
|
/* > \par Purpose: */
|
|
/* ============= */
|
|
/* > */
|
|
/* > \verbatim */
|
|
/* > */
|
|
/* > ILAZLR scans A for its last non-zero row. */
|
|
/* > \endverbatim */
|
|
|
|
/* Arguments: */
|
|
/* ========== */
|
|
|
|
/* > \param[in] M */
|
|
/* > \verbatim */
|
|
/* > M is INTEGER */
|
|
/* > The number of rows of the matrix A. */
|
|
/* > \endverbatim */
|
|
/* > */
|
|
/* > \param[in] N */
|
|
/* > \verbatim */
|
|
/* > N is INTEGER */
|
|
/* > The number of columns of the matrix A. */
|
|
/* > \endverbatim */
|
|
/* > */
|
|
/* > \param[in] A */
|
|
/* > \verbatim */
|
|
/* > A is COMPLEX*16 array, dimension (LDA,N) */
|
|
/* > The m by n matrix A. */
|
|
/* > \endverbatim */
|
|
/* > */
|
|
/* > \param[in] LDA */
|
|
/* > \verbatim */
|
|
/* > LDA is INTEGER */
|
|
/* > The leading dimension of the array A. LDA >= max(1,M). */
|
|
/* > \endverbatim */
|
|
|
|
/* Authors: */
|
|
/* ======== */
|
|
|
|
/* > \author Univ. of Tennessee */
|
|
/* > \author Univ. of California Berkeley */
|
|
/* > \author Univ. of Colorado Denver */
|
|
/* > \author NAG Ltd. */
|
|
|
|
/* > \ingroup complex16OTHERauxiliary */
|
|
|
|
/* ===================================================================== */
|
|
integer ilazlr_(integer *m, integer *n, doublecomplex *a, integer *lda)
|
|
{
|
|
/* System generated locals */
|
|
integer a_dim1, a_offset, ret_val, i__1, i__2;
|
|
|
|
/* Local variables */
|
|
integer i__, j;
|
|
|
|
|
|
/* -- LAPACK auxiliary routine -- */
|
|
/* -- LAPACK is a software package provided by Univ. of Tennessee, -- */
|
|
/* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..-- */
|
|
|
|
/* .. Scalar Arguments .. */
|
|
/* .. */
|
|
/* .. Array Arguments .. */
|
|
/* .. */
|
|
|
|
/* ===================================================================== */
|
|
|
|
/* .. Parameters .. */
|
|
/* .. */
|
|
/* .. Local Scalars .. */
|
|
/* .. */
|
|
/* .. Executable Statements .. */
|
|
|
|
/* Quick test for the common case where one corner is non-zero. */
|
|
/* Parameter adjustments */
|
|
a_dim1 = *lda;
|
|
a_offset = 1 + a_dim1;
|
|
a -= a_offset;
|
|
|
|
/* Function Body */
|
|
if (*m == 0) {
|
|
ret_val = *m;
|
|
} else /* if(complicated condition) */ {
|
|
i__1 = *m + a_dim1;
|
|
i__2 = *m + *n * a_dim1;
|
|
if (a[i__1].r != 0. || a[i__1].i != 0. || (a[i__2].r != 0. || a[i__2]
|
|
.i != 0.)) {
|
|
ret_val = *m;
|
|
} else {
|
|
/* Scan up each column tracking the last zero row seen. */
|
|
ret_val = 0;
|
|
i__1 = *n;
|
|
for (j = 1; j <= i__1; ++j) {
|
|
i__ = *m;
|
|
for(;;) { /* while(complicated condition) */
|
|
i__2 = max(i__,1) + j * a_dim1;
|
|
if (!(a[i__2].r == 0. && a[i__2].i == 0. && i__ >= 1))
|
|
break;
|
|
--i__;
|
|
}
|
|
ret_val = max(ret_val,i__);
|
|
}
|
|
}
|
|
}
|
|
return ret_val;
|
|
} /* ilazlr_ */
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|