9cfc7967dd
* Replace license text in headers with SPDX identifiers. * Remove specific license info from outdated readme.txt, instead leave details to the source files. * Add list of SPDX license identifiers used, and corresponding license texts. * Update copyright dates while we're at it. Ref D14069, T95597
310 lines
5.7 KiB
C++
310 lines
5.7 KiB
C++
/* SPDX-License-Identifier: Apache-2.0
|
|
* Copyright 2011-2022 Blender Foundation */
|
|
|
|
#ifndef __UTIL_ARRAY_H__
|
|
#define __UTIL_ARRAY_H__
|
|
|
|
#include <cassert>
|
|
#include <cstring>
|
|
|
|
#include "util/aligned_malloc.h"
|
|
#include "util/guarded_allocator.h"
|
|
#include "util/types.h"
|
|
#include "util/vector.h"
|
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
/* Simplified version of vector, serving multiple purposes:
|
|
* - somewhat faster in that it does not clear memory on resize/alloc,
|
|
* this was actually showing up in profiles quite significantly. it
|
|
* also does not run any constructors/destructors
|
|
* - if this is used, we are not tempted to use inefficient operations
|
|
* - aligned allocation for CPU native data types */
|
|
|
|
template<typename T, size_t alignment = MIN_ALIGNMENT_CPU_DATA_TYPES> class array {
|
|
public:
|
|
array() : data_(NULL), datasize_(0), capacity_(0)
|
|
{
|
|
}
|
|
|
|
explicit array(size_t newsize)
|
|
{
|
|
if (newsize == 0) {
|
|
data_ = NULL;
|
|
datasize_ = 0;
|
|
capacity_ = 0;
|
|
}
|
|
else {
|
|
data_ = mem_allocate(newsize);
|
|
datasize_ = newsize;
|
|
capacity_ = datasize_;
|
|
}
|
|
}
|
|
|
|
array(const array &from)
|
|
{
|
|
if (from.datasize_ == 0) {
|
|
data_ = NULL;
|
|
datasize_ = 0;
|
|
capacity_ = 0;
|
|
}
|
|
else {
|
|
data_ = mem_allocate(from.datasize_);
|
|
if (from.datasize_ > 0) {
|
|
mem_copy(data_, from.data_, from.datasize_);
|
|
}
|
|
datasize_ = from.datasize_;
|
|
capacity_ = datasize_;
|
|
}
|
|
}
|
|
|
|
array &operator=(const array &from)
|
|
{
|
|
if (this != &from) {
|
|
resize(from.size());
|
|
if (datasize_ > 0) {
|
|
mem_copy(data_, from.data_, datasize_);
|
|
}
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
array &operator=(const vector<T> &from)
|
|
{
|
|
resize(from.size());
|
|
|
|
if (from.size() > 0 && datasize_ > 0) {
|
|
mem_copy(data_, from.data(), datasize_);
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
~array()
|
|
{
|
|
mem_free(data_, capacity_);
|
|
}
|
|
|
|
bool operator==(const array<T> &other) const
|
|
{
|
|
if (datasize_ != other.datasize_) {
|
|
return false;
|
|
}
|
|
if (datasize_ == 0) {
|
|
return true;
|
|
}
|
|
|
|
return memcmp(data_, other.data_, datasize_ * sizeof(T)) == 0;
|
|
}
|
|
|
|
bool operator!=(const array<T> &other) const
|
|
{
|
|
return !(*this == other);
|
|
}
|
|
|
|
void steal_data(array &from)
|
|
{
|
|
if (this != &from) {
|
|
clear();
|
|
|
|
data_ = from.data_;
|
|
datasize_ = from.datasize_;
|
|
capacity_ = from.capacity_;
|
|
|
|
from.data_ = NULL;
|
|
from.datasize_ = 0;
|
|
from.capacity_ = 0;
|
|
}
|
|
}
|
|
|
|
void set_data(T *ptr_, size_t datasize)
|
|
{
|
|
clear();
|
|
data_ = ptr_;
|
|
datasize_ = datasize;
|
|
capacity_ = datasize;
|
|
}
|
|
|
|
T *steal_pointer()
|
|
{
|
|
T *ptr = data_;
|
|
data_ = NULL;
|
|
clear();
|
|
return ptr;
|
|
}
|
|
|
|
T *resize(size_t newsize)
|
|
{
|
|
if (newsize == 0) {
|
|
clear();
|
|
}
|
|
else if (newsize != datasize_) {
|
|
if (newsize > capacity_) {
|
|
T *newdata = mem_allocate(newsize);
|
|
if (newdata == NULL) {
|
|
/* Allocation failed, likely out of memory. */
|
|
clear();
|
|
return NULL;
|
|
}
|
|
else if (data_ != NULL) {
|
|
mem_copy(newdata, data_, ((datasize_ < newsize) ? datasize_ : newsize));
|
|
mem_free(data_, capacity_);
|
|
}
|
|
data_ = newdata;
|
|
capacity_ = newsize;
|
|
}
|
|
datasize_ = newsize;
|
|
}
|
|
return data_;
|
|
}
|
|
|
|
T *resize(size_t newsize, const T &value)
|
|
{
|
|
size_t oldsize = size();
|
|
resize(newsize);
|
|
|
|
for (size_t i = oldsize; i < size(); i++) {
|
|
data_[i] = value;
|
|
}
|
|
|
|
return data_;
|
|
}
|
|
|
|
void clear()
|
|
{
|
|
if (data_ != NULL) {
|
|
mem_free(data_, capacity_);
|
|
data_ = NULL;
|
|
}
|
|
datasize_ = 0;
|
|
capacity_ = 0;
|
|
}
|
|
|
|
size_t empty() const
|
|
{
|
|
return datasize_ == 0;
|
|
}
|
|
|
|
size_t size() const
|
|
{
|
|
return datasize_;
|
|
}
|
|
|
|
T *data()
|
|
{
|
|
return data_;
|
|
}
|
|
|
|
const T *data() const
|
|
{
|
|
return data_;
|
|
}
|
|
|
|
T &operator[](size_t i) const
|
|
{
|
|
assert(i < datasize_);
|
|
return data_[i];
|
|
}
|
|
|
|
T *begin()
|
|
{
|
|
return data_;
|
|
}
|
|
|
|
const T *begin() const
|
|
{
|
|
return data_;
|
|
}
|
|
|
|
T *end()
|
|
{
|
|
return data_ + datasize_;
|
|
}
|
|
|
|
const T *end() const
|
|
{
|
|
return data_ + datasize_;
|
|
}
|
|
|
|
void reserve(size_t newcapacity)
|
|
{
|
|
if (newcapacity > capacity_) {
|
|
T *newdata = mem_allocate(newcapacity);
|
|
if (data_ != NULL) {
|
|
mem_copy(newdata, data_, ((datasize_ < newcapacity) ? datasize_ : newcapacity));
|
|
mem_free(data_, capacity_);
|
|
}
|
|
data_ = newdata;
|
|
capacity_ = newcapacity;
|
|
}
|
|
}
|
|
|
|
size_t capacity() const
|
|
{
|
|
return capacity_;
|
|
}
|
|
|
|
// do not use this method unless you are sure the code is not performance critical
|
|
void push_back_slow(const T &t)
|
|
{
|
|
if (capacity_ == datasize_) {
|
|
reserve(datasize_ == 0 ? 1 : (size_t)((datasize_ + 1) * 1.2));
|
|
}
|
|
|
|
data_[datasize_++] = t;
|
|
}
|
|
|
|
void push_back_reserved(const T &t)
|
|
{
|
|
assert(datasize_ < capacity_);
|
|
push_back_slow(t);
|
|
}
|
|
|
|
void append(const array<T> &from)
|
|
{
|
|
if (from.size()) {
|
|
size_t old_size = size();
|
|
resize(old_size + from.size());
|
|
mem_copy(data_ + old_size, from.data(), from.size());
|
|
}
|
|
}
|
|
|
|
protected:
|
|
inline T *mem_allocate(size_t N)
|
|
{
|
|
if (N == 0) {
|
|
return NULL;
|
|
}
|
|
T *mem = (T *)util_aligned_malloc(sizeof(T) * N, alignment);
|
|
if (mem != NULL) {
|
|
util_guarded_mem_alloc(sizeof(T) * N);
|
|
}
|
|
else {
|
|
throw std::bad_alloc();
|
|
}
|
|
return mem;
|
|
}
|
|
|
|
inline void mem_free(T *mem, size_t N)
|
|
{
|
|
if (mem != NULL) {
|
|
util_guarded_mem_free(sizeof(T) * N);
|
|
util_aligned_free(mem);
|
|
}
|
|
}
|
|
|
|
inline void mem_copy(T *mem_to, const T *mem_from, const size_t N)
|
|
{
|
|
memcpy((void *)mem_to, mem_from, sizeof(T) * N);
|
|
}
|
|
|
|
T *data_;
|
|
size_t datasize_;
|
|
size_t capacity_;
|
|
};
|
|
|
|
CCL_NAMESPACE_END
|
|
|
|
#endif /* __UTIL_ARRAY_H__ */
|