// Copyright (C) 2020 The Qt Company Ltd. // Copyright (C) 2019 Intel Corporation. // SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only #ifndef QARRAYDATA_H #define QARRAYDATA_H #include #include #include QT_BEGIN_NAMESPACE template struct QTypedArrayData; struct QArrayData { enum AllocationOption { Grow, KeepSize }; enum GrowthPosition { GrowsAtEnd, GrowsAtBeginning }; enum ArrayOption { ArrayOptionDefault = 0, CapacityReserved = 0x1 //!< the capacity was reserved by the user, try to keep it }; Q_DECLARE_FLAGS(ArrayOptions, ArrayOption) QBasicAtomicInt ref_; ArrayOptions flags; qsizetype alloc; qsizetype allocatedCapacity() noexcept { return alloc; } qsizetype constAllocatedCapacity() const noexcept { return alloc; } /// Returns true if sharing took place bool ref() noexcept { ref_.ref(); return true; } /// Returns false if deallocation is necessary bool deref() noexcept { return ref_.deref(); } bool isShared() const noexcept { return ref_.loadRelaxed() != 1; } // Returns true if a detach is necessary before modifying the data // This method is intentionally not const: if you want to know whether // detaching is necessary, you should be in a non-const function already bool needsDetach() const noexcept { return ref_.loadRelaxed() > 1; } qsizetype detachCapacity(qsizetype newSize) const noexcept { if (flags & CapacityReserved && newSize < constAllocatedCapacity()) return constAllocatedCapacity(); return newSize; } [[nodiscard]] #if defined(Q_CC_GNU) __attribute__((__malloc__)) #endif static Q_CORE_EXPORT void *allocate(QArrayData **pdata, qsizetype objectSize, qsizetype alignment, qsizetype capacity, AllocationOption option = QArrayData::KeepSize) noexcept; [[nodiscard]] static Q_CORE_EXPORT QPair reallocateUnaligned(QArrayData *data, void *dataPointer, qsizetype objectSize, qsizetype newCapacity, AllocationOption option) noexcept; static Q_CORE_EXPORT void deallocate(QArrayData *data, qsizetype objectSize, qsizetype alignment) noexcept; }; Q_DECLARE_OPERATORS_FOR_FLAGS(QArrayData::ArrayOptions) template struct QTypedArrayData : QArrayData { struct AlignmentDummy { QArrayData header; T data; }; [[nodiscard]] static QPair allocate(qsizetype capacity, AllocationOption option = QArrayData::KeepSize) { static_assert(sizeof(QTypedArrayData) == sizeof(QArrayData)); QArrayData *d; void *result = QArrayData::allocate(&d, sizeof(T), alignof(AlignmentDummy), capacity, option); #if __has_builtin(__builtin_assume_aligned) result = __builtin_assume_aligned(result, Q_ALIGNOF(AlignmentDummy)); #endif return qMakePair(static_cast(d), static_cast(result)); } static QPair reallocateUnaligned(QTypedArrayData *data, T *dataPointer, qsizetype capacity, AllocationOption option) { static_assert(sizeof(QTypedArrayData) == sizeof(QArrayData)); QPair pair = QArrayData::reallocateUnaligned(data, dataPointer, sizeof(T), capacity, option); return qMakePair(static_cast(pair.first), static_cast(pair.second)); } static void deallocate(QArrayData *data) noexcept { static_assert(sizeof(QTypedArrayData) == sizeof(QArrayData)); QArrayData::deallocate(data, sizeof(T), alignof(AlignmentDummy)); } static T *dataStart(QArrayData *data, qsizetype alignment) noexcept { // Alignment is a power of two Q_ASSERT(alignment >= qsizetype(alignof(QArrayData)) && !(alignment & (alignment - 1))); void *start = reinterpret_cast( (quintptr(data) + sizeof(QArrayData) + alignment - 1) & ~(alignment - 1)); return static_cast(start); } }; namespace QtPrivate { struct Q_CORE_EXPORT QContainerImplHelper { enum CutResult { Null, Empty, Full, Subset }; static constexpr CutResult mid(qsizetype originalLength, qsizetype *_position, qsizetype *_length) { qsizetype &position = *_position; qsizetype &length = *_length; if (position > originalLength) { position = 0; length = 0; return Null; } if (position < 0) { if (length < 0 || length + position >= originalLength) { position = 0; length = originalLength; return Full; } if (length + position <= 0) { position = length = 0; return Null; } length += position; position = 0; } else if (size_t(length) > size_t(originalLength - position)) { length = originalLength - position; } if (position == 0 && length == originalLength) return Full; return length > 0 ? Subset : Empty; } }; } QT_END_NAMESPACE #endif // include guard