/* nag_blast_isum (f16dlc) Example Program.
*
* Copyright 2023 Numerical Algorithms Group.
*
* Mark 29.2, 2023.
*/
#include <nag.h>
#include <stdio.h>
int main(void) {
/* Scalars */
Integer exit_status, i, incx, ix, n, sumval;
/* Arrays */
Integer *x = 0;
/* Nag Types */
NagError fail;
exit_status = 0;
INIT_FAIL(fail);
printf("nag_blast_isum (f16dlc) Example Program Results\n\n");
/* Skip heading in data file */
scanf("%*[^\n] ");
/* Read the number of elements and the increment */
scanf("%" NAG_IFMT "%" NAG_IFMT "%*[^\n] ", &n, &incx);
if (n > 0) {
/* Allocate memory */
if (!(x = NAG_ALLOC(MAX(1, 1 + (n - 1) * ABS(incx)), Integer))) {
printf("Allocation failure\n");
exit_status = -1;
goto END;
}
} else {
printf("Invalid n\n");
exit_status = 1;
goto END;
}
/* Read the vector x and store forwards or backwards
* as determined by incx. */
for (i = 0, ix = (incx > 0 ? 0 : (1 - n) * incx); i < n; i++, ix += incx)
scanf("%" NAG_IFMT "", &x[ix]);
scanf("%*[^\n] ");
/* nag_blast_isum (f16dlc).
* Sum elements of an Integer vector */
sumval = nag_blast_isum(n, x, incx, &fail);
if (fail.code != NE_NOERROR) {
printf("Error from nag_blast_isum (f16dlc).\n%s\n", fail.message);
exit_status = 1;
goto END;
}
/* Print the sum */
printf("Sum of elements of x is %5" NAG_IFMT "\n", sumval);
END:
NAG_FREE(x);
return exit_status;
}