LLVMFuzzerTestOneInput:
   17|    647|{
   18|    647|    constexpr auto var_count = 4;
   19|       |
   20|    647|    using array_t = immer::array<int, immer::default_memory_policy>;
   21|    647|    using size_t  = std::uint8_t;
   22|       |
   23|    647|    auto vars = std::array<array_t, var_count>{};
   24|       |
   25|    647|    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
   26|    647|    auto is_valid_index = [](auto& v) {
   27|    647|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   28|    647|    };
   29|    647|    auto is_valid_size = [](auto& v) {
   30|    647|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   31|    647|    };
   32|       |    // limit doing immutable pushes on vectors that are too big already to
   33|       |    // prevent timeouts
   34|    647|    auto too_big = [](auto&& v) { return v.size() > (std::size_t{1} << 10); };
   35|    647|    return fuzzer_input{data, size}.run([&](auto& in) {
   36|    647|        enum ops
   37|    647|        {
   38|    647|            op_push_back,
   39|    647|            op_update,
   40|    647|            op_take,
   41|    647|            op_push_back_move,
   42|    647|            op_update_move,
   43|    647|            op_take_move,
   44|    647|        };
   45|    647|        auto src = read<char>(in, is_valid_var);
   46|    647|        auto dst = read<char>(in, is_valid_var);
   47|    647|        switch (read<char>(in)) {
   48|    647|        case op_push_back: {
   49|    647|            if (!too_big(vars[src]))
   50|    647|                vars[dst] = vars[src].push_back(42);
   51|    647|            break;
   52|    647|        }
   53|    647|        case op_update: {
   54|    647|            auto idx  = read<size_t>(in, is_valid_index(vars[src]));
   55|    647|            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
   56|    647|            break;
   57|    647|        }
   58|    647|        case op_take: {
   59|    647|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   60|    647|            vars[dst] = vars[src].take(idx);
   61|    647|            break;
   62|    647|        }
   63|    647|        case op_push_back_move: {
   64|    647|            if (!too_big(vars[src]))
   65|    647|                vars[dst] = std::move(vars[src]).push_back(12);
   66|    647|            break;
   67|    647|        }
   68|    647|        case op_update_move: {
   69|    647|            auto idx = read<size_t>(in, is_valid_index(vars[src]));
   70|    647|            vars[dst] =
   71|    647|                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });
   72|    647|            break;
   73|    647|        }
   74|    647|        case op_take_move: {
   75|    647|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   76|    647|            vars[dst] = std::move(vars[src]).take(idx);
   77|    647|            break;
   78|    647|        }
   79|    647|        default:
   80|    647|            break;
   81|    647|        };
   82|    647|        return true;
   83|    647|    });
   84|    647|}
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_:
   35|   360k|    return fuzzer_input{data, size}.run([&](auto& in) {
   36|   360k|        enum ops
   37|   360k|        {
   38|   360k|            op_push_back,
   39|   360k|            op_update,
   40|   360k|            op_take,
   41|   360k|            op_push_back_move,
   42|   360k|            op_update_move,
   43|   360k|            op_take_move,
   44|   360k|        };
   45|   360k|        auto src = read<char>(in, is_valid_var);
   46|   360k|        auto dst = read<char>(in, is_valid_var);
   47|   360k|        switch (read<char>(in)) {
   48|   216k|        case op_push_back: {
  ------------------
  |  Branch (48:9): [True: 216k, False: 143k]
  ------------------
   49|   216k|            if (!too_big(vars[src]))
  ------------------
  |  Branch (49:17): [True: 173k, False: 43.9k]
  ------------------
   50|   173k|                vars[dst] = vars[src].push_back(42);
   51|   216k|            break;
   52|      0|        }
   53|  2.64k|        case op_update: {
  ------------------
  |  Branch (53:9): [True: 2.64k, False: 357k]
  ------------------
   54|  2.64k|            auto idx  = read<size_t>(in, is_valid_index(vars[src]));
   55|  2.64k|            vars[dst] = vars[src].update(idx, [](auto x) { return x + 1; });
   56|  2.64k|            break;
   57|      0|        }
   58|  6.25k|        case op_take: {
  ------------------
  |  Branch (58:9): [True: 6.25k, False: 353k]
  ------------------
   59|  6.25k|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   60|  6.25k|            vars[dst] = vars[src].take(idx);
   61|  6.25k|            break;
   62|      0|        }
   63|   113k|        case op_push_back_move: {
  ------------------
  |  Branch (63:9): [True: 113k, False: 246k]
  ------------------
   64|   113k|            if (!too_big(vars[src]))
  ------------------
  |  Branch (64:17): [True: 100k, False: 13.4k]
  ------------------
   65|   100k|                vars[dst] = std::move(vars[src]).push_back(12);
   66|   113k|            break;
   67|      0|        }
   68|  6.90k|        case op_update_move: {
  ------------------
  |  Branch (68:9): [True: 6.90k, False: 353k]
  ------------------
   69|  6.90k|            auto idx = read<size_t>(in, is_valid_index(vars[src]));
   70|  6.90k|            vars[dst] =
   71|  6.90k|                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });
   72|  6.90k|            break;
   73|      0|        }
   74|  2.54k|        case op_take_move: {
  ------------------
  |  Branch (74:9): [True: 2.54k, False: 357k]
  ------------------
   75|  2.54k|            auto idx  = read<size_t>(in, is_valid_size(vars[src]));
   76|  2.54k|            vars[dst] = std::move(vars[src]).take(idx);
   77|  2.54k|            break;
   78|      0|        }
   79|  10.6k|        default:
  ------------------
  |  Branch (79:9): [True: 10.6k, False: 349k]
  ------------------
   80|  10.6k|            break;
   81|   360k|        };
   82|   359k|        return true;
   83|   360k|    });
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_0clIcEEDaT_:
   25|   942k|    auto is_valid_var   = [&](auto idx) { return idx >= 0 && idx < var_count; };
  ------------------
  |  Branch (25:50): [True: 852k, False: 89.3k]
  |  Branch (25:62): [True: 719k, False: 133k]
  ------------------
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_3clIRN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaOT_:
   34|   330k|    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|   125k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
  ------------------
  |  Branch (27:39): [True: 125k, False: 0]
  |  Branch (27:51): [True: 9.48k, False: 116k]
  ------------------
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_1clIN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaRT_:
   26|  9.54k|    auto is_valid_index = [](auto& v) {
   27|  9.54k|        return [&](auto idx) { return idx >= 0 && idx < v.size(); };
   28|  9.54k|    };
array.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_ENKUlS2_E_clIiEEDaS2_:
   55|  2.61k|            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|  13.9k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
  ------------------
  |  Branch (30:39): [True: 13.9k, False: 0]
  |  Branch (30:51): [True: 8.75k, False: 5.15k]
  ------------------
array.cpp:_ZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer5arrayIiNS1_13memory_policyINS1_21free_list_heap_policyINS1_8cpp_heapELm1024EEENS1_15refcount_policyENS1_15spinlock_policyENS1_20no_transience_policyELb0ELb1EEEEEEEDaRT_:
   29|  8.80k|    auto is_valid_size = [](auto& v) {
   30|  8.80k|        return [&](auto idx) { return idx >= 0 && idx <= v.size(); };
   31|  8.80k|    };
array.cpp:_ZZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_ENKUlS2_E0_clIiEEDaS2_:
   71|  6.87k|                std::move(vars[src]).update(idx, [](auto x) { return x + 1; });

array.cpp:_ZN12fuzzer_input3runIZ22LLVMFuzzerTestOneInputE3$_4EEiT_:
   50|    647|    {
   51|    647|        if (size_ > fuzzer_input_max_size)
  ------------------
  |  Branch (51:13): [True: 6, False: 641]
  ------------------
   52|      6|            return 0;
   53|    641|        try {
   54|   360k|            while (step(*this))
  ------------------
  |  Branch (54:20): [True: 359k, False: 641]
  ------------------
   55|   359k|                continue;
   56|    641|        } catch (const no_more_input&) {};
   57|    641|        return 0;
   58|    641|    }
array.cpp:_Z4readIcZ22LLVMFuzzerTestOneInputE3$_0ET_R12fuzzer_inputT0_:
   69|   719k|{
   70|   719k|    auto x = read<T>(fz);
   71|   942k|    while (!cond(x))
  ------------------
  |  Branch (71:12): [True: 222k, False: 719k]
  ------------------
   72|   222k|        x = read<T>(fz);
   73|   719k|    return x;
   74|   719k|}
_Z4readIcERKT_R12fuzzer_input:
   63|  1.30M|{
   64|  1.30M|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   65|  1.30M|}
_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: 641, False: 1.44M]
  ------------------
   44|    641|            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_:
   69|  9.54k|{
   70|  9.54k|    auto x = read<T>(fz);
   71|   125k|    while (!cond(x))
  ------------------
  |  Branch (71:12): [True: 116k, False: 9.54k]
  ------------------
   72|   116k|        x = read<T>(fz);
   73|  9.54k|    return x;
   74|  9.54k|}
_Z4readIhERKT_R12fuzzer_input:
   63|   139k|{
   64|   139k|    return *reinterpret_cast<const T*>(fz.next(sizeof(T), alignof(T)));
   65|   139k|}
array.cpp:_Z4readIhZZ22LLVMFuzzerTestOneInputENK3$_2clIN5immer5arrayIiNS2_13memory_policyINS2_21free_list_heap_policyINS2_8cpp_heapELm1024EEENS2_15refcount_policyENS2_15spinlock_policyENS2_20no_transience_policyELb0ELb1EEEEEEEDaRT_EUlSD_E_ESD_R12fuzzer_inputT0_:
   69|  8.80k|{
   70|  8.80k|    auto x = read<T>(fz);
   71|  13.9k|    while (!cond(x))
  ------------------
  |  Branch (71:12): [True: 5.15k, False: 8.80k]
  ------------------
   72|  5.15k|        x = read<T>(fz);
   73|  8.80k|    return x;
   74|  8.80k|}

_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2Ev:
   71|  2.58k|    array() = default;
_ZNK5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4sizeEv:
  139|   470k|    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:
  209|   173k|    {
  210|   173k|        return impl_.push_back(std::move(value));
  211|   173k|    }
_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2ENS_6detail6arrays13with_capacityIiS8_EE:
  328|   181k|    {}
array.cpp:_ZNKR5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6updateIZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_EUlSE_E_EES9_mOSE_:
  263|  2.61k|    {
  264|  2.61k|        return impl_.update(index, std::forward<FnT>(fn));
  265|  2.61k|    }
_ZNKR5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4takeEm:
  290|  6.23k|    {
  291|  6.23k|        return impl_.take(elems);
  292|  6.23k|    }
_ZNO5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE9push_backEi:
  214|   100k|    {
  215|   100k|        return push_back_move(move_t{}, std::move(value));
  216|   100k|    }
_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE14push_back_moveENSt3__117integral_constantIbLb1EEEi:
  331|   100k|    {
  332|   100k|        impl_.push_back_mut({}, std::move(value));
  333|   100k|        return std::move(*this);
  334|   100k|    }
array.cpp:_ZNO5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6updateIZZ22LLVMFuzzerTestOneInputENK3$_4clI12fuzzer_inputEEDaRT_EUlSE_E0_EEDcmOSE_:
  269|  6.87k|    {
  270|  6.87k|        return update_move(move_t{}, index, std::forward<FnT>(fn));
  271|  6.87k|    }
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_:
  352|  6.87k|    {
  353|  6.87k|        impl_.update_mut({}, index, std::forward<Fn>(fn));
  354|  6.87k|        return std::move(*this);
  355|  6.87k|    }
_ZNO5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4takeEm:
  295|  2.52k|    {
  296|  2.52k|        return take_move(move_t{}, elems);
  297|  2.52k|    }
_ZN5immer5arrayIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE9take_moveENSt3__117integral_constantIbLb1EEEm:
  363|  2.52k|    {
  364|  2.52k|        impl_.take_mut({}, elems);
  365|  2.52k|        return std::move(*this);
  366|  2.52k|    }

_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6make_nEm:
   69|   184k|    {
   70|   184k|        return new (heap::allocate(sizeof_n(n))) node_t{};
   71|   184k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE8sizeof_nEm:
   44|   369k|    {
   45|   369k|        return std::max(immer_offsetof(impl_t, d.buffer) + sizeof(T) * count,
  ------------------
  |  |   19|   369k|#define immer_offsetof offsetof
  ------------------
   46|   369k|                        sizeof(node));
   47|   369k|    }
_ZNK5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4refsEv:
   49|   663k|    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|   184k|    {
   64|   184k|        detail::destroy_n(p->data(), sz);
   65|   184k|        heap::deallocate(sizeof_n(cap), p);
   66|   184k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4dataEv:
   55|  1.02M|    T* data() { return reinterpret_cast<T*>(&impl.d.buffer); }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6copy_nEmPSB_m:
  111|   181k|    {
  112|   181k|        return copy_n(n, p->data(), p->data() + count);
  113|   181k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6copy_nIPiSD_Lb1EEEPSB_mT_T0_:
   98|   184k|    {
   99|   184k|        auto p = make_n(n);
  100|   184k|        IMMER_TRY {
  ------------------
  |  |   41|   184k|#define IMMER_TRY try
  ------------------
  101|   184k|            detail::uninitialized_copy(first, last, p->data());
  102|   184k|            return p;
  103|   184k|        }
  104|   184k|        IMMER_CATCH (...) {
  105|      0|            heap::deallocate(sizeof_n(n), p);
  106|      0|            IMMER_RETHROW;
  ------------------
  |  |   44|      0|#define IMMER_RETHROW throw
  ------------------
  107|      0|        }
  108|   184k|    }
_ZNK5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE10can_mutateENS9_5applyIS6_E4type4editE:
   58|   109k|    {
   59|   109k|        return refs().unique() || ownee().can_mutate(e);
  ------------------
  |  Branch (59:16): [True: 109k, False: 248]
  |  Branch (59:35): [True: 0, False: 248]
  ------------------
   60|   109k|    }
_ZNK5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE5owneeEv:
   51|    248|    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.03k|    {
  125|  3.03k|        return copy_e(e, n, p->data(), p->data() + count);
  126|  3.03k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE6copy_eIPiEEPSB_NS9_5applyIS6_E4type4editEmT_SJ_:
  117|  3.03k|    {
  118|  3.03k|        auto p     = copy_n(n, first, last);
  119|  3.03k|        p->ownee() = e;
  120|  3.03k|        return p;
  121|  3.03k|    }
_ZN5immer6detail6arrays4nodeIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE5owneeEv:
   52|  3.03k|    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|   184k|    {
   37|   184k|        static const with_capacity empty_{node_t::make_n(1), 0, 1};
   38|   184k|        return empty_;
   39|   184k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2EPNS1_4nodeIiSA_EEmm:
   45|   369k|    {}
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEED2Ev:
   86|   369k|    ~with_capacity() { dec(); }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3decEv:
   95|   369k|    {
   96|   369k|        using immer::detail::get;
   97|   369k|        if (ptr->refs().dec())
  ------------------
  |  Branch (97:13): [True: 184k, False: 184k]
  ------------------
   98|   184k|            node_t::delete_n(ptr, size, capacity);
   99|   369k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2ERKSB_:
   49|   184k|    {
   50|   184k|        inc();
   51|   184k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE3incEv:
   89|   184k|    {
   90|   184k|        using immer::detail::get;
   91|   184k|        ptr->refs().inc();
   92|   184k|    }
_ZNK5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE9push_backEi:
  196|   173k|    {
  197|   173k|        auto cap = recommend_up(size + 1, capacity);
  198|   173k|        auto p   = node_t::copy_n(cap, ptr, size);
  199|   173k|        IMMER_TRY {
  ------------------
  |  |   41|   173k|#define IMMER_TRY try
  ------------------
  200|   173k|            new (p->data() + size) T{std::move(value)};
  201|   173k|            return {p, size + 1, cap};
  202|   173k|        }
  203|   173k|        IMMER_CATCH (...) {
  204|      0|            node_t::delete_n(p, size, cap);
  205|      0|            IMMER_RETHROW;
  ------------------
  |  |   44|      0|#define IMMER_RETHROW throw
  ------------------
  206|      0|        }
  207|   173k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE12recommend_upEmm:
  179|   176k|    {
  180|   176k|        auto max = std::numeric_limits<size_t>::max();
  181|   176k|        return sz <= cap        ? cap
  ------------------
  |  Branch (181:16): [True: 166k, False: 9.57k]
  ------------------
  182|   176k|               : cap >= max / 2 ? max
  ------------------
  |  Branch (182:18): [True: 0, False: 9.57k]
  ------------------
  183|       |                                /* otherwise */
  184|  9.57k|                                : std::max(2 * cap, sz);
  185|   176k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEC2EOSB_:
   61|   181k|    {
   62|   181k|        swap(*this, other);
   63|   181k|    }
_ZN5immer6detail6arrays4swapERNS1_13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEESC_:
   79|   476k|    {
   80|   476k|        using std::swap;
   81|   476k|        swap(x.ptr, y.ptr);
   82|   476k|        swap(x.size, y.size);
   83|   476k|        swap(x.capacity, y.capacity);
   84|   476k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEEaSEOSB_:
   73|   294k|    {
   74|   294k|        swap(*this, other);
   75|   294k|        return *this;
   76|   294k|    }
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_:
  260|  2.61k|    {
  261|  2.61k|        auto p = node_t::copy_n(capacity, ptr, size);
  262|  2.61k|        IMMER_TRY {
  ------------------
  |  |   41|  2.61k|#define IMMER_TRY try
  ------------------
  263|  2.61k|            auto& elem = p->data()[idx];
  264|  2.61k|            elem       = std::forward<Fn>(op)(std::move(elem));
  265|  2.61k|            return {p, size, capacity};
  266|  2.61k|        }
  267|  2.61k|        IMMER_CATCH (...) {
  268|      0|            node_t::delete_n(p, size, capacity);
  269|      0|            IMMER_RETHROW;
  ------------------
  |  |   44|      0|#define IMMER_RETHROW throw
  ------------------
  270|      0|        }
  271|  2.61k|    }
_ZNK5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4takeEm:
  294|  6.23k|    {
  295|  6.23k|        assert(sz <= size);
  296|      0|        auto cap = recommend_down(sz, capacity);
  297|  6.23k|        auto p   = node_t::copy_n(cap, ptr, sz);
  298|  6.23k|        return {p, sz, cap};
  299|  6.23k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE14recommend_downEmm:
  188|  6.30k|    {
  189|  6.30k|        return sz == 0        ? 1
  ------------------
  |  Branch (189:16): [True: 1.53k, False: 4.77k]
  ------------------
  190|  6.30k|               : sz < cap / 2 ? sz * 2
  ------------------
  |  Branch (190:18): [True: 2.06k, False: 2.70k]
  ------------------
  191|  4.77k|                              :
  192|  4.77k|                              /* otherwise */ cap;
  193|  6.30k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE13push_back_mutENS9_5applyIS6_E4type4editEi:
  210|   100k|    {
  211|   100k|        if (ptr->can_mutate(e) && capacity > size) {
  ------------------
  |  Branch (211:13): [True: 99.9k, False: 174]
  |  Branch (211:35): [True: 97.1k, False: 2.78k]
  ------------------
  212|  97.1k|            new (data() + size) T{std::move(value)};
  213|  97.1k|            ++size;
  214|  97.1k|        } else {
  215|  2.96k|            auto cap = recommend_up(size + 1, capacity);
  216|  2.96k|            auto p   = node_t::copy_e(e, cap, ptr, size);
  217|  2.96k|            IMMER_TRY {
  ------------------
  |  |   41|  2.96k|#define IMMER_TRY try
  ------------------
  218|  2.96k|                new (p->data() + size) T{std::move(value)};
  219|  2.96k|                *this = {p, size + 1, cap};
  220|  2.96k|            }
  221|  2.96k|            IMMER_CATCH (...) {
  222|      0|                node_t::delete_n(p, size, cap);
  223|      0|                IMMER_RETHROW;
  ------------------
  |  |   44|      0|#define IMMER_RETHROW throw
  ------------------
  224|      0|            }
  225|  2.96k|        }
  226|   100k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE4dataEv:
  102|   106k|    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_:
  275|  6.87k|    {
  276|  6.87k|        if (ptr->can_mutate(e)) {
  ------------------
  |  Branch (276:13): [True: 6.87k, False: 0]
  ------------------
  277|  6.87k|            auto& elem = data()[idx];
  278|  6.87k|            elem       = std::forward<Fn>(op)(std::move(elem));
  279|  6.87k|        } else {
  280|      0|            auto p = node_t::copy_e(e, capacity, ptr, size);
  281|      0|            IMMER_TRY {
  ------------------
  |  |   41|      0|#define IMMER_TRY try
  ------------------
  282|      0|                auto& elem = p->data()[idx];
  283|      0|                elem       = std::forward<Fn>(op)(std::move(elem));
  284|      0|                *this      = {p, size, capacity};
  285|      0|            }
  286|      0|            IMMER_CATCH (...) {
  287|      0|                node_t::delete_n(p, size, capacity);
  288|      0|                IMMER_RETHROW;
  ------------------
  |  |   44|      0|#define IMMER_RETHROW throw
  ------------------
  289|      0|            }
  290|      0|        }
  291|  6.87k|    }
_ZN5immer6detail6arrays13with_capacityIiNS_13memory_policyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEENS_15refcount_policyENS_15spinlock_policyENS_20no_transience_policyELb0ELb1EEEE8take_mutENS9_5applyIS6_E4type4editEm:
  302|  2.52k|    {
  303|  2.52k|        assert(sz <= size);
  304|  2.52k|        if (ptr->can_mutate(e)) {
  ------------------
  |  Branch (304:13): [True: 2.45k, False: 74]
  ------------------
  305|  2.45k|            detail::destroy_n(data() + size, size - sz);
  306|  2.45k|            size = sz;
  307|  2.45k|        } else {
  308|     74|            auto cap = recommend_down(sz, capacity);
  309|     74|            auto p   = node_t::copy_e(e, cap, ptr, sz);
  310|     74|            *this    = {p, sz, cap};
  311|     74|        }
  312|  2.52k|    }

_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|   663k|        {
  171|   663k|            return x.get_(type_t<U>{});
  172|   663k|        }
_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|   663k|        {
  185|   663k|            return n.get_(t);
  186|   663k|        }
_ZNK5immer6detail3csl6memberINS_15refcount_policyENS1_7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4typeEE4type4get_ENS1_6type_tIS3_EE:
  128|   663k|        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|    248|        {
  171|    248|            return x.get_(type_t<U>{});
  172|    248|        }
_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|    248|        {
  185|    248|            return n.get_(t);
  186|    248|        }
_ZNK5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  103|    248|        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.03k|        {
  166|  3.03k|            return x.get_(type_t<U>{});
  167|  3.03k|        }
_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.03k|        {
  180|  3.03k|            return n.get_(t);
  181|  3.03k|        }
_ZN5immer6detail3csl7inheritINS_20no_transience_policy5applyINS_21free_list_heap_policyINS_8cpp_heapELm1024EEEE4type5owneeEvE4type4get_ENS1_6type_tISA_EE:
  102|  3.03k|        T& get_(type_t<T>) { return *this; }

_ZN5immer6detail15auto_const_castINS_15refcount_policyEEERT_RKS3_:
   45|   663k|{
   46|   663k|    return const_cast<T&>(x);
   47|   663k|}
_ZN5immer6detail9destroy_nIPimEENSt3__19enable_ifIX20can_trivially_detroyIT_EES5_E4typeES5_T0_:
   90|   187k|{
   91|   187k|    return first + n;
   92|   187k|}
_ZN5immer6detail18uninitialized_copyIPiS2_S2_EENSt3__19enable_ifIX18can_trivially_copyIT_T1_EES6_E4typeES5_T0_S6_:
  138|   184k|{
  139|   184k|    return std::copy(first, last, out);
  140|   184k|}

_ZN5immer8cpp_heap8allocateIJEEEPvmDpT_:
   27|   184k|    {
   28|   184k|        return ::operator new(size);
   29|   184k|    }
_ZN5immer8cpp_heap10deallocateEmPv:
   37|   184k|    {
   38|   184k|        ::operator delete(data);
   39|   184k|    }

_ZN5immer15debug_size_heapINS_8cpp_heapEE8allocateIJEEEPvmDpT_:
   47|   184k|    {
   48|   184k|        auto p = (std::size_t*) Base::allocate(size + extra_size, tags...);
   49|   184k|        new (p) std::size_t{size};
   50|   184k|        return ((char*) p) + extra_size;
   51|   184k|    }
_ZN5immer15debug_size_heapINS_8cpp_heapEE10deallocateIJEEEvmPvDpT_:
   55|   184k|    {
   56|   184k|        auto p = (std::size_t*) (((char*) data) - extra_size);
   57|   184k|        assert(*p == size);
   58|      0|        Base::deallocate(size + extra_size, p, tags...);
   59|   184k|    }

_ZN5immer15refcount_policyC2Ev:
   28|   184k|        : refcount{1} {};
_ZN5immer15refcount_policy3decEv:
   35|   369k|    bool dec() { return 1 == refcount.fetch_sub(1, std::memory_order_acq_rel); }
_ZN5immer15refcount_policy3incEv:
   33|   184k|    void inc() { refcount.fetch_add(1, std::memory_order_relaxed); }
_ZN5immer15refcount_policy6uniqueEv:
   37|   109k|    bool unique() { return refcount == 1; }

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