1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/* blas/idamax.f -- translated by f2c (version 20050501).
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 "v3p_netlib.h"
/*< integer function idamax(n,dx,incx) >*/
integer idamax_(integer *n, doublereal *dx, integer *incx)
{
/* System generated locals */
integer ret_val, i__1;
doublereal d__1;
/* Local variables */
integer i__, ix;
doublereal dmax__;
/* finds the index of element having max. absolute value. */
/* jack dongarra, linpack, 3/11/78. */
/* modified 3/93 to return if incx .le. 0. */
/* modified 12/3/93, array(1) declarations changed to array(*) */
/*< double precision dx(*),dmax >*/
/*< integer i,incx,ix,n >*/
/*< idamax = 0 >*/
/* Parameter adjustments */
--dx;
/* Function Body */
ret_val = 0;
/*< if( n.lt.1 .or. incx.le.0 ) return >*/
if (*n < 1 || *incx <= 0) {
return ret_val;
}
/*< idamax = 1 >*/
ret_val = 1;
/*< if(n.eq.1)return >*/
if (*n == 1) {
return ret_val;
}
/*< if(incx.eq.1)go to 20 >*/
if (*incx == 1) {
goto L20;
}
/* code for increment not equal to 1 */
/*< ix = 1 >*/
ix = 1;
/*< dmax = dabs(dx(1)) >*/
dmax__ = abs(dx[1]);
/*< ix = ix + incx >*/
ix += *incx;
/*< do 10 i = 2,n >*/
i__1 = *n;
for (i__ = 2; i__ <= i__1; ++i__) {
/*< if(dabs(dx(ix)).le.dmax) go to 5 >*/
if ((d__1 = dx[ix], abs(d__1)) <= dmax__) {
goto L5;
}
/*< idamax = i >*/
ret_val = i__;
/*< dmax = dabs(dx(ix)) >*/
dmax__ = (d__1 = dx[ix], abs(d__1));
/*< 5 ix = ix + incx >*/
L5:
ix += *incx;
/*< 10 continue >*/
/* L10: */
}
/*< return >*/
return ret_val;
/* code for increment equal to 1 */
/*< 20 dmax = dabs(dx(1)) >*/
L20:
dmax__ = abs(dx[1]);
/*< do 30 i = 2,n >*/
i__1 = *n;
for (i__ = 2; i__ <= i__1; ++i__) {
/*< if(dabs(dx(i)).le.dmax) go to 30 >*/
if ((d__1 = dx[i__], abs(d__1)) <= dmax__) {
goto L30;
}
/*< idamax = i >*/
ret_val = i__;
/*< dmax = dabs(dx(i)) >*/
dmax__ = (d__1 = dx[i__], abs(d__1));
/*< 30 continue >*/
L30:
;
}
/*< return >*/
return ret_val;
/*< end >*/
} /* idamax_ */
#ifdef __cplusplus
}
#endif
|
