#include /*#include #include */ #include #include namespace DB { void BlockStreamProfileInfo::read(ReadBuffer & in) { readVarUInt(rows, in); readVarUInt(blocks, in); readVarUInt(bytes, in); readBinary(applied_limit, in); readVarUInt(rows_before_limit, in); readBinary(calculated_rows_before_limit, in); } void BlockStreamProfileInfo::write(WriteBuffer & out) const { writeVarUInt(rows, out); writeVarUInt(blocks, out); writeVarUInt(bytes, out); writeBinary(hasAppliedLimit(), out); writeVarUInt(getRowsBeforeLimit(), out); writeBinary(calculated_rows_before_limit, out); } size_t BlockStreamProfileInfo::getRowsBeforeLimit() const { if (!calculated_rows_before_limit) calculateRowsBeforeLimit(); return rows_before_limit; } bool BlockStreamProfileInfo::hasAppliedLimit() const { if (!calculated_rows_before_limit) calculateRowsBeforeLimit(); return applied_limit; } void BlockStreamProfileInfo::update(Block & block) { ++blocks; rows += block.rowsInFirstColumn(); bytes += block.bytes(); if (column_names.empty()) column_names = block.dumpNames(); } void BlockStreamProfileInfo::collectInfosForStreamsWithName(const String & name, BlockStreamProfileInfos & res) const { if (stream_name == name) { res.push_back(this); return; } for (BlockStreamProfileInfos::const_iterator it = nested_infos.begin(); it != nested_infos.end(); ++it) (*it)->collectInfosForStreamsWithName(name, res); } void BlockStreamProfileInfo::calculateRowsBeforeLimit() const { calculated_rows_before_limit = true; /// есть ли Limit? BlockStreamProfileInfos limits; collectInfosForStreamsWithName("Limit", limits); if (limits.empty()) return; applied_limit = true; /** Берём количество строчек, прочитанных ниже PartialSorting-а, если есть, или ниже Limit-а. * Это нужно, потому что сортировка может вернуть только часть строк. */ BlockStreamProfileInfos partial_sortings; collectInfosForStreamsWithName("PartialSorting", partial_sortings); BlockStreamProfileInfos & limits_or_sortings = partial_sortings.empty() ? limits : partial_sortings; for (BlockStreamProfileInfos::const_iterator it = limits_or_sortings.begin(); it != limits_or_sortings.end(); ++it) for (BlockStreamProfileInfos::const_iterator jt = (*it)->nested_infos.begin(); jt != (*it)->nested_infos.end(); ++jt) rows_before_limit += (*jt)->rows; } Block IProfilingBlockInputStream::read() { if (!info.started) { info.total_stopwatch.start(); info.stream_name = getShortName(); for (BlockInputStreams::const_iterator it = children.begin(); it != children.end(); ++it) if (const IProfilingBlockInputStream * child = dynamic_cast(&**it)) info.nested_infos.push_back(&child->info); info.started = true; } Block res; if (is_cancelled) return res; res = readImpl(); /* if (res) { static Poco::FastMutex mutex; Poco::ScopedLock lock(mutex); std::cerr << std::endl; std::cerr << "[ " << Poco::ThreadNumber::get() << " ]\t" << getShortName() << std::endl; std::cerr << "[ " << Poco::ThreadNumber::get() << " ]\t"; for (size_t i = 0; i < res.columns(); ++i) { if (i != 0) std::cerr << ", "; std::cerr << res.getByPosition(i).name << " (" << res.getByPosition(i).column->size() << ")"; } std::cerr << std::endl; }*/ if (res) { info.update(res); if (enabled_extremes) updateExtremes(res); if (!checkLimits()) { res.clear(); return res; } if (quota != nullptr) checkQuota(res); } else { /** Если поток закончился, то ещё попросим всех детей прервать выполнение. * Это имеет смысл при выполнении запроса с LIMIT-ом: * - бывает ситуация, когда все необходимые данные уже прочитали, * но источники-дети ещё продолжают работать, * при чём они могут работать в отдельных потоках или даже удалённо. */ cancel(); } progress(res.rowsInFirstColumn(), res.bytes()); return res; } void IProfilingBlockInputStream::readSuffix() { for (BlockInputStreams::iterator it = children.begin(); it != children.end(); ++it) (*it)->readSuffix(); readSuffixImpl(); } void IProfilingBlockInputStream::updateExtremes(Block & block) { size_t columns = block.columns(); if (!extremes) { extremes = block.cloneEmpty(); for (size_t i = 0; i < columns; ++i) { Field min_value; Field max_value; block.getByPosition(i).column->getExtremes(min_value, max_value); ColumnPtr & column = extremes.getByPosition(i).column; if (column->isConst()) column = dynamic_cast(*column).convertToFullColumn(); column->insert(min_value); column->insert(max_value); } } else { for (size_t i = 0; i < columns; ++i) { ColumnPtr & column = extremes.getByPosition(i).column; Field min_value = (*column)[0]; Field max_value = (*column)[1]; Field cur_min_value; Field cur_max_value; block.getByPosition(i).column->getExtremes(cur_min_value, cur_max_value); if (cur_min_value < min_value) min_value = cur_min_value; if (cur_max_value > max_value) max_value = cur_max_value; column = column->cloneEmpty(); column->insert(min_value); column->insert(max_value); } } } bool IProfilingBlockInputStream::checkLimits() { /// Проверка ограничений. if ((limits.max_rows_to_read && info.rows > limits.max_rows_to_read) || (limits.max_bytes_to_read && info.bytes > limits.max_bytes_to_read)) { if (limits.read_overflow_mode == OverflowMode::THROW) throw Exception(std::string("Limit for ") + (limits.mode == LIMITS_CURRENT ? "result rows" : "rows to read") + " exceeded: read " + toString(info.rows) + " rows, maximum: " + toString(limits.max_rows_to_read), ErrorCodes::TOO_MUCH_ROWS); if (limits.read_overflow_mode == OverflowMode::BREAK) return false; throw Exception("Logical error: unknown overflow mode", ErrorCodes::LOGICAL_ERROR); } if (limits.max_execution_time != 0 && info.total_stopwatch.elapsed() > static_cast(limits.max_execution_time.totalMicroseconds()) * 1000) { if (limits.timeout_overflow_mode == OverflowMode::THROW) throw Exception("Timeout exceeded: elapsed " + toString(info.total_stopwatch.elapsedSeconds()) + " seconds, maximum: " + toString(limits.max_execution_time.totalMicroseconds() / 1000000.0), ErrorCodes::TIMEOUT_EXCEEDED); if (limits.timeout_overflow_mode == OverflowMode::BREAK) return false; throw Exception("Logical error: unknown overflow mode", ErrorCodes::LOGICAL_ERROR); } return true; } void IProfilingBlockInputStream::checkQuota(Block & block) { switch (limits.mode) { case LIMITS_TOTAL: /// Проверяется в методе progress. break; case LIMITS_CURRENT: { time_t current_time = time(0); double total_elapsed = info.total_stopwatch.elapsedSeconds(); quota->checkAndAddResultRowsBytes(current_time, block.rowsInFirstColumn(), block.bytes()); quota->checkAndAddExecutionTime(current_time, Poco::Timespan((total_elapsed - prev_elapsed) * 1000000.0)); prev_elapsed = total_elapsed; break; } default: throw Exception("Logical error: unknown limits mode.", ErrorCodes::LOGICAL_ERROR); } } void IProfilingBlockInputStream::progressImpl(size_t rows, size_t bytes) { /// Данные для прогресса берутся из листовых источников. if (children.empty()) { if (progress_callback) progress_callback(rows, bytes); if (process_list_elem) { if (!process_list_elem->update(rows, bytes)) cancel(); /// Общее количество данных, обработанных во всех листовых источниках, возможно, на удалённых серверах. size_t total_rows = process_list_elem->rows_processed; size_t total_bytes = process_list_elem->bytes_processed; /** Проверяем ограничения на объём данных для чтения, скорость выполнения запроса, квоту на объём данных для чтения. * NOTE: Может быть, имеет смысл сделать, чтобы они проверялись прямо в ProcessList? */ if (limits.mode == LIMITS_TOTAL && ((limits.max_rows_to_read && total_rows > limits.max_rows_to_read) || (limits.max_bytes_to_read && total_bytes > limits.max_bytes_to_read))) { if (limits.read_overflow_mode == OverflowMode::THROW) throw Exception("Limit for rows to read exceeded: read " + toString(total_rows) + " rows, maximum: " + toString(limits.max_rows_to_read), ErrorCodes::TOO_MUCH_ROWS); else if (limits.read_overflow_mode == OverflowMode::BREAK) cancel(); else throw Exception("Logical error: unknown overflow mode", ErrorCodes::LOGICAL_ERROR); } if (limits.min_execution_speed) { double total_elapsed = info.total_stopwatch.elapsedSeconds(); if (total_elapsed > limits.timeout_before_checking_execution_speed.totalMicroseconds() / 1000000.0 && total_rows / total_elapsed < limits.min_execution_speed) { throw Exception("Query is executing too slow: " + toString(total_rows / total_elapsed) + " rows/sec., minimum: " + toString(limits.min_execution_speed), ErrorCodes::TOO_SLOW); } } if (quota != nullptr && limits.mode == LIMITS_TOTAL) { quota->checkAndAddReadRowsBytes(time(0), rows, bytes); } } } } void IProfilingBlockInputStream::cancel() { if (!__sync_bool_compare_and_swap(&is_cancelled, false, true)) return; for (BlockInputStreams::iterator it = children.begin(); it != children.end(); ++it) if (IProfilingBlockInputStream * child = dynamic_cast(&**it)) child->cancel(); } void IProfilingBlockInputStream::setProgressCallback(ProgressCallback callback) { progress_callback = callback; for (BlockInputStreams::iterator it = children.begin(); it != children.end(); ++it) if (IProfilingBlockInputStream * child = dynamic_cast(&**it)) child->setProgressCallback(callback); } void IProfilingBlockInputStream::setProcessListElement(ProcessList::Element * elem) { process_list_elem = elem; for (BlockInputStreams::iterator it = children.begin(); it != children.end(); ++it) if (IProfilingBlockInputStream * child = dynamic_cast(&**it)) child->setProcessListElement(elem); } const Block & IProfilingBlockInputStream::getTotals() { if (totals) return totals; for (BlockInputStreams::iterator it = children.begin(); it != children.end(); ++it) { if (IProfilingBlockInputStream * child = dynamic_cast(&**it)) { const Block & res = child->getTotals(); if (res) return res; } } return totals; } const Block & IProfilingBlockInputStream::getExtremes() const { if (extremes) return extremes; for (BlockInputStreams::const_iterator it = children.begin(); it != children.end(); ++it) { if (const IProfilingBlockInputStream * child = dynamic_cast(&**it)) { const Block & res = child->getExtremes(); if (res) return res; } } return extremes; } }