mirror of https://gitee.com/bigwinds/arangodb
232 lines
7.1 KiB
C++
232 lines
7.1 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 Gödderz
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include "DependencyProxy.h"
|
|
|
|
using namespace arangodb::aql;
|
|
|
|
template <bool passBlocksThrough>
|
|
ExecutionState DependencyProxy<passBlocksThrough>::prefetchBlock(size_t atMost) {
|
|
TRI_ASSERT(atMost > 0);
|
|
ExecutionState state;
|
|
SharedAqlItemBlockPtr block;
|
|
do {
|
|
// Note: upstreamBlock will return next dependency
|
|
// if we need to loop here
|
|
std::tie(state, block) = upstreamBlock().getSome(atMost);
|
|
TRI_IF_FAILURE("ExecutionBlock::getBlock") {
|
|
THROW_ARANGO_EXCEPTION(TRI_ERROR_DEBUG);
|
|
}
|
|
|
|
if (state == ExecutionState::WAITING) {
|
|
TRI_ASSERT(block == nullptr);
|
|
return state;
|
|
}
|
|
|
|
if (block == nullptr) {
|
|
// We're not waiting and didn't get a block, so we have to be done.
|
|
TRI_ASSERT(state == ExecutionState::DONE);
|
|
if (!advanceDependency()) {
|
|
return state;
|
|
}
|
|
}
|
|
} while (block == nullptr);
|
|
|
|
// Now we definitely have a block.
|
|
TRI_ASSERT(block != nullptr);
|
|
|
|
if (state == ExecutionState::DONE) {
|
|
// We need to modify the state here s.t. on next call we fetch from
|
|
// next dependency and do not return DONE on first dependency
|
|
if (advanceDependency()) {
|
|
state = ExecutionState::HASMORE;
|
|
}
|
|
}
|
|
if /* constexpr */ (passBlocksThrough) {
|
|
// Reposit block for pass-through executors.
|
|
_blockPassThroughQueue.push_back({state, block});
|
|
}
|
|
_blockQueue.push_back({state, std::move(block)});
|
|
|
|
return ExecutionState::HASMORE;
|
|
}
|
|
|
|
template <bool passBlocksThrough>
|
|
std::pair<ExecutionState, SharedAqlItemBlockPtr>
|
|
// NOLINTNEXTLINE google-default-arguments
|
|
DependencyProxy<passBlocksThrough>::fetchBlock(size_t atMost) {
|
|
if (_blockQueue.empty()) {
|
|
ExecutionState state = prefetchBlock(atMost);
|
|
// prefetchBlock returns HASMORE iff it pushed a block onto _blockQueue.
|
|
// If it didn't, it got either WAITING from upstream, or DONE + nullptr.
|
|
if (state == ExecutionState::WAITING || state == ExecutionState::DONE) {
|
|
return {state, nullptr};
|
|
}
|
|
TRI_ASSERT(state == ExecutionState::HASMORE);
|
|
}
|
|
|
|
TRI_ASSERT(!_blockQueue.empty());
|
|
|
|
ExecutionState state;
|
|
SharedAqlItemBlockPtr block;
|
|
std::tie(state, block) = _blockQueue.front();
|
|
_blockQueue.pop_front();
|
|
|
|
return {state, std::move(block)};
|
|
}
|
|
|
|
template <bool passBlocksThrough>
|
|
std::pair<ExecutionState, SharedAqlItemBlockPtr>
|
|
// NOLINTNEXTLINE google-default-arguments
|
|
DependencyProxy<passBlocksThrough>::fetchBlockForDependency(size_t dependency, size_t atMost) {
|
|
TRI_ASSERT(!passBlocksThrough);
|
|
ExecutionBlock& upstream = upstreamBlockForDependency(dependency);
|
|
|
|
TRI_ASSERT(atMost > 0);
|
|
ExecutionState state;
|
|
SharedAqlItemBlockPtr block;
|
|
std::tie(state, block) = upstream.getSome(atMost);
|
|
TRI_IF_FAILURE("ExecutionBlock::getBlock") {
|
|
THROW_ARANGO_EXCEPTION(TRI_ERROR_DEBUG);
|
|
}
|
|
|
|
if (state == ExecutionState::WAITING) {
|
|
TRI_ASSERT(block == nullptr);
|
|
return {state, nullptr};
|
|
}
|
|
|
|
if (block == nullptr) {
|
|
// We're not waiting and didn't get a block, so we have to be done.
|
|
TRI_ASSERT(state == ExecutionState::DONE);
|
|
return {state, nullptr};
|
|
}
|
|
|
|
// Now we definitely have a block.
|
|
TRI_ASSERT(block != nullptr);
|
|
|
|
return {state, block};
|
|
}
|
|
|
|
template <bool allowBlockPassthrough>
|
|
std::pair<ExecutionState, size_t> DependencyProxy<allowBlockPassthrough>::skipSomeForDependency(
|
|
size_t const dependency, size_t const atMost) {
|
|
TRI_ASSERT(!allowBlockPassthrough);
|
|
|
|
TRI_ASSERT(_blockPassThroughQueue.empty());
|
|
TRI_ASSERT(_blockQueue.empty());
|
|
|
|
TRI_ASSERT(atMost > 0);
|
|
TRI_ASSERT(_skipped <= atMost);
|
|
|
|
ExecutionBlock& upstream = upstreamBlockForDependency(dependency);
|
|
|
|
ExecutionState state = ExecutionState::HASMORE;
|
|
|
|
while (state == ExecutionState::HASMORE && _skipped < atMost) {
|
|
size_t skippedNow;
|
|
TRI_ASSERT(_skipped <= atMost);
|
|
std::tie(state, skippedNow) = upstream.skipSome(atMost - _skipped);
|
|
if (state == ExecutionState::WAITING) {
|
|
TRI_ASSERT(skippedNow == 0);
|
|
return {state, 0};
|
|
}
|
|
|
|
_skipped += skippedNow;
|
|
TRI_ASSERT(_skipped <= atMost);
|
|
}
|
|
TRI_ASSERT(state != ExecutionState::WAITING);
|
|
|
|
size_t skipped = _skipped;
|
|
_skipped = 0;
|
|
TRI_ASSERT(skipped <= atMost);
|
|
return {state, skipped};
|
|
}
|
|
|
|
template <bool allowBlockPassthrough>
|
|
std::pair<ExecutionState, size_t> DependencyProxy<allowBlockPassthrough>::skipSome(size_t const toSkip) {
|
|
TRI_ASSERT(_blockPassThroughQueue.empty());
|
|
TRI_ASSERT(_blockQueue.empty());
|
|
|
|
TRI_ASSERT(toSkip > 0);
|
|
TRI_ASSERT(_skipped <= toSkip);
|
|
ExecutionState state = ExecutionState::HASMORE;
|
|
|
|
while (_skipped < toSkip) {
|
|
size_t skippedNow;
|
|
// Note: upstreamBlock will return next dependency
|
|
// if we need to loop here
|
|
TRI_ASSERT(_skipped <= toSkip);
|
|
std::tie(state, skippedNow) = upstreamBlock().skipSome(toSkip - _skipped);
|
|
TRI_ASSERT(skippedNow <= toSkip - _skipped);
|
|
|
|
if (state == ExecutionState::WAITING) {
|
|
TRI_ASSERT(skippedNow == 0);
|
|
return {state, 0};
|
|
}
|
|
|
|
_skipped += skippedNow;
|
|
|
|
// When the current dependency is done, advance.
|
|
if (state == ExecutionState::DONE) {
|
|
if (!advanceDependency()) {
|
|
break;
|
|
} else {
|
|
state = ExecutionState::HASMORE;
|
|
}
|
|
}
|
|
}
|
|
|
|
size_t skipped = _skipped;
|
|
_skipped = 0;
|
|
|
|
TRI_ASSERT(skipped <= toSkip);
|
|
return {state, skipped};
|
|
}
|
|
|
|
template <bool allowBlockPassthrough>
|
|
std::pair<ExecutionState, SharedAqlItemBlockPtr>
|
|
DependencyProxy<allowBlockPassthrough>::fetchBlockForPassthrough(size_t atMost) {
|
|
TRI_ASSERT(allowBlockPassthrough); // TODO check this with enable_if in the header already
|
|
|
|
if (_blockPassThroughQueue.empty()) {
|
|
ExecutionState state = prefetchBlock(atMost);
|
|
// prefetchBlock returns HASMORE iff it pushed a block onto _blockPassThroughQueue.
|
|
// If it didn't, it got either WAITING from upstream, or DONE + nullptr.
|
|
if (state == ExecutionState::WAITING || state == ExecutionState::DONE) {
|
|
return {state, nullptr};
|
|
}
|
|
TRI_ASSERT(state == ExecutionState::HASMORE);
|
|
}
|
|
|
|
TRI_ASSERT(!_blockPassThroughQueue.empty());
|
|
|
|
ExecutionState state;
|
|
SharedAqlItemBlockPtr block;
|
|
std::tie(state, block) = _blockPassThroughQueue.front();
|
|
_blockPassThroughQueue.pop_front();
|
|
|
|
return {state, std::move(block)};
|
|
}
|
|
|
|
template class ::arangodb::aql::DependencyProxy<true>;
|
|
template class ::arangodb::aql::DependencyProxy<false>;
|