mirror of https://gitee.com/bigwinds/arangodb
145 lines
3.3 KiB
C++
145 lines
3.3 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
/// DISCLAIMER
|
|
///
|
|
/// Copyright 2014-2016 ArangoDB GmbH, Cologne, Germany
|
|
/// Copyright 2004-2014 triAGENS 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 Jan Steemann
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#ifndef ARANGOD_AQL_AQL_ITEM_BLOCK_MANAGER_H
|
|
#define ARANGOD_AQL_AQL_ITEM_BLOCK_MANAGER_H 1
|
|
|
|
#include "Basics/Common.h"
|
|
#include "Aql/types.h"
|
|
|
|
#include <array>
|
|
|
|
namespace arangodb {
|
|
namespace aql {
|
|
|
|
class AqlItemBlock;
|
|
struct ResourceMonitor;
|
|
|
|
class AqlItemBlockManager {
|
|
public:
|
|
/// @brief create the manager
|
|
explicit AqlItemBlockManager(ResourceMonitor*);
|
|
|
|
/// @brief destroy the manager
|
|
~AqlItemBlockManager();
|
|
|
|
public:
|
|
/// @brief request a block with the specified size
|
|
AqlItemBlock* requestBlock(size_t nrItems, RegisterId nrRegs);
|
|
|
|
/// @brief return a block to the manager
|
|
void returnBlock(AqlItemBlock*& block);
|
|
|
|
ResourceMonitor* resourceMonitor() const { return _resourceMonitor; }
|
|
|
|
private:
|
|
ResourceMonitor* _resourceMonitor;
|
|
|
|
static constexpr size_t NumBuckets = 12;
|
|
|
|
struct Bucket {
|
|
static constexpr size_t NumBlocks = 4;
|
|
|
|
Bucket();
|
|
~Bucket();
|
|
|
|
std::array<AqlItemBlock*, NumBlocks> blocks;
|
|
|
|
bool empty() const {
|
|
return (blocks[0] == nullptr);
|
|
}
|
|
|
|
bool full() const {
|
|
return (blocks[NumBlocks - 1] != nullptr);
|
|
}
|
|
|
|
AqlItemBlock* pop() {
|
|
TRI_ASSERT(!empty());
|
|
size_t i = NumBlocks;
|
|
while (i--) {
|
|
if (blocks[i] != nullptr) {
|
|
AqlItemBlock* result = blocks[i];
|
|
blocks[i] = nullptr;
|
|
return result;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
void push(AqlItemBlock* block) {
|
|
TRI_ASSERT(!full());
|
|
for (size_t i = 0; i < NumBlocks; ++i) {
|
|
if (blocks[i] == nullptr) {
|
|
blocks[i] = block;
|
|
return;
|
|
}
|
|
}
|
|
TRI_ASSERT(false);
|
|
}
|
|
|
|
static size_t getId(size_t targetSize) {
|
|
if (targetSize <= 1) {
|
|
return 0;
|
|
}
|
|
if (targetSize <= 10) {
|
|
return 1;
|
|
}
|
|
if (targetSize <= 20) {
|
|
return 2;
|
|
}
|
|
if (targetSize <= 40) {
|
|
return 3;
|
|
}
|
|
if (targetSize <= 100) {
|
|
return 4;
|
|
}
|
|
if (targetSize <= 200) {
|
|
return 5;
|
|
}
|
|
if (targetSize <= 400) {
|
|
return 6;
|
|
}
|
|
if (targetSize <= 1000) {
|
|
return 7;
|
|
}
|
|
if (targetSize <= 2000) {
|
|
return 8;
|
|
}
|
|
if (targetSize <= 4000) {
|
|
return 9;
|
|
}
|
|
if (targetSize <= 10000) {
|
|
return 10;
|
|
}
|
|
return 11;
|
|
}
|
|
};
|
|
|
|
Bucket _buckets[NumBuckets];
|
|
};
|
|
|
|
}
|
|
}
|
|
|
|
#endif
|