LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_colony.h
// Function: plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::reduced_stack::operator=(plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::reduced_stack&&)
reduced_stack & operator = (reduced_stack &&source) PLF_COLONY_NOEXCEPT
			{
				destroy_all_data();

				current_group = std::move(source.current_group);
				first_group = std::move(source.first_group);
				top_element = std::move(source.top_element);
				start_element = std::move(source.start_element);
				end_element = std::move(source.end_element);
				total_number_of_elements = source.total_number_of_elements;
				group_allocator_pair.min_elements_per_group = source.group_allocator_pair.min_elements_per_group;

				// Nullify source object's contents - only first_group and total_number_of_elements required to be altered for destructor to work on it:
				source.first_group = NULL;
				source.total_number_of_elements = 0;

				return *this;
			}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
callq 0x95b2
movq (%r14), %rax
movq %rax, (%rbx)
movq 0x8(%r14), %rax
movq %rax, 0x8(%rbx)
movq 0x10(%r14), %rax
movq %rax, 0x10(%rbx)
movq 0x18(%r14), %rax
movq %rax, 0x18(%rbx)
movq 0x20(%r14), %rax
movq %rax, 0x20(%rbx)
movq %rbx, %rax
vmovups 0x28(%r14), %xmm0
vmovups %xmm0, 0x28(%rbx)
andq $0x0, 0x8(%r14)
andq $0x0, 0x28(%r14)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
movq %rax, %rdi
callq 0x7b4a
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_colony.h
// Function: plf::colony<NonTrivialStringMovable, std::allocator<NonTrivialStringMovable>, unsigned short>::clear()
void clear()
	{
		destroy_all_data();
		erased_locations.clear();
		total_number_of_elements = 0;
		begin_iterator.group_pointer = NULL;
		begin_iterator.element_pointer = NULL;
		begin_iterator.skipfield_pointer = NULL;
		end_iterator = begin_iterator;
	}

// Assembly:
pushq %rbx
movq %rdi, %rbx
callq 0x14da4
leaq 0x48(%rbx), %rdi
callq 0x14e56
andq $0x0, 0x38(%rbx)
vxorps %xmm0, %xmm0, %xmm0
vmovups %ymm0, (%rbx)
vmovups %ymm0, 0x10(%rbx)
popq %rbx
vzeroupper
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_emplace_back<Trivial<8>>::run()
static void run(){
        new_graph<T>("emplace_back", "us");

        auto sizes = { 100000, 200000, 300000, 400000, 500000, 600000, 700000, 800000, 900000, 1000000 };
        bench<std::vector<T>, microseconds, Empty, EmplaceBack>("vector", sizes);
        bench<std::list<T>,   microseconds, Empty, EmplaceBack>("list",   sizes);
        bench<std::deque<T>,  microseconds, Empty, EmplaceBack>("deque",  sizes);
        bench<plf::colony<T>, microseconds, Empty, EmplaceInsertSimple>("colony",  sizes);
        bench<std::vector<T>, microseconds, Empty, ReserveSize, EmplaceBack>("vector_reserve", sizes);
        bench<plf::colony<T>, microseconds, Empty, ReserveSize, EmplaceInsertSimple>("colony_reserve",  sizes);
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x6f35c(%rip), %rsi     # 0x89b02
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x6f2ae(%rip), %rsi     # 0x89a6a
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x6ed6f(%rip), %ymm0    # 0x89568
movabsq $0xf4240000dbba0, %rax  # imm = 0xF4240000DBBA0
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x6f24d(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x1a991
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x6f222(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x1aa89
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x6f1f8(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x1ab7f
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x6f1de(%rip), %rsi     # 0x89a8e
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x1ac8c
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x6f1a0(%rip), %rsi     # 0x89a7f
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x1adb2
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x6f187(%rip), %rsi     # 0x89a95
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x1aeb5
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x1a950
jmp 0x1a97a
jmp 0x1a950
jmp 0x1a97a
jmp 0x1a950
jmp 0x1a97a
jmp 0x1a950
jmp 0x1a97a
jmp 0x1a950
jmp 0x1a97a
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x1a973
jmp 0x1a97a
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x1a96e
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x1a97d
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_fill_front<Trivial<8>>::run()
static void run(){
        new_graph<T>("fill_front", "us");

        auto sizes = { 10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000 };

        // it is too slow with bigger data types
        if(is_small<T>()){
            bench<std::vector<T>, microseconds, Empty, FillFront>("vector", sizes);
        }

        bench<std::list<T>,   microseconds, Empty, FillFront>("list",   sizes);
        bench<std::deque<T>,  microseconds, Empty, FillFront>("deque",  sizes);
        // colony is unordered
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x6856f(%rip), %rsi     # 0x89b0f
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x684b4(%rip), %rsi     # 0x89a6a
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x67f9d(%rip), %ymm0    # 0x89590
movabsq $0x186a000015f90, %rax  # imm = 0x186A000015F90
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x68453(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x216f2
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x68428(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x217ea
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x683fe(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x218e0
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x216b1
jmp 0x216db
jmp 0x216b1
jmp 0x216db
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x216d4
jmp 0x216db
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x216cf
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x216de
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_emplace_front<Trivial<8>>::run()
static void run(){
        new_graph<T>("emplace_front", "us");

        auto sizes = { 10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000 };

        // it is too slow with bigger data types
        if(is_small<T>()){
            bench<std::vector<T>, microseconds, Empty, EmplaceFront>("vector", sizes);
        }

        bench<std::list<T>,   microseconds, Empty, EmplaceFront>("list",   sizes);
        bench<std::deque<T>,  microseconds, Empty, EmplaceFront>("deque",  sizes);
        // colony is unordered
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x65f24(%rip), %rsi     # 0x89b1a
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x65e5e(%rip), %rsi     # 0x89a6a
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x65947(%rip), %ymm0    # 0x89590
movabsq $0x186a000015f90, %rax  # imm = 0x186A000015F90
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x65dfd(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x23d48
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x65dd2(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x23e40
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x65da8(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x23f36
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x23d07
jmp 0x23d31
jmp 0x23d07
jmp 0x23d31
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x23d2a
jmp 0x23d31
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x23d25
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x23d34
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_linear_search<Trivial<8>>::run()
static void run(){
        new_graph<T>("linear_search", "us");

        auto sizes = {1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 10000};
        bench<std::vector<T>, microseconds, FilledRandom, Find>("vector", sizes);
        bench<std::list<T>,   microseconds, FilledRandom, Find>("list",   sizes);
        bench<std::deque<T>,  microseconds, FilledRandom, Find>("deque",  sizes);
        bench<plf::colony<T>, microseconds, FilledRandomInsert, Find>("colony",  sizes);
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x63be8(%rip), %rsi     # 0x89b28
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x63b14(%rip), %rsi     # 0x89a6a
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x635ad(%rip), %ymm0    # 0x89540
movabsq $0x271000002328, %rax   # imm = 0x271000002328
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x63ab3(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x260c5
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x63a88(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x261b8
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x63a5e(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x262ab
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x63a44(%rip), %rsi     # 0x89a8e
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x2639e
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x26084
jmp 0x260ae
jmp 0x26084
jmp 0x260ae
jmp 0x26084
jmp 0x260ae
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x260a7
jmp 0x260ae
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x260a2
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x260b1
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/include/policies.hpp
// Function: FilledRandom<std::__cxx11::list<Trivial<32>, std::allocator<Trivial<32>>>>::make(unsigned long)
inline static Container make(std::size_t size){
        // prepare randomized data that will have all the integers from the range
        if(v.size() != size){
            v.clear();
            v.reserve(size);
            for(std::size_t i = 0; i < size; ++i){
                v.push_back({i});
            }
            std::shuffle(begin(v), end(v), std::mt19937());
        }

        // fill with randomized data
        Container container;
        for(std::size_t i = 0; i < size; ++i){
            container.push_back(v[i]);
        }

        return container;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x1388, %rsp           # imm = 0x1388
movq 0xaf798(%rip), %rcx     # 0xd7688
movq 0xaf789(%rip), %rax     # 0xd7680
movq %rsi, %r14
movq %rdi, %rbx
movq %rcx, %rdx
subq %rax, %rdx
sarq $0x5, %rdx
cmpq %rsi, %rdx
je 0x27f83
cmpq %rax, %rcx
je 0x27f18
movq %rax, 0xaf770(%rip)     # 0xd7688
leaq 0xaf761(%rip), %r15     # 0xd7680
movq %r14, %rsi
movq %r15, %rdi
callq 0xb478
leaq 0x8(%rsp), %r13
xorl %ebp, %ebp
movq %rsp, %r12
cmpq %rbp, %r14
je 0x27f5c
andq $0x0, 0x10(%r13)
vxorps %xmm0, %xmm0, %xmm0
movq %r15, %rdi
movq %r12, %rsi
vmovups %xmm0, (%r13)
movq %rbp, (%rsp)
callq 0x27bd8
incq %rbp
jmp 0x27f34
movq 0xaf71d(%rip), %r15     # 0xd7680
movq 0xaf71e(%rip), %r12     # 0xd7688
movq %rsp, %r13
movq %r13, %rdi
callq 0x7b40
movq %r15, %rdi
movq %r12, %rsi
movq %r13, %rdx
callq 0x27a49
movq %rbx, 0x8(%rbx)
movq %rbx, (%rbx)
andq $0x0, 0x10(%rbx)
xorl %r15d, %r15d
subq $0x1, %r14
jb 0x27fb0
movq 0xaf6e1(%rip), %rsi     # 0xd7680
addq %r15, %rsi
movq %rbx, %rdi
callq 0xaf44
addq $0x20, %r15
jmp 0x27f92
movq %rbx, %rax
addq $0x1388, %rsp           # imm = 0x1388
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rbx, %rdi
movq %rax, %r14
callq 0xb00c
movq %r14, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/include/policies.hpp
// Function: Find<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>>::run(plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>&, unsigned long)
inline static void run(Container &c, std::size_t size){
        for(std::size_t i=0; i<size; ++i) {
            // hand written comparison to eliminate temporary object creation
            if(std::find_if(std::begin(c), std::end(c), [&](decltype(*std::begin(c)) v){ return v.a == i; }) == std::end(c)){
                ++X;
            }
        }
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
leaq 0x50(%rsp), %r15
leaq 0x30(%rsp), %r12
leaq 0x10(%rsp), %r13
leaq 0x8(%rsp), %rbp
movq %rsi, %rbx
movq %rdi, %r14
xorl %eax, %eax
movq %rax, 0x8(%rsp)
cmpq %rbx, %rax
jae 0x272d4
vmovups 0x18(%r14), %xmm0
movq %r15, %rdi
movq %r12, %rsi
movq %r13, %rdx
movq %rbp, %rcx
vmovaps %xmm0, 0x30(%rsp)
movq 0x28(%r14), %rax
movq %rax, 0x40(%rsp)
vmovups (%r14), %xmm0
vmovaps %xmm0, 0x10(%rsp)
movq 0x10(%r14), %rax
movq %rax, 0x20(%rsp)
callq 0x272e3
movq 0x58(%rsp), %rax
cmpq 0x8(%r14), %rax
jne 0x272ca
incq 0x1a71e6(%rip)          # 0x1ce4b0
movq 0x8(%rsp), %rax
incq %rax
jmp 0x27274
addq $0x68, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/include/policies.hpp
// Function: FilledRandomInsert<plf::colony<Trivial<32>, std::allocator<Trivial<32>>, unsigned short>>::make(unsigned long)
inline static Container make(std::size_t size){
        // prepare randomized data that will have all the integers from the range
        if(v.size() != size){
            v.clear();
            v.reserve(size);
            for(std::size_t i = 0; i < size; ++i){
                v.push_back({i});
            }
            std::shuffle(begin(v), end(v), std::mt19937());
        }

        // fill with randomized data
        Container container;
        for(std::size_t i = 0; i < size; ++i){
            container.insert(v[i]);
        }

        return container;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x1388, %rsp           # imm = 0x1388
movq 0xaf2ee(%rip), %rcx     # 0xd76c8
movq 0xaf2df(%rip), %rax     # 0xd76c0
movq %rsi, %r14
movq %rdi, %rbx
movq %rcx, %rdx
subq %rax, %rdx
sarq $0x5, %rdx
cmpq %rsi, %rdx
je 0x2846d
cmpq %rax, %rcx
je 0x28402
movq %rax, 0xaf2c6(%rip)     # 0xd76c8
leaq 0xaf2b7(%rip), %r15     # 0xd76c0
movq %r14, %rsi
movq %r15, %rdi
callq 0xb478
leaq 0x8(%rsp), %r13
xorl %ebp, %ebp
movq %rsp, %r12
cmpq %rbp, %r14
je 0x28446
andq $0x0, 0x10(%r13)
vxorps %xmm0, %xmm0, %xmm0
movq %r15, %rdi
movq %r12, %rsi
vmovups %xmm0, (%r13)
movq %rbp, (%rsp)
callq 0x27bd8
incq %rbp
jmp 0x2841e
movq 0xaf273(%rip), %r15     # 0xd76c0
movq 0xaf274(%rip), %r12     # 0xd76c8
movq %rsp, %r13
movq %r13, %rdi
callq 0x7b40
movq %r15, %rdi
movq %r12, %rsi
movq %r13, %rdx
callq 0x27a49
vxorps %xmm0, %xmm0, %xmm0
xorl %r12d, %r12d
movq %rsp, %r15
vmovups %zmm0, (%rbx)
vxorps %xmm0, %xmm0, %xmm0
movl $0xffff000c, 0x40(%rbx) # imm = 0xFFFF000C
vmovups %ymm0, 0x48(%rbx)
vmovups %ymm0, 0x58(%rbx)
movq $0x8, 0x78(%rbx)
subq $0x1, %r14
jb 0x284be
movq 0xaf219(%rip), %rdx     # 0xd76c0
addq %r12, %rdx
movq %r15, %rdi
movq %rbx, %rsi
vzeroupper
callq 0xb566
addq $0x20, %r12
jmp 0x2849a
movq %rbx, %rax
addq $0x1388, %rsp           # imm = 0x1388
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
vzeroupper
retq
movq %rbx, %rdi
movq %rax, %r14
callq 0xb50a
movq %r14, %rdi
callq 0x42c0
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_write<Trivial<8>>::run()
static void run(){
        new_graph<T>("write", "us");

        auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000};
        bench<std::vector<T>, microseconds, FilledRandom, Write>("vector", sizes);
        bench<std::list<T>,   microseconds, FilledRandom, Write>("list",   sizes);
        bench<std::deque<T>,  microseconds, FilledRandom, Write>("deque",  sizes);
        bench<plf::colony<T>, microseconds, FilledRandomInsert, Write>("colony",  sizes);
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x59fa3(%rip), %rsi     # 0x89ba9
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x59e4e(%rip), %rsi     # 0x89a6a
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x59937(%rip), %ymm0    # 0x89590
movabsq $0x186a000015f90, %rax  # imm = 0x186A000015F90
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x59ded(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x2fd8b
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x59dc2(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x2fe6f
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x59d98(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x2ff53
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x59d7e(%rip), %rsi     # 0x89a8e
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x30037
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x2fd4a
jmp 0x2fd74
jmp 0x2fd4a
jmp 0x2fd74
jmp 0x2fd4a
jmp 0x2fd74
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x2fd6d
jmp 0x2fd74
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x2fd68
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x2fd77
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/include/policies.hpp
// Function: Write<std::__cxx11::list<Trivial<8>, std::allocator<Trivial<8>>>>::run(std::__cxx11::list<Trivial<8>, std::allocator<Trivial<8>>>&, unsigned long)
inline static void run(Container &c, std::size_t){
        auto it = std::begin(c);
        auto end = std::end(c);

        for(; it != end; ++it){
            ++(it->a);
        }
    }

// Assembly:
movq %rdi, %rax
movq (%rax), %rax
cmpq %rdi, %rax
je 0x30149
incq 0x10(%rax)
jmp 0x3013b
retq
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_random_insert<Trivial<8>>::run()
static void run(){
        new_graph<T>("random_insert", "ms");

        auto sizes = {10000, 20000, 30000, 40000, 50000, 60000, 70000, 80000, 90000, 100000};
        bench<std::vector<T>, milliseconds, FilledRandom, Insert>("vector", sizes);
        bench<std::list<T>,   milliseconds, FilledRandom, Insert>("list",   sizes);
        bench<std::deque<T>,  milliseconds, FilledRandom, Insert>("deque",  sizes);
        // colony is unordered
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x57181(%rip), %rsi     # 0x89baf
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x57179(%rip), %rsi     # 0x89bbd
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x56b0f(%rip), %ymm0    # 0x89590
movabsq $0x186a000015f90, %rax  # imm = 0x186A000015F90
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x56fc5(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x32b80
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x56f9a(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x32c73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x56f70(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x32d66
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x32b3f
jmp 0x32b69
jmp 0x32b3f
jmp 0x32b69
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x32b62
jmp 0x32b69
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x32b5d
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x32b6c
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/include/policies.hpp
// Function: Insert<std::deque<NonTrivialStringMovable, std::allocator<NonTrivialStringMovable>>>::run(std::deque<NonTrivialStringMovable, std::allocator<NonTrivialStringMovable>>&, unsigned long)
inline static void run(Container &c, std::size_t){
        for(std::size_t i=0; i<1000; ++i) {
            // hand written comparison to eliminate temporary object creation
            auto it = std::find_if(std::begin(c), std::end(c), [&](decltype(*std::begin(c)) v){ return v.a == i; });
            c.insert(it, values[i]);
        }
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xa8, %rsp
leaq 0x28(%rsp), %r12
leaq 0xb2225(%rip), %r15     # 0xeb270
leaq 0x88(%rsp), %rbp
leaq 0x8(%rsp), %r14
movq %rdi, %rbx
xorl %eax, %eax
movq %rsp, %r13
movq %rax, (%rsp)
cmpq $0x3e8, %rax            # imm = 0x3E8
jae 0x390c8
vmovups 0x10(%rbx), %ymm0
leaq 0x68(%rsp), %rdi
leaq 0x48(%rsp), %rsi
movq %r12, %rdx
movq %r13, %rcx
vmovups %ymm0, 0x48(%rsp)
vmovups 0x30(%rbx), %ymm0
vmovups %ymm0, 0x28(%rsp)
vzeroupper
callq 0x390da
imulq $0x28, (%rsp), %rcx
vmovups 0x68(%rsp), %ymm0
movq %rbp, %rdi
movq %rbx, %rsi
movq %r14, %rdx
addq %r15, %rcx
vmovups %ymm0, 0x8(%rsp)
vzeroupper
callq 0x3910c
movq (%rsp), %rax
incq %rax
jmp 0x39060
addq $0xa8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_colony.h
// Function: plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::colony_iterator<std::allocator<Trivial<8>>, false>::check_for_end_of_group_and_progress()
inline PLF_COLONY_FORCE_INLINE void check_for_end_of_group_and_progress() // used by erase
		{
			if (element_pointer == group_pointer->last_endpoint && group_pointer->next_group != NULL)
			{
				group_pointer = group_pointer->next_group;
				element_pointer = group_pointer->elements + *(group_pointer->skipfield);
				skipfield_pointer = group_pointer->skipfield + *(group_pointer->skipfield);
			}
		}

// Assembly:
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
cmpq (%rax), %rcx
je 0x3d993
retq
movq 0x8(%rax), %rax
testq %rax, %rax
je 0x3d992
movq %rax, (%rdi)
movq 0x18(%rax), %rcx
movzwl (%rcx), %edx
leal (,%rdx,8), %esi
addq 0x10(%rax), %rsi
leaq (%rcx,%rdx,2), %rax
movq %rsi, 0x8(%rdi)
movq %rax, 0x10(%rdi)
retq
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_colony.h
// Function: plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::reduced_stack::initialize(unsigned long)
void initialize(const size_type first_group_size)
		{
			first_group = current_group = PLF_COLONY_ALLOCATE(stack_group_allocator_type, group_allocator_pair, 1, 0);

			try
			{
				#ifdef PLF_COLONY_VARIADICS_SUPPORT
					PLF_COLONY_CONSTRUCT(stack_group_allocator_type, group_allocator_pair, first_group, first_group_size);
				#else
					PLF_COLONY_CONSTRUCT(stack_group_allocator_type, group_allocator_pair, first_group, group(first_group_size));
				#endif
			}
			catch (...)
			{
				PLF_COLONY_DEALLOCATE(stack_group_allocator_type, group_allocator_pair, first_group, 1);
				first_group = current_group = NULL;
				throw;
			}

			top_element = start_element = first_group->elements;
			end_element = first_group->end;
		}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movq %rsi, %r14
pushq $0x20
popq %rdi
callq 0x41a0
movq %rax, (%rbx)
movq %rax, 0x8(%rbx)
movq %rax, %rdi
movq %r14, %rsi
xorl %edx, %edx
callq 0x3dd8a
movq 0x8(%rbx), %rax
movq (%rax), %rcx
movq %rcx, 0x18(%rbx)
movq %rcx, 0x10(%rbx)
movq 0x18(%rax), %rax
movq %rax, 0x20(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
movq %rax, %rdi
callq 0x4090
movq 0x8(%rbx), %rdi
callq 0x4180
vxorps %xmm0, %xmm0, %xmm0
vmovups %xmm0, (%rbx)
callq 0x4240
movq %rax, %rbx
callq 0x42b0
movq %rbx, %rdi
callq 0x42c0
movq %rax, %rdi
callq 0x7b4a
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_sort<Trivial<8>>::run()
static void run(){
        new_graph<T>("sort", "ms");

        auto sizes = {100000, 200000, 300000, 400000, 500000, 600000, 700000, 800000, 900000, 1000000};
        bench<std::vector<T>, milliseconds, FilledRandom, Sort>("vector", sizes);
        bench<std::list<T>,   milliseconds, FilledRandom, Sort>("list",   sizes);
        bench<std::deque<T>,  milliseconds, FilledRandom, Sort>("deque",  sizes);
        bench<plf::colony<T>,  milliseconds, FilledRandomInsert, Sort>("colony",  sizes);
        bench<plf::colony<T>,  milliseconds, FilledRandomInsert, TimSort>("colony_timsort",  sizes);
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x3978f(%rip), %rsi     # 0x89c01
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x39735(%rip), %rsi     # 0x89bbd
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x390a3(%rip), %ymm0    # 0x89568
movabsq $0xf4240000dbba0, %rax  # imm = 0xF4240000DBBA0
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x39581(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x5062a
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x39556(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x50721
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x3952c(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x5080d
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x39512(%rip), %rsi     # 0x89a8e
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x50900
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x3964c(%rip), %rsi     # 0x89bf7
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x509f2
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x505e9
jmp 0x50613
jmp 0x505e9
jmp 0x50613
jmp 0x505e9
jmp 0x50613
jmp 0x505e9
jmp 0x50613
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x5060c
jmp 0x50613
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x50607
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x50616
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_colony.h
// Function: plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::change_group_sizes(unsigned short, unsigned short)
void change_group_sizes(const skipfield_type min_allocation_amount, const skipfield_type max_allocation_amount)
	{
		assert((min_allocation_amount > 2) & (min_allocation_amount <= max_allocation_amount));

		min_elements_per_group = min_allocation_amount;
		group_allocator_pair.max_elements_per_group = max_allocation_amount;

		// The following will only have an effect if the erased_locations becomes empty or is already empty
		erased_locations.group_allocator_pair.min_elements_per_group = ((min_allocation_amount < 8) ? min_allocation_amount : (min_allocation_amount >> 7) + 8);

		if (first_group != NULL && (first_group->size < min_allocation_amount || end_iterator.group_pointer->size > max_allocation_amount))
		{
			consolidate();
		}
	}

// Assembly:
movl %esi, %eax
shrl $0x7, %eax
movw %si, 0x40(%rdi)
movw %dx, 0x42(%rdi)
addl $0x8, %eax
cmpw $0x8, %si
cmovbl %esi, %eax
movq %rax, 0x78(%rdi)
movq 0x30(%rdi), %rax
testq %rax, %rax
je 0x51fe9
cmpw %si, 0x32(%rax)
jb 0x9692
movq (%rdi), %rax
cmpw %dx, 0x32(%rax)
ja 0x9692
retq
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::sort(Trivial<8>**, Trivial<8>**, plf::Compare<Trivial<8>* const&, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>)
static void sort(iter_t const lo, iter_t const hi, compare_t c)
	{
		diff_t nRemaining = (hi - lo);

		if (nRemaining < 2)
		{
			return; // nothing to do
		}

		if (nRemaining < MIN_MERGE)
		{
			diff_t const initRunLen = countRunAndMakeAscending(lo, hi, c);
			binarySort(lo, hi, lo + initRunLen, c);
			return;
		}

		TimSort ts(c);
		diff_t const minRun = minRunLength(nRemaining);
		iter_t cur = lo;

		do
		{
			diff_t runLen = countRunAndMakeAscending(cur, hi, c);

			if (runLen < minRun)
			{
				diff_t const force = std::min(nRemaining, minRun);
				binarySort(cur, cur + force, cur + runLen, c);
				runLen = force;
			}

			ts.pushRun(cur, runLen);
			ts.mergeCollapse();

			cur += runLen;
			nRemaining -= runLen;
		} while (nRemaining != 0);

		assert(cur == hi);
		ts.mergeForceCollapse();
		assert(ts.pending_.size() == 1);

	}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rsi, %r12
subq %rdi, %r12
movq %rdx, 0x8(%rsp)
sarq $0x3, %r12
cmpq $0x2, %r12
jl 0x52920
movq %rsi, %r13
movq %rdi, %r14
cmpq $0x1f, %r12
ja 0x5285d
movq 0x8(%rsp), %rbx
leaq 0x7(%rsp), %rdx
movq %r14, %rdi
movq %r13, %rsi
movb (%rbx), %al
movb %al, (%rdx)
callq 0x52948
movb (%rbx), %sil
leaq (%r14,%rax,8), %rdx
leaq 0x6(%rsp), %rcx
movq %r14, %rdi
movb %sil, (%rcx)
movq %r13, %rsi
callq 0x529c2
jmp 0x52920
movq 0x8(%rsp), %rax
leaq 0x10(%rsp), %r15
vxorps %xmm0, %xmm0, %xmm0
movq %r12, %rdi
movb (%rax), %al
movb %al, (%r15)
movl $0x7, 0x4(%r15)
vmovups %ymm0, 0x8(%r15)
vmovups %ymm0, 0x18(%r15)
vzeroupper
callq 0x52a28
movq %rax, %rbp
movq 0x8(%rsp), %rax
movb (%rax), %al
movb %al, 0x5(%rsp)
leaq 0x5(%rsp), %rdx
movq %r14, %rdi
movq %r13, %rsi
callq 0x52948
movq %rax, %rbx
cmpq %rbp, %rax
jge 0x528ed
movq 0x8(%rsp), %rax
cmpq %r12, %rbp
leaq (%r14,%rbx,8), %rdx
movq %r13, %r15
movq %r12, %r13
cmovlq %rbp, %r13
leaq (%r14,%r13,8), %rsi
movb (%rax), %al
movb %al, 0x4(%rsp)
leaq 0x4(%rsp), %rcx
movq %r14, %rdi
callq 0x529c2
movq %r13, %rbx
movq %r15, %r13
leaq 0x10(%rsp), %r15
movq %r15, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x52a42
movq %r15, %rdi
callq 0x52a64
leaq (%r14,%rbx,8), %r14
subq %rbx, %r12
jne 0x52892
leaq 0x10(%rsp), %rdi
callq 0x52af4
leaq 0x10(%rsp), %rdi
callq 0x52b44
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x52933
jmp 0x52933
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x52b44
movq %rbx, %rdi
callq 0x42c0
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::countRunAndMakeAscending(Trivial<8>**, Trivial<8>**, plf::Compare<Trivial<8>* const&, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>)
static diff_t countRunAndMakeAscending(iter_t const lo, iter_t const hi, compare_t compare)
	{
		assert(lo < hi);

		iter_t runHi = lo + 1;
		if (runHi == hi)
		{
			return 1;
		}

		if (compare.lt(*(runHi++), *lo))   // descending
		{
			while (runHi < hi && compare.lt(*runHi, *(runHi - 1)))
			{
				++runHi;
			}
			
			std::reverse(lo, runHi);
		}
		else     // ascending
		{
			while (runHi < hi && compare.ge(*runHi, *(runHi - 1)))
			{
				++runHi;
			}
		}

		return runHi - lo;
	}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
leaq 0x8(%rdi), %rax
cmpq %rsi, %rax
je 0x5299f
movq 0x8(%rdi), %rcx
movq (%rdi), %rax
leaq 0x10(%rdi), %rbx
movq %rdi, %r14
movq (%rcx), %rcx
cmpq (%rax), %rcx
jae 0x52985
cmpq %rsi, %rbx
jae 0x529a4
movq (%rbx), %rcx
movq -0x8(%rbx), %rax
movq (%rcx), %rcx
cmpq (%rax), %rcx
jae 0x529a4
addq $0x8, %rbx
jmp 0x5296b
cmpq %rsi, %rbx
jae 0x529af
movq (%rbx), %rcx
movq -0x8(%rbx), %rax
movq (%rcx), %rcx
cmpq (%rax), %rcx
jb 0x529af
addq $0x8, %rbx
jmp 0x52985
pushq $0x1
popq %rbx
jmp 0x529b6
movq %r14, %rdi
movq %rbx, %rsi
callq 0x52b5e
subq %r14, %rbx
sarq $0x3, %rbx
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::binarySort(Trivial<8>**, Trivial<8>**, Trivial<8>**, plf::Compare<Trivial<8>* const&, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>)
static void binarySort(iter_t const lo, iter_t const hi, iter_t start, compare_t compare)
	{
		assert(lo <= start && start <= hi);
		if (start == lo)
		{
			++start;
		}
		for (; start < hi; ++start)
		{
			assert(lo <= start);
			/*const*/ value_t pivot = PLF_TIMSORT_MOVE(*start);

			iter_t const pos = std::upper_bound(lo, start, pivot, compare.less_function());
			for (iter_t p = start; p > pos; --p)
			{
				*p = PLF_TIMSORT_MOVE(*(p - 1));
			}
			*pos = PLF_TIMSORT_MOVE(pivot);
		}
	}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
xorl %eax, %eax
cmpq %rdi, %rdx
movq %rsi, %rbx
movq %rdi, %r14
movq %rsp, %r12
sete %al
leaq (%rdx,%rax,8), %r15
cmpq %rbx, %r15
jae 0x52a1b
movq (%r15), %rax
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %rax, (%rsp)
callq 0x52b7f
movq %r15, %rcx
cmpq %rax, %rcx
jbe 0x52a0e
movq -0x8(%rcx), %rdx
movq %rdx, (%rcx)
addq $-0x8, %rcx
jmp 0x529fc
movq (%rsp), %rcx
addq $0x8, %r15
movq %rcx, (%rax)
jmp 0x529df
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::mergeCollapse()
void mergeCollapse()
	{
		while (pending_.size() > 1)
		{
			diff_t n = pending_.size() - 2;

			if ((n > 0 && pending_[n - 1].len <= pending_[n].len + pending_[n + 1].len) || (n > 1 && pending_[n - 2].len <= pending_[n - 1].len + pending_[n].len))
			{
				if (pending_[n - 1].len < pending_[n + 1].len)
				{
					--n;
				}
				
				mergeAt(n);
			}
			else if (pending_[n].len <= pending_[n + 1].len)
			{
				mergeAt(n);
			}
			else
			{
				break;
			}
		}
	}

// Assembly:
pushq %rbx
movq %rdi, %rbx
movq 0x20(%rbx), %rax
movq 0x28(%rbx), %rdi
subq %rax, %rdi
movq %rdi, %rdx
sarq $0x4, %rdx
cmpq $0x2, %rdx
jb 0x52af2
leaq -0x2(%rdx), %rsi
cmpq $0x2, %rdx
jle 0x52acf
movq %rsi, %r8
shlq $0x4, %r8
movq -0x8(%rax,%rdi), %rcx
movq -0x28(%rax,%rdi), %r9
movq 0x8(%rax,%r8), %r8
leaq (%rcx,%r8), %r10
cmpq %r10, %r9
jle 0x52ab9
cmpq $0x2, %rsi
jb 0x52ae0
addq %r8, %r9
cmpq %r9, -0x38(%rax,%rdi)
jg 0x52ae0
addq $-0x3, %rdx
movq %rdx, %rdi
shlq $0x4, %rdi
cmpq %rcx, 0x8(%rax,%rdi)
cmovlq %rdx, %rsi
jmp 0x52ae5
movq %rsi, %rcx
shlq $0x4, %rcx
movq 0x8(%rax,%rcx), %r8
movq -0x8(%rax,%rdi), %rcx
cmpq %rcx, %r8
jg 0x52af2
movq %rbx, %rdi
callq 0x52d18
jmp 0x52a68
popq %rbx
retq
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::mergeForceCollapse()
void mergeForceCollapse()
	{
		while (pending_.size() > 1)
		{
			diff_t n = pending_.size() - 2;

			if (n > 0 && pending_[n - 1].len < pending_[n + 1].len)
			{
				--n;
			}
			
			mergeAt(n);
		}
	}

// Assembly:
pushq %rbx
movq %rdi, %rbx
movq 0x20(%rbx), %rcx
movq 0x28(%rbx), %rdx
subq %rcx, %rdx
movq %rdx, %rax
sarq $0x4, %rax
cmpq $0x2, %rax
jb 0x52b41
leaq -0x2(%rax), %rsi
cmpq $0x3, %rax
jl 0x52b37
addq $-0x3, %rax
movq %rax, %rdi
shlq $0x4, %rdi
movq 0x8(%rcx,%rdi), %rdi
cmpq -0x8(%rcx,%rdx), %rdi
jl 0x52b34
movq %rsi, %rax
movq %rax, %rsi
movq %rbx, %rdi
callq 0x52d18
jmp 0x52af8
popq %rbx
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::mergeAt(long)
void mergeAt(diff_t const i)
	{
		diff_t const stackSize = pending_.size();
		assert(stackSize >= 2);
		assert(i >= 0);
		assert(i == stackSize - 2 || i == stackSize - 3);

		iter_t base1 = pending_[i].base;
		diff_t len1 = pending_[i].len;
		iter_t base2 = pending_[i + 1].base;
		diff_t len2 = pending_[i + 1].len;

		assert(len1 > 0 && len2 > 0);
		assert(base1 + len1 == base2);

		pending_[i].len = len1 + len2;

		if (i == stackSize - 3)
		{
			pending_[i + 1] = pending_[i + 2];
		}

		pending_.pop_back();

		diff_t const k = gallopRight(*base2, base1, len1, 0);
		assert(k >= 0);

		base1 += k;
		len1 -= k;

		if (len1 == 0)
		{
			return;
		}

		len2 = gallopLeft(*(base1 + (len1 - 1)), base2, len2, len2 - 1);
		assert(len2 >= 0);
		if (len2 == 0)
		{
			return;
		}

		if (len1 <= len2)
		{
			mergeLo(base1, len1, base2, len2);
		}
		else
		{
			mergeHi(base1, len1, base2, len2);
		}
	}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq 0x20(%rdi), %rcx
movq 0x28(%rdi), %rax
movq %rsi, %r10
shlq $0x4, %r10
movq %rdi, %rbx
movq 0x8(%rcx,%r10), %r13
movq 0x18(%rcx,%r10), %r12
movq (%rcx,%r10), %rdx
movq 0x10(%rcx,%r10), %r15
movq %rax, %rdi
subq %rcx, %rdi
sarq $0x4, %rdi
addq $-0x3, %rdi
leaq (%r12,%r13), %r8
movq %r8, 0x8(%rcx,%r10)
cmpq %rsi, %rdi
jne 0x52d7a
leaq (%rcx,%r10), %rax
leaq 0x10(%rcx,%r10), %rcx
vmovups 0x20(%rax), %xmm0
vmovups %xmm0, (%rcx)
movq 0x28(%rbx), %rax
addq $-0x10, %rax
movq %rbx, %rdi
movq %r15, %rsi
movq %r13, %rcx
xorl %r8d, %r8d
movq %rdx, (%rsp)
movq %rax, 0x28(%rbx)
callq 0x52e0e
movq %r13, %rbp
subq %rax, %rbp
je 0x52def
movq (%rsp), %rcx
leaq -0x1(%r12), %r8
movq %rax, %r14
movq %rbx, %rdi
movq %r15, %rdx
leaq -0x8(%rcx,%r13,8), %rsi
movq %r12, %rcx
callq 0x52eb8
testq %rax, %rax
je 0x52def
movq (%rsp), %rdx
movq %rbx, %rdi
movq %r15, %rcx
movq %rax, %r8
leaq (%rdx,%r14,8), %rsi
movq %rbp, %rdx
addq $0x8, %rsp
cmpq %rax, %rbp
jle 0x52dfe
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x531ee
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x52f6c
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: long plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::gallopRight<__gnu_cxx::__normal_iterator<Trivial<8>**, std::vector<Trivial<8>*, std::allocator<Trivial<8>*>>>>(Trivial<8>*&, __gnu_cxx::__normal_iterator<Trivial<8>**, std::vector<Trivial<8>*, std::allocator<Trivial<8>*>>>, long, long)
diff_t gallopRight(ref_t key, Iter const base, diff_t const len, diff_t const hint)
	{
		assert(len > 0 && hint >= 0 && hint < len);

		diff_t ofs = 1;
		diff_t lastOfs = 0;

		if (comp_.lt(key, *(base + hint)))
		{
			diff_t const maxOfs = hint + 1;

			while (ofs < maxOfs && comp_.lt(key, *(base + (hint - ofs))))
			{
				lastOfs = ofs;
				ofs = (ofs << 1) + 1;

				if (ofs <= 0)
				{
					ofs = maxOfs;
				}
			}

			if (ofs > maxOfs)
			{
				ofs = maxOfs;
			}

			diff_t const tmp = lastOfs;
			lastOfs = hint - ofs;
			ofs = hint - tmp;
		}
		else
		{
			diff_t const maxOfs = len - hint;

			while (ofs < maxOfs && comp_.ge(key, *(base + (hint + ofs))))
			{
				lastOfs = ofs;
				ofs = (ofs << 1) + 1;

				if (ofs <= 0)   // int overflow
				{
					ofs = maxOfs;
				}
			}

			if (ofs > maxOfs)
			{
				ofs = maxOfs;
			}

			lastOfs += hint;
			ofs += hint;
		}
		assert(-1 <= lastOfs && lastOfs < ofs && ofs <= len);

		return std::upper_bound(base + (lastOfs + 1), base + ofs, key, comp_.less_function()) - base;
	}

// Assembly:
pushq %rbx
movq (%rsi), %rax
movq %rdx, %rbx
movq %rsi, %rdx
movq (%rbx,%r8,8), %rsi
movq (%rax), %rax
cmpq (%rsi), %rax
jae 0x535de
leaq 0x1(%r8), %rcx
pushq $0x1
popq %rsi
xorl %edi, %edi
movq %r8, %r9
subq %rsi, %r9
jl 0x5360d
movq (%rbx,%r9,8), %r9
cmpq (%r9), %rax
jae 0x5360d
leaq 0x1(%rsi,%rsi), %r9
movq %rsi, %rdi
addq %rsi, %rsi
cmovsq %rcx, %r9
movq %r9, %rsi
jmp 0x535b9
leaq (%rbx,%r8,8), %rdi
subq %r8, %rcx
pushq $0x1
popq %r9
xorl %esi, %esi
cmpq %rcx, %r9
jge 0x5361f
movq (%rdi,%r9,8), %r10
cmpq (%r10), %rax
jb 0x5361f
leaq 0x1(%r9,%r9), %r10
movq %r9, %rsi
addq %r9, %r9
cmovsq %rcx, %r10
movq %r10, %r9
jmp 0x535eb
cmpq %rcx, %rsi
cmovlq %rsi, %rcx
movq %r8, %rsi
subq %rdi, %r8
subq %rcx, %rsi
jmp 0x5362c
cmpq %rcx, %r9
cmovlq %r9, %rcx
addq %r8, %rsi
addq %rcx, %r8
leaq 0x8(%rbx,%rsi,8), %rdi
leaq (%rbx,%r8,8), %rsi
callq 0x53835
subq %rbx, %rax
sarq $0x3, %rax
popq %rbx
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: long plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::gallopLeft<__gnu_cxx::__normal_iterator<Trivial<8>**, std::vector<Trivial<8>*, std::allocator<Trivial<8>*>>>>(Trivial<8>*&, __gnu_cxx::__normal_iterator<Trivial<8>**, std::vector<Trivial<8>*, std::allocator<Trivial<8>*>>>, long, long)
diff_t gallopLeft(ref_t key, Iter const base, diff_t const len, diff_t const hint)
	{
		assert(len > 0 && hint >= 0 && hint < len);

		diff_t lastOfs = 0;
		diff_t ofs = 1;

		if (comp_.gt(key, *(base + hint)))
		{
			diff_t const maxOfs = len - hint;

			while (ofs < maxOfs && comp_.gt(key, *(base + (hint + ofs))))
			{
				lastOfs = ofs;
				ofs = (ofs << 1) + 1;

				if (ofs <= 0)   // int overflow
				{
					ofs = maxOfs;
				}
			}

			if (ofs > maxOfs)
			{
				ofs = maxOfs;
			}

			lastOfs += hint;
			ofs += hint;
		}
		else
		{
			diff_t const maxOfs = hint + 1;

			while (ofs < maxOfs && comp_.le(key, *(base + (hint - ofs))))
			{
				lastOfs = ofs;
				ofs = (ofs << 1) + 1;

				if (ofs <= 0)
				{
					ofs = maxOfs;
				}
			}

			if (ofs > maxOfs)
			{
				ofs = maxOfs;
			}

			diff_t const tmp = lastOfs;
			lastOfs = hint - ofs;
			ofs = hint - tmp;
		}
		assert(-1 <= lastOfs && lastOfs < ofs && ofs <= len);

		return std::lower_bound(base + (lastOfs + 1), base + ofs, key, comp_.less_function()) - base;
	}

// Assembly:
pushq %rbx
movq (%rsi), %rax
movq %rdx, %rbx
movq %rsi, %rdx
movq (%rbx,%r8,8), %rsi
movq (%rax), %rax
cmpq %rax, (%rsi)
jae 0x538c1
leaq (%rbx,%r8,8), %rdi
subq %r8, %rcx
pushq $0x1
popq %r10
xorl %esi, %esi
movq %r10, %r9
cmpq %rcx, %r10
jge 0x538b2
movq (%rdi,%r9,8), %r10
cmpq %rax, (%r10)
jae 0x538b2
leaq 0x1(%r9,%r9), %r10
movq %r9, %rsi
addq %r9, %rsi
movq %r9, %rsi
cmovsq %rcx, %r10
jmp 0x5388d
cmpq %rcx, %r9
cmovlq %r9, %rcx
addq %r8, %rsi
addq %r8, %rcx
jmp 0x53906
leaq 0x1(%r8), %rcx
pushq $0x1
popq %r9
xorl %edi, %edi
movq %r9, %rsi
movq %r8, %r9
subq %rsi, %r9
jl 0x538f3
movq (%rbx,%r9,8), %r9
cmpq %rax, (%r9)
jb 0x538f3
leaq 0x1(%rsi,%rsi), %r9
movq %rsi, %rdi
addq %rsi, %rdi
movq %rsi, %rdi
cmovsq %rcx, %r9
jmp 0x538cb
cmpq %rcx, %rsi
cmovlq %rsi, %rcx
movq %r8, %rsi
subq %rdi, %r8
subq %rcx, %rsi
movq %r8, %rcx
leaq 0x8(%rbx,%rsi,8), %rdi
leaq (%rbx,%rcx,8), %rsi
callq 0x5391d
subq %rbx, %rax
sarq $0x3, %rax
popq %rbx
retq
// File: /workspace/github_cpp_makefile_star2_O2/wichtounet[P]articles/src/vector_list_update_1/bench.cpp
// Function: bench_destruction<Trivial<8>>::run()
static void run(){
        new_graph<T>("destruction", "us");

        auto sizes = {100000, 200000, 300000, 400000, 500000, 600000, 700000, 800000, 900000, 1000000};
        bench<std::vector<T>, microseconds, SmartFilled, SmartDelete>("vector", sizes);
        bench<std::list<T>,   microseconds, SmartFilled, SmartDelete>("list",   sizes);
        bench<std::deque<T>,  microseconds, SmartFilled, SmartDelete>("deque",  sizes);
        bench<plf::colony<T>,  microseconds, SmartFilled, SmartDelete>("colony",  sizes);
    }

// Assembly:
pushq %rbx
subq $0x70, %rsp
leaq 0x1d0a2(%rip), %rsi     # 0x89c06
leaq 0x40(%rsp), %rdi
leaq 0x30(%rsp), %rdx
callq 0x4080
leaq 0x1cef0(%rip), %rsi     # 0x89a6a
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x40(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x7e73
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x40(%rsp), %rbx
movq %rbx, %rdi
callq 0x40b0
vmovups 0x1c9b1(%rip), %ymm0    # 0x89568
movabsq $0xf4240000dbba0, %rax  # imm = 0xF4240000DBBA0
movq %rbx, 0x30(%rsp)
movq $0xa, 0x38(%rsp)
movq %rax, 0x20(%rbx)
vmovups %ymm0, (%rbx)
leaq 0x1ce8f(%rip), %rsi     # 0x89a6d
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
vzeroupper
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x6cce9
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x1ce64(%rip), %rsi     # 0x89a74
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x6cdc7
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x1ce3a(%rip), %rsi     # 0x89a79
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x6cea5
leaq 0x10(%rsp), %rdi
callq 0x40b0
leaq 0x1ce20(%rip), %rsi     # 0x89a8e
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x4080
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x6cf83
leaq 0x10(%rsp), %rdi
callq 0x40b0
addq $0x70, %rsp
popq %rbx
retq
jmp 0x6cca8
jmp 0x6ccd2
jmp 0x6cca8
jmp 0x6ccd2
jmp 0x6cca8
jmp 0x6ccd2
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
jmp 0x6cccb
jmp 0x6ccd2
leaq 0x10(%rsp), %rdi
movq %rax, %rbx
callq 0x40b0
jmp 0x6ccc6
movq %rax, %rbx
leaq 0x40(%rsp), %rdi
callq 0x40b0
jmp 0x6ccd5
movq %rax, %rbx
movq %rbx, %rdi
callq 0x42c0