avutils.h

Go to the documentation of this file.

#pragma once
 
#include "avconfig.h"
 
#include <ranges>
#include <string>
#include <vector>
#include <deque>
#include <memory>
#include <mutex>
#include <sstream>
#include <algorithm>
#include <functional>
#include <type_traits>
 
#if AVCPP_CXX_STANDARD >= 20
#  include <span>
#endif
 
#include "ffmpeg.h"
#include "avtime.h"
 
#if AVCPP_HAS_AVFORMAT
extern "C" {
#include <libavformat/avformat.h>
}
#endif
 
//
// Functions
//
namespace av {
 
// Basic FFmpeg constants
constexpr auto NoPts = static_cast<int64_t>(AV_NOPTS_VALUE);
constexpr auto TimeBase = static_cast<int>(AV_TIME_BASE);
constexpr auto TimeBaseQ = AVRational{1, AV_TIME_BASE};
 
 
template<typename R, typename T>
R lexical_cast(const T& v)
{
    R result;
    std::stringstream ss;
    ss << v;
    ss >> result;
    return result;
}
 
class noncopyable
{
protected:
    noncopyable() = default;
    noncopyable( const noncopyable& ) = delete;
    void operator=( const noncopyable& ) = delete;
};
 
void set_logging_level(int32_t level);
 
 
void set_logging_level(const std::string& level);
 
// Compat code
#define setFFmpegLoggingLevel set_logging_level
 
[[deprecated("Use av::hex_dump()")]]
void dumpBinaryBuffer(uint8_t *buffer, int buffer_size, int width = 16);
 
 
std::string error2string(int error);
 
}
 
 
 
 
//
// Classes
//
namespace av {
 
struct EmptyDeleter
{
    void operator()(void *) {}
};
 
namespace v1 {
struct AvDeleter
{
    bool operator() (struct SwsContext* &swsContext);
    bool operator() (struct AVCodecContext* &codecContext);
#if AVCPP_HAS_AVFORMAT
    bool operator() (struct AVOutputFormat* &format);
    bool operator() (struct AVFormatContext* &formatContext);
#endif // if AVCPP_HAS_AVFORMAT
    bool operator() (struct AVFrame* &frame);
    bool operator() (struct AVPacket* &packet);
    bool operator() (struct AVDictionary* &dictionary);
#if AVCPP_HAS_AVFILTER
    bool operator ()(struct AVFilterInOut* &filterInOut);
#endif // if AVCPP_HAS_AVFILTER
};
} // ::v1
 
inline namespace v2 {
struct SmartDeleter
{
    template<typename T>
    bool operator() (T *ptr) {
        return v1::AvDeleter()(ptr);
    }
};
}
 
template<typename T>
std::unique_ptr<T, void(*)(void*)> malloc(size_t size)
{
    return {static_cast<T*>(av_malloc(size)), av_free};
}
 
template<typename T>
std::unique_ptr<T, void(*)(void*)> mallocz(size_t size)
{
    return {static_cast<T*>(av_mallocz(size)), av_free};
}
 
template<typename T>
std::unique_ptr<T, void(*)(void*)> memdup(const void *p, size_t size)
{
    return {static_cast<T*>(av_memdup(p, size)), av_free};
}
 
#if 0
struct AvNextElement
{
    AVFilterInOut * operator()(AVFilterInOut * x) const
    {
        if (x)
            return x->next;
        else
            return 0;
    }
};
#endif
 
 
 
template<typename T, typename V = T>
class ScopedValue
{
public:
    ScopedValue(T &var, const V& outValue)
        : var(var),
          outValue(outValue)
    {
    }
 
    ScopedValue(T &var, const V &inValue, const V &outValue)
        : var(var),
          outValue(outValue)
    {
        this->var = inValue;
    }
 
    ~ScopedValue()
    {
        var = outValue;
    }
 
private:
    T& var;
    V  outValue;
};
 
 
class ScopeOutAction
{
public:
    template<typename Proc>
    ScopeOutAction(const Proc& proc)
        : m_proc(proc)
    {}
 
    template<typename Proc>
    ScopeOutAction(Proc&& proc)
        : m_proc(std::forward<Proc>(proc))
    {}
 
    ~ScopeOutAction()
    {
        if (m_proc)
            m_proc();
    }
 
private:
    std::function<void()> m_proc;
};
 
 
 
#if AVCPP_CXX_STANDARD >= 20
 
template<class T>
struct SentinelEndPolicy
{
    using value_type = std::remove_reference_t<T>;
    value_type* end{};
    constexpr bool isEnd(T* it) const noexcept {
        return it == end;
    }
};
 
template<class T>
struct SentinelUntilPolicy
{
    using value_type = std::remove_cvref_t<T>;
    value_type value{};
    constexpr bool isEnd(T* it) const noexcept {
        return it == nullptr || *it == value;
    }
};
 
 
template<class T, class Policy>
struct ArraySentinel
{
    Policy policy;
    friend constexpr bool operator==(T* it, const ArraySentinel& s) noexcept {
        return s.policy.isEnd(it);
    }
};
 
template<class T, class U, bool UseProxy>
struct ReferenceSelector;
 
template<class T, class U>
struct ReferenceSelector<T, U, true>
{
    using Type = T&;
};
 
template<class T, class U>
struct ReferenceSelector<T, U, false>
{
    using Type = U;
};
 
template<typename T, typename U>
struct ArrayIterator
{
    static constexpr bool UseProxy = !std::is_same_v<std::remove_cvref_t<T>, std::remove_cvref_t<U>>;
 
    using difference_type   = std::ptrdiff_t;
    using value_type        = std::remove_reference_t<U>;
    using pointer           = std::remove_reference_t<T>*;  // or also value_type*
 
    using reference         = typename ReferenceSelector<T, U, !UseProxy>::Type;
    using iterator_category =
        std::conditional_t<
            UseProxy,
            std::random_access_iterator_tag,
            std::contiguous_iterator_tag>;
 
    ArrayIterator() noexcept = default; // semiregular
    ArrayIterator(pointer ptr) noexcept : m_ptr(ptr) {}
 
    reference operator*() const noexcept {
        if constexpr (UseProxy)
            return reference{*m_ptr};
        else
            return *m_ptr;
    }
 
    ArrayIterator& operator++()      noexcept { m_ptr++; return *this; }
    ArrayIterator  operator++(int)   noexcept { ArrayIterator tmp = *this; ++(*this); return tmp; }
 
    ArrayIterator& operator--()      noexcept { m_ptr--; return *this; }
    ArrayIterator  operator--(int)   noexcept { ArrayIterator tmp = *this; --(*this); return tmp; }
 
    ArrayIterator& operator+=(int n) noexcept { m_ptr+=n; return *this; }
    ArrayIterator& operator-=(int n) noexcept { m_ptr-=n; return *this; }
 
    // i[n]
    reference operator[](int n) noexcept {
        if constexpr (UseProxy)
            return reference{m_ptr[n]};
        else
            return m_ptr[n];
    }
    const reference operator[](int n) const noexcept {
        if constexpr (UseProxy)
            return reference{m_ptr[n]};
        else
            return m_ptr[n];
    }
    //reference operator&() noexcept { return }
    // a + n
    // n + a
    friend ArrayIterator operator+(const ArrayIterator& a, int n) noexcept { return {a.m_ptr + n}; }
    friend ArrayIterator operator+(int n, const ArrayIterator& a) noexcept { return {a.m_ptr + n}; }
    // i - n
    friend ArrayIterator operator-(const ArrayIterator& a, int n) noexcept { return {a.m_ptr - n}; }
    // b - a
    friend difference_type operator-(const ArrayIterator& b, const ArrayIterator& a) noexcept { return b.m_ptr - a.m_ptr; }
 
    // a<=>b
    friend std::strong_ordering operator<=>(const ArrayIterator& a, const ArrayIterator& b) noexcept {
        return a.m_ptr == b.m_ptr ? std::strong_ordering::equal
               : a.m_ptr < b.m_ptr  ? std::strong_ordering::less
                                   : std::strong_ordering::greater;
    }
    friend bool operator== (const ArrayIterator& a, const ArrayIterator& b) { return a.m_ptr == b.m_ptr; };
    friend bool operator!= (const ArrayIterator& a, const ArrayIterator& b) { return !(a == b); };
 
    //
    // Sentinels
    //
    friend bool operator==(ArrayIterator it, std::default_sentinel_t) = delete;
 
    friend bool operator==(ArrayIterator it, auto sentinel) { return it.m_ptr == sentinel; }
    friend bool operator!=(ArrayIterator it, auto sentinel) { return it.m_ptr != sentinel; }
    friend bool operator==(auto sentinel, ArrayIterator it) { return it.m_ptr == sentinel; }
    friend bool operator!=(auto sentinel, ArrayIterator it) { return it.m_ptr != sentinel; }
 
private:
    pointer m_ptr{};
};
 
template<typename T, typename U, class Policy>
class ArrayView : public std::ranges::view_interface<ArrayView<T, U, Policy>>
{
public:
    constexpr ArrayView(T *ptr, Policy policy)
        : m_ptr(ptr), m_policy(std::move(policy))
    {}
 
    auto constexpr begin() const noexcept
    {
        return ArrayIterator<T, U>{m_ptr};
    }
 
    auto constexpr end() const noexcept
    {
        // special case to allow back()/size()/etc method for well-defined sizes
        if constexpr (std::is_same_v<Policy, std::size_t>) {
            return ArrayIterator<T, U>{m_ptr + m_policy};
        } else {
            return ArraySentinel<T, Policy>{m_policy};
        }
    }
 
private:
    T *m_ptr{};
    Policy m_policy{};
};
 
template<class U>
auto make_array_view_size(auto* ptr, std::size_t size)
{
    using T = std::remove_reference_t<decltype(*ptr)>;
    return ArrayView<T, U, std::size_t>(ptr, size);
}
 
template<class U>
auto make_array_view_until(auto* ptr, auto value)
{
    using T = std::remove_reference_t<decltype(*ptr)>;
    return ArrayView<T, U, SentinelUntilPolicy<T>>(ptr, SentinelUntilPolicy<T>{value});
}
 
template<typename T, typename L>
    requires std::ranges::range<L> &&
    requires(L& r) {
        std::ranges::empty(r);
    }
T guessValue(const T& value, L list)
{
    if (list.empty())
        return value;
 
    T best = value;
    T bestDistance = std::numeric_limits<T>::max();
 
    for (auto&& cur : list) {
        auto const distance = std::max(cur, value) - std::min(cur, value);
        if (distance < bestDistance) {
            bestDistance = distance;
            best = cur;
        }
    }
 
    return best;
}
 
#endif // AVCPP_CXX_STANDARD
 
template<typename T>
struct EqualComparator
{
    EqualComparator(const T& value)
        : value(value)
    {}
 
    bool operator() (const T& value) const
    {
        if (this->value == value)
            return true;
 
        return false;
    }
 
    const T& value;
};
 
template<typename T, typename L, typename C>
T guessValue(const T& value, const L * list, C endListComparator)
{
    if (!list)
        return value;
 
    T best = value;
    T bestDistance = std::numeric_limits<T>::max();
 
    for (const L * ptr = list; !endListComparator(*ptr); ++ptr) {
        auto const cur = *ptr;
        auto const distance = std::max(cur, value) - std::min(cur, value);
        if (distance < bestDistance) {
            bestDistance = distance;
            best = cur;
        }
    }
 
    return best;
}
 
 
template<typename T, typename Container>
void array_to_container(const T* array, std::size_t nelements, Container &container)
{
    if (!array || nelements == 0)
        return;
    std::copy_n(array, array + nelements, std::back_inserter(container));
}
 
template<typename T, typename Container, typename Callable>
void array_to_container(const T* array, std::size_t nelements, Container &container, Callable convert)
{
    if (!array || nelements == 0)
        return;
    // TBD: implement in more clean way
    //std::copy_n(array, array + nelemnts, std::back_inserter(container));
    for (auto i = 0u; i < nelements; ++i) {
        container.push_back(convert(array[i]));
    }
}
 
template<typename T, typename Container, typename Compare>
void array_to_container(const T* array, Container &container, Compare isEnd)
{
    if (!array)
        return;
    T value;
    while (!isEnd(value = *array++))
        container.push_back(value);
}
 
template<typename T, typename Container, typename Compare, typename Callable>
void array_to_container(const T* array, Container &container, Compare isEnd, Callable convert)
{
    if (!array)
        return;
    T value;
    while (!isEnd(value = *array++))
        container.push_back(convert(value));
}
 
 
//
// Allow to use without AVFORMAT library
//
void hex_dump(FILE *f, const uint8_t *buf, std::size_t size);
void hex_dump_log(void *avcl, int level, const uint8_t *buf, std::size_t size);
 
#if AVCPP_CXX_STANDARD >= 20
void hex_dump(FILE *f, std::span<const uint8_t> buf);
void hex_dump_log(void *avcl, int level, std::span<const uint8_t> buf);
#endif // if AVCPP_CXX_STANDARD >= 20
 
} // ::av
 
 
#ifdef __cpp_lib_format
#    include <format>
 
namespace av {
template <typename B>
concept has_name_method_with_ec = requires(const B& type, std::error_code ec) {
    { type.name(ec) } -> std::convertible_to<std::string_view>;
};
 
template <typename B>
concept has_name_method_without_ec = requires(const B& type) {
    { type.name() } -> std::convertible_to<std::string_view>;
};
 
template <typename B>
concept has_long_name_method_with_ec = requires(const B& type, std::error_code ec) {
    { type.longName(ec) } -> std::convertible_to<std::string_view>;
};
 
template <typename B>
concept has_long_name_method_without_ec = requires(const B& type) {
    { type.longName() } -> std::convertible_to<std::string_view>;
};
} // ::av
 
template <class T, class CharT>
    requires av::has_name_method_with_ec<T> || av::has_name_method_without_ec<T>
struct std::formatter<T, CharT>
{
    bool longName = false;
 
    template<typename ParseContext>
    constexpr ParseContext::iterator parse(ParseContext& ctx)
    {
        auto it = ctx.begin();
        if constexpr (requires { requires av::has_long_name_method_with_ec<T> || av::has_long_name_method_without_ec<T>; }) {
            if (it == ctx.end())
                return it;
            if (*it == 'l') {
                longName = true;
                ++it;
            }
            if (it != ctx.end() && *it != '}')
                throw std::format_error("Invalid format args");
        }
        return it;
    }
 
    template<typename ParseContext>
    auto format(const T& value, ParseContext& ctx) const
    {
        if (longName) {
            if constexpr (requires { requires av::has_long_name_method_with_ec<T>; }) {
                std::error_code dummy;
                return std::format_to(ctx.out(), "{}", value.longName(dummy));
            } else if constexpr (requires { requires av::has_long_name_method_without_ec<T>; }) {
                return std::format_to(ctx.out(), "{}", value.longName());
            }
        } else {
            if constexpr (requires { requires av::has_name_method_with_ec<T>; }) {
                std::error_code dummy;
                return std::format_to(ctx.out(), "{}", value.name(dummy));
            } else {
                return std::format_to(ctx.out(), "{}", value.name());
            }
        }
        return ctx.out();
    }
};
#endif