-
Notifications
You must be signed in to change notification settings - Fork 0
/
main_util.cpp
346 lines (326 loc) · 7.01 KB
/
main_util.cpp
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
/* This file is part of Anvil. Anvil is copyright 2007-2010 The Regents
* of the University of California. It is distributed under the terms of
* version 2 of the GNU GPL. See the file LICENSE for details. */
#define _XOPEN_SOURCE 600
#include <fcntl.h>
#include <ctype.h>
#include <stdio.h>
#include <stdarg.h>
#include <dirent.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/stat.h>
#include "main.h"
#include "blob_buffer.h"
void print(const dtype & x)
{
switch(x.type)
{
case dtype::UINT32:
printf("%u", x.u32);
break;
case dtype::DOUBLE:
printf("%lg", x.dbl);
break;
case dtype::STRING:
printf("%s", (const char *) x.str);
break;
case dtype::BLOB:
size_t size = x.blb.size();
printf("%zu[", size);
for(size_t i = 0; i < size && i < 8; i++)
printf("%02X%s", x.blb[i], (i < size - 1) ? " " : "");
printf((size > 8) ? "...]" : "]");
break;
}
}
void print(const blob & x, const char * prefix, ...)
{
va_list ap;
va_start(ap, prefix);
if(!x.exists())
{
if(prefix)
vprintf(prefix, ap);
printf("(non-existent)\n");
va_end(ap);
return;
}
for(size_t i = 0; i < x.size(); i += 16)
{
size_t m = i + 16;
if(prefix)
vprintf(prefix, ap);
for(size_t j = i; j < m; j++)
{
if(j < x.size())
printf("%02x ", x[j]);
else
printf(" ");
if((i % 16) == 8)
printf(" ");
}
printf(" |");
for(size_t j = i; j < m; j++)
{
if(j < x.size())
printf("%c", isprint(x[j]) ? x[j] : '.');
else
printf(" ");
}
printf("|\n");
}
va_end(ap);
}
void run_iterator(dtable::iter * iter)
{
bool more = true;
printf("dtable contents:\n");
while(iter->valid())
{
if(!more)
{
EXPECT_NEVER("iter->next() returned false, but iter->valid() says there is more!");
break;
}
print(iter->key());
printf(":");
print(iter->value(), "\t");
more = iter->next();
}
}
void run_iterator(const dtable * table, ATX_DEF)
{
dtable::iter * iter = table->iterator(atx);
run_iterator(iter);
delete iter;
}
void run_iterator(const ctable * table)
{
dtype old_key(0u);
bool more = true, first = true;
ctable::iter * iter = table->iterator();
printf("ctable contents:\n");
while(iter->valid())
{
dtype key = iter->key();
if(!more)
{
EXPECT_NEVER("iter->next() returned false, but iter->valid() says there is more!");
break;
}
if(first || key.compare(old_key))
{
printf("==> key ");
print(key);
printf("\n");
old_key = key;
first = false;
}
printf("%s:", (const char *) iter->name());
print(iter->value(), "\t");
more = iter->next();
}
delete iter;
}
void run_iterator(const stable * table)
{
dtype old_key(0u);
bool more = true, first = true;
stable::column_iter * columns = table->columns();
stable::iter * iter = table->iterator();
printf("stable columns:\n");
while(columns->valid())
{
size_t rows = columns->row_count();
const char * type = dtype::name(columns->type());
if(!more)
{
EXPECT_NEVER("columns->next() returned false, but columns->valid() says there is more!");
break;
}
printf("%s:\t%s (%zu row%s)\n", (const char *) columns->name(), type, rows, (rows == 1) ? "" : "s");
more = columns->next();
}
delete columns;
more = true;
printf("stable contents:\n");
while(iter->valid())
{
dtype key = iter->key();
if(!more)
{
EXPECT_NEVER("iter->next() returned false, but iter->valid() says there is more!");
break;
}
if(first || key.compare(old_key))
{
printf("==> key ");
print(key);
printf("\n");
old_key = key;
first = false;
}
printf("%s:\t", (const char *) iter->column());
print(iter->value());
printf("\n");
more = iter->next();
}
delete iter;
}
void time_iterator(const dtable * table, size_t count, ATX_DEF)
{
struct timeval start;
dtable::iter * iter = table->iterator(atx);
printf("Iterate %zu time%s... ", count, (count == 1) ? "" : "s");
fflush(stdout);
gettimeofday(&start, NULL);
for(size_t i = 0; i < count; i++)
{
iter->first();
while(iter->valid())
{
dtype key = iter->key();
dtype value = iter->value();
iter->next();
}
}
print_elapsed(&start);
delete iter;
}
void timeval_subtract(struct timeval * end, const struct timeval * start)
{
end->tv_sec -= start->tv_sec;
if(end->tv_usec < start->tv_usec)
{
end->tv_usec += 1000000;
end->tv_sec--;
}
end->tv_usec -= start->tv_usec;
}
void timeval_add(struct timeval * accumulator, const struct timeval * delta)
{
accumulator->tv_sec += delta->tv_sec;
accumulator->tv_usec += delta->tv_usec;
if(accumulator->tv_usec >= 1000000)
{
accumulator->tv_usec -= 1000000;
accumulator->tv_sec++;
}
}
void timeval_divide(struct timeval * time, int denominator, bool round)
{
uint64_t usec = time->tv_sec;
usec *= 1000000;
usec += time->tv_usec;
if(round)
usec += denominator / 2;
if(denominator)
usec /= denominator;
else
/* well, we hope it already is */
usec = 0;
time->tv_sec = usec / 1000000;
time->tv_usec = usec % 1000000;
}
void print_timeval(const struct timeval * time, bool seconds, bool newline)
{
printf("%d.%06d%s%s", (int) time->tv_sec, (int) time->tv_usec, seconds ? " seconds" : "", newline ? ".\n" : "");
}
void print_elapsed(const struct timeval * start, struct timeval * end, bool elapsed)
{
timeval_subtract(end, start);
printf("%d.%06d seconds%s.\n", (int) end->tv_sec, (int) end->tv_usec, elapsed ? " elapsed" : "");
}
void print_elapsed(const struct timeval * start, bool elapsed)
{
struct timeval end;
gettimeofday(&end, NULL);
print_elapsed(start, &end, elapsed);
}
void print_progress(const struct timeval * start, struct timeval * now, int percent)
{
timeval_subtract(now, start);
printf("%d%% done after %d.%06d seconds.\n", percent, (int) now->tv_sec, (int) now->tv_usec);
}
void print_progress(const struct timeval * start, int percent)
{
struct timeval now;
gettimeofday(&now, NULL);
print_progress(start, &now, percent);
}
void wait_digest(int seconds)
{
printf("Waiting %d second%s for digest interval... ", seconds, (seconds == 1) ? "" : "s");
fflush(stdout);
sleep(seconds);
printf("done.\n");
}
blob random_blob(size_t size)
{
blob_buffer buffer;
for(size_t i = 0; i < size; i++)
{
uint8_t byte = rand();
buffer << byte;
}
return buffer;
}
int drop_cache(const char * path)
{
#ifdef __linux__
struct stat st;
int r = stat(path, &st);
if(r < 0)
{
perror(path);
return r;
}
if(S_ISDIR(st.st_mode))
{
struct dirent * entry;
DIR * dir = opendir(path);
if(!dir)
{
perror(path);
return -1;
}
while((entry = readdir(dir)))
{
char * full = NULL;
if(!strcmp(entry->d_name, ".") || !strcmp(entry->d_name, ".."))
continue;
r = asprintf(&full, "%s/%s", path, entry->d_name);
if(r < 0)
{
perror(entry->d_name);
continue;
}
drop_cache(full);
free(full);
}
closedir(dir);
}
else
{
int fd = open(path, O_RDONLY);
if(fd < 0)
{
perror(path);
return fd;
}
r = posix_fadvise(fd, 0, 0, POSIX_FADV_DONTNEED);
if(r < 0)
{
perror(path);
return r;
}
close(fd);
}
return 0;
#else
printf("%s(): not supported\n", __FUNCTION__);
return -ENOSYS;
#endif
}