Chris@202: /* idamax.f -- translated by f2c (version 20061008).
Chris@202:    You must link the resulting object file with libf2c:
Chris@202: 	on Microsoft Windows system, link with libf2c.lib;
Chris@202: 	on Linux or Unix systems, link with .../path/to/libf2c.a -lm
Chris@202: 	or, if you install libf2c.a in a standard place, with -lf2c -lm
Chris@202: 	-- in that order, at the end of the command line, as in
Chris@202: 		cc *.o -lf2c -lm
Chris@202: 	Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
Chris@202: 
Chris@202: 		http://www.netlib.org/f2c/libf2c.zip
Chris@202: */
Chris@202: 
Chris@202: #include "f2c.h"
Chris@202: #include "blaswrap.h"
Chris@202: 
Chris@202: integer idamax_(integer *n, doublereal *dx, integer *incx)
Chris@202: {
Chris@202:     /* System generated locals */
Chris@202:     integer ret_val, i__1;
Chris@202:     doublereal d__1;
Chris@202: 
Chris@202:     /* Local variables */
Chris@202:     integer i__, ix;
Chris@202:     doublereal dmax__;
Chris@202: 
Chris@202: /*     .. Scalar Arguments .. */
Chris@202: /*     .. */
Chris@202: /*     .. Array Arguments .. */
Chris@202: /*     .. */
Chris@202: 
Chris@202: /*  Purpose */
Chris@202: /*  ======= */
Chris@202: 
Chris@202: /*     finds the index of element having max. absolute value. */
Chris@202: /*     jack dongarra, linpack, 3/11/78. */
Chris@202: /*     modified 3/93 to return if incx .le. 0. */
Chris@202: /*     modified 12/3/93, array(1) declarations changed to array(*) */
Chris@202: 
Chris@202: 
Chris@202: /*     .. Local Scalars .. */
Chris@202: /*     .. */
Chris@202: /*     .. Intrinsic Functions .. */
Chris@202: /*     .. */
Chris@202:     /* Parameter adjustments */
Chris@202:     --dx;
Chris@202: 
Chris@202:     /* Function Body */
Chris@202:     ret_val = 0;
Chris@202:     if (*n < 1 || *incx <= 0) {
Chris@202: 	return ret_val;
Chris@202:     }
Chris@202:     ret_val = 1;
Chris@202:     if (*n == 1) {
Chris@202: 	return ret_val;
Chris@202:     }
Chris@202:     if (*incx == 1) {
Chris@202: 	goto L20;
Chris@202:     }
Chris@202: 
Chris@202: /*        code for increment not equal to 1 */
Chris@202: 
Chris@202:     ix = 1;
Chris@202:     dmax__ = abs(dx[1]);
Chris@202:     ix += *incx;
Chris@202:     i__1 = *n;
Chris@202:     for (i__ = 2; i__ <= i__1; ++i__) {
Chris@202: 	if ((d__1 = dx[ix], abs(d__1)) <= dmax__) {
Chris@202: 	    goto L5;
Chris@202: 	}
Chris@202: 	ret_val = i__;
Chris@202: 	dmax__ = (d__1 = dx[ix], abs(d__1));
Chris@202: L5:
Chris@202: 	ix += *incx;
Chris@202: /* L10: */
Chris@202:     }
Chris@202:     return ret_val;
Chris@202: 
Chris@202: /*        code for increment equal to 1 */
Chris@202: 
Chris@202: L20:
Chris@202:     dmax__ = abs(dx[1]);
Chris@202:     i__1 = *n;
Chris@202:     for (i__ = 2; i__ <= i__1; ++i__) {
Chris@202: 	if ((d__1 = dx[i__], abs(d__1)) <= dmax__) {
Chris@202: 	    goto L30;
Chris@202: 	}
Chris@202: 	ret_val = i__;
Chris@202: 	dmax__ = (d__1 = dx[i__], abs(d__1));
Chris@202: L30:
Chris@202: 	;
Chris@202:     }
Chris@202:     return ret_val;
Chris@202: } /* idamax_ */