#include "bench.h"

/*
 *	Prim Numbers
 *
 *	Check for all numbers from 2 to 2000 if they are prim numbers.
 *	The prim number test used here is simple and unoptimized.
 */

int checkprim_f1(int x)
{
	int y;
	for (y=2; y<x; y++) {
		if (x % y == 0) return 0;
	}
	return 1;
}

void test_checkprim()
{
	int c1, c2=0;

	timer_start(CONTEXT_LOCAL);

	for (c1=2; c2 < 2000; c1++)
		if ( checkprim_f1(c1) ) {
			result_push(CONTEXT_LOCAL, c1);
			c2++;
		}
	result_push(CONTEXT_LOCAL, c2);

	timer_stop(CONTEXT_LOCAL);
}