1
0
Fork 0
arangodb/lib/Basics/IndexBucket.h

147 lines
4.0 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 Max Neunhoeffer
/// @author Jan Steemann
////////////////////////////////////////////////////////////////////////////////
#ifndef ARANGODB_BASICS_INDEX_BUCKET_H
#define ARANGODB_BASICS_INDEX_BUCKET_H 1
#include "Basics/Common.h"
#include "Basics/files.h"
#include "Basics/memory-map.h"
#include "Logger/Logger.h"
#ifdef TRI_HAVE_UNISTD_H
#include <unistd.h>
#endif
namespace arangodb {
namespace basics {
template <class EntryType, class IndexType>
struct IndexBucket {
IndexType _nrAlloc; // the size of the table
IndexType _nrUsed; // the number of used entries
IndexType _nrCollisions; // the number of entries that have
// a key that was previously in the table
EntryType* _table; // the table itself
IndexBucket()
: _nrAlloc(0),
_nrUsed(0),
_nrCollisions(0),
_table(nullptr) {}
IndexBucket(IndexBucket const&) = delete;
IndexBucket& operator=(IndexBucket const&) = delete;
// move ctor. this takes over responsibility for the resources from other
IndexBucket(IndexBucket&& other)
: _nrAlloc(other._nrAlloc),
_nrUsed(other._nrUsed),
_nrCollisions(other._nrCollisions),
_table(other._table) {
other._nrAlloc = 0;
other._nrUsed = 0;
other._nrCollisions = 0;
other._table = nullptr;
}
IndexBucket& operator=(IndexBucket&& other) {
deallocate(); // free own resources first
_nrAlloc = other._nrAlloc;
_nrUsed = other._nrUsed;
_nrCollisions = other._nrCollisions;
_table = other._table;
other._nrAlloc = 0;
other._nrUsed = 0;
other._nrCollisions = 0;
other._table = nullptr;
return *this;
}
~IndexBucket() { deallocate(); }
public:
size_t memoryUsage() const { return requiredSize(_nrAlloc); }
size_t requiredSize(size_t numberElements) const {
return numberElements * sizeof(EntryType);
}
void allocate(size_t numberElements) {
TRI_ASSERT(_nrAlloc == 0);
TRI_ASSERT(_nrUsed == 0);
TRI_ASSERT(_table == nullptr);
_table = allocateMemory(numberElements);
TRI_ASSERT(_table != nullptr);
#ifdef __linux__
if (numberElements > 1000000) {
size_t const totalSize = requiredSize(numberElements);
uintptr_t mem = reinterpret_cast<uintptr_t>(_table);
uintptr_t pageSize = getpagesize();
mem = (mem / pageSize) * pageSize;
void* memptr = reinterpret_cast<void*>(mem);
TRI_MMFileAdvise(memptr, totalSize, TRI_MADVISE_RANDOM);
}
#endif
_nrAlloc = static_cast<IndexType>(numberElements);
_nrCollisions = 0;
}
void deallocate() {
deallocateMemory();
}
private:
EntryType* allocateMemory(size_t numberElements) {
// must be > 0 because we will use a modulus operation on the
// number of elements
TRI_ASSERT(numberElements > 0);
return new EntryType[numberElements]();
}
void deallocateMemory() noexcept {
if (_table == nullptr) {
TRI_ASSERT(_nrAlloc == 0);
TRI_ASSERT(_nrUsed == 0);
return;
}
delete[] _table;
_table = nullptr;
_nrAlloc = 0;
_nrUsed = 0;
_nrCollisions = 0;
}
};
} // namespace basics
} // namespace arangodb
#endif