/* nag_daxpby (f16ecc) Example Program.
 *
 * Copyright 2014 Numerical Algorithms Group.
 *
 * Mark 24, 2013.
 */

#include <stdio.h>
#include <nag.h>
#include <nag_stdlib.h>
#include <nagf16.h>
int main(void)
{
  /* Scalars */
  Integer  exit_status, i, incx, incy, n, xlen, ylen;
  double   alpha, beta;
  /* Arrays */
  double   *x = 0, *y = 0;
  /* Nag Types */
  NagError fail;

  exit_status = 0;
  INIT_FAIL(fail);

  printf("nag_daxpby (f16ecc) Example Program Results\n\n");

  /* Skip heading in data file */
  scanf("%*[^\n] ");
  /* Read number of elements */
  scanf("%ld%*[^\n] ", &n);
  /* Read increments */
  scanf("%ld%ld%*[^\n] ", &incx, &incy);
  /* Read factors alpha and beta */
  scanf("%lf%lf%*[^\n] ", &alpha, &beta);

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

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

  /* Input vector x */
      for (i = 0; i < xlen ; i = i + abs(incx))
        scanf("%lf", &x[i]);
      scanf("%*[^\n] ");

  /* Input vector y */
  for (i = 0; i < ylen; i = i + abs(incy))
    scanf("%lf", &y[i]);
  scanf("%*[^\n] ");

  /* nag_daxpby (f16ecc).
   * Performs y := alpha*x + beta*y  */
  nag_daxpby(n, alpha, x, incx, beta, y, incy, &fail);
  
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_daxpby (f16ecc).\n%s\n", fail.message);
      exit_status = 1;
      goto END;
    }

  /* Print the result */
  printf("Result of the scaled vector accumulation is\n");
  printf("y = (");

  for (i = 0; i < ylen - 1; i = i + abs(incy))
    printf("%9.4f, ", y[i]);
  printf("%9.4f)\n", y[ylen - 1]);

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

  return exit_status;
}