/* adder.c */

/* © Copyright 2003 Dauger Research, Inc. 
    
Our lawyers made us say this: 
DISCLAIMER: We provide the following on an "AS IS" basis. Use it at your own risk.  */

#include <stdio.h> /* standard I/O routines */
#include <stdlib.h> /* standard library routines, such as memory */
#include <math.h> /* math libraries */

/* A routine performing elemental work.
This can be replaced with a much larger routine. */
double kernelroutine(double input); 
double kernelroutine(double input) 
	{
	return (input+1)*(input+1); 
	}

/* HighestIndex specifies how highest index to sample */
#define HighestIndex			10000L

void computeloop(double *theSum, double **theArray); 
void computeloop(double *theSum, double **theArray)
	{
	/* local copies of the data to be output */
	double *myArray, mySum=0; 
	/* limit of the loop */
	long loopEnd=HighestIndex; 
	
	/* allocate an array to hold all the results */
	myArray=malloc(sizeof(double)*loopEnd); 
	
	if (myArray) {
		long index; 
		
		/* loop over indicies */
		for(index=0; index<loopEnd; index++) {
			/* call the kernel routine for each index, and save into the array */
			myArray[index]=kernelroutine(index); 
			/* sum as we go */
			mySum+=myArray[index]; 
			
			}
		
		}
	
	/* return the sum and the array */
	*theSum=mySum; 
	*theArray=myArray; 
	}
	
int main(int argc, char *argv[])
	{
	/* main copies of the sum and the array */
	double theSum, *theArray=NULL; 
	
	printf("Beginning computation...\n"); 
	
	computeloop(&theSum, &theArray); 
	
	if (theArray) {/* error checking */
		FILE *fp; 
		
		/* save the array into a data file */
		fp=fopen("output", "w"); 
		if (fp) {
			printf("writing array...\n"); 
			
			fwrite(theArray, sizeof(double), HighestIndex, fp); 
			
			fclose(fp); 
			}
		
		printf("the sum is %f\n", theSum); 
		
		/* clean up after myself */
		free(theArray); 
		
		}
	else 
		printf("memory allocation failure\n"); 
	
	return 0; 
	}