LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O2/superblocks[P]superblocks/set-lky.cpp
// Function: Superblocks::init()
void Superblocks::init() {

	coin = "LKY"; 
	coin_name = "Luckycoin";

	hash_length = 64;

	// normal (step 0)
	reward[0] = 88;

	// superblock (step 1)
	seed_type[1] = SEED_WITH_PREVIOUS_BLOCK_HASH;
	cutout_start[1] = 8;
	cutout_length[1] = 7;
	rnd_range_low[1] = 1;
	rnd_range_high[1] = 100000;
	luck_type[1] = LUCK_WITH_MORE_THAN_X_AND_LESS_THAN_Y;
	luck_x[1] = 30000;
	luck_y[1] = 35001;
	reward[1] = 176;

	// superblock (step 2)
	luck_type[2] = LUCK_WITH_MORE_THAN_X_AND_LESS_THAN_Y;
	luck_x[2] = 70000;
	luck_y[2] = 71001;
	reward[2] = 440;

	// superblock (step 3)
	luck_type[3] = LUCK_WITH_MORE_THAN_X_AND_LESS_THAN_Y;
	luck_x[3] = 50000;
	luck_y[3] = 50011;
	reward[3] = 5104;

}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %rbx
pushq %rax
movq %rdi, %rbx
addq $0x18, %rdi
leaq 0x1c28(%rip), %rsi      # 0x3e80
callq 0x1140
leaq 0x38(%rbx), %rdi
leaq 0x1c1c(%rip), %rsi      # 0x3e84
callq 0x1140
movl $0x40, 0x58(%rbx)
movabsq $0xb000000058, %rax     # imm = 0xB000000058
movq %rax, 0x14c(%rbx)
movl $0x2, 0x60(%rbx)
movl $0x8, 0x70(%rbx)
movl $0x7, 0x80(%rbx)
movl $0x1, 0x90(%rbx)
movl $0x186a0, 0xa0(%rbx)    # imm = 0x186A0
movl $0x3, 0x120(%rbx)
movl $0x7530, 0x130(%rbx)    # imm = 0x7530
movl $0x88b9, 0x140(%rbx)    # imm = 0x88B9
movabsq $0x300000003, %rax      # imm = 0x300000003
movq %rax, 0x124(%rbx)
movabsq $0xc35000011170, %rax   # imm = 0xC35000011170
movq %rax, 0x134(%rbx)
movabsq $0xc35b00011559, %rax   # imm = 0xC35B00011559
movq %rax, 0x144(%rbx)
movabsq $0x13f0000001b8, %rax   # imm = 0x13F0000001B8
movq %rax, 0x154(%rbx)
addq $0x8, %rsp
popq %rbx
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/huffman-encoder.cpp
// Function: HuffmanEncoder::buildFrequencyTable(unsigned char*)
void HuffmanEncoder :: buildFrequencyTable(byte *buffer) {
	//@std::cout << "In HuffmanEncoder::buildFrequencyTable()" << std::endl;
	Log(this, "Started...");

	// Compute the frequencies of each byte in buffer and generate the
	// symbol-frequency map
	int i, j;	//, freq_len = 0;
	double frequency[UCHAR_MAX + 1] = {0}; // 2^8-1 = 255 = UCHAR_MAX different symbols
	memset(frequency, 0, UCHAR_MAX);
	for(i = 0; buffer[i] != '\0'; i++) {
		j = buffer[i]; // Just to typecast 'byte' to 'int'
		++(frequency[j]);
	}

	/****** Test *******
	for(i = 0; i <= UCHAR_MAX; i++) {
		std::cout << "frequency[" << i << "] = " << frequency[i] << std::endl;
	}
	****/

	// Fill the original symbol-frequency map by filtering out symbols
	// that does not exist(or frequency[symbol(i)] = 0)
	for(i = 0; i <= UCHAR_MAX; i++) {
		if(frequency[i] > 0) {
			byte b = i;
			(*m_frequencyTable)[b] = frequency[i];
		}
	}


	for(auto& x : *m_frequencyTable)
		x.second = (x.second / m_inBuffSize) * 100;

	/****** Test *******
	for(auto& x : *m_frequencyTable)
		std::cout << x.first << ":" << x.second << std::endl;
	//std::cout << (*m_frequencyTable)[(byte)'0'] << std::endl;
	****/

	//asm("nop");
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x810, %rsp            # imm = 0x810
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x10(%rsp), %rdi
movl $0x800, %edx            # imm = 0x800
xorl %esi, %esi
callq 0x2140
movsd 0x28ed(%rip), %xmm0     # 0x5008
movzbl (%r14), %eax
testq %rax, %rax
je 0x2739
movsd 0x10(%rsp,%rax,8), %xmm1
addsd %xmm0, %xmm1
movsd %xmm1, 0x10(%rsp,%rax,8)
incq %r14
jmp 0x271b
xorl %r15d, %r15d
xorpd %xmm0, %xmm0
leaq 0x7(%rsp), %r14
cmpq $0x100, %r15            # imm = 0x100
je 0x2785
movsd 0x10(%rsp,%r15,8), %xmm1
ucomisd %xmm0, %xmm1
jbe 0x2780
movb %r15b, 0x7(%rsp)
movq 0x30(%rbx), %rdi
movq %r14, %rsi
movsd %xmm1, 0x8(%rsp)
callq 0x2b14
xorpd %xmm0, %xmm0
movsd 0x8(%rsp), %xmm1
movsd %xmm1, (%rax)
incq %r15
jmp 0x2745
movq 0x30(%rbx), %rax
addq $0x10, %rax
cvtsi2sdq 0x28(%rbx), %xmm0
movsd 0x2875(%rip), %xmm1     # 0x5010
movq (%rax), %rax
testq %rax, %rax
je 0x27b7
movsd 0x10(%rax), %xmm2
divsd %xmm0, %xmm2
mulsd %xmm1, %xmm2
movsd %xmm2, 0x10(%rax)
jmp 0x279b
addq $0x810, %rsp            # imm = 0x810
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/huffman-encoder.cpp
// Function: HuffmanEncoder::buildHuffmanTree()
void HuffmanEncoder :: buildHuffmanTree() {
	Log(this, "Started...");

	MinHeapNode<byte, double> *left, *right, *top;

	// Create a min heap & inserts all characters of data[]
	//@@@ MinHeap<byte, double> minHeap;
	for(auto& x : *m_frequencyTable)
		m_huffmanTree->push(new MinHeapNode<byte, double>(x.first, x.second));
	//printMinheap(*m_huffmanTree);

	// Iterate while size of heap doesn't become 1
	while (m_huffmanTree->size() != 1)
	{
		// Extract the two minimum freq items from min heap
		left = m_huffmanTree->top();
		m_huffmanTree->pop();

		right = m_huffmanTree->top();
		m_huffmanTree->pop();

		// Create a new internal node with frequency equal to the
		// sum of the two nodes frequencies. Make the two extracted
		// node as left and right children of this new node. Add
		// this node to the min heap.
		// 0x00 is a special value for internal nodes.
		top = new MinHeapNode<byte, double>(0x00, left->freq + right->freq, true);
		top->left = left;
		top->right = right;
		m_huffmanTree->push(top);
	}
	//printMinheap(*m_huffmanTree);
	//traversePreorder(m_huffmanTree->top(), "");
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq %rdi, %rbx
movq 0x30(%rdi), %r13
addq $0x10, %r13
pushq $0x28
popq %r14
leaq 0x8(%rsp), %r15
movq (%r13), %r13
testq %r13, %r13
je 0x2828
movq 0x38(%rbx), %r12
movq %r14, %rdi
callq 0x21d0
movb 0x8(%r13), %cl
movsd 0x10(%r13), %xmm0
xorps %xmm1, %xmm1
movups %xmm1, 0x10(%rax)
movb %cl, (%rax)
movsd %xmm0, 0x8(%rax)
movb $0x0, 0x20(%rax)
movq %rax, 0x8(%rsp)
movq %r12, %rdi
movq %r15, %rsi
callq 0x2a5e
jmp 0x27e5
pushq $0x28
popq %r14
leaq 0x8(%rsp), %r15
movq 0x38(%rbx), %rdi
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
subq %rax, %rcx
cmpq $0x8, %rcx
je 0x2898
movq (%rax), %r12
callq 0x2a74
movq 0x38(%rbx), %rdi
movq (%rdi), %rax
movq (%rax), %r13
callq 0x2a74
movq %r14, %rdi
callq 0x21d0
movsd 0x8(%r12), %xmm0
addsd 0x8(%r13), %xmm0
movb $0x0, (%rax)
movsd %xmm0, 0x8(%rax)
movb $0x1, 0x20(%rax)
movq %rax, 0x8(%rsp)
movq %r12, 0x10(%rax)
movq %r13, 0x18(%rax)
movq 0x38(%rbx), %rdi
movq %r15, %rsi
callq 0x2a8c
jmp 0x2831
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/huffman-encoder.cpp
// Function: HuffmanEncoder::buildCodewordTable()
void HuffmanEncoder :: buildCodewordTable()
{
	Log(this, "Started...");

	/* --- This code is unlikely to happen unless someone really forgets ---
	 * -- Avoided! Since it will unnecessarily occupy each recursion stack --
	 *
	 * If prerequisites doesn't exist
	if(!m_codewordTable || !m_frequencyTable || !m_huffmanTree)
		throw 10;
	*/

	// Huffman tree parser lambda
	std::function<void(MinHeapNode<byte, double>*, const std::string&)>
		huffmanTreeParser;
	huffmanTreeParser =
			[&](MinHeapNode<byte, double>* root, const std::string &codeword) {
				if(root) {
					if(!root->isInternalNode()) {
						(*m_codewordTable)[root->data] = codeword;
						//@@@ std::cout << root->data << ": " << codeword << std::endl;
					}
					huffmanTreeParser(root->left, codeword + "0");
					huffmanTreeParser(root->right, codeword + "1");
				}
			};

	huffmanTreeParser(m_huffmanTree->top(), "");

	/* Just testing
	for(auto &x : *m_codewordTable)
		std::cout << x.first << " : " << x.second << std::endl;
	*/
}

// Assembly:
pushq %rbx
subq $0x50, %rsp
movq %rdi, %rbx
xorps %xmm0, %xmm0
leaq 0x10(%rsp), %rdi
movaps %xmm0, (%rdi)
leaq 0x30(%rsp), %rax
movq %rbx, (%rax)
movq %rax, 0x8(%rax)
movaps %xmm0, 0x10(%rdi)
leaq 0x15a(%rip), %rcx       # 0x2a2a
movq %rcx, 0x10(%rax)
leaq 0x79(%rip), %rcx        # 0x2954
movq %rcx, 0x18(%rax)
callq 0x2af8
movq 0x38(%rbx), %rax
movq (%rax), %rax
movq (%rax), %rbx
leaq 0x287d(%rip), %rsi      # 0x5172
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x2abc
leaq 0x30(%rsp), %rdi
leaq 0x10(%rsp), %rdx
movq %rbx, %rsi
callq 0x2aa2
leaq 0x10(%rsp), %rdi
callq 0x20f0
leaq 0x30(%rsp), %rdi
callq 0x2af8
addq $0x50, %rsp
popq %rbx
retq
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x20f0
jmp 0x2942
movq %rax, %rbx
leaq 0x30(%rsp), %rdi
callq 0x2af8
movq %rbx, %rdi
callq 0x2310
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/compression-driver.cpp
// Function: CompressionDriver::setCompressor(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&)
void CompressionDriver :: setCompressor(const std::string& algo) {
	// TODO... Find valid compressor and register it
	Log(this, "Started...");

	// --- This code is just for initial testing purpose ---
	// --- Yea it is currently hard-coded kinda ---
	// --- Later we will add separate module for maintaining registered algorithms ---
	if(algo.compare("Huffman-Coding") == 0)
		m_Compressor = new HuffmanCompressor();
	else
		std::cerr << "[Fatal Error] Invalid compression algorithm \"" << algo << "\"" << std::endl;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x1958(%rip), %rsi      # 0x5129
movq %r14, %rdi
callq 0x20a0
testl %eax, %eax
je 0x3819
movq 0x580c(%rip), %rdi      # 0x8ff0
leaq 0x194d(%rip), %rsi      # 0x5138
callq 0x21c0
movq %rax, %rdi
movq %r14, %rsi
callq 0x21a0
leaq 0x19cd(%rip), %rsi      # 0x51cf
movq %rax, %rdi
callq 0x21c0
movq %rax, %rdi
addq $0x8, %rsp
popq %rbx
popq %r14
jmp 0x2100
pushq $0x50
popq %rdi
callq 0x21d0
movq %rax, %r14
movq %rax, %rdi
callq 0x3df6
movq %r14, 0x38(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
movq %rax, %rbx
pushq $0x50
popq %rsi
movq %r14, %rdi
callq 0x21e0
movq %rbx, %rdi
callq 0x2310
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/compression-driver.cpp
// Function: CompressionDriver::getCompressorName[abi:cxx11]() const
std::string CompressionDriver :: getCompressorName() const {
	Log(this, "Started...");
	if(!m_Compressor) {
		Log(this, "[Fatal Error] Unable to get compression name.");
		return "";
	}

	return m_Compressor->name();
}

// Assembly:
pushq %rbx
subq $0x10, %rsp
movq %rdi, %rbx
movq 0x38(%rsi), %rsi
testq %rsi, %rsi
je 0x386d
addq $0x20, %rsi
movq %rbx, %rdi
callq 0x2280
jmp 0x3881
leaq 0x18fe(%rip), %rsi      # 0x5172
leaq 0xf(%rsp), %rdx
movq %rbx, %rdi
callq 0x2abc
movq %rbx, %rax
addq $0x10, %rsp
popq %rbx
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/compression-driver.cpp
// Function: getFileSize(std::basic_fstream<char, std::char_traits<char>>&)
static inline fsize_t getFileSize(std::fstream& f) {
	Log_static("Started...");

	if(!f.is_open())
		return -1;
	f.seekg(0, f.end);
	fsize_t file_size = f.tellg(); // This may also return -1
	f.seekg(0, f.beg);
	return file_size;
}

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
addq $0x80, %rdi
callq 0x2080
testb %al, %al
je 0x3b00
pushq $0x2
popq %rdx
movq %rbx, %rdi
xorl %esi, %esi
callq 0x2260
movq %rbx, %rdi
callq 0x2300
movq %rax, %r14
movq %rbx, %rdi
xorl %esi, %esi
xorl %edx, %edx
callq 0x2260
jmp 0x3b04
pushq $-0x1
popq %r14
movq %r14, %rax
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/header.cpp
// Function: build_header(HeaderStruct*, std::unordered_map<unsigned char, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, std::hash<unsigned char>, std::equal_to<unsigned char>, std::allocator<std::pair<unsigned char const, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>>>&)
void build_header(HeaderStruct *hdr, CodewordTable &cw_table) {
    Log_static("Started...");
    if(!hdr)
        return;

    memset(hdr, 0, sizeof(*hdr));

    hdr->nSyms = cw_table.size();
    hdr->cw_table = new HeaderStruct::codeword_table[hdr->nSyms];

    // Migrate the CodewordTable contents to codeword_table contents
    int i = 0;
    for(auto &x : cw_table) {
        hdr->cw_table[i].symbol = x.first;
        hdr->cw_table[i].codeword = str2bits(x.second);
        hdr->cw_table[i].nBits = x.second.length();
        ++i;
    }
}

// Assembly:
testq %rdi, %rdi
je 0x426d
pushq %rbp
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
xorps %xmm0, %xmm0
movups %xmm0, 0x10(%rdi)
movups %xmm0, (%rdi)
andq $0x0, 0x20(%rdi)
movq 0x18(%rsi), %rax
movzbl %al, %eax
movb %al, 0x18(%rdi)
leaq (%rax,%rax,2), %rdi
callq 0x2030
movq %rax, 0x20(%r14)
addq $0x10, %rbx
xorl %edx, %edx
pushq $0x1
popq %rsi
movq (%rbx), %rbx
testq %rbx, %rbx
je 0x4269
movb 0x8(%rbx), %cl
leaq (%rdx,%rdx,2), %rdi
movb %cl, (%rax,%rdi)
movq 0x10(%rbx), %r9
movq 0x18(%rbx), %r8
leal -0x1(%r8), %ecx
xorl %r10d, %r10d
xorl %r11d, %r11d
movzbl %r11b, %r11d
cmpq %r11, %r8
jbe 0x425a
movzbl (%r9,%r11), %ebp
cmpl $0x30, %ebp
je 0x4249
cmpl $0x31, %ebp
jne 0x4253
movl %esi, %ebp
shll %cl, %ebp
orb %bpl, %r10b
jmp 0x4253
movl %esi, %ebp
shll %cl, %ebp
notb %bpl
andb %bpl, %r10b
incb %r11b
decb %cl
jmp 0x4228
movb %r10b, 0x1(%rax,%rdi)
movb %r8b, 0x2(%rax,%rdi)
incq %rdx
jmp 0x4204
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/header.cpp
// Function: get_compressed_size(HeaderStruct*, std::unordered_map<unsigned char, double, std::hash<unsigned char>, std::equal_to<unsigned char>, std::allocator<std::pair<unsigned char const, double>>> const&)
size_t get_compressed_size(HeaderStruct * const hdr, const FrequencyTable &freqsym_map) {
    Log_static("Started...");
    if(!hdr)
        return -1;

    size_t ret;
    double temp1 = 0, temp2 = 0;

    // XXX... Note that this calculates the size in terms of bits.
    // Convert it to bytes before returning.
    for(uint8_t i = 0; i < hdr->nSyms; i++) {
        temp1 = ( (double)freqsym_map.at(hdr->cw_table[i].symbol) * hdr->original_size ) / 100.0; // % to number
        temp2 += (double)hdr->cw_table[i].nBits * temp1;
    }

    temp2 /= 8;
    ret = ceil(temp2);
    return ret;
}

// Assembly:
testq %rdi, %rdi
je 0x4340
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
xorpd %xmm0, %xmm0
xorl %r15d, %r15d
xorl %r12d, %r12d
movzbl 0x18(%r14), %eax
cmpq %rax, %r12
jae 0x4308
movq 0x20(%r14), %rsi
addq %r15, %rsi
movq %rbx, %rdi
movsd %xmm0, (%rsp)
callq 0x44ce
movsd 0x8(%r14), %xmm0
unpcklps 0xf56(%rip), %xmm0      # xmm0 = xmm0[0],mem[0],xmm0[1],mem[1]
subpd 0xf5e(%rip), %xmm0      # 0x5220
movapd %xmm0, %xmm1
unpckhpd %xmm0, %xmm1            # xmm1 = xmm1[1],xmm0[1]
addsd %xmm0, %xmm1
mulsd (%rax), %xmm1
divsd 0xd36(%rip), %xmm1      # 0x5010
movq 0x20(%r14), %rax
movzbl 0x2(%rax,%r15), %eax
cvtsi2sd %eax, %xmm0
mulsd %xmm1, %xmm0
movsd (%rsp), %xmm1
addsd %xmm0, %xmm1
movsd %xmm1, (%rsp)
movsd (%rsp), %xmm0
incq %r12
addq $0x3, %r15
jmp 0x428f
mulsd 0xee8(%rip), %xmm0      # 0x51f8
callq 0x2050
cvttsd2si %xmm0, %rcx
movq %rcx, %rdx
sarq $0x3f, %rdx
subsd 0xed7(%rip), %xmm0      # 0x5200
cvttsd2si %xmm0, %rax
andq %rdx, %rax
orq %rcx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
pushq $-0x1
popq %rax
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/header.cpp
// Function: dump_content(HeaderStruct*, unsigned char*, unsigned long, unsigned char*)
void dump_content(HeaderStruct* header, byte *ibuff, size_t ibuff_size, byte* obuff) {
    Log_static("Started...");
    if(!header || !ibuff || !obuff)
        return; // TODO... Create a NullArgumentException class

    // Push the bits into buff according to
    // the codeword_table in the header.
    HeaderStruct::codeword_table *cw_entry;
    //@ BitStream bit_stream(header->compressed_size); // FIXME... Incorrect argument
    BitVector bit_vector;
    uint32_t i;
    for(i = 0; i < ibuff_size; i++) {
        cw_entry = get_cw_entry(header, ibuff+i);

        try {
            bit_vector.appendByte(cw_entry->codeword, cw_entry->nBits);
        } catch(std::overflow_error *e) {
        	Log_static(e->what());
        	exit(1);
            break;
        }

    }

    ::memcpy(obuff, bit_vector.toCharArray(), bit_vector.getNumberOfBytes());

}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rcx, %rbx
testq %rdi, %rdi
sete %al
testq %rsi, %rsi
sete %cl
orb %al, %cl
testq %rbx, %rbx
sete %al
orb %cl, %al
jne 0x4463
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
leaq 0x8(%rsp), %r13
movq %r13, %rdi
callq 0x4694
xorl %ebp, %ebp
movl %ebp, %ebp
cmpq %r14, %rbp
jae 0x443a
movb (%r15,%rbp), %dl
cmpb %dl, 0x4df3(%rip)       # 0x91d0
jne 0x43e8
movq 0x4e12(%rip), %rax      # 0x91f8
jmp 0x4426
movzbl 0x18(%r12), %ecx
movq 0x20(%r12), %rax
movq %rax, %rdi
xorl %esi, %esi
cmpq %rsi, %rcx
je 0x4418
movb (%rdi), %r8b
movb %r8b, 0x4dc9(%rip)      # 0x91d0
cmpb %dl, %r8b
je 0x4415
incq %rsi
addq $0x3, %rdi
jmp 0x43f8
movq %rsi, %rcx
leaq (%rcx,%rcx,2), %rcx
addq %rcx, %rax
movq %rax, 0x4dd2(%rip)      # 0x91f8
movzbl 0x1(%rax), %esi
movzbl 0x2(%rax), %edx
movq %r13, %rdi
callq 0x4ace
incl %ebp
jmp 0x43cc
leaq 0x8(%rsp), %rdi
callq 0x4b7a
leaq 0x8(%rsp), %r14
movl 0x8(%r14), %edx
subl (%r14), %edx
movq %rbx, %rdi
movq %rax, %rsi
callq 0x2180
movq %r14, %rdi
callq 0x44a2
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
jmp 0x448f
movq %rax, %rbx
cmpl $0x1, %edx
jne 0x448f
movq %rbx, %rdi
callq 0x20d0
pushq $0x1
popq %rdi
callq 0x2200
leaq 0x8(%rsp), %rdi
callq 0x44a2
movq %rbx, %rdi
callq 0x2310
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/main.cpp
// Function: main
int main(int argc, char **argv) {

	cout << " --- Still under construction ---" << endl;
	Log_static("Started...");
	
	try {
		CompressionDriver driver(argc, (const char**)(argv+1));
		driver.setCompressor("Huffman-Coding");
		cout << "Selected algorithm: " << driver.getCompressorName() << endl;
		driver.compressAll();
	}
	catch(exception &e) {
		Log_static(e.what());
		return FATAR_ERROR;
	}

	return SUCCESS;
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
subq $0x70, %rsp
movq %rsi, %rbx
movl %edi, %ebp
movq 0x4aa0(%rip), %rdi      # 0x8fc0
leaq 0xd2b(%rip), %rsi       # 0x5252
callq 0x21c0
movq %rax, %rdi
callq 0x2100
addq $0x8, %rbx
leaq 0x30(%rsp), %rdi
movl %ebp, %esi
movq %rbx, %rdx
callq 0x36c0
leaq 0xbdb(%rip), %rsi       # 0x5129
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x2abc
leaq 0x30(%rsp), %rdi
leaq 0x10(%rsp), %rsi
callq 0x37c0
leaq 0x10(%rsp), %rdi
callq 0x20f0
movq 0x4a43(%rip), %rdi      # 0x8fc0
leaq 0xcf0(%rip), %rsi       # 0x5274
callq 0x21c0
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x384e
leaq 0x10(%rsp), %rsi
movq %rbx, %rdi
callq 0x21a0
movq %rax, %rdi
callq 0x2100
leaq 0x10(%rsp), %rdi
callq 0x20f0
leaq 0x30(%rsp), %rdi
callq 0x3b10
leaq 0x30(%rsp), %rdi
callq 0x4626
xorl %eax, %eax
addq $0x70, %rsp
popq %rbx
popq %r14
popq %rbp
retq
jmp 0x45f9
jmp 0x45e7
jmp 0x45f9
movq %rdx, %r14
movq %rax, %rbx
jmp 0x4609
movq %rdx, %r14
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x20f0
jmp 0x45ff
movq %rdx, %r14
movq %rax, %rbx
leaq 0x30(%rsp), %rdi
callq 0x4626
movq %rbx, %rdi
cmpl $0x1, %r14d
jne 0x4621
callq 0x20d0
callq 0x22d0
pushq $0x2
popq %rax
jmp 0x45d0
callq 0x2310
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::stringToBitVector(char const*)
void BitVector::stringToBitVector(const char *str)
{
    int strSize = strlen(str);
    for (int i = 0; i < strSize; i++)
    {
        if (str[i] == '1')
            appendBit(true);
        else if (str[i] == '0')
            appendBit(false);
        else
            //@ throw cRuntimeError("str must represent a binary number");
            throw (new std::overflow_error("BitVector::stringToBitVector(): str must represent a binary number"));
    }
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movq %rsi, %rdi
callq 0x20e0
movq %rax, %r15
xorl %r12d, %r12d
testl %r15d, %r15d
cmovlel %r12d, %r15d
cmpq %r12, %r15
je 0x474b
movzbl (%rbx,%r12), %ecx
movb $0x1, %al
cmpl $0x31, %ecx
je 0x473b
cmpl $0x30, %ecx
jne 0x4757
xorl %eax, %eax
movzbl %al, %esi
movq %r14, %rdi
callq 0x4804
incq %r12
jmp 0x4723
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
pushq $0x8
popq %rdi
callq 0x2110
movq %rax, %rbx
pushq $0x10
popq %rdi
callq 0x21d0
movq %rax, %r14
leaq 0xb6c(%rip), %rsi       # 0x52e0
movq %rax, %rdi
callq 0x2060
movq %r14, (%rbx)
leaq 0x45ea(%rip), %rsi      # 0x8d70
movq %rbx, %rdi
xorl %edx, %edx
callq 0x22f0
movq %rax, %r15
pushq $0x10
popq %rsi
movq %r14, %rdi
callq 0x21e0
jmp 0x47a3
movq %rax, %r15
movq %rbx, %rdi
callq 0x2160
movq %r15, %rdi
callq 0x2310
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::BitVector(unsigned int)
BitVector::BitVector(unsigned int bits)
{
    size = 0;
    if (bits == 0)
        appendBit(false);
    while (bits > 0)
    {
        appendBit(bits % 2);
        bits /= 2;
    }
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movl %esi, %ebp
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, 0xc(%rdi)
movups %xmm0, (%rdi)
testl %esi, %esi
jne 0x47e6
movq %rbx, %rdi
xorl %esi, %esi
callq 0x4804
jmp 0x47e6
movl %ebp, %esi
andl $0x1, %esi
movq %rbx, %rdi
callq 0x4804
shrl %ebp
testl %ebp, %ebp
jne 0x47d7
popq %rbx
popq %r14
popq %rbp
retq
jmp 0x47f1
movq %rax, %r14
movq %rbx, %rdi
callq 0x44a2
movq %r14, %rdi
callq 0x2310
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::BitVector(unsigned int, unsigned int)
BitVector::BitVector(unsigned int bits, unsigned int size)
{
    this->size = 0;
    if (bits == 0)
        appendBit(false);
    while (bits > 0)
    {
        appendBit(bits % 2);
        bits /= 2;
    }
    if (getSize() < size)
        appendBit(false, size - getSize());
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movl %edx, %ebp
movl %esi, %r14d
movq %rdi, %rbx
xorps %xmm0, %xmm0
movups %xmm0, 0xc(%rdi)
movups %xmm0, (%rdi)
testl %esi, %esi
jne 0x4845
movq %rbx, %rdi
xorl %esi, %esi
callq 0x4804
jmp 0x4845
movl %r14d, %esi
andl $0x1, %esi
movq %rbx, %rdi
callq 0x4804
shrl %r14d
testl %r14d, %r14d
jne 0x4834
subl 0x18(%rbx), %ebp
jbe 0x485b
movq %rbx, %rdi
xorl %esi, %esi
movl %ebp, %edx
callq 0x4876
popq %rbx
popq %r14
popq %rbp
retq
jmp 0x4862
movq %rax, %r14
movq %rbx, %rdi
callq 0x44a2
movq %r14, %rdi
callq 0x2310
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::setBit(int, bool)
void BitVector::setBit(int pos, bool value)
{
    while (containerSize() <= pos)
        bytes.push_back(uint8_t(0));
    if (pos + 1 > size)
        size = pos + 1;
    uint8_t& field = bytes[pos / UINT8_LENGTH];
    if (value)
        field |= 1 << (pos % UINT8_LENGTH);
    else
        field &= ~(1 << (pos % UINT8_LENGTH));
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movl %edx, %ebx
movl %esi, %r14d
movq %rdi, %r15
leaq 0x7(%rsp), %r12
movl 0x8(%r15), %eax
movq (%r15), %rsi
subl %esi, %eax
shll $0x3, %eax
cmpl %r14d, %eax
jg 0x48d2
movb $0x0, 0x7(%rsp)
movq %r15, %rdi
movq %r12, %rsi
callq 0x4d7c
jmp 0x48af
cmpl %r14d, 0x18(%r15)
jg 0x48e0
leal 0x1(%r14), %eax
movl %eax, 0x18(%r15)
pushq $0x8
popq %rcx
movl %r14d, %eax
cltd
idivl %ecx
andb $0x7, %r14b
pushq $0x1
popq %rdx
movl %r14d, %ecx
shll %cl, %edx
cltq
movb (%rsi,%rax), %cl
movl %edx, %edi
notb %dil
andb %cl, %dil
orb %dl, %cl
movzbl %cl, %ecx
movzbl %dil, %edx
testb %bl, %bl
cmovnel %ecx, %edx
movb %dl, (%rsi,%rax)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::toggleBit(int)
void BitVector::toggleBit(int pos)
{
    if (pos >= size)
        throw (new std::overflow_error("BitVector::toggleBit(): Bit out of range."));
        //@ throw cRuntimeError("Out of range with bit position %d", pos);

    uint8_t& field = bytes[pos / UINT8_LENGTH];
    field ^= 1 << (pos % UINT8_LENGTH);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
cmpl %esi, 0x18(%rdi)
jle 0x494b
pushq $0x8
popq %rcx
movl %esi, %eax
cltd
idivl %ecx
cltq
andb $0x7, %sil
pushq $0x1
popq %rdx
movl %esi, %ecx
shll %cl, %edx
movq (%rdi), %rcx
xorb %dl, (%rcx,%rax)
popq %rbx
popq %r14
popq %r15
retq
pushq $0x8
popq %rdi
callq 0x2110
movq %rax, %rbx
pushq $0x10
popq %rdi
callq 0x21d0
movq %rax, %r14
leaq 0x921(%rip), %rsi       # 0x5289
movq %rax, %rdi
callq 0x2060
movq %r14, (%rbx)
leaq 0x43f6(%rip), %rsi      # 0x8d70
movq %rbx, %rdi
xorl %edx, %edx
callq 0x22f0
movq %rax, %r15
pushq $0x10
popq %rsi
movq %r14, %rdi
callq 0x21e0
jmp 0x4997
movq %rax, %r15
movq %rbx, %rdi
callq 0x2160
movq %r15, %rdi
callq 0x2310
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::getBit(int) const
bool BitVector::getBit(int pos) const
{
    if (pos >= size)
        throw (new std::overflow_error("BitVector::getBit(): Bit out of range."));
    uint8_t field = bytes[pos / UINT8_LENGTH];
    return field & (1 << (pos % UINT8_LENGTH));
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
cmpl %esi, 0x18(%rdi)
jle 0x49d2
pushq $0x8
popq %rcx
movl %esi, %eax
cltd
idivl %ecx
cltq
movq (%rdi), %rcx
movzbl (%rcx,%rax), %eax
andl $0x7, %esi
btl %esi, %eax
setb %al
popq %rbx
popq %r14
popq %r15
retq
pushq $0x8
popq %rdi
callq 0x2110
movq %rax, %rbx
pushq $0x10
popq %rdi
callq 0x21d0
movq %rax, %r14
leaq 0x8c4(%rip), %rsi       # 0x52b3
movq %rax, %rdi
callq 0x2060
movq %r14, (%rbx)
leaq 0x436f(%rip), %rsi      # 0x8d70
movq %rbx, %rdi
xorl %edx, %edx
callq 0x22f0
movq %rax, %r15
pushq $0x10
popq %rsi
movq %r14, %rdi
callq 0x21e0
jmp 0x4a1e
movq %rax, %r15
movq %rbx, %rdi
callq 0x2160
movq %r15, %rdi
callq 0x2310
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: operator<<(std::ostream&, BitVector const&)
std::ostream& operator<<(std::ostream& out, const BitVector& bitVector)
{
    if (bitVector.getBit(0))
        out << "1";
    else
        out << "0";
    for (int i = 1; i < bitVector.size; i++)
    {
        if (bitVector.getBit(i))
            out << " 1";
        else
            out << " 0";
    }
    return out;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %r14
movq %rdi, %rbx
movq %rsi, %rdi
xorl %esi, %esi
callq 0x49a8
leaq 0x88e(%rip), %rcx       # 0x52db
leaq 0x88a(%rip), %rsi       # 0x52de
testb %al, %al
cmovneq %rcx, %rsi
movq %rbx, %rdi
callq 0x21c0
pushq $0x1
popq %rbp
leaq 0x86e(%rip), %r15       # 0x52da
leaq 0x86a(%rip), %r12       # 0x52dd
cmpl 0x18(%r14), %ebp
jge 0x4a98
movq %r14, %rdi
movl %ebp, %esi
callq 0x49a8
testb %al, %al
movq %r12, %rsi
cmovneq %r15, %rsi
movq %rbx, %rdi
callq 0x21c0
incl %ebp
jmp 0x4a73
movq %rbx, %rax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::toString[abi:cxx11]() const
std::string BitVector::toString() const
{
    std::string str;
    for (unsigned int i = 0; i < getSize(); i++)
    {
        if (getBit(i))
            str += "1";
        else
            str += "0";
    }
    return str;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %r14
movq %rdi, %rbx
leaq 0x10(%rdi), %rax
movq %rax, (%rdi)
andq $0x0, 0x8(%rdi)
movb $0x0, 0x10(%rdi)
xorl %ebp, %ebp
leaq 0x7ae(%rip), %r15       # 0x52db
leaq 0x7aa(%rip), %r12       # 0x52de
cmpl 0x18(%r14), %ebp
jae 0x4b5a
movq %r14, %rdi
movl %ebp, %esi
callq 0x49a8
movq %r15, %rsi
testb %al, %al
jne 0x4b4e
movq %r12, %rsi
movq %rbx, %rdi
callq 0x2340
incl %ebp
jmp 0x4b34
movq %rbx, %rax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r14
movq %rbx, %rdi
callq 0x20f0
movq %r14, %rdi
callq 0x2310
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::toDecimal() const
unsigned int BitVector::toDecimal() const
{
    unsigned int dec = 0;
    unsigned int powerOfTwo = 1;
    for (unsigned int i = 0; i < getSize(); i++)
    {
        if (getBit(i))
            dec += powerOfTwo;
        powerOfTwo *= 2;
    }
    return dec;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
pushq $0x1
popq %r15
xorl %ebp, %ebp
xorl %r14d, %r14d
cmpl 0x18(%rbx), %r14d
jae 0x4bb7
movq %rbx, %rdi
movl %r14d, %esi
callq 0x49a8
testb %al, %al
movl $0x0, %eax
cmovnel %r15d, %eax
addl %eax, %ebp
addl %r15d, %r15d
incl %r14d
jmp 0x4b91
movl %ebp, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::reverseToDecimal() const
unsigned int BitVector::reverseToDecimal() const
{
    unsigned int dec = 0;
    unsigned int powerOfTwo = 1;
    for (int i = getSize() - 1; i >= 0; i--)
    {
        if (getBit(i))
            dec += powerOfTwo;
        powerOfTwo *= 2;
    }
    return dec;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl 0x18(%rdi), %ebp
decl %ebp
pushq $0x1
popq %r15
xorl %r14d, %r14d
testl %ebp, %ebp
js 0x4bfd
movq %rbx, %rdi
movl %ebp, %esi
callq 0x49a8
testb %al, %al
movl $0x0, %eax
cmovnel %r15d, %eax
addl %eax, %r14d
addl %r15d, %r15d
decl %ebp
jmp 0x4bda
movl %r14d, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/irakr[P]Minimal-File-Compression-Tool/src/utils/BitVector.cpp
// Function: BitVector::copy(BitVector const&)
void BitVector::copy(const BitVector& other)
{
    size = 0;
    bytes.clear();
    for (unsigned int i = 0; i < other.getSize(); i++)
        appendBit(other.getBit(i));
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movq %rdi, %rbx
andl $0x0, 0x18(%rdi)
movq %rsi, %r14
movq (%rdi), %rax
cmpq %rax, 0x8(%rdi)
je 0x4cef
movq %rax, 0x8(%rbx)
xorl %ebp, %ebp
cmpl 0x18(%r14), %ebp
jae 0x4d10
movq %r14, %rdi
movl %ebp, %esi
callq 0x49a8
movzbl %al, %esi
movq %rbx, %rdi
callq 0x4804
incl %ebp
jmp 0x4cf1
popq %rbx
popq %r14
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/iZhangHui[P]CppPrimer/CH04_Expressions/examples/incr.cc
// Function: main
int main() 
{
	int i = 0, j;
	j = ++i; // j = 1, i = 1: prefix yields the incremented value
	cout << i << " " << j << endl;

	j = i++; // j = 1, i = 2: postfix yields the unincremented value
	cout << i << " " << j << endl;

	return 0;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq 0x2e0b(%rip), %r14      # 0x3fd8
pushq $0x1
popq %rbx
movq %r14, %rdi
movl %ebx, %esi
callq 0x1070
leaq 0xe23(%rip), %r15       # 0x2004
movq %rax, %rdi
movq %r15, %rsi
callq 0x1050
movq %rax, %rdi
movl %ebx, %esi
callq 0x1070
movq %rax, %rdi
callq 0x1030
pushq $0x2
popq %rsi
movq %r14, %rdi
callq 0x1070
movq %rax, %rdi
movq %r15, %rsi
callq 0x1050
movq %rax, %rdi
movl %ebx, %esi
callq 0x1070
movq %rax, %rdi
callq 0x1030
xorl %eax, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/Base.cpp
// Function: needleman_wunsch_base::Base::StringToBase(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, std::vector<needleman_wunsch_base::kBase, std::allocator<needleman_wunsch_base::kBase>>*)
void Base::StringToBase(const string &in, vector<kBase> *seq) {
  for ( auto i = in.begin(); i < in.end(); ++i ) {
    if ( *i == 'A' )
      seq->push_back(A);
    else if ( *i == 'C' )
      seq->push_back(C);
    else if ( *i == 'G' )
      seq->push_back(G);
    else if ( *i == 'T' )
      seq->push_back(T);
    else if ( *i == '-' )
      seq->push_back(g);
    else
      seq->push_back(nop);
  }
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
movq (%rsi), %rax
leaq 0x4(%rsp), %r15
movq %rax, %r12
addq 0x8(%r14), %rax
cmpq %rax, %r12
jae 0x2580
movzbl (%r12), %eax
cmpl $0x2d, %eax
je 0x2565
cmpl $0x54, %eax
je 0x253d
cmpl $0x43, %eax
je 0x2551
cmpl $0x47, %eax
je 0x2547
cmpl $0x41, %eax
jne 0x255b
andl $0x0, 0x4(%rsp)
jmp 0x256d
movl $0x3, 0x4(%rsp)
jmp 0x256d
movl $0x2, 0x4(%rsp)
jmp 0x256d
movl $0x1, 0x4(%rsp)
jmp 0x256d
movl $0x6, 0x4(%rsp)
jmp 0x256d
movl $0x4, 0x4(%rsp)
movq %rbx, %rdi
movq %r15, %rsi
callq 0x299a
incq %r12
movq (%r14), %rax
jmp 0x250f
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/Base.cpp
// Function: needleman_wunsch_base::Base::BaseToString(std::vector<needleman_wunsch_base::kBase, std::allocator<needleman_wunsch_base::kBase>> const&, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>*)
void Base::BaseToString(const vector<kBase> &in, string *seq) {
  for ( auto i = in.begin(); i < in.end(); ++i ) {
    if ( *i == A )
      seq->push_back('A');
    else if ( *i == C )
      seq->push_back('C');
    else if ( *i == G )
      seq->push_back('G');
    else if ( *i == T )
      seq->push_back('T');
    else if ( *i == g )
      seq->push_back('-');
    else
      seq->push_back('/');
  }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq (%rsi), %r15
movabsq $0x2d54474341, %r12     # imm = 0x2D54474341
pushq $0x2f
popq %rbp
cmpq 0x8(%r14), %r15
jae 0x2607
movl (%r15), %eax
leal (,%rax,8), %ecx
movq %r12, %rdx
shrq %cl, %rdx
cmpl $0x5, %eax
cmovael %ebp, %edx
movzbl %dl, %esi
movq %rbx, %rdi
callq 0x2150
addq $0x4, %r15
jmp 0x25da
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/BaseAlgorithms.cpp
// Function: needleman_wunsch_basealgorithms::BaseAlgorithms::Alignment(needleman_wunsch_base::Base const&, needleman_wunsch_base::Base const&)
void BaseAlgorithms::Alignment(const Base &inputSequence1, const Base &inputSequence2) {
  // initialize parameter and matrix
  cout << "\n::: Alignment :::" << endl;
  cout << "Initialize phase..." << endl;
  AlignmentInit(inputSequence1, inputSequence2);
  // calculate alignment matrix
  cout << "Calculating alignment score..." << endl;
  CalcAlignmentScore(inputSequence1, inputSequence2);
  //traceback
  cout << "Traceback phase..." << endl;
  Traceback(inputSequence1, inputSequence2);
  // delete variables
  AlignmentCleanUp();
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %rbx
movq 0x3430(%rip), %r12      # 0x5fd0
leaq 0x14e1(%rip), %rsi      # 0x4088
movq %r12, %rdi
callq 0x2180
movq %rax, %rdi
callq 0x20b0
leaq 0x14dd(%rip), %rsi      # 0x409b
movq %r12, %rdi
callq 0x2180
movq %rax, %rdi
callq 0x20b0
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x2c3a
leaq 0x14cc(%rip), %rsi      # 0x40af
movq %r12, %rdi
callq 0x2180
movq %rax, %rdi
callq 0x20b0
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x2d46
leaq 0x14c6(%rip), %rsi      # 0x40ce
movq %r12, %rdi
callq 0x2180
movq %rax, %rdi
callq 0x20b0
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x2dbe
movq %rbx, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
jmp 0x32d6
nop
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/BaseAlgorithms.cpp
// Function: needleman_wunsch_basealgorithms::BaseAlgorithms::AlignmentInit(needleman_wunsch_base::Base const&, needleman_wunsch_base::Base const&)
void BaseAlgorithms::AlignmentInit(const Base &inputSequence1, const Base &inputSequence2) {
  // set penalties and parameters
  kMatch    =   1;
  kMismatch =  -1;
  kGap      =  -1;
  kMatSizeX = inputSequence1.SequenceSize();
  kMatSizeY = inputSequence2.SequenceSize();
  kMatSize  = (kMatSizeX+1) * (kMatSizeY+1);
  scoreMatrix = new Score[ kMatSize ];
  // initialize scoreMatrix
  for ( unsigned int i = 0; i < kMatSize; ++i ) {
    scoreMatrix[i].score = 0;
    scoreMatrix[i].previousX = 0;
    scoreMatrix[i].previousY = 0;
    scoreMatrix[i].XAlignWithGap = -100;
    scoreMatrix[i].YAlignWithGap = -100;
  }
  // boundary conditions
  ComesFrom(0, 0, kOrigin);
  for ( unsigned int x = 1; x <= kMatSizeX; ++x ) {
    Mat(0, x)->score = kMismatch * static_cast<int>(x);
    ComesFrom(0, x, kEdgeTop);
  }
  for ( unsigned int y = 1; y <= kMatSizeY; ++y ) {
    Mat(y, 0)->score = kMismatch * static_cast<int>(y);
    ComesFrom(y, 0, kEdgeLeft);
  }
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
subq $0x10, %rsp
movq %rdx, %r14
movq %rdi, %rbx
movabsq $-0xffffffff, %rax      # imm = 0xFFFFFFFF00000001
movq %rax, 0x18(%rdi)
orl $-0x1, 0x20(%rdi)
movq %rsi, %rdi
callq 0x25ae
movl %eax, 0x24(%rbx)
movq %r14, %rdi
callq 0x25ae
movl %eax, 0x28(%rbx)
movl 0x24(%rbx), %ecx
incl %ecx
incl %eax
imull %ecx, %eax
movl %eax, 0x2c(%rbx)
imulq $0x14, %rax, %r14
movq %r14, %rdi
callq 0x2030
movq %rax, 0x10(%rbx)
xorl %ecx, %ecx
movaps 0x13ba(%rip), %xmm0     # 0x4050
cmpq %rcx, %r14
je 0x2cad
movups %xmm0, (%rax,%rcx)
movl $0xffffff9c, 0x10(%rax,%rcx) # imm = 0xFFFFFF9C
addq $0x14, %rcx
jmp 0x2c96
leaq 0xc(%rsp), %rcx
andl $0x0, (%rcx)
movq %rbx, %rdi
xorl %esi, %esi
xorl %edx, %edx
callq 0x2e8e
pushq $0x1
popq %rbp
leaq 0x8(%rsp), %r14
cmpl 0x24(%rbx), %ebp
ja 0x2cfc
movl 0x1c(%rbx), %eax
imull %ebp, %eax
movq 0x10(%rbx), %rcx
movl %ebp, %edx
imulq $0x14, %rdx, %rdx
movl %eax, (%rcx,%rdx)
movl $0x1, 0x8(%rsp)
movq %rbx, %rdi
xorl %esi, %esi
movl %ebp, %edx
movq %r14, %rcx
callq 0x2e8e
incl %ebp
jmp 0x2cc9
pushq $0x1
popq %rbp
leaq 0x4(%rsp), %r14
cmpl 0x28(%rbx), %ebp
ja 0x2d3d
movl 0x1c(%rbx), %eax
imull %ebp, %eax
movq 0x10(%rbx), %rcx
movl 0x24(%rbx), %edx
incl %edx
imull %ebp, %edx
imulq $0x14, %rdx, %rdx
movl %eax, (%rcx,%rdx)
movl $0x2, 0x4(%rsp)
movq %rbx, %rdi
movl %ebp, %esi
xorl %edx, %edx
movq %r14, %rcx
callq 0x2e8e
incl %ebp
jmp 0x2d04
addq $0x10, %rsp
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/BaseAlgorithms.cpp
// Function: needleman_wunsch_basealgorithms::BaseAlgorithms::CalcAlignmentScore(needleman_wunsch_base::Base const&, needleman_wunsch_base::Base const&)
void BaseAlgorithms::CalcAlignmentScore(const Base &inputSequence1, const Base &inputSequence2) {
  int s;
  for ( unsigned int y = 0; y < kMatSizeY; ++y ) {   // y-axis
    for ( unsigned int x = 0; x < kMatSizeX; ++x ) {   // x-axis
      s = inputSequence1.GetBase(x) == inputSequence2.GetBase(y) ? kMatch : kMismatch;
      Max(y+1, x+1, s);
    }
  }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, (%rsp)
movq %rsi, %r14
movq %rdi, %r15
xorl %r12d, %r12d
cmpl 0x28(%r15), %r12d
jae 0x2dae
leal 0x1(%r12), %ebp
xorl %r13d, %r13d
cmpl 0x24(%r15), %r13d
jae 0x2da9
movq %r14, %rdi
movl %r13d, %esi
callq 0x25a2
movl %eax, %ebx
movq (%rsp), %rdi
movl %r12d, %esi
callq 0x25a2
xorl %ecx, %ecx
cmpl %eax, %ebx
setne %cl
movl 0x18(%r15,%rcx,4), %ecx
incl %r13d
movq %r15, %rdi
movl %ebp, %esi
movl %r13d, %edx
callq 0x2f38
jmp 0x2d6c
movl %ebp, %r12d
jmp 0x2d5e
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/BaseAlgorithms.cpp
// Function: needleman_wunsch_basealgorithms::BaseAlgorithms::Traceback(needleman_wunsch_base::Base const&, needleman_wunsch_base::Base const&)
void BaseAlgorithms::Traceback(const Base &inputSequence1, const Base &inputSequence2) {
  cout << "Start tracebacking from mat["<< kMatSizeY << "," << kMatSizeX << "]:" << endl;
  clock_t start, end;
  start = clock();
  TracebackRecursive(kMatSizeY, kMatSizeX, inputSequence1, inputSequence2);
  end = clock();
  cout << "time(ms): " << (end - start)*1000./CLOCKS_PER_SEC << endl;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
movq 0x31f9(%rip), %rbx      # 0x5fd0
leaq 0x1303(%rip), %rsi      # 0x40e1
movq %rbx, %rdi
callq 0x2180
movl 0x28(%r12), %esi
movq %rax, %rdi
callq 0x2100
leaq 0x1304(%rip), %rsi      # 0x40fe
movq %rax, %rdi
callq 0x2180
movl 0x24(%r12), %esi
movq %rax, %rdi
callq 0x2100
leaq 0x12ea(%rip), %rsi      # 0x4100
movq %rax, %rdi
callq 0x2180
movq %rax, %rdi
callq 0x20b0
callq 0x20f0
movq %rax, %r13
movl 0x24(%r12), %edx
movl 0x28(%r12), %esi
movq %r12, %rdi
movq %r15, %rcx
movq %r14, %r8
callq 0x2fe8
callq 0x20f0
movq %rax, %r14
leaq 0x12ae(%rip), %rsi      # 0x4103
movq %rbx, %rdi
callq 0x2180
subq %r13, %r14
cvtsi2sd %r14, %xmm0
mulsd 0x11f3(%rip), %xmm0     # 0x4060
divsd 0x11f3(%rip), %xmm0     # 0x4068
movq %rax, %rdi
callq 0x2220
movq %rax, %rdi
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x20b0
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/BaseAlgorithms.cpp
// Function: needleman_wunsch_basealgorithms::BaseAlgorithms::ComesFrom(int, int, needleman_wunsch_basealgorithms::BaseAlgorithms::Direction const&)
void BaseAlgorithms::ComesFrom(const int y, const int x, const Direction &direction) {
  switch (direction) {
    case kEdgeTop:
      SetParameters(y, x, x-1,   y, 0, 1); break;
    case kEdgeLeft:
      SetParameters(y, x,   x, y-1, 1, 0); break;
    case kUpperLeft:
      SetParameters(y, x, x-1, y-1, 0, 0); break;
    case kAbove:
      SetParameters(y, x,   x, y-1, 1, 0); break;
    case kLeft:
      SetParameters(y, x, x-1,   y, 0, 1); break;
    case kOrigin:
      SetParameters(y, x,   0,   0, 0, 0); break;
  }
}

// Assembly:
movl (%rcx), %eax
cmpq $0x5, %rax
ja 0x2f12
leaq 0x11d3(%rip), %rcx      # 0x4070
movslq (%rcx,%rax,4), %rax
addq %rcx, %rax
jmpq *%rax
movq 0x10(%rdi), %rax
movl 0x24(%rdi), %ecx
incl %ecx
imull %esi, %ecx
addl %edx, %ecx
decl %edx
imulq $0x14, %rcx, %rcx
movl %edx, 0x4(%rax,%rcx)
movl %esi, 0x8(%rax,%rcx)
movabsq $0x100000000, %rdx      # imm = 0x100000000
movq %rdx, 0xc(%rax,%rcx)
retq
movq 0x10(%rdi), %rax
movl 0x24(%rdi), %ecx
incl %ecx
imull %esi, %ecx
decl %esi
addl %edx, %ecx
imulq $0x14, %rcx, %rcx
movl %edx, 0x4(%rax,%rcx)
movl %esi, 0x8(%rax,%rcx)
movq $0x1, 0xc(%rax,%rcx)
retq
movq 0x10(%rdi), %rax
movl 0x24(%rdi), %ecx
incl %ecx
imull %esi, %ecx
addl %edx, %ecx
imulq $0x14, %rcx, %rcx
xorps %xmm0, %xmm0
movups %xmm0, 0x4(%rax,%rcx)
retq
movq 0x10(%rdi), %rax
movl 0x24(%rdi), %ecx
incl %ecx
imull %esi, %ecx
decl %esi
addl %edx, %ecx
decl %edx
imulq $0x14, %rcx, %rcx
movl %edx, 0x4(%rax,%rcx)
movl %esi, 0x8(%rax,%rcx)
andq $0x0, 0xc(%rax,%rcx)
retq
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/BaseAlgorithms.cpp
// Function: needleman_wunsch_basealgorithms::BaseAlgorithms::Max(int, int, int)
int BaseAlgorithms::Max(const int y, const int x, const int s) {
  // calculate score
  const int up   = Mat(y-1,   x)->score + kGap;
  const int left = Mat(  y, x-1)->score + kGap;
  const int mid  = Mat(y-1, x-1)->score + s;
  const int maxScore = max(up, max(mid, left));
  Mat(y, x)->score = maxScore;
  // --- for trace back ---
  if ( maxScore == mid ) {
    ComesFrom(y, x, kUpperLeft);    // from upper left
    return 0;
  } else if ( maxScore == up ) {
    ComesFrom(y, x, kAbove);        // from above
    return 0;
  } else if ( maxScore == left ) {
    ComesFrom(y, x, kLeft);         // from left
    return 0;
  }
  return -1;
}

// Assembly:
pushq %rbx
subq $0x10, %rsp
leal -0x1(%rsi), %r11d
movq 0x10(%rdi), %rax
movl 0x24(%rdi), %r9d
incl %r9d
imull %r9d, %r11d
leal (%r11,%rdx), %r8d
imulq $0x14, %r8, %r10
movl 0x20(%rdi), %r8d
movl (%rax,%r10), %r10d
addl %r8d, %r10d
imull %esi, %r9d
leal (%r9,%rdx), %ebx
decl %ebx
imulq $0x14, %rbx, %rbx
addl (%rax,%rbx), %r8d
addl %edx, %r11d
decl %r11d
imulq $0x14, %r11, %r11
addl (%rax,%r11), %ecx
cmpl %r8d, %ecx
movl %r8d, %ebx
cmovgl %ecx, %ebx
cmpl %ebx, %r10d
movl %ebx, %r11d
cmovgl %r10d, %r11d
addl %edx, %r9d
imulq $0x14, %r9, %r9
movl %r11d, (%rax,%r9)
cmpl %ecx, %r11d
jne 0x2fb3
leaq 0xc(%rsp), %rcx
movl $0x3, (%rcx)
jmp 0x2fd5
cmpl %ebx, %r10d
jge 0x2fca
cmpl %r8d, %r11d
jne 0x2fe2
leaq 0x4(%rsp), %rcx
movl $0x5, (%rcx)
jmp 0x2fd5
leaq 0x8(%rsp), %rcx
movl $0x4, (%rcx)
callq 0x2e8e
xorl %eax, %eax
addq $0x10, %rsp
popq %rbx
retq
pushq $-0x1
popq %rax
jmp 0x2fdc
nop
// File: /workspace/github_cpp_makefile_star2_O2/kmiya[P]Needleman-Wunsch/src/BaseAlgorithms.cpp
// Function: needleman_wunsch_basealgorithms::BaseAlgorithms::TracebackRecursive(int, int, needleman_wunsch_base::Base const&, needleman_wunsch_base::Base const&)
void BaseAlgorithms::TracebackRecursive(const int y, const int x,
                                        const Base &inputSequence1, const Base &inputSequence2) {
  cout << "(" << y << "," << x << ")->";
  if ( !y && !x ) {
    cout << "Tracebacking end.\n\n";
    return;
  }
  TracebackRecursive(Mat(y, x)->previousY, Mat(y, x)->previousX,
                     inputSequence1, inputSequence2);
  // insert gaps
  if ( Mat(y, x)->XAlignWithGap ) {
    resultX->SetBase(g);
    if ( !y ) { // first string
      resultY->SetBase(inputSequence2.GetBase(y));
    } else {
      resultY->SetBase(inputSequence2.GetBase(y-1));
    }
  } else if ( Mat(y, x)->YAlignWithGap ) {
    if ( !x ) { // first string
      resultX->SetBase(inputSequence1.GetBase(x));
    } else {
      resultX->SetBase(inputSequence1.GetBase(x-1));
    }
    resultY->SetBase(g);
  } else { // if bases matched
    resultX->SetBase(inputSequence1.GetBase(x-1));
    resultY->SetBase(inputSequence2.GetBase(y-1));
  }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %r8, %rbx
movq %rcx, %r12
movl %edx, %r15d
movl %esi, %ebp
movq %rdi, %r14
movq 0x2fc8(%rip), %rdi      # 0x5fd0
leaq 0x10ff(%rip), %rsi      # 0x410e
callq 0x2180
movq %rax, %rdi
movl %ebp, %esi
callq 0x2250
leaq 0x10d9(%rip), %rsi      # 0x40fe
movq %rax, %rdi
callq 0x2180
movq %rax, %rdi
movl %r15d, %esi
callq 0x2250
leaq 0x10d1(%rip), %rsi      # 0x4110
movq %rax, %rdi
callq 0x2180
movl %r15d, %eax
orl %ebp, %eax
je 0x30ad
movq 0x10(%r14), %rax
movl 0x24(%r14), %ecx
incl %ecx
imull %ebp, %ecx
addl %r15d, %ecx
imulq $0x14, %rcx, %rcx
movl 0x4(%rax,%rcx), %edx
movl 0x8(%rax,%rcx), %esi
movq %r14, %rdi
movq %r12, %rcx
movq %rbx, %r8
callq 0x2fe8
movq 0x10(%r14), %rax
movl 0x24(%r14), %ecx
incl %ecx
imull %ebp, %ecx
addl %r15d, %ecx
imulq $0x14, %rcx, %rcx
cmpl $0x0, 0xc(%rax,%rcx)
je 0x30ce
movq (%r14), %rdi
pushq $0x4
popq %rsi
callq 0x258c
movq 0x8(%r14), %r14
testl %ebp, %ebp
jne 0x311e
movq %rbx, %rdi
xorl %esi, %esi
jmp 0x3125
movq 0x2f1c(%rip), %rdi      # 0x5fd0
leaq 0x1059(%rip), %rsi      # 0x4114
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x2180
addq %rcx, %rax
cmpl $0x0, 0x10(%rax)
movq (%r14), %r13
je 0x3102
xorl %eax, %eax
subl $0x1, %r15d
cmovbl %eax, %r15d
movq %r12, %rdi
movl %r15d, %esi
callq 0x25a2
movq %r13, %rdi
movl %eax, %esi
callq 0x258c
movq 0x8(%r14), %rdi
pushq $0x4
popq %rsi
jmp 0x312f
decl %r15d
movq %r12, %rdi
movl %r15d, %esi
callq 0x25a2
movq %r13, %rdi
movl %eax, %esi
callq 0x258c
movq 0x8(%r14), %r14
decl %ebp
movq %rbx, %rdi
movl %ebp, %esi
callq 0x25a2
movq %r14, %rdi
movl %eax, %esi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x258c