annotate ext/cblas/src/idamax.c @ 495:1bea13b8f951

Style fixes in constant-Q: avoid unsigned, reuse our Window class, fix comments
author Chris Cannam <cannam@all-day-breakfast.com>
date Fri, 31 May 2019 18:25:31 +0100
parents 905e45637745
children
rev   line source
c@427 1 /* idamax.f -- translated by f2c (version 20061008).
c@427 2 You must link the resulting object file with libf2c:
c@427 3 on Microsoft Windows system, link with libf2c.lib;
c@427 4 on Linux or Unix systems, link with .../path/to/libf2c.a -lm
c@427 5 or, if you install libf2c.a in a standard place, with -lf2c -lm
c@427 6 -- in that order, at the end of the command line, as in
c@427 7 cc *.o -lf2c -lm
c@427 8 Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
c@427 9
c@427 10 http://www.netlib.org/f2c/libf2c.zip
c@427 11 */
c@427 12
c@427 13 #include "f2c.h"
c@427 14 #include "blaswrap.h"
c@427 15
c@427 16 integer idamax_(integer *n, doublereal *dx, integer *incx)
c@427 17 {
c@427 18 /* System generated locals */
c@427 19 integer ret_val, i__1;
c@427 20 doublereal d__1;
c@427 21
c@427 22 /* Local variables */
c@427 23 integer i__, ix;
c@427 24 doublereal dmax__;
c@427 25
c@427 26 /* .. Scalar Arguments .. */
c@427 27 /* .. */
c@427 28 /* .. Array Arguments .. */
c@427 29 /* .. */
c@427 30
c@427 31 /* Purpose */
c@427 32 /* ======= */
c@427 33
c@427 34 /* finds the index of element having max. absolute value. */
c@427 35 /* jack dongarra, linpack, 3/11/78. */
c@427 36 /* modified 3/93 to return if incx .le. 0. */
c@427 37 /* modified 12/3/93, array(1) declarations changed to array(*) */
c@427 38
c@427 39
c@427 40 /* .. Local Scalars .. */
c@427 41 /* .. */
c@427 42 /* .. Intrinsic Functions .. */
c@427 43 /* .. */
c@427 44 /* Parameter adjustments */
c@427 45 --dx;
c@427 46
c@427 47 /* Function Body */
c@427 48 ret_val = 0;
c@427 49 if (*n < 1 || *incx <= 0) {
c@427 50 return ret_val;
c@427 51 }
c@427 52 ret_val = 1;
c@427 53 if (*n == 1) {
c@427 54 return ret_val;
c@427 55 }
c@427 56 if (*incx == 1) {
c@427 57 goto L20;
c@427 58 }
c@427 59
c@427 60 /* code for increment not equal to 1 */
c@427 61
c@427 62 ix = 1;
c@427 63 dmax__ = abs(dx[1]);
c@427 64 ix += *incx;
c@427 65 i__1 = *n;
c@427 66 for (i__ = 2; i__ <= i__1; ++i__) {
c@427 67 if ((d__1 = dx[ix], abs(d__1)) <= dmax__) {
c@427 68 goto L5;
c@427 69 }
c@427 70 ret_val = i__;
c@427 71 dmax__ = (d__1 = dx[ix], abs(d__1));
c@427 72 L5:
c@427 73 ix += *incx;
c@427 74 /* L10: */
c@427 75 }
c@427 76 return ret_val;
c@427 77
c@427 78 /* code for increment equal to 1 */
c@427 79
c@427 80 L20:
c@427 81 dmax__ = abs(dx[1]);
c@427 82 i__1 = *n;
c@427 83 for (i__ = 2; i__ <= i__1; ++i__) {
c@427 84 if ((d__1 = dx[i__], abs(d__1)) <= dmax__) {
c@427 85 goto L30;
c@427 86 }
c@427 87 ret_val = i__;
c@427 88 dmax__ = (d__1 = dx[i__], abs(d__1));
c@427 89 L30:
c@427 90 ;
c@427 91 }
c@427 92 return ret_val;
c@427 93 } /* idamax_ */