|
|
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
|
|
|
// This source code is licensed under the BSD-style license found in the
|
|
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
// This source code is also licensed under the GPLv2 license found in the
|
|
|
|
// COPYING file in the root directory of this source tree.
|
|
|
|
//
|
|
|
|
|
|
|
|
#include <sstream>
|
|
|
|
#include "monitoring/perf_context_imp.h"
|
|
|
|
#include "util/thread_local.h"
|
[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
12 years ago
|
|
|
|
|
|
|
namespace rocksdb {
|
[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
12 years ago
|
|
|
|
|
|
|
#ifdef NPERF_CONTEXT
|
|
|
|
PerfContext perf_context;
|
|
|
|
#else
|
|
|
|
ThreadLocalPtr perf_context([](void* ptr) {
|
|
|
|
auto* p = static_cast<PerfContext*>(ptr);
|
|
|
|
delete p;
|
|
|
|
});
|
|
|
|
#endif
|
[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
12 years ago
|
|
|
|
|
|
|
PerfContext* get_perf_context() {
|
|
|
|
#ifdef NPERF_CONTEXT
|
|
|
|
return &perf_context;
|
|
|
|
#else
|
|
|
|
if (perf_context.Get() == nullptr) {
|
|
|
|
perf_context.Reset(static_cast<void*>(new PerfContext()));
|
|
|
|
}
|
|
|
|
return static_cast<PerfContext*>(perf_context.Get());
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
[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
12 years ago
|
|
|
void PerfContext::Reset() {
|
|
|
|
#ifndef NPERF_CONTEXT
|
[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
12 years ago
|
|
|
user_key_comparison_count = 0;
|
|
|
|
block_cache_hit_count = 0;
|
|
|
|
block_read_count = 0;
|
|
|
|
block_read_byte = 0;
|
|
|
|
block_read_time = 0;
|
|
|
|
block_checksum_time = 0;
|
|
|
|
block_decompress_time = 0;
|
|
|
|
internal_key_skipped_count = 0;
|
|
|
|
internal_delete_skipped_count = 0;
|
|
|
|
internal_recent_skipped_count = 0;
|
|
|
|
internal_merge_count = 0;
|
|
|
|
write_wal_time = 0;
|
|
|
|
|
|
|
|
get_snapshot_time = 0;
|
|
|
|
get_from_memtable_time = 0;
|
|
|
|
get_from_memtable_count = 0;
|
|
|
|
get_post_process_time = 0;
|
|
|
|
get_from_output_files_time = 0;
|
|
|
|
seek_on_memtable_time = 0;
|
|
|
|
seek_on_memtable_count = 0;
|
|
|
|
next_on_memtable_count = 0;
|
|
|
|
prev_on_memtable_count = 0;
|
|
|
|
seek_child_seek_time = 0;
|
|
|
|
seek_child_seek_count = 0;
|
|
|
|
seek_min_heap_time = 0;
|
|
|
|
seek_internal_seek_time = 0;
|
|
|
|
find_next_user_entry_time = 0;
|
|
|
|
write_pre_and_post_process_time = 0;
|
|
|
|
write_memtable_time = 0;
|
|
|
|
write_delay_time = 0;
|
|
|
|
db_mutex_lock_nanos = 0;
|
|
|
|
db_condition_wait_nanos = 0;
|
|
|
|
merge_operator_time_nanos = 0;
|
|
|
|
read_index_block_nanos = 0;
|
|
|
|
read_filter_block_nanos = 0;
|
|
|
|
new_table_block_iter_nanos = 0;
|
|
|
|
new_table_iterator_nanos = 0;
|
|
|
|
block_seek_nanos = 0;
|
|
|
|
find_table_nanos = 0;
|
|
|
|
bloom_memtable_hit_count = 0;
|
|
|
|
bloom_memtable_miss_count = 0;
|
|
|
|
bloom_sst_hit_count = 0;
|
|
|
|
bloom_sst_miss_count = 0;
|
|
|
|
|
|
|
|
env_new_sequential_file_nanos = 0;
|
|
|
|
env_new_random_access_file_nanos = 0;
|
|
|
|
env_new_writable_file_nanos = 0;
|
|
|
|
env_reuse_writable_file_nanos = 0;
|
|
|
|
env_new_random_rw_file_nanos = 0;
|
|
|
|
env_new_directory_nanos = 0;
|
|
|
|
env_file_exists_nanos = 0;
|
|
|
|
env_get_children_nanos = 0;
|
|
|
|
env_get_children_file_attributes_nanos = 0;
|
|
|
|
env_delete_file_nanos = 0;
|
|
|
|
env_create_dir_nanos = 0;
|
|
|
|
env_create_dir_if_missing_nanos = 0;
|
|
|
|
env_delete_dir_nanos = 0;
|
|
|
|
env_get_file_size_nanos = 0;
|
|
|
|
env_get_file_modification_time_nanos = 0;
|
|
|
|
env_rename_file_nanos = 0;
|
|
|
|
env_link_file_nanos = 0;
|
|
|
|
env_lock_file_nanos = 0;
|
|
|
|
env_unlock_file_nanos = 0;
|
|
|
|
env_new_logger_nanos = 0;
|
|
|
|
#endif
|
[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
12 years ago
|
|
|
}
|
|
|
|
|
|
|
|
#define PERF_CONTEXT_OUTPUT(counter) \
|
|
|
|
if (!exclude_zero_counters || (counter > 0)) { \
|
|
|
|
ss << #counter << " = " << counter << ", "; \
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string PerfContext::ToString(bool exclude_zero_counters) const {
|
|
|
|
#ifdef NPERF_CONTEXT
|
|
|
|
return "";
|
|
|
|
#else
|
|
|
|
std::ostringstream ss;
|
|
|
|
PERF_CONTEXT_OUTPUT(user_key_comparison_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(block_cache_hit_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(block_read_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(block_read_byte);
|
|
|
|
PERF_CONTEXT_OUTPUT(block_read_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(block_checksum_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(block_decompress_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(internal_key_skipped_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(internal_delete_skipped_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(internal_recent_skipped_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(internal_merge_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(write_wal_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(get_snapshot_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(get_from_memtable_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(get_from_memtable_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(get_post_process_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(get_from_output_files_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(seek_on_memtable_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(seek_on_memtable_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(next_on_memtable_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(prev_on_memtable_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(seek_child_seek_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(seek_child_seek_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(seek_min_heap_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(seek_internal_seek_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(find_next_user_entry_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(write_pre_and_post_process_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(write_memtable_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(db_mutex_lock_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(db_condition_wait_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(merge_operator_time_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(write_delay_time);
|
|
|
|
PERF_CONTEXT_OUTPUT(read_index_block_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(read_filter_block_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(new_table_block_iter_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(new_table_iterator_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(block_seek_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(find_table_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(bloom_memtable_hit_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(bloom_memtable_miss_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(bloom_sst_hit_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(bloom_sst_miss_count);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_new_sequential_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_new_random_access_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_new_writable_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_reuse_writable_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_new_random_rw_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_new_directory_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_file_exists_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_get_children_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_get_children_file_attributes_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_delete_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_create_dir_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_create_dir_if_missing_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_delete_dir_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_get_file_size_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_get_file_modification_time_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_rename_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_link_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_lock_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_unlock_file_nanos);
|
|
|
|
PERF_CONTEXT_OUTPUT(env_new_logger_nanos);
|
|
|
|
return ss.str();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
[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
12 years ago
|
|
|
}
|