| /* |
| * Clock functions |
| */ |
| |
| #include <unistd.h> |
| #include <math.h> |
| #include <sys/time.h> |
| |
| #include "fio.h" |
| #include "smalloc.h" |
| |
| #include "hash.h" |
| |
| #ifdef ARCH_HAVE_CPU_CLOCK |
| static unsigned long cycles_per_usec; |
| static unsigned long last_cycles; |
| #endif |
| static struct timeval last_tv; |
| static int last_tv_valid; |
| |
| static struct timeval *fio_tv; |
| int fio_gtod_offload = 0; |
| int fio_gtod_cpu = -1; |
| |
| enum fio_cs fio_clock_source = CS_GTOD; |
| |
| #ifdef FIO_DEBUG_TIME |
| |
| #define HASH_BITS 8 |
| #define HASH_SIZE (1 << HASH_BITS) |
| |
| static struct flist_head hash[HASH_SIZE]; |
| static int gtod_inited; |
| |
| struct gtod_log { |
| struct flist_head list; |
| void *caller; |
| unsigned long calls; |
| }; |
| |
| static struct gtod_log *find_hash(void *caller) |
| { |
| unsigned long h = hash_ptr(caller, HASH_BITS); |
| struct flist_head *entry; |
| |
| flist_for_each(entry, &hash[h]) { |
| struct gtod_log *log = flist_entry(entry, struct gtod_log, |
| list); |
| |
| if (log->caller == caller) |
| return log; |
| } |
| |
| return NULL; |
| } |
| |
| static struct gtod_log *find_log(void *caller) |
| { |
| struct gtod_log *log = find_hash(caller); |
| |
| if (!log) { |
| unsigned long h; |
| |
| log = malloc(sizeof(*log)); |
| INIT_FLIST_HEAD(&log->list); |
| log->caller = caller; |
| log->calls = 0; |
| |
| h = hash_ptr(caller, HASH_BITS); |
| flist_add_tail(&log->list, &hash[h]); |
| } |
| |
| return log; |
| } |
| |
| static void gtod_log_caller(void *caller) |
| { |
| if (gtod_inited) { |
| struct gtod_log *log = find_log(caller); |
| |
| log->calls++; |
| } |
| } |
| |
| static void fio_exit fio_dump_gtod(void) |
| { |
| unsigned long total_calls = 0; |
| int i; |
| |
| for (i = 0; i < HASH_SIZE; i++) { |
| struct flist_head *entry; |
| struct gtod_log *log; |
| |
| flist_for_each(entry, &hash[i]) { |
| log = flist_entry(entry, struct gtod_log, list); |
| |
| printf("function %p, calls %lu\n", log->caller, |
| log->calls); |
| total_calls += log->calls; |
| } |
| } |
| |
| printf("Total %lu gettimeofday\n", total_calls); |
| } |
| |
| static void fio_init gtod_init(void) |
| { |
| int i; |
| |
| for (i = 0; i < HASH_SIZE; i++) |
| INIT_FLIST_HEAD(&hash[i]); |
| |
| gtod_inited = 1; |
| } |
| |
| #endif /* FIO_DEBUG_TIME */ |
| |
| #ifdef FIO_DEBUG_TIME |
| void fio_gettime(struct timeval *tp, void *caller) |
| #else |
| void fio_gettime(struct timeval *tp, void fio_unused *caller) |
| #endif |
| { |
| #ifdef FIO_DEBUG_TIME |
| if (!caller) |
| caller = __builtin_return_address(0); |
| |
| gtod_log_caller(caller); |
| #endif |
| if (fio_tv) { |
| memcpy(tp, fio_tv, sizeof(*tp)); |
| return; |
| } |
| |
| switch (fio_clock_source) { |
| case CS_GTOD: |
| gettimeofday(tp, NULL); |
| break; |
| case CS_CGETTIME: { |
| struct timespec ts; |
| |
| if (clock_gettime(CLOCK_REALTIME, &ts) < 0) { |
| log_err("fio: clock_gettime fails\n"); |
| assert(0); |
| } |
| |
| tp->tv_sec = ts.tv_sec; |
| tp->tv_usec = ts.tv_nsec / 1000; |
| break; |
| } |
| #ifdef ARCH_HAVE_CPU_CLOCK |
| case CS_CPUCLOCK: { |
| unsigned long long usecs, t; |
| |
| t = get_cpu_clock(); |
| if (t < last_cycles) { |
| dprint(FD_TIME, "CPU clock going back in time\n"); |
| t = last_cycles; |
| } |
| |
| usecs = t / cycles_per_usec; |
| tp->tv_sec = usecs / 1000000; |
| tp->tv_usec = usecs % 1000000; |
| last_cycles = t; |
| break; |
| } |
| #endif |
| default: |
| log_err("fio: invalid clock source %d\n", fio_clock_source); |
| break; |
| } |
| |
| /* |
| * If Linux is using the tsc clock on non-synced processors, |
| * sometimes time can appear to drift backwards. Fix that up. |
| */ |
| if (last_tv_valid) { |
| if (tp->tv_sec < last_tv.tv_sec) |
| tp->tv_sec = last_tv.tv_sec; |
| else if (last_tv.tv_sec == tp->tv_sec && |
| tp->tv_usec < last_tv.tv_usec) |
| tp->tv_usec = last_tv.tv_usec; |
| } |
| last_tv_valid = 1; |
| memcpy(&last_tv, tp, sizeof(*tp)); |
| } |
| |
| #ifdef ARCH_HAVE_CPU_CLOCK |
| static unsigned long get_cycles_per_usec(void) |
| { |
| struct timeval s, e; |
| unsigned long long c_s, c_e; |
| |
| gettimeofday(&s, NULL); |
| c_s = get_cpu_clock(); |
| do { |
| unsigned long long elapsed; |
| |
| gettimeofday(&e, NULL); |
| elapsed = utime_since(&s, &e); |
| if (elapsed >= 10) { |
| c_e = get_cpu_clock(); |
| break; |
| } |
| } while (1); |
| |
| return c_e - c_s; |
| } |
| |
| static void calibrate_cpu_clock(void) |
| { |
| double delta, mean, S; |
| unsigned long avg, cycles[10]; |
| int i, samples; |
| |
| cycles[0] = get_cycles_per_usec(); |
| S = delta = mean = 0.0; |
| for (i = 0; i < 10; i++) { |
| cycles[i] = get_cycles_per_usec(); |
| delta = cycles[i] - mean; |
| if (delta) { |
| mean += delta / (i + 1.0); |
| S += delta * (cycles[i] - mean); |
| } |
| } |
| |
| S = sqrt(S / (10 - 1.0)); |
| |
| samples = avg = 0; |
| for (i = 0; i < 10; i++) { |
| double this = cycles[i]; |
| |
| if ((max(this, mean) - min(this, mean)) > S) |
| continue; |
| samples++; |
| avg += this; |
| } |
| |
| S /= 10.0; |
| mean /= 10.0; |
| |
| for (i = 0; i < 10; i++) |
| dprint(FD_TIME, "cycles[%d]=%lu\n", i, cycles[i] / 10); |
| |
| avg /= (samples * 10); |
| dprint(FD_TIME, "avg: %lu\n", avg); |
| dprint(FD_TIME, "mean=%f, S=%f\n", mean, S); |
| |
| cycles_per_usec = avg; |
| |
| } |
| #else |
| static void calibrate_cpu_clock(void) |
| { |
| } |
| #endif |
| |
| void fio_clock_init(void) |
| { |
| last_tv_valid = 0; |
| calibrate_cpu_clock(); |
| } |
| |
| void fio_gtod_init(void) |
| { |
| fio_tv = smalloc(sizeof(struct timeval)); |
| assert(fio_tv); |
| } |
| |
| void fio_gtod_update(void) |
| { |
| gettimeofday(fio_tv, NULL); |
| } |