[n,sa,sx,incx]=sscal(n,sa,sx,incx);

function [n,sa,sx,incx]=sscal(n,sa,sx,incx);
%***BEGIN PROLOGUE  SSCAL
%***PURPOSE  Multiply a vector by a constant.
%***LIBRARY   SLATEC (BLAS)
%***CATEGORY  D1A6
%***TYPE      SINGLE PRECISION (SSCAL-S, DSCAL-D, CSCAL-C)
%***KEYWORDS  BLAS, LINEAR ALGEBRA, SCALE, VECTOR
%***AUTHOR  Lawson, C. L., (JPL)
%           Hanson, R. J., (SNLA)
%           Kincaid, D. R., (U. of Texas)
%           Krogh, F. T., (JPL)
%***DESCRIPTION
%
%                B L A S  Subprogram
%    Description of Parameters
%
%     --Input--
%        N  number of elements in input vector(s)
%       SA  single precision scale factor
%       SX  single precision vector with N elements
%     INCX  storage spacing between elements of SX
%
%     --Output--
%       SX  single precision result (unchanged if N .LE. 0)
%
%     Replace single precision SX by single precision SA*SX.
%     For I = 0 to N-1, replace SX(IX+I*INCX) with  SA * SX(IX+I*INCX),
%     where IX = 1 if INCX .GE. 0, else IX = 1+(1-N)*INCX.
%
%***REFERENCES  C. L. Lawson, R. J. Hanson, D. R. Kincaid and F. T.
%                 Krogh, Basic linear algebra subprograms for Fortran
%                 usage, Algorithm No. 539, Transactions on Mathematical
%                 Software 5, 3 (September 1979), pp. 308-323.
%***ROUTINES CALLED  (NONE)
%***REVISION HISTORY  (YYMMDD)
%   791001  DATE WRITTEN
%   890831  Modified array declarations.  (WRB)
%   890831  REVISION DATE from Version 3.2
%   891214  Prologue converted to Version 4.0 format.  (BAB)
%   900821  Modified to correct problem with a negative increment.
%           (WRB)
%   920501  Reformatted the REFERENCES section.  (WRB)
%***end PROLOGUE  SSCAL
persistent i ix m mp1 ; 

sx_shape=size(sx);sx=reshape(sx,1,[]);
if isempty(i), i=0; end;
if isempty(ix), ix=0; end;
if isempty(m), m=0; end;
if isempty(mp1), mp1=0; end;
%***FIRST EXECUTABLE STATEMENT  SSCAL
if( n<=0 )
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
return;
end;
if( incx==1 )
%
%     Code for increment equal to 1.
%
%     Clean-up loop so remaining vector length is a multiple of 5.
%
m = fix(rem(n,5));
if( m~=0 )
for i = 1 : m;
sx(i) = sa.*sx(i);
end; i = fix(m+1);
if( n<5 )
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
return;
end;
end;
mp1 = fix(m + 1);
for i = mp1 : 5: n ;
sx(i) = sa.*sx(i);
sx(i+1) = sa.*sx(i+1);
sx(i+2) = sa.*sx(i+2);
sx(i+3) = sa.*sx(i+3);
sx(i+4) = sa.*sx(i+4);
end; i = fix(n +1);
else;
%
%     Code for increment not equal to 1.
%
ix = 1;
if( incx<0 )
ix =fix((-n+1).*incx + 1);
end;
for i = 1 : n;
sx(ix) = sa.*sx(ix);
ix = fix(ix + incx);
end; i = fix(n+1);
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
return;
end;
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
end
%DECK SSD2S