name string | code string | asm string | file string |
|---|---|---|---|
LinkInfo::fillLinkInfo(std::vector<unsigned char, std::allocator<unsigned char>>) | void LinkInfo::fillLinkInfo(std::vector<unsigned char> linkInfo) {
auto it = linkInfo.begin();
/* mandatory fields */
copy(it, it + 4, std::back_inserter(LinkInfoSize)); // 4 byte
it = it + 4;
copy(it, it + 4, std::back_inserter(LinkInfoHeaderSize)); // 4 byt... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xc8, %rsp
movq %rdi, %rbx
movq (%rsi), %rbp
leaq 0x4(%rbp), %r15
movq %rbp, %rdi
movq %r15, %rsi
movq %rbx, %rdx
callq 0xff00
leaq 0x8(%rbp), %r12
leaq 0x18(%rbx), %r13
movq %r15, %rdi
movq %r12, %rsi
movq %r13, %rdx
callq 0xff00
movq 0x18(%rbx), ... | /aasmirnova7[P]lnk_parser/source/lnkStructure/LinkInfo.cpp |
StringData::printStringDataUtil(StringData::StringDataStruct) | void StringData::printStringDataUtil(StringDataStruct sdStruct) {
int len = Utils::lenTwoBytes(sdStruct.CountCharacters);
cout << " CountCharacters: " << dec << len << " Unicode characters, "
<< dec << len * 2 << " bytes. " << endl;
cout << " String: ";
... | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rsp, %r14
movq %r14, %rdi
callq 0xfe80
movq %r14, %rdi
callq 0x12af8
movl %eax, %ebp
movq (%rsp), %rdi
testq %rdi, %rdi
je 0x19400
movq 0x10(%rsp), %rsi
subq %rdi, %rsi
callq 0x21e0
movq 0xa6bc9(%rip), %r14 # 0xbffd0
leaq 0x4fba2(%ri... | /aasmirnova7[P]lnk_parser/source/lnkStructure/StringData.cpp |
ExtraData::parseFullScreen() | void ExtraData::parseFullScreen() {
if (Utils::lenFourBytes(CONSOLE_PROPS.FullScreen) > 0x00000000)
cout << "Full-screen mode is on." << endl;
else
cout << "Full-screen mode is off." << endl;
} | pushq %rbx
subq $0x20, %rsp
leaq 0x198(%rdi), %rsi
leaq 0x8(%rsp), %rbx
movq %rbx, %rdi
callq 0xfe80
movq %rbx, %rdi
callq 0x12a14
movl %eax, %ebx
movq 0x8(%rsp), %rdi
testq %rdi, %rdi
je 0x1dec4
movq 0x18(%rsp), %rsi
subq %rdi, %rsi
callq 0x21e0
movq 0xa2105(%rip), %rdi # 0xbffd0
testl %ebx, %ebx
je 0x1dedd
leaq 0... | /aasmirnova7[P]lnk_parser/source/lnkStructure/ExtraData.cpp |
ExtraData::parseCodePageStream(ExtraData::PropertyStorePropsStruct::StringOrIntegerName::TypedPropertyValue, int) | int ExtraData::parseCodePageStream(ExtraData::PropertyStorePropsStruct::StringOrIntegerName::TypedPropertyValue value, int from) {
cout << Utils::defaultOffsetDocInfo << "MUST be a CodePageString." << endl;
cout << " Value: " << endl;
cout << " CodePageString: ... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movl %edx, %r13d
movq %rsi, %rbx
leaq 0xa1fe1(%rip), %r14 # 0xc0228
movq (%r14), %rsi
movq 0x8(%r14), %rdx
movq 0xa1d7b(%rip), %r15 # 0xbffd0
movq %r15, %rdi
callq 0x2220
movq %rax, %r12
leaq 0x4b695(%rip), %rsi # 0x698fc
mov... | /aasmirnova7[P]lnk_parser/source/lnkStructure/ExtraData.cpp |
ExtraData::getArrayHeader(std::vector<unsigned int, std::allocator<unsigned int>>) | int ExtraData::getArrayHeader(std::vector<unsigned int> val) {
cout << " ArrayHeader: " << endl;
cout << " Type: "; Utils::print_vec_from_to(val, 0, 4);
cout << Utils::defaultOffsetDocInfo << "MUST be set to the value obtained by clearing " <<
U... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x138, %rsp # imm = 0x138
movq %rsi, %r12
movq %rdi, %r14
movq 0xa1832(%rip), %r15 # 0xbffd0
leaq 0x4b517(%rip), %rsi # 0x69cbc
movl $0x24, %edx
movq %r15, %rdi
callq 0x2220
movq (%r15), %rax
movq -0x18(%rax), %rdi
addq %r15, %rd... | /aasmirnova7[P]lnk_parser/source/lnkStructure/ExtraData.cpp |
ExtraData::parseColorTableUtils(int) | void ExtraData::parseColorTableUtils(int posStart) {
cout << Utils::defaultOffset << CONSOLE_PROPS.ColorTable[posStart] << " " << CONSOLE_PROPS.ColorTable[posStart + 1] << " " <<
CONSOLE_PROPS.ColorTable[posStart + 2] << " " << CONSOLE_PROPS.ColorTable[posStart + 3] << endl;
} | pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movl %esi, %ebp
movq %rdi, %rbx
leaq 0x9a400(%rip), %rax # 0xc0208
movq (%rax), %rsi
movq 0x8(%rax), %rdx
movq 0x9a1ba(%rip), %rdi # 0xbffd0
callq 0x2220
movslq %ebp, %r12
movq 0x240(%rbx), %rcx
movl (%rcx,%r12,4), %esi
movq %rax, %rdi
callq 0x2130
movq %ra... | /aasmirnova7[P]lnk_parser/source/lnkStructure/ExtraData.cpp |
ExtraData::printExtraData() | void ExtraData::printExtraData() {
cout << "_______________________ExtraData_________________________" << endl;
if (consolePropsIsSet) {
/* CONSOLE_PROPS struct*/
cout << "CONSOLE_PROP: " << endl;
cout << " BlockSize: " << dec << Utils::lenFourBytes(CONSOLE_PROPS... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x678, %rsp # imm = 0x678
movq %rdi, %r13
movq 0x99f91(%rip), %rbx # 0xbffd0
leaq 0x4736b(%rip), %rsi # 0x6d3b1
movl $0x39, %edx
movq %rbx, %rdi
callq 0x2220
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %es... | /aasmirnova7[P]lnk_parser/source/lnkStructure/ExtraData.cpp |
DestListHeader::printDestListHeaderInHexStyle() | void DestListHeader::printDestListHeaderInHexStyle() {
cout << "_____________DestListHeader in HEX style________________" << endl;
cout << "Version: "; Utils::print_vec(Version);
cout << "TotalNumberOfCurrentEntries: "; Utils::print_vec(TotalNumberOfCurrentEntries);
cou... | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x98, %rsp
movq %rdi, %rbx
movq 0x91c1a(%rip), %r14 # 0xbffd0
leaq 0x401bf(%rip), %rsi # 0x6e57c
movl $0x38, %edx
movq %r14, %rdi
callq 0x2220
movq (%r14), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x21c0
movsbl %al, %esi
movq %r14, %rdi
... | /aasmirnova7[P]lnk_parser/source/jumpListStructure/DestListHeader.cpp |
DestListHeader::printDestListHeader() | void DestListHeader::printDestListHeader() {
cout << "____________________DestListHeader______________________" << endl;
cout << "Version: " << dec<< Utils::lenFourBytes(Version) << endl;
cout << Utils::defaultOffsetDocInfo << "1 - for Windows 7" << endl;
cout << Utils... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x90, %rsp
movq %rdi, %rbx
movq 0x91944(%rip), %r14 # 0xbffd0
leaq 0x40000(%rip), %rsi # 0x6e693
movl $0x38, %edx
movq %r14, %rdi
callq 0x2220
movq (%r14), %rax
movq -0x18(%rax), %rdi
addq %r14, %rdi
movl $0xa, %esi
callq 0x21c0
movsbl %al, %esi
movq ... | /aasmirnova7[P]lnk_parser/source/jumpListStructure/DestListHeader.cpp |
DestListEntryArray::printDestListEntryArray() | void DestListEntryArray::printDestListEntryArray() {
cout << "_______________________DestList__________________________" << endl;
for(int i = 0; i < destListEntryArray.size(); ++i) {
cout << "DestListEntry " << dec << i + 1 << endl;
cout << " Checksum: "; Utils::print_ve... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x168, %rsp # imm = 0x168
movq %rdi, %r14
movq 0x90641(%rip), %rbx # 0xbffd0
leaq 0x3eff4(%rip), %rsi # 0x6e98a
movl $0x39, %edx
movq %rbx, %rdi
callq 0x2220
movq (%rbx), %rax
movq -0x18(%rax), %rdi
addq %rbx, %rdi
movl $0xa, %es... | /aasmirnova7[P]lnk_parser/source/jumpListStructure/DestListEntryArray.cpp |
void funnelsort_Kway<64u, buffer_layout_bfs>(unsigned char**, unsigned long) | void funnelsort_Kway(unsigned char** strings, size_t n)
{
unsigned char** tmp = static_cast<unsigned char**>(
malloc(n*sizeof(unsigned char*)));
funnelsort<K, BufferLayout>(strings, n, tmp);
free(tmp);
} | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xa488, %rsp # imm = 0xA488
movq %rsi, %r15
movq %rdi, %r14
leaq (,%rsi,8), %r13
movq %r13, %rdi
callq 0x1c3f0
movq %rax, %r12
movq 0x17081a(%rip), %rsi # 0x19a498
movq 0x17081b(%rip), %rdx # 0x19a4a0
movq 0x170364(%rip), %rdi # ... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<8u, 6u, buffer_layout_bfs>::operator()(std::array<Stream, 8ul>&, unsigned char**, std::array<unsigned long, 8ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x16d34e(%rip), %r12 # 0x19a498
movq 0x16d347(%rip), %rsi # 0x19a498
movq 0x16d348(%rip), %rdx # 0x19a4a0
movq 0x16ce91(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<16u, 8u, buffer_layout_bfs>::operator()(std::array<Stream, 16ul>&, unsigned char**, std::array<unsigned long, 16ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x16ac92(%rip), %r12 # 0x19a498
movq 0x16ac8b(%rip), %rsi # 0x19a498
movq 0x16ac8c(%rip), %rdx # 0x19a4a0
movq 0x16a7d5(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<16u, 12u, buffer_layout_bfs>::operator()(std::array<Stream, 16ul>&, unsigned char**, std::array<unsigned long, 16ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x168226(%rip), %r12 # 0x19a498
movq 0x16821f(%rip), %rsi # 0x19a498
movq 0x168220(%rip), %rdx # 0x19a4a0
movq 0x167d69(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<16u, 14u, buffer_layout_bfs>::operator()(std::array<Stream, 16ul>&, unsigned char**, std::array<unsigned long, 16ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x1671d2(%rip), %r12 # 0x19a498
movq 0x1671cb(%rip), %rsi # 0x19a498
movq 0x1671cc(%rip), %rdx # 0x19a4a0
movq 0x166d15(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<32u, 8u, buffer_layout_bfs>::operator()(std::array<Stream, 32ul>&, unsigned char**, std::array<unsigned long, 32ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %rbp
movq %rsi, 0x28(%rsp)
leaq 0x164a16(%rip), %r14 # 0x19a498
movq 0x164a0f(%rip), %rsi # 0x19a498
movq 0x164a10(%rip), %rdx # 0x19a4a0
movq 0x164559(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<32u, 16u, buffer_layout_bfs>::operator()(std::array<Stream, 32ul>&, unsigned char**, std::array<unsigned long, 32ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x163e16(%rip), %r12 # 0x19a498
movq 0x163e0f(%rip), %rsi # 0x19a498
movq 0x163e10(%rip), %rdx # 0x19a4a0
movq 0x163959(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<32u, 18u, buffer_layout_bfs>::operator()(std::array<Stream, 32ul>&, unsigned char**, std::array<unsigned long, 32ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x162eb0(%rip), %r12 # 0x19a498
movq 0x162ea9(%rip), %rsi # 0x19a498
movq 0x162eaa(%rip), %rdx # 0x19a4a0
movq 0x1629f3(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<32u, 10u, buffer_layout_bfs>::operator()(std::array<Stream, 32ul>&, unsigned char**, std::array<unsigned long, 32ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %rbp
movq %rsi, 0x28(%rsp)
leaq 0x161f44(%rip), %r14 # 0x19a498
movq 0x161f3d(%rip), %rsi # 0x19a498
movq 0x161f3e(%rip), %rdx # 0x19a4a0
movq 0x161a87(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 72u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x133438(%rip), %r12 # 0x19a498
movq 0x133431(%rip), %rsi # 0x19a498
movq 0x133432(%rip), %rdx # 0x19a4a0
movq 0x132f7b(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 75u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x131b84(%rip), %r12 # 0x19a498
movq 0x131b7d(%rip), %rsi # 0x19a498
movq 0x131b7e(%rip), %rdx # 0x19a4a0
movq 0x1316c7(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 43u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %rbp
movq %rsi, 0x28(%rsp)
leaq 0x129b36(%rip), %r14 # 0x19a498
movq 0x129b2f(%rip), %rsi # 0x19a498
movq 0x129b30(%rip), %rdx # 0x19a4a0
movq 0x129679(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 87u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x127c7c(%rip), %r12 # 0x19a498
movq 0x127c75(%rip), %rsi # 0x19a498
movq 0x127c76(%rip), %rdx # 0x19a4a0
movq 0x1277bf(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 44u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %rbp
movq %rsi, 0x28(%rsp)
leaq 0x126824(%rip), %r14 # 0x19a498
movq 0x12681d(%rip), %rsi # 0x19a498
movq 0x12681e(%rip), %rdx # 0x19a4a0
movq 0x126367(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 46u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %rbp
movq %rsi, 0x28(%rsp)
leaq 0x123b28(%rip), %r14 # 0x19a498
movq 0x123b21(%rip), %rsi # 0x19a498
movq 0x123b22(%rip), %rdx # 0x19a4a0
movq 0x12366b(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 98u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x11cdc0(%rip), %r12 # 0x19a498
movq 0x11cdb9(%rip), %rsi # 0x19a498
movq 0x11cdba(%rip), %rdx # 0x19a4a0
movq 0x11c903(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 99u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x11c584(%rip), %r12 # 0x19a498
movq 0x11c57d(%rip), %rsi # 0x19a498
movq 0x11c57e(%rip), %rdx # 0x19a4a0
movq 0x11c0c7(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 102u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x11a0c4(%rip), %r12 # 0x19a498
movq 0x11a0bd(%rip), %rsi # 0x19a498
movq 0x11a0be(%rip), %rdx # 0x19a4a0
movq 0x119c07(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 104u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x117824(%rip), %r12 # 0x19a498
movq 0x11781d(%rip), %rsi # 0x19a498
movq 0x11781e(%rip), %rdx # 0x19a4a0
movq 0x117367(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 112u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x110618(%rip), %r12 # 0x19a498
movq 0x110611(%rip), %rsi # 0x19a498
movq 0x110612(%rip), %rdx # 0x19a4a0
movq 0x11015b(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 59u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %rbp
movq %rsi, 0x28(%rsp)
leaq 0x10df22(%rip), %r14 # 0x19a498
movq 0x10df1b(%rip), %rsi # 0x19a498
movq 0x10df1c(%rip), %rdx # 0x19a4a0
movq 0x10da65(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 118u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x10c8a4(%rip), %r12 # 0x19a498
movq 0x10c89d(%rip), %rsi # 0x19a498
movq 0x10c89e(%rip), %rdx # 0x19a4a0
movq 0x10c3e7(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 119u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x10c068(%rip), %r12 # 0x19a498
movq 0x10c061(%rip), %rsi # 0x19a498
movq 0x10c062(%rip), %rdx # 0x19a4a0
movq 0x10bbab(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 125u, buffer_layout_bfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x106acc(%rip), %r12 # 0x19a498
movq 0x106ac5(%rip), %rsi # 0x19a498
movq 0x106ac6(%rip), %rdx # 0x19a4a0
movq 0x10660f(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<8u, 4u, buffer_layout_dfs>::operator()(std::array<Stream, 8ul>&, unsigned char**, std::array<unsigned long, 8ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0x104672(%rip), %r12 # 0x19a498
movq 0x10466b(%rip), %rsi # 0x19a498
movq 0x10466c(%rip), %rdx # 0x19a4a0
movq 0x1041b5(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<16u, 3u, buffer_layout_dfs>::operator()(std::array<Stream, 16ul>&, unsigned char**, std::array<unsigned long, 16ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0x10221a(%rip), %r15 # 0x19a498
movq 0x102213(%rip), %rsi # 0x19a498
movq 0x102214(%rip), %rdx # 0x19a4a0
movq 0x101d5d(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<16u, 11u, buffer_layout_dfs>::operator()(std::array<Stream, 16ul>&, unsigned char**, std::array<unsigned long, 16ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xff98a(%rip), %r12 # 0x19a498
movq 0xff983(%rip), %rsi # 0x19a498
movq 0xff984(%rip), %rdx # 0x19a4a0
movq 0xff4cd(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<32u, 10u, buffer_layout_dfs>::operator()(std::array<Stream, 32ul>&, unsigned char**, std::array<unsigned long, 32ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xf833e(%rip), %r15 # 0x19a498
movq 0xf8337(%rip), %rsi # 0x19a498
movq 0xf8338(%rip), %rdx # 0x19a4a0
movq 0xf7e81(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<32u, 26u, buffer_layout_dfs>::operator()(std::array<Stream, 32ul>&, unsigned char**, std::array<unsigned long, 32ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xf2e32(%rip), %r12 # 0x19a498
movq 0xf2e2b(%rip), %rsi # 0x19a498
movq 0xf2e2c(%rip), %rdx # 0x19a4a0
movq 0xf2975(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 33u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xeb9d6(%rip), %r12 # 0x19a498
movq 0xeb9cf(%rip), %rsi # 0x19a498
movq 0xeb9d0(%rip), %rdx # 0x19a4a0
movq 0xeb519(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 37u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xe8e68(%rip), %r12 # 0x19a498
movq 0xe8e61(%rip), %rsi # 0x19a498
movq 0xe8e62(%rip), %rdx # 0x19a4a0
movq 0xe89ab(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 20u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xe69bc(%rip), %r15 # 0x19a498
movq 0xe69b5(%rip), %rsi # 0x19a498
movq 0xe69b6(%rip), %rdx # 0x19a4a0
movq 0xe64ff(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 42u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xe4d40(%rip), %r12 # 0x19a498
movq 0xe4d39(%rip), %rsi # 0x19a498
movq 0xe4d3a(%rip), %rdx # 0x19a4a0
movq 0xe4883(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 45u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xe2888(%rip), %r12 # 0x19a498
movq 0xe2881(%rip), %rsi # 0x19a498
movq 0xe2882(%rip), %rdx # 0x19a4a0
movq 0xe23cb(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 24u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xdf810(%rip), %r15 # 0x19a498
movq 0xdf809(%rip), %rsi # 0x19a498
movq 0xdf80a(%rip), %rdx # 0x19a4a0
movq 0xdf353(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 51u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xdd358(%rip), %r12 # 0x19a498
movq 0xdd351(%rip), %rsi # 0x19a498
movq 0xdd352(%rip), %rdx # 0x19a4a0
movq 0xdce9b(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 15u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xd982c(%rip), %r15 # 0x19a498
movq 0xd9825(%rip), %rsi # 0x19a498
movq 0xd9826(%rip), %rdx # 0x19a4a0
movq 0xd936f(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<64u, 61u, buffer_layout_dfs>::operator()(std::array<Stream, 64ul>&, unsigned char**, std::array<unsigned long, 64ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xd50fc(%rip), %r12 # 0x19a498
movq 0xd50f5(%rip), %rsi # 0x19a498
movq 0xd50f6(%rip), %rdx # 0x19a4a0
movq 0xd4c3f(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 9u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xd1aea(%rip), %r15 # 0x19a498
movq 0xd1ae3(%rip), %rsi # 0x19a498
movq 0xd1ae4(%rip), %rdx # 0x19a4a0
movq 0xd162d(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 68u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xcd1f6(%rip), %r12 # 0x19a498
movq 0xcd1ef(%rip), %rsi # 0x19a498
movq 0xcd1f0(%rip), %rdx # 0x19a4a0
movq 0xccd39(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 19u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xcaafc(%rip), %r15 # 0x19a498
movq 0xcaaf5(%rip), %rsi # 0x19a498
movq 0xcaaf6(%rip), %rdx # 0x19a4a0
movq 0xca63f(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 77u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xc63be(%rip), %r12 # 0x19a498
movq 0xc63b7(%rip), %rsi # 0x19a498
movq 0xc63b8(%rip), %rdx # 0x19a4a0
movq 0xc5f01(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 40u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xc3306(%rip), %r15 # 0x19a498
movq 0xc32ff(%rip), %rsi # 0x19a498
movq 0xc3300(%rip), %rdx # 0x19a4a0
movq 0xc2e49(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 80u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xc2702(%rip), %r12 # 0x19a498
movq 0xc26fb(%rip), %rsi # 0x19a498
movq 0xc26fc(%rip), %rdx # 0x19a4a0
movq 0xc2245(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 43u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xc0010(%rip), %r15 # 0x19a498
movq 0xc0009(%rip), %rsi # 0x19a498
movq 0xc000a(%rip), %rdx # 0x19a4a0
movq 0xbfb53(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 22u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xbd91e(%rip), %r15 # 0x19a498
movq 0xbd917(%rip), %rsi # 0x19a498
movq 0xbd918(%rip), %rdx # 0x19a4a0
movq 0xbd461(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 92u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xb9412(%rip), %r12 # 0x19a498
movq 0xb940b(%rip), %rsi # 0x19a498
movq 0xb940c(%rip), %rdx # 0x19a4a0
movq 0xb8f55(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 7u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xb6d3c(%rip), %r15 # 0x19a498
movq 0xb6d35(%rip), %rsi # 0x19a498
movq 0xb6d36(%rip), %rdx # 0x19a4a0
movq 0xb687f(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 48u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xb4f52(%rip), %r15 # 0x19a498
movq 0xb4f4b(%rip), %rsi # 0x19a498
movq 0xb4f4c(%rip), %rdx # 0x19a4a0
movq 0xb4a95(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 99u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xb2a9a(%rip), %r12 # 0x19a498
movq 0xb2a93(%rip), %rsi # 0x19a498
movq 0xb2a94(%rip), %rdx # 0x19a4a0
movq 0xb25dd(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 101u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xb0e1e(%rip), %r12 # 0x19a498
movq 0xb0e17(%rip), %rsi # 0x19a498
movq 0xb0e18(%rip), %rdx # 0x19a4a0
movq 0xb0961(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 26u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xaf56a(%rip), %r15 # 0x19a498
movq 0xaf563(%rip), %rsi # 0x19a498
movq 0xaf564(%rip), %rdx # 0x19a4a0
movq 0xaf0ad(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 53u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xae354(%rip), %r15 # 0x19a498
movq 0xae34d(%rip), %rsi # 0x19a498
movq 0xae34e(%rip), %rdx # 0x19a4a0
movq 0xade97(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 107u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xac49e(%rip), %r12 # 0x19a498
movq 0xac497(%rip), %rsi # 0x19a498
movq 0xac498(%rip), %rdx # 0x19a4a0
movq 0xabfe1(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 54u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xabc62(%rip), %r15 # 0x19a498
movq 0xabc5b(%rip), %rsi # 0x19a498
movq 0xabc5c(%rip), %rdx # 0x19a4a0
movq 0xab7a5(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 108u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xab05e(%rip), %r12 # 0x19a498
movq 0xab057(%rip), %rsi # 0x19a498
movq 0xab058(%rip), %rdx # 0x19a4a0
movq 0xaaba1(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 110u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xa9fe6(%rip), %r12 # 0x19a498
movq 0xa9fdf(%rip), %rsi # 0x19a498
movq 0xa9fe0(%rip), %rdx # 0x19a4a0
movq 0xa9b29(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 14u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xa8f6e(%rip), %r15 # 0x19a498
movq 0xa8f67(%rip), %rsi # 0x19a498
movq 0xa8f68(%rip), %rdx # 0x19a4a0
movq 0xa8ab1(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 28u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r12
movq %rsi, 0x20(%rsp)
leaq 0xa837e(%rip), %r15 # 0x19a498
movq 0xa8377(%rip), %rsi # 0x19a498
movq 0xa8378(%rip), %rdx # 0x19a4a0
movq 0xa7ec1(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
fill<128u, 114u, buffer_layout_dfs>::operator()(std::array<Stream, 128ul>&, unsigned char**, std::array<unsigned long, 128ul>&) const | void operator()(std::array<Stream,K>& restrict streams,
unsigned char** restrict buffer,
std::array<size_t,K>& restrict buffer_count) const
{
fill_inner<K,I,BufferLayout>(streams, buffer, buffer_count,
typename std::integral_constant<bool, (I>1 && I<K/2)>());
fill_leaf<K,I,B... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %r15
movq %rdx, 0x10(%rsp)
movq %rsi, %r14
leaq 0xa5aee(%rip), %r12 # 0x19a498
movq 0xa5ae7(%rip), %rsi # 0x19a498
movq 0xa5ae8(%rip), %rdx # 0x19a4a0
movq 0xa5631(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax... | /rantala[P]string-sorting/src/funnelsort.cpp |
void msd_lsd_adaptive<8u>(Cacheblock<8u>*, unsigned long, unsigned long) | static void
msd_lsd_adaptive(Cacheblock<CachedChars>* cache, size_t N, size_t depth)
{
static_assert(CachedChars%2==0, "CachedChars%2==0");
static_assert(CachedChars>=2, "CachedChars>=2");
if (N < 0x10000) {
msd_lsd(cache, N, depth);
return;
}
fill_cache(cache, N, depth);
for (int byte=CachedChars-1; byte >... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x80018, %rsp # imm = 0x80018
movq %rsi, %r12
movq %rdi, %rcx
leaq 0x29a3a3(%rip), %rbx # 0x39b4f0
cmpq $0xffff, %r12 # imm = 0xFFFF
jbe 0x1012f3
movq %rcx, %rdi
movq %r12, %rsi
movq %rdx, 0x8(%rsp)
movq %rcx, %r14
callq 0x100... | /rantala[P]string-sorting/src/msd_lsd.cpp |
msd_CE2_16bit(unsigned char**, unsigned long, unsigned long) | void
msd_CE2_16bit(unsigned char** strings, size_t n, size_t depth)
{
if (n < 32) {
insertion_sort(strings, n, depth);
return;
}
uint16_t bucketsize[256] = {0};
unsigned char* restrict oracle =
(unsigned char*) malloc(n);
for (size_t i=0; i < n; ++i)
oracle[i] = strings[i][depth];
for (size_t i=0; i < n; ... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x408, %rsp # imm = 0x408
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
cmpq $0x1f, %rsi
ja 0x101c72
cmpq $0x2, %r15
jl 0x101d70
leaq 0x1(%rbx), %rax
movq %r14, %rcx
movl %r15d, %edx
leal -0x1(%rdx), %r15d
movq 0x8(%rcx), %rsi
addq $0x... | /rantala[P]string-sorting/src/msd_ce.cpp |
msd_CE6(unsigned char**, unsigned long, unsigned long, unsigned short*, unsigned char**) | static void
msd_CE6(unsigned char** strings, size_t n, size_t depth,
uint16_t* oracle, unsigned char** sorted)
{
if (n < 0x10000) {
msd_CE2_16bit_5(strings, n, depth, (unsigned char*)oracle, sorted);
return;
}
{
size_t i;
for (i=0; i < n-n%2; i+=2) {
unsigned char* str1 = strings[i];
unsigned char* s... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %r8, %rbx
movq %rcx, %r14
movq %rdx, %r15
movq %rsi, %r13
movq %rdi, %r12
cmpq $0x10000, %rsi # imm = 0x10000
jae 0x10235a
movq %r12, %rdi
movq %r13, %rsi
movq %r15, %rdx
movq %r14, %rcx
movq %rbx, %r8
addq $0x18, %rsp
popq... | /rantala[P]string-sorting/src/msd_ce.cpp |
msd_CE7_register_hook() | static void
msd_CE8_(unsigned char** strings, size_t n, size_t depth,
uint16_t* restrict oracle, unsigned char** sorted)
{
if (n < 0x10000) {
msd_CE2_16bit_5(strings, n, depth, (unsigned char*)oracle, sorted);
return;
}
{
size_t i;
for (i=0; i < n-n%2; i+=2) {
__builtin_prefetch(&strings[i+2][depth]);
... | leaq 0x9652f(%rip), %rdi # 0x198d10
jmp 0x14ec4c
| /rantala[P]string-sorting/src/msd_ce.cpp |
void msd_D<std::vector<unsigned char*, std::allocator<unsigned char*>>, unsigned long>(unsigned char**, unsigned long, unsigned long, std::vector<unsigned char*, std::allocator<unsigned char*>>*) | static void
msd_D(unsigned char** strings, size_t n, size_t depth, Bucket* buckets)
{
if (n < 32) {
insertion_sort(strings, n, depth);
return;
}
// Use a small cache to reduce memory stalls.
size_t i=0;
for (; i < n-n%32; i+=32) {
unsigned char cache[32];
for (unsigned j=0; j < 32; ++j) {
cache[j] = str... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x828, %rsp # imm = 0x828
movq %rdx, %rbx
cmpq $0x20, %rsi
jae 0x103d17
cmpq $0x2, %rsi
jl 0x103eb7
leaq 0x1(%rbx), %rax
movq %rdi, %rcx
movl %esi, %edx
leal -0x1(%rdx), %esi
movq 0x8(%rcx), %r15
addq $0x8, %rcx
movq %rcx, %r14
cmpq %rdi... | /rantala[P]string-sorting/src/msd_dyn_vector.cpp |
void msd_D_adaptive<vector_realloc_shrink_clear<unsigned char*, 16u>>(unsigned char**, unsigned long, unsigned long, vector_realloc_shrink_clear<unsigned char*, 16u>*) | static void
msd_D_adaptive(unsigned char** strings, size_t n, size_t depth, Bucket* buckets)
{
if (n < 0x10000) {
msd_D<Bucket, uint16_t>(strings, n, depth, buckets);
return;
}
size_t* bucketsize = (size_t*) malloc(0x10000 * sizeof(size_t));
size_t i=0;
for (; i < n-n%16; i+=16) {
uint16_t cache[16];
for (... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
cmpq $0xffff, %rsi # imm = 0xFFFF
ja 0x106775
movq %r12, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %rbx, %rcx
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %... | /rantala[P]string-sorting/src/msd_dyn_vector.cpp |
void msd_D_adaptive<vector_block<unsigned char*, 1024u>>(unsigned char**, unsigned long, unsigned long, vector_block<unsigned char*, 1024u>*) | static void
msd_D_adaptive(unsigned char** strings, size_t n, size_t depth, Bucket* buckets)
{
if (n < 0x10000) {
msd_D<Bucket, uint16_t>(strings, n, depth, buckets);
return;
}
size_t* bucketsize = (size_t*) malloc(0x10000 * sizeof(size_t));
size_t i=0;
for (; i < n-n%16; i+=16) {
uint16_t cache[16];
for (... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
cmpq $0xffff, %rsi # imm = 0xFFFF
ja 0x106d74
movq %r12, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %rbx, %rcx
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %... | /rantala[P]string-sorting/src/msd_dyn_vector.cpp |
void msd_D<vector_brodnik<unsigned char*>, unsigned short>(unsigned char**, unsigned long, unsigned long, vector_brodnik<unsigned char*>*) | static void
msd_D(unsigned char** strings, size_t n, size_t depth, Bucket* buckets)
{
if (n < 32) {
insertion_sort(strings, n, depth);
return;
}
// Use a small cache to reduce memory stalls.
size_t i=0;
for (; i < n-n%32; i+=32) {
unsigned char cache[32];
for (unsigned j=0; j < 32; ++j) {
cache[j] = str... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x248, %rsp # imm = 0x248
movq %rdx, %r15
movq %rsi, %rbp
cmpq $0x20, %rsi
jae 0x1093af
cmpq $0x2, %rbp
jl 0x109658
leaq 0x1(%r15), %rax
movq %rdi, %rcx
movl %ebp, %edx
leal -0x1(%rdx), %ebp
movq 0x8(%rcx), %rsi
addq $0x8, %rcx
movq %rcx... | /rantala[P]string-sorting/src/msd_dyn_vector.cpp |
vector_bagwell<unsigned char*, 16u>::~vector_bagwell() | ~vector_bagwell()
{
for (unsigned i=0; i < _index_block.size(); ++i)
free(_index_block[i]);
} | pushq %rbp
pushq %rbx
pushq %rax
movq %rdi, %rbx
movq (%rdi), %rdi
cmpq %rdi, 0x8(%rbx)
je 0x1099f2
movl $0x1, %ebp
xorl %eax, %eax
movq (%rdi,%rax,8), %rdi
callq 0x1c380
movl %ebp, %eax
movq (%rbx), %rdi
movq 0x8(%rbx), %rcx
subq %rdi, %rcx
sarq $0x3, %rcx
incl %ebp
cmpq %rax, %rcx
ja 0x1099d2
addq $0x8, %rsp
testq %r... | /rantala[P]string-sorting/src/vector_bagwell.h |
vector_realloc_counter_clear<unsigned char*, 16u>::push_back(unsigned char* const&) | void push_back(const T& t)
{
if (_size == _capacity) { grow(); }
_data[_size] = t;
++_size;
} | pushq %r14
pushq %rbx
pushq %rax
movq %rsi, %r14
movq %rdi, %rbx
movq 0x10(%rdi), %rax
cmpq %rax, 0x8(%rdi)
jne 0x10a13d
addq %rax, %rax
movl $0x10, %esi
cmovneq %rax, %rsi
movq %rsi, 0x10(%rbx)
movq (%rbx), %rdi
shlq $0x3, %rsi
callq 0x1c4e0
movq %rax, (%rbx)
movq (%r14), %rax
movq (%rbx), %rcx
movq 0x8(%rbx), %rdx
mo... | /rantala[P]string-sorting/src/vector_realloc.h |
vector_block<unsigned char*, 1024u>::clear() | void clear()
{
for (size_t i=0; i < _index_block.size(); ++i) {
free(_index_block[i]);
}
_index_block.clear();
_insertpos=0;
_left_in_block=0;
} | pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
cmpq %rax, %rcx
je 0x10a2b4
xorl %r14d, %r14d
movq (%rax,%r14,8), %rdi
callq 0x1c380
incq %r14
movq (%rbx), %rax
movq 0x8(%rbx), %rcx
movq %rcx, %rdx
subq %rax, %rdx
sarq $0x3, %rdx
cmpq %rdx, %r14
jb 0x10a292
cmpq %rax, %rcx
je 0x1... | /rantala[P]string-sorting/src/vector_block.h |
void insert<16000u, vector_bagwell<unsigned char*, 16u>, BurstSimple<unsigned char>, unsigned char>(TrieNode<unsigned char>*, unsigned char**, unsigned long) | static inline void
insert(TrieNode<CharT>* root, unsigned char** strings, size_t n)
{
for (size_t i=0; i < n; ++i) {
unsigned char* str = strings[i];
size_t depth = 0;
CharT c = get_char<CharT>(str, 0);
TrieNode<CharT>* node = root;
while (node->is_trie[c]) {
assert(not is_end(c));
node = static_cast<T... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, 0x18(%rsp)
movq %rdx, 0x10(%rsp)
testq %rdx, %rdx
je 0x10ae12
xorl %esi, %esi
movq %rdi, 0x8(%rsp)
movq 0x18(%rsp), %rax
movq (%rax,%rsi,8), %rax
movq %rax, 0x30(%rsp)
testq %rax, %rax
je 0x10ae40
movzbl (%rax), %r12d
movl %r1... | /rantala[P]string-sorting/src/burstsort.cpp |
burstsort_vector_block(unsigned char**, unsigned long) | void burstsort_vector_block(unsigned char** strings, size_t n)
{
typedef unsigned char CharT;
typedef vector_block<unsigned char*> BucketT;
typedef BurstSimple<CharT> BurstImpl;
//typedef BurstRecursive<CharT> BurstImpl;
TrieNode<CharT>* root = new TrieNode<CharT>;
insert<16000, BucketT, BurstImpl>(root, strings,... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, %rbx
movq %rdi, 0x8(%rsp)
movl $0x820, %edi # imm = 0x820
callq 0x1c300
movq %rax, %r15
movl $0x820, %edx # imm = 0x820
movq %rax, %rdi
xorl %esi, %esi
callq 0x1c180
movq %rbx, 0x18(%rsp)
testq %rbx, %rbx... | /rantala[P]string-sorting/src/burstsort.cpp |
burstsort_sampling_superalphabet_vector_block(unsigned char**, unsigned long) | void burstsort_sampling_superalphabet_vector_block(unsigned char** strings, size_t n)
{
typedef uint16_t CharT;
typedef vector_block<unsigned char*, 128> BucketT;
typedef BurstSimple<CharT> BurstImpl;
//typedef BurstRecursive<CharT> BurstImpl;
TrieNode<CharT>* root = pseudo_sample<CharT>(strings, n);
insert<32000... | pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
callq 0x10c927
movq %rax, %r15
movq %rax, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x10be0a
movq %r15, %rdi
movq %r14, %rsi
xorl %edx, %edx
popq %rbx
popq %r14
popq %r15
jmp 0x10bfd3
| /rantala[P]string-sorting/src/burstsort.cpp |
TrieNode<unsigned char>* BurstSimple<unsigned char>::operator()<vector_block<unsigned char*, 1024u>>(vector_block<unsigned char*, 1024u> const&, unsigned long) const | TrieNode<CharT>*
operator()(const BucketT& bucket, size_t depth) const
{
TrieNode<CharT>* new_node = new TrieNode<CharT>;
const unsigned bucket_size = bucket.size();
// Use a small cache to reduce memory stalls. Also cache the
// string pointers, in case the indexing operation of the
// container is expensi... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x258, %rsp # imm = 0x258
movq %rdx, %rbx
movq %rsi, %r14
movl $0x820, %edi # imm = 0x820
callq 0x1c300
movq %rax, %r15
xorl %r13d, %r13d
movl $0x820, %edx # imm = 0x820
movq %rax, %rdi
xorl %esi, %esi
callq 0x1c180... | /rantala[P]string-sorting/src/burstsort.cpp |
burstsort2_vector(unsigned char**, unsigned long) | void burstsort2_vector(unsigned char** strings, size_t n)
{
typedef unsigned char CharT;
typedef std::vector<unsigned char*> BucketT;
typedef BurstSimple<CharT> BurstImpl;
TrieNode<CharT, BucketT>* root = new TrieNode<CharT, BucketT>;
insert<8192, BucketT, BurstImpl>(root, strings, n);
traverse(root, strings, 0, ... | pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movl $0x18, %edi
callq 0x1c300
movq %rax, %r15
xorps %xmm0, %xmm0
movups %xmm0, (%rax)
movq $0x0, 0x10(%rax)
movq %rax, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x10dff2
movq %r15, %rdi
movq %r14, %rsi
xorl %edx, %edx
popq %rbx
popq %r14
popq %r15
jmp 0... | /rantala[P]string-sorting/src/burstsort2.cpp |
unsigned char** traverse<void (*)(unsigned char**, int, int), vector_brodnik<unsigned char*>, unsigned char>(TrieNode<unsigned char, vector_brodnik<unsigned char*>>*, unsigned char**, unsigned long, void (*)(unsigned char**, int, int)) | static unsigned char**
traverse(TrieNode<CharT, BucketT>* node,
unsigned char** dst,
size_t depth,
SmallSort small_sort)
{
for (unsigned i=0; i < node->_buckets.size(); ++i) {
if (node->is_trie(i)) {
dst = traverse(node->get_node(i),
dst, depth+sizeof(CharT), small_sort);
} else {... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rsi, %r14
movq %rdi, %rbx
movq (%rdi), %rdi
cmpq %rdi, 0x8(%rbx)
je 0x10e6d7
movq %rdx, %r15
leaq 0x1(%rdx), %rax
movq %rax, 0x38(%rsp)
xorl %r12d, %r12d
movq %rbx, 0x30(%rsp)
movq %rdx, 0x10(%rsp)
testb $0x1, (%rdi,%r12,8)
jne 0x1... | /rantala[P]string-sorting/src/burstsort2.cpp |
unsigned char** traverse<void (*)(unsigned char**, int, int), std::vector<unsigned char*, std::allocator<unsigned char*>>, unsigned short>(TrieNode<unsigned short, std::vector<unsigned char*, std::allocator<unsigned char*>>>*, unsigned char**, unsigned long, void (*)(unsigned char**, int, int)) | static unsigned char**
traverse(TrieNode<CharT, BucketT>* node,
unsigned char** dst,
size_t depth,
SmallSort small_sort)
{
for (unsigned i=0; i < node->_buckets.size(); ++i) {
if (node->is_trie(i)) {
dst = traverse(node->get_node(i),
dst, depth+sizeof(CharT), small_sort);
} else {... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
movq (%rdi), %rdi
cmpq %rdi, 0x8(%r14)
je 0x10f148
movq %rdx, (%rsp)
leaq 0x2(%rdx), %r12
xorl %r13d, %r13d
testb $0x1, (%rdi,%r13,8)
jne 0x10f112
movq (%rdi,%r13,8), %rbp
testq %rbp, %rbp
je 0x10f12e
movq (%rbp... | /rantala[P]string-sorting/src/burstsort2.cpp |
burstsort2_superalphabet_bagwell(unsigned char**, unsigned long) | void burstsort2_superalphabet_bagwell(unsigned char** strings, size_t n)
{
typedef uint16_t CharT;
typedef vector_bagwell<unsigned char*> BucketT;
typedef BurstSimple<CharT> BurstImpl;
TrieNode<CharT, BucketT>* root = new TrieNode<CharT, BucketT>;
insert<32768, BucketT, BurstImpl>(root, strings, n);
traverse(root... | pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movl $0x18, %edi
callq 0x1c300
movq %rax, %r15
xorps %xmm0, %xmm0
movups %xmm0, (%rax)
movq $0x0, 0x10(%rax)
movq %rax, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x10f626
movq %r15, %rdi
movq %r14, %rsi
xorl %edx, %edx
popq %rbx
popq %r14
popq %r15
jmp 0... | /rantala[P]string-sorting/src/burstsort2.cpp |
void insert<32768u, vector_block<unsigned char*, 128u>, BurstSimple<unsigned short>, unsigned short>(TrieNode<unsigned short, vector_block<unsigned char*, 128u>>*, unsigned char**, unsigned long) | static inline void
insert(TrieNode<CharT, BucketT>* root, unsigned char** strings, size_t n)
{
for (size_t i=0; i < n; ++i) {
unsigned char* str = strings[i];
size_t depth = 0;
CharT c = get_char<CharT>(str, 0);
TrieNode<CharT, BucketT>* node = root;
while (node->is_trie(c)) {
assert(not is_end(c));
no... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rsi, 0x20(%rsp)
movq %rdx, 0x18(%rsp)
testq %rdx, %rdx
je 0x10fb95
movq %rdi, %r15
xorl %r14d, %r14d
movq 0x20(%rsp), %rax
movq (%rax,%r14,8), %rax
movq %rax, 0x10(%rsp)
testq %rax, %rax
je 0x10fba4
movzbl (%rax), %ecx
testw %cx, %... | /rantala[P]string-sorting/src/burstsort2.cpp |
unsigned char** traverse<void (*)(unsigned char**, int, int), vector_block<unsigned char*, 128u>, unsigned char>(TrieNode<unsigned char, vector_block<unsigned char*, 128u>>*, unsigned char**, unsigned long, void (*)(unsigned char**, int, int)) | static unsigned char**
traverse(TrieNode<CharT, BucketT>* node,
unsigned char** dst,
size_t depth,
SmallSort small_sort)
{
for (unsigned i=0; i < node->_buckets.size(); ++i) {
if (node->is_trie(i)) {
dst = traverse(node->get_node(i),
dst, depth+sizeof(CharT), small_sort);
} else {... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movq (%rdi), %rdi
cmpq %rdi, 0x8(%r14)
je 0x11096c
movq %rdx, 0x10(%rsp)
leaq 0x1(%rdx), %rax
movq %rax, 0x18(%rsp)
xorl %r13d, %r13d
testb $0x1, (%rdi,%r13,8)
jne 0x110934
movq (%rdi,%r13,8), %rbp
testq %... | /rantala[P]string-sorting/src/burstsort2.cpp |
burstsort2_sampling_superalphabet_vector_block(unsigned char**, unsigned long) | void burstsort2_sampling_superalphabet_vector_block(unsigned char** strings, size_t n)
{
typedef uint16_t CharT;
typedef vector_block<unsigned char*, 128> BucketT;
typedef BurstSimple<CharT> BurstImpl;
TrieNode<CharT, BucketT>* root = pseudo_sample<CharT, BucketT>(strings, n);
insert<32768, BucketT, BurstImpl>(roo... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rdi, 0x10(%rsp)
movq 0x9992db(%rip), %rsi # 0xaaa560
movq 0x9992dc(%rip), %rdx # 0xaaa568
movq 0x88d5d(%rip), %rdi # 0x199ff0
callq 0x1c350
movq %rax, %r15
leaq 0x5228a(%rip), %rsi # 0x16352c
movl $0xd... | /rantala[P]string-sorting/src/burstsort2.cpp |
TrieNode<unsigned char, vector_brodnik<unsigned char*>>::get_node(unsigned int) const | bool is_trie(unsigned index) const
{
static_assert(sizeof(size_t)==sizeof(void*),
"size_t and void* size must match");
if (index < _buckets.size()) {return size_t(_buckets[index])&1;}
return false;
} | movl %esi, %eax
movq (%rdi), %rcx
movq 0x8(%rdi), %rdx
subq %rcx, %rdx
sarq $0x3, %rdx
cmpq %rax, %rdx
jbe 0x1119bd
testb $0x1, (%rcx,%rax,8)
je 0x1119bd
movq (%rcx,%rax,8), %rax
decq %rax
retq
pushq %rax
leaq 0x522b0(%rip), %rdi # 0x163c75
leaq 0x5218e(%rip), %rsi # 0x163b5a
leaq 0x524fd(%rip), %rcx # 0x16... | /rantala[P]string-sorting/src/burstsort2.cpp |
TrieNode<unsigned char, vector_block<unsigned char*, 1024u>>* BurstSimple<unsigned char>::operator()<vector_block<unsigned char*, 1024u>>(vector_block<unsigned char*, 1024u> const&, unsigned long) const | TrieNode<CharT, BucketT>*
operator()(const BucketT& bucket, size_t depth) const
{
TrieNode<CharT, BucketT>* new_node = new TrieNode<CharT, BucketT>;
const unsigned bucket_size = bucket.size();
// Use a small cache to reduce memory stalls. Also cache the
// string pointers, in case the indexing operation of th... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x258, %rsp # imm = 0x258
movq %rdx, %rbx
movq %rsi, %r14
movl $0x18, %edi
callq 0x1c300
movq %rax, %r15
xorps %xmm0, %xmm0
movups %xmm0, (%rax)
movq $0x0, 0x10(%rax)
movl 0x8(%r14), %ecx
subl (%r14), %ecx
shll $0x7, %ecx
subl 0x20(%r14)... | /rantala[P]string-sorting/src/burstsort2.cpp |
TSTNode<unsigned short>* BurstSimple<unsigned short>::operator()<std::vector<unsigned char*, std::allocator<unsigned char*>>>(std::vector<unsigned char*, std::allocator<unsigned char*>> const&, unsigned short*, unsigned long) const | TSTNode<CharT>*
operator()(const BucketT& bucket, CharT* oracle, size_t /*depth*/) const
{
TSTNode<CharT>* new_node = new TSTNode<CharT>;
BucketT* bucket0 = new BucketT;
BucketT* bucket1 = new BucketT;
BucketT* bucket2 = new BucketT;
CharT pivot = pseudo_median(oracle, oracle+bucket.size());
for (unsigned... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdx, %r13
movq %rsi, %rbp
movl $0x28, %edi
callq 0x1c300
xorps %xmm0, %xmm0
movups %xmm0, (%rax)
movq %rax, 0x10(%rsp)
movups %xmm0, 0x10(%rax)
movl $0x18, %edi
callq 0x1c300
movq %rax, %r12
xorps %xmm0, %xmm0
movups %xmm0, (%rax)
... | /rantala[P]string-sorting/src/burstsort_mkq.cpp |
void multikey_simd_b<unsigned char>(unsigned char**, unsigned long, unsigned long, unsigned char**, unsigned char*) | static void
multikey_simd_b(unsigned char** strings, size_t N, size_t depth,
unsigned char** restrict sorted, uint8_t* restrict oracle)
{
if (N < 32) {
insertion_sort(strings, N, depth);
return;
}
CharT partval = pseudo_median<CharT>(strings, N, depth);
std::array<size_t, 3> bucketsize;
bucketsize.fill(0);
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %r8, %r13
movq %rcx, %rbp
movq %rdx, %rbx
movq %rsi, %r12
movq %rdi, %r14
movl $0x80, %eax
movd %eax, %xmm0
movdqa %xmm0, 0x60(%rsp)
leaq 0x1(%rdx), %rax
movq %rax, 0x8(%rsp)
cmpq $0x1f, %r12
jbe 0x1195cb
movq %r14, %rdi
movq %r12, ... | /rantala[P]string-sorting/src/multikey_simd.cpp |
void multikey_block<1024u, unsigned short>(unsigned char**, unsigned long, unsigned long) | static void
multikey_block(unsigned char** strings, size_t n, size_t depth)
{
if (n < 10000) {
mkqsort(strings, n, depth);
return;
}
assert(n > B);
static Buckets buckets;
static std::array<unsigned char*, 32*B> temp_space;
static FreeBlocks freeblocks;
const CharT partval = pseudo_median<CharT>(strings, n, ... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xd8, %rsp
movq %rdx, %rbp
movq %rsi, %r12
movq %rdi, %r15
cmpq $0x270f, %rsi # imm = 0x270F
ja 0x120807
movq %r15, %rdi
movl %r12d, %esi
movl %ebp, %edx
addq $0xd8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x1... | /rantala[P]string-sorting/src/multikey_block.cpp |
void multikey_multipivot<unsigned int, 32u>(unsigned char**, unsigned long, unsigned long) | static void
multikey_multipivot(unsigned char** strings, size_t n, size_t depth)
{
static_assert(Pivots > 0, "Pivots must be non-zero");
static_assert(total_buckets(Pivots) < 0x100, "total number of bucket must be max 255");
if (n < 15000) {
mkqsort(strings, n, depth);
return;
}
// TODO: collect frequencies to... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x318, %rsp # imm = 0x318
movq %rdx, %rbx
movq %rdi, %r15
cmpq $0x3a97, %rsi # imm = 0x3A97
ja 0x122a9e
movq %r15, %rdi
movl %ebx, %edx
addq $0x318, %rsp # imm = 0x318
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r1... | /rantala[P]string-sorting/src/multikey_multipivot.cpp |
multikey_cache8(unsigned char**, unsigned long) | void multikey_cache8(unsigned char** strings, size_t n)
{ multikey_cache<8>(strings, n, 0); } | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r15
movq %rsi, %rdi
shlq $0x4, %rdi
callq 0x1c3f0
movq %rax, %r14
testq %rbx, %rbx
je 0x123ec6
leaq 0x8(%r14), %rax
xorl %ecx, %ecx
movq (%r15,%rcx,8), %rdx
movq %rdx, (%rax)
incq %rcx
addq $0x10, %rax
cmpq %rcx, %rbx
jne 0x123e87
xorl %... | /rantala[P]string-sorting/src/multikey_cache.cpp |
void multikey_cache<8u, true>(Cacheblock<8u>*, unsigned long, unsigned long) | static void
multikey_cache(Cacheblock<CachedChars>* cache, size_t N, size_t depth)
{
if (N < 32) {
if (N==0) return;
if (CacheDirty) {
insertion_sort(cache, N, depth);
return;
}
inssort_cache_block(cache, N);
size_t start=0, cnt=1;
for (size_t i=0; i < N-1; ++i) {
if (Cmp()(cache[i], cache[i+1]) =... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
leaq 0x1(%rdx), %r10
cmpq $0x20, %r15
jb 0x124c45
movq %r10, 0x10(%rsp)
xorl %eax, %eax
movq %rax, %rdx
shlq $0x4, %rdx
leaq (%r14,%rdx), %rdi
addq $0x8, %rdi
movl $0x40, %ecx
movq %rbx, %r... | /rantala[P]string-sorting/src/multikey_cache.cpp |
Subsets and Splits
SQL Console for LLM4Binary/decompile-bench
Filters out entries with file names ending in .cpp, providing a basic subset of the dataset that excludes C++ files.