ClickHouse/src/Interpreters/SystemLog.h

522 lines
16 KiB
C++
Raw Normal View History

2016-10-27 17:48:12 +00:00
#pragma once
#include <thread>
2019-03-21 19:22:38 +00:00
#include <atomic>
2020-04-13 01:33:05 +00:00
#include <memory>
#include <vector>
#include <condition_variable>
2016-10-27 17:48:12 +00:00
#include <boost/noncopyable.hpp>
#include <common/logger_useful.h>
#include <Core/Types.h>
#include <Core/Defines.h>
#include <Storages/IStorage.h>
#include <Interpreters/Context.h>
#include <Common/Stopwatch.h>
#include <Parsers/ASTCreateQuery.h>
#include <Parsers/parseQuery.h>
#include <Parsers/ParserCreateQuery.h>
#include <Parsers/ASTRenameQuery.h>
#include <Parsers/formatAST.h>
2019-10-07 14:18:18 +00:00
#include <Parsers/ASTIndexDeclaration.h>
#include <Parsers/ASTInsertQuery.h>
#include <Interpreters/InterpreterCreateQuery.h>
#include <Interpreters/InterpreterRenameQuery.h>
#include <Interpreters/InterpreterInsertQuery.h>
#include <Common/setThreadName.h>
#include <Common/ThreadPool.h>
2018-06-05 19:46:49 +00:00
#include <IO/WriteHelpers.h>
#include <Poco/Util/AbstractConfiguration.h>
2016-10-27 17:48:12 +00:00
namespace DB
{
/** Allow to store structured log in system table.
*
* Logging is asynchronous. Data is put into queue from where it will be read by separate thread.
* That thread inserts log into a table with no more than specified periodicity.
*/
/** Structure of log, template parameter.
* Structure could change on server version update.
* If on first write, existing table has different structure,
* then it get renamed (put aside) and new table is created.
*/
/* Example:
struct LogElement
{
/// default constructor must be available
/// fields
2016-10-27 17:48:12 +00:00
static std::string name();
static Block createBlock();
void appendToBlock(Block & block) const;
};
*/
2016-10-27 17:48:12 +00:00
namespace ErrorCodes
{
extern const int TIMEOUT_EXCEEDED;
}
2016-10-27 17:48:12 +00:00
#define DBMS_SYSTEM_LOG_QUEUE_SIZE 1048576
2016-10-27 17:48:12 +00:00
2020-04-13 01:33:05 +00:00
2016-10-27 17:48:12 +00:00
class Context;
2020-04-13 01:33:05 +00:00
class ISystemLog
{
public:
virtual String getName() = 0;
virtual ASTPtr getCreateTableQuery() = 0;
virtual void flush() = 0;
2020-04-19 23:11:41 +00:00
virtual void prepareTable() = 0;
virtual void startup() = 0;
2020-04-13 01:33:05 +00:00
virtual void shutdown() = 0;
virtual ~ISystemLog() = default;
};
/// System logs should be destroyed in destructor of the last Context and before tables,
/// because SystemLog destruction makes insert query while flushing data into underlying tables
struct SystemLogs
{
SystemLogs(Context & global_context, const Poco::Util::AbstractConfiguration & config);
~SystemLogs();
2019-06-21 17:25:47 +00:00
void shutdown();
2019-03-21 19:22:38 +00:00
std::shared_ptr<QueryLog> query_log; /// Used to log queries.
std::shared_ptr<QueryThreadLog> query_thread_log; /// Used to log query threads.
std::shared_ptr<PartLog> part_log; /// Used to log operations with parts
std::shared_ptr<TraceLog> trace_log; /// Used to log traces from query profiler
2019-08-04 15:51:04 +00:00
std::shared_ptr<TextLog> text_log; /// Used to log all text messages.
2019-08-13 14:31:46 +00:00
std::shared_ptr<MetricLog> metric_log; /// Used to log all metrics.
2020-04-13 01:33:05 +00:00
std::vector<ISystemLog *> logs;
};
2016-10-27 17:48:12 +00:00
template <typename LogElement>
2020-04-13 01:33:05 +00:00
class SystemLog : public ISystemLog, private boost::noncopyable
2016-10-27 17:48:12 +00:00
{
public:
using Self = SystemLog;
/** Parameter: table name where to write log.
* If table is not exists, then it get created with specified engine.
* If it already exists, then its structure is checked to be compatible with structure of log record.
* If it is compatible, then existing table will be used.
* If not - then existing table will be renamed to same name but with suffix '_N' at end,
* where N - is a minimal number from 1, for that table with corresponding name doesn't exist yet;
* and new table get created - as if previous table was not exist.
*/
SystemLog(
Context & context_,
const String & database_name_,
const String & table_name_,
const String & storage_def_,
2020-04-19 23:11:41 +00:00
size_t flush_interval_milliseconds_);
/** Append a record into log.
* Writing to table will be done asynchronously and in case of failure, record could be lost.
*/
void add(const LogElement & element);
2016-10-27 17:48:12 +00:00
2020-04-13 01:33:05 +00:00
void stopFlushThread();
/// Flush data in the buffer to disk
2020-04-13 01:33:05 +00:00
void flush() override;
2019-03-21 19:22:38 +00:00
2020-04-19 23:11:41 +00:00
/// Start the background thread.
void startup() override;
2019-03-21 19:22:38 +00:00
/// Stop the background flush thread before destructor. No more data will be written.
2020-04-13 01:33:05 +00:00
void shutdown() override
{
stopFlushThread();
}
String getName() override
{
return LogElement::name();
}
ASTPtr getCreateTableQuery() override;
protected:
Logger * log;
private:
/* Saving thread data */
Context & context;
2020-02-17 19:28:25 +00:00
const StorageID table_id;
const String storage_def;
StoragePtr table;
bool is_prepared = false;
const size_t flush_interval_milliseconds;
ThreadFromGlobalPool saving_thread;
/* Data shared between callers of add()/flush()/shutdown(), and the saving thread */
std::mutex mutex;
2020-02-09 14:15:29 +00:00
// Queue is bounded. But its size is quite large to not block in all normal cases.
std::vector<LogElement> queue;
// An always-incrementing index of the first message currently in the queue.
// We use it to give a global sequential index to every message, so that we
// can wait until a particular message is flushed. This is used to implement
// synchronous log flushing for SYSTEM FLUSH LOGS.
uint64_t queue_front_index = 0;
bool is_shutdown = false;
std::condition_variable flush_event;
// Requested to flush logs up to this index, exclusive
uint64_t requested_flush_before = 0;
// Flushed log up to this index, exclusive
uint64_t flushed_before = 0;
// Logged overflow message at this queue front index
uint64_t logged_queue_full_at_index = -1;
void savingThreadFunction();
/** Creates new table if it does not exist.
* Renames old table if its structure is not suitable.
* This cannot be done in constructor to avoid deadlock while renaming a table under locked Context when SystemLog object is created.
*/
2020-04-19 23:11:41 +00:00
void prepareTable() override;
2019-03-21 19:22:38 +00:00
/// flushImpl can be executed only in saving_thread.
void flushImpl(const std::vector<LogElement> & to_flush, uint64_t to_flush_end);
2016-10-27 17:48:12 +00:00
};
template <typename LogElement>
SystemLog<LogElement>::SystemLog(Context & context_,
const String & database_name_,
const String & table_name_,
const String & storage_def_,
2020-04-19 23:11:41 +00:00
size_t flush_interval_milliseconds_)
2020-02-17 19:28:25 +00:00
: context(context_)
, table_id(database_name_, table_name_)
, storage_def(storage_def_),
flush_interval_milliseconds(flush_interval_milliseconds_)
2016-10-27 17:48:12 +00:00
{
assert(database_name_ == DatabaseCatalog::SYSTEM_DATABASE);
2020-02-17 19:28:25 +00:00
log = &Logger::get("SystemLog (" + database_name_ + "." + table_name_ + ")");
2020-04-19 23:11:41 +00:00
}
2019-08-13 14:32:32 +00:00
2020-04-19 19:53:12 +00:00
2020-04-19 23:11:41 +00:00
template <typename LogElement>
void SystemLog<LogElement>::startup()
{
std::unique_lock lock(mutex);
saving_thread = ThreadFromGlobalPool([this] { savingThreadFunction(); });
2016-10-27 17:48:12 +00:00
}
template <typename LogElement>
void SystemLog<LogElement>::add(const LogElement & element)
{
/// Memory can be allocated while resizing on queue.push_back.
/// The size of allocation can be in order of a few megabytes.
/// But this should not be accounted for query memory usage.
/// Otherwise the tests like 01017_uniqCombined_memory_usage.sql will be flacky.
auto temporarily_disable_memory_tracker = getCurrentMemoryTrackerActionLock();
std::unique_lock lock(mutex);
if (is_shutdown)
return;
2020-02-14 13:09:51 +00:00
if (queue.size() == DBMS_SYSTEM_LOG_QUEUE_SIZE / 2)
{
// The queue more than half full, time to flush.
2020-02-14 13:09:51 +00:00
// We only check for strict equality, because messages are added one
// by one, under exclusive lock, so we will see each message count.
// It is enough to only wake the flushing thread once, after the message
// count increases past half available size.
const uint64_t queue_end = queue_front_index + queue.size();
if (requested_flush_before < queue_end)
requested_flush_before = queue_end;
flush_event.notify_all();
2020-02-14 13:09:51 +00:00
LOG_INFO(log, "Queue is half full for system log '" + demangle(typeid(*this).name()) + "'.");
}
if (queue.size() >= DBMS_SYSTEM_LOG_QUEUE_SIZE)
{
// Ignore all further entries until the queue is flushed.
// Log a message about that. Don't spam it -- this might be especially
// problematic in case of trace log. Remember what the front index of the
// queue was when we last logged the message. If it changed, it means the
// queue was flushed, and we can log again.
if (queue_front_index != logged_queue_full_at_index)
{
logged_queue_full_at_index = queue_front_index;
// TextLog sets its logger level to 0, so this log is a noop and
// there is no recursive logging.
LOG_ERROR(log, "Queue is full for system log '"
<< demangle(typeid(*this).name()) << "'"
<< " at " << queue_front_index);
}
return;
}
queue.push_back(element);
}
template <typename LogElement>
void SystemLog<LogElement>::flush()
{
std::unique_lock lock(mutex);
if (is_shutdown)
return;
const uint64_t queue_end = queue_front_index + queue.size();
if (requested_flush_before < queue_end)
{
requested_flush_before = queue_end;
2020-02-14 13:09:51 +00:00
flush_event.notify_all();
}
2020-02-14 13:09:51 +00:00
// Use an arbitrary timeout to avoid endless waiting.
const int timeout_seconds = 60;
bool result = flush_event.wait_for(lock, std::chrono::seconds(timeout_seconds),
[&] { return flushed_before >= queue_end; });
if (!result)
{
throw Exception("Timeout exceeded (" + toString(timeout_seconds) + " s) while flushing system log '" + demangle(typeid(*this).name()) + "'.",
ErrorCodes::TIMEOUT_EXCEEDED);
}
}
2016-10-27 17:48:12 +00:00
template <typename LogElement>
2020-04-13 01:33:05 +00:00
void SystemLog<LogElement>::stopFlushThread()
2016-10-27 17:48:12 +00:00
{
{
std::unique_lock lock(mutex);
if (!saving_thread.joinable())
{
return;
}
if (is_shutdown)
{
return;
}
is_shutdown = true;
/// Tell thread to shutdown.
flush_event.notify_all();
}
2019-03-21 19:22:38 +00:00
saving_thread.join();
2016-10-27 17:48:12 +00:00
}
template <typename LogElement>
void SystemLog<LogElement>::savingThreadFunction()
2016-10-27 17:48:12 +00:00
{
setThreadName("SystemLogFlush");
2020-02-14 13:09:51 +00:00
std::vector<LogElement> to_flush;
bool exit_this_thread = false;
while (!exit_this_thread)
{
try
{
// The end index (exclusive, like std end()) of the messages we are
// going to flush.
uint64_t to_flush_end = 0;
{
LOG_TRACE(log, "Sleeping");
std::unique_lock lock(mutex);
const bool predicate = flush_event.wait_for(lock,
std::chrono::milliseconds(flush_interval_milliseconds),
[&] () {
return requested_flush_before > flushed_before
|| is_shutdown;
}
);
queue_front_index += queue.size();
to_flush_end = queue_front_index;
2020-02-14 13:09:51 +00:00
// Swap with existing array from previous flush, to save memory
// allocations.
to_flush.resize(0);
queue.swap(to_flush);
exit_this_thread = is_shutdown;
LOG_TRACE(log, "Woke up"
<< (predicate ? " by condition" : " by timeout ("
+ toString(flush_interval_milliseconds) + " ms)")
<< ", " << to_flush.size() << " elements to flush"
<< " up to " << to_flush_end
<< (is_shutdown ? ", shutdown requested" : ""));
}
if (to_flush.empty())
{
continue;
}
flushImpl(to_flush, to_flush_end);
}
catch (...)
{
tryLogCurrentException(__PRETTY_FUNCTION__);
}
}
LOG_TRACE(log, "Terminating");
2016-10-27 17:48:12 +00:00
}
template <typename LogElement>
void SystemLog<LogElement>::flushImpl(const std::vector<LogElement> & to_flush, uint64_t to_flush_end)
2016-10-27 17:48:12 +00:00
{
try
{
LOG_TRACE(log, "Flushing system log, "
<< to_flush.size() << " entries to flush");
/// We check for existence of the table and create it as needed at every
/// flush. This is done to allow user to drop the table at any moment
/// (new empty table will be created automatically). BTW, flush method
/// is called from single thread.
prepareTable();
Block block = LogElement::createBlock();
for (const auto & elem : to_flush)
elem.appendToBlock(block);
/// We write to table indirectly, using InterpreterInsertQuery.
/// This is needed to support DEFAULT-columns in table.
std::unique_ptr<ASTInsertQuery> insert = std::make_unique<ASTInsertQuery>();
2020-03-02 20:23:58 +00:00
insert->table_id = table_id;
ASTPtr query_ptr(insert.release());
InterpreterInsertQuery interpreter(query_ptr, context);
BlockIO io = interpreter.execute();
io.out->writePrefix();
io.out->write(block);
io.out->writeSuffix();
}
catch (...)
{
tryLogCurrentException(__PRETTY_FUNCTION__);
}
{
std::unique_lock lock(mutex);
flushed_before = to_flush_end;
flush_event.notify_all();
}
LOG_TRACE(log, "Flushed system log");
2016-10-27 17:48:12 +00:00
}
template <typename LogElement>
void SystemLog<LogElement>::prepareTable()
{
2020-02-17 19:28:25 +00:00
String description = table_id.getNameForLogs();
2020-02-17 19:28:25 +00:00
table = DatabaseCatalog::instance().tryGetTable(table_id);
if (table)
{
const Block expected = LogElement::createBlock();
const Block actual = table->getSampleBlockNonMaterialized();
if (!blocksHaveEqualStructure(actual, expected))
{
2017-06-02 21:37:28 +00:00
/// Rename the existing table.
int suffix = 0;
2020-03-13 15:41:36 +00:00
while (DatabaseCatalog::instance().isTableExist({table_id.database_name, table_id.table_name + "_" + toString(suffix)}))
++suffix;
auto rename = std::make_shared<ASTRenameQuery>();
ASTRenameQuery::Table from;
2020-02-17 19:28:25 +00:00
from.database = table_id.database_name;
from.table = table_id.table_name;
ASTRenameQuery::Table to;
2020-02-17 19:28:25 +00:00
to.database = table_id.database_name;
to.table = table_id.table_name + "_" + toString(suffix);
ASTRenameQuery::Element elem;
elem.from = from;
elem.to = to;
rename->elements.emplace_back(elem);
LOG_DEBUG(log, "Existing table " << description << " for system log has obsolete or different structure."
2020-04-13 01:33:05 +00:00
" Renaming it to " << backQuoteIfNeed(to.table));
InterpreterRenameQuery(rename, context).execute();
2017-06-02 21:37:28 +00:00
/// The required table will be created.
table = nullptr;
}
else if (!is_prepared)
LOG_DEBUG(log, "Will use existing table " << description << " for " + LogElement::name());
}
if (!table)
{
2017-06-02 21:37:28 +00:00
/// Create the table.
LOG_DEBUG(log, "Creating new table " << description << " for " + LogElement::name());
2020-04-13 01:33:05 +00:00
auto create = getCreateTableQuery();
InterpreterCreateQuery interpreter(create, context);
interpreter.setInternal(true);
interpreter.execute();
2020-02-17 19:28:25 +00:00
table = DatabaseCatalog::instance().getTable(table_id);
}
is_prepared = true;
}
2020-04-13 01:33:05 +00:00
template <typename LogElement>
ASTPtr SystemLog<LogElement>::getCreateTableQuery()
{
auto create = std::make_shared<ASTCreateQuery>();
create->database = table_id.database_name;
create->table = table_id.table_name;
Block sample = LogElement::createBlock();
auto new_columns_list = std::make_shared<ASTColumns>();
new_columns_list->set(new_columns_list->columns, InterpreterCreateQuery::formatColumns(sample.getNamesAndTypesList()));
create->set(create->columns_list, new_columns_list);
ParserStorage storage_parser;
ASTPtr storage_ast = parseQuery(
storage_parser, storage_def.data(), storage_def.data() + storage_def.size(),
"Storage to create table for " + LogElement::name(), 0, DBMS_DEFAULT_MAX_PARSER_DEPTH);
2020-04-13 01:33:05 +00:00
create->set(create->storage, storage_ast);
return create;
}
2016-10-27 17:48:12 +00:00
}