/* nag_zhpmv (f16sec) Example Program.
 *
 * Copyright 2005 Numerical Algorithms Group.
 *
 * Mark 8, 2005.
 */

#include <stdio.h>
#include <nag.h>
#include <nag_stdlib.h>
#include <nagf16.h>
#include <nagx04.h>

int main(void)
{

  /* Scalars */
  Complex alpha, beta;
  Integer aplen, exit_status, i, incx, incy, j, n, xlen, ylen;

  /* Arrays */
  Complex *ap=0, *x=0, *y=0;
  char nag_enum_arg[40];

  /* Nag Types */
  NagError fail;
  Nag_OrderType order;
  Nag_UploType uplo;

#ifdef NAG_COLUMN_MAJOR
#define A_UPPER(I,J) ap[J*(J-1)/2 + I - 1]
#define A_LOWER(I,J) ap[(2*n-J)*(J-1)/2 + I - 1]
  order = Nag_ColMajor;
#else
#define A_LOWER(I,J) ap[I*(I-1)/2 + J - 1]
#define A_UPPER(I,J) ap[(2*n-I)*(I-1)/2 + J - 1]
  order = Nag_RowMajor;
#endif

  exit_status = 0;
  INIT_FAIL(fail);
  Vprintf( "nag_zhpmv (f16sec) Example Program Results\n\n");

  /* Skip heading in data file */
  Vscanf("%*[^\n] ");
  /* Read the problem dimension */
  Vscanf("%ld%*[^\n] ", &n);
  /* Read uplo */
  Vscanf("%s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value(x04nac).
   * Converts NAG enum member name to value
   */
  uplo = nag_enum_name_to_value(nag_enum_arg);
  /* Read scalar parameters */
  Vscanf(" ( %lf , %lf ) ( %lf , %lf )%*[^\n] ",
         &alpha.re, &alpha.im, &beta.re, &beta.im);
  /* Read increment parameters */
  Vscanf("%ld%ld%*[^\n] ", &incx, &incy);

  aplen = n*(n+1)/2;
  xlen = MAX(1, 1 + (n - 1)*ABS(incx));
  ylen = MAX(1, 1 + (n - 1)*ABS(incy));


  if (n > 0)
    {
      /* Allocate memory */
      if ( !(ap = NAG_ALLOC(aplen, Complex)) ||
           !(x = NAG_ALLOC(xlen, Complex)) ||
           !(y = NAG_ALLOC(ylen, Complex)) )
        {
          Vprintf("Allocation failure\n");
          exit_status = -1;
          goto END;
        }
    }
  else
    {
      Vprintf("Invalid n\n");
      exit_status = 1;
      return exit_status;
    }

  /* Read A from data file */
  if (uplo == Nag_Upper)
    {
      for (i = 1; i <= n; ++i)
        {
          for (j = i; j <= n; ++j)
            Vscanf(" ( %lf , %lf )",
                   &A_UPPER(i,j).re, &A_UPPER(i,j).im);
        }
      Vscanf("%*[^\n] ");
    }
  else
    {
      for (i = 1; i <= n; ++i)
        {
          for (j = 1; j <= i; ++j)
            Vscanf(" ( %lf , %lf )",
                   &A_LOWER(i,j).re, &A_LOWER(i,j).im);
        }
      Vscanf("%*[^\n] ");
    }

  /* Input vectors x and y */
  for (i = 1; i <= xlen; ++i)
    Vscanf(" ( %lf , %lf )%*[^\n] ", &x[i - 1].re, &x[i - 1].im);
  for (i = 1; i <= ylen; ++i)
    Vscanf(" ( %lf , %lf )%*[^\n] ", &y[i - 1].re, &y[i - 1].im);

  /* nag_zhpmv(f16sec).
   * Hermitian packed storage matrix-vector multiply.
   *
   */
  nag_zhpmv(order, uplo, n, alpha, ap, x, incx, beta, y,
            incy, &fail);
  if (fail.code != NE_NOERROR)
    {
      Vprintf("Error from nag_zhpmv.\n%s\n", fail.message);
      exit_status = 1;
      goto END;
    }

  /* Print output vector y */
  Vprintf("%s\n", "  y");
  for (i = 1; i <= ylen; ++i)
    Vprintf("(%11f,%11f)\n", y[i-1].re, y[i-1].im);

 END:
  if (ap) NAG_FREE(ap);
  if (x) NAG_FREE(x);
  if (y) NAG_FREE(y);

  return exit_status;
}