1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
#ident "$Id$"
/*======
This file is part of PerconaFT.
Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
PerconaFT is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2,
as published by the Free Software Foundation.
PerconaFT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
----------------------------------------
PerconaFT is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License, version 3,
as published by the Free Software Foundation.
PerconaFT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
======= */
#ident "Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
#include "loader/dbufio.h"
#include <stdio.h>
#include <fcntl.h>
#include <toku_assert.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
enum { N = 5 };
enum { M = 10 };
static void test1 (size_t chars_per_file, size_t bytes_per_read) {
int fds[N];
char fnames[N][100];
size_t n_read[N];
int still_live[N];
int n_live=N;
for (int i=0; i<N; i++) {
snprintf(fnames[i], 100, "dbufio-test-file%d.data", i);
unlink(fnames[i]);
fds[i] = open(fnames[i], O_CREAT|O_RDWR, S_IRWXU);
//printf("fds[%d]=%d is %s\n", i, fds[i], fnames[i]);
assert(fds[i]>=0);
n_read[i]=0;
still_live[i]=i;
for (size_t j=0; j<chars_per_file; j++) {
unsigned char c = (i+j)%256;
int r = toku_os_write(fds[i], &c, 1);
if (r!=0) printf("fds[%d]=%d r=%d errno=%d (%s)\n", i, fds[i], r, errno, strerror(errno));
assert(r==0);
}
{
int r = lseek(fds[i], 0, SEEK_SET);
assert(r==0);
}
}
DBUFIO_FILESET bfs;
{
int r = create_dbufio_fileset(&bfs, N, fds, M, false);
assert(r==0);
}
while (n_live>0) {
int indirectnum = random()%n_live;
int filenum = still_live[indirectnum];
char buf[bytes_per_read];
size_t n_read_here=0;
int r = dbufio_fileset_read(bfs, filenum, buf, bytes_per_read, &n_read_here);
//printf("read(%d) -> %d (%ld) (old n_read=%ld)\n", filenum, r, n_read_here, n_read[filenum]);
if (r==0) {
// did read something
assert(n_read_here==bytes_per_read);
n_read[filenum]+=n_read_here;
//printf(" new n_read=%ld\n", n_read[filenum]);
assert(n_read[filenum]<=chars_per_file);
} else {
assert(r==EOF);
assert(n_read[filenum]==chars_per_file);
still_live[indirectnum] = still_live[n_live-1];
n_live--;
}
}
{
int r = destroy_dbufio_fileset(bfs);
assert(r==0);
}
for (int i=0; i<N; i++) {
{
int r = unlink(fnames[i]);
assert(r==0);
}
{
int r = close(fds[i]);
assert(r==0);
}
assert(n_read[i]==chars_per_file);
}
}
int main (int argc __attribute__((__unused__)), char *argv[]__attribute__((__unused__))) {
// test1(0, 1);
// test1(1, 1);
// test1(15, 1);
// test1(100, 1);
test1(30, 3); // 3 and M are relatively prime. But 3 divides the file size.
return 0;
}
|
