|
@@ -52,6 +52,8 @@ class VMap;
|
|
|
template <class T>
|
|
|
class CharStringT;
|
|
|
|
|
|
+SAFE_NUMERIC_TYPE_PUN_GUARANTEES(uint64_t)
|
|
|
+
|
|
|
// Silence a false positive warning (see GH-52119).
|
|
|
#if defined(__GNUC__) && !defined(__clang__)
|
|
|
#pragma GCC diagnostic push
|
|
@@ -69,52 +71,71 @@ class CowData {
|
|
|
template <class TS>
|
|
|
friend class CharStringT;
|
|
|
|
|
|
-private:
|
|
|
- mutable T *_ptr = nullptr;
|
|
|
+public:
|
|
|
+ typedef int64_t Size;
|
|
|
+ typedef uint64_t USize;
|
|
|
+ static constexpr USize MAX_INT = INT64_MAX;
|
|
|
|
|
|
- // internal helpers
|
|
|
+private:
|
|
|
+ // Function to find the next power of 2 to an integer.
|
|
|
+ static _FORCE_INLINE_ USize next_po2(USize x) {
|
|
|
+ if (x == 0) {
|
|
|
+ return 0;
|
|
|
+ }
|
|
|
|
|
|
- _FORCE_INLINE_ SafeNumeric<uint32_t> *_get_refcount() const {
|
|
|
- if (!_ptr) {
|
|
|
- return nullptr;
|
|
|
+ --x;
|
|
|
+ x |= x >> 1;
|
|
|
+ x |= x >> 2;
|
|
|
+ x |= x >> 4;
|
|
|
+ x |= x >> 8;
|
|
|
+ x |= x >> 16;
|
|
|
+ if (sizeof(USize) == 8) {
|
|
|
+ x |= x >> 32;
|
|
|
}
|
|
|
|
|
|
- return reinterpret_cast<SafeNumeric<uint32_t> *>(_ptr) - 2;
|
|
|
+ return ++x;
|
|
|
}
|
|
|
|
|
|
- _FORCE_INLINE_ uint32_t *_get_size() const {
|
|
|
+ static constexpr USize ALLOC_PAD = sizeof(USize) * 2; // For size and atomic refcount.
|
|
|
+
|
|
|
+ mutable T *_ptr = nullptr;
|
|
|
+
|
|
|
+ // internal helpers
|
|
|
+
|
|
|
+ _FORCE_INLINE_ SafeNumeric<USize> *_get_refcount() const {
|
|
|
if (!_ptr) {
|
|
|
return nullptr;
|
|
|
}
|
|
|
|
|
|
- return reinterpret_cast<uint32_t *>(_ptr) - 1;
|
|
|
+ return reinterpret_cast<SafeNumeric<USize> *>(_ptr) - 2;
|
|
|
}
|
|
|
|
|
|
- _FORCE_INLINE_ T *_get_data() const {
|
|
|
+ _FORCE_INLINE_ USize *_get_size() const {
|
|
|
if (!_ptr) {
|
|
|
return nullptr;
|
|
|
}
|
|
|
- return reinterpret_cast<T *>(_ptr);
|
|
|
+
|
|
|
+ return reinterpret_cast<USize *>(_ptr) - 1;
|
|
|
}
|
|
|
|
|
|
- _FORCE_INLINE_ size_t _get_alloc_size(size_t p_elements) const {
|
|
|
- return next_power_of_2(p_elements * sizeof(T));
|
|
|
+ _FORCE_INLINE_ USize _get_alloc_size(USize p_elements) const {
|
|
|
+ return next_po2(p_elements * sizeof(T));
|
|
|
}
|
|
|
|
|
|
- _FORCE_INLINE_ bool _get_alloc_size_checked(size_t p_elements, size_t *out) const {
|
|
|
+ _FORCE_INLINE_ bool _get_alloc_size_checked(USize p_elements, USize *out) const {
|
|
|
if (unlikely(p_elements == 0)) {
|
|
|
*out = 0;
|
|
|
return true;
|
|
|
}
|
|
|
-#if defined(__GNUC__)
|
|
|
- size_t o;
|
|
|
- size_t p;
|
|
|
+#if defined(__GNUC__) && defined(IS_32_BIT)
|
|
|
+ USize o;
|
|
|
+ USize p;
|
|
|
if (__builtin_mul_overflow(p_elements, sizeof(T), &o)) {
|
|
|
*out = 0;
|
|
|
return false;
|
|
|
}
|
|
|
- *out = next_power_of_2(o);
|
|
|
- if (__builtin_add_overflow(o, static_cast<size_t>(32), &p)) {
|
|
|
+ *out = next_po2(o);
|
|
|
+ if (__builtin_add_overflow(o, static_cast<USize>(32), &p)) {
|
|
|
return false; // No longer allocated here.
|
|
|
}
|
|
|
#else
|
|
@@ -128,22 +149,22 @@ private:
|
|
|
void _unref(void *p_data);
|
|
|
void _ref(const CowData *p_from);
|
|
|
void _ref(const CowData &p_from);
|
|
|
- uint32_t _copy_on_write();
|
|
|
+ USize _copy_on_write();
|
|
|
|
|
|
public:
|
|
|
void operator=(const CowData<T> &p_from) { _ref(p_from); }
|
|
|
|
|
|
_FORCE_INLINE_ T *ptrw() {
|
|
|
_copy_on_write();
|
|
|
- return (T *)_get_data();
|
|
|
+ return _ptr;
|
|
|
}
|
|
|
|
|
|
_FORCE_INLINE_ const T *ptr() const {
|
|
|
- return _get_data();
|
|
|
+ return _ptr;
|
|
|
}
|
|
|
|
|
|
- _FORCE_INLINE_ int size() const {
|
|
|
- uint32_t *size = (uint32_t *)_get_size();
|
|
|
+ _FORCE_INLINE_ Size size() const {
|
|
|
+ USize *size = (USize *)_get_size();
|
|
|
if (size) {
|
|
|
return *size;
|
|
|
} else {
|
|
@@ -154,41 +175,42 @@ public:
|
|
|
_FORCE_INLINE_ void clear() { resize(0); }
|
|
|
_FORCE_INLINE_ bool is_empty() const { return _ptr == nullptr; }
|
|
|
|
|
|
- _FORCE_INLINE_ void set(int p_index, const T &p_elem) {
|
|
|
+ _FORCE_INLINE_ void set(Size p_index, const T &p_elem) {
|
|
|
ERR_FAIL_INDEX(p_index, size());
|
|
|
_copy_on_write();
|
|
|
- _get_data()[p_index] = p_elem;
|
|
|
+ _ptr[p_index] = p_elem;
|
|
|
}
|
|
|
|
|
|
- _FORCE_INLINE_ T &get_m(int p_index) {
|
|
|
+ _FORCE_INLINE_ T &get_m(Size p_index) {
|
|
|
CRASH_BAD_INDEX(p_index, size());
|
|
|
_copy_on_write();
|
|
|
- return _get_data()[p_index];
|
|
|
+ return _ptr[p_index];
|
|
|
}
|
|
|
|
|
|
- _FORCE_INLINE_ const T &get(int p_index) const {
|
|
|
+ _FORCE_INLINE_ const T &get(Size p_index) const {
|
|
|
CRASH_BAD_INDEX(p_index, size());
|
|
|
|
|
|
- return _get_data()[p_index];
|
|
|
+ return _ptr[p_index];
|
|
|
}
|
|
|
|
|
|
- Error resize(int p_size);
|
|
|
+ template <bool p_ensure_zero = false>
|
|
|
+ Error resize(Size p_size);
|
|
|
|
|
|
- _FORCE_INLINE_ void remove_at(int p_index) {
|
|
|
+ _FORCE_INLINE_ void remove_at(Size p_index) {
|
|
|
ERR_FAIL_INDEX(p_index, size());
|
|
|
T *p = ptrw();
|
|
|
- int len = size();
|
|
|
- for (int i = p_index; i < len - 1; i++) {
|
|
|
+ Size len = size();
|
|
|
+ for (Size i = p_index; i < len - 1; i++) {
|
|
|
p[i] = p[i + 1];
|
|
|
}
|
|
|
|
|
|
resize(len - 1);
|
|
|
}
|
|
|
|
|
|
- Error insert(int p_pos, const T &p_val) {
|
|
|
+ Error insert(Size p_pos, const T &p_val) {
|
|
|
ERR_FAIL_INDEX_V(p_pos, size() + 1, ERR_INVALID_PARAMETER);
|
|
|
resize(size() + 1);
|
|
|
- for (int i = (size() - 1); i > p_pos; i--) {
|
|
|
+ for (Size i = (size() - 1); i > p_pos; i--) {
|
|
|
set(i, get(i - 1));
|
|
|
}
|
|
|
set(p_pos, p_val);
|
|
@@ -196,11 +218,13 @@ public:
|
|
|
return OK;
|
|
|
}
|
|
|
|
|
|
- int find(const T &p_val, int p_from = 0) const;
|
|
|
+ Size find(const T &p_val, Size p_from = 0) const;
|
|
|
+ Size rfind(const T &p_val, Size p_from = -1) const;
|
|
|
+ Size count(const T &p_val) const;
|
|
|
|
|
|
_FORCE_INLINE_ CowData() {}
|
|
|
_FORCE_INLINE_ ~CowData();
|
|
|
- _FORCE_INLINE_ CowData(CowData<T> &p_from) { _ref(p_from); }
|
|
|
+ _FORCE_INLINE_ CowData(CowData<T> &p_from) { _ref(p_from); };
|
|
|
};
|
|
|
|
|
|
template <class T>
|
|
@@ -209,44 +233,45 @@ void CowData<T>::_unref(void *p_data) {
|
|
|
return;
|
|
|
}
|
|
|
|
|
|
- SafeNumeric<uint32_t> *refc = _get_refcount();
|
|
|
+ SafeNumeric<USize> *refc = _get_refcount();
|
|
|
|
|
|
if (refc->decrement() > 0) {
|
|
|
return; // still in use
|
|
|
}
|
|
|
-
|
|
|
// clean up
|
|
|
+
|
|
|
if (!std::is_trivially_destructible<T>::value) {
|
|
|
- uint32_t *count = _get_size();
|
|
|
+ USize *count = _get_size();
|
|
|
T *data = (T *)(count + 1);
|
|
|
|
|
|
- for (uint32_t i = 0; i < *count; ++i) {
|
|
|
+ for (USize i = 0; i < *count; ++i) {
|
|
|
// call destructors
|
|
|
data[i].~T();
|
|
|
}
|
|
|
}
|
|
|
|
|
|
// free mem
|
|
|
- Memory::free_static((uint8_t *)p_data, true);
|
|
|
+ Memory::free_static(((uint8_t *)p_data) - ALLOC_PAD, false);
|
|
|
}
|
|
|
|
|
|
template <class T>
|
|
|
-uint32_t CowData<T>::_copy_on_write() {
|
|
|
+typename CowData<T>::USize CowData<T>::_copy_on_write() {
|
|
|
if (!_ptr) {
|
|
|
return 0;
|
|
|
}
|
|
|
|
|
|
- SafeNumeric<uint32_t> *refc = _get_refcount();
|
|
|
+ SafeNumeric<USize> *refc = _get_refcount();
|
|
|
|
|
|
- uint32_t rc = refc->get();
|
|
|
+ USize rc = refc->get();
|
|
|
if (unlikely(rc > 1)) {
|
|
|
/* in use by more than me */
|
|
|
- uint32_t current_size = *_get_size();
|
|
|
+ USize current_size = *_get_size();
|
|
|
|
|
|
- uint32_t *mem_new = (uint32_t *)Memory::alloc_static(_get_alloc_size(current_size), true);
|
|
|
+ USize *mem_new = (USize *)Memory::alloc_static(_get_alloc_size(current_size) + ALLOC_PAD, false);
|
|
|
+ mem_new += 2;
|
|
|
|
|
|
- new (mem_new - 2) SafeNumeric<uint32_t>(1); // refcount
|
|
|
- *(mem_new - 1) = current_size; // size
|
|
|
+ new (mem_new - 2) SafeNumeric<USize>(1); //refcount
|
|
|
+ *(mem_new - 1) = current_size; //size
|
|
|
|
|
|
T *_data = (T *)(mem_new);
|
|
|
|
|
@@ -255,8 +280,8 @@ uint32_t CowData<T>::_copy_on_write() {
|
|
|
memcpy(mem_new, _ptr, current_size * sizeof(T));
|
|
|
|
|
|
} else {
|
|
|
- for (uint32_t i = 0; i < current_size; i++) {
|
|
|
- memnew_placement(&_data[i], T(_get_data()[i]));
|
|
|
+ for (USize i = 0; i < current_size; i++) {
|
|
|
+ memnew_placement(&_data[i], T(_ptr[i]));
|
|
|
}
|
|
|
}
|
|
|
|
|
@@ -269,10 +294,11 @@ uint32_t CowData<T>::_copy_on_write() {
|
|
|
}
|
|
|
|
|
|
template <class T>
|
|
|
-Error CowData<T>::resize(int p_size) {
|
|
|
+template <bool p_ensure_zero>
|
|
|
+Error CowData<T>::resize(Size p_size) {
|
|
|
ERR_FAIL_COND_V(p_size < 0, ERR_INVALID_PARAMETER);
|
|
|
|
|
|
- int current_size = size();
|
|
|
+ Size current_size = size();
|
|
|
|
|
|
if (p_size == current_size) {
|
|
|
return OK;
|
|
@@ -286,27 +312,29 @@ Error CowData<T>::resize(int p_size) {
|
|
|
}
|
|
|
|
|
|
// possibly changing size, copy on write
|
|
|
- uint32_t rc = _copy_on_write();
|
|
|
+ USize rc = _copy_on_write();
|
|
|
|
|
|
- size_t current_alloc_size = _get_alloc_size(current_size);
|
|
|
- size_t alloc_size;
|
|
|
+ USize current_alloc_size = _get_alloc_size(current_size);
|
|
|
+ USize alloc_size;
|
|
|
ERR_FAIL_COND_V(!_get_alloc_size_checked(p_size, &alloc_size), ERR_OUT_OF_MEMORY);
|
|
|
|
|
|
if (p_size > current_size) {
|
|
|
if (alloc_size != current_alloc_size) {
|
|
|
if (current_size == 0) {
|
|
|
// alloc from scratch
|
|
|
- uint32_t *ptr = (uint32_t *)Memory::alloc_static(alloc_size, true);
|
|
|
+ USize *ptr = (USize *)Memory::alloc_static(alloc_size + ALLOC_PAD, false);
|
|
|
+ ptr += 2;
|
|
|
ERR_FAIL_NULL_V(ptr, ERR_OUT_OF_MEMORY);
|
|
|
- *(ptr - 1) = 0; // size, currently none
|
|
|
- new (ptr - 2) SafeNumeric<uint32_t>(1); // refcount
|
|
|
+ *(ptr - 1) = 0; //size, currently none
|
|
|
+ new (ptr - 2) SafeNumeric<USize>(1); //refcount
|
|
|
|
|
|
_ptr = (T *)ptr;
|
|
|
|
|
|
} else {
|
|
|
- uint32_t *_ptrnew = (uint32_t *)Memory::realloc_static(_ptr, alloc_size, true);
|
|
|
+ USize *_ptrnew = (USize *)Memory::realloc_static(((uint8_t *)_ptr) - ALLOC_PAD, alloc_size + ALLOC_PAD, false);
|
|
|
ERR_FAIL_NULL_V(_ptrnew, ERR_OUT_OF_MEMORY);
|
|
|
- new (_ptrnew - 2) SafeNumeric<uint32_t>(rc); // refcount
|
|
|
+ _ptrnew += 2;
|
|
|
+ new (_ptrnew - 2) SafeNumeric<USize>(rc); //refcount
|
|
|
|
|
|
_ptr = (T *)(_ptrnew);
|
|
|
}
|
|
@@ -315,11 +343,11 @@ Error CowData<T>::resize(int p_size) {
|
|
|
// construct the newly created elements
|
|
|
|
|
|
if (!std::is_trivially_constructible<T>::value) {
|
|
|
- T *elems = _get_data();
|
|
|
-
|
|
|
- for (int i = *_get_size(); i < p_size; i++) {
|
|
|
- memnew_placement(&elems[i], T);
|
|
|
+ for (Size i = *_get_size(); i < p_size; i++) {
|
|
|
+ memnew_placement(&_ptr[i], T);
|
|
|
}
|
|
|
+ } else if (p_ensure_zero) {
|
|
|
+ memset((void *)(_ptr + current_size), 0, (p_size - current_size) * sizeof(T));
|
|
|
}
|
|
|
|
|
|
*_get_size() = p_size;
|
|
@@ -327,16 +355,17 @@ Error CowData<T>::resize(int p_size) {
|
|
|
} else if (p_size < current_size) {
|
|
|
if (!std::is_trivially_destructible<T>::value) {
|
|
|
// deinitialize no longer needed elements
|
|
|
- for (uint32_t i = p_size; i < *_get_size(); i++) {
|
|
|
- T *t = &_get_data()[i];
|
|
|
+ for (USize i = p_size; i < *_get_size(); i++) {
|
|
|
+ T *t = &_ptr[i];
|
|
|
t->~T();
|
|
|
}
|
|
|
}
|
|
|
|
|
|
if (alloc_size != current_alloc_size) {
|
|
|
- uint32_t *_ptrnew = (uint32_t *)Memory::realloc_static(_ptr, alloc_size, true);
|
|
|
+ USize *_ptrnew = (USize *)Memory::realloc_static(((uint8_t *)_ptr) - ALLOC_PAD, alloc_size + ALLOC_PAD, false);
|
|
|
ERR_FAIL_NULL_V(_ptrnew, ERR_OUT_OF_MEMORY);
|
|
|
- new (_ptrnew - 2) SafeNumeric<uint32_t>(rc); // refcount
|
|
|
+ _ptrnew += 2;
|
|
|
+ new (_ptrnew - 2) SafeNumeric<USize>(rc); //refcount
|
|
|
|
|
|
_ptr = (T *)(_ptrnew);
|
|
|
}
|
|
@@ -348,14 +377,14 @@ Error CowData<T>::resize(int p_size) {
|
|
|
}
|
|
|
|
|
|
template <class T>
|
|
|
-int CowData<T>::find(const T &p_val, int p_from) const {
|
|
|
- int ret = -1;
|
|
|
+typename CowData<T>::Size CowData<T>::find(const T &p_val, Size p_from) const {
|
|
|
+ Size ret = -1;
|
|
|
|
|
|
if (p_from < 0 || size() == 0) {
|
|
|
return ret;
|
|
|
}
|
|
|
|
|
|
- for (int i = p_from; i < size(); i++) {
|
|
|
+ for (Size i = p_from; i < size(); i++) {
|
|
|
if (get(i) == p_val) {
|
|
|
ret = i;
|
|
|
break;
|
|
@@ -365,6 +394,36 @@ int CowData<T>::find(const T &p_val, int p_from) const {
|
|
|
return ret;
|
|
|
}
|
|
|
|
|
|
+template <class T>
|
|
|
+typename CowData<T>::Size CowData<T>::rfind(const T &p_val, Size p_from) const {
|
|
|
+ const Size s = size();
|
|
|
+
|
|
|
+ if (p_from < 0) {
|
|
|
+ p_from = s + p_from;
|
|
|
+ }
|
|
|
+ if (p_from < 0 || p_from >= s) {
|
|
|
+ p_from = s - 1;
|
|
|
+ }
|
|
|
+
|
|
|
+ for (Size i = p_from; i >= 0; i--) {
|
|
|
+ if (get(i) == p_val) {
|
|
|
+ return i;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ return -1;
|
|
|
+}
|
|
|
+
|
|
|
+template <class T>
|
|
|
+typename CowData<T>::Size CowData<T>::count(const T &p_val) const {
|
|
|
+ Size amount = 0;
|
|
|
+ for (Size i = 0; i < size(); i++) {
|
|
|
+ if (get(i) == p_val) {
|
|
|
+ amount++;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ return amount;
|
|
|
+}
|
|
|
+
|
|
|
template <class T>
|
|
|
void CowData<T>::_ref(const CowData *p_from) {
|
|
|
_ref(*p_from);
|