2011-08-31 15:50:21 +00:00
|
|
|
#include <config.h>
|
|
|
|
#include <stasis/common.h>
|
|
|
|
#include <stasis/util/time.h>
|
2011-08-31 19:25:09 +00:00
|
|
|
#include <stasis/util/random.h>
|
2011-08-31 15:50:21 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <math.h>
|
|
|
|
#include <assert.h>
|
|
|
|
|
|
|
|
|
|
|
|
void * buf;
|
|
|
|
static void my_pread_help(int fd, long long off) {
|
|
|
|
int err = pread(fd, buf, 512, off);
|
|
|
|
if(err == -1) {
|
|
|
|
perror("Could not read from file");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-12-05 02:17:23 +00:00
|
|
|
static void drop_buffers(void) {
|
2011-08-31 15:50:21 +00:00
|
|
|
int fd = open("/proc/sys/vm/drop_caches", O_TRUNC|O_WRONLY);
|
|
|
|
if(fd == -1) { perror("Couldn't drop page cache"); abort(); }
|
|
|
|
char * str = "1\n";
|
|
|
|
int err = write(fd, str, 3);
|
|
|
|
if(err == -1) {
|
|
|
|
perror("write to drop page cache failed");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
err = close(fd);
|
|
|
|
if(err == -1) {
|
|
|
|
perror("could not close file");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#define my_pread(start_off, off) my_pread_help(fd, start_off + off)
|
|
|
|
|
|
|
|
int main(int argc, char * argv[]) {
|
|
|
|
if(argc != 7) {
|
|
|
|
printf("Usage: %s filename steps iterations start_off length random_mode\n", argv[0]);
|
|
|
|
abort();
|
|
|
|
}
|
merge in changes from svn[r1572..r1601]
------------------------------------------------------------------------
r1601 | sears.russell@gmail.com | 2012-03-20 18:43:00 -0400 (Tue, 20
Mar 2012) | 1 line
commit bLSM bloom filter to stasis/util, which is where it really
belongs
------------------------------------------------------------------------
r1600 | sears.russell@gmail.com | 2012-03-04 01:58:38 -0500 (Sun, 04
Mar 2012) | 1 line
fix memory leak in skiplist unit test (now it is valgrind clean)
------------------------------------------------------------------------
r1599 | sears.russell@gmail.com | 2012-03-04 01:58:05 -0500 (Sun, 04
Mar 2012) | 1 line
fix typo in finalize type
------------------------------------------------------------------------
r1598 | sears.russell@gmail.com | 2012-03-04 00:59:59 -0500 (Sun, 04
Mar 2012) | 1 line
add comparator and finalizer parameters to skiplist constructor
------------------------------------------------------------------------
r1597 | sears.russell@gmail.com | 2012-03-03 18:23:16 -0500 (Sat, 03
Mar 2012) | 1 line
bugfixes for skiplist
------------------------------------------------------------------------
r1596 | sears.russell@gmail.com | 2012-03-02 15:05:07 -0500 (Fri, 02
Mar 2012) | 1 line
updated concurrentSkipList. Seeing strange crashes
------------------------------------------------------------------------
r1595 | sears.russell@gmail.com | 2012-03-01 16:51:59 -0500 (Thu, 01
Mar 2012) | 1 line
add progress reports
------------------------------------------------------------------------
r1594 | sears.russell@gmail.com | 2012-02-28 13:17:05 -0500 (Tue, 28
Feb 2012) | 1 line
experimental support for automatic logfile preallocation
------------------------------------------------------------------------
r1593 | sears.russell@gmail.com | 2012-02-28 12:10:01 -0500 (Tue, 28
Feb 2012) | 1 line
add histogram reporting to rawIOPS benchmark
------------------------------------------------------------------------
r1592 | sears.russell@gmail.com | 2012-02-24 16:31:36 -0500 (Fri, 24
Feb 2012) | 1 line
userspace raid 0 implementation
------------------------------------------------------------------------
r1591 | sears.russell@gmail.com | 2012-02-12 01:47:25 -0500 (Sun, 12
Feb 2012) | 1 line
add skiplist unit test, fix compile warnings
------------------------------------------------------------------------
r1590 | sears.russell@gmail.com | 2012-02-12 00:52:52 -0500 (Sun, 12
Feb 2012) | 1 line
fix compile error
------------------------------------------------------------------------
r1589 | sears.russell@gmail.com | 2012-02-12 00:50:21 -0500 (Sun, 12
Feb 2012) | 1 line
fix some bugs in hazard.h surrounding thread list management and
overruns of R under high contention
------------------------------------------------------------------------
r1588 | sears.russell@gmail.com | 2012-02-11 14:23:10 -0500 (Sat, 11
Feb 2012) | 1 line
add hazard pointer for get_lock. It was implicitly blowing away the
hazard pointer protecting y in the caller
------------------------------------------------------------------------
r1587 | sears.russell@gmail.com | 2012-02-10 18:51:25 -0500 (Fri, 10
Feb 2012) | 1 line
fix null pointer bug
------------------------------------------------------------------------
r1586 | sears.russell@gmail.com | 2012-02-10 18:03:39 -0500 (Fri, 10
Feb 2012) | 1 line
add simple refcounting scheme to concurrentSkipList. This solves the
problem where a deleted node points to another deleted node, and we
only have a hazard pointer for the first node.
------------------------------------------------------------------------
r1585 | sears.russell@gmail.com | 2012-02-10 14:19:14 -0500 (Fri, 10
Feb 2012) | 1 line
add hazard pointers for update using the smallest free slot first. The
old method left a race condition, since hazard_scan stops at the first
null pointer.
------------------------------------------------------------------------
r1584 | sears.russell@gmail.com | 2012-02-10 02:45:30 -0500 (Fri, 10
Feb 2012) | 1 line
add hazard pointers for update array
------------------------------------------------------------------------
r1583 | sears.russell@gmail.com | 2012-02-10 00:04:50 -0500 (Fri, 10
Feb 2012) | 1 line
skiplist update: concurrent, but broken
------------------------------------------------------------------------
r1582 | sears.russell@gmail.com | 2012-02-09 17:44:27 -0500 (Thu, 09
Feb 2012) | 1 line
skip list implementation. Not concurrent yet.
------------------------------------------------------------------------
r1581 | sears.russell@gmail.com | 2012-02-08 13:33:29 -0500 (Wed, 08
Feb 2012) | 1 line
Commit of a bunch of new, unused code: KISS random number generator,
Hazard Pointers, SUX latches (untested) and bit twiddling for
concurrent b-tree
------------------------------------------------------------------------
r1580 | sears.russell@gmail.com | 2012-01-17 19:17:37 -0500 (Tue, 17
Jan 2012) | 1 line
fix typo
------------------------------------------------------------------------
r1579 | sears.russell@gmail.com | 2012-01-11 18:33:31 -0500 (Wed, 11
Jan 2012) | 1 line
static build fixes for linux. hopefully these do not break macos...
------------------------------------------------------------------------
r1578 | sears.russell@gmail.com | 2012-01-09 19:13:34 -0500 (Mon, 09
Jan 2012) | 1 line
fix cmake under linux
------------------------------------------------------------------------
r1577 | sears.russell@gmail.com | 2012-01-09 18:37:15 -0500 (Mon, 09
Jan 2012) | 1 line
fix linux static binary compilation bugs
------------------------------------------------------------------------
r1576 | sears.russell | 2012-01-09 18:00:08 -0500 (Mon, 09 Jan 2012) |
1 line
port to macos x
------------------------------------------------------------------------
r1575 | sears.russell | 2012-01-09 17:39:43 -0500 (Mon, 09 Jan 2012) |
1 line
add missing _ from sync call name
------------------------------------------------------------------------
r1574 | sears.russell@gmail.com | 2012-01-09 14:26:31 -0500 (Mon, 09
Jan 2012) | 1 line
add -rt flag to static builds
------------------------------------------------------------------------
r1573 | sears.russell@gmail.com | 2011-12-20 23:38:29 -0500 (Tue, 20
Dec 2011) | 1 line
Simple makefile geared toward building libstasis.so and libstasis.a
(and nothing else)
------------------------------------------------------------------------
r1572 | sears.russell@gmail.com | 2011-12-20 22:37:54 -0500 (Tue, 20
Dec 2011) | 1 line
add some missing #include<config.h> lines
2012-04-21 16:52:31 +00:00
|
|
|
#ifdef HAVE_POSIX_MEMALIGN
|
2011-08-31 15:50:21 +00:00
|
|
|
posix_memalign(&buf, 512, 512);
|
merge in changes from svn[r1572..r1601]
------------------------------------------------------------------------
r1601 | sears.russell@gmail.com | 2012-03-20 18:43:00 -0400 (Tue, 20
Mar 2012) | 1 line
commit bLSM bloom filter to stasis/util, which is where it really
belongs
------------------------------------------------------------------------
r1600 | sears.russell@gmail.com | 2012-03-04 01:58:38 -0500 (Sun, 04
Mar 2012) | 1 line
fix memory leak in skiplist unit test (now it is valgrind clean)
------------------------------------------------------------------------
r1599 | sears.russell@gmail.com | 2012-03-04 01:58:05 -0500 (Sun, 04
Mar 2012) | 1 line
fix typo in finalize type
------------------------------------------------------------------------
r1598 | sears.russell@gmail.com | 2012-03-04 00:59:59 -0500 (Sun, 04
Mar 2012) | 1 line
add comparator and finalizer parameters to skiplist constructor
------------------------------------------------------------------------
r1597 | sears.russell@gmail.com | 2012-03-03 18:23:16 -0500 (Sat, 03
Mar 2012) | 1 line
bugfixes for skiplist
------------------------------------------------------------------------
r1596 | sears.russell@gmail.com | 2012-03-02 15:05:07 -0500 (Fri, 02
Mar 2012) | 1 line
updated concurrentSkipList. Seeing strange crashes
------------------------------------------------------------------------
r1595 | sears.russell@gmail.com | 2012-03-01 16:51:59 -0500 (Thu, 01
Mar 2012) | 1 line
add progress reports
------------------------------------------------------------------------
r1594 | sears.russell@gmail.com | 2012-02-28 13:17:05 -0500 (Tue, 28
Feb 2012) | 1 line
experimental support for automatic logfile preallocation
------------------------------------------------------------------------
r1593 | sears.russell@gmail.com | 2012-02-28 12:10:01 -0500 (Tue, 28
Feb 2012) | 1 line
add histogram reporting to rawIOPS benchmark
------------------------------------------------------------------------
r1592 | sears.russell@gmail.com | 2012-02-24 16:31:36 -0500 (Fri, 24
Feb 2012) | 1 line
userspace raid 0 implementation
------------------------------------------------------------------------
r1591 | sears.russell@gmail.com | 2012-02-12 01:47:25 -0500 (Sun, 12
Feb 2012) | 1 line
add skiplist unit test, fix compile warnings
------------------------------------------------------------------------
r1590 | sears.russell@gmail.com | 2012-02-12 00:52:52 -0500 (Sun, 12
Feb 2012) | 1 line
fix compile error
------------------------------------------------------------------------
r1589 | sears.russell@gmail.com | 2012-02-12 00:50:21 -0500 (Sun, 12
Feb 2012) | 1 line
fix some bugs in hazard.h surrounding thread list management and
overruns of R under high contention
------------------------------------------------------------------------
r1588 | sears.russell@gmail.com | 2012-02-11 14:23:10 -0500 (Sat, 11
Feb 2012) | 1 line
add hazard pointer for get_lock. It was implicitly blowing away the
hazard pointer protecting y in the caller
------------------------------------------------------------------------
r1587 | sears.russell@gmail.com | 2012-02-10 18:51:25 -0500 (Fri, 10
Feb 2012) | 1 line
fix null pointer bug
------------------------------------------------------------------------
r1586 | sears.russell@gmail.com | 2012-02-10 18:03:39 -0500 (Fri, 10
Feb 2012) | 1 line
add simple refcounting scheme to concurrentSkipList. This solves the
problem where a deleted node points to another deleted node, and we
only have a hazard pointer for the first node.
------------------------------------------------------------------------
r1585 | sears.russell@gmail.com | 2012-02-10 14:19:14 -0500 (Fri, 10
Feb 2012) | 1 line
add hazard pointers for update using the smallest free slot first. The
old method left a race condition, since hazard_scan stops at the first
null pointer.
------------------------------------------------------------------------
r1584 | sears.russell@gmail.com | 2012-02-10 02:45:30 -0500 (Fri, 10
Feb 2012) | 1 line
add hazard pointers for update array
------------------------------------------------------------------------
r1583 | sears.russell@gmail.com | 2012-02-10 00:04:50 -0500 (Fri, 10
Feb 2012) | 1 line
skiplist update: concurrent, but broken
------------------------------------------------------------------------
r1582 | sears.russell@gmail.com | 2012-02-09 17:44:27 -0500 (Thu, 09
Feb 2012) | 1 line
skip list implementation. Not concurrent yet.
------------------------------------------------------------------------
r1581 | sears.russell@gmail.com | 2012-02-08 13:33:29 -0500 (Wed, 08
Feb 2012) | 1 line
Commit of a bunch of new, unused code: KISS random number generator,
Hazard Pointers, SUX latches (untested) and bit twiddling for
concurrent b-tree
------------------------------------------------------------------------
r1580 | sears.russell@gmail.com | 2012-01-17 19:17:37 -0500 (Tue, 17
Jan 2012) | 1 line
fix typo
------------------------------------------------------------------------
r1579 | sears.russell@gmail.com | 2012-01-11 18:33:31 -0500 (Wed, 11
Jan 2012) | 1 line
static build fixes for linux. hopefully these do not break macos...
------------------------------------------------------------------------
r1578 | sears.russell@gmail.com | 2012-01-09 19:13:34 -0500 (Mon, 09
Jan 2012) | 1 line
fix cmake under linux
------------------------------------------------------------------------
r1577 | sears.russell@gmail.com | 2012-01-09 18:37:15 -0500 (Mon, 09
Jan 2012) | 1 line
fix linux static binary compilation bugs
------------------------------------------------------------------------
r1576 | sears.russell | 2012-01-09 18:00:08 -0500 (Mon, 09 Jan 2012) |
1 line
port to macos x
------------------------------------------------------------------------
r1575 | sears.russell | 2012-01-09 17:39:43 -0500 (Mon, 09 Jan 2012) |
1 line
add missing _ from sync call name
------------------------------------------------------------------------
r1574 | sears.russell@gmail.com | 2012-01-09 14:26:31 -0500 (Mon, 09
Jan 2012) | 1 line
add -rt flag to static builds
------------------------------------------------------------------------
r1573 | sears.russell@gmail.com | 2011-12-20 23:38:29 -0500 (Tue, 20
Dec 2011) | 1 line
Simple makefile geared toward building libstasis.so and libstasis.a
(and nothing else)
------------------------------------------------------------------------
r1572 | sears.russell@gmail.com | 2011-12-20 22:37:54 -0500 (Tue, 20
Dec 2011) | 1 line
add some missing #include<config.h> lines
2012-04-21 16:52:31 +00:00
|
|
|
#else
|
|
|
|
buf = malloc(2 * 512);
|
|
|
|
buf = (void*)(((intptr_t)buf) & ~(512-1));
|
|
|
|
#endif
|
2011-08-31 15:50:21 +00:00
|
|
|
const char * filename = argv[1];
|
|
|
|
int fd = open(filename, O_RDONLY);//|O_DIRECT);
|
|
|
|
if(fd == -1) {
|
|
|
|
perror("Could not open file");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
int steps = atoi(argv[2]);
|
|
|
|
int iter = atoi(argv[3]);
|
|
|
|
long length = atoll(argv[4]);
|
|
|
|
long start_off = atoll(argv[5]);
|
|
|
|
long random_mode = atoi(argv[6]);
|
|
|
|
|
2012-12-01 02:29:28 +00:00
|
|
|
double** sum_x = stasis_calloc(steps, double*);
|
|
|
|
double** sum_x2 = stasis_calloc(steps, double*);
|
|
|
|
long** sample_count = stasis_calloc(steps, long*);
|
2011-08-31 15:50:21 +00:00
|
|
|
|
|
|
|
for(int s = 0; s < steps; s++) {
|
2012-12-01 02:29:28 +00:00
|
|
|
sum_x[s] = stasis_calloc(steps, double);
|
|
|
|
sum_x2[s] = stasis_calloc(steps, double);
|
|
|
|
sample_count[s] = stasis_calloc(steps, long);
|
2011-08-31 15:50:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
long stride = length / steps;
|
|
|
|
printf("filename = %s steps = %d iter = %d length = %ld start_off = %ld stride = %ld\n",
|
|
|
|
filename, steps, iter, length, start_off, stride);
|
|
|
|
assert(stride);
|
|
|
|
for(int iteration = 0; iteration < iter; iteration++) {
|
|
|
|
if(!random_mode || random_mode == 2) {
|
|
|
|
for(int xstep = 0; xstep < steps; xstep++) {
|
|
|
|
for(int ystep = 0; ystep < steps; ystep++) {
|
|
|
|
drop_buffers();
|
|
|
|
|
|
|
|
// position head (do not count the time this takes)
|
|
|
|
if(random_mode) {
|
2011-08-31 19:25:09 +00:00
|
|
|
my_pread(start_off, xstep * stride + stasis_util_random64(stride));
|
2011-08-31 15:50:21 +00:00
|
|
|
} else {
|
|
|
|
my_pread(start_off, xstep * stride);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
struct timeval start, stop;
|
|
|
|
gettimeofday(&start, 0);
|
|
|
|
if(random_mode) {
|
2011-08-31 19:25:09 +00:00
|
|
|
my_pread(start_off, ystep * stride + stasis_util_random64(stride));
|
2011-08-31 15:50:21 +00:00
|
|
|
} else {
|
|
|
|
my_pread(start_off, ystep * stride);
|
|
|
|
}
|
|
|
|
gettimeofday(&stop, 0);
|
|
|
|
|
|
|
|
double elapsed = stasis_timeval_to_double(
|
|
|
|
stasis_subtract_timeval(stop, start));
|
|
|
|
sum_x [xstep][ystep] += elapsed;
|
|
|
|
sum_x2[xstep][ystep] += elapsed*elapsed;
|
|
|
|
}
|
|
|
|
printf("%d", xstep % 10); fflush(stdout);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
for(long x = 0; x < steps * steps; x++) {
|
2011-08-31 19:25:09 +00:00
|
|
|
long long start_pos = stasis_util_random64(length);
|
|
|
|
long long stop_pos = stasis_util_random64(length);
|
2011-08-31 15:50:21 +00:00
|
|
|
|
|
|
|
int xstep = start_pos / stride;
|
|
|
|
int ystep = stop_pos / stride;
|
|
|
|
|
|
|
|
drop_buffers();
|
|
|
|
// position head
|
|
|
|
my_pread(start_off, start_pos);
|
|
|
|
|
|
|
|
struct timeval start, stop;
|
|
|
|
gettimeofday(&start, 0);
|
|
|
|
my_pread(start_off, stop_pos);
|
|
|
|
gettimeofday(&stop, 0);
|
|
|
|
|
|
|
|
double elapsed = stasis_timeval_to_double(
|
|
|
|
stasis_subtract_timeval(stop, start));
|
|
|
|
sum_x [xstep][ystep] += elapsed;
|
|
|
|
sum_x2[xstep][ystep] += elapsed*elapsed;
|
|
|
|
sample_count[xstep][ystep] ++;
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
printf("\nIteration %d mean seek time:\n", iteration);
|
|
|
|
for(int xstep = 0; xstep < steps; xstep++) {
|
|
|
|
for(int ystep = 0; ystep < steps; ystep++) {
|
|
|
|
double n = (double) random_mode==1
|
|
|
|
?(sample_count[xstep][ystep]
|
|
|
|
?sample_count[xstep][ystep]
|
|
|
|
:1)
|
|
|
|
:(iteration+1);
|
|
|
|
printf("%f%s", sum_x[xstep][ystep] / n,
|
|
|
|
(ystep==steps-1)?"\n":"\t");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
printf("\nIteration %d stddev seek time:\n", iteration);
|
|
|
|
for(int xstep = 0; xstep < steps; xstep++) {
|
|
|
|
for(int ystep = 0; ystep < steps; ystep++) {
|
|
|
|
double n = (double) random_mode==1
|
|
|
|
?(sample_count[xstep][ystep]
|
|
|
|
?sample_count[xstep][ystep]
|
|
|
|
:1)
|
|
|
|
:(iteration+1);
|
|
|
|
double mean = sum_x[xstep][ystep]/n;
|
|
|
|
printf("%f%s", sqrt(sum_x2[xstep][ystep]/n - mean*mean),
|
|
|
|
(ystep==steps-1)?"\n":"\t");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fflush(stdout);
|
|
|
|
}
|
|
|
|
close(fd);
|
|
|
|
return 0;
|
|
|
|
}
|