/* nag_blast_zhpr2 (f16ssc) Example Program.
 *
 * Copyright 2022 Numerical Algorithms Group.
 *
 * Mark 28.7, 2022.
 */

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

int main(void) {

  /* Scalars */
  Complex alpha;
  double beta;
  Integer exit_status, i, incx, incy, j, n, pda, 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);

  printf("nag_blast_zhpr2 (f16ssc) Example Program Results\n\n");

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

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

  /* Read the uplo storage parameter */
  scanf("%39s%*[^\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 scalar parameters */
  scanf(" ( %lf , %lf )%*[^\n] ", &alpha.re, &alpha.im);
  scanf("%lf%*[^\n] ", &beta);
  /* Read increment parameters */
  scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &incx, &incy);

  pda = n;

  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(pda * n, Complex)) ||
        !(x = NAG_ALLOC(xlen, Complex)) || !(y = NAG_ALLOC(ylen, 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) {
      for (j = i; j <= n; ++j)
        scanf(" ( %lf , %lf )", &A_UPPER(i, j).re, &A_UPPER(i, j).im);
      scanf("%*[^\n] ");
    }
  } else {
    for (i = 1; i <= n; ++i) {
      for (j = 1; j <= i; ++j)
        scanf(" ( %lf , %lf )", &A_LOWER(i, j).re, &A_LOWER(i, j).im);
      scanf("%*[^\n] ");
    }
  }
  for (i = 0; i < xlen; ++i)
    scanf(" ( %lf , %lf )%*[^\n] ", &x[i].re, &x[i].im);
  for (i = 0; i < ylen; ++i)
    scanf(" ( %lf , %lf )%*[^\n] ", &y[i].re, &y[i].im);

  /* nag_blast_zhpr2 (f16ssc).
   * Rank two update of complex Hermitian matrix,
   * packed storage.
   */
  nag_blast_zhpr2(order, uplo, n, alpha, x, incx, y, incy, beta, ap, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_blast_zhpr2 (f16ssc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Print updated matrix A */
  /* nag_file_print_matrix_complex_packed_comp (x04ddc).
   * Print complex packed triangular matrix (comprehensive)
   */
  fflush(stdout);
  nag_file_print_matrix_complex_packed_comp(
      order, uplo, Nag_NonUnitDiag, n, ap, Nag_BracketForm, "%5.1f",
      "Updated Matrix A", Nag_IntegerLabels, 0, Nag_IntegerLabels, 0, 80, 0, 0,
      &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_file_print_matrix_complex_packed_comp (x04ddc).\n%s"
           "\n",
           fail.message);
    exit_status = 1;
    goto END;
  }
END:
  NAG_FREE(ap);
  NAG_FREE(x);
  NAG_FREE(y);

  return exit_status;
}