2009-11-17 23:20:09 +08:00
|
|
|
/*
|
|
|
|
* mem-memcpy.c
|
|
|
|
*
|
|
|
|
* memcpy: Simple memory copy in various ways
|
|
|
|
*
|
|
|
|
* Written by Hitoshi Mitake <mitake@dcl.info.waseda.ac.jp>
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "../perf.h"
|
|
|
|
#include "../util/util.h"
|
|
|
|
#include "../util/parse-options.h"
|
|
|
|
#include "../util/header.h"
|
2014-07-01 04:28:47 +08:00
|
|
|
#include "../util/cloexec.h"
|
2009-11-17 23:20:09 +08:00
|
|
|
#include "bench.h"
|
2010-11-25 15:04:52 +08:00
|
|
|
#include "mem-memcpy-arch.h"
|
2009-11-17 23:20:09 +08:00
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
#define K 1024
|
|
|
|
|
2009-11-20 11:37:17 +08:00
|
|
|
static const char *length_str = "1MB";
|
|
|
|
static const char *routine = "default";
|
2012-01-18 21:29:59 +08:00
|
|
|
static int iterations = 1;
|
2012-07-02 21:46:17 +08:00
|
|
|
static bool use_cycle;
|
|
|
|
static int cycle_fd;
|
2010-11-25 15:04:52 +08:00
|
|
|
static bool only_prefault;
|
|
|
|
static bool no_prefault;
|
2009-11-17 23:20:09 +08:00
|
|
|
|
|
|
|
static const struct option options[] = {
|
|
|
|
OPT_STRING('l', "length", &length_str, "1MB",
|
|
|
|
"Specify length of memory to copy. "
|
2012-06-20 14:08:06 +08:00
|
|
|
"Available units: B, KB, MB, GB and TB (upper and lower)"),
|
2009-11-17 23:20:09 +08:00
|
|
|
OPT_STRING('r', "routine", &routine, "default",
|
|
|
|
"Specify routine to copy"),
|
2012-01-18 21:29:59 +08:00
|
|
|
OPT_INTEGER('i', "iterations", &iterations,
|
|
|
|
"repeat memcpy() invocation this number of times"),
|
2012-07-02 21:46:17 +08:00
|
|
|
OPT_BOOLEAN('c', "cycle", &use_cycle,
|
2012-06-20 14:08:06 +08:00
|
|
|
"Use cycles event instead of gettimeofday() for measuring"),
|
2010-11-25 15:04:52 +08:00
|
|
|
OPT_BOOLEAN('o', "only-prefault", &only_prefault,
|
|
|
|
"Show only the result with page faults before memcpy()"),
|
|
|
|
OPT_BOOLEAN('n', "no-prefault", &no_prefault,
|
|
|
|
"Show only the result without page faults before memcpy()"),
|
2009-11-17 23:20:09 +08:00
|
|
|
OPT_END()
|
|
|
|
};
|
|
|
|
|
2010-11-25 15:04:52 +08:00
|
|
|
typedef void *(*memcpy_t)(void *, const void *, size_t);
|
|
|
|
|
2009-11-17 23:20:09 +08:00
|
|
|
struct routine {
|
|
|
|
const char *name;
|
|
|
|
const char *desc;
|
2010-11-25 15:04:52 +08:00
|
|
|
memcpy_t fn;
|
2009-11-17 23:20:09 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
struct routine routines[] = {
|
|
|
|
{ "default",
|
|
|
|
"Default memcpy() provided by glibc",
|
|
|
|
memcpy },
|
2013-09-30 18:07:11 +08:00
|
|
|
#ifdef HAVE_ARCH_X86_64_SUPPORT
|
2010-11-25 15:04:52 +08:00
|
|
|
|
|
|
|
#define MEMCPY_FN(fn, name, desc) { name, desc, fn },
|
|
|
|
#include "mem-memcpy-x86-64-asm-def.h"
|
|
|
|
#undef MEMCPY_FN
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2009-11-17 23:20:09 +08:00
|
|
|
{ NULL,
|
|
|
|
NULL,
|
|
|
|
NULL }
|
|
|
|
};
|
|
|
|
|
|
|
|
static const char * const bench_mem_memcpy_usage[] = {
|
|
|
|
"perf bench mem memcpy <options>",
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
static struct perf_event_attr cycle_attr = {
|
2009-11-20 11:37:17 +08:00
|
|
|
.type = PERF_TYPE_HARDWARE,
|
|
|
|
.config = PERF_COUNT_HW_CPU_CYCLES
|
2009-11-17 23:20:09 +08:00
|
|
|
};
|
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
static void init_cycle(void)
|
2009-11-17 23:20:09 +08:00
|
|
|
{
|
2014-07-01 04:28:47 +08:00
|
|
|
cycle_fd = sys_perf_event_open(&cycle_attr, getpid(), -1, -1,
|
|
|
|
perf_event_open_cloexec_flag());
|
2009-11-20 11:37:17 +08:00
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
if (cycle_fd < 0 && errno == ENOSYS)
|
2009-11-20 11:37:17 +08:00
|
|
|
die("No CONFIG_PERF_EVENTS=y kernel support configured?\n");
|
|
|
|
else
|
2012-07-02 21:46:17 +08:00
|
|
|
BUG_ON(cycle_fd < 0);
|
2009-11-17 23:20:09 +08:00
|
|
|
}
|
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
static u64 get_cycle(void)
|
2009-11-17 23:20:09 +08:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
u64 clk;
|
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
ret = read(cycle_fd, &clk, sizeof(u64));
|
2009-11-17 23:20:09 +08:00
|
|
|
BUG_ON(ret != sizeof(u64));
|
|
|
|
|
|
|
|
return clk;
|
|
|
|
}
|
|
|
|
|
|
|
|
static double timeval2double(struct timeval *ts)
|
|
|
|
{
|
|
|
|
return (double)ts->tv_sec +
|
|
|
|
(double)ts->tv_usec / (double)1000000;
|
|
|
|
}
|
|
|
|
|
2010-11-25 15:04:52 +08:00
|
|
|
static void alloc_mem(void **dst, void **src, size_t length)
|
|
|
|
{
|
|
|
|
*dst = zalloc(length);
|
2013-06-06 19:35:03 +08:00
|
|
|
if (!*dst)
|
2010-11-25 15:04:52 +08:00
|
|
|
die("memory allocation failed - maybe length is too large?\n");
|
|
|
|
|
|
|
|
*src = zalloc(length);
|
2013-06-06 19:35:03 +08:00
|
|
|
if (!*src)
|
2010-11-25 15:04:52 +08:00
|
|
|
die("memory allocation failed - maybe length is too large?\n");
|
2013-07-19 06:33:46 +08:00
|
|
|
/* Make sure to always replace the zero pages even if MMAP_THRESH is crossed */
|
|
|
|
memset(*src, 0, length);
|
2010-11-25 15:04:52 +08:00
|
|
|
}
|
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
static u64 do_memcpy_cycle(memcpy_t fn, size_t len, bool prefault)
|
2010-11-25 15:04:52 +08:00
|
|
|
{
|
2012-07-02 21:46:17 +08:00
|
|
|
u64 cycle_start = 0ULL, cycle_end = 0ULL;
|
2010-11-25 15:04:52 +08:00
|
|
|
void *src = NULL, *dst = NULL;
|
2012-01-18 21:29:59 +08:00
|
|
|
int i;
|
2010-11-25 15:04:52 +08:00
|
|
|
|
|
|
|
alloc_mem(&src, &dst, len);
|
|
|
|
|
|
|
|
if (prefault)
|
|
|
|
fn(dst, src, len);
|
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
cycle_start = get_cycle();
|
2012-01-18 21:29:59 +08:00
|
|
|
for (i = 0; i < iterations; ++i)
|
|
|
|
fn(dst, src, len);
|
2012-07-02 21:46:17 +08:00
|
|
|
cycle_end = get_cycle();
|
2010-11-25 15:04:52 +08:00
|
|
|
|
|
|
|
free(src);
|
|
|
|
free(dst);
|
2012-07-02 21:46:17 +08:00
|
|
|
return cycle_end - cycle_start;
|
2010-11-25 15:04:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static double do_memcpy_gettimeofday(memcpy_t fn, size_t len, bool prefault)
|
|
|
|
{
|
|
|
|
struct timeval tv_start, tv_end, tv_diff;
|
|
|
|
void *src = NULL, *dst = NULL;
|
2012-01-18 21:29:59 +08:00
|
|
|
int i;
|
2010-11-25 15:04:52 +08:00
|
|
|
|
|
|
|
alloc_mem(&src, &dst, len);
|
|
|
|
|
|
|
|
if (prefault)
|
|
|
|
fn(dst, src, len);
|
|
|
|
|
|
|
|
BUG_ON(gettimeofday(&tv_start, NULL));
|
2012-01-18 21:29:59 +08:00
|
|
|
for (i = 0; i < iterations; ++i)
|
|
|
|
fn(dst, src, len);
|
2010-11-25 15:04:52 +08:00
|
|
|
BUG_ON(gettimeofday(&tv_end, NULL));
|
|
|
|
|
|
|
|
timersub(&tv_end, &tv_start, &tv_diff);
|
|
|
|
|
|
|
|
free(src);
|
|
|
|
free(dst);
|
|
|
|
return (double)((double)len / timeval2double(&tv_diff));
|
|
|
|
}
|
|
|
|
|
|
|
|
#define pf (no_prefault ? 0 : 1)
|
|
|
|
|
|
|
|
#define print_bps(x) do { \
|
|
|
|
if (x < K) \
|
|
|
|
printf(" %14lf B/Sec", x); \
|
|
|
|
else if (x < K * K) \
|
|
|
|
printf(" %14lfd KB/Sec", x / K); \
|
|
|
|
else if (x < K * K * K) \
|
|
|
|
printf(" %14lf MB/Sec", x / K / K); \
|
|
|
|
else \
|
|
|
|
printf(" %14lf GB/Sec", x / K / K / K); \
|
|
|
|
} while (0)
|
|
|
|
|
2009-11-17 23:20:09 +08:00
|
|
|
int bench_mem_memcpy(int argc, const char **argv,
|
2012-09-11 06:15:03 +08:00
|
|
|
const char *prefix __maybe_unused)
|
2009-11-17 23:20:09 +08:00
|
|
|
{
|
|
|
|
int i;
|
2010-11-25 15:04:52 +08:00
|
|
|
size_t len;
|
|
|
|
double result_bps[2];
|
2012-07-02 21:46:17 +08:00
|
|
|
u64 result_cycle[2];
|
2009-11-17 23:20:09 +08:00
|
|
|
|
|
|
|
argc = parse_options(argc, argv, options,
|
|
|
|
bench_mem_memcpy_usage, 0);
|
|
|
|
|
2014-06-17 02:14:25 +08:00
|
|
|
if (no_prefault && only_prefault) {
|
|
|
|
fprintf(stderr, "Invalid options: -o and -n are mutually exclusive\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
if (use_cycle)
|
|
|
|
init_cycle();
|
2010-11-25 15:04:52 +08:00
|
|
|
|
|
|
|
len = (size_t)perf_atoll((char *)length_str);
|
2009-11-20 11:37:17 +08:00
|
|
|
|
2012-07-02 21:46:17 +08:00
|
|
|
result_cycle[0] = result_cycle[1] = 0ULL;
|
2010-11-25 15:04:52 +08:00
|
|
|
result_bps[0] = result_bps[1] = 0.0;
|
|
|
|
|
|
|
|
if ((s64)len <= 0) {
|
2009-11-17 23:20:09 +08:00
|
|
|
fprintf(stderr, "Invalid length:%s\n", length_str);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2010-11-25 15:04:52 +08:00
|
|
|
/* same to without specifying either of prefault and no-prefault */
|
|
|
|
if (only_prefault && no_prefault)
|
|
|
|
only_prefault = no_prefault = false;
|
|
|
|
|
2009-11-17 23:20:09 +08:00
|
|
|
for (i = 0; routines[i].name; i++) {
|
|
|
|
if (!strcmp(routines[i].name, routine))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!routines[i].name) {
|
|
|
|
printf("Unknown routine:%s\n", routine);
|
|
|
|
printf("Available routines...\n");
|
|
|
|
for (i = 0; routines[i].name; i++) {
|
|
|
|
printf("\t%s ... %s\n",
|
|
|
|
routines[i].name, routines[i].desc);
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2010-11-25 15:04:52 +08:00
|
|
|
if (bench_format == BENCH_FORMAT_DEFAULT)
|
|
|
|
printf("# Copying %s Bytes ...\n\n", length_str);
|
2009-11-17 23:20:09 +08:00
|
|
|
|
2010-11-25 15:04:52 +08:00
|
|
|
if (!only_prefault && !no_prefault) {
|
|
|
|
/* show both of results */
|
2012-07-02 21:46:17 +08:00
|
|
|
if (use_cycle) {
|
|
|
|
result_cycle[0] =
|
|
|
|
do_memcpy_cycle(routines[i].fn, len, false);
|
|
|
|
result_cycle[1] =
|
|
|
|
do_memcpy_cycle(routines[i].fn, len, true);
|
2010-11-25 15:04:52 +08:00
|
|
|
} else {
|
|
|
|
result_bps[0] =
|
|
|
|
do_memcpy_gettimeofday(routines[i].fn,
|
|
|
|
len, false);
|
|
|
|
result_bps[1] =
|
|
|
|
do_memcpy_gettimeofday(routines[i].fn,
|
|
|
|
len, true);
|
|
|
|
}
|
2009-11-17 23:20:09 +08:00
|
|
|
} else {
|
2012-07-02 21:46:17 +08:00
|
|
|
if (use_cycle) {
|
|
|
|
result_cycle[pf] =
|
|
|
|
do_memcpy_cycle(routines[i].fn,
|
2010-11-25 15:04:52 +08:00
|
|
|
len, only_prefault);
|
|
|
|
} else {
|
|
|
|
result_bps[pf] =
|
|
|
|
do_memcpy_gettimeofday(routines[i].fn,
|
|
|
|
len, only_prefault);
|
|
|
|
}
|
2009-11-17 23:20:09 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
switch (bench_format) {
|
|
|
|
case BENCH_FORMAT_DEFAULT:
|
2010-11-25 15:04:52 +08:00
|
|
|
if (!only_prefault && !no_prefault) {
|
2012-07-02 21:46:17 +08:00
|
|
|
if (use_cycle) {
|
|
|
|
printf(" %14lf Cycle/Byte\n",
|
|
|
|
(double)result_cycle[0]
|
2010-11-25 15:04:52 +08:00
|
|
|
/ (double)len);
|
2012-07-02 21:46:17 +08:00
|
|
|
printf(" %14lf Cycle/Byte (with prefault)\n",
|
|
|
|
(double)result_cycle[1]
|
2010-11-25 15:04:52 +08:00
|
|
|
/ (double)len);
|
|
|
|
} else {
|
|
|
|
print_bps(result_bps[0]);
|
|
|
|
printf("\n");
|
|
|
|
print_bps(result_bps[1]);
|
|
|
|
printf(" (with prefault)\n");
|
2009-11-17 23:20:09 +08:00
|
|
|
}
|
2010-11-25 15:04:52 +08:00
|
|
|
} else {
|
2012-07-02 21:46:17 +08:00
|
|
|
if (use_cycle) {
|
|
|
|
printf(" %14lf Cycle/Byte",
|
|
|
|
(double)result_cycle[pf]
|
2010-11-25 15:04:52 +08:00
|
|
|
/ (double)len);
|
|
|
|
} else
|
|
|
|
print_bps(result_bps[pf]);
|
|
|
|
|
|
|
|
printf("%s\n", only_prefault ? " (with prefault)" : "");
|
2009-11-17 23:20:09 +08:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case BENCH_FORMAT_SIMPLE:
|
2010-11-25 15:04:52 +08:00
|
|
|
if (!only_prefault && !no_prefault) {
|
2012-07-02 21:46:17 +08:00
|
|
|
if (use_cycle) {
|
2010-11-25 15:04:52 +08:00
|
|
|
printf("%lf %lf\n",
|
2012-07-02 21:46:17 +08:00
|
|
|
(double)result_cycle[0] / (double)len,
|
|
|
|
(double)result_cycle[1] / (double)len);
|
2010-11-25 15:04:52 +08:00
|
|
|
} else {
|
|
|
|
printf("%lf %lf\n",
|
|
|
|
result_bps[0], result_bps[1]);
|
|
|
|
}
|
|
|
|
} else {
|
2012-07-02 21:46:17 +08:00
|
|
|
if (use_cycle) {
|
|
|
|
printf("%lf\n", (double)result_cycle[pf]
|
2010-11-25 15:04:52 +08:00
|
|
|
/ (double)len);
|
|
|
|
} else
|
|
|
|
printf("%lf\n", result_bps[pf]);
|
|
|
|
}
|
2009-11-17 23:20:09 +08:00
|
|
|
break;
|
|
|
|
default:
|
2009-11-20 11:37:17 +08:00
|
|
|
/* reaching this means there's some disaster: */
|
|
|
|
die("unknown format: %d\n", bench_format);
|
2009-11-17 23:20:09 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|