int main(int argc, char *argv[]) {
std::vector<Record> records;
float *recordDistances;
//LatLong locations[REC_WINDOW];
std::vector<LatLong> locations;
int i;
// args
char filename[100];
int resultsCount=10,quiet=0,timing=0,platform=-1,device=-1;
float lat=0.0,lng=0.0;
// parse command line
if (parseCommandline(argc, argv, filename,&resultsCount,&lat,&lng,
&quiet, &timing, &platform, &device)) {
printUsage();
return 0;
}
int numRecords = loadData(filename,records,locations);
//for(i=0;i<numRecords;i++)
// printf("%s, %f, %f\n",(records[i].recString),locations[i].lat,locations[i].lng);
if (!quiet) {
printf("Number of records: %d\n",numRecords);
printf("Finding the %d closest neighbors.\n",resultsCount);
}
if (resultsCount > numRecords) resultsCount = numRecords;
context = cl_init_context(platform,device,quiet);
recordDistances = OpenClFindNearestNeighbors(context,numRecords,locations,lat,lng,timing);
// find the resultsCount least distances
findLowest(records,recordDistances,numRecords,resultsCount);
// print out results
if (!quiet)
for(i=0;i<resultsCount;i++) {
printf("%s --> Distance=%f\n",records[i].recString,records[i].distance);
}
free(recordDistances);
return 0;
}
int main(int argc, char *argv[]) {
printf("WG size of kernel 1 = %d, WG size of kernel 2= %d X %d\n", BLOCK_SIZE_0, BLOCK_SIZE_1_X, BLOCK_SIZE_1_Y);
float *a=NULL, *b=NULL, *finalVec=NULL;
float *m=NULL;
int size = -1;
FILE *fp;
// args
char filename[200];
int quiet=1,timing=0,platform=-1,device=-1;
// parse command line
if (parseCommandline(argc, argv, filename,
&quiet, &timing, &platform, &device, &size)) {
printUsage();
return 0;
}
context = cl_init_context(platform,device,quiet);
if(size < 1)
{
fp = fopen(filename, "r");
fscanf(fp, "%d", &size);
a = (float *) malloc(size * size * sizeof(float));
InitMat(fp,size, a, size, size);
b = (float *) malloc(size * sizeof(float));
InitAry(fp, b, size);
fclose(fp);
}
else
{
printf("create input internally before create, size = %d \n", size);
a = (float *) malloc(size * size * sizeof(float));
create_matrix(a, size);
b = (float *) malloc(size * sizeof(float));
for (int i =0; i< size; i++)
b[i]=1.0;
}
if (!quiet) {
printf("The input matrix a is:\n");
PrintMat(a, size, size, size);
printf("The input array b is:\n");
PrintAry(b, size);
}
// create the solution matrix
m = (float *) malloc(size * size * sizeof(float));
// create a new vector to hold the final answer
finalVec = (float *) malloc(size * sizeof(float));
InitPerRun(size,m);
//begin timing
// printf("The result of array b is before run: \n");
// PrintAry(b, size);
// run kernels
ForwardSub(context,a,b,m,size,timing);
// printf("The result of array b is after run: \n");
// PrintAry(b, size);
DIVIDEND_CL_WRAP(clFinish)(command_queue);
//end timing
if (!quiet) {
printf("The result of matrix m is: \n");
PrintMat(m, size, size, size);
printf("The result of matrix a is: \n");
PrintMat(a, size, size, size);
printf("The result of array b is: \n");
PrintAry(b, size);
BackSub(a,b,finalVec,size);
printf("The final solution is: \n");
PrintAry(finalVec,size);
}
free(m);
free(a);
free(b);
free(finalVec);
cl_cleanup();
//OpenClGaussianElimination(context,timing);
return 0;
}
