#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(ARCADIA_BUILD) # include "config_core.h" #endif #if USE_JEMALLOC # include #endif namespace CurrentMetrics { extern const Metric MemoryTracking; } namespace DB { AsynchronousMetrics::~AsynchronousMetrics() { try { { std::lock_guard lock{mutex}; quit = true; } wait_cond.notify_one(); thread.join(); } catch (...) { DB::tryLogCurrentException(__PRETTY_FUNCTION__); } } AsynchronousMetricValues AsynchronousMetrics::getValues() const { std::lock_guard lock{mutex}; return values; } static auto get_next_update_time(std::chrono::seconds update_period) { using namespace std::chrono; const auto now = time_point_cast(system_clock::now()); // Use seconds since the start of the hour, because we don't know when // the epoch started, maybe on some weird fractional time. const auto start_of_hour = time_point_cast(time_point_cast(now)); const auto seconds_passed = now - start_of_hour; // Rotate time forward by half a period -- e.g. if a period is a minute, // we'll collect metrics on start of minute + 30 seconds. This is to // achieve temporal separation with MetricTransmitter. Don't forget to // rotate it back. const auto rotation = update_period / 2; const auto periods_passed = (seconds_passed + rotation) / update_period; const auto seconds_next = (periods_passed + 1) * update_period - rotation; const auto time_next = start_of_hour + seconds_next; return time_next; } void AsynchronousMetrics::run() { setThreadName("AsyncMetrics"); while (true) { { // Wait first, so that the first metric collection is also on even time. std::unique_lock lock{mutex}; if (wait_cond.wait_until(lock, get_next_update_time(update_period), [this] { return quit; })) { break; } } try { update(); } catch (...) { tryLogCurrentException(__PRETTY_FUNCTION__); } } } template static void calculateMax(Max & max, T x) { if (Max(x) > max) max = x; } template static void calculateMaxAndSum(Max & max, Sum & sum, T x) { sum += x; if (Max(x) > max) max = x; } #if USE_JEMALLOC && JEMALLOC_VERSION_MAJOR >= 4 uint64_t updateJemallocEpoch() { uint64_t value = 0; size_t size = sizeof(value); mallctl("epoch", &value, &size, &value, size); return value; } template static void saveJemallocMetricImpl(AsynchronousMetricValues & values, const std::string & jemalloc_full_name, const std::string & clickhouse_full_name) { Value value{}; size_t size = sizeof(value); mallctl(jemalloc_full_name.c_str(), &value, &size, nullptr, 0); values[clickhouse_full_name] = value; } template static void saveJemallocMetric(AsynchronousMetricValues & values, const std::string & metric_name) { saveJemallocMetricImpl(values, fmt::format("stats.{}", metric_name), fmt::format("jemalloc.{}", metric_name)); } template static void saveAllArenasMetric(AsynchronousMetricValues & values, const std::string & metric_name) { saveJemallocMetricImpl(values, fmt::format("stats.arenas.{}.{}", MALLCTL_ARENAS_ALL, metric_name), fmt::format("jemalloc.arenas.all.{}", metric_name)); } #endif void AsynchronousMetrics::update() { AsynchronousMetricValues new_values; { if (auto mark_cache = context.getMarkCache()) { new_values["MarkCacheBytes"] = mark_cache->weight(); new_values["MarkCacheFiles"] = mark_cache->count(); } } { if (auto uncompressed_cache = context.getUncompressedCache()) { new_values["UncompressedCacheBytes"] = uncompressed_cache->weight(); new_values["UncompressedCacheCells"] = uncompressed_cache->count(); } } #if USE_EMBEDDED_COMPILER { if (auto compiled_expression_cache = context.getCompiledExpressionCache()) new_values["CompiledExpressionCacheCount"] = compiled_expression_cache->count(); } #endif new_values["Uptime"] = context.getUptimeSeconds(); /// Process memory usage according to OS #if defined(OS_LINUX) { MemoryStatisticsOS::Data data = memory_stat.get(); new_values["MemoryVirtual"] = data.virt; new_values["MemoryResident"] = data.resident; new_values["MemoryShared"] = data.shared; new_values["MemoryCode"] = data.code; new_values["MemoryDataAndStack"] = data.data_and_stack; /// We must update the value of total_memory_tracker periodically. /// Otherwise it might be calculated incorrectly - it can include a "drift" of memory amount. /// See https://github.com/ClickHouse/ClickHouse/issues/10293 { Int64 amount = total_memory_tracker.get(); Int64 peak = total_memory_tracker.getPeak(); Int64 new_peak = data.resident; LOG_DEBUG(&Poco::Logger::get("AsynchronousMetrics"), "MemoryTracking: was {}, peak {}, will set to {} (RSS), difference: {}", ReadableSize(amount), ReadableSize(peak), ReadableSize(new_peak), ReadableSize(new_peak - peak) ); total_memory_tracker.set(new_peak); CurrentMetrics::set(CurrentMetrics::MemoryTracking, new_peak); } } #endif { auto databases = DatabaseCatalog::instance().getDatabases(); size_t max_queue_size = 0; size_t max_inserts_in_queue = 0; size_t max_merges_in_queue = 0; size_t sum_queue_size = 0; size_t sum_inserts_in_queue = 0; size_t sum_merges_in_queue = 0; size_t max_absolute_delay = 0; size_t max_relative_delay = 0; size_t max_part_count_for_partition = 0; size_t number_of_databases = databases.size(); size_t total_number_of_tables = 0; for (const auto & db : databases) { /// Check if database can contain MergeTree tables if (!db.second->canContainMergeTreeTables()) continue; for (auto iterator = db.second->getTablesIterator(context); iterator->isValid(); iterator->next()) { ++total_number_of_tables; const auto & table = iterator->table(); if (!table) continue; StorageMergeTree * table_merge_tree = dynamic_cast(table.get()); StorageReplicatedMergeTree * table_replicated_merge_tree = dynamic_cast(table.get()); if (table_replicated_merge_tree) { StorageReplicatedMergeTree::Status status; table_replicated_merge_tree->getStatus(status, false); calculateMaxAndSum(max_queue_size, sum_queue_size, status.queue.queue_size); calculateMaxAndSum(max_inserts_in_queue, sum_inserts_in_queue, status.queue.inserts_in_queue); calculateMaxAndSum(max_merges_in_queue, sum_merges_in_queue, status.queue.merges_in_queue); if (!status.is_readonly) { try { time_t absolute_delay = 0; time_t relative_delay = 0; table_replicated_merge_tree->getReplicaDelays(absolute_delay, relative_delay); calculateMax(max_absolute_delay, absolute_delay); calculateMax(max_relative_delay, relative_delay); } catch (...) { tryLogCurrentException(__PRETTY_FUNCTION__, "Cannot get replica delay for table: " + backQuoteIfNeed(db.first) + "." + backQuoteIfNeed(iterator->name())); } } calculateMax(max_part_count_for_partition, table_replicated_merge_tree->getMaxPartsCountForPartition()); } if (table_merge_tree) { calculateMax(max_part_count_for_partition, table_merge_tree->getMaxPartsCountForPartition()); } } } new_values["ReplicasMaxQueueSize"] = max_queue_size; new_values["ReplicasMaxInsertsInQueue"] = max_inserts_in_queue; new_values["ReplicasMaxMergesInQueue"] = max_merges_in_queue; new_values["ReplicasSumQueueSize"] = sum_queue_size; new_values["ReplicasSumInsertsInQueue"] = sum_inserts_in_queue; new_values["ReplicasSumMergesInQueue"] = sum_merges_in_queue; new_values["ReplicasMaxAbsoluteDelay"] = max_absolute_delay; new_values["ReplicasMaxRelativeDelay"] = max_relative_delay; new_values["MaxPartCountForPartition"] = max_part_count_for_partition; new_values["NumberOfDatabases"] = number_of_databases; new_values["NumberOfTables"] = total_number_of_tables; } #if USE_JEMALLOC && JEMALLOC_VERSION_MAJOR >= 4 // 'epoch' is a special mallctl -- it updates the statistics. Without it, all // the following calls will return stale values. It increments and returns // the current epoch number, which might be useful to log as a sanity check. auto epoch = updateJemallocEpoch(); new_values["jemalloc.epoch"] = epoch; // Collect the statistics themselves. saveJemallocMetric(new_values, "allocated"); saveJemallocMetric(new_values, "active"); saveJemallocMetric(new_values, "metadata"); saveJemallocMetric(new_values, "metadata_thp"); saveJemallocMetric(new_values, "resident"); saveJemallocMetric(new_values, "mapped"); saveJemallocMetric(new_values, "retained"); saveJemallocMetric(new_values, "background_thread.num_threads"); saveJemallocMetric(new_values, "background_thread.num_runs"); saveJemallocMetric(new_values, "background_thread.run_intervals"); saveAllArenasMetric(new_values, "pactive"); saveAllArenasMetric(new_values, "pdirty"); saveAllArenasMetric(new_values, "pmuzzy"); saveAllArenasMetric(new_values, "dirty_purged"); saveAllArenasMetric(new_values, "muzzy_purged"); #endif #if defined(OS_LINUX) // Try to add processor frequencies, ignoring errors. try { ReadBufferFromFile buf("/proc/cpuinfo", 32768 /* buf_size */); // We need the following lines: // processor : 4 // cpu MHz : 4052.941 // They contain tabs and are interspersed with other info. int core_id = 0; while (!buf.eof()) { std::string s; // We don't have any backslash escape sequences in /proc/cpuinfo, so // this function will read the line until EOL, which is exactly what // we need. readEscapedStringUntilEOL(s, buf); // It doesn't read the EOL itself. ++buf.position(); if (s.rfind("processor", 0) == 0) { if (auto colon = s.find_first_of(':')) { core_id = std::stoi(s.substr(colon + 2)); } } else if (s.rfind("cpu MHz", 0) == 0) { if (auto colon = s.find_first_of(':')) { auto mhz = std::stod(s.substr(colon + 2)); new_values[fmt::format("CPUFrequencyMHz_{}", core_id)] = mhz; } } } } catch (...) { tryLogCurrentException(__PRETTY_FUNCTION__); } #endif /// Add more metrics as you wish. // Log the new metrics. if (auto log = context.getAsynchronousMetricLog()) { log->addValues(new_values); } // Finally, update the current metrics. std::lock_guard lock(mutex); values = new_values; } }