2016-02-10 00:12:00 +01:00
|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
2017-07-16 01:03:42 +02:00
|
|
|
// This source code is licensed under both the GPLv2 (found in the
|
|
|
|
// COPYING file in the root directory) and Apache 2.0 License
|
|
|
|
// (found in the LICENSE.Apache file in the root directory).
|
2013-10-16 23:59:46 +02:00
|
|
|
//
|
2013-10-05 07:32:05 +02:00
|
|
|
#pragma once
|
2017-04-06 04:02:00 +02:00
|
|
|
#include "monitoring/statistics.h"
|
2013-08-23 17:38:13 +02:00
|
|
|
#include "rocksdb/env.h"
|
2013-02-15 20:53:17 +01:00
|
|
|
|
2013-10-04 06:49:15 +02:00
|
|
|
namespace rocksdb {
|
2013-05-17 19:55:34 +02:00
|
|
|
// Auto-scoped.
|
2014-07-28 21:22:37 +02:00
|
|
|
// Records the measure time into the corresponding histogram if statistics
|
2016-08-02 23:53:29 +02:00
|
|
|
// is not nullptr. It is also saved into *elapsed if the pointer is not nullptr
|
|
|
|
// and overwrite is true, it will be added to *elapsed if overwrite is false.
|
2013-02-15 20:53:17 +01:00
|
|
|
class StopWatch {
|
|
|
|
public:
|
2016-08-02 23:53:29 +02:00
|
|
|
StopWatch(Env* const env, Statistics* statistics, const uint32_t hist_type,
|
2018-07-14 03:29:50 +02:00
|
|
|
uint64_t* elapsed = nullptr, bool overwrite = true,
|
|
|
|
bool delay_enabled = false)
|
2016-08-02 23:53:29 +02:00
|
|
|
: env_(env),
|
|
|
|
statistics_(statistics),
|
|
|
|
hist_type_(hist_type),
|
|
|
|
elapsed_(elapsed),
|
|
|
|
overwrite_(overwrite),
|
2019-02-28 19:14:19 +01:00
|
|
|
stats_enabled_(statistics &&
|
2019-03-01 19:39:00 +01:00
|
|
|
statistics->get_stats_level() >=
|
|
|
|
StatsLevel::kExceptTimers &&
|
2019-02-28 19:14:19 +01:00
|
|
|
statistics->HistEnabledForType(hist_type)),
|
2018-07-14 03:29:50 +02:00
|
|
|
delay_enabled_(delay_enabled),
|
|
|
|
total_delay_(0),
|
|
|
|
delay_start_time_(0),
|
2016-08-02 23:53:29 +02:00
|
|
|
start_time_((stats_enabled_ || elapsed != nullptr) ? env->NowMicros()
|
|
|
|
: 0) {}
|
2013-02-15 20:53:17 +01:00
|
|
|
|
2014-07-28 21:05:36 +02:00
|
|
|
~StopWatch() {
|
2014-07-28 21:22:37 +02:00
|
|
|
if (elapsed_) {
|
2016-08-02 23:53:29 +02:00
|
|
|
if (overwrite_) {
|
|
|
|
*elapsed_ = env_->NowMicros() - start_time_;
|
|
|
|
} else {
|
|
|
|
*elapsed_ += env_->NowMicros() - start_time_;
|
|
|
|
}
|
2014-07-28 21:22:37 +02:00
|
|
|
}
|
2018-07-14 03:29:50 +02:00
|
|
|
if (elapsed_ && delay_enabled_) {
|
|
|
|
*elapsed_ -= total_delay_;
|
|
|
|
}
|
2014-07-28 21:22:37 +02:00
|
|
|
if (stats_enabled_) {
|
2019-02-28 19:14:19 +01:00
|
|
|
statistics_->reportTimeToHistogram(
|
|
|
|
hist_type_, (elapsed_ != nullptr)
|
|
|
|
? *elapsed_
|
|
|
|
: (env_->NowMicros() - start_time_));
|
2014-07-28 21:05:36 +02:00
|
|
|
}
|
|
|
|
}
|
2013-02-15 20:53:17 +01:00
|
|
|
|
2018-07-14 03:29:50 +02:00
|
|
|
void DelayStart() {
|
|
|
|
// if delay_start_time_ is not 0, it means we are already tracking delay,
|
|
|
|
// so delay_start_time_ should not be overwritten
|
|
|
|
if (elapsed_ && delay_enabled_ && delay_start_time_ == 0) {
|
|
|
|
delay_start_time_ = env_->NowMicros();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void DelayStop() {
|
|
|
|
if (elapsed_ && delay_enabled_ && delay_start_time_ != 0) {
|
|
|
|
total_delay_ += env_->NowMicros() - delay_start_time_;
|
|
|
|
}
|
|
|
|
// reset to 0 means currently no delay is being tracked, so two consecutive
|
|
|
|
// calls to DelayStop will not increase total_delay_
|
|
|
|
delay_start_time_ = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t GetDelay() const { return delay_enabled_ ? total_delay_ : 0; }
|
|
|
|
|
2017-03-17 02:10:37 +01:00
|
|
|
uint64_t start_time() const { return start_time_; }
|
|
|
|
|
2013-02-15 20:53:17 +01:00
|
|
|
private:
|
|
|
|
Env* const env_;
|
2013-11-22 23:14:05 +01:00
|
|
|
Statistics* statistics_;
|
2014-07-28 21:05:36 +02:00
|
|
|
const uint32_t hist_type_;
|
2014-07-28 21:22:37 +02:00
|
|
|
uint64_t* elapsed_;
|
2016-08-02 23:53:29 +02:00
|
|
|
bool overwrite_;
|
2014-07-28 21:22:37 +02:00
|
|
|
bool stats_enabled_;
|
2018-07-14 03:29:50 +02:00
|
|
|
bool delay_enabled_;
|
|
|
|
uint64_t total_delay_;
|
|
|
|
uint64_t delay_start_time_;
|
2014-07-28 21:05:36 +02:00
|
|
|
const uint64_t start_time_;
|
2013-02-15 20:53:17 +01:00
|
|
|
};
|
[RocksDB] Added nano second stopwatch and new perf counters to track block read cost
Summary: The pupose of this diff is to expose per user-call level precise timing of block read, so that we can answer questions like: a Get() costs me 100ms, is that somehow related to loading blocks from file system, or sth else? We will answer that with EXACTLY how many blocks have been read, how much time was spent on transfering the bytes from os, how much time was spent on checksum verification and how much time was spent on block decompression, just for that one Get. A nano second stopwatch was introduced to track time with higher precision. The cost/precision of the stopwatch is also measured in unit-test. On my dev box, retrieving one time instance costs about 30ns, on average. The deviation of timing results is good enough to track 100ns-1us level events. And the overhead could be safely ignored for 100us level events (10000 instances/s), for example, a viewstate thrift call.
Test Plan: perf_context_test, also testing with viewstate shadow traffic.
Reviewers: dhruba
Reviewed By: dhruba
CC: leveldb, xjin
Differential Revision: https://reviews.facebook.net/D12351
2013-06-04 08:09:15 +02:00
|
|
|
|
|
|
|
// a nano second precision stopwatch
|
|
|
|
class StopWatchNano {
|
|
|
|
public:
|
2013-11-22 23:14:05 +01:00
|
|
|
explicit StopWatchNano(Env* const env, bool auto_start = false)
|
[RocksDB] Added nano second stopwatch and new perf counters to track block read cost
Summary: The pupose of this diff is to expose per user-call level precise timing of block read, so that we can answer questions like: a Get() costs me 100ms, is that somehow related to loading blocks from file system, or sth else? We will answer that with EXACTLY how many blocks have been read, how much time was spent on transfering the bytes from os, how much time was spent on checksum verification and how much time was spent on block decompression, just for that one Get. A nano second stopwatch was introduced to track time with higher precision. The cost/precision of the stopwatch is also measured in unit-test. On my dev box, retrieving one time instance costs about 30ns, on average. The deviation of timing results is good enough to track 100ns-1us level events. And the overhead could be safely ignored for 100us level events (10000 instances/s), for example, a viewstate thrift call.
Test Plan: perf_context_test, also testing with viewstate shadow traffic.
Reviewers: dhruba
Reviewed By: dhruba
CC: leveldb, xjin
Differential Revision: https://reviews.facebook.net/D12351
2013-06-04 08:09:15 +02:00
|
|
|
: env_(env), start_(0) {
|
|
|
|
if (auto_start) {
|
|
|
|
Start();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Start() { start_ = env_->NowNanos(); }
|
|
|
|
|
|
|
|
uint64_t ElapsedNanos(bool reset = false) {
|
|
|
|
auto now = env_->NowNanos();
|
|
|
|
auto elapsed = now - start_;
|
|
|
|
if (reset) {
|
|
|
|
start_ = now;
|
|
|
|
}
|
|
|
|
return elapsed;
|
|
|
|
}
|
|
|
|
|
Compaction filter on merge operands
Summary:
Since Andres' internship is over, I took over https://reviews.facebook.net/D42555 and rebased and simplified it a bit.
The behavior in this diff is a bit simpler than in D42555:
* only merge operators are passed through FilterMergeValue(). If fitler function returns true, the merge operator is ignored
* compaction filter is *not* called on: 1) results of merge operations and 2) base values that are getting merged with merge operands (the second case was also true in previous diff)
Do we also need a compaction filter to get called on merge results?
Test Plan: make && make check
Reviewers: lovro, tnovak, rven, yhchiang, sdong
Reviewed By: sdong
Subscribers: noetzli, kolmike, leveldb, dhruba, sdong
Differential Revision: https://reviews.facebook.net/D47847
2015-10-07 18:30:03 +02:00
|
|
|
uint64_t ElapsedNanosSafe(bool reset = false) {
|
|
|
|
return (env_ != nullptr) ? ElapsedNanos(reset) : 0U;
|
|
|
|
}
|
|
|
|
|
[RocksDB] Added nano second stopwatch and new perf counters to track block read cost
Summary: The pupose of this diff is to expose per user-call level precise timing of block read, so that we can answer questions like: a Get() costs me 100ms, is that somehow related to loading blocks from file system, or sth else? We will answer that with EXACTLY how many blocks have been read, how much time was spent on transfering the bytes from os, how much time was spent on checksum verification and how much time was spent on block decompression, just for that one Get. A nano second stopwatch was introduced to track time with higher precision. The cost/precision of the stopwatch is also measured in unit-test. On my dev box, retrieving one time instance costs about 30ns, on average. The deviation of timing results is good enough to track 100ns-1us level events. And the overhead could be safely ignored for 100us level events (10000 instances/s), for example, a viewstate thrift call.
Test Plan: perf_context_test, also testing with viewstate shadow traffic.
Reviewers: dhruba
Reviewed By: dhruba
CC: leveldb, xjin
Differential Revision: https://reviews.facebook.net/D12351
2013-06-04 08:09:15 +02:00
|
|
|
private:
|
|
|
|
Env* const env_;
|
|
|
|
uint64_t start_;
|
|
|
|
};
|
|
|
|
|
2013-10-04 06:49:15 +02:00
|
|
|
} // namespace rocksdb
|