/* nag_lapacklin_zgetrf (f07arc) Example Program.
 *
 * Copyright 2020 Numerical Algorithms Group.
 *
 * Mark 27.1, 2020.
 */

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

int main(void) {

  /* Scalars */
  Integer i, j, m, n, pda, ipiv_len;
  Integer exit_status = 0;
  NagError fail;
  Nag_OrderType order;
  /* Arrays */
  Complex *a = 0;
  Integer *ipiv = 0;

#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

  INIT_FAIL(fail);

  printf("nag_lapacklin_zgetrf (f07arc) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");
  scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &m, &n);
#ifdef NAG_COLUMN_MAJOR
  pda = m;
#else
  pda = n;
#endif
  ipiv_len = MIN(m, n);
  /* Allocate memory */
  if (!(a = NAG_ALLOC(m * n, Complex)) ||
      !(ipiv = NAG_ALLOC(ipiv_len, Integer))) {
    printf("Allocation failure\n");
    exit_status = -1;
    goto END;
  }

  /* Read A from data file */
  for (i = 1; i <= m; ++i) {
    for (j = 1; j <= n; ++j)
      scanf(" ( %lf , %lf )", &A(i, j).re, &A(i, j).im);
  }
  scanf("%*[^\n] ");

  /* Factorize A */
  /* nag_lapacklin_zgetrf (f07arc).
   * LU factorization of complex m by n matrix
   */
  nag_lapacklin_zgetrf(order, m, n, a, pda, ipiv, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_lapacklin_zgetrf (f07arc).\n%s\n", fail.message);
    exit_status = 1;
    goto END;
  }

  /* Print details of factorization */
  /* nag_file_print_matrix_complex_gen_comp (x04dbc).
   * Print complex general matrix (comprehensive)
   */
  fflush(stdout);
  nag_file_print_matrix_complex_gen_comp(
      order, Nag_GeneralMatrix, Nag_NonUnitDiag, m, n, a, pda, Nag_BracketForm,
      "%7.4f", "Details of factorization", Nag_IntegerLabels, 0,
      Nag_IntegerLabels, 0, 80, 0, 0, &fail);
  if (fail.code != NE_NOERROR) {
    printf("Error from nag_file_print_matrix_complex_gen_comp (x04dbc).\n%s\n",
           fail.message);
    exit_status = 1;
    goto END;
  }

  /* Print pivot indices */
  printf("\nipiv\n");
  for (i = 1; i <= MIN(m, n); ++i)
    printf("%12" NAG_IFMT "%s", ipiv[i - 1], i % 4 == 0 ? "\n" : " ");
  printf("\n");

END:
  NAG_FREE(a);
  NAG_FREE(ipiv);
  return exit_status;
}