66 TYPE data_sum, ref_sum;
69 data_sum = data->
a[0];
71 for( i=1; i<
SIZE; i++ ) {
72 has_errors |= data->
a[i-1] > data->
a[i];
73 data_sum += data->
a[i];
76 has_errors |= (data_sum!=ref_sum);
void data_to_input(int fd, void *vdata)
int check_data(void *vdata, void *vref)
#define STAC(f_pfx, t, f_sfx)
void data_to_output(int fd, void *vdata)
int write_section_header(int fd)
void output_to_data(int fd, void *vdata)
void input_to_data(int fd, void *vdata)
char * find_section_start(char *s, int n)
void run_benchmark(void *vargs)
void ms_mergesort(TYPE a[SIZE])