5 unsigned int sse8_16bit_c( const short * b1,
7 const unsigned int stride)
12 for (i=0; i<ITERS; i++) {
13 sse += (b1[0] - b2[0])*(b1[0] - b2[0]);
14 sse += (b1[1] - b2[1])*(b1[1] - b2[1]);
15 sse += (b1[2] - b2[2])*(b1[2] - b2[2]);
16 sse += (b1[3] - b2[3])*(b1[3] - b2[3]);
17 sse += (b1[4] - b2[4])*(b1[4] - b2[4]);
18 sse += (b1[5] - b2[5])*(b1[5] - b2[5]);
19 sse += (b1[6] - b2[6])*(b1[6] - b2[6]);
20 sse += (b1[7] - b2[7])*(b1[7] - b2[7]);
22 b1 = (const short*)((char*)b1+stride);
23 b2 = (const short*)((char*)b2+stride);
31 #define MAX (ITERS * STRIDE)
33 int main(int argc, char** argv){
41 numofruns = atoi(argv[1]);
44 for (i=0;i < numofruns; i++){
45 // Reset cache. Alles andere ist unrealistisch.
46 for(ii = 0; ii < MAX; ++ii) {
48 ref[ii]=(ii+i+3)&0xff;
50 sum = sse8_16bit_c(cur, ref, STRIDE);
52 printf("sum[%i] = %i\n",i, sum);