mirror of https://gitee.com/bigwinds/arangodb
265 lines
8.5 KiB
C++
265 lines
8.5 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
/// DISCLAIMER
|
|
///
|
|
/// Copyright 2018 ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// Licensed under the Apache License, Version 2.0 (the "License");
|
|
/// you may not use this file except in compliance with the License.
|
|
/// You may obtain a copy of the License at
|
|
///
|
|
/// http://www.apache.org/licenses/LICENSE-2.0
|
|
///
|
|
/// Unless required by applicable law or agreed to in writing, software
|
|
/// distributed under the License is distributed on an "AS IS" BASIS,
|
|
/// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
/// See the License for the specific language governing permissions and
|
|
/// limitations under the License.
|
|
///
|
|
/// Copyright holder is ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// @author Tobias Goedderz
|
|
/// @author Michael Hackstein
|
|
/// @author Heiko Kernbach
|
|
/// @author Jan Christoph Uhde
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include "RowFetcherHelper.h"
|
|
|
|
#include "catch.hpp"
|
|
|
|
#include "Aql/AllRowsFetcher.h"
|
|
#include "Aql/AqlItemBlock.h"
|
|
#include "Aql/AqlItemMatrix.h"
|
|
#include "Aql/FilterExecutor.h"
|
|
#include "Aql/InputAqlItemRow.h"
|
|
#include "Aql/SingleRowFetcher.h"
|
|
#include "Aql/SortExecutor.h"
|
|
|
|
#include <velocypack/Buffer.h>
|
|
#include <velocypack/Iterator.h>
|
|
#include <velocypack/Slice.h>
|
|
#include <velocypack/velocypack-aliases.h>
|
|
|
|
using namespace arangodb;
|
|
using namespace arangodb::tests;
|
|
using namespace arangodb::tests::aql;
|
|
using namespace arangodb::aql;
|
|
|
|
namespace {
|
|
void VPackToAqlItemBlock(VPackSlice data, uint64_t nrRegs, AqlItemBlock& block) {
|
|
// coordinates in the matrix rowNr, entryNr
|
|
size_t rowIndex = 0;
|
|
RegisterId entry = 0;
|
|
for (auto const& row : VPackArrayIterator(data)) {
|
|
// Walk through the rows
|
|
REQUIRE(row.isArray());
|
|
REQUIRE(row.length() == nrRegs);
|
|
for (auto const& oneEntry : VPackArrayIterator(row)) {
|
|
// Walk through on row values
|
|
block.setValue(rowIndex, entry, AqlValue{oneEntry});
|
|
entry++;
|
|
}
|
|
rowIndex++;
|
|
entry = 0;
|
|
}
|
|
}
|
|
} // namespace
|
|
|
|
// -----------------------------------------
|
|
// - SECTION SINGLEROWFETCHER -
|
|
// -----------------------------------------
|
|
|
|
template <bool passBlocksThrough>
|
|
SingleRowFetcherHelper<passBlocksThrough>::SingleRowFetcherHelper(
|
|
std::shared_ptr<VPackBuffer<uint8_t>> vPackBuffer, bool returnsWaiting)
|
|
: SingleRowFetcher<passBlocksThrough>(),
|
|
_vPackBuffer(std::move(vPackBuffer)),
|
|
_returnsWaiting(returnsWaiting),
|
|
_nrItems(0),
|
|
_nrCalled(0),
|
|
_didWait(false),
|
|
_resourceMonitor(),
|
|
_itemBlockManager(&_resourceMonitor),
|
|
_itemBlock(nullptr),
|
|
_lastReturnedRow{CreateInvalidInputRowHint{}} {
|
|
if (_vPackBuffer != nullptr) {
|
|
_data = VPackSlice(_vPackBuffer->data());
|
|
} else {
|
|
_data = VPackSlice::nullSlice();
|
|
}
|
|
if (_data.isArray()) {
|
|
_nrItems = _data.length();
|
|
if (_nrItems > 0) {
|
|
VPackSlice oneRow = _data.at(0);
|
|
REQUIRE(oneRow.isArray());
|
|
uint64_t nrRegs = oneRow.length();
|
|
// Add all registers as valid input registers:
|
|
auto inputRegisters = std::make_shared<std::unordered_set<RegisterId>>();
|
|
for (RegisterId i = 0; i < nrRegs; i++) {
|
|
inputRegisters->emplace(i);
|
|
}
|
|
_itemBlock =
|
|
SharedAqlItemBlockPtr{new AqlItemBlock(_itemBlockManager, _nrItems, nrRegs)};
|
|
// std::make_unique<AqlItemBlock>(&_resourceMonitor, _nrItems, nrRegs);
|
|
VPackToAqlItemBlock(_data, nrRegs, *_itemBlock);
|
|
}
|
|
}
|
|
};
|
|
|
|
template <bool passBlocksThrough>
|
|
SingleRowFetcherHelper<passBlocksThrough>::~SingleRowFetcherHelper() = default;
|
|
|
|
template <bool passBlocksThrough>
|
|
// NOLINTNEXTLINE google-default-arguments
|
|
std::pair<ExecutionState, InputAqlItemRow> SingleRowFetcherHelper<passBlocksThrough>::fetchRow(size_t) {
|
|
// If this REQUIRE fails, the Executor has fetched more rows after DONE.
|
|
REQUIRE(_nrCalled <= _nrItems);
|
|
if (_returnsWaiting) {
|
|
if (!_didWait) {
|
|
_didWait = true;
|
|
// if once DONE is returned, always return DONE
|
|
if (_returnedDone) {
|
|
return {ExecutionState::DONE, InputAqlItemRow{CreateInvalidInputRowHint{}}};
|
|
}
|
|
return {ExecutionState::WAITING, InputAqlItemRow{CreateInvalidInputRowHint{}}};
|
|
}
|
|
_didWait = false;
|
|
}
|
|
_nrCalled++;
|
|
if (_nrCalled > _nrItems) {
|
|
_returnedDone = true;
|
|
return {ExecutionState::DONE, InputAqlItemRow{CreateInvalidInputRowHint{}}};
|
|
}
|
|
TRI_ASSERT(_itemBlock != nullptr);
|
|
_lastReturnedRow = InputAqlItemRow{_itemBlock, _nrCalled - 1};
|
|
ExecutionState state;
|
|
if (_nrCalled < _nrItems) {
|
|
state = ExecutionState::HASMORE;
|
|
} else {
|
|
_returnedDone = true;
|
|
state = ExecutionState::DONE;
|
|
}
|
|
return {state, _lastReturnedRow};
|
|
}
|
|
|
|
template <bool passBlocksThrough>
|
|
std::pair<ExecutionState, size_t> SingleRowFetcherHelper<passBlocksThrough>::skipRows(size_t const atMost) {
|
|
size_t skipped = 0;
|
|
ExecutionState state = ExecutionState::HASMORE;
|
|
|
|
while (atMost > skipped) {
|
|
std::tie(state, std::ignore) = fetchRow();
|
|
if (state == ExecutionState::WAITING) {
|
|
return {state, skipped};
|
|
}
|
|
++skipped;
|
|
if (state == ExecutionState::DONE) {
|
|
return {state, skipped};
|
|
}
|
|
}
|
|
|
|
return {state, skipped};
|
|
};
|
|
|
|
// -----------------------------------------
|
|
// - SECTION ALLROWSFETCHER -
|
|
// -----------------------------------------
|
|
|
|
AllRowsFetcherHelper::AllRowsFetcherHelper(std::shared_ptr<VPackBuffer<uint8_t>> vPackBuffer,
|
|
bool returnsWaiting)
|
|
: AllRowsFetcher(),
|
|
_vPackBuffer(std::move(vPackBuffer)),
|
|
_returnsWaiting(returnsWaiting),
|
|
_nrItems(0),
|
|
_nrRegs(0),
|
|
_nrCalled(0),
|
|
_resourceMonitor(),
|
|
_itemBlockManager(&_resourceMonitor),
|
|
_matrix(nullptr) {
|
|
if (_vPackBuffer != nullptr) {
|
|
_data = VPackSlice(_vPackBuffer->data());
|
|
} else {
|
|
_data = VPackSlice::nullSlice();
|
|
}
|
|
if (_data.isArray()) {
|
|
_nrItems = _data.length();
|
|
}
|
|
if (_nrItems > 0) {
|
|
VPackSlice oneRow = _data.at(0);
|
|
REQUIRE(oneRow.isArray());
|
|
_nrRegs = oneRow.length();
|
|
SharedAqlItemBlockPtr itemBlock{new AqlItemBlock(_itemBlockManager, _nrItems, _nrRegs)};
|
|
VPackToAqlItemBlock(_data, _nrRegs, *itemBlock);
|
|
// Add all registers as valid input registers:
|
|
auto inputRegisters = std::make_shared<std::unordered_set<RegisterId>>();
|
|
for (RegisterId i = 0; i < _nrRegs; i++) {
|
|
inputRegisters->emplace(i);
|
|
}
|
|
_matrix = std::make_unique<AqlItemMatrix>(_nrRegs);
|
|
_matrix->addBlock(itemBlock);
|
|
}
|
|
if (_matrix == nullptr) {
|
|
_matrix = std::make_unique<AqlItemMatrix>(_nrRegs);
|
|
}
|
|
}
|
|
|
|
AllRowsFetcherHelper::~AllRowsFetcherHelper() = default;
|
|
|
|
std::pair<ExecutionState, AqlItemMatrix const*> AllRowsFetcherHelper::fetchAllRows() {
|
|
// If this REQUIRE fails, a the Executor has fetched more rows after DONE.
|
|
REQUIRE(_nrCalled <= _nrItems + 1);
|
|
if (_returnsWaiting) {
|
|
if (_nrCalled < _nrItems || _nrCalled == 0) {
|
|
_nrCalled++;
|
|
// if once DONE is returned, always return DONE
|
|
if (_returnedDone) {
|
|
return {ExecutionState::DONE, nullptr};
|
|
}
|
|
// We will return waiting once for each item
|
|
return {ExecutionState::WAITING, nullptr};
|
|
}
|
|
} else {
|
|
REQUIRE(_nrCalled == 0);
|
|
}
|
|
_nrCalled++;
|
|
return {ExecutionState::DONE, _matrix.get()};
|
|
};
|
|
|
|
// -----------------------------------------
|
|
// - SECTION CONSTFETCHER -
|
|
// -----------------------------------------
|
|
|
|
ConstFetcherHelper::ConstFetcherHelper(AqlItemBlockManager& itemBlockManager,
|
|
std::shared_ptr<VPackBuffer<uint8_t>> vPackBuffer)
|
|
: ConstFetcher(), _vPackBuffer(std::move(vPackBuffer)) {
|
|
if (_vPackBuffer != nullptr) {
|
|
_data = VPackSlice(_vPackBuffer->data());
|
|
} else {
|
|
_data = VPackSlice::nullSlice();
|
|
}
|
|
if (_data.isArray()) {
|
|
auto nrItems = _data.length();
|
|
if (nrItems > 0) {
|
|
VPackSlice oneRow = _data.at(0);
|
|
REQUIRE(oneRow.isArray());
|
|
uint64_t nrRegs = oneRow.length();
|
|
auto inputRegisters = std::make_shared<std::unordered_set<RegisterId>>();
|
|
for (RegisterId i = 0; i < nrRegs; i++) {
|
|
inputRegisters->emplace(i);
|
|
}
|
|
SharedAqlItemBlockPtr block{new AqlItemBlock(itemBlockManager, nrItems, nrRegs)};
|
|
VPackToAqlItemBlock(_data, nrRegs, *block);
|
|
this->injectBlock(block);
|
|
}
|
|
}
|
|
};
|
|
|
|
ConstFetcherHelper::~ConstFetcherHelper() = default;
|
|
|
|
std::pair<ExecutionState, InputAqlItemRow> ConstFetcherHelper::fetchRow() {
|
|
return ConstFetcher::fetchRow();
|
|
};
|
|
|
|
template class ::arangodb::tests::aql::SingleRowFetcherHelper<false>;
|
|
template class ::arangodb::tests::aql::SingleRowFetcherHelper<true>;
|