/* nag_zaxpby (f16gcc) Example Program.
*
* NAGPRODCODE Version.
*
* Copyright 2016 Numerical Algorithms Group.
*
* Mark 26, 2016.
*/

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

exit_status = 0;
INIT_FAIL(fail);

printf("nag_zaxpby (f16gcc) Example Program Results\n\n");

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

if (n > 0) {
/* Allocate memory */
if (!(x = NAG_ALLOC(MAX(1, 1 + (n - 1) * ABS(incx)), Complex)) ||
!(y = NAG_ALLOC(MAX(1, 1 + (n - 1) * ABS(incy)), Complex)))
{
printf("Allocation failure\n");
exit_status = -1;
goto END;
}
}
else {
printf("Invalid n\n");
exit_status = 1;
goto END;
}

/* Read the vectors x and y and store forwards or backwards
* as determined by incx (resp. incy). */
for (i = 0, ix = (incx > 0 ? 0 : (1-n)*incx); i < n; i++, ix += incx)
scanf(" ( %lf , %lf )", &x[ix].re, &x[ix].im);
scanf("%*[^\n] ");

for (i = 0, iy = (incy > 0 ? 0 : (1-n)*incy); i < n; i++, iy += incy)
scanf(" ( %lf , %lf )", &y[iy].re, &y[iy].im);
scanf("%*[^\n] ");

/* nag_zaxpby (f16gcc).
* Performs y := alpha*x + beta*y  */
nag_zaxpby(n, alpha, x, incx, beta, y, incy, &fail);

if (fail.code != NE_NOERROR) {
printf("Error from nag_zaxpby (f16gcc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}

/* Display the vector y forwards or backwards
* as determined by incy. */
printf("Result of the scaled vector accumulation is\n");
printf("y = (");
for (i = 0, iy = (incy > 0 ? 0 : (1-n)*incy); i < n; i++, iy += incy)
printf("(%9.4f, %9.4f)%s", y[iy].re, y[iy].im, (i < n-1 ? ", " : ")\n"));

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

return exit_status;
}