3 #include "gromacs/utility/real.h"
5 #include "../gmx_lapack.h"
6 #include "lapack_limits.h"
9 F77_FUNC(slarrbx,SLARRBX)(int *n,
35 int nint, prev, next, nleft;
36 float right, width, dplus, error;
54 for (i__ = 1; i__ <= i__1; ++i__) {
61 for (i__ = *ifirst; i__ <= i__1; ++i__) {
65 } else if (i__ == *ilast) {
68 d__1 = wgap[ii - 1], d__2 = wgap[ii];
69 gap = (d__1<d__2) ? d__1 : d__2;
82 if (iwork[(i__ << 1) - 1] == 1) {
84 left = w[ii] - werr[ii];
88 if (i__ > i1 && left <= right) {
95 for (j = 1; j <= i__1; ++j) {
97 s = s * lld[j] / dplus - left;
106 if (! (s > 0. || s < 1.)) {
111 for (j = 1; j <= i__1; ++j) {
116 tmp = lld[j] / dplus;
117 if (fabs(tmp)<GMX_FLOAT_MIN) {
129 left -= werr[ii] * fac;
135 i1 = (i1<nleft) ? i1 : nleft;
137 right = w[ii] + werr[ii];
142 for (j = 1; j <= i__1; ++j) {
144 s = s * lld[j] / dplus - right;
153 if (! (s > 0. || s < 1.)) {
158 for (j = 1; j <= i__1; ++j) {
163 tmp = lld[j] / dplus;
164 if (fabs(tmp)<GMX_FLOAT_MIN) {
176 right += werr[ii] * fac;
180 cnt = (cnt<i2) ? cnt : i2;
188 if (prev != nleft - 1) {
193 right = work[i__ * 2];
201 if (i__ <= *n && iwork[(i__ << 1) - 1] != -1) {
202 work[(i__ << 1) - 1] = work[prev * 2];
210 for (p = 1; p <= i__1; ++p) {
216 mid = (left + right) * .5;
220 tmp = (d__1>d__2) ? d__1 : d__2;
224 if (prev > 0 && next <= *n) {
225 d__1 = left - work[k - 2], d__2 = work[k + 1] - right;
226 gap = (d__1<d__2) ? d__1 : d__2;
227 } else if (prev > 0) {
228 gap = left - work[k - 2];
229 } else if (next <= *n) {
230 gap = work[k + 1] - right;
233 d__1 = *rtol1 * gap, d__2 = *rtol2 * tmp;
234 if (width < ((d__1>d__2) ? d__1 : d__2)) {
239 for (j = i__ + 1; j <= i__2; ++j) {
244 wgap[j - 1 - *offset] = 0.;
249 iwork[(prev << 1) - 1] = next;
259 for (j = 1; j <= i__2; ++j) {
261 s = s * lld[j] / dplus - mid;
270 if (! (s > 0. || s < 1.)) {
274 for (j = 1; j <= i__2; ++j) {
279 tmp = lld[j] / dplus;
280 if (fabs(tmp)<GMX_FLOAT_MIN) {
291 i__2 = i__ - 1, i__3 = (nright<cnt) ? nright : cnt;
292 cnt = (i__2>i__3) ? i__2 : i__3;
293 if (cnt == i__ - 1) {
295 } else if (cnt == nright) {
302 iwork[kk - 1] = next;
311 if (cnt > *ifirst && cnt <= *ilast) {
313 } else if (cnt <= *ifirst) {
323 for (i__ = *ifirst; i__ <= i__1; ++i__) {
326 if (iwork[k - 1] != -1) {
327 w[ii] = (work[k - 1] + work[k]) * .5;
328 werr[ii] = work[k] - w[ii];
330 wgap[ii] = work[k + 1] - work[k];