3 unsigned int sse8_16bit_c( const int * b1,
5 const unsigned int stride)
11 sse += (b1[0] - b2[0])*(b1[0] - b2[0]);
12 sse += (b1[1] - b2[1])*(b1[1] - b2[1]);
13 sse += (b1[2] - b2[2])*(b1[2] - b2[2]);
14 sse += (b1[3] - b2[3])*(b1[3] - b2[3]);
15 sse += (b1[4] - b2[4])*(b1[4] - b2[4]);
16 sse += (b1[5] - b2[5])*(b1[5] - b2[5]);
17 sse += (b1[6] - b2[6])*(b1[6] - b2[6]);
18 sse += (b1[7] - b2[7])*(b1[7] - b2[7]);
20 b1 = (const int*)((char*)b1+stride);
21 b2 = (const int*)((char*)b2+stride);
35 for (i=0;i < numofruns; i++){
36 // Reset cache. Alles andere ist unrealistisch.
37 for(ii = 0; ii<MAX;ii++){
39 ref[ii]=(ii+i+3)&0xff;
41 sum = sse8_16bit_c(cur, ref, 32);
42 printf("sum[%i] = %i\n",i, sum);