// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/libcuckoo/./cuckoohash_map.hh
// Function: cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::cuckoo_status cuckoohash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, std::allocator<std::pair<unsigned int const, unsigned int>>, 4ul>::cuckoo_fast_double<std::integral_constant<bool, false>, std::integral_constant<bool, true>>(unsigned long)
cuckoo_status cuckoo_fast_double(size_type current_hp) {
    if (!std::is_nothrow_move_constructible<key_type>::value ||
        !std::is_nothrow_move_constructible<mapped_type>::value) {
      LIBCUCKOO_DBG("%s", "cannot run cuckoo_fast_double because key-value"
                          " pair is not nothrow move constructible");
      return cuckoo_expand_simple<TABLE_MODE, AUTO_RESIZE>(current_hp + 1);
    }
    const size_type new_hp = current_hp + 1;
    auto all_locks_manager = snapshot_and_lock_all(TABLE_MODE());
    cuckoo_status st = check_resize_validity<AUTO_RESIZE>(current_hp, new_hp);
    if (st != ok) {
      return st;
    }

    // We must re-hash the table, moving items in each bucket to a different
    // one. The hash functions are carefully designed so that when doubling the
    // number of buckets, each element either stays in its existing bucket or
    // goes to exactly one new bucket. This means we can re-hash each bucket in
    // parallel. We create a new empty buckets container and move all the
    // elements from the old container to the new one.
    buckets_t new_buckets(new_hp, get_allocator());
    // For certain types, MSVC may decide that move_buckets() cannot throw and
    // so the catch block below is dead code. Since that won't always be true,
    // we just disable the warning here.
    LIBCUCKOO_SQUELCH_DEADCODE_WARNING_BEGIN;
    parallel_exec(
        0, hashsize(current_hp),
        [this, &new_buckets, current_hp, new_hp](size_type start, size_type end,
                                                 std::exception_ptr &eptr) {
          try {
            move_buckets(new_buckets, current_hp, new_hp, start, end);
          } catch (...) {
            eptr = std::current_exception();
          }
        });
    LIBCUCKOO_SQUELCH_DEADCODE_WARNING_END;

    // Resize the locks array if necessary. This is done before we update the
    // hashpower so that other threads don't grab the new hashpower and the old
    // locks
    maybe_resize_locks(size_type(1) << new_hp);
    // Swap the old and new buckets. The old bucket data will be destroyed when
    // the function exits
    buckets_.swap(new_buckets);
    return ok;
  }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rsi, %r15
movq %rdi, %rbx
leaq 0x1(%rsi), %r14
leaq 0x50(%rsp), %rdi
movq %rbx, %rsi
callq 0x4088
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x410e
movl %eax, %ebp
testl %eax, %eax
jne 0x3341
leaq 0x60(%rsp), %r13
leaq 0x2f(%rsp), %rdx
movq %r13, %rdi
movq %r14, %rsi
callq 0x2a48
pushq $0x1
popq %r12
movq %r12, %rdx
movl %r15d, %ecx
shlq %cl, %rdx
movq %rbx, 0x30(%rsp)
movq %r13, 0x38(%rsp)
movq %r15, 0x40(%rsp)
movq %r14, 0x48(%rsp)
movups 0x30(%rsp), %xmm0
movups 0x40(%rsp), %xmm1
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %rbx, %rdi
xorl %esi, %esi
callq 0x419a
movl %r14d, %ecx
shlq %cl, %r12
movq %rbx, %rdi
movq %r12, %rsi
callq 0x4390
leaq 0x60(%rsp), %rdi
movq 0x8(%rdi), %rax
movq 0x10(%rbx), %rcx
movq %rcx, 0x8(%rdi)
movq %rax, 0x10(%rbx)
movq 0x18(%rbx), %rax
movq 0x10(%rdi), %rcx
movq %rcx, 0x18(%rbx)
movq %rax, 0x10(%rdi)
callq 0x291c
leaq 0x50(%rsp), %rdi
callq 0x449e
movl %ebp, %eax
addq $0x78, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x336d
movq %rax, %rbx
leaq 0x60(%rsp), %rdi
callq 0x291c
jmp 0x3370
movq %rax, %rbx
leaq 0x50(%rsp), %rdi
callq 0x449e
movq %rbx, %rdi
callq 0x2210