2024-10-28 15:57:39 +01:00
|
|
|
// Luanti
|
|
|
|
// SPDX-License-Identifier: LGPL-2.1-or-later
|
|
|
|
// Copyright (C) 2010-2013 celeron55, Perttu Ahola <celeron55@gmail.com>
|
2012-06-17 01:29:13 +03:00
|
|
|
|
2017-08-17 22:19:39 +02:00
|
|
|
#pragma once
|
2012-06-17 01:29:13 +03:00
|
|
|
|
2017-11-09 01:56:20 +03:00
|
|
|
#include "irrlichttypes.h"
|
|
|
|
#include "debug.h" // For assert()
|
2012-06-17 04:00:31 +03:00
|
|
|
#include <cstring>
|
2021-12-01 20:22:33 +01:00
|
|
|
#include <memory> // std::shared_ptr
|
2024-02-17 15:35:33 +01:00
|
|
|
#include <string_view>
|
2021-12-01 20:22:33 +01:00
|
|
|
|
|
|
|
|
2025-03-26 19:08:31 +01:00
|
|
|
template<typename T>
|
|
|
|
class ConstSharedPtr {
|
2021-12-01 20:22:33 +01:00
|
|
|
public:
|
|
|
|
ConstSharedPtr(T *ptr) : ptr(ptr) {}
|
|
|
|
ConstSharedPtr(const std::shared_ptr<T> &ptr) : ptr(ptr) {}
|
|
|
|
|
|
|
|
const T* get() const noexcept { return ptr.get(); }
|
|
|
|
const T& operator*() const noexcept { return *ptr.get(); }
|
|
|
|
const T* operator->() const noexcept { return ptr.get(); }
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::shared_ptr<T> ptr;
|
|
|
|
};
|
2012-06-17 01:29:13 +03:00
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
class Buffer
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
Buffer()
|
|
|
|
{
|
|
|
|
m_size = 0;
|
2022-07-13 11:57:12 +02:00
|
|
|
data = nullptr;
|
2012-06-17 01:29:13 +03:00
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
Buffer(size_t size)
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
|
|
|
m_size = size;
|
2025-01-14 20:26:29 +01:00
|
|
|
if (size != 0) {
|
2012-06-17 01:29:13 +03:00
|
|
|
data = new T[size];
|
2025-01-14 20:26:29 +01:00
|
|
|
} else {
|
2022-07-13 11:57:12 +02:00
|
|
|
data = nullptr;
|
2025-01-14 20:26:29 +01:00
|
|
|
}
|
2012-06-17 01:29:13 +03:00
|
|
|
}
|
2021-12-01 20:22:33 +01:00
|
|
|
|
|
|
|
// Disable class copy
|
|
|
|
Buffer(const Buffer &) = delete;
|
|
|
|
Buffer &operator=(const Buffer &) = delete;
|
|
|
|
|
2021-09-17 18:14:25 +02:00
|
|
|
Buffer(Buffer &&buffer)
|
|
|
|
{
|
|
|
|
m_size = buffer.m_size;
|
2025-01-14 20:26:29 +01:00
|
|
|
if (m_size != 0) {
|
2021-09-17 18:14:25 +02:00
|
|
|
data = buffer.data;
|
|
|
|
buffer.data = nullptr;
|
|
|
|
buffer.m_size = 0;
|
2025-01-14 20:26:29 +01:00
|
|
|
} else {
|
2021-09-17 18:14:25 +02:00
|
|
|
data = nullptr;
|
2025-01-14 20:26:29 +01:00
|
|
|
}
|
2021-09-17 18:14:25 +02:00
|
|
|
}
|
|
|
|
// Copies whole buffer
|
2025-03-26 19:08:31 +01:00
|
|
|
Buffer(const T *t, size_t size)
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
|
|
|
m_size = size;
|
2025-01-14 20:26:29 +01:00
|
|
|
if (size != 0) {
|
2012-06-17 01:29:13 +03:00
|
|
|
data = new T[size];
|
2025-01-14 20:26:29 +01:00
|
|
|
memcpy(data, t, sizeof(T) * size);
|
|
|
|
} else {
|
2022-07-13 11:57:12 +02:00
|
|
|
data = nullptr;
|
2025-01-14 20:26:29 +01:00
|
|
|
}
|
2012-06-17 01:29:13 +03:00
|
|
|
}
|
2021-09-17 18:14:25 +02:00
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
~Buffer()
|
|
|
|
{
|
|
|
|
drop();
|
|
|
|
}
|
2021-09-17 18:14:25 +02:00
|
|
|
|
|
|
|
Buffer& operator=(Buffer &&buffer)
|
|
|
|
{
|
2025-03-26 19:08:31 +01:00
|
|
|
if (this == &buffer)
|
2021-09-17 18:14:25 +02:00
|
|
|
return *this;
|
|
|
|
drop();
|
|
|
|
m_size = buffer.m_size;
|
2025-01-14 20:26:29 +01:00
|
|
|
if (m_size != 0) {
|
2021-09-17 18:14:25 +02:00
|
|
|
data = buffer.data;
|
|
|
|
buffer.data = nullptr;
|
|
|
|
buffer.m_size = 0;
|
2025-01-14 20:26:29 +01:00
|
|
|
} else {
|
2021-09-17 18:14:25 +02:00
|
|
|
data = nullptr;
|
2025-01-14 20:26:29 +01:00
|
|
|
}
|
2021-09-17 18:14:25 +02:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2021-12-01 20:22:33 +01:00
|
|
|
void copyTo(Buffer &buffer) const
|
|
|
|
{
|
|
|
|
buffer.drop();
|
|
|
|
buffer.m_size = m_size;
|
|
|
|
if (m_size != 0) {
|
|
|
|
buffer.data = new T[m_size];
|
2025-01-14 20:26:29 +01:00
|
|
|
memcpy(buffer.data, data, sizeof(T) * m_size);
|
2021-12-01 20:22:33 +01:00
|
|
|
} else {
|
|
|
|
buffer.data = nullptr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2025-03-26 19:08:31 +01:00
|
|
|
T & operator[](size_t i) const
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
|
|
|
return data[i];
|
|
|
|
}
|
|
|
|
T * operator*() const
|
|
|
|
{
|
|
|
|
return data;
|
|
|
|
}
|
2021-09-17 18:14:25 +02:00
|
|
|
|
2025-03-26 19:08:31 +01:00
|
|
|
size_t getSize() const
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
|
|
|
return m_size;
|
|
|
|
}
|
2021-09-17 18:14:25 +02:00
|
|
|
|
2024-02-17 15:35:33 +01:00
|
|
|
operator std::string_view() const
|
|
|
|
{
|
2025-01-14 20:26:29 +01:00
|
|
|
if (!data) {
|
2024-02-17 15:35:33 +01:00
|
|
|
return std::string_view();
|
2025-01-14 20:26:29 +01:00
|
|
|
}
|
2024-02-17 15:35:33 +01:00
|
|
|
return std::string_view(reinterpret_cast<char*>(data), m_size);
|
|
|
|
}
|
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
private:
|
|
|
|
void drop()
|
|
|
|
{
|
2017-06-05 01:52:55 +02:00
|
|
|
delete[] data;
|
2012-06-17 01:29:13 +03:00
|
|
|
}
|
|
|
|
T *data;
|
2025-03-26 19:08:31 +01:00
|
|
|
size_t m_size;
|
2012-06-17 01:29:13 +03:00
|
|
|
};
|
|
|
|
|
2015-08-06 02:15:21 -04:00
|
|
|
/************************************************
|
|
|
|
* !!! W A R N I N G !!! *
|
|
|
|
* *
|
|
|
|
* This smart pointer class is NOT thread safe. *
|
|
|
|
* ONLY use in a single-threaded context! *
|
|
|
|
* *
|
|
|
|
************************************************/
|
2012-06-17 01:29:13 +03:00
|
|
|
template <typename T>
|
|
|
|
class SharedBuffer
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
SharedBuffer()
|
|
|
|
{
|
|
|
|
m_size = 0;
|
2025-03-26 19:08:31 +01:00
|
|
|
data = nullptr;
|
|
|
|
refcount = new u32;
|
2012-06-17 01:29:13 +03:00
|
|
|
(*refcount) = 1;
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
|
|
|
SharedBuffer(size_t size)
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
|
|
|
m_size = size;
|
2025-01-14 20:26:29 +01:00
|
|
|
if (m_size != 0) {
|
2012-06-17 01:29:13 +03:00
|
|
|
data = new T[m_size];
|
2025-01-14 20:26:29 +01:00
|
|
|
} else {
|
2022-07-13 11:57:12 +02:00
|
|
|
data = nullptr;
|
2025-01-14 20:26:29 +01:00
|
|
|
}
|
|
|
|
|
2025-03-26 19:08:31 +01:00
|
|
|
refcount = new u32;
|
2025-01-14 20:26:29 +01:00
|
|
|
memset(data, 0, sizeof(T) * m_size);
|
2012-06-17 01:29:13 +03:00
|
|
|
(*refcount) = 1;
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
SharedBuffer(const SharedBuffer &buffer)
|
|
|
|
{
|
|
|
|
m_size = buffer.m_size;
|
|
|
|
data = buffer.data;
|
|
|
|
refcount = buffer.refcount;
|
|
|
|
(*refcount)++;
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
|
|
|
SharedBuffer & operator=(const SharedBuffer &buffer)
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
2025-03-26 19:08:31 +01:00
|
|
|
if (this == &buffer)
|
2012-06-17 01:29:13 +03:00
|
|
|
return *this;
|
|
|
|
drop();
|
|
|
|
m_size = buffer.m_size;
|
|
|
|
data = buffer.data;
|
|
|
|
refcount = buffer.refcount;
|
|
|
|
(*refcount)++;
|
|
|
|
return *this;
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2025-01-14 20:26:29 +01:00
|
|
|
//! Copies whole buffer
|
2025-03-26 19:08:31 +01:00
|
|
|
SharedBuffer(const T *t, size_t size)
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
|
|
|
m_size = size;
|
2025-01-14 20:26:29 +01:00
|
|
|
if (m_size != 0) {
|
2012-06-17 01:29:13 +03:00
|
|
|
data = new T[m_size];
|
2025-01-14 20:26:29 +01:00
|
|
|
memcpy(data, t, sizeof(T) * m_size);
|
|
|
|
} else {
|
2022-07-13 11:57:12 +02:00
|
|
|
data = nullptr;
|
2025-01-14 20:26:29 +01:00
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
refcount = new u32;
|
2012-06-17 01:29:13 +03:00
|
|
|
(*refcount) = 1;
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2025-01-14 20:26:29 +01:00
|
|
|
//! Copies whole buffer
|
|
|
|
SharedBuffer(const Buffer<T> &buffer) : SharedBuffer(*buffer, buffer.getSize())
|
2017-09-05 22:14:56 +02:00
|
|
|
{
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
~SharedBuffer()
|
|
|
|
{
|
|
|
|
drop();
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
|
|
|
T & operator[](size_t i) const
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
2014-04-06 15:12:04 +02:00
|
|
|
assert(i < m_size);
|
2012-06-17 01:29:13 +03:00
|
|
|
return data[i];
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
T * operator*() const
|
|
|
|
{
|
|
|
|
return data;
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
|
|
|
size_t getSize() const
|
2012-06-17 01:29:13 +03:00
|
|
|
{
|
|
|
|
return m_size;
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
operator Buffer<T>() const
|
|
|
|
{
|
|
|
|
return Buffer<T>(data, m_size);
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
private:
|
|
|
|
void drop()
|
|
|
|
{
|
|
|
|
assert((*refcount) > 0);
|
|
|
|
(*refcount)--;
|
2025-01-14 20:26:29 +01:00
|
|
|
if (*refcount == 0) {
|
2017-06-05 01:52:55 +02:00
|
|
|
delete[] data;
|
2012-06-17 01:29:13 +03:00
|
|
|
delete refcount;
|
|
|
|
}
|
|
|
|
}
|
2025-03-26 19:08:31 +01:00
|
|
|
|
2012-06-17 01:29:13 +03:00
|
|
|
T *data;
|
2025-03-26 19:08:31 +01:00
|
|
|
size_t m_size;
|
|
|
|
u32 *refcount;
|
2012-06-17 01:29:13 +03:00
|
|
|
};
|
2022-07-13 11:57:12 +02:00
|
|
|
|
2022-09-11 13:28:37 -04:00
|
|
|
// This class is not thread-safe!
|
|
|
|
class IntrusiveReferenceCounted {
|
|
|
|
public:
|
|
|
|
IntrusiveReferenceCounted() = default;
|
|
|
|
virtual ~IntrusiveReferenceCounted() = default;
|
|
|
|
void grab() noexcept { ++m_refcount; }
|
|
|
|
void drop() noexcept { if (--m_refcount == 0) delete this; }
|
|
|
|
|
2024-08-29 16:13:30 +02:00
|
|
|
DISABLE_CLASS_COPY(IntrusiveReferenceCounted)
|
2022-09-11 13:28:37 -04:00
|
|
|
private:
|
|
|
|
u32 m_refcount = 1;
|
|
|
|
};
|