LLVMFuzzerTestOneInput:
   17|    638|{
   18|    638|    constexpr auto var_count = 4;
   19|       |
   20|    638|    using array_t = immer::array<int, immer::default_memory_policy>;
   21|    638|    using size_t  = std::uint8_t;
   22|       |
   23|    638|    auto vars = std::array<array_t, var_count>{};
   24|       |
   25|    638|    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
   26|    638|    auto is_valid_index = [](auto& v) {
   27|    638|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   28|    638|    };
   29|    638|    auto is_valid_size = [](auto& v) {
   30|    638|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   31|    638|    };
   32|       |    // limit doing immutable pushes on vectors that are too big already to
   33|       |    // prevent timeouts
   34|    638|    auto too_big = [](auto&& v) { return v.size() > (std::size_t{1} << 10); };
   35|    638|    return fuzzer_input{data, size}.run([&](auto& in) {
   36|    638|        enum ops
   37|    638|        {
   38|    638|            op_push_back,
   39|    638|            op_update,
   40|    638|            op_take,
   41|    638|            op_push_back_move,
   42|    638|            op_update_move,
   43|    638|            op_take_move,
   44|    638|        };
   45|    638|        auto src = read<char>(in, is_valid_var);
   46|    638|        auto dst = read<char>(in, is_valid_var);
   47|    638|        switch (read<char>(in)) {
   48|    638|        case op_push_back: {
   49|    638|            if (!too_big(vars[src]))
   50|    638|                vars[dst] = vars[src].push_back(42);
   51|    638|            break;
   52|    638|        }
   53|    638|        case op_update: {
   54|    638|            auto idx  = read<size_t>(in, is_valid_index(vars[src]));
   55|    638|            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
   56|    638|            break;
   57|    638|        }
   58|    638|        case op_take: {
   59|    638|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   60|    638|            vars[dst] = vars[src].take(idx);
   61|    638|            break;
   62|    638|        }
   63|    638|        case op_push_back_move: {
   64|    638|            if (!too_big(vars[src]))
   65|    638|                vars[dst] = std::move(vars[src]).push_back(12);
   66|    638|            break;
   67|    638|        }
   68|    638|        case op_update_move: {
   69|    638|            auto idx = read<size_t>(in, is_valid_index(vars[src]));
   70|    638|            vars[dst] =
   71|    638|                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });
   72|    638|            break;
   73|    638|        }
   74|    638|        case op_take_move: {
   75|    638|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   76|    638|            vars[dst] = std::move(vars[src]).take(idx);
   77|    638|            break;
   78|    638|        }
   79|    638|        default:
   80|    638|            break;
   81|    638|        };
   82|    638|        return true;
   83|    638|    });
   84|    638|}
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_:
   35|   368k|    return fuzzer_input{data, size}.run([&](auto& in) {
   36|   368k|        enum ops
   37|   368k|        {
   38|   368k|            op_push_back,
   39|   368k|            op_update,
   40|   368k|            op_take,
   41|   368k|            op_push_back_move,
   42|   368k|            op_update_move,
   43|   368k|            op_take_move,
   44|   368k|        };
   45|   368k|        auto src = read<char>(in, is_valid_var);
   46|   368k|        auto dst = read<char>(in, is_valid_var);
   47|   368k|        switch (read<char>(in)) {
   48|   211k|        case op_push_back: {
  ------------------
  |  Branch (48:9): [True: 211k, False: 156k]
  ------------------
   49|   211k|            if (!too_big(vars[src]))
  ------------------
  |  Branch (49:17): [True: 197k, False: 14.4k]
  ------------------
   50|   197k|                vars[dst] = vars[src].push_back(42);
   51|   211k|            break;
   52|      0|        }
   53|  2.95k|        case op_update: {
  ------------------
  |  Branch (53:9): [True: 2.95k, False: 365k]
  ------------------
   54|  2.95k|            auto idx  = read<size_t>(in, is_valid_index(vars[src]));
   55|  2.95k|            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
   56|  2.95k|            break;
   57|      0|        }
   58|  3.91k|        case op_take: {
  ------------------
  |  Branch (58:9): [True: 3.91k, False: 364k]
  ------------------
   59|  3.91k|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   60|  3.91k|            vars[dst] = vars[src].take(idx);
   61|  3.91k|            break;
   62|      0|        }
   63|   125k|        case op_push_back_move: {
  ------------------
  |  Branch (63:9): [True: 125k, False: 242k]
  ------------------
   64|   125k|            if (!too_big(vars[src]))
  ------------------
  |  Branch (64:17): [True: 122k, False: 3.17k]
  ------------------
   65|   122k|                vars[dst] = std::move(vars[src]).push_back(12);
   66|   125k|            break;
   67|      0|        }
   68|  8.31k|        case op_update_move: {
  ------------------
  |  Branch (68:9): [True: 8.31k, False: 359k]
  ------------------
   69|  8.31k|            auto idx = read<size_t>(in, is_valid_index(vars[src]));
   70|  8.31k|            vars[dst] =
   71|  8.31k|                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });
   72|  8.31k|            break;
   73|      0|        }
   74|  5.07k|        case op_take_move: {
  ------------------
  |  Branch (74:9): [True: 5.07k, False: 363k]
  ------------------
   75|  5.07k|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   76|  5.07k|            vars[dst] = std::move(vars[src]).take(idx);
   77|  5.07k|            break;
   78|      0|        }
   79|  10.4k|        default:
  ------------------
  |  Branch (79:9): [True: 10.4k, False: 357k]
  ------------------
   80|  10.4k|            break;
   81|   368k|        };
   82|   367k|        return true;
   83|   368k|    });
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_:
   25|  1.02M|    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
  ------------------
  |  Branch (25:50): [True: 913k, False: 107k]
  |  Branch (25:62): [True: 735k, False: 177k]
  ------------------
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIRN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaOT_:
   34|   337k|    auto too_big = [](auto&& v) { return v.size() > (std::size_t{1} << 10); };
array.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_1clIN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaRT_ENKUlSC_E_clIhEEDaSC_:
   27|  37.0k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (27:39): [True: 37.0k, False: 0]
  |  Branch (27:51): [True: 11.2k, False: 25.8k]
  ------------------
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaRT_:
   26|  11.2k|    auto is_valid_index = [](auto& v) {
   27|  11.2k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   28|  11.2k|    };
array.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_:
   55|  2.93k|            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
array.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaRT_ENKUlSC_E_clIhEEDaSC_:
   30|  17.0k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (30:39): [True: 17.0k, False: 0]
  |  Branch (30:51): [True: 8.93k, False: 8.15k]
  ------------------
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaRT_:
   29|  8.98k|    auto is_valid_size = [](auto& v) {
   30|  8.98k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   31|  8.98k|    };
array.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_:
   71|  8.29k|                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });

array.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_4EEiT_:
   50|    638|    {
   51|    638|        if (size_ > fuzzer_input_max_size)
  ------------------
  |  Branch (51:13): [True: 6, False: 632]
  ------------------
   52|      6|            return 0;
   53|    632|        try {
   54|   368k|            while (step(*this))
  ------------------
  |  Branch (54:20): [True: 367k, False: 632]
  ------------------
   55|   367k|                continue;
   56|    632|        } catch (const no_more_input&) {
   57|    632|        };
   58|    632|        return 0;
   59|    632|    }
array.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_:
   70|   736k|{
   71|   736k|    auto x = read<T>(fz);
   72|  1.02M|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 285k, False: 736k]
  ------------------
   73|   285k|        x = read<T>(fz);
   74|   736k|    return x;
   75|   736k|}
_Z4readIcERKT_R12fuzzer_input:
   64|  1.38M|{
   65|  1.38M|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|  1.38M|}
_ZN12fuzzer_input4nextEmm:
   40|  1.44M|    {
   41|  1.44M|        auto& p = const_cast<void*&>(reinterpret_cast<const void*&>(data_));
   42|  1.44M|        auto r  = std::align(align, size, p, size_);
   43|  1.44M|        if (r == nullptr)
  ------------------
  |  Branch (43:13): [True: 632, False: 1.44M]
  ------------------
   44|    632|            throw no_more_input{};
   45|  1.44M|        return next(size);
   46|  1.44M|    }
_ZN12fuzzer_input4nextEm:
   30|  1.44M|    {
   31|  1.44M|        if (size_ < size)
  ------------------
  |  Branch (31:13): [True: 0, False: 1.44M]
  ------------------
   32|      0|            throw no_more_input{};
   33|  1.44M|        auto r = data_;
   34|  1.44M|        data_ += size;
   35|  1.44M|        size_ -= size;
   36|  1.44M|        return r;
   37|  1.44M|    }
array.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_1clIN5immer5arrayIiNS2_13memory_policyINS2_21free_list_heap_policyINS2_8cpp_heapELm1024EEENS2_15refcount_policyENS2_15spinlock_policyENS2_20no_transience_policyELb0ELb1EEEEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_:
   70|  11.2k|{
   71|  11.2k|    auto x = read<T>(fz);
   72|  37.1k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 25.8k, False: 11.2k]
  ------------------
   73|  25.8k|        x = read<T>(fz);
   74|  11.2k|    return x;
   75|  11.2k|}
_Z4readIhERKT_R12fuzzer_input:
   64|  54.2k|{
   65|  54.2k|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   66|  54.2k|}
array.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer5arrayIiNS2_13memory_policyINS2_21free_list_heap_policyINS2_8cpp_heapELm1024EEENS2_15refcount_policyENS2_15spinlock_policyENS2_20no_transience_policyELb0ELb1EEEEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_:
   70|  8.98k|{
   71|  8.98k|    auto x = read<T>(fz);
   72|  17.1k|    while (!cond(x))
  ------------------
  |  Branch (72:12): [True: 8.15k, False: 8.98k]
  ------------------
   73|  8.15k|        x = read<T>(fz);
   74|  8.98k|    return x;
   75|  8.98k|}

_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2Ev:
   71|  2.55k|    array() = default;
_ZNK5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4sizeEv:
  142|   391k|    IMMER_NODISCARD std::size_t size() const { return impl_.size; }
_ZNKR5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE9push_backEi:
  212|   197k|    {
  213|   197k|        return impl_.push_back(std::move(value));
  214|   197k|    }
_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2ENS_6detail6arrays13with_capacityIiS8_EE:
  330|   204k|        : impl_(std::move(impl))
  331|   204k|    {
  332|   204k|    }
array.cpp:_ZNKR5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6updateIZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_:
  266|  2.93k|    {
  267|  2.93k|        return impl_.update(index, std::forward<FnT>(fn));
  268|  2.93k|    }
_ZNKR5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4takeEm:
  293|  3.88k|    {
  294|  3.88k|        return impl_.take(elems);
  295|  3.88k|    }
_ZNO5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE9push_backEi:
  217|   122k|    {
  218|   122k|        return push_back_move(move_t{}, std::move(value));
  219|   122k|    }
_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE14push_back_moveENSt3__117integral_constantIbLb1EEEi:
  335|   122k|    {
  336|   122k|        impl_.push_back_mut({}, std::move(value));
  337|   122k|        return std::move(*this);
  338|   122k|    }
array.cpp:_ZNO5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6updateIZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_:
  272|  8.29k|    {
  273|  8.29k|        return update_move(move_t{}, index, std::forward<FnT>(fn));
  274|  8.29k|    }
array.cpp:_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE11update_moveIZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_EUlSE_E0_EEOS9_NSt3__117integral_constantIbLb1EEEmOSE_:
  356|  8.29k|    {
  357|  8.29k|        impl_.update_mut({}, index, std::forward<Fn>(fn));
  358|  8.29k|        return std::move(*this);
  359|  8.29k|    }
_ZNO5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4takeEm:
  298|  5.04k|    {
  299|  5.04k|        return take_move(move_t{}, elems);
  300|  5.04k|    }
_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE9take_moveENSt3__117integral_constantIbLb1EEEm:
  367|  5.04k|    {
  368|  5.04k|        impl_.take_mut({}, elems);
  369|  5.04k|        return std::move(*this);
  370|  5.04k|    }

_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6make_nEm:
   69|   207k|    {
   70|   207k|        return new (heap::allocate(sizeof_n(n))) node_t{};
   71|   207k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE8sizeof_nEm:
   42|   414k|    {
   43|       |        return std::max(immer_offsetof(impl_t, d) +
  ------------------
  |  |   19|   414k|#define immer_offsetof offsetof
  ------------------
   44|   414k|                            decltype(impl_t::d)::get_storage_offset() +
   45|   414k|                            sizeof(T) * count,
   46|   414k|                        sizeof(node));
   47|   414k|    }
_ZNK5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4refsEv:
   49|   755k|    refs_t& refs() const { return auto_const_cast(get<refs_t>(impl)); }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE8delete_nEPSB_mm:
   63|   207k|    {
   64|   207k|        detail::destroy_n(p->data(), sz);
   65|   207k|        heap::deallocate(sizeof_n(cap), p);
   66|   207k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4dataEv:
   55|  1.16M|    T* data() { return impl.d.get_storage_ptr(); }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6copy_nEmPSB_m:
  111|   204k|    {
  112|   204k|        return copy_n(n, p->data(), p->data() + count);
  113|   204k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6copy_nIPiSD_TnNSt3__19enable_ifIXsr6detailE21compatible_sentinel_vIT_T0_EEbE4typeELb1EEEPSB_mSG_SH_:
   98|   207k|    {
   99|   207k|        auto p = make_n(n);
  100|   207k|        IMMER_TRY {
  ------------------
  |  |   49|   207k|#define IMMER_TRY try
  ------------------
  101|   207k|            detail::uninitialized_copy(first, last, p->data());
  102|   207k|            return p;
  103|   207k|        }
  104|   207k|        IMMER_CATCH (...) {
  105|      0|            heap::deallocate(sizeof_n(n), p);
  106|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  107|      0|        }
  108|   207k|    }
_ZNK5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE10can_mutateENS9_5applyIS6_E4type4editE:
   58|   135k|    {
   59|   135k|        return refs().unique() || ownee().can_mutate(e);
  ------------------
  |  Branch (59:16): [True: 135k, False: 268]
  |  Branch (59:35): [True: 0, False: 268]
  ------------------
   60|   135k|    }
_ZNK5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE5owneeEv:
   51|    268|    const ownee_t& ownee() const { return get<ownee_t>(impl); }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6copy_eENS9_5applyIS6_E4type4editEmPSB_m:
  124|  3.06k|    {
  125|  3.06k|        return copy_e(e, n, p->data(), p->data() + count);
  126|  3.06k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6copy_eIPiEEPSB_NS9_5applyIS6_E4type4editEmT_SJ_:
  117|  3.06k|    {
  118|  3.06k|        auto p     = copy_n(n, first, last);
  119|  3.06k|        p->ownee() = e;
  120|  3.06k|        return p;
  121|  3.06k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE5owneeEv:
   52|  3.06k|    ownee_t& ownee() { return get<ownee_t>(impl); }

_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE5emptyEv:
   36|   206k|    {
   37|   206k|        static const with_capacity empty_{node_t::make_n(1), 0, 1};
   38|   206k|        return empty_;
   39|   206k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2EPNS1_4nodeIiSA_EEmm:
   42|   413k|        : ptr{p}
   43|   413k|        , size{s}
   44|   413k|        , capacity{c}
   45|   413k|    {
   46|   413k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev:
   87|   413k|    ~with_capacity() { dec(); }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3decEv:
   96|   413k|    {
   97|   413k|        using immer::detail::get;
   98|   413k|        if (ptr->refs().dec())
  ------------------
  |  Branch (98:13): [True: 207k, False: 206k]
  ------------------
   99|   207k|            node_t::delete_n(ptr, size, capacity);
  100|   413k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2ERKSB_:
   49|   206k|        : with_capacity{other.ptr, other.size, other.capacity}
   50|   206k|    {
   51|   206k|        inc();
   52|   206k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3incEv:
   90|   206k|    {
   91|   206k|        using immer::detail::get;
   92|   206k|        ptr->refs().inc();
   93|   206k|    }
_ZNK5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE9push_backEi:
  197|   197k|    {
  198|   197k|        auto cap = recommend_up(size + 1, capacity);
  199|   197k|        auto p   = node_t::copy_n(cap, ptr, size);
  200|   197k|        IMMER_TRY {
  ------------------
  |  |   49|   197k|#define IMMER_TRY try
  ------------------
  201|   197k|            new (p->data() + size) T(std::move(value));
  202|   197k|            return {p, size + 1, cap};
  203|   197k|        }
  204|   197k|        IMMER_CATCH (...) {
  205|      0|            node_t::delete_n(p, size, cap);
  206|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  207|      0|        }
  208|   197k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE12recommend_upEmm:
  180|   200k|    {
  181|   200k|        auto max = std::numeric_limits<size_t>::max();
  182|   200k|        return sz <= cap        ? cap
  ------------------
  |  Branch (182:16): [True: 192k, False: 7.64k]
  ------------------
  183|   200k|               : cap >= max / 2 ? max
  ------------------
  |  Branch (183:18): [True: 0, False: 7.64k]
  ------------------
  184|       |                                /* otherwise */
  185|  7.64k|                                : std::max(2 * cap, sz);
  186|   200k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2EOSB_:
   61|   204k|        : with_capacity{empty()}
   62|   204k|    {
   63|   204k|        swap(*this, other);
   64|   204k|    }
_ZN5immer6detail6arrays4swapERNS1_13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEESC_:
   80|   546k|    {
   81|   546k|        using std::swap;
   82|   546k|        swap(x.ptr, y.ptr);
   83|   546k|        swap(x.size, y.size);
   84|   546k|        swap(x.capacity, y.capacity);
   85|   546k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEaSEOSB_:
   74|   342k|    {
   75|   342k|        swap(*this, other);
   76|   342k|        return *this;
   77|   342k|    }
array.cpp:_ZNK5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6updateIZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_EUlSG_E_EESB_mOSG_:
  261|  2.93k|    {
  262|  2.93k|        auto p = node_t::copy_n(capacity, ptr, size);
  263|  2.93k|        IMMER_TRY {
  ------------------
  |  |   49|  2.93k|#define IMMER_TRY try
  ------------------
  264|  2.93k|            auto& elem = p->data()[idx];
  265|  2.93k|            elem       = std::forward<Fn>(op)(std::move(elem));
  266|  2.93k|            return {p, size, capacity};
  267|  2.93k|        }
  268|  2.93k|        IMMER_CATCH (...) {
  269|      0|            node_t::delete_n(p, size, capacity);
  270|      0|            IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  271|      0|        }
  272|  2.93k|    }
_ZNK5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4takeEm:
  295|  3.88k|    {
  296|  3.88k|        assert(sz <= size);
  ------------------
  |  Branch (296:9): [True: 3.88k, False: 0]
  ------------------
  297|  3.88k|        auto cap = recommend_down(sz, capacity);
  298|  3.88k|        auto p   = node_t::copy_n(cap, ptr, sz);
  299|  3.88k|        return {p, sz, cap};
  300|  3.88k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE14recommend_downEmm:
  189|  3.96k|    {
  190|  3.96k|        return sz == 0        ? 1
  ------------------
  |  Branch (190:16): [True: 1.73k, False: 2.22k]
  ------------------
  191|  3.96k|               : sz < cap / 2 ? sz * 2
  ------------------
  |  Branch (191:18): [True: 1.25k, False: 971]
  ------------------
  192|  2.22k|                              :
  193|  2.22k|                              /* otherwise */ cap;
  194|  3.96k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE13push_back_mutENS9_5applyIS6_E4type4editEi:
  211|   122k|    {
  212|   122k|        if (ptr->can_mutate(e) && capacity > size) {
  ------------------
  |  Branch (212:13): [True: 121k, False: 190]
  |  Branch (212:35): [True: 119k, False: 2.79k]
  ------------------
  213|   119k|            new (data() + size) T(std::move(value));
  214|   119k|            ++size;
  215|   119k|        } else {
  216|  2.98k|            auto cap = recommend_up(size + 1, capacity);
  217|  2.98k|            auto p   = node_t::copy_e(e, cap, ptr, size);
  218|  2.98k|            IMMER_TRY {
  ------------------
  |  |   49|  2.98k|#define IMMER_TRY try
  ------------------
  219|  2.98k|                new (p->data() + size) T(std::move(value));
  220|  2.98k|                *this = {p, size + 1, cap};
  221|  2.98k|            }
  222|  2.98k|            IMMER_CATCH (...) {
  223|      0|                node_t::delete_n(p, size, cap);
  224|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  225|      0|            }
  226|  2.98k|        }
  227|   122k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4dataEv:
  103|   132k|    T* data() { return ptr->data(); }
array.cpp:_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE10update_mutIZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_EUlSG_E0_EEvNS9_5applyIS6_E4type4editEmOSG_:
  276|  8.29k|    {
  277|  8.29k|        if (ptr->can_mutate(e)) {
  ------------------
  |  Branch (277:13): [True: 8.29k, False: 0]
  ------------------
  278|  8.29k|            auto& elem = data()[idx];
  279|  8.29k|            elem       = std::forward<Fn>(op)(std::move(elem));
  280|  8.29k|        } else {
  281|      0|            auto p = node_t::copy_e(e, capacity, ptr, size);
  282|      0|            IMMER_TRY {
  ------------------
  |  |   49|      0|#define IMMER_TRY try
  ------------------
  283|      0|                auto& elem = p->data()[idx];
  284|      0|                elem       = std::forward<Fn>(op)(std::move(elem));
  285|      0|                *this      = {p, size, capacity};
  286|      0|            }
  287|      0|            IMMER_CATCH (...) {
  288|      0|                node_t::delete_n(p, size, capacity);
  289|      0|                IMMER_RETHROW;
  ------------------
  |  |   52|      0|#define IMMER_RETHROW throw
  ------------------
  290|      0|            }
  291|      0|        }
  292|  8.29k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE8take_mutENS9_5applyIS6_E4type4editEm:
  303|  5.04k|    {
  304|  5.04k|        assert(sz <= size);
  ------------------
  |  Branch (304:9): [True: 5.04k, False: 0]
  ------------------
  305|  5.04k|        if (ptr->can_mutate(e)) {
  ------------------
  |  Branch (305:13): [True: 4.97k, False: 78]
  ------------------
  306|  4.97k|            detail::destroy_n(data() + size, size - sz);
  307|  4.97k|            size = sz;
  308|  4.97k|        } else {
  309|     78|            auto cap = recommend_down(sz, capacity);
  310|     78|            auto p   = node_t::copy_e(e, cap, ptr, sz);
  311|     78|            *this    = {p, sz, cap};
  312|     78|        }
  313|  5.04k|    }

_ZN5immer6detail3csl3getINS_15refcount_policyEEEDcRKNS1_10member_twoINS0_6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEES3_NS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6data_tENS1_6memberIS3_NS1_7inheritINSC_5applyISA_E4type5owneeEvE4typeEE4typeEE4typeE:
  170|   755k|        {
  171|   755k|            return x.get_(type_t<U>{});
  172|   755k|        }
_ZNK5immer6detail3csl10member_twoINS0_6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_IS9_EEDcNS1_6type_tIT_EE:
  184|   755k|        {
  185|   755k|            return n.get_(t);
  186|   755k|        }
_ZNK5immer6detail3csl6memberINS_15refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE:
  128|   755k|        const T& get_(type_t<T>) const { return d; }
_ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRKNS1_10member_twoINS0_6arrays4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEEE6data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE:
  170|    268|        {
  171|    268|            return x.get_(type_t<U>{});
  172|    268|        }
_ZNK5immer6detail3csl10member_twoINS0_6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE:
  184|    268|        {
  185|    268|            return n.get_(t);
  186|    268|        }
_ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  103|    268|        const T& get_(type_t<T>) const { return *this; }
_ZN5immer6detail3csl3getINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEEEDcRNS1_10member_twoINS0_6arrays4nodeIiNS_13memory_policyIS7_NS_15refcount_policyENS_15spinlock_policyES3_Lb0ELb1EEEE6data_tENS1_6memberISF_NS1_7inheritISA_vE4typeEE4typeEE4typeE:
  165|  3.06k|        {
  166|  3.06k|            return x.get_(type_t<U>{});
  167|  3.06k|        }
_ZN5immer6detail3csl10member_twoINS0_6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6data_tENS1_6memberIS9_NS1_7inheritINSB_5applyIS8_E4type5owneeEvE4typeEE4typeEE4type4get_ISK_EEDcNS1_6type_tIT_EE:
  179|  3.06k|        {
  180|  3.06k|            return n.get_(t);
  181|  3.06k|        }
_ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  102|  3.06k|        T& get_(type_t<T>) { return *this; }

_ZN5immer6detail21with_trailing_storageINS0_6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6data_tEiLb1EE18get_storage_offsetEv:
   87|   414k|    {
   88|   414k|        check_base();
   89|   414k|        return 0;
   90|   414k|    }
_ZN5immer6detail21with_trailing_storageINS0_6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6data_tEiLb1EE10check_baseEv:
   94|  1.57M|    {
   95|       |        // is_standard_layout requires that only one class in the hierarchy
   96|       |        // contains non-static data members. Since this class contains one
   97|       |        // member, the static_assert will only hold when the derived class is
   98|       |        // empty.
   99|  1.57M|        static_assert(std::is_standard_layout<Derived>::value,
  100|  1.57M|                      "Please remove 'true' if the derived class is non emtpy");
  101|  1.57M|    }
_ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_:
  143|   755k|{
  144|   755k|    return const_cast<T&>(x);
  145|   755k|}
_ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_:
  188|   212k|{
  189|   212k|    return first + n;
  190|   212k|}
_ZN5immer6detail21with_trailing_storageINS0_6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6data_tEiLb1EE15get_storage_ptrEv:
   75|  1.16M|    {
   76|  1.16M|        check_base();
   77|  1.16M|        return reinterpret_cast<T*>(this);
   78|  1.16M|    }
_ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_:
  236|   207k|{
  237|   207k|    return std::copy(first, last, out);
  238|   207k|}

_ZN5immer8cpp_heap8allocateIJEEEPvmDpT_:
   27|   207k|    {
   28|   207k|        return ::operator new(size);
   29|   207k|    }
_ZN5immer8cpp_heap10deallocateEmPv:
   36|   207k|    static void deallocate(std::size_t, void* data) { ::operator delete(data); }

_ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_:
   49|   207k|    {
   50|   207k|        auto p = (std::size_t*) Base::allocate(size + extra_size, tags...);
   51|   207k|        new (p) std::size_t{size};
   52|   207k|        return ((char*) p) + extra_size;
   53|   207k|    }
_ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_:
   57|   207k|    {
   58|   207k|        auto p = (std::size_t*) (((char*) data) - extra_size);
   59|   207k|        assert(*p == size);
  ------------------
  |  Branch (59:9): [True: 207k, False: 0]
  ------------------
   60|   207k|        Base::deallocate(size + extra_size, p, tags...);
   61|   207k|    }

_ZN5immer15refcount_policyC2Ev:
   28|   207k|        : refcount{1} {};
_ZN5immer15refcount_policy3decEv:
   36|   413k|    bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); }
_ZN5immer15refcount_policy3incEv:
   34|   206k|    void inc() { refcount.fetch_add(1, std::memory_order_relaxed); }
_ZN5immer15refcount_policy6uniqueEv:
   38|   135k|    bool unique() { return refcount == 1; }

_ZNK5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5ownee10can_mutateENS6_4editE:
   35|    268|                bool can_mutate(edit) const { return false; }
_ZN5immer20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeaSENS6_4editE:
   34|  3.06k|                ownee& operator=(edit) { return *this; };