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 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919
|
/** @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/ops/query.h"
#include "../db/db.h"
#include "../db/instance.h"
#include "../db/json.h"
#include "../db/lasterror.h"
#include "../db/ops/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"
#include "../db/key.h"
#include "../util/compress.h"
using namespace bson;
namespace mongo {
namespace regression {
extern unsigned perfHist;
}
}
namespace PerfTests {
const bool profiling = false;
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 string timed2() { return ""; }
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 profiling ? 60000 : 5000; }
/* override if your test output doesn't need that */
virtual bool showDurStats() { return true; }
static DBClientConnection *conn;
static unsigned once;
public:
/* if you want recording of the timings, place the password for the perf database
in ./../settings.py:
pstatspassword="<pwd>"
*/
void connect() {
if( once )
return;
++once;
// no writing to perf db if _DEBUG
DEV return;
const char *fn = "../../settings.py";
if( !exists(fn) ) {
if( exists("settings.py") )
fn = "settings.py";
else {
cout << "no ../../settings.py or ./settings.py file found. will not write perf stats to pstats db." << endl;
cout << "it is recommended this be enabled even on dev boxes" << endl;
return;
}
}
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;
return;
}
else {
pwd = str::before(q, '\"');
}
}
DBClientConnection *c = new DBClientConnection(false, 0, 10);
string err;
if( c->connect("perfdb.10gen.cc", err) ) {
if( !c->auth("perf", "perf", pwd, err) ) {
cout << "info: authentication with stats db failed: " << err << endl;
assert(false);
}
conn = c;
}
else {
cout << err << " (to log perfstats)" << endl;
}
}
}
catch(...) { }
}
virtual unsigned batchSize() { return 50; }
void say(unsigned long long n, int ms, string s) {
unsigned long long rps = n*1000/ms;
cout << "stats " << setw(33) << left << s << ' ' << right << setw(9) << rps << ' ' << right << setw(5) << ms << "ms ";
if( showDurStats() )
cout << dur::stats.curr->_asCSV();
cout << endl;
connect();
if( conn && !conn->isFailed() ) {
const char *ns = "perf.pstats";
if( perfHist ) {
static bool needver = true;
try {
// try to report rps from last time */
Query q;
{
BSONObjBuilder b;
b.append("host",getHostName()).append("test",s).append("dur",cmdLine.dur);
DEV { b.append("info.DEBUG",true); }
else b.appendNull("info.DEBUG");
if( sizeof(int*) == 4 )
b.append("info.bits", 32);
else
b.appendNull("info.bits");
q = Query(b.obj()).sort("when",-1);
}
BSONObj fields = BSON( "rps" << 1 << "info" << 1 );
vector<BSONObj> v;
conn->findN(v, ns, q, perfHist, 0, &fields);
for( vector<BSONObj>::iterator i = v.begin(); i != v.end(); i++ ) {
BSONObj o = *i;
double lastrps = o["rps"].Number();
if( lastrps ) {
cout << "stats " << setw(33) << right << "new/old:" << ' ' << setw(9);
cout << fixed << setprecision(2) << rps / lastrps;
if( needver ) {
cout << " " << o.getFieldDotted("info.git").toString();
}
cout << '\n';
}
}
} catch(...) { }
cout.flush();
needver = false;
}
{
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);
DEV inf.append("DEBUG", true);
#if defined(_WIN32)
inf.append("os", "win");
#endif
inf.append("git", gitVersion());
inf.append("boost", BOOST_VERSION);
b.append("info", inf.obj());
}
BSONObj o = b.obj();
//cout << "inserting " << o.toString() << endl;
try {
conn->insert(ns, o);
}
catch ( std::exception& e ) {
warning() << "couldn't save perf results: " << e.what() << endl;
}
}
}
}
void run() {
_ns = string("perftest.") + name();
client().dropCollection(ns());
prep();
int hlm = howLongMillis();
DEV {
// don't run very long with _DEBUG - not very meaningful anyway on that build
hlm = min(hlm, 500);
}
dur::stats._intervalMicros = 0; // no auto rotate
dur::stats.curr->reset();
mongo::Timer t;
unsigned long long n = 0;
const unsigned Batch = batchSize();
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();
DEV {
}
else 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;
}
post();
{
string test2name = timed2();
if( test2name.size() != 0 ) {
dur::stats.curr->reset();
mongo::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 B::once;
unsigned dontOptimizeOutHopefully;
class NonDurTest : public B {
public:
virtual int howLongMillis() { return 3000; }
virtual bool showDurStats() { return false; }
};
class BSONIter : public NonDurTest {
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" );
}
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++;
}
};
class BSONGetFields1 : public NonDurTest {
public:
int n;
bo b, sub;
string name() { return "BSONGetFields1By1"; }
BSONGetFields1() {
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" );
}
void timed() {
if( b["x"].eoo() )
n++;
if( b["q"].eoo() )
n++;
if( b["zzz"].eoo() )
n++;
}
};
class BSONGetFields2 : public BSONGetFields1 {
public:
string name() { return "BSONGetFields"; }
void timed() {
static const char *names[] = { "x", "q", "zzz" };
BSONElement elements[3];
b.getFields(3, names, elements);
if( elements[0].eoo() )
n++;
if( elements[1].eoo() )
n++;
if( elements[2].eoo() )
n++;
}
};
class KeyTest : public B {
public:
KeyV1Owned a,b,c;
string name() { return "Key-woequal"; }
virtual int howLongMillis() { return 3000; }
KeyTest() :
a(BSON("a"<<1<<"b"<<3.0<<"c"<<"qqq")),
b(BSON("a"<<1<<"b"<<3.0<<"c"<<"qqq")),
c(BSON("a"<<1<<"b"<<3.0<<"c"<<"qqqb"))
{}
virtual bool showDurStats() { return false; }
void timed() {
assert( a.woEqual(b) );
assert( !a.woEqual(c) );
}
};
unsigned long long aaa;
class Timer : public B {
public:
string name() { return "Timer"; }
virtual int howLongMillis() { return 1000; }
virtual bool showDurStats() { return false; }
void timed() {
mongo::Timer t;
aaa += t.millis();
}
};
RWLock lk("testrw");
SimpleMutex m("simptst");
mongo::mutex mtest("mtest");
SpinLock s;
class mutexspeed : public B {
public:
string name() { return "mutex"; }
virtual int howLongMillis() { return 500; }
virtual bool showDurStats() { return false; }
void timed() {
mongo::mutex::scoped_lock lk(mtest);
}
};
class simplemutexspeed : public B {
public:
string name() { return "simplemutex"; }
virtual int howLongMillis() { return 500; }
virtual bool showDurStats() { return false; }
void timed() {
SimpleMutex::scoped_lock lk(m);
}
};
class spinlockspeed : public B {
public:
string name() { return "spinlock"; }
virtual int howLongMillis() { return 500; }
virtual bool showDurStats() { return false; }
void timed() {
mongo::scoped_spinlock lk(s);
}
};
class rlock : public B {
public:
string name() { return "rlock"; }
virtual int howLongMillis() { return 500; }
virtual bool showDurStats() { return false; }
void timed() {
lk.lock_shared();
lk.unlock_shared();
}
};
class wlock : public B {
public:
string name() { return "wlock"; }
virtual int howLongMillis() { return 500; }
virtual bool showDurStats() { return false; }
void timed() {
lk.lock();
lk.unlock();
}
};
#if 0
class ulock : public B {
public:
string name() { return "ulock"; }
virtual int howLongMillis() { return 500; }
virtual bool showDurStats() { return false; }
void timed() {
lk.lockAsUpgradable();
lk.unlockFromUpgradable();
}
};
#endif
class CTM : public B {
public:
CTM() : last(0), delts(0), n(0) { }
string name() { return "curTimeMillis64"; }
virtual int howLongMillis() { return 500; }
virtual bool showDurStats() { return false; }
unsigned long long last;
unsigned long long delts;
unsigned n;
void timed() {
unsigned long long x = curTimeMillis64();
aaa += x;
if( last ) {
unsigned long long delt = x-last;
if( delt ) {
delts += delt;
n++;
}
}
last = x;
}
void post() {
// we need to know if timing is highly ungranular - that could be relevant in some places
if( n )
cout << " avg timer granularity: " << ((double)delts)/n << "ms " << endl;
}
};
class Bldr : public B {
public:
int n;
string name() { return "BufBuilder"; }
Bldr() {
}
virtual int howLongMillis() { return 3000; }
virtual bool showDurStats() { return false; }
void timed() {
BufBuilder b;
b.appendNum(3);
b.appendUChar(' ');
b.appendStr("abcd");
n += b.len();
}
};
class StkBldr : public B {
public:
virtual int howLongMillis() { return 3000; }
int n;
string name() { return "StackBufBuilder"; }
virtual bool showDurStats() { return false; }
void timed() {
StackBufBuilder b;
b.appendNum(3);
b.appendUChar(' ');
b.appendStr("abcd");
n += b.len();
}
};
// if a test is this fast, it was optimized out
class Dummy : public B {
public:
Dummy() { }
virtual int howLongMillis() { return 3000; }
string name() { return "dummy"; }
void timed() {
dontOptimizeOutHopefully++;
}
unsigned long long expectation() { return 1000000; }
virtual bool showDurStats() { return false; }
};
// test thread local speed
class TLS : public B {
public:
TLS() { }
virtual int howLongMillis() { return 3000; }
string name() { return "thread-local-storage"; }
void timed() {
if( &cc() )
dontOptimizeOutHopefully++;
}
unsigned long long expectation() { return 1000000; }
virtual bool showDurStats() { return false; }
};
class Malloc : public B {
public:
Malloc() { }
virtual int howLongMillis() { return 4000; }
string name() { return "malloc"; }
void timed() {
char *p = new char[128];
if( dontOptimizeOutHopefully++ > 0 )
delete p;
}
unsigned long long expectation() { return 1000000; }
virtual bool showDurStats() { return false; }
};
class Compress : public B {
public:
const unsigned sz;
void *p;
Compress() : sz(1024*1024*100+3) { }
virtual unsigned batchSize() { return 1; }
string name() { return "compress"; }
virtual bool showDurStats() { return false; }
virtual int howLongMillis() { return 4000; }
unsigned long long expectation() { return 1000000; }
void prep() {
p = malloc(sz);
// this isn't a fair test as it is mostly rands but we just want a rough perf check
static int last;
for (unsigned i = 0; i<sz; i++) {
int r = rand();
if( (r & 0x300) == 0x300 )
r = last;
((char*)p)[i] = r;
last = r;
}
}
size_t last;
string res;
void timed() {
mongo::Timer t;
string out;
size_t len = compress((const char *) p, sz, &out);
bool ok = uncompress(out.c_str(), out.size(), &res);
ASSERT(ok);
static unsigned once;
if( once++ == 0 )
cout << "compress round trip " << sz/(1024.0*1024) / (t.millis()/1000.0) << "MB/sec\n";
//cout << len / (1024.0/1024) << " compressed" << endl;
(void)len; //fix unused error while above line is commented out
}
void post() {
ASSERT( memcmp(res.c_str(), p, sz) == 0 );
free(p);
}
};
// 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 2000; }
int expectationTimeMillis() { return 5000; }
virtual bool showDurStats() { return false; }
virtual unsigned batchSize() { return 1; }
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() {
static int i;
Checksum c;
c.gen(p, sz);
if( i == 0 )
last = c;
else if( i == 1 ) {
ASSERT( c == last );
}
}
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 B {
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 );
}
string timed2() {
client().findOne(ns(), query);
return "findOne_by_id";
}
void post() {
#if !defined(_DEBUG)
assert( client().count(ns()) > 50 );
#endif
}
unsigned long long expectation() { return 1000; }
};
class InsertBig : public B {
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);
}
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);
}
virtual string 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);
return name()+"-inc";
}
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));
}
/*
virtual string timed2() {
string x = T::timed2();
if ( x.size() == 0 )
return x;
return x + "-with-more-indexes";
}
*/
};
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" ) { }
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;
if( profiling ) {
add< Update1 >();
}
else {
add< Dummy >();
add< ChecksumTest >();
add< Compress >();
add< TLS >();
add< Malloc >();
add< Timer >();
add< rlock >();
add< wlock >();
//add< ulock >();
add< mutexspeed >();
add< simplemutexspeed >();
add< spinlockspeed >();
add< CTM >();
add< KeyTest >();
add< Bldr >();
add< StkBldr >();
add< BSONIter >();
add< BSONGetFields1 >();
add< BSONGetFields2 >();
add< TaskQueueTest >();
add< InsertDup >();
add< Insert1 >();
add< InsertRandom >();
add< MoreIndexes<InsertRandom> >();
add< Update1 >();
add< MoreIndexes<Update1> >();
add< InsertBig >();
}
}
} myall;
}
|