/
perftests.cpp
538 lines (484 loc) · 17.1 KB
/
perftests.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
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
/** @file perftests.cpp.cpp : unit tests relating to performance
The idea herein is tests that run fast and can be part of the normal CI suite. So no tests herein that take
a long time to run. Obviously we need those too, but they will be separate.
These tests use DBDirectClient; they are a bit white-boxish.
*/
/**
* Copyright (C) 2008 10gen Inc.
*
* This program 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.
*
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "pch.h"
#include "../db/query.h"
#include "../db/db.h"
#include "../db/instance.h"
#include "../db/json.h"
#include "../db/lasterror.h"
#include "../db/update.h"
#include "../db/taskqueue.h"
#include "../util/timer.h"
#include "dbtests.h"
#include "../db/dur_stats.h"
#include "../util/checksum.h"
#include "../util/version.h"
using namespace bson;
namespace PerfTests {
typedef DBDirectClient DBClientType;
//typedef DBClientConnection DBClientType;
class ClientBase {
public:
// NOTE: Not bothering to backup the old error record.
ClientBase() {
//_client.connect("localhost");
mongo::lastError.reset( new LastError() );
}
virtual ~ClientBase() {
//mongo::lastError.release();
}
protected:
static void insert( const char *ns, BSONObj o ) {
_client.insert( ns, o );
}
static void update( const char *ns, BSONObj q, BSONObj o, bool upsert = 0 ) {
_client.update( ns, Query( q ), o, upsert );
}
static bool error() {
return !_client.getPrevError().getField( "err" ).isNull();
}
DBClientBase &client() const { return _client; }
private:
static DBClientType _client;
};
DBClientType ClientBase::_client;
// todo: use a couple threads. not a very good test yet.
class TaskQueueTest {
static int tot;
struct V {
int val;
static void go(const V &v) { tot += v.val; }
};
public:
void run() {
tot = 0;
TaskQueue<V> d;
int x = 0;
for( int i = 0; i < 100; i++ ) {
if( i % 30 == 0 )
d.invoke();
x += i;
writelock lk;
V v;
v.val = i;
d.defer(v);
}
d.invoke();
assert( x == tot );
}
};
int TaskQueueTest::tot;
class B : public ClientBase {
string _ns;
protected:
const char *ns() { return _ns.c_str(); }
// anything you want to do before being timed
virtual void prep() { }
virtual void timed() = 0;
// optional 2nd test phase to be timed separately
// return name of it
virtual const char * timed2() { return 0; }
virtual void post() { }
virtual string name() = 0;
virtual unsigned long long expectation() { return 0; }
virtual int expectationTimeMillis() { return -1; }
// how long to run test. 0 is a sentinel which means just run the timed() method once and time it.
virtual int howLongMillis() { return 5000; }
/* override if your test output doesn't need that */
virtual bool showDurStats() { return true; }
static DBClientConnection *conn;
public:
void say(unsigned long long n, int ms, string s) {
unsigned long long rps = n*1000/ms;
cout << "stats " << setw(33) << left << s << ' ' << setw(8) << rps << ' ' << right << setw(6) << ms << "ms ";
if( showDurStats() )
cout << dur::stats.curr->_asCSV();
cout << endl;
/* if you want recording of the timings, place the password for the perf database
in a "pstats.login" text file in the current directory for the test binary
*/
const char *fn = "../../settings.py";
static bool ok = true;
if( ok && exists(fn) ) {
try {
if( conn == 0 ) {
MemoryMappedFile f;
const char *p = (const char *) f.mapWithOptions(fn, MongoFile::READONLY);
string pwd;
{
const char *q = str::after(p, "pstatspassword=\"");
if( *q == 0 ) {
cout << "info perftests.cpp: no pstatspassword= in settings.py" << endl;
ok = false;
}
else {
pwd = str::before(q, '\"');
}
}
if( ok ) {
conn = new DBClientConnection(false, 0, 10);
string err;
if( conn->connect("mongo05.10gen.cust.cbici.net", err) ) {
if( !conn->auth("perf", "perf", pwd, err) ) {
cout << "info: authentication with stats db failed: " << err << endl;
assert(false);
}
}
else {
cout << err << " (to log perfstats)" << endl;
ok = false;
}
}
}
if( conn && !conn->isFailed() ) {
bob b;
b.append("host", getHostName());
b.appendTimeT("when", time(0));
b.append("test", s);
b.append("rps", (int) rps);
b.append("millis", ms);
b.appendBool("dur", cmdLine.dur);
if( showDurStats() && cmdLine.dur )
b.append("durStats", dur::stats.curr->_asObj());
{
bob inf;
inf.append("version", versionString);
if( sizeof(int*) == 4 ) inf.append("bits", 32);
#if defined(_WIN32)
inf.append("os", "win");
#endif
inf.append("git", gitVersion());
inf.append("boost", BOOST_VERSION);
b.append("info", inf.obj());
}
conn->insert("perf.pstats", b.obj());
}
}
catch(...) {
}
}
}
void run() {
_ns = string("perftest.") + name();
client().dropCollection(ns());
prep();
int hlm = howLongMillis();
dur::stats._intervalMicros = 0; // no auto rotate
dur::stats.curr->reset();
Timer t;
unsigned long long n = 0;
const unsigned Batch = 50;
if( hlm == 0 ) {
// means just do once
timed();
}
else {
do {
unsigned i;
for( i = 0; i < Batch; i++ )
timed();
n += i;
} while( t.millis() < hlm );
}
client().getLastError(); // block until all ops are finished
int ms = t.millis();
say(n, ms, name());
int etm = expectationTimeMillis();
if( etm > 0 ) {
if( ms > etm*2 ) {
cout << "test " << name() << " seems slow expected ~" << etm << "ms" << endl;
}
}
else if( n < expectation() ) {
cout << "test " << name() << " seems slow n:" << n << " ops/sec but expect greater than:" << expectation() << endl;
}
{
const char *test2name = timed2();
if( test2name ) {
dur::stats.curr->reset();
Timer t;
unsigned long long n = 0;
while( 1 ) {
unsigned i;
for( i = 0; i < Batch; i++ )
timed2();
n += i;
if( t.millis() > hlm )
break;
}
int ms = t.millis();
say(n, ms, test2name);
}
}
}
};
DBClientConnection *B::conn;
unsigned dontOptimizeOutHopefully;
class BSONIter : public B {
public:
int n;
bo b, sub;
string name() { return "BSONIter"; }
BSONIter() {
n = 0;
bo sub = bob().appendTimeT("t", time(0)).appendBool("abool", true).appendBinData("somebin", 3, BinDataGeneral, "abc").appendNull("anullone").obj();
b = BSON( "_id" << OID() << "x" << 3 << "yaaaaaa" << 3.00009 << "zz" << 1 << "q" << false << "obj" << sub << "zzzzzzz" << "a string a string" );
}
virtual bool showDurStats() { return false; }
void timed() {
for( bo::iterator i = b.begin(); i.more(); )
if( i.next().fieldName() )
n++;
for( bo::iterator i = sub.begin(); i.more(); )
if( i.next().fieldName() )
n++;
}
};
// test thread local speed
class TLS : public B {
public:
TLS() { }
string name() { return "thread-local-storage"; }
void timed() {
if( &cc() )
dontOptimizeOutHopefully++;
}
unsigned long long expectation() { return 1000000; }
virtual bool showDurStats() { return false; }
};
// test speed of checksum method
class ChecksumTest : public B {
public:
const unsigned sz;
ChecksumTest() : sz(1024*1024*100+3)
{ }
string name() { return "checksum"; }
virtual int howLongMillis() { return 0; }
int expectationTimeMillis() { return 200; }
virtual bool showDurStats() { return false; }
void *p;
void prep() {
{
// the checksum code assumes 'standard' rollover on addition overflows. let's check that:
unsigned long long x = 0xffffffffffffffffULL;
ASSERT( x+2 == 1 );
}
p = malloc(sz);
for (unsigned i = 0; i<sz; i++)
((char*)p)[i] = rand();
}
Checksum last;
void timed() {
for( int i = 0; i < 4; i++ ) {
Checksum c;
c.gen(p, sz);
ASSERT( i == 0 || c == last );
last = c;
}
}
void post() {
{
mongo::Checksum c;
c.gen(p, sz-1);
ASSERT( c != last );
((char *&)p)[0]++; // check same data, different order, doesn't give same checksum
((char *&)p)[1]--;
c.gen(p, sz);
ASSERT( c != last );
((char *&)p)[1]++; // check same data, different order, doesn't give same checksum (different longwords case)
((char *&)p)[8]--;
c.gen(p, sz);
ASSERT( c != last );
}
free(p);
}
};
class InsertDup : public B {
const BSONObj o;
public:
InsertDup() : o( BSON("_id" << 1) ) { } // dup keys
string name() {
return "insert-duplicate-_ids";
}
void prep() {
client().insert( ns(), o );
}
void timed() {
client().insert( ns(), o );
}
void post() {
assert( client().count(ns()) == 1 );
}
unsigned long long expectation() { return 1000; }
};
class Insert1 : public InsertDup {
const BSONObj x;
OID oid;
BSONObj query;
public:
Insert1() : x( BSON("x" << 99) ) {
oid.init();
query = BSON("_id" << oid);
}
string name() { return "insert-simple"; }
void timed() {
client().insert( ns(), x );
}
const char * timed2() {
client().findOne(ns(), query);
return "findOne_by_id";
}
void post() {
assert( client().count(ns()) > 100 );
}
unsigned long long expectation() { return 1000; }
};
class InsertBig : public InsertDup {
BSONObj x;
virtual int howLongMillis() {
if( sizeof(void*) == 4 )
return 1000; // could exceed mmapping if run too long, as this function adds a lot fasta
return 5000;
}
public:
InsertBig() {
char buf[200000];
BSONObjBuilder b;
b.append("x", 99);
b.appendBinData("bin", 200000, (BinDataType) 129, buf);
x = b.obj();
}
string name() { return "insert big"; }
void timed() {
client().insert( ns(), x );
}
unsigned long long expectation() { return 20; }
};
class InsertRandom : public B {
public:
string name() { return "random-inserts"; }
void prep() {
client().insert( ns(), BSONObj() );
client().ensureIndex(ns(), BSON("x"<<1));
}
void timed() {
int x = rand();
BSONObj y = BSON("x" << x << "y" << rand() << "z" << 33);
client().insert(ns(), y);
}
void post() {
}
unsigned long long expectation() { return 1000; }
};
/** upserts about 32k records and then keeps updating them
2 indexes
*/
class Update1 : public B {
public:
static int rand() {
return std::rand() & 0x7fff;
}
virtual string name() { return "random-upserts"; }
void prep() {
client().insert( ns(), BSONObj() );
client().ensureIndex(ns(), BSON("x"<<1));
}
void timed() {
int x = rand();
BSONObj q = BSON("x" << x);
BSONObj y = BSON("x" << x << "y" << rand() << "z" << 33);
client().update(ns(), q, y, /*upsert*/true);
}
const char * timed2() {
static BSONObj I = BSON( "$inc" << BSON( "y" << 1 ) );
// test some $inc's
int x = rand();
BSONObj q = BSON("x" << x);
client().update(ns(), q, I);
static string s = name()+"-inc";
return s.c_str();
}
void post() {
}
unsigned long long expectation() { return 1000; }
};
template <typename T>
class MoreIndexes : public T {
public:
string name() { return T::name() + "-with-more-indexes"; }
void prep() {
T::prep();
this->client().ensureIndex(this->ns(), BSON("y"<<1));
this->client().ensureIndex(this->ns(), BSON("z"<<1));
}
};
void t() {
for( int i = 0; i < 20; i++ ) {
sleepmillis(21);
string fn = "/tmp/t1";
MongoMMF f;
unsigned long long len = 1 * 1024 * 1024;
assert( f.create(fn, len, /*sequential*/rand()%2==0) );
{
char *p = (char *) f.getView();
assert(p);
// write something to the private view as a test
strcpy(p, "hello");
}
if( cmdLine.dur ) {
char *w = (char *) f.view_write();
strcpy(w + 6, "world");
}
MongoFileFinder ff;
ASSERT( ff.findByPath(fn) );
}
}
class All : public Suite {
public:
All() : Suite( "perf" )
{
}
~All() {
}
Result * run( const string& filter ) {
boost::thread a(t);
Result * res = Suite::run(filter);
a.join();
return res;
}
void setupTests() {
cout
<< "stats test rps time "
<< dur::stats.curr->_CSVHeader() << endl;
add< BSONIter >();
add< ChecksumTest >();
add< TaskQueueTest >();
add< TLS >();
add< InsertDup >();
add< Insert1 >();
add< InsertRandom >();
add< MoreIndexes<InsertRandom> >();
add< Update1 >();
add< MoreIndexes<Update1> >();
add< InsertBig >();
}
} myall;
}