mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-12-16 11:22:12 +00:00
134 lines
4.3 KiB
C++
134 lines
4.3 KiB
C++
#pragma once
|
|
|
|
#include <vector>
|
|
#include <memory>
|
|
#include <mutex>
|
|
#include <shared_mutex>
|
|
#include <functional>
|
|
#include <boost/noncopyable.hpp>
|
|
#include <Core/Block.h>
|
|
#include <Core/SortDescription.h>
|
|
|
|
|
|
namespace DB
|
|
{
|
|
|
|
|
|
class IBlockInputStream;
|
|
|
|
using BlockInputStreamPtr = std::shared_ptr<IBlockInputStream>;
|
|
using BlockInputStreams = std::vector<BlockInputStreamPtr>;
|
|
|
|
class TableStructureReadLock;
|
|
|
|
using TableStructureReadLockPtr = std::shared_ptr<TableStructureReadLock>;
|
|
using TableStructureReadLocks = std::vector<TableStructureReadLockPtr>;
|
|
using TableStructureReadLocksList = std::list<TableStructureReadLockPtr>;
|
|
|
|
struct Progress;
|
|
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int OUTPUT_IS_NOT_SORTED;
|
|
extern const int NOT_IMPLEMENTED;
|
|
}
|
|
|
|
|
|
/** Callback to track the progress of the query.
|
|
* Used in IProfilingBlockInputStream and Context.
|
|
* The function takes the number of rows in the last block, the number of bytes in the last block.
|
|
* Note that the callback can be called from different threads.
|
|
*/
|
|
using ProgressCallback = std::function<void(const Progress & progress)>;
|
|
|
|
|
|
/** The stream interface for reading data by blocks from the database.
|
|
* Relational operations are supposed to be done also as implementations of this interface.
|
|
*/
|
|
class IBlockInputStream : private boost::noncopyable
|
|
{
|
|
public:
|
|
IBlockInputStream() {}
|
|
|
|
/** Get data structure of the stream in a form of "header" block (it is also called "sample block").
|
|
* Header block contains column names, data types, columns of size 0. Constant columns must have corresponding values.
|
|
* It is guaranteed that method "read" returns blocks of exactly that structure.
|
|
*/
|
|
virtual Block getHeader() const = 0;
|
|
|
|
/** Read next block.
|
|
* If there are no more blocks, return an empty block (for which operator `bool` returns false).
|
|
* NOTE: Only one thread can read from one instance of IBlockInputStream simultaneously.
|
|
* This also applies for readPrefix, readSuffix.
|
|
*/
|
|
virtual Block read() = 0;
|
|
|
|
/** Get information about the last block received.
|
|
*/
|
|
virtual BlockExtraInfo getBlockExtraInfo() const
|
|
{
|
|
throw Exception("Method getBlockExtraInfo is not supported by the data stream " + getName(), ErrorCodes::NOT_IMPLEMENTED);
|
|
}
|
|
|
|
/** Read something before starting all data or after the end of all data.
|
|
* In the `readSuffix` function, you can implement a finalization that can lead to an exception.
|
|
* readPrefix() must be called before the first call to read().
|
|
* readSuffix() should be called after read() returns an empty block, or after a call to cancel(), but not during read() execution.
|
|
*/
|
|
virtual void readPrefix() {}
|
|
virtual void readSuffix() {}
|
|
|
|
virtual ~IBlockInputStream() {}
|
|
|
|
/** To output the data stream transformation tree (query execution plan).
|
|
*/
|
|
virtual String getName() const = 0;
|
|
|
|
/// If this stream generates data in order by some keys, return true.
|
|
virtual bool isSortedOutput() const { return false; }
|
|
/// In case of isSortedOutput, return corresponding SortDescription
|
|
virtual const SortDescription & getSortDescription() const { throw Exception("Output of " + getName() + " is not sorted", ErrorCodes::OUTPUT_IS_NOT_SORTED); }
|
|
|
|
/** Must be called before read, readPrefix.
|
|
*/
|
|
void dumpTree(std::ostream & ostr, size_t indent = 0, size_t multiplier = 1);
|
|
|
|
/** Check the depth of the pipeline.
|
|
* If max_depth is specified and the `depth` is greater - throw an exception.
|
|
* Must be called before read, readPrefix.
|
|
*/
|
|
size_t checkDepth(size_t max_depth) const;
|
|
|
|
/** Do not allow to change the table while the blocks stream is alive.
|
|
*/
|
|
void addTableLock(const TableStructureReadLockPtr & lock) { table_locks.push_back(lock); }
|
|
|
|
|
|
template <typename F>
|
|
void forEachChild(F && f)
|
|
{
|
|
/// NOTE: Acquire a read lock, therefore f() should be thread safe
|
|
std::shared_lock lock(children_mutex);
|
|
|
|
for (auto & child : children)
|
|
if (f(*child))
|
|
return;
|
|
}
|
|
|
|
protected:
|
|
BlockInputStreams children;
|
|
std::shared_mutex children_mutex;
|
|
|
|
private:
|
|
TableStructureReadLocks table_locks;
|
|
|
|
size_t checkDepthImpl(size_t max_depth, size_t level) const;
|
|
|
|
/// Get text with names of this source and the entire subtree.
|
|
String getTreeID() const;
|
|
};
|
|
|
|
|
|
}
|
|
|