lbfgsb 0.3.1 → 0.5.0

data/ext/lbfgsb/src/lbfgsb.c

@@ -43,14 +43,14 @@
  *
  *                        March  2011
  */
-
 #include "blas.h"
 #include "linpack.h"
+
 #include "lbfgsb.h"
 
 static double c_b9 = 0.;
-static long c__1 = 1;
-static long c__11 = 11;
+static F77_int c__1 = 1;
+static F77_int c__11 = 11;
 static double c_b280 = .001;
 static double c_b281 = .9;
 static double c_b282 = .1;
@@ -63,11 +63,11 @@ static double c_b282 = .1;
  *       constrained optimization problem by calling mainlb.
  *       (The direct method will be used in the subspace minimization.)
  *
- *     n is an long variable.
+ *     n is an integer variable.
  *       On entry n is the dimension of the problem.
  *       On exit n is unchanged.
  *
- *     m is an long variable.
+ *     m is an integer variable.
  *       On entry m is the maximum number of variable metric corrections
  *         used to define the limited memory matrix.
  *       On exit m is unchanged.
@@ -84,7 +84,7 @@ static double c_b282 = .1;
  *       On entry u is the upper bound on x.
  *       On exit u is unchanged.
  *
- *     nbd is an long array of dimension n.
+ *     nbd is an integer array of dimension n.
  *       On entry nbd represents the type of bounds imposed on the
  *         variables, and must be specified as follows:
  *         nbd(i)=0 if x(i) is unbounded,
@@ -126,12 +126,12 @@ static double c_b282 = .1;
  *     wa is a double precision working array of length
  *       (2mmax + 5)nmax + 12mmax^2 + 12mmax.
  *
- *     iwa is an long working array of length 3nmax.
+ *     iwa is an integer working array of length 3nmax.
  *
  *     task is a working string of characters of length 60 indicating
  *       the current job when entering and quitting this subroutine.
  *
- *     iprint is an long variable that must be set by the user.
+ *     iprint is an integer variable that must be set by the user.
  *       It controls the frequency and type of output generated:
  *        iprint<0    no output is generated;
  *        iprint=0    print only one line at the last iteration;
@@ -153,7 +153,7 @@ static double c_b282 = .1;
  *         If lsave(3) = .true.  then  each variable has upper and lower
  *                                     bounds;
  *
- *     isave is an long working array of dimension 44.
+ *     isave is an integer working array of dimension 44.
  *       On exit with 'task' = NEW_X, the following information is
  *                                                             available:
  *         isave(22) = the total number of intervals explored in the
@@ -232,15 +232,11 @@ static double c_b282 = .1;
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int setulb_(long *n, long *m, double *x,
-  double *l, double *u, long *nbd, double *f, double *g,
-  double *factr, double *pgtol, double *wa, long *iwa,
-  char *task, long *iprint, char *csave, long *lsave,
-  long *isave, double *dsave)
-{
-  long i__1;
+void setulb_(F77_int* n, F77_int* m, double* x, double* l, double* u, F77_int* nbd, double* f, double* g, double* factr, double* pgtol,
+            double* wa, F77_int* iwa, char* task, F77_int* iprint, char* csave, F77_int* lsave, F77_int* isave, double* dsave) {
+  F77_int i__1;
 
-  static long ld, lr, lt, lz, lwa, lwn, lss, lxp, lws, lwt, lsy, lwy, lsnd;
+  static F77_int ld, lr, lt, lz, lwa, lwn, lss, lxp, lws, lwt, lsy, lwy, lsnd;
 
   /* jlm-jn */
   --iwa;
@@ -287,12 +283,9 @@ int setulb_(long *n, long *m, double *x,
   lt = isave[14];
   lxp = isave[15];
   lwa = isave[16];
-  mainlb_(n, m, &x[1], &l[1], &u[1], &nbd[1], f, &g[1], factr, pgtol, &wa[lws],
-          &wa[lwy], &wa[lsy], &wa[lss], &wa[lwt], &wa[lwn], &wa[lsnd],
-          &wa[lz], &wa[lr], &wa[ld], &wa[lt], &wa[lxp], &wa[lwa], &iwa[1],
-          &iwa[*n + 1], &iwa[(*n << 1) + 1], task, iprint, csave, &lsave[1],
-          &isave[22], &dsave[1]);
-  return 0;
+  mainlb_(n, m, &x[1], &l[1], &u[1], &nbd[1], f, &g[1], factr, pgtol, &wa[lws], &wa[lwy], &wa[lsy], &wa[lss], &wa[lwt],
+          &wa[lwn], &wa[lsnd], &wa[lz], &wa[lr], &wa[ld], &wa[lt], &wa[lxp], &wa[lwa], &iwa[1], &iwa[*n + 1],
+          &iwa[(*n << 1) + 1], task, iprint, csave, &lsave[1], &isave[22], &dsave[1]);
 }
 
 /**
@@ -301,11 +294,11 @@ int setulb_(long *n, long *m, double *x,
  *     This subroutine solves bound constrained optimization problems by
  *       using the compact formula of the limited memory BFGS updates.
  *
- *     n is an long variable.
+ *     n is an integer variable.
  *       On entry n is the number of variables.
  *       On exit n is unchanged.
  *
- *     m is an long variable.
+ *     m is an integer variable.
  *       On entry m is the maximum number of variable metric
  *          corrections allowed in the limited memory matrix.
  *       On exit m is unchanged.
@@ -322,7 +315,7 @@ int setulb_(long *n, long *m, double *x,
  *       On entry u is the upper bound of x.
  *       On exit u is unchanged.
  *
- *     nbd is an long array of dimension n.
+ *     nbd is an integer array of dimension n.
  *       On entry nbd represents the type of bounds imposed on the
  *         variables, and must be specified as follows:
  *         nbd(i)=0 if x(i) is unbounded,
@@ -390,11 +383,11 @@ int setulb_(long *n, long *m, double *x,
  *
  *     sg(m),sgo(m),yg(m),ygo(m) are double precision working arrays.
  *
- *     index is an long working array of dimension n.
+ *     index is an integer working array of dimension n.
  *       In subroutine freev, index is used to store the free and fixed
  *          variables at the Generalized Cauchy Point (GCP).
  *
- *     iwhere is an long working array of dimension n used to record
+ *     iwhere is an integer working array of dimension n used to record
  *       the status of the vector x for GCP computation.
  *       iwhere(i)=0 or -3 if x(i) is free and has bounds,
  *                 1       if x(i) is fixed at l(i), and l(i) .ne. u(i)
@@ -402,7 +395,7 @@ int setulb_(long *n, long *m, double *x,
  *                 3       if x(i) is always fixed, i.e.,  u(i)=x(i)=l(i)
  *                -1       if x(i) is always free, i.e., no bounds on it.
  *
- *     indx2 is an long working array of dimension n.
+ *     indx2 is an integer working array of dimension n.
  *       Within subroutine cauchy, indx2 corresponds to the array iorder.
  *       In subroutine freev, a list of variables entering and leaving
  *       the free set is stored in indx2, and it is passed on to
@@ -411,7 +404,7 @@ int setulb_(long *n, long *m, double *x,
  *     task is a working string of characters of length 60 indicating
  *       the current job when entering and leaving this subroutine.
  *
- *     iprint is an long variable that must be set by the user.
+ *     iprint is an integer variable that must be set by the user.
  *       It controls the frequency and type of output generated:
  *        iprint<0    no output is generated;
  *        iprint=0    print only one line at the last iteration;
@@ -426,7 +419,7 @@ int setulb_(long *n, long *m, double *x,
  *
  *     lsave is a logical working array of dimension 4.
  *
- *     isave is an long working array of dimension 23.
+ *     isave is an integer working array of dimension 23.
  *
  *     dsave is a double precision working array of dimension 29.
  *
@@ -471,57 +464,51 @@ int setulb_(long *n, long *m, double *x,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int mainlb_(long *n, long *m, double *x,
-  double *l, double *u, long *nbd, double *f, double *g,
-  double *factr, double *pgtol, double *ws, double *wy,
-  double *sy, double *ss, double *wt, double *wn,
-  double *snd, double *z__, double *r__, double *d__,
-  double *t, double *xp, double *wa, long *index,
-  long *iwhere, long *indx2, char *task, long *iprint,
-  char *csave, long *lsave, long *isave, double *dsave)
-{
-  long ws_dim1, ws_offset, wy_dim1, wy_offset, sy_dim1, sy_offset,
-    ss_dim1, ss_offset, wt_dim1, wt_offset, wn_dim1, wn_offset,
-    snd_dim1, snd_offset, i__1;
+void mainlb_(F77_int* n, F77_int* m, double* x, double* l, double* u, F77_int* nbd, double* f, double* g, double* factr, double* pgtol,
+            double* ws, double* wy, double* sy, double* ss, double* wt, double* wn, double* snd, double* z__, double* r__,
+            double* d__, double* t, double* xp, double* wa, F77_int* index, F77_int* iwhere, F77_int* indx2, char* task, F77_int* iprint,
+            char* csave, F77_int* lsave, F77_int* isave, double* dsave) {
+  F77_int ws_dim1, ws_offset, wy_dim1, wy_offset, sy_dim1, sy_offset, ss_dim1, ss_offset, wt_dim1, wt_offset, wn_dim1, wn_offset,
+      snd_dim1, snd_offset, i__1;
   double d__1, d__2;
-  FILE *itfptr;
-  static long i__, k;
+  FILE* itfptr;
+  static F77_int i__, k;
   static double gd, dr, rr, dtd;
-  static long col;
+  static F77_int col;
   static double tol;
-  static long wrk;
+  static F77_int wrk;
   static double stp, cpu1, cpu2;
-  static long head;
+  static F77_int head;
   static double fold;
-  static long nact;
+  static F77_int nact;
   static double ddum;
-  static long info, nseg;
+  static F77_int info, nseg;
   static double time;
-  static long nfgv, ifun, iter;
+  static F77_int nfgv, ifun, iter;
   static char word[4];
   static double time1, time2;
-  static long iback;
+  static F77_int iback;
   static double gdold;
-  static long nfree;
-  static long boxed;
-  static long itail;
+  static F77_int nfree;
+  static F77_int boxed;
+  static F77_int itail;
   static double theta;
   static double dnorm;
-  static long nskip, iword;
+  static F77_int nskip, iword;
   static double xstep, stpmx;
-  static long ileave;
+  static F77_int ileave;
   static double cachyt;
-  static long itfile;
+  static F77_int itfile;
   static double epsmch;
-  static long updatd;
+  static F77_int updatd;
   static double sbtime;
-  static long prjctd;
-  static long iupdat;
+  static F77_int prjctd;
+  static F77_int iupdat;
   static double sbgnrm;
-  static long cnstnd;
-  static long nenter;
+  static F77_int cnstnd;
+  static F77_int nenter;
   static double lnscht;
-  static long nintol;
+  static F77_int nintol;
 
   --indx2;
   --iwhere;
@@ -610,10 +597,9 @@ int mainlb_(long *n, long *m, double *x,
     /* Check the input arguments for errors. */
     errclb_(n, m, factr, &l[1], &u[1], &nbd[1], task, &info, &k);
     if (strncmp(task, "ERROR", 5) == 0) {
-      prn3lb_(n, &x[1], f, task, iprint, &info, &itfile, &iter, &nfgv, &nintol,
-          &nskip, &nact, &sbgnrm, &c_b9, &nseg, word, &iback,
-          &stp, &xstep, &k, &cachyt, &sbtime, &lnscht);
-      return 0;
+      prn3lb_(n, &x[1], f, task, iprint, &info, &itfile, &iter, &nfgv, &nintol, &nskip, &nact, &sbgnrm, &c_b9, &nseg, word,
+              &iback, &stp, &xstep, &k, &cachyt, &sbtime, &lnscht);
+      return;
     }
     prn1lb_(n, m, &l[1], &u[1], &x[1], iprint, &itfile, &epsmch);
     /* Initialize iwhere & project x onto the feasible set. */
@@ -673,8 +659,8 @@ int mainlb_(long *n, long *m, double *x,
     if (strncmp(task, "STOP", 4) == 0) {
       if (strncmp(task + 6, "CPU", 3) == 0) {
         /* restore the previous iterate. */
-        lbfgsb_rb_dcopy_(n, &t[1], &c__1, &x[1], &c__1);
-        lbfgsb_rb_dcopy_(n, &r__[1], &c__1, &g[1], &c__1);
+        dcopy_(n, &t[1], &c__1, &x[1], &c__1);
+        dcopy_(n, &r__[1], &c__1, &g[1], &c__1);
         *f = fold;
       }
       goto L999;
@@ -689,9 +675,9 @@ L111:
   /* Compute the infinity norm of the (-) projected gradient. */
   projgr_(n, &l[1], &u[1], &nbd[1], &x[1], &g[1], &sbgnrm);
   if (*iprint >= 1) {
-    fprintf(stdout, "\nAt iterate%5ld    f= %12.5E    |proj g|= %12.5E\n", iter, *f, sbgnrm);
+    fprintf(stdout, "\nAt iterate%5" PRIdF77INT "    f= %12.5E    |proj g|= %12.5E\n", iter, *f, sbgnrm);
     itfptr = fopen("iterate.dat", "a");
-    fprintf(itfptr, " %4ld %4ld     -     -   -     -     -        -    %10.3E %10.3E\n", iter, nfgv, sbgnrm, *f);
+    fprintf(itfptr, " %4" PRIdF77INT " %4" PRIdF77INT "     -     -   -     -     -        -    %10.3E %10.3E\n", iter, nfgv, sbgnrm, *f);
     fclose(itfptr);
   }
   if (sbgnrm <= *pgtol) {
@@ -703,13 +689,13 @@ L111:
 L222:
   if (*iprint >= 99) {
     i__1 = iter + 1;
-    fprintf(stdout, "\n\nITERATION %5ld\n", i__1);
+    fprintf(stdout, "\n\nITERATION %5" PRIdF77INT "\n", i__1);
   }
   iword = -1;
 
-  if (! cnstnd && col > 0) {
+  if (!cnstnd && col > 0) {
     /* skip the search for GCP. */
-    lbfgsb_rb_dcopy_(n, &x[1], &c__1, &z__[1], &c__1);
+    dcopy_(n, &x[1], &c__1, &z__[1], &c__1);
     wrk = updatd;
     nseg = 0;
     goto L333;
@@ -718,10 +704,9 @@ L222:
    * Compute the Generalized Cauchy Point (GCP).
    */
   timer_(&cpu1);
-  cauchy_(n, &x[1], &l[1], &u[1], &nbd[1], &g[1], &indx2[1], &iwhere[1], &t[1],
-      &d__[1], &z__[1], m, &wy[wy_offset], &ws[ws_offset], &sy[sy_offset],
-      &wt[wt_offset], &theta, &col, &head, &wa[1], &wa[(*m << 1) + 1],
-      &wa[(*m << 2) + 1], &wa[*m * 6 + 1], &nseg, iprint, &sbgnrm, &info, &epsmch);
+  cauchy_(n, &x[1], &l[1], &u[1], &nbd[1], &g[1], &indx2[1], &iwhere[1], &t[1], &d__[1], &z__[1], m, &wy[wy_offset],
+          &ws[ws_offset], &sy[sy_offset], &wt[wt_offset], &theta, &col, &head, &wa[1], &wa[(*m << 1) + 1], &wa[(*m << 2) + 1],
+          &wa[*m * 6 + 1], &nseg, iprint, &sbgnrm, &info, &epsmch);
   if (info != 0) {
     /* singular triangular system detected; refresh the lbfgs memory. */
     if (*iprint >= 1) {
@@ -762,9 +747,8 @@ L333:
   /*   where     E = [-I  0] */
   /*                 [ 0  I] */
   if (wrk) {
-    formk_(n, &nfree, &index[1], &nenter, &ileave, &indx2[1], &iupdat, &updatd,
-        &wn[wn_offset], &snd[snd_offset], m, &ws[ws_offset], &wy[wy_offset],
-        &sy[sy_offset], &theta, &col, &head, &info);
+    formk_(n, &nfree, &index[1], &nenter, &ileave, &indx2[1], &iupdat, &updatd, &wn[wn_offset], &snd[snd_offset], m,
+           &ws[ws_offset], &wy[wy_offset], &sy[sy_offset], &theta, &col, &head, &info);
   }
   if (info != 0) {
     /* nonpositive definiteness in Cholesky factorization; */
@@ -786,16 +770,14 @@ L333:
   }
   /* compute r=-Z'B(xcp-xk)-Z'g (using wa(2m+1)=W'(xcp-x) */
   /*                                            from 'cauchy'). */
-  cmprlb_(n, m, &x[1], &g[1], &ws[ws_offset], &wy[wy_offset], &sy[sy_offset],
-      &wt[wt_offset], &z__[1], &r__[1], &wa[1], &index[1], &theta, &col,
-      &head, &nfree, &cnstnd, &info);
+  cmprlb_(n, m, &x[1], &g[1], &ws[ws_offset], &wy[wy_offset], &sy[sy_offset], &wt[wt_offset], &z__[1], &r__[1], &wa[1],
+          &index[1], &theta, &col, &head, &nfree, &cnstnd, &info);
   if (info != 0) {
     goto L444;
   }
   /* jlm-jn call the direct method. */
-  subsm_(n, m, &nfree, &index[1], &l[1], &u[1], &nbd[1], &z__[1], &r__[1], &xp[1],
-      &ws[ws_offset], &wy[wy_offset], &theta, &x[1], &g[1], &col,
-      &head, &iword, &wa[1], &wn[wn_offset], iprint, &info);
+  subsm_(n, m, &nfree, &index[1], &l[1], &u[1], &nbd[1], &z__[1], &r__[1], &xp[1], &ws[ws_offset], &wy[wy_offset], &theta,
+         &x[1], &g[1], &col, &head, &iword, &wa[1], &wn[wn_offset], iprint, &info);
 L444:
   if (info != 0) {
     /* singular triangular system detected; */
@@ -828,14 +810,12 @@ L555:
   }
   timer_(&cpu1);
 L666:
-  lnsrlb_(n, &l[1], &u[1], &nbd[1], &x[1], f, &fold, &gd, &gdold, &g[1],
-      &d__[1], &r__[1], &t[1], &z__[1], &stp, &dnorm, &dtd, &xstep,
-      &stpmx, &iter, &ifun, &iback, &nfgv, &info, task, &boxed, &cnstnd,
-      csave, &isave[22], &dsave[17]);
+  lnsrlb_(n, &l[1], &u[1], &nbd[1], &x[1], f, &fold, &gd, &gdold, &g[1], &d__[1], &r__[1], &t[1], &z__[1], &stp, &dnorm, &dtd,
+          &xstep, &stpmx, &iter, &ifun, &iback, &nfgv, &info, task, &boxed, &cnstnd, csave, &isave[22], &dsave[17]);
   if (info != 0 || iback >= 20) {
     /* restore the previous iterate. */
-    lbfgsb_rb_dcopy_(n, &t[1], &c__1, &x[1], &c__1);
-    lbfgsb_rb_dcopy_(n, &r__[1], &c__1, &g[1], &c__1);
+    dcopy_(n, &t[1], &c__1, &x[1], &c__1);
+    dcopy_(n, &r__[1], &c__1, &g[1], &c__1);
     *f = fold;
     if (col == 0) {
       /* abnormal termination. */
@@ -881,8 +861,7 @@ L666:
     /* Compute the infinity norm of the projected (-)gradient. */
     projgr_(n, &l[1], &u[1], &nbd[1], &x[1], &g[1], &sbgnrm);
     /* Print iteration information. */
-    prn2lb_(n, &x[1], f, &g[1], iprint, &itfile, &iter, &nfgv, &nact,
-        &sbgnrm, &nseg, word, &iword, &iback, &stp, &xstep);
+    prn2lb_(n, &x[1], f, &g[1], iprint, &itfile, &iter, &nfgv, &nact, &sbgnrm, &nseg, word, &iword, &iback, &stp, &xstep);
     goto L1000;
   }
 L777:
@@ -910,13 +889,13 @@ L777:
   for (i__ = 1; i__ <= i__1; ++i__) {
     r__[i__] = g[i__] - r__[i__];
   }
-  rr = lbfgsb_rb_ddot_(n, &r__[1], &c__1, &r__[1], &c__1);
+  rr = ddot_(n, &r__[1], &c__1, &r__[1], &c__1);
   if (stp == 1.) {
     dr = gd - gdold;
     ddum = -gdold;
   } else {
     dr = (gd - gdold) * stp;
-    lbfgsb_rb_dscal_(n, &stp, &d__[1], &c__1);
+    dscal_(n, &stp, &d__[1], &c__1);
     ddum = -gdold * stp;
   }
   if (dr <= epsmch * ddum) {
@@ -934,9 +913,8 @@ L777:
   updatd = TRUE_;
   ++iupdat;
   /* Update matrices WS and WY and form the middle matrix in B. */
-  matupd_(n, m, &ws[ws_offset], &wy[wy_offset], &sy[sy_offset],
-      &ss[ss_offset], &d__[1], &r__[1], &itail, &iupdat, &col, &head,
-      &theta, &rr, &dr, &stp, &dtd);
+  matupd_(n, m, &ws[ws_offset], &wy[wy_offset], &sy[sy_offset], &ss[ss_offset], &d__[1], &r__[1], &itail, &iupdat, &col, &head,
+          &theta, &rr, &dr, &stp, &dtd);
   /* Form the upper half of the pds T = theta*SS + L*D^(-1)*L'; */
   /*    Store T in the upper triangular of the array wt; */
   /*    Cholesky factorize T to J*J' with */
@@ -967,9 +945,8 @@ L888:
 L999:
   timer_(&time2);
   time = time2 - time1;
-  prn3lb_(n, &x[1], f, task, iprint, &info, &itfile, &iter, &nfgv, &nintol,
-    &nskip, &nact, &sbgnrm, &time, &nseg, word, &iback, &stp, &xstep,
-    &k, &cachyt, &sbtime, &lnscht);
+  prn3lb_(n, &x[1], f, task, iprint, &info, &itfile, &iter, &nfgv, &nintol, &nskip, &nact, &sbgnrm, &time, &nseg, word, &iback,
+          &stp, &xstep, &k, &cachyt, &sbtime, &lnscht);
 L1000:
   /* Save local variables. */
   lsave[1] = prjctd;
@@ -1010,7 +987,6 @@ L1000:
   dsave[14] = stp;
   dsave[15] = gdold;
   dsave[16] = dtd;
-  return 0;
 }
 
 /**
@@ -1019,7 +995,7 @@ L1000:
  *     This subroutine initializes iwhere and projects the initial x to
  *       the feasible set if necessary.
  *
- *     iwhere is an long array of dimension n.
+ *     iwhere is an integer array of dimension n.
  *       On entry iwhere is unspecified.
  *       On exit iwhere(i)=-1  if x(i) has no bounds
  *                         3   if l(i)=u(i)
@@ -1035,12 +1011,10 @@ L1000:
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int active_(long *n, double *l, double *u,
-  long *nbd, double *x, long *iwhere, long *iprint,
-  long *prjctd, long *cnstnd, long *boxed)
-{
-  long i__1;
-  static long i__, nbdd;
+void active_(F77_int* n, double* l, double* u, F77_int* nbd, double* x, F77_int* iwhere, F77_int* iprint, F77_int* prjctd, F77_int* cnstnd,
+            F77_int* boxed) {
+  F77_int i__1;
+  static F77_int i__, nbdd;
   --iwhere;
   --x;
   --nbd;
@@ -1080,7 +1054,7 @@ int active_(long *n, double *l, double *u,
     if (nbd[i__] == 0) {
       /* this variable is always free */
       iwhere[i__] = -1;
-    /* otherwise set x(i)=mid(x(i), u(i), l(i)). */
+      /* otherwise set x(i)=mid(x(i), u(i), l(i)). */
     } else {
       *cnstnd = TRUE_;
       if (nbd[i__] == 2 && u[i__] - l[i__] <= 0.) {
@@ -1095,15 +1069,14 @@ int active_(long *n, double *l, double *u,
     if (*prjctd) {
       fprintf(stdout, " The initial X is infeasible.  Restart with its projection.\n");
     }
-    if (! (*cnstnd)) {
+    if (!(*cnstnd)) {
       fprintf(stdout, " This problem is unconstrained.\n");
     }
   }
   if (*iprint > 0) {
     fprintf(stdout, "\n");
-    fprintf(stdout, "At X0 %9ld variables are exactly at the bounds\n", nbdd);
+    fprintf(stdout, "At X0 %9" PRIdF77INT " variables are exactly at the bounds\n", nbdd);
   }
-  return 0;
 }
 
 /**
@@ -1113,7 +1086,7 @@ int active_(long *n, double *l, double *u,
  *       in the compact L-BFGS formula of B and a 2m vector v;
  *       it returns the product in p.
  *
- *     m is an long variable.
+ *     m is an integer variable.
  *       On entry m is the maximum number of variable metric corrections
  *         used to define the limited memory matrix.
  *       On exit m is unchanged.
@@ -1127,7 +1100,7 @@ int active_(long *n, double *l, double *u,
  *         the Cholesky factor of (thetaS'S+LD^(-1)L').
  *       On exit wt is unchanged.
  *
- *     col is an long variable.
+ *     col is an integer variable.
  *       On entry col specifies the number of s-vectors (or y-vectors)
  *         stored in the compact L-BFGS formula.
  *       On exit col is unchanged.
@@ -1140,7 +1113,7 @@ int active_(long *n, double *l, double *u,
  *       On entry p is unspecified.
  *       On exit p is the product Mv.
  *
- *     info is an long variable.
+ *     info is an integer variable.
  *       On entry info is unspecified.
  *       On exit info = 0       for normal return,
  *                    = nonzero for abnormal return when the system
@@ -1159,11 +1132,9 @@ int active_(long *n, double *l, double *u,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int bmv_(long *m, double *sy, double *wt, long
-  *col, double *v, double *p, long *info)
-{
-  long sy_dim1, sy_offset, wt_dim1, wt_offset, i__1, i__2;
-  static long i__, k, i2;
+void bmv_(F77_int* m, double* sy, double* wt, F77_int* col, double* v, double* p, F77_int* info) {
+  F77_int sy_dim1, sy_offset, wt_dim1, wt_offset, i__1, i__2;
+  static F77_int i__, k, i2;
   static double sum;
 
   wt_dim1 = *m;
@@ -1176,7 +1147,7 @@ int bmv_(long *m, double *sy, double *wt, long
   --v;
 
   if (*col == 0) {
-    return 0;
+    return;
   }
   /* PART I: solve [  D^(1/2)      O ] [ p1 ] = [ v1 ] */
   /*               [ -L*D^(-1/2)   J ] [ p2 ]   [ v2 ]. */
@@ -1193,9 +1164,9 @@ int bmv_(long *m, double *sy, double *wt, long
     p[i2] = v[i2] + sum;
   }
   /* Solve the triangular system */
-  lbfgsb_rb_dtrsl_(&wt[wt_offset], m, col, &p[*col + 1], &c__11, info);
+  dtrsl_(&wt[wt_offset], m, col, &p[*col + 1], &c__11, info);
   if (*info != 0) {
-    return 0;
+    return;
   }
   /* solve D^(1/2)p1=v1. */
   i__1 = *col;
@@ -1205,9 +1176,9 @@ int bmv_(long *m, double *sy, double *wt, long
   /* PART II: solve [ -D^(1/2)   D^(-1/2)*L'  ] [ p1 ] = [ p1 ] */
   /*                [  0         J'           ] [ p2 ]   [ p2 ]. */
   /*   solve J^Tp2=p2. */
-  lbfgsb_rb_dtrsl_(&wt[wt_offset], m, col, &p[*col + 1], &c__1, info);
+  dtrsl_(&wt[wt_offset], m, col, &p[*col + 1], &c__1, info);
   if (*info != 0) {
-    return 0;
+    return;
   }
   /* compute p1=-D^(-1/2)(p1-D^(-1/2)L'p2) */
   /*           =-D^(-1/2)p1+D^(-1)L'p2. */
@@ -1224,7 +1195,6 @@ int bmv_(long *m, double *sy, double *wt, long
     }
     p[i__] += sum;
   }
-  return 0;
 }
 
 /**
@@ -1238,10 +1208,10 @@ int bmv_(long *m, double *sy, double *wt, long
  *
  *                  Q(x + s) = g's + 1/2 s'Bs
  *
- *       along the projected gradient direction P(x-tg,l,u).
+ *       aF77_int the projected gradient direction P(x-tg,l,u).
  *       The routine returns the GCP in xcp.
  *
- *     n is an long variable.
+ *     n is an integer variable.
  *       On entry n is the dimension of the problem.
  *       On exit n is unchanged.
  *
@@ -1257,7 +1227,7 @@ int bmv_(long *m, double *sy, double *wt, long
  *       On entry u is the upper bound of x.
  *       On exit u is unchanged.
  *
- *     nbd is an long array of dimension n.
+ *     nbd is an integer array of dimension n.
  *       On entry nbd represents the type of bounds imposed on the
  *         variables, and must be specified as follows:
  *         nbd(i)=0 if x(i) is unbounded,
@@ -1270,7 +1240,7 @@ int bmv_(long *m, double *sy, double *wt, long
  *       On entry g is the gradient of f(x).  g must be a nonzero vector.
  *       On exit g is unchanged.
  *
- *     iorder is an long working array of dimension n.
+ *     iorder is an integer working array of dimension n.
  *       iorder will be used to store the breakpoints in the piecewise
  *       linear path and free variables encountered. On exit,
  *         iorder(1),...,iorder(nleft) are indices of breakpoints
@@ -1278,9 +1248,9 @@ int bmv_(long *m, double *sy, double *wt, long
  *         iorder(nleft+1),...,iorder(nbreak) are indices of
  *                                     encountered breakpoints; and
  *         iorder(nfree),...,iorder(n) are indices of variables which
- *                 have no bound constraits along the search direction.
+ *                 have no bound constraits aF77_int the search direction.
  *
- *     iwhere is an long array of dimension n.
+ *     iwhere is an integer array of dimension n.
  *       On entry iwhere indicates only the permanently fixed (iwhere=3)
  *       or free (iwhere= -1) components of x.
  *       On exit iwhere records the status of the current x variables.
@@ -1300,7 +1270,7 @@ int bmv_(long *m, double *sy, double *wt, long
  *     xcp is a double precision array of dimension n used to return the
  *       GCP on exit.
  *
- *     m is an long variable.
+ *     m is an integer variable.
  *       On entry m is the maximum number of variable metric corrections
  *         used to define the limited memory matrix.
  *       On exit m is unchanged.
@@ -1319,12 +1289,12 @@ int bmv_(long *m, double *sy, double *wt, long
  *       On entry theta is the scaling factor specifying B_0 = theta I.
  *       On exit theta is unchanged.
  *
- *     col is an long variable.
+ *     col is an integer variable.
  *       On entry col is the actual number of variable metric
  *         corrections stored so far.
  *       On exit col is unchanged.
  *
- *     head is an long variable.
+ *     head is an integer variable.
  *       On entry head is the location of the first s-vector (or y-vector)
  *         in S (or Y).
  *       On exit col is unchanged.
@@ -1341,7 +1311,7 @@ int bmv_(long *m, double *sy, double *wt, long
  *
  *     v is a double precision working array of dimension 2m.
  *
- *     nseg is an long variable.
+ *     nseg is an integer variable.
  *       On exit nseg records the number of quadratic segments explored
  *         in searching for the GCP.
  *
@@ -1349,7 +1319,7 @@ int bmv_(long *m, double *sy, double *wt, long
  *       On entry sg  and yg store S'g and Y'g correspondingly.
  *       On exit they are unchanged.
  *
- *     iprint is an long variable that must be set by the user.
+ *     iprint is an integer variable that must be set by the user.
  *       It controls the frequency and type of output generated:
  *        iprint<0    no output is generated;
  *        iprint=0    print only one line at the last iteration;
@@ -1364,7 +1334,7 @@ int bmv_(long *m, double *sy, double *wt, long
  *       On entry sbgnrm is the norm of the projected gradient at x.
  *       On exit sbgnrm is unchanged.
  *
- *     info is an long variable.
+ *     info is an integer variable.
  *       On entry info is 0.
  *       On exit info = 0       for normal return,
  *                    = nonzero for abnormal return when the the system
@@ -1400,34 +1370,30 @@ int bmv_(long *m, double *sy, double *wt, long
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int cauchy_(long *n, double *x, double *l,
-  double *u, long *nbd, double *g, long *iorder, long *iwhere,
-  double *t, double *d__, double *xcp, long *m,
-  double *wy, double *ws, double *sy, double *wt,
-  double *theta, long *col, long *head, double *p,
-  double *c__, double *wbp, double *v, long *nseg,
-  long *iprint, double *sbgnrm, long *info, double *epsmch)
-{
-  long wy_dim1, wy_offset, ws_dim1, ws_offset, sy_dim1, sy_offset, wt_dim1, wt_offset, i__1, i__2;
+void cauchy_(F77_int* n, double* x, double* l, double* u, F77_int* nbd, double* g, F77_int* iorder, F77_int* iwhere, double* t, double* d__,
+            double* xcp, F77_int* m, double* wy, double* ws, double* sy, double* wt, double* theta, F77_int* col, F77_int* head,
+            double* p, double* c__, double* wbp, double* v, F77_int* nseg, F77_int* iprint, double* sbgnrm, F77_int* info,
+            double* epsmch) {
+  F77_int wy_dim1, wy_offset, ws_dim1, ws_offset, sy_dim1, sy_offset, wt_dim1, wt_offset, i__1, i__2;
   double d__1;
-  static long i__, j;
+  static F77_int i__, j;
   static double f1, f2, dt, tj, tl, tu, tj0;
-  static long ibp;
+  static F77_int ibp;
   static double dtm;
   static double wmc, wmp, wmw;
-  static long col2;
+  static F77_int col2;
   static double dibp;
-  static long iter;
+  static F77_int iter;
   static double zibp, tsum, dibp2;
-  static long bnded;
+  static F77_int bnded;
   static double neggi;
-  static long nfree;
+  static F77_int nfree;
   static double bkmin;
-  static long nleft;
+  static F77_int nleft;
   static double f2_org__;
-  static long nbreak, ibkmin;
-  static long pointr;
-  static long xlower, xupper;
+  static F77_int nbreak, ibkmin;
+  static F77_int pointr;
+  static F77_int xlower, xupper;
 
   --xcp;
   --d__;
@@ -1463,8 +1429,8 @@ int cauchy_(long *n, double *x, double *l,
     if (*iprint >= 0) {
       fprintf(stdout, " Subgnorm = 0.  GCP = X.\n");
     }
-    lbfgsb_rb_dcopy_(n, &x[1], &c__1, &xcp[1], &c__1);
-    return 0;
+    dcopy_(n, &x[1], &c__1, &xcp[1], &c__1);
+    return;
   }
   bnded = TRUE_;
   nfree = *n + 1;
@@ -1562,10 +1528,10 @@ int cauchy_(long *n, double *x, double *l,
   /*   The smallest of the nbreak breakpoints is in t(ibkmin)=bkmin. */
   if (*theta != 1.) {
     /* complete the initialization of p for theta not= one. */
-    lbfgsb_rb_dscal_(col, theta, &p[*col + 1], &c__1);
+    dscal_(col, theta, &p[*col + 1], &c__1);
   }
   /* Initialize GCP xcp = x. */
-  lbfgsb_rb_dcopy_(n, &x[1], &c__1, &xcp[1], &c__1);
+  dcopy_(n, &x[1], &c__1, &xcp[1], &c__1);
   if (nbreak == 0 && nfree == *n + 1) {
     /* is a zero vector, return with the initial xcp as GCP. */
     if (*iprint > 100) {
@@ -1581,7 +1547,7 @@ int cauchy_(long *n, double *x, double *l,
       }
       fprintf(stdout, "\n");
     }
-    return 0;
+    return;
   }
   /* Initialize c = W'(xcp - x) = 0. */
   i__1 = col2;
@@ -1594,15 +1560,15 @@ int cauchy_(long *n, double *x, double *l,
   if (*col > 0) {
     bmv_(m, &sy[sy_offset], &wt[wt_offset], col, &p[1], &v[1], info);
     if (*info != 0) {
-      return 0;
+      return;
     }
-    f2 -= lbfgsb_rb_ddot_(&col2, &v[1], &c__1, &p[1], &c__1);
+    f2 -= ddot_(&col2, &v[1], &c__1, &p[1], &c__1);
   }
   dtm = -f1 / f2;
   tsum = 0.;
   *nseg = 1;
   if (*iprint >= 99) {
-    fprintf(stdout, " There are %3ld  breakpoints \n", nbreak);
+    fprintf(stdout, " There are %3" PRIdF77INT "  breakpoints \n", nbreak);
   }
   /* If there are no breakpoints, locate the GCP and return. */
   if (nbreak == 0) {
@@ -1641,7 +1607,7 @@ L777:
   dt = tj - tj0;
   if (dt != 0. && *iprint >= 100) {
     fprintf(stdout, "\n");
-    fprintf(stdout, "Piece    %3ld --f1, f2 at start point  %11.4E %11.4E\n", *nseg, f1, f2);
+    fprintf(stdout, "Piece    %3" PRIdF77INT " --f1, f2 at start point  %11.4E %11.4E\n", *nseg, f1, f2);
     fprintf(stdout, "Distance to the next break point =  %11.4E\n", dt);
     fprintf(stdout, "Distance to the stationary point =  %11.4E\n", dtm);
   }
@@ -1666,7 +1632,7 @@ L777:
     iwhere[ibp] = 1;
   }
   if (*iprint >= 100) {
-    fprintf(stdout, " Variable   %ld  is fixed.\n", ibp);
+    fprintf(stdout, " Variable   %" PRIdF77INT "  is fixed.\n", ibp);
   }
   if (nleft == 0 && nbreak == *n) {
     /* all n variables are fixed, */
@@ -1685,7 +1651,7 @@ L777:
   f2 -= *theta * dibp2;
   if (*col > 0) {
     /* update c = c + dt*p. */
-    lbfgsb_rb_daxpy_(&col2, &dt, &p[1], &c__1, &c__[1], &c__1);
+    daxpy_(&col2, &dt, &p[1], &c__1, &c__[1], &c__1);
     /* choose wbp, */
     /* the row of W corresponding to the breakpoint encountered. */
     pointr = *head;
@@ -1698,14 +1664,14 @@ L777:
     /* compute (wbp)Mc, (wbp)Mp, and (wbp)M(wbp)'. */
     bmv_(m, &sy[sy_offset], &wt[wt_offset], col, &wbp[1], &v[1], info);
     if (*info != 0) {
-      return 0;
+      return;
     }
-    wmc = lbfgsb_rb_ddot_(&col2, &c__[1], &c__1, &v[1], &c__1);
-    wmp = lbfgsb_rb_ddot_(&col2, &p[1], &c__1, &v[1], &c__1);
-    wmw = lbfgsb_rb_ddot_(&col2, &wbp[1], &c__1, &v[1], &c__1);
+    wmc = ddot_(&col2, &c__[1], &c__1, &v[1], &c__1);
+    wmp = ddot_(&col2, &p[1], &c__1, &v[1], &c__1);
+    wmw = ddot_(&col2, &wbp[1], &c__1, &v[1], &c__1);
     /* update p = p - dibp*wbp. */
     d__1 = -dibp;
-    lbfgsb_rb_daxpy_(&col2, &d__1, &wbp[1], &c__1, &p[1], &c__1);
+    daxpy_(&col2, &d__1, &wbp[1], &c__1, &p[1], &c__1);
     /* complete updating f1 and f2 while col > 0. */
     f1 += dibp * wmc;
     f2 = f2 + dibp * 2. * wmp - dibp2 * wmw;
@@ -1728,7 +1694,7 @@ L888:
   if (*iprint >= 99) {
     fprintf(stdout, "\n");
     fprintf(stdout, " GCP found in this segment\n");
-    fprintf(stdout, "Piece    %3ld --f1, f2 at start point  %11.4E %11.4E\n", *nseg, f1, f2);
+    fprintf(stdout, "Piece    %3" PRIdF77INT " --f1, f2 at start point  %11.4E %11.4E\n", *nseg, f1, f2);
     fprintf(stdout, "Distance to the stationary point =  %11.4E\n", dtm);
   }
   if (dtm <= 0.) {
@@ -1737,12 +1703,12 @@ L888:
   tsum += dtm;
   /* Move free variables (i.e., the ones w/o breakpoints) and */
   /*   the variables whose breakpoints haven't been reached. */
-  lbfgsb_rb_daxpy_(n, &tsum, &d__[1], &c__1, &xcp[1], &c__1);
+  daxpy_(n, &tsum, &d__[1], &c__1, &xcp[1], &c__1);
 L999:
   /* Update c = c + dtm*p = W'(x^c - x) */
   /*   which will be used in computing r = Z'(B(x^c - x) + g). */
   if (*col > 0) {
-    lbfgsb_rb_daxpy_(&col2, &dtm, &p[1], &c__1, &c__[1], &c__1);
+    daxpy_(&col2, &dtm, &p[1], &c__1, &c__[1], &c__1);
   }
   if (*iprint > 100) {
     fprintf(stdout, "Cauchy X =  \n");
@@ -1760,7 +1726,6 @@ L999:
   if (*iprint >= 99) {
     fprintf(stdout, "\n---------------- exit CAUCHY----------------------\n\n");
   }
-  return 0;
 }
 
 /**
@@ -1782,16 +1747,12 @@ L999:
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int cmprlb_(long *n, long *m, double *x,
-  double *g, double *ws, double *wy, double *sy,
-  double *wt, double *z__, double *r__, double *wa,
-  long *index, double *theta, long *col, long *head,
-  long *nfree, long *cnstnd, long *info)
-{
-  long ws_dim1, ws_offset, wy_dim1, wy_offset, sy_dim1, sy_offset, wt_dim1, wt_offset, i__1, i__2;
-  static long i__, j, k;
+void cmprlb_(F77_int* n, F77_int* m, double* x, double* g, double* ws, double* wy, double* sy, double* wt, double* z__, double* r__,
+            double* wa, F77_int* index, double* theta, F77_int* col, F77_int* head, F77_int* nfree, F77_int* cnstnd, F77_int* info) {
+  F77_int ws_dim1, ws_offset, wy_dim1, wy_offset, sy_dim1, sy_offset, wt_dim1, wt_offset, i__1, i__2;
+  static F77_int i__, j, k;
   static double a1, a2;
-  static long pointr;
+  static F77_int pointr;
 
   --index;
   --r__;
@@ -1812,7 +1773,7 @@ int cmprlb_(long *n, long *m, double *x,
   ws_offset = 1 + ws_dim1;
   ws -= ws_offset;
 
-  if (! (*cnstnd) && *col > 0) {
+  if (!(*cnstnd) && *col > 0) {
     i__1 = *n;
     for (i__ = 1; i__ <= i__1; ++i__) {
       r__[i__] = -g[i__];
@@ -1826,7 +1787,7 @@ int cmprlb_(long *n, long *m, double *x,
     bmv_(m, &sy[sy_offset], &wt[wt_offset], col, &wa[(*m << 1) + 1], &wa[1], info);
     if (*info != 0) {
       *info = -8;
-      return 0;
+      return;
     }
     pointr = *head;
     i__1 = *col;
@@ -1841,7 +1802,6 @@ int cmprlb_(long *n, long *m, double *x,
       pointr = pointr % *m + 1;
     }
   }
-  return 0;
 }
 
 /**
@@ -1858,11 +1818,9 @@ int cmprlb_(long *n, long *m, double *x,
  *                       Ciyou Zhu
  *    in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int errclb_(long *n, long *m, double *factr,
-  double *l, double *u, long *nbd, char *task, long *info, long *k)
-{
-  long i__1;
-  static long i__;
+void errclb_(F77_int* n, F77_int* m, double* factr, double* l, double* u, F77_int* nbd, char* task, F77_int* info, F77_int* k) {
+  F77_int i__1;
+  static F77_int i__;
   --nbd;
   --u;
   --l;
@@ -1895,7 +1853,6 @@ int errclb_(long *n, long *m, double *factr,
       }
     }
   }
-  return 0;
 }
 
 /**
@@ -1911,35 +1868,35 @@ int errclb_(long *n, long *m, double *factr,
  *       occurring in section 5.1 of [1], as well as to the matrix
  *       Mbar^[-1] Nbar in section 5.3.
  *
- *     n is an long variable.
+ *     n is an integer variable.
  *       On entry n is the dimension of the problem.
  *       On exit n is unchanged.
  *
- *     nsub is an long variable
+ *     nsub is an integer variable
  *       On entry nsub is the number of subspace variables in free set.
  *       On exit nsub is not changed.
  *
- *     ind is an long array of dimension nsub.
+ *     ind is an integer array of dimension nsub.
  *       On entry ind specifies the indices of subspace variables.
  *       On exit ind is unchanged.
  *
- *     nenter is an long variable.
+ *     nenter is an integer variable.
  *       On entry nenter is the number of variables entering the
  *         free set.
  *       On exit nenter is unchanged.
  *
- *     ileave is an long variable.
+ *     ileave is an integer variable.
  *       On entry indx2(ileave),...,indx2(n) are the variables leaving
  *         the free set.
  *       On exit ileave is unchanged.
  *
- *     indx2 is an long array of dimension n.
+ *     indx2 is an integer array of dimension n.
  *       On entry indx2(1),...,indx2(nenter) are the variables entering
  *         the free set, while indx2(ileave),...,indx2(n) are the
  *         variables leaving the free set.
  *       On exit indx2 is unchanged.
  *
- *     iupdat is an long variable.
+ *     iupdat is an integer variable.
  *       On entry iupdat is the total number of BFGS updates made so far.
  *       On exit iupdat is unchanged.
  *
@@ -1963,15 +1920,15 @@ int errclb_(long *n, long *m, double *factr,
  *       The purpose of wn1 is just to store these inner products
  *       so they can be easily updated and inserted into wn.
  *
- *     m is an long variable.
+ *     m is an integer variable.
  *       On entry m is the maximum number of variable metric corrections
  *         used to define the limited memory matrix.
  *       On exit m is unchanged.
  *
  *     ws, wy, sy, and wtyy are double precision arrays;
  *     theta is a double precision variable;
- *     col is an long variable;
- *     head is an long variable.
+ *     col is an integer variable;
+ *     head is an integer variable.
  *       On entry they store the information defining the
  *                                          limited memory BFGS matrix:
  *         ws(n,m) stores S, a set of s-vectors;
@@ -1984,7 +1941,7 @@ int errclb_(long *n, long *m, double *factr,
  *         head is the location of the 1st s- (or y-) vector in S (or Y).
  *       On exit they are unchanged.
  *
- *     info is an long variable.
+ *     info is an integer variable.
  *       On entry info is unspecified.
  *       On exit info =  0 for normal return;
  *                    = -1 when the 1st Cholesky factorization failed;
@@ -2017,18 +1974,13 @@ int errclb_(long *n, long *m, double *factr,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int formk_(long *n, long *nsub, long *ind, long *nenter,
-  long *ileave, long *indx2, long *iupdat, long *updatd,
-  double *wn, double *wn1, long *m, double *ws,
-  double *wy, double *sy, double *theta, long *col,
-  long *head, long *info)
-{
-  long wn_dim1, wn_offset, wn1_dim1, wn1_offset, ws_dim1, ws_offset,
-    wy_dim1, wy_offset, sy_dim1, sy_offset, i__1, i__2, i__3;
-  static long i__, k, k1, m2, is, js, iy, jy, is1, js1, col2, dend, pend;
-  static long upcl;
+void formk_(F77_int* n, F77_int* nsub, F77_int* ind, F77_int* nenter, F77_int* ileave, F77_int* indx2, F77_int* iupdat, F77_int* updatd, double* wn,
+           double* wn1, F77_int* m, double* ws, double* wy, double* sy, double* theta, F77_int* col, F77_int* head, F77_int* info) {
+  F77_int wn_dim1, wn_offset, wn1_dim1, wn1_offset, ws_dim1, ws_offset, wy_dim1, wy_offset, sy_dim1, sy_offset, i__1, i__2, i__3;
+  static F77_int i__, k, k1, m2, is, js, iy, jy, is1, js1, col2, dend, pend;
+  static F77_int upcl;
   static double temp1, temp2, temp3, temp4;
-  static long ipntr, jpntr, dbegin, pbegin;
+  static F77_int ipntr, jpntr, dbegin, pbegin;
 
   --indx2;
   --ind;
@@ -2060,11 +2012,11 @@ int formk_(long *n, long *nsub, long *ind, long *nenter,
       for (jy = 1; jy <= i__1; ++jy) {
         js = *m + jy;
         i__2 = *m - jy;
-        lbfgsb_rb_dcopy_(&i__2, &wn1[jy + 1 + (jy + 1) * wn1_dim1], &c__1, &wn1[jy + jy * wn1_dim1], &c__1);
+        dcopy_(&i__2, &wn1[jy + 1 + (jy + 1) * wn1_dim1], &c__1, &wn1[jy + jy * wn1_dim1], &c__1);
         i__2 = *m - jy;
-        lbfgsb_rb_dcopy_(&i__2, &wn1[js + 1 + (js + 1) * wn1_dim1], &c__1, &wn1[js + js * wn1_dim1], &c__1);
+        dcopy_(&i__2, &wn1[js + 1 + (js + 1) * wn1_dim1], &c__1, &wn1[js + js * wn1_dim1], &c__1);
         i__2 = *m - 1;
-        lbfgsb_rb_dcopy_(&i__2, &wn1[*m + 2 + (jy + 1) * wn1_dim1], &c__1, &wn1[*m + 1 + jy * wn1_dim1], &c__1);
+        dcopy_(&i__2, &wn1[*m + 2 + (jy + 1) * wn1_dim1], &c__1, &wn1[*m + 1 + jy * wn1_dim1], &c__1);
       }
     }
     /* put new rows in blocks (1,1), (2,1) and (2,2). */
@@ -2215,16 +2167,16 @@ int formk_(long *n, long *nsub, long *ind, long *nenter,
   /*                                [(-L_a +R_z)L'^-1   S'AA'S*theta  ] */
   /*    first Cholesky factor (1,1) block of wn to get LL' */
   /*                      with L' stored in the upper triangle of wn. */
-  lbfgsb_rb_dpofa_(&wn[wn_offset], &m2, col, info);
+  dpofa_(&wn[wn_offset], &m2, col, info);
   if (*info != 0) {
     *info = -1;
-    return 0;
+    return;
   }
   /* then form L^-1(-L_a'+R_z') in the (1,2) block. */
   col2 = *col << 1;
   i__1 = col2;
   for (js = *col + 1; js <= i__1; ++js) {
-    lbfgsb_rb_dtrsl_(&wn[wn_offset], &m2, col, &wn[js * wn_dim1 + 1], &c__11, info);
+    dtrsl_(&wn[wn_offset], &m2, col, &wn[js * wn_dim1 + 1], &c__11, info);
   }
   /* Form S'AA'S*theta + (L^-1(-L_a'+R_z'))'L^-1(-L_a'+R_z') in the */
   /*    upper triangle of (2,2) block of wn. */
@@ -2232,16 +2184,14 @@ int formk_(long *n, long *nsub, long *ind, long *nenter,
   for (is = *col + 1; is <= i__1; ++is) {
     i__2 = col2;
     for (js = is; js <= i__2; ++js) {
-      wn[is + js * wn_dim1] += lbfgsb_rb_ddot_(col, &wn[is * wn_dim1 + 1], &c__1, &wn[js * wn_dim1 + 1], &c__1);
+      wn[is + js * wn_dim1] += ddot_(col, &wn[is * wn_dim1 + 1], &c__1, &wn[js * wn_dim1 + 1], &c__1);
     }
   }
   /* Cholesky factorization of (2,2) block of wn. */
-  lbfgsb_rb_dpofa_(&wn[*col + 1 + (*col + 1) * wn_dim1], &m2, col, info);
+  dpofa_(&wn[*col + 1 + (*col + 1) * wn_dim1], &m2, col, info);
   if (*info != 0) {
     *info = -2;
-    return 0;
   }
-  return 0;
 }
 
 /**
@@ -2265,11 +2215,9 @@ int formk_(long *n, long *nsub, long *ind, long *nenter,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int formt_(long *m, double *wt, double *sy,
-  double *ss, long *col, double *theta, long *info)
-{
-  long wt_dim1, wt_offset, sy_dim1, sy_offset, ss_dim1, ss_offset, i__1, i__2, i__3;
-  static long i__, j, k, k1;
+void formt_(F77_int* m, double* wt, double* sy, double* ss, F77_int* col, double* theta, F77_int* info) {
+  F77_int wt_dim1, wt_offset, sy_dim1, sy_offset, ss_dim1, ss_offset, i__1, i__2, i__3;
+  static F77_int i__, j, k, k1;
   static double ddum;
 
   ss_dim1 = *m;
@@ -2303,11 +2251,10 @@ int formt_(long *m, double *wt, double *sy,
   }
   /* Cholesky factorize T to J*J' with */
   /*    J' stored in the upper triangle of wt. */
-  lbfgsb_rb_dpofa_(&wt[wt_offset], m, col, info);
+  dpofa_(&wt[wt_offset], m, col, info);
   if (*info != 0) {
     *info = -3;
   }
-  return 0;
 }
 
 /**
@@ -2319,7 +2266,7 @@ int formt_(long *m, double *wt, double *sy,
  *
  *     cnstnd is a logical variable indicating whether bounds are present
  *
- *     index is an long array of dimension n
+ *     index is an integer array of dimension n
  *       for i=1,...,nfree, index(i) are the indices of free variables
  *       for i=nfree+1,...,n, index(i) are the indices of bound variables
  *       On entry after the first iteration, index gives
@@ -2327,7 +2274,7 @@ int formt_(long *m, double *wt, double *sy,
  *       On exit it gives the free variables based on the determination
  *         in cauchy using the array iwhere.
  *
- *     indx2 is an long array of dimension n
+ *     indx2 is an integer array of dimension n
  *       On entry indx2 is unspecified.
  *       On exit with iter>0, indx2 indicates which variables
  *          have changed status since the previous iteration.
@@ -2343,13 +2290,10 @@ int formt_(long *m, double *wt, double *sy,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int freev_(long *n, long *nfree, long *index,
-  long *nenter, long *ileave, long *indx2, long *iwhere,
-  long *wrk, long *updatd, long *cnstnd, long *iprint,
-  long *iter)
-{
-  long i__1;
-  static long i__, k, iact;
+void freev_(F77_int* n, F77_int* nfree, F77_int* index, F77_int* nenter, F77_int* ileave, F77_int* indx2, F77_int* iwhere, F77_int* wrk, F77_int* updatd,
+           F77_int* cnstnd, F77_int* iprint, F77_int* iter) {
+  F77_int i__1;
+  static F77_int i__, k, iact;
 
   --iwhere;
   --indx2;
@@ -2368,7 +2312,7 @@ int freev_(long *n, long *nfree, long *index,
         --(*ileave);
         indx2[*ileave] = k;
         if (*iprint >= 100) {
-          fprintf(stdout, " Variable %2ld leaves the set of free variables\n", k);
+          fprintf(stdout, " Variable %2" PRIdF77INT " leaves the set of free variables\n", k);
         }
       }
     }
@@ -2379,13 +2323,13 @@ int freev_(long *n, long *nfree, long *index,
         ++(*nenter);
         indx2[*nenter] = k;
         if (*iprint >= 100) {
-          fprintf(stdout, " Variable %2ld enters the set of free variables\n", k);
+          fprintf(stdout, " Variable %2" PRIdF77INT " enters the set of free variables\n", k);
         }
       }
     }
     if (*iprint >= 99) {
       i__1 = *n + 1 - *ileave;
-      fprintf(stdout,  " %2ld variables leave; %2ld variables enter\n", i__1, *nenter);
+      fprintf(stdout, " %2" PRIdF77INT " variables leave; %2" PRIdF77INT " variables enter\n", i__1, *nenter);
     }
   }
   *wrk = *ileave < *n + 1 || *nenter > 0 || *updatd;
@@ -2404,9 +2348,8 @@ int freev_(long *n, long *nfree, long *index,
   }
   if (*iprint >= 99) {
     i__1 = *iter + 1;
-    fprintf(stdout, " %2ld variables are free at GCP %3ld\n", *nfree, i__1);
+    fprintf(stdout, " %2" PRIdF77INT " variables are free at GCP %3" PRIdF77INT "\n", *nfree, i__1);
   }
-  return 0;
 }
 
 /**
@@ -2415,7 +2358,7 @@ int freev_(long *n, long *nfree, long *index,
  *     This subroutine sorts out the least element of t, and puts the
  *       remaining elements of t in a heap.
  *
- *     n is an long variable.
+ *     n is an integer variable.
  *       On entry n is the dimension of the arrays t and iorder.
  *       On exit n is unchanged.
  *
@@ -2424,12 +2367,12 @@ int freev_(long *n, long *nfree, long *index,
  *       On exit t(n) stores the least elements of t, and t(1) to t(n-1)
  *         stores the remaining elements in the form of a heap.
  *
- *     iorder is an long array of dimension n.
+ *     iorder is an integer array of dimension n.
  *       On entry iorder(i) is the index of t(i).
  *       On exit iorder(i) is still the index of t(i), but iorder may be
  *         permuted in accordance with t.
  *
- *     iheap is an long variable specifying the task.
+ *     iheap is an integer variable specifying the task.
  *       On entry iheap should be set as follows:
  *         iheap .eq. 0 if t(1) to t(n) is not in the form of a heap,
  *         iheap .ne. 0 if otherwise.
@@ -2448,12 +2391,11 @@ int freev_(long *n, long *nfree, long *index,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int hpsolb_(long *n, double *t, long *iorder, long *iheap)
-{
-  long i__1;
-  static long i__, j, k;
+void hpsolb_(F77_int* n, double* t, F77_int* iorder, F77_int* iheap) {
+  F77_int i__1;
+  static F77_int i__, j, k;
   static double out, ddum;
-  static long indxin, indxou;
+  static F77_int indxin, indxou;
 
   --iorder;
   --t;
@@ -2466,7 +2408,7 @@ int hpsolb_(long *n, double *t, long *iorder, long *iheap)
       indxin = iorder[k];
       /* Add ddum to the heap. */
       i__ = k;
-L10:
+    L10:
       if (i__ > 1) {
         j = i__ / 2;
         if (ddum < t[j]) {
@@ -2490,7 +2432,7 @@ L10:
     ddum = t[*n];
     indxin = iorder[*n];
     /* Restore the heap */
-L30:
+  L30:
     j = i__ + i__;
     if (j <= *n - 1) {
       if (t[j + 1] < t[j]) {
@@ -2509,7 +2451,6 @@ L30:
     t[*n] = out;
     iorder[*n] = indxou;
   }
-  return 0;
 }
 
 /**
@@ -2534,18 +2475,13 @@ L30:
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int lnsrlb_(long *n, double *l, double *u,
-  long *nbd, double *x, double *f, double *fold,
-  double *gd, double *gdold, double *g, double *d__,
-  double *r__, double *t, double *z__, double *stp,
-  double *dnorm, double *dtd, double *xstep, double *stpmx,
-  long *iter, long *ifun, long *iback, long *nfgv,
-  long *info, char *task, long *boxed, long *cnstnd,
-  char *csave, long *isave, double *dsave)
-{
-  long i__1;
+void lnsrlb_(F77_int* n, double* l, double* u, F77_int* nbd, double* x, double* f, double* fold, double* gd, double* gdold, double* g,
+            double* d__, double* r__, double* t, double* z__, double* stp, double* dnorm, double* dtd, double* xstep,
+            double* stpmx, F77_int* iter, F77_int* ifun, F77_int* iback, F77_int* nfgv, F77_int* info, char* task, F77_int* boxed, F77_int* cnstnd,
+            char* csave, F77_int* isave, double* dsave) {
+  F77_int i__1;
   double d__1;
-  static long i__;
+  static F77_int i__;
   static double a1, a2;
 
   --z__;
@@ -2563,7 +2499,7 @@ int lnsrlb_(long *n, double *l, double *u,
   if (strncmp(task, "FG_LN", 5) == 0) {
     goto L556;
   }
-  *dtd = lbfgsb_rb_ddot_(n, &d__[1], &c__1, &d__[1], &c__1);
+  *dtd = ddot_(n, &d__[1], &c__1, &d__[1], &c__1);
   *dnorm = sqrt(*dtd);
   /* Determine the maximum step length. */
   *stpmx = 1e10;
@@ -2594,20 +2530,20 @@ int lnsrlb_(long *n, double *l, double *u,
       }
     }
   }
-  if (*iter == 0 && ! (*boxed)) {
+  if (*iter == 0 && !(*boxed)) {
     d__1 = 1. / *dnorm;
     *stp = d__1 <= *stpmx ? d__1 : *stpmx;
   } else {
     *stp = 1.;
   }
-  lbfgsb_rb_dcopy_(n, &x[1], &c__1, &t[1], &c__1);
-  lbfgsb_rb_dcopy_(n, &g[1], &c__1, &r__[1], &c__1);
+  dcopy_(n, &x[1], &c__1, &t[1], &c__1);
+  dcopy_(n, &g[1], &c__1, &r__[1], &c__1);
   *fold = *f;
   *ifun = 0;
   *iback = 0;
   strcpy(csave, "START");
 L556:
-  *gd = lbfgsb_rb_ddot_(n, &g[1], &c__1, &d__[1], &c__1);
+  *gd = ddot_(n, &g[1], &c__1, &d__[1], &c__1);
   if (*ifun == 0) {
     *gdold = *gd;
     if (*gd >= 0.) {
@@ -2615,7 +2551,7 @@ L556:
       /* Line search is impossible. */
       fprintf(stdout, "  ascent direction in projection gd =  %.8E\n", *gd);
       *info = -4;
-      return 0;
+      return;
     }
   }
   dcsrch_(f, gd, stp, &c_b280, &c_b281, &c_b282, &c_b9, stpmx, csave, &isave[1], &dsave[1]);
@@ -2626,7 +2562,7 @@ L556:
     ++(*nfgv);
     *iback = *ifun - 1;
     if (*stp == 1.) {
-      lbfgsb_rb_dcopy_(n, &z__[1], &c__1, &x[1], &c__1);
+      dcopy_(n, &z__[1], &c__1, &x[1], &c__1);
     } else {
       i__1 = *n;
       for (i__ = 1; i__ <= i__1; ++i__) {
@@ -2636,7 +2572,6 @@ L556:
   } else {
     strcpy(task, "NEW_X");
   }
-  return 0;
 }
 
 /**
@@ -2658,15 +2593,11 @@ L556:
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int matupd_(long *n, long *m, double *ws,
-  double *wy, double *sy, double *ss, double *d__,
-  double *r__, long *itail, long *iupdat, long *col,
-  long *head, double *theta, double *rr, double *dr,
-  double *stp, double *dtd)
-{
-  long ws_dim1, ws_offset, wy_dim1, wy_offset, sy_dim1, sy_offset, ss_dim1, ss_offset, i__1, i__2;
-  static long j;
-  static long pointr;
+void matupd_(F77_int* n, F77_int* m, double* ws, double* wy, double* sy, double* ss, double* d__, double* r__, F77_int* itail,
+            F77_int* iupdat, F77_int* col, F77_int* head, double* theta, double* rr, double* dr, double* stp, double* dtd) {
+  F77_int ws_dim1, ws_offset, wy_dim1, wy_offset, sy_dim1, sy_offset, ss_dim1, ss_offset, i__1, i__2;
+  static F77_int j;
+  static F77_int pointr;
 
   --r__;
   --d__;
@@ -2693,8 +2624,8 @@ int matupd_(long *n, long *m, double *ws,
     *head = *head % *m + 1;
   }
   /* Update matrices WS and WY. */
-  lbfgsb_rb_dcopy_(n, &d__[1], &c__1, &ws[*itail * ws_dim1 + 1], &c__1);
-  lbfgsb_rb_dcopy_(n, &r__[1], &c__1, &wy[*itail * wy_dim1 + 1], &c__1);
+  dcopy_(n, &d__[1], &c__1, &ws[*itail * ws_dim1 + 1], &c__1);
+  dcopy_(n, &r__[1], &c__1, &wy[*itail * wy_dim1 + 1], &c__1);
   /* Set theta=yy/ys. */
   *theta = *rr / *dr;
   /* Form the middle matrix in B. */
@@ -2704,9 +2635,9 @@ int matupd_(long *n, long *m, double *ws,
     /* move old information */
     i__1 = *col - 1;
     for (j = 1; j <= i__1; ++j) {
-      lbfgsb_rb_dcopy_(&j, &ss[(j + 1) * ss_dim1 + 2], &c__1, &ss[j * ss_dim1 + 1], &c__1);
+      dcopy_(&j, &ss[(j + 1) * ss_dim1 + 2], &c__1, &ss[j * ss_dim1 + 1], &c__1);
       i__2 = *col - j;
-      lbfgsb_rb_dcopy_(&i__2, &sy[j + 1 + (j + 1) * sy_dim1], &c__1, &sy[j + j * sy_dim1], &c__1);
+      dcopy_(&i__2, &sy[j + 1 + (j + 1) * sy_dim1], &c__1, &sy[j + j * sy_dim1], &c__1);
     }
   }
   /* add new information: the last row of SY */
@@ -2714,8 +2645,8 @@ int matupd_(long *n, long *m, double *ws,
   pointr = *head;
   i__1 = *col - 1;
   for (j = 1; j <= i__1; ++j) {
-    sy[*col + j * sy_dim1] = lbfgsb_rb_ddot_(n, &d__[1], &c__1, &wy[pointr * wy_dim1 + 1], &c__1);
-    ss[j + *col * ss_dim1] = lbfgsb_rb_ddot_(n, &ws[pointr * ws_dim1 + 1], &c__1, &d__[1], &c__1);
+    sy[*col + j * sy_dim1] = ddot_(n, &d__[1], &c__1, &wy[pointr * wy_dim1 + 1], &c__1);
+    ss[j + *col * ss_dim1] = ddot_(n, &ws[pointr * ws_dim1 + 1], &c__1, &d__[1], &c__1);
     pointr = pointr % *m + 1;
   }
   if (*stp == 1.) {
@@ -2724,7 +2655,6 @@ int matupd_(long *n, long *m, double *ws,
     ss[*col + *col * ss_dim1] = *stp * *stp * *dtd;
   }
   sy[*col + *col * sy_dim1] = *dr;
-  return 0;
 }
 
 /**
@@ -2743,13 +2673,10 @@ int matupd_(long *n, long *m, double *ws,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int prn1lb_(long *n, long *m, double *l,
-  double *u, double *x, long *iprint, long *itfile,
-  double *epsmch)
-{
-  long i__1;
-  FILE *itfptr;
-  static long i__;
+void prn1lb_(F77_int* n, F77_int* m, double* l, double* u, double* x, F77_int* iprint, F77_int* itfile, double* epsmch) {
+  F77_int i__1;
+  FILE* itfptr;
+  static F77_int i__;
 
   --x;
   --u;
@@ -2759,7 +2686,7 @@ int prn1lb_(long *n, long *m, double *l,
     fprintf(stdout, "RUNNING THE L-BFGS-B CODE\n\n");
     fprintf(stdout, "           * * *\n\n");
     fprintf(stdout, "Machine precision = %.3E\n", *epsmch);
-    fprintf(stdout, " N = %3ld    M = %2ld\n", *n, *m);
+    fprintf(stdout, " N = %3" PRIdF77INT "    M = %2" PRIdF77INT "\n", *n, *m);
     if (*iprint >= 1) {
       itfptr = fopen("iterate.dat", "w");
       fprintf(itfptr, "RUNNING THE L-BFGS-B CODE\n");
@@ -2778,7 +2705,7 @@ int prn1lb_(long *n, long *m, double *l,
       fprintf(itfptr, "\n");
       fprintf(itfptr, "           * * *\n\n");
       fprintf(itfptr, "Machine precision = %.3E\n", *epsmch);
-      fprintf(itfptr, " N = %3ld    M = %2ld\n", *n, *m);
+      fprintf(itfptr, " N = %3" PRIdF77INT "    M = %2" PRIdF77INT "\n", *n, *m);
       fprintf(itfptr, "\n");
       fprintf(itfptr, "   it   nf  nseg  nact  sub  itls  stepl    tstep     projg        f\n");
       fclose(itfptr);
@@ -2822,7 +2749,6 @@ int prn1lb_(long *n, long *m, double *l,
       }
     }
   }
-  return 0;
 }
 
 /**
@@ -2840,14 +2766,11 @@ int prn1lb_(long *n, long *m, double *l,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int prn2lb_(long *n, double *x, double *f,
-  double *g, long *iprint, long *itfile, long *iter,
-  long *nfgv, long *nact, double *sbgnrm, long *nseg, char*word,
-  long *iword, long *iback, double *stp, double *xstep)
-{
-  long i__1;
-  static long i__, imod;
-  FILE *itfptr;
+void prn2lb_(F77_int* n, double* x, double* f, double* g, F77_int* iprint, F77_int* itfile, F77_int* iter, F77_int* nfgv, F77_int* nact,
+            double* sbgnrm, F77_int* nseg, char* word, F77_int* iword, F77_int* iback, double* stp, double* xstep) {
+  F77_int i__1;
+  static F77_int i__, imod;
+  FILE* itfptr;
   --g;
   --x;
 
@@ -2865,8 +2788,8 @@ int prn2lb_(long *n, double *x, double *f,
     strcpy(word, "---");
   }
   if (*iprint >= 99) {
-    fprintf(stdout, "LINE SEARCH %ld times; norm of step = %E\n", *iback, *xstep);
-    fprintf(stdout, "\nAt iterate%5ld    f= %12.5E    |proj g|= %12.5E\n", *iter, *f, *sbgnrm);
+    fprintf(stdout, "LINE SEARCH %" PRIdF77INT " times; norm of step = %E\n", *iback, *xstep);
+    fprintf(stdout, "\nAt iterate%5" PRIdF77INT"    f= %12.5E    |proj g|= %12.5E\n", *iter, *f, *sbgnrm);
 
     if (*iprint > 100) {
       fprintf(stdout, "X =");
@@ -2885,16 +2808,15 @@ int prn2lb_(long *n, double *x, double *f,
   } else if (*iprint > 0) {
     imod = *iter % *iprint;
     if (imod == 0) {
-      fprintf(stdout, "\nAt iterate%5ld    f= %12.5E    |proj g|= %12.5E\n", *iter, *f, *sbgnrm);
+      fprintf(stdout, "\nAt iterate%5" PRIdF77INT "    f= %12.5E    |proj g|= %12.5E\n", *iter, *f, *sbgnrm);
     }
   }
   if (*iprint >= 1) {
     itfptr = fopen("iterate.dat", "a");
-    fprintf(itfptr, " %4ld %4ld %5ld %5ld  %3s %4ld  %7.1E  %7.1E %10.3E %10.3E\n",
+    fprintf(itfptr, " %4" PRIdF77INT " %4" PRIdF77INT " %5" PRIdF77INT " %5" PRIdF77INT "  %3s %4" PRIdF77INT "  %7.1E  %7.1E %10.3E %10.3E\n",
         *iter, *nfgv, *nseg, *nact, word, *iback, *stp, *xstep, *sbgnrm, *f);
     fclose(itfptr);
   }
-  return 0;
 }
 
 /**
@@ -2913,16 +2835,12 @@ int prn2lb_(long *n, double *x, double *f,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int prn3lb_(long *n, double *x, double *f, char *task,
-  long *iprint, long *info, long *itfile, long *iter,
-  long *nfgv, long *nintol, long *nskip, long *nact,
-  double *sbgnrm, double *time, long *nseg, char *word,
-  long *iback, double *stp, double *xstep, long *k,
-  double *cachyt, double *sbtime, double *lnscht)
-{
-  long i__1;
-  FILE *itfptr;
-  static long i__;
+void prn3lb_(F77_int* n, double* x, double* f, char* task, F77_int* iprint, F77_int* info, F77_int* itfile, F77_int* iter, F77_int* nfgv,
+            F77_int* nintol, F77_int* nskip, F77_int* nact, double* sbgnrm, double* time, F77_int* nseg, char* word, F77_int* iback,
+            double* stp, double* xstep, F77_int* k, double* cachyt, double* sbtime, double* lnscht) {
+  F77_int i__1;
+  FILE* itfptr;
+  static F77_int i__;
 
   --x;
 
@@ -2944,7 +2862,8 @@ int prn3lb_(long *n, double *x, double *f, char *task,
     fprintf(stdout, "           * * *\n");
     fprintf(stdout, "\n");
     fprintf(stdout, "   N    Tit     Tnf  Tnint  Skip  Nact     Projg        F\n");
-    fprintf(stdout, "%5ld %6ld %6ld %6ld %5ld %5ld  %10.3E  %10.3E\n", *n, *iter, *nfgv, *nintol, *nskip, *nact, *sbgnrm, *f);
+    fprintf(stdout, "%5" PRIdF77INT " %6" PRIdF77INT " %6" PRIdF77INT " %6" PRIdF77INT " %5" PRIdF77INT " %5" PRIdF77INT "  %10.3E  %10.3E\n",
+        *n, *iter, *nfgv, *nintol, *nskip, *nact, *sbgnrm, *f);
     if (*iprint >= 100) {
       fprintf(stdout, "\n");
       fprintf(stdout, " X =");
@@ -2993,10 +2912,10 @@ L999:
         fprintf(stdout, "   may possibly be caused by a bad search direction.\n");
       }
       if (*info == -6) {
-        fprintf(stdout, "  Input nbd(%2ld) is invalid.\n", *k);
+        fprintf(stdout, "  Input nbd(%2" PRIdF77INT ") is invalid.\n", *k);
       }
       if (*info == -7) {
-        fprintf(stdout, "  l(%2ld) > u(%2ld).  No feasible solution.\n", *k, *k);
+        fprintf(stdout, "  l(%2" PRIdF77INT ") > u(%2" PRIdF77INT ").  No feasible solution.\n", *k, *k);
       }
       if (*info == -8) {
         fprintf(stdout, "\n");
@@ -3023,7 +2942,7 @@ L999:
     if (*iprint >= 1) {
       itfptr = fopen("iterate.dat", "a");
       if (*info == -4 || *info == -9) {
-        fprintf(itfptr, " %4ld %4ld %5ld %5ld  %3s %4ld  %7.1E  %7.1E      -          -\n",
+        fprintf(itfptr, " %4" PRIdF77INT " %4" PRIdF77INT " %5" PRIdF77INT " %5" PRIdF77INT "  %3s %4" PRIdF77INT "  %7.1E  %7.1E      -          -\n",
             *iter, *nfgv, *nseg, *nact, word, *iback, *stp, *xstep);
       }
       fprintf(itfptr, "\n");
@@ -3072,7 +2991,6 @@ L999:
       fclose(itfptr);
     }
   }
-  return 0;
 }
 
 /**
@@ -3090,12 +3008,10 @@ L999:
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal.
  */
-int projgr_(long *n, double *l, double *u,
-  long *nbd, double *x, double *g, double *sbgnrm)
-{
-  long i__1;
+void projgr_(F77_int* n, double* l, double* u, F77_int* nbd, double* x, double* g, double* sbgnrm) {
+  F77_int i__1;
   double d__1, d__2;
-  static long i__;
+  static F77_int i__;
   static double gi;
 
   --g;
@@ -3124,7 +3040,6 @@ int projgr_(long *n, double *l, double *u,
     d__1 = *sbgnrm, d__2 = fabs(gi);
     *sbgnrm = d__1 >= d__2 ? d__1 : d__2;
   }
-  return 0;
 }
 
 /* **********************************************************************
@@ -3161,7 +3076,7 @@ int projgr_(long *n, double *l, double *u,
  *             subject to l<=x<=u
  *                       x_i=xcp_i for all i in A(xcp)
  *
- *       along the subspace unconstrained Newton direction
+ *       aF77_int the subspace unconstrained Newton direction
  *
  *          d = -(Z'BZ)^(-1) r.
  *
@@ -3178,20 +3093,20 @@ int projgr_(long *n, double *l, double *u,
  *     from that described in [1]. One can show that the matrix K is
  *     equal to the matrix M^[-1]N in that paper.
  *
- *     n is an long variable.
+ *     n is an integer variable.
  *       On entry n is the dimension of the problem.
  *       On exit n is unchanged.
  *
- *     m is an long variable.
+ *     m is an integer variable.
  *       On entry m is the maximum number of variable metric corrections
  *         used to define the limited memory matrix.
  *       On exit m is unchanged.
  *
- *     nsub is an long variable.
+ *     nsub is an integer variable.
  *       On entry nsub is the number of free variables.
  *       On exit nsub is unchanged.
  *
- *     ind is an long array of dimension nsub.
+ *     ind is an integer array of dimension nsub.
  *       On entry ind specifies the coordinate indices of free variables.
  *       On exit ind is unchanged.
  *
@@ -3203,7 +3118,7 @@ int projgr_(long *n, double *l, double *u,
  *       On entry u is the upper bound of x.
  *       On exit u is unchanged.
  *
- *     nbd is a long array of dimension n.
+ *     nbd is a integer array of dimension n.
  *       On entry nbd represents the type of bounds imposed on the
  *         variables, and must be specified as follows:
  *         nbd(i)=0 if x(i) is unbounded,
@@ -3233,8 +3148,8 @@ int projgr_(long *n, double *l, double *u,
  *
  *     ws and wy are double precision arrays;
  *     theta is a double precision variable;
- *     col is an long variable;
- *     head is an long variable.
+ *     col is an integer variable;
+ *     head is an integer variable.
  *       On entry they store the information defining the
  *                                          limited memory BFGS matrix:
  *         ws(n,m) stores S, a set of s-vectors;
@@ -3244,7 +3159,7 @@ int projgr_(long *n, double *l, double *u,
  *         head is the location of the 1st s- (or y-) vector in S (or Y).
  *       On exit they are unchanged.
  *
- *     iword is an long variable.
+ *     iword is an integer variable.
  *       On entry iword is unspecified.
  *       On exit iword specifies the status of the subspace solution.
  *         iword = 0 if the solution is in the box,
@@ -3262,7 +3177,7 @@ int projgr_(long *n, double *l, double *u,
  *                                                              [ 0  I]
  *       On exit wn is unchanged.
  *
- *     iprint is an long variable that must be set by the user.
+ *     iprint is an integer variable that must be set by the user.
  *       It controls the frequency and type of output generated:
  *        iprint<0    no output is generated;
  *        iprint=0    print only one line at the last iteration;
@@ -3273,7 +3188,7 @@ int projgr_(long *n, double *l, double *u,
  *       When iprint > 0, the file iterate.dat will be created to
  *                        summarize the iteration.
  *
- *     info is an long variable.
+ *     info is an integer variable.
  *       On entry info is unspecified.
  *       On exit info = 0       for normal return,
  *                    = nonzero for abnormal return
@@ -3299,22 +3214,18 @@ int projgr_(long *n, double *l, double *u,
  *                        Ciyou Zhu
  *     in collaboration with R.H. Byrd, P. Lu-Chen and J. Nocedal
  */
-int subsm_(long *n, long *m, long *nsub, long *ind,
-  double *l, double *u, long *nbd, double *x,
-  double *d__, double *xp, double *ws, double *wy,
-  double *theta, double *xx, double *gg, long *col,
-  long *head, long *iword, double *wv, double *wn,
-  long *iprint, long *info)
-{
-  long ws_dim1, ws_offset, wy_dim1, wy_offset, wn_dim1, wn_offset, i__1, i__2;
+void subsm_(F77_int* n, F77_int* m, F77_int* nsub, F77_int* ind, double* l, double* u, F77_int* nbd, double* x, double* d__, double* xp,
+           double* ws, double* wy, double* theta, double* xx, double* gg, F77_int* col, F77_int* head, F77_int* iword, double* wv,
+           double* wn, F77_int* iprint, F77_int* info) {
+  F77_int ws_dim1, ws_offset, wy_dim1, wy_offset, wn_dim1, wn_offset, i__1, i__2;
   double d__1, d__2;
-  static long i__, j, k, m2;
+  static F77_int i__, j, k, m2;
   static double dk;
-  static long js, jy;
+  static F77_int js, jy;
   static double xk;
-  static long ibd, col2;
+  static F77_int ibd, col2;
   static double dd_p__, temp1, temp2, alpha;
-  static long pointr;
+  static F77_int pointr;
 
   --gg;
   --xx;
@@ -3337,7 +3248,7 @@ int subsm_(long *n, long *m, long *nsub, long *ind,
   --ind;
 
   if (*nsub <= 0) {
-    return 0;
+    return;
   }
   if (*iprint >= 99) {
     fprintf(stdout, "\n----------------SUBSM entered-----------------\n\n");
@@ -3361,17 +3272,17 @@ int subsm_(long *n, long *m, long *nsub, long *ind,
   /* Compute wv:=K^(-1)wv. */
   m2 = *m << 1;
   col2 = *col << 1;
-  lbfgsb_rb_dtrsl_(&wn[wn_offset], &m2, &col2, &wv[1], &c__11, info);
+  dtrsl_(&wn[wn_offset], &m2, &col2, &wv[1], &c__11, info);
   if (*info != 0) {
-    return 0;
+    return;
   }
   i__1 = *col;
   for (i__ = 1; i__ <= i__1; ++i__) {
     wv[i__] = -wv[i__];
   }
-  lbfgsb_rb_dtrsl_(&wn[wn_offset], &m2, &col2, &wv[1], &c__1, info);
+  dtrsl_(&wn[wn_offset], &m2, &col2, &wv[1], &c__1, info);
   if (*info != 0) {
-    return 0;
+    return;
   }
   /* Compute d = (1/theta)d + (1/theta**2)Z'W wv. */
   pointr = *head;
@@ -3381,18 +3292,17 @@ int subsm_(long *n, long *m, long *nsub, long *ind,
     i__2 = *nsub;
     for (i__ = 1; i__ <= i__2; ++i__) {
       k = ind[i__];
-      d__[i__] = d__[i__] + wy[k + pointr * wy_dim1] * wv[jy] / *theta
-        + ws[k + pointr * ws_dim1] * wv[js];
+      d__[i__] = d__[i__] + wy[k + pointr * wy_dim1] * wv[jy] / *theta + ws[k + pointr * ws_dim1] * wv[js];
     }
     pointr = pointr % *m + 1;
   }
   d__1 = 1. / *theta;
-  lbfgsb_rb_dscal_(nsub, &d__1, &d__[1], &c__1);
+  dscal_(nsub, &d__1, &d__[1], &c__1);
 
   /* ----------------------------------------------------------------- */
   /* Let us try the projection, d is the Newton direction */
   *iword = 0;
-  lbfgsb_rb_dcopy_(n, &x[1], &c__1, &xp[1], &c__1);
+  dcopy_(n, &x[1], &c__1, &xp[1], &c__1);
 
   i__1 = *nsub;
   for (i__ = 1; i__ <= i__1; ++i__) {
@@ -3445,7 +3355,7 @@ int subsm_(long *n, long *m, long *nsub, long *ind,
     dd_p__ += (x[i__] - xx[i__]) * gg[i__];
   }
   if (dd_p__ > 0.) {
-    lbfgsb_rb_dcopy_(n, &xp[1], &c__1, &x[1], &c__1);
+    dcopy_(n, &xp[1], &c__1, &x[1], &c__1);
     fprintf(stderr, "  Positive dir derivative in projection\n");
     fprintf(stderr, "  Using the backtracking step\n");
   } else {
@@ -3504,7 +3414,6 @@ L911:
   if (*iprint >= 99) {
     fprintf(stdout, "\n----------------exit SUBSM --------------------\n\n");
   }
-  return 0;
 }
 
 /**
@@ -3621,7 +3530,7 @@ L911:
  *         On exit with convergence, a warning or an error, the
  *            variable task contains additional information.
  *
- *       isave is an long work array of dimension 2.
+ *       isave is an integer work array of dimension 2.
  *
  *       dsave is a double precision work array of dimension 13.
  *
@@ -3637,17 +3546,14 @@ L911:
  *     Argonne National Laboratory and University of Minnesota.
  *     Brett M. Averick, Richard G. Carter, and Jorge J. More'.
  */
-int dcsrch_(double *f, double *g, double *stp,
-  double *ftol, double *gtol, double *xtol,
-  double *stpmin, double *stpmax,
-  char *task, long *isave, double *dsave)
-{
+void dcsrch_(double* f, double* g, double* stp, double* ftol, double* gtol, double* xtol, double* stpmin, double* stpmax,
+            char* task, F77_int* isave, double* dsave) {
 
   double d__1;
   static double fm, gm, fx, fy, gx, gy, fxm, fym, gxm, gym, stx, sty;
-  static long stage;
+  static F77_int stage;
   static double finit, ginit, width, ftest, gtest, stmin, stmax, width1;
-  static long brackt;
+  static F77_int brackt;
 
   --dsave;
   --isave;
@@ -3680,7 +3586,7 @@ int dcsrch_(double *f, double *g, double *stp,
     }
     /* Exit if there are errors on input. */
     if (strncmp(task, "ERROR", 5) == 0) {
-      return 0;
+      return;
     }
     /* Initialize local variables. */
     brackt = FALSE_;
@@ -3824,7 +3730,6 @@ L1000:
   dsave[11] = stmax;
   dsave[12] = width;
   dsave[13] = width1;
-  return 0;
 }
 
 /**
@@ -3917,11 +3822,8 @@ L1000:
  *     Argonne National Laboratory and University of Minnesota.
  *     Brett M. Averick and Jorge J. More'.
  */
-int dcstep_(double *stx, double *fx, double *dx,
-  double *sty, double *fy, double *dy, double *stp,
-  double *fp, double *dp, long *brackt, double *stpmin,
-  double *stpmax)
-{
+void dcstep_(double* stx, double* fx, double* dx, double* sty, double* fy, double* dy, double* stp, double* fp, double* dp,
+            F77_int* brackt, double* stpmin, double* stpmax) {
   double d__1, d__2, d__3;
   static double p, q, r__, s, sgnd, stpc, stpf, stpq, gamma, theta;
 
@@ -3953,10 +3855,10 @@ int dcstep_(double *stx, double *fx, double *dx,
       stpf = stpc + (stpq - stpc) / 2.;
     }
     *brackt = TRUE_;
-  /* Second case: A lower function value and derivatives of opposite */
-  /* sign. The minimum is bracketed. If the cubic step is farther from */
-  /* stp than the secant step, the cubic step is taken, otherwise the */
-  /* secant step is taken. */
+    /* Second case: A lower function value and derivatives of opposite */
+    /* sign. The minimum is bracketed. If the cubic step is farther from */
+    /* stp than the secant step, the cubic step is taken, otherwise the */
+    /* secant step is taken. */
   } else if (sgnd < 0.) {
     theta = (*fx - *fp) * 3. / (*stp - *stx) + *dx + *dp;
     d__1 = fabs(theta);
@@ -3980,8 +3882,8 @@ int dcstep_(double *stx, double *fx, double *dx,
       stpf = stpq;
     }
     *brackt = TRUE_;
-  /* Third case: A lower function value, derivatives of the same sign, */
-  /* and the magnitude of the derivative decreases. */
+    /* Third case: A lower function value, derivatives of the same sign, */
+    /* and the magnitude of the derivative decreases. */
   } else if (fabs(*dp) < fabs(*dx)) {
     /* The cubic step is computed only if the cubic tends to infinity */
     /* in the direction of the step or if the minimum of the cubic */
@@ -4041,10 +3943,10 @@ int dcstep_(double *stx, double *fx, double *dx,
       stpf = *stpmax <= stpf ? *stpmax : stpf;
       stpf = *stpmin >= stpf ? *stpmin : stpf;
     }
-  /* Fourth case: A lower function value, derivatives of the same sign, */
-  /* and the magnitude of the derivative does not decrease. If the */
-  /* minimum is not bracketed, the step is either stpmin or stpmax, */
-  /* otherwise the cubic step is taken. */
+    /* Fourth case: A lower function value, derivatives of the same sign, */
+    /* and the magnitude of the derivative does not decrease. If the */
+    /* minimum is not bracketed, the step is either stpmin or stpmax, */
+    /* otherwise the cubic step is taken. */
   } else {
     if (*brackt) {
       theta = (*fp - *fy) * 3. / (*sty - *stp) + *dy + *dp;
@@ -4052,7 +3954,7 @@ int dcstep_(double *stx, double *fx, double *dx,
       d__2 = fabs(*dy);
       d__1 = d__1 >= d__2 ? d__1 : d__2;
       d__2 = fabs(*dp);
-      s = d__1 >= d__2 ? d__1: d__2;
+      s = d__1 >= d__2 ? d__1 : d__2;
       d__1 = theta / s;
       gamma = s * sqrt(d__1 * d__1 - *dy / s * (*dp / s));
       if (*stp > *sty) {
@@ -4086,11 +3988,8 @@ int dcstep_(double *stx, double *fx, double *dx,
   }
   /* Compute the new step. */
   *stp = stpf;
-  return 0;
 }
 
-int timer_(double *ttime)
-{
+void timer_(double* ttime) {
   *ttime = (double)clock() / CLOCKS_PER_SEC;
-  return 0;
 }