/* nag_ztrsv (f16sjc) Example Program.
 *
 * Copyright 2005 Numerical Algorithms Group.
 *
 * Mark 8, 2005.
 */

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

int main(void)
{

  /* Scalars */
  Complex       alpha;
  Integer       exit_status, i, incx, j, n, pda, xlen;

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

  /* Nag Types */
  NagError      fail;
  Nag_OrderType order;
  Nag_TransType trans;
  Nag_UploType  uplo;
  Nag_DiagType  diag;

#ifdef NAG_COLUMN_MAJOR
#define A(I, J) a[(J-1)*pda + I - 1]
  order = Nag_ColMajor;
#else
#define A(I, J) a[(I-1)*pda + J - 1]
  order = Nag_RowMajor;
#endif

  exit_status = 0;
  INIT_FAIL(fail);

  printf("nag_ztrsv (f16sjc) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");

  /* Read the problem dimensions */
  scanf("%ld%*[^\n] ", &n);

  /* Read the uplo storage parameter */
  scanf("%s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value(x04nac).
   * Converts NAG enum member name to value
   */
  uplo = (Nag_UploType) nag_enum_name_to_value(nag_enum_arg);
  /* Read the transpose parameter */
  scanf("%s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value(x04nac), see above. */
  trans = (Nag_TransType) nag_enum_name_to_value(nag_enum_arg);
  /* Read the unit-diagonal parameter */
  scanf("%s%*[^\n] ", nag_enum_arg);
  /* nag_enum_name_to_value(x04nac), see above. */
  diag = (Nag_DiagType) nag_enum_name_to_value(nag_enum_arg);

  /* Read scalar parameters */
  scanf(" ( %lf , %lf )%*[^\n] ", &alpha.re, &alpha.im);
  /* Read increment parameter */
  scanf("%ld%*[^\n] ", &incx);

  pda = n;
  xlen = MAX(1, 1 + (n - 1)*ABS(incx));

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

  /* Input matrix A and vector x*/

  if (uplo == Nag_Upper)
    {
      for (i = 1; i <= n; ++i)
        {
          if (diag == Nag_NonUnitDiag)
            scanf(" ( %lf , %lf )", &A(i, i).re, &A(i, i).im);
          for (j = i+1; j <= n; ++j)
            scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
        }
      scanf("%*[^\n] ");
    }
  else
    {
      for (i = 1; i <= n; ++i)
        {
          for (j = 1; j < i; ++j)
            scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
          if (diag == Nag_NonUnitDiag)
            scanf(" ( %lf , %lf )", &A(i, i).re, &A(i, i).im);
        }
      scanf("%*[^\n] ");
    }
  for (i = 0; i < xlen; ++i)
    scanf(" ( %lf , %lf )%*[^\n] ", &x[i].re, &x[i].im);

  /* nag_ztrsv(f16sjc).
   * Solution of complex triangular system of linear equations.
   *
   */
  nag_ztrsv(order, uplo, trans, diag, n, alpha, a, pda, x, incx,
            &fail);
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_ztrsv.\n%s\n", fail.message);
      exit_status = 1;
      goto END;
    }

  /* Print output vector x */
  printf("%s\n", " Solution x:");
  for (i = 0; i < xlen; ++i)
    {
      printf("( %11f , %11f )\n", x[i].re, x[i].im);
    }

 END:
  if (a) NAG_FREE(a);
  if (x) NAG_FREE(x);

  return exit_status;
}