types_handling.hpp

Go to the documentation of this file.

#pragma once
 
#include <algorithm>  // for_each_n, transform
#include <cassert>
#include <cstring>  // memcpy, memset
#include <memory>
#include <new>  // bad_alloc
 
#include "open62541pp/detail/open62541/common.h"
#include "open62541pp/detail/traits.hpp"  // IsOneOf
#include "open62541pp/exception.hpp"
 
namespace opcua::detail {
 
/* ------------------------------------ Generic type handling ----------------------------------- */
 
template <typename T>
constexpr bool isPointerFree = IsOneOf<  // NOLINT(modernize-type-traits)
    T,
    UA_Boolean,
    UA_SByte,
    UA_Byte,
    UA_Int16,
    UA_UInt16,
    UA_Int32,
    UA_UInt32,
    UA_Int64,
    UA_UInt64,
    UA_Float,
    UA_Double,
    UA_DateTime,
    UA_Guid,
    UA_StatusCode>::value;
 
template <typename T>
constexpr bool isBorrowed(const T& /* unused */) noexcept {
    return false;
}
 
constexpr bool isBorrowed(const UA_Variant& native) noexcept {
    return native.storageType == UA_VARIANT_DATA_NODELETE;
}
 
constexpr bool isBorrowed(const UA_DataValue& native) noexcept {
    return native.value.storageType == UA_VARIANT_DATA_NODELETE;
}
 
constexpr bool isBorrowed(const UA_ExtensionObject& native) noexcept {
    return native.encoding == UA_EXTENSIONOBJECT_DECODED_NODELETE;
}
 
template <typename T>
constexpr bool isValidTypeCombination(const UA_DataType& type) {
    if constexpr (std::is_void_v<T>) {
        return true;  // allow type-erasure
    } else {
        return sizeof(T) == type.memSize;
    }
}
 
template <typename T>
constexpr void clear(T& native, const UA_DataType& type) noexcept {
    assert(isValidTypeCombination<T>(type));
    // NOLINTNEXTLINE(bugprone-branch-clone)
    if constexpr (isPointerFree<T>) {
        native = {};
    } else if (isBorrowed(native)) {
        native = {};
    } else {
        UA_clear(&native, &type);
    }
}
 
template <typename T>
void deallocate(T* native, const UA_DataType& type) noexcept {
    assert(isValidTypeCombination<T>(type));
    UA_delete(native, &type);
}
 
template <typename T>
[[nodiscard]] T* allocate(const UA_DataType& type) {
    assert(isValidTypeCombination<T>(type));
    auto* result = static_cast<T*>(UA_new(&type));
    if (result == nullptr) {
        throw std::bad_alloc{};
    }
    return result;
}
 
template <typename T>
[[nodiscard]] auto allocateUniquePtr(const UA_DataType& type) {
    auto deleter = [&type](T* native) { deallocate(native, type); };
    return std::unique_ptr<T, decltype(deleter)>(allocate<T>(type), deleter);
}
 
template <typename T>
[[nodiscard]] constexpr T copy(const T& src, const UA_DataType& type) noexcept(isPointerFree<T>) {
    assert(isValidTypeCombination<T>(type));
    if constexpr (!isPointerFree<T>) {
        T dst;  // NOLINT, initialized in UA_copy function
        throwIfBad(UA_copy(&src, &dst, &type));
        return dst;
    } else {
        return src;
    }
}
 
/* ----------------------------------- Generic array handling ----------------------------------- */
 
/**
 * Sentinel for empty but defined arrays.
 *
 * In OPC UA, arrays can have a length of zero or more with the usual meaning.
 * In addition, arrays can be undefined. Then, they don't even have a length.
 * In the binary encoding, this is indicated by an array of length -1.
 *
 * In open62541, size_t is used for array lengths.
 * An undefined array has length 0 and the data pointer is NULL.
 * An array of length 0 also has length 0 but a data pointer UA_EMPTY_ARRAY_SENTINEL (0x01).
 */
inline constexpr uintptr_t emptyArraySentinel = 0x01;
 
template <typename T>
T* stripEmptyArraySentinel(T* array) noexcept {
    // NOLINTNEXTLINE
    return reinterpret_cast<T*>(reinterpret_cast<uintptr_t>(array) & ~emptyArraySentinel);
}
 
template <typename T>
void deallocateArray(T* array) noexcept {
    UA_free(stripEmptyArraySentinel(array));  // NOLINT
}
 
template <typename T>
void deallocateArray(T* array, size_t size, const UA_DataType& type) noexcept {
    assert(isValidTypeCombination<T>(type));
    std::for_each_n(array, size, [&](auto& item) { clear(item, type); });
    deallocateArray(array);
}
 
template <typename T>
[[nodiscard]] T* allocateArray(size_t size) {
    if (size > UA_INT32_MAX) {
        throw std::bad_alloc{};
    }
    if (size == 0) {
        return reinterpret_cast<T*>(emptyArraySentinel);  // NOLINT
    }
    auto* result = static_cast<T*>(UA_calloc(size, sizeof(T)));  // NOLINT
    if (result == nullptr) {
        throw std::bad_alloc{};
    }
    return result;
}
 
template <typename T>
[[nodiscard]] T* allocateArray(size_t size, [[maybe_unused]] const UA_DataType& type) {
    assert(isValidTypeCombination<T>(type));
    return allocateArray<T>(size);
}
 
template <typename T>
[[nodiscard]] auto allocateArrayUniquePtr(size_t size, const UA_DataType& type) {
    auto deleter = [&type, size](T* native) { deallocateArray(native, size, type); };
    return std::unique_ptr<T, decltype(deleter)>(allocateArray<T>(size, type), deleter);
}
 
template <typename T>
[[nodiscard]] T* copyArray(const T* src, size_t size) {
    T* dst = allocateArray<T>(size);
    if (src == nullptr) {
        return dst;
    }
    std::memcpy(dst, src, size * sizeof(T));
    return dst;
}
 
template <typename T>
[[nodiscard]] T* copyArray(const T* src, size_t size, const UA_DataType& type) {
    T* dst = allocateArray<T>(size, type);
    if (src == nullptr) {
        return dst;
    }
    if constexpr (!isPointerFree<T>) {
        // NOLINTNEXTLINE(cppcoreguidelines-pro-bounds-pointer-arithmetic)
        std::transform(src, src + size, dst, [&](const T& item) { return copy(item, type); });
    } else {
        std::memcpy(dst, src, size * sizeof(T));
    }
    return dst;
}
 
template <typename T>
void resizeArray(T*& array, size_t& size, size_t newSize, const UA_DataType& type) {
    if (array == nullptr || newSize == size) {
        return;
    }
    T* newArray = allocateArray<T>(newSize, type);
    std::memcpy(newArray, array, std::min(size, newSize) * sizeof(T));
    if (newSize > size) {
        std::memset(newArray + size, 0, newSize - size);  // NOLINT
    }
    deallocateArray<T>(array, size, type);
    array = newArray;
    size = newSize;
}
 
}  // namespace opcua::detail