STYLE: Remove trailing whitespace in Fortran files

This is mostly a long term maintenance improvement.

Many coding styles require elimination of trailing whitespace, and
many editors and source code management configurations automatically
gobble up whitespace. When these tools gobble up whitespace, it
complicates reviewing the meaningful code changes.

By removing whitespace on one patch, it makes future
code reviews much easier.

=SCRIPT====================================================================

if which tempfile &>/dev/null; then
  TEMPMAKER=tempfile
elif which mktemp &>/dev/null; then
  TEMPMAKER=mktemp
else
  echo "Cannot find tempfile program." 2>&1
  exit 1
fi

MYTEMP=$($TEMPMAKER)
trap 'rm -f $MYTEMP' SIGINT SIGTERM

stripit() {
  echo "stripping $1"
  sed 's/[ \t]*$//' "$1" > $MYTEMP
  cp $MYTEMP "$1"
}

if [ $# -gt 0 ]; then
  while [ "$1" != "" ]; do
    stripit $1
    shift
  done
else
  while read -t 2; do
    stripit $REPLY
  done
fi

rm $MYTEMP
=================================================

1 files changed, 33 insertions, 33 deletions

diff --git a/SRC/stpqrt2.f b/SRC/stpqrt2.f
index beb2b97d..59335108 100644
--- a/SRC/stpqrt2.f
+++ b/SRC/stpqrt2.f
@@ -2,31 +2,31 @@
 *
 *  =========== DOCUMENTATION ===========
 *
-* Online html documentation available at 
-*            http://www.netlib.org/lapack/explore-html/ 
+* Online html documentation available at
+*            http://www.netlib.org/lapack/explore-html/
 *
 *> \htmlonly
-*> Download STPQRT2 + dependencies 
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/stpqrt2.f"> 
-*> [TGZ]</a> 
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/stpqrt2.f"> 
-*> [ZIP]</a> 
-*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/stpqrt2.f"> 
+*> Download STPQRT2 + dependencies
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/stpqrt2.f">
+*> [TGZ]</a>
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/stpqrt2.f">
+*> [ZIP]</a>
+*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/stpqrt2.f">
 *> [TXT]</a>
-*> \endhtmlonly 
+*> \endhtmlonly
 *
 *  Definition:
 *  ===========
 *
 *       SUBROUTINE STPQRT2( M, N, L, A, LDA, B, LDB, T, LDT, INFO )
-* 
+*
 *       .. Scalar Arguments ..
 *       INTEGER   INFO, LDA, LDB, LDT, N, M, L
 *       ..
 *       .. Array Arguments ..
 *       REAL   A( LDA, * ), B( LDB, * ), T( LDT, * )
 *       ..
-*  
+*
 *
 *> \par Purpose:
 *  =============
@@ -34,7 +34,7 @@
 *> \verbatim
 *>
 *> STPQRT2 computes a QR factorization of a real "triangular-pentagonal"
-*> matrix C, which is composed of a triangular block A and pentagonal block B, 
+*> matrix C, which is composed of a triangular block A and pentagonal block B,
 *> using the compact WY representation for Q.
 *> \endverbatim
 *
@@ -44,7 +44,7 @@
 *> \param[in] M
 *> \verbatim
 *>          M is INTEGER
-*>          The total number of rows of the matrix B.  
+*>          The total number of rows of the matrix B.
 *>          M >= 0.
 *> \endverbatim
 *>
@@ -59,7 +59,7 @@
 *> \param[in] L
 *> \verbatim
 *>          L is INTEGER
-*>          The number of rows of the upper trapezoidal part of B.  
+*>          The number of rows of the upper trapezoidal part of B.
 *>          MIN(M,N) >= L >= 0.  See Further Details.
 *> \endverbatim
 *>
@@ -80,7 +80,7 @@
 *> \param[in,out] B
 *> \verbatim
 *>          B is REAL array, dimension (LDB,N)
-*>          On entry, the pentagonal M-by-N matrix B.  The first M-L rows 
+*>          On entry, the pentagonal M-by-N matrix B.  The first M-L rows
 *>          are rectangular, and the last L rows are upper trapezoidal.
 *>          On exit, B contains the pentagonal matrix V.  See Further Details.
 *> \endverbatim
@@ -114,10 +114,10 @@
 *  Authors:
 *  ========
 *
-*> \author Univ. of Tennessee 
-*> \author Univ. of California Berkeley 
-*> \author Univ. of Colorado Denver 
-*> \author NAG Ltd. 
+*> \author Univ. of Tennessee
+*> \author Univ. of California Berkeley
+*> \author Univ. of Colorado Denver
+*> \author NAG Ltd.
 *
 *> \date September 2012
 *
@@ -128,10 +128,10 @@
 *>
 *> \verbatim
 *>
-*>  The input matrix C is a (N+M)-by-N matrix  
+*>  The input matrix C is a (N+M)-by-N matrix
 *>
 *>               C = [ A ]
-*>                   [ B ]        
+*>                   [ B ]
 *>
 *>  where A is an upper triangular N-by-N matrix, and B is M-by-N pentagonal
 *>  matrix consisting of a (M-L)-by-N rectangular matrix B1 on top of a L-by-N
@@ -141,8 +141,8 @@
 *>                   [ B2 ]  <-     L-by-N upper trapezoidal.
 *>
 *>  The upper trapezoidal matrix B2 consists of the first L rows of a
-*>  N-by-N upper triangular matrix, where 0 <= L <= MIN(M,N).  If L=0, 
-*>  B is rectangular M-by-N; if M=L=N, B is upper triangular.  
+*>  N-by-N upper triangular matrix, where 0 <= L <= MIN(M,N).  If L=0,
+*>  B is rectangular M-by-N; if M=L=N, B is upper triangular.
 *>
 *>  The matrix W stores the elementary reflectors H(i) in the i-th column
 *>  below the diagonal (of A) in the (N+M)-by-N input matrix C
@@ -156,12 +156,12 @@
 *>                   [ V ]  <- M-by-N, same form as B.
 *>
 *>  Thus, all of information needed for W is contained on exit in B, which
-*>  we call V above.  Note that V has the same form as B; that is, 
+*>  we call V above.  Note that V has the same form as B; that is,
 *>
 *>               V = [ V1 ] <- (M-L)-by-N rectangular
 *>                   [ V2 ] <-     L-by-N upper trapezoidal.
 *>
-*>  The columns of V represent the vectors which define the H(i)'s.  
+*>  The columns of V represent the vectors which define the H(i)'s.
 *>  The (M+N)-by-(M+N) block reflector H is then given by
 *>
 *>               H = I - W * T * W^H
@@ -227,7 +227,7 @@
 *     Quick return if possible
 *
       IF( N.EQ.0 .OR. M.EQ.0 ) RETURN
-*      
+*
       DO I = 1, N
 *
 *        Generate elementary reflector H(I) to annihilate B(:,I)
@@ -241,16 +241,16 @@
             DO J = 1, N-I
                T( J, N ) = (A( I, I+J ))
             END DO
-            CALL SGEMV( 'T', P, N-I, ONE, B( 1, I+1 ), LDB, 
+            CALL SGEMV( 'T', P, N-I, ONE, B( 1, I+1 ), LDB,
      $                  B( 1, I ), 1, ONE, T( 1, N ), 1 )
 *
 *           C(I:M,I+1:N) = C(I:m,I+1:N) + alpha*C(I:M,I)*W(1:N-1)^H
 *
-            ALPHA = -(T( I, 1 ))            
+            ALPHA = -(T( I, 1 ))
             DO J = 1, N-I
                A( I, I+J ) = A( I, I+J ) + ALPHA*(T( J, N ))
             END DO
-            CALL SGER( P, N-I, ALPHA, B( 1, I ), 1, 
+            CALL SGER( P, N-I, ALPHA, B( 1, I ), 1,
      $           T( 1, N ), 1, B( 1, I+1 ), LDB )
          END IF
       END DO
@@ -278,13 +278,13 @@
 *
 *        Rectangular part of B2
 *
-         CALL SGEMV( 'T', L, I-1-P, ALPHA, B( MP, NP ), LDB, 
+         CALL SGEMV( 'T', L, I-1-P, ALPHA, B( MP, NP ), LDB,
      $               B( MP, I ), 1, ZERO, T( NP, I ), 1 )
 *
 *        B1
 *
-         CALL SGEMV( 'T', M-L, I-1, ALPHA, B, LDB, B( 1, I ), 1, 
-     $               ONE, T( 1, I ), 1 )         
+         CALL SGEMV( 'T', M-L, I-1, ALPHA, B, LDB, B( 1, I ), 1,
+     $               ONE, T( 1, I ), 1 )
 *
 *        T(1:I-1,I) := T(1:I-1,1:I-1) * T(1:I-1,I)
 *
@@ -295,7 +295,7 @@
          T( I, I ) = T( I, 1 )
          T( I, 1 ) = ZERO
       END DO
-   
+
 *
 *     End of STPQRT2
 *