50 lines
1.1 KiB
C
50 lines
1.1 KiB
C
|
#include "timing.h"
|
||
|
|
#include <stdio.h>
|
||
|
|
|
||
|
|
#define INPUT_TYPE int
|
||
|
|
#define INPUT_SIZE 512
|
||
|
|
#define FUNCTION_NAME __ashldi3
|
||
|
|
|
||
|
|
#ifndef LIBNAME
|
||
|
|
#define LIBNAME UNKNOWN
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#define LIBSTRING LIBSTRINGX(LIBNAME)
|
||
|
|
#define LIBSTRINGX(a) LIBSTRINGXX(a)
|
||
|
|
#define LIBSTRINGXX(a) #a
|
||
|
|
|
||
|
|
int64_t FUNCTION_NAME(int64_t input, INPUT_TYPE count);
|
||
|
|
|
||
|
|
int main(int argc, char *argv[]) {
|
||
|
|
INPUT_TYPE input[INPUT_SIZE];
|
||
|
|
int i, j;
|
||
|
|
|
||
|
|
srand(42);
|
||
|
|
|
||
|
|
// Initialize the input array with data of various sizes.
|
||
|
|
for (i=0; i<INPUT_SIZE; ++i)
|
||
|
|
input[i] = rand() & 0x3f;
|
||
|
|
|
||
|
|
int64_t fixedInput = INT64_C(0x1234567890ABCDEF);
|
||
|
|
|
||
|
|
double bestTime = __builtin_inf();
|
||
|
|
void *dummyp;
|
||
|
|
for (j=0; j<1024; ++j) {
|
||
|
|
|
||
|
|
uint64_t startTime = mach_absolute_time();
|
||
|
|
for (i=0; i<INPUT_SIZE; ++i)
|
||
|
|
FUNCTION_NAME(fixedInput, input[i]);
|
||
|
|
uint64_t endTime = mach_absolute_time();
|
||
|
|
|
||
|
|
double thisTime = intervalInCycles(startTime, endTime);
|
||
|
|
bestTime = __builtin_fmin(thisTime, bestTime);
|
||
|
|
|
||
|
|
// Move the stack alignment between trials to eliminate (mostly) aliasing effects
|
||
|
|
dummyp = alloca(1);
|
||
|
|
}
|
||
|
|
|
||
|
|
printf("%16s: %f cycles.\n", LIBSTRING, bestTime / (double) INPUT_SIZE);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|