42 #ifndef OPENVDB_UTIL_PAGED_ARRAY_HAS_BEEN_INCLUDED 43 #define OPENVDB_UTIL_PAGED_ARRAY_HAS_BEEN_INCLUDED 45 #include <openvdb/version.h> 50 #include <tbb/atomic.h> 51 #include <tbb/spin_mutex.h> 52 #include <tbb/parallel_for.h> 53 #include <tbb/parallel_sort.h> 186 template<
typename ValueT,
187 size_t Log2PageSize = 10UL,
188 template<
typename ...>
class TableT = std::vector>
194 #if defined(__INTEL_COMPILER) && __INTEL_COMPILER < 1700 196 using PageTableT = TableT<Page*, std::allocator<Page*>>;
198 using PageTableT = TableT<Page*>;
239 const size_t index = mSize.fetch_and_increment();
240 if (index >= mCapacity) this->grow(index);
241 (*mPageTable[index >> Log2PageSize])[index] = value;
254 const size_t index = mSize.fetch_and_increment();
255 if (index >= mCapacity) {
256 mPageTable.push_back(
new Page() );
257 mCapacity += Page::Size;
259 (*mPageTable[index >> Log2PageSize])[index] = value;
266 void shrink_to_fit();
278 return (*mPageTable[i>>Log2PageSize])[i];
291 return (*mPageTable[i>>Log2PageSize])[i];
301 auto op = [&](
const tbb::blocked_range<size_t>& r){
302 for(
size_t i=r.begin(); i!=r.end(); ++i) mPageTable[i]->fill(v);
304 tbb::parallel_for(tbb::blocked_range<size_t>(0, this->pageCount()), op);
316 size_t last_page = count >> Log2PageSize;
317 if (last_page >= this->pageCount())
return false;
318 auto op = [&](
const tbb::blocked_range<size_t>& r){
319 for (
size_t i=r.begin(); i!=r.end(); ++i) {
320 mPageTable[i]->copy(p+i*Page::Size, Page::Size);
323 if (
size_t m = count & Page::Mask) {
324 tbb::parallel_for(tbb::blocked_range<size_t>(0, last_page, 32), op);
325 mPageTable[last_page]->copy(p+last_page*Page::Size, m);
327 tbb::parallel_for(tbb::blocked_range<size_t>(0, last_page+1, 32), op);
350 if (size > mCapacity) {
353 this->shrink_to_fit();
379 size_t size()
const {
return mSize; }
401 return sizeof(*this) + mPageTable.size() * Page::memUsage();
420 for (
size_t i=0, n=mPageTable.size(); i<n; ++i)
delete mPageTable[i];
421 PageTableT().swap(mPageTable);
453 void sort() { tbb::parallel_sort(this->begin(), this->end(), std::less<ValueT>() ); }
456 void invSort() { tbb::parallel_sort(this->begin(), this->end(), std::greater<ValueT>()); }
459 template <
typename Functor>
464 void sort(Functor func) { tbb::parallel_sort(this->begin(), this->end(), func ); }
477 void print(std::ostream& os = std::cout)
const 479 os <<
"PagedArray:\n" 480 <<
"\tSize: " << this->size() <<
" elements\n" 481 <<
"\tPage table: " << this->pageCount() <<
" pages\n" 482 <<
"\tPage size: " << this->pageSize() <<
" elements\n" 483 <<
"\tCapacity: " << this->capacity() <<
" elements\n" 484 <<
"\tFootprint: " << this->memUsage() <<
" bytes\n";
491 void grow(
size_t index)
493 tbb::spin_mutex::scoped_lock lock(mGrowthMutex);
494 while(index >= mCapacity) {
495 mPageTable.push_back(
new Page() );
496 mCapacity += Page::Size;
500 void add_full(
Page*& page,
size_t size);
502 void add_partially_full(
Page*& page,
size_t size);
504 void add(
Page*& page,
size_t size) {
505 tbb::spin_mutex::scoped_lock lock(mGrowthMutex);
506 if (size == Page::Size) {
507 this->add_full(page, size);
509 this->add_partially_full(page, size);
512 PageTableT mPageTable;
513 tbb::atomic<size_t> mSize{0};
514 size_t mCapacity = 0;
515 tbb::spin_mutex mGrowthMutex;
520 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
523 if (mPageTable.size() > (mSize >> Log2PageSize) + 1) {
524 tbb::spin_mutex::scoped_lock lock(mGrowthMutex);
525 const size_t pageCount = (mSize >> Log2PageSize) + 1;
526 if (mPageTable.size() > pageCount) {
527 delete mPageTable.back();
528 mPageTable.pop_back();
529 mCapacity -= Page::Size;
534 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
537 if (&other !=
this && !other.
isEmpty()) {
538 tbb::spin_mutex::scoped_lock lock(mGrowthMutex);
540 Page* page =
nullptr;
541 const size_t size = mSize & Page::Mask;
543 page = mPageTable.back();
544 mPageTable.pop_back();
548 mPageTable.insert(mPageTable.end(), other.mPageTable.begin(), other.mPageTable.end());
549 mSize += other.mSize;
550 mCapacity = Page::Size*mPageTable.size();
553 PageTableT().swap(other.mPageTable);
555 if (page) this->add_partially_full(page, size);
559 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
562 assert(size == Page::Size);
563 if (mSize & Page::Mask) {
564 Page*& tmp = mPageTable.back();
565 std::swap(tmp, page);
567 mPageTable.push_back(page);
568 mCapacity += Page::Size;
573 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
576 assert(size > 0 && size < Page::Size);
577 if (
size_t m = mSize & Page::Mask) {
578 ValueT *s = page->
data(), *t = mPageTable.back()->data() + m;
579 for (
size_t i=
std::min(mSize+size, mCapacity)-mSize; i; --i) *t++ = *s++;
580 if (mSize+size > mCapacity) {
581 mPageTable.push_back(
new Page() );
582 t = mPageTable.back()->data();
583 for (
size_t i=mSize+size-mCapacity; i; --i) *t++ = *s++;
584 mCapacity += Page::Size;
587 mPageTable.push_back( page );
588 mCapacity += Page::Size;
597 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
618 (*mPage)[mSize++] = v;
619 if (mSize == Page::Size) this->flush();
627 mParent->add(mPage, mSize);
628 if (mPage ==
nullptr) mPage =
new Page();
634 size_t size()
const {
return mSize; }
645 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
647 ConstIterator :
public std::iterator<std::random_access_iterator_tag, ValueT>
650 using BaseT = std::iterator<std::random_access_iterator_tag, ValueT>;
658 mParent=other.mParent;
668 const ValueT&
operator*()
const {
return (*mParent)[mPos]; }
685 bool isValid()
const {
return mParent !=
nullptr && mPos < mParent->size(); }
686 size_t pos()
const {
return mPos; }
696 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
698 Iterator :
public std::iterator<std::random_access_iterator_tag, ValueT>
701 using BaseT = std::iterator<std::random_access_iterator_tag, ValueT>;
709 mParent=other.mParent;
736 bool isValid()
const {
return mParent !=
nullptr && mPos < mParent->size(); }
737 size_t pos()
const {
return mPos; }
746 template <
typename ValueT,
size_t Log2PageSize,
template<
typename ...>
class TableT>
751 static const size_t Size = 1UL << Log2PageSize;
752 static const size_t Mask = Size - 1UL;
753 static size_t memUsage() {
return sizeof(ValueT)*Size; }
755 Page() : mData(reinterpret_cast<ValueT*>(new char[sizeof(ValueT)*Size])) {}
758 Page& operator=(
const Page&) =
delete;
759 ValueT&
operator[](
const size_t i) {
return mData[i & Mask]; }
760 const ValueT&
operator[](
const size_t i)
const {
return mData[i & Mask]; }
763 for (
size_t i=Size; i; --i) *dst++ = v;
765 ValueT*
data() {
return mData; }
769 const ValueT* src = mData;
770 for (
size_t i=n; i; --i) *dst++ = *src++;
782 #endif // OPENVDB_UTIL_PAGED_ARRAY_HAS_BEEN_INCLUDED PagedArrayType & parent() const
Return a reference to the parent PagedArray.
Definition: PagedArray.h:632
size_t freeCount() const
Return the number of additional elements that can be added to this array without allocating more memo...
Definition: PagedArray.h:387
Concurrent, page-based, dynamically-sized linear data structure with O(1) random access and STL-compl...
Definition: PagedArray.h:189
bool operator>(const Tuple< SIZE, T0 > &t0, const Tuple< SIZE, T1 > &t1)
Definition: Tuple.h:219
void push_back(const ValueT &v)
Add a value to the buffer and increment the size.
Definition: PagedArray.h:617
size_t pos() const
Definition: PagedArray.h:737
Iterator end()
Return a non-const iterator pointing to the past-the-last element.
Definition: PagedArray.h:434
Definition: PagedArray.h:646
ConstIterator & operator++()
Definition: PagedArray.h:662
ConstIterator end() const
Return a const iterator pointing to the past-the-last element.
Definition: PagedArray.h:449
ConstIterator & operator-=(const difference_type &pos)
Definition: PagedArray.h:673
ConstIterator(const PagedArray &parent, size_t pos=0)
Definition: PagedArray.h:654
ValueT ValueType
Definition: PagedArray.h:202
Iterator & operator--()
Definition: PagedArray.h:714
bool isEmpty() const
Return true if the container contains no elements.
Definition: PagedArray.h:405
ConstIterator & operator=(const ConstIterator &other)
Definition: PagedArray.h:656
Page()
Definition: PagedArray.h:755
ConstIterator begin() const
Return a const iterator pointing to the first element.
Definition: PagedArray.h:439
void invSort()
Parallel sort of all the elements in descending order.
Definition: PagedArray.h:456
bool operator!=(const Iterator &other) const
Definition: PagedArray.h:730
void fill(const ValueType &v)
Set all elements in the page table to the specified value.
Definition: PagedArray.h:299
void copy(ValueType *dst, size_t n) const
Definition: PagedArray.h:768
ConstIterator operator+(const difference_type &pos) const
Definition: PagedArray.h:674
~Page()
Definition: PagedArray.h:756
static size_t pageSize()
Return the number of elements per memory page.
Definition: PagedArray.h:393
size_t size() const
Return the number of elements in this array.
Definition: PagedArray.h:379
Iterator(PagedArray &parent, size_t pos=0)
Definition: PagedArray.h:705
Iterator(const Iterator &other)
Definition: PagedArray.h:706
~PagedArray()
Destructor removed all allocated pages.
Definition: PagedArray.h:208
void print(std::ostream &os=std::cout) const
Print information for debugging.
Definition: PagedArray.h:477
ConstIterator operator--(int)
Definition: PagedArray.h:666
Iterator operator+(const difference_type &pos) const
Definition: PagedArray.h:725
bool operator<=(const ConstIterator &other) const
Definition: PagedArray.h:681
ConstIterator()
Definition: PagedArray.h:653
bool operator==(const ConstIterator &other) const
Definition: PagedArray.h:678
size_t push_back_unsafe(const ValueType &value)
Slightly faster than the thread-safe push_back above.
Definition: PagedArray.h:252
~ValueBuffer()
Destructor that transfers an buffered values to the parent PagedArray.
Definition: PagedArray.h:609
Iterator begin()
Return a non-const iterator pointing to the first element.
Definition: PagedArray.h:427
const ValueT * operator->() const
Definition: PagedArray.h:669
ValueT & operator[](const size_t i)
Definition: PagedArray.h:759
ValueType & operator[](size_t i)
Return a reference to the value at the specified offset.
Definition: PagedArray.h:275
ValueT * mData
Definition: PagedArray.h:773
bool isValid() const
Definition: PagedArray.h:736
ValueT & operator[](const difference_type &pos) const
Definition: PagedArray.h:721
Iterator & operator-=(const difference_type &pos)
Definition: PagedArray.h:724
#define OPENVDB_VERSION_NAME
The version namespace name for this library version.
Definition: version.h:136
const ValueT & operator[](const difference_type &pos) const
Definition: PagedArray.h:670
bool operator>=(const ConstIterator &other) const
Definition: PagedArray.h:680
bool operator==(const Iterator &other) const
Definition: PagedArray.h:729
Iterator()
Definition: PagedArray.h:704
Definition: PagedArray.h:598
Iterator operator++(int)
Definition: PagedArray.h:716
size_t pageCount() const
Return the number of allocated memory pages.
Definition: PagedArray.h:390
void resize(size_t size, const ValueType &v)
Resize this array to the specified size and initialize all values to v.
Definition: PagedArray.h:372
ValueT * operator->() const
Definition: PagedArray.h:720
ValueT * data()
Definition: PagedArray.h:765
ValueT & operator*() const
Definition: PagedArray.h:719
void resize(size_t size)
Resize this array to the specified size.
Definition: PagedArray.h:347
size_t size() const
Return the current number of elements cached in this buffer.
Definition: PagedArray.h:634
ConstIterator & operator+=(const difference_type &pos)
Definition: PagedArray.h:672
const ValueType & operator[](size_t i) const
Return a const-reference to the value at the specified offset.
Definition: PagedArray.h:288
static size_t memUsage()
Definition: PagedArray.h:753
void copy(ValueType *p) const
Definition: PagedArray.h:331
bool operator<=(const Iterator &other) const
Definition: PagedArray.h:732
Definition: Exceptions.h:40
std::iterator< std::random_access_iterator_tag, ValueT > BaseT
Definition: PagedArray.h:701
const ValueT & operator[](const size_t i) const
Definition: PagedArray.h:760
const ValueT & operator*() const
Definition: PagedArray.h:668
void fill(const ValueT &v)
Definition: PagedArray.h:761
ConstIterator(const ConstIterator &other)
Definition: PagedArray.h:655
ValueBuffer(const ValueBuffer &other)
Definition: PagedArray.h:607
bool isValid() const
Definition: PagedArray.h:685
void flush()
Manually transfers the values in this buffer to the parent PagedArray.
Definition: PagedArray.h:626
typename BaseT::difference_type difference_type
Definition: PagedArray.h:702
ConstIterator & operator--()
Definition: PagedArray.h:663
static size_t log2PageSize()
Return log2 of the number of elements per memory page.
Definition: PagedArray.h:396
difference_type operator-(const Iterator &other) const
Definition: PagedArray.h:727
size_t capacity() const
Return the maximum number of elements that this array can contain without allocating more memory page...
Definition: PagedArray.h:383
size_t memUsage() const
Return the memory footprint of this array in bytes.
Definition: PagedArray.h:399
bool isPartiallyFull() const
Return true if the page table is partially full, i.e. the last non-empty page contains less than page...
Definition: PagedArray.h:413
bool operator>=(const Iterator &other) const
Definition: PagedArray.h:731
Definition: PagedArray.h:747
Iterator & operator++()
Definition: PagedArray.h:713
void clear()
Removes all elements from the array and delete all pages.
Definition: PagedArray.h:418
Definition: PagedArray.h:697
difference_type operator-(const ConstIterator &other) const
Definition: PagedArray.h:676
size_t push_back(const ValueType &value)
Thread safe insertion, adds a new element at the end and increases the container size by one and retu...
Definition: PagedArray.h:237
bool operator<(const Tuple< SIZE, T0 > &t0, const Tuple< SIZE, T1 > &t1)
Definition: Tuple.h:207
Iterator operator--(int)
Definition: PagedArray.h:717
ConstIterator operator-(const difference_type &pos) const
Definition: PagedArray.h:675
Iterator & operator=(const Iterator &other)
Definition: PagedArray.h:707
size_t pos() const
Definition: PagedArray.h:686
Mat3< typename promote< T0, T1 >::type > operator*(const Mat3< T0 > &m0, const Mat3< T1 > &m1)
Multiply m0 by m1 and return the resulting matrix.
Definition: Mat3.h:645
#define OPENVDB_USE_VERSION_NAMESPACE
Definition: version.h:188
bool operator!=(const ConstIterator &other) const
Definition: PagedArray.h:679
void sort(Functor func)
Parallel sort of all the elements based on a custom functor with the api:
Definition: PagedArray.h:464
ConstIterator operator++(int)
Definition: PagedArray.h:665
ValueBuffer(PagedArray &parent)
Constructor from a PageArray.
Definition: PagedArray.h:604
void sort()
Parallel sort of all the elements in ascending order.
Definition: PagedArray.h:453
bool copy(ValueType *p, size_t count) const
Copy the first count values in this PageArray into a raw c-style array, assuming it to be at least co...
Definition: PagedArray.h:314
std::iterator< std::random_access_iterator_tag, ValueT > BaseT
Definition: PagedArray.h:650
typename BaseT::difference_type difference_type
Definition: PagedArray.h:651
Iterator operator-(const difference_type &pos) const
Definition: PagedArray.h:726
Iterator & operator+=(const difference_type &pos)
Definition: PagedArray.h:723